Demo Data from VLDB 2026 / reviewers in the wild / expert
Sebastian Seibert
dblp:72/6452
· DBLP profile ↗
21ranked-venue papers
5as first author
0since 2021 · last 2013
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 19 · 5 first-authorDatabases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
3 papers |
Computational complexity · 65% Automata and formal languages · 32% Logic in computer science · 3% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity › nondeterminism
nondeterminism measures |
0.1 | 2 | 2002 | Communication Complexity Method for Measuring Nondeterminism in Finite Automata · Inf. Comput. 2002 Measures of Nondeterminism in Finite Automata · ICALP 2000 |
Automata and formal languages
finite automata |
0.0 | 2 | 2002 | Measures of Nondeterminism in Finite Automata · ICALP 2000 Communication Complexity Method for Measuring Nondeterminism in Finite Automata · Inf. Comput. 2002 |
Computational complexity
communication complexity |
0.0 | 1 | 2002 | Communication Complexity Method for Measuring Nondeterminism in Finite Automata · Inf. Comput. 2002 |
Automata and formal languages › algebraic language theory
recognizability |
0.0 | 1 | 1996 | Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems · Inf. Comput. 1996 |
Computational complexity
nondeterminism |
0.0 | 1 | 2002 | Communication Complexity Method for Measuring Nondeterminism in Finite Automata · Inf. Comput. 2002 |
Logic in computer science
monadic second-order logic |
0.0 | 1 | 1996 | Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems · Inf. Comput. 1996 |
Methods — techniques the papers use, named apart from their topics
communication complexity · 0.0tiling systems · 0.0monadic second-order logic · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Advice Complexity of the Online Coloring Problem
Sebastian Seibert, Andreas Sprock, Walter Unger |
CIAC | 1 |
| 2011 | Reoptimization of the Shortest Common Superstring Problem
Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych |
Algorithmica | 6 |
| 2009 | Reoptimization of the Shortest Common Superstring Problem
Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych |
CPM | 6 |
| 2005 | A 1.5-Approximation of the Minimal Manhattan Network Problem
Sebastian Seibert, Walter Unger |
ISAAC | 1 |
| 2005 | On the Stability of Approximation for Hamiltonian Path Problems
Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert |
SOFSEM | 4 |
| 2004 | On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger |
Theor. Comput. Sci. | 6 |
| 2003 | On k-Edge-Connectivity Problems with Sharpened Triangle Inequality
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger |
CIAC | 6 |
| 2002 | Efficient Transformations from Regular Expressions to Finite Automata
Sebastian Seibert |
Developments in Language Theory | 1 |
| 2002 | On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger |
FSTTCS | 6 |
| 2002 | Communication Complexity Method for Measuring Nondeterminism in Finite Automata
Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger |
Inf. Comput. | 2 |
| 2002 | Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger |
Theor. Comput. Sci. | 4 |
| 2002 | The hardness of placing street names in a Manhattan type map
Sebastian Seibert, Walter Unger |
Theor. Comput. Sci. | 1 |
| 2001 | Translating Regular Expressions into Small -Free Nondeterministic Finite Automata
Juraj Hromkovic, Sebastian Seibert, Thomas Wilke |
J. Comput. Syst. Sci. | 2 |
| 2000 | Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger |
CIAC | 4 |
| 2000 | The Hardness of Placing Street Names in a Manhattan Type Map
Sebastian Seibert, Walter Unger |
CIAC | 1 |
| 2000 | Measures of Nondeterminism in Finite Automata
Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert |
ICALP | 5 |
| 2000 | An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger |
STACS | 4 |
| 2000 | Approximation algorithms for the TSP with sharpened triangle inequality
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger |
Inf. Process. Lett. | 4 |
| 1997 | Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata
Juraj Hromkovic, Sebastian Seibert, Thomas Wilke |
STACS | 2 |
| 1996 | Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems
Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas |
Inf. Comput. | 3 |
| 1994 | Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems
Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas |
STACS | 3 |