Sebastian Seibert

741 total citations
14 papers, 176 citations indexed

About

Sebastian Seibert is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Industrial and Manufacturing Engineering. According to data from OpenAlex, Sebastian Seibert has authored 14 papers receiving a total of 176 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Computational Theory and Mathematics, 6 papers in Artificial Intelligence and 5 papers in Industrial and Manufacturing Engineering. Recurrent topics in Sebastian Seibert's work include semigroups and automata theory (7 papers), DNA and Biological Computing (4 papers) and Complexity and Algorithms in Graphs (4 papers). Sebastian Seibert is often cited by papers focused on semigroups and automata theory (7 papers), DNA and Biological Computing (4 papers) and Complexity and Algorithms in Graphs (4 papers). Sebastian Seibert collaborates with scholars based in Germany, Italy and Switzerland. Sebastian Seibert's co-authors include Juraj Hromkovič, Wolfgang Thomas, Hans-Joachim Böckenhauer, Thomas Wilke, Dora Giammarresi, Antonio Restivo, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger and Walter Unger and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Lecture notes in computer science.

In The Last Decade

Sebastian Seibert

14 papers receiving 161 citations

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
Sebastian Seibert 156 87 79 29 26 14 176
Shankara Narayanan Krishna 91 0.6× 51 0.6× 111 1.4× 4 0.1× 31 1.2× 45 179
Geevarghese Philip 158 1.0× 37 0.4× 17 0.2× 15 0.5× 54 2.1× 32 193
Edson N. Cáceres 32 0.2× 83 1.0× 31 0.4× 35 1.2× 52 2.0× 32 135
Irit Katriel 40 0.3× 31 0.4× 10 0.1× 32 1.1× 71 2.7× 15 113
Panos Rondogiannis 119 0.8× 130 1.5× 17 0.2× 3 0.1× 30 1.2× 41 172
Rogério Reis 129 0.8× 109 1.3× 72 0.9× 3 0.1× 8 0.3× 55 167
Somnath Sikdar 238 1.5× 36 0.4× 18 0.2× 7 0.2× 77 3.0× 23 264
Fahad Panolan 183 1.2× 14 0.2× 15 0.2× 16 0.6× 75 2.9× 57 205
H. C. M. Kleijn 205 1.3× 97 1.1× 101 1.3× 2 0.1× 27 1.0× 29 230
Eelko Penninkx 145 0.9× 16 0.2× 8 0.1× 10 0.3× 52 2.0× 6 159

Countries citing papers authored by Sebastian Seibert

Since Specialization
Citations

This map shows the geographic impact of Sebastian Seibert's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Sebastian Seibert with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sebastian Seibert more than expected).

Fields of papers citing papers by Sebastian Seibert

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Sebastian Seibert. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Sebastian Seibert. The network helps show where Sebastian Seibert may publish in the future.

Co-authorship network of co-authors of Sebastian Seibert

This figure shows the co-authorship network connecting the top 25 collaborators of Sebastian Seibert. A scholar is included among the top collaborators of Sebastian Seibert based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Sebastian Seibert. Sebastian Seibert is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

14 of 14 papers shown
1.
Seibert, Sebastian, et al.. (2012). Advice Complexity of the Online Vertex Coloring Problem. Repository for Publications and Research Data (ETH Zurich). 765. 1 indexed citations
2.
Bilò, Davide, Hans-Joachim Böckenhauer, Dennis Komm, et al.. (2010). Reoptimization of the Shortest Common Superstring Problem. Algorithmica. 61(2). 227–251. 6 indexed citations
3.
Böckenhauer, Hans-Joachim, Juraj Hromkovič, Ralf Klasing, et al.. (2008). On k-connectivity problems with sharpened triangle inequality. Journal of Discrete Algorithms. 6(4). 605–617. 4 indexed citations
4.
Assent, Ira & Sebastian Seibert. (2007). An upper bound for transforming self-verifying automata into deterministic ones. RAIRO - Theoretical Informatics and Applications. 41(3). 261–265. 3 indexed citations
5.
Forlizzi, Luca, Juraj Hromkovič, Guido Proietti, & Sebastian Seibert. (2005). On the Stability of Approximation for Hamiltonian Path Problems. Lecture notes in computer science. 1(1). 147–156. 5 indexed citations
6.
Böckenhauer, Hans-Joachim, et al.. (2004). On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Theoretical Computer Science. 326(1-3). 137–153. 2 indexed citations
7.
Hirvensalo, Mika & Sebastian Seibert. (2003). Lower Bounds for Las Vegas Automata by Information Theory. RAIRO - Theoretical Informatics and Applications. 37(1). 39–49. 2 indexed citations
8.
Hromkovič, Juraj, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, & Georg Schnitger. (2002). Communication Complexity Method for Measuring Nondeterminism in Finite Automata. Information and Computation. 172(2). 202–217. 34 indexed citations
9.
Seibert, Sebastian & Walter Unger. (2002). The hardness of placing street names in a Manhattan type map. Theoretical Computer Science. 285(1). 89–99. 1 indexed citations
10.
Hromkovič, Juraj, Sebastian Seibert, & Thomas Wilke. (2001). Translating Regular Expressions into Small ε-Free Nondeterministic Finite Automata. Journal of Computer and System Sciences. 62(4). 565–588. 35 indexed citations
11.
Böckenhauer, Hans-Joachim, Juraj Hromkovič, Ralf Klasing, Sebastian Seibert, & Walter Unger. (2000). Approximation algorithms for the TSP with sharpened triangle inequality. Information Processing Letters. 75(3). 133–138. 22 indexed citations
12.
Böckenhauer, Hans-Joachim & Sebastian Seibert. (2000). Improved Lower Bounds on the Approximability of the Traveling Salesman Problem. RAIRO - Theoretical Informatics and Applications. 34(3). 213–255. 11 indexed citations
13.
Giammarresi, Dora, Antonio Restivo, Sebastian Seibert, & Wolfgang Thomas. (1996). Monadic Second-Order Logic over Rectangular Pictures and Recognizability by Tiling Systems. Information and Computation. 125(1). 32–45. 38 indexed citations
14.
Seibert, Sebastian, et al.. (1994). Nondeterminism versus determinism of finite automata over directed acyclic graphs. Bulletin of the Belgian Mathematical Society - Simon Stevin. 1(2). 12 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Shankara Narayanan Krishna Breakdown of academic impact, for papers by Geevarghese Philip Breakdown of academic impact, for papers by Edson N. Cáceres Breakdown of academic impact, for papers by Irit Katriel Breakdown of academic impact, for papers by Panos Rondogiannis Breakdown of academic impact, for papers by Rogério Reis Breakdown of academic impact, for papers by Somnath Sikdar Breakdown of academic impact, for papers by Fahad Panolan Breakdown of academic impact, for papers by H. C. M. Kleijn Breakdown of academic impact, for papers by Eelko Penninkx
Rankless by CCL
2026