Sebastian Seibert

Publication Activity (10 Years)

Years Active: 1991-2013
Publications (10 Years): 0

Top Venues

CIAC

University of Kiel, Germany (PHD)

Education History

University of Kiel, Germany

PHD

Publications

Sebastian Seibert, Andreas Sprock, Walter Unger
Advice Complexity of the Online Coloring Problem. CIAC (2013)
Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych
Reoptimization of the Shortest Common Superstring Problem. Algorithmica 61 (2) (2011)
Xavier Muñoz, Sebastian Seibert, Walter Unger
The Minimal Manhattan Network Problem in Three Dimensions. WALCOM (2009)
Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych
Reoptimization of the Shortest Common Superstring Problem. CPM (2009)
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On k-connectivity problems with sharpened triangle inequality. J. Discrete Algorithms 6 (4) (2008)
Ira Assent, Sebastian Seibert
An upper bound for transforming self-verifying automata into deterministic ones. RAIRO Theor. Informatics Appl. 41 (3) (2007)
Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert
On the Stability of Approximation for Hamiltonian Path Problems. Algorithmic Oper. Res. 1 (1) (2006)
Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert
On the Stability of Approximation for Hamiltonian Path Problems. SOFSEM (2005)
Sebastian Seibert, Walter Unger
A 1.5-Approximation of the Minimal Manhattan Network Problem. ISAAC (2005)
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Theor. Comput. Sci. 326 (1-3) (2004)
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. CIAC (2003)
Mika Hirvensalo, Sebastian Seibert
Lower Bounds for Las Vegas Automata by Information Theory. RAIRO Theor. Informatics Appl. 37 (1) (2003)
Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger
Communication Complexity Method for Measuring Nondeterminism in Finite Automata. Inf. Comput. 172 (2) (2002)
Sebastian Seibert, Walter Unger
The hardness of placing street names in a Manhattan type map. Theor. Comput. Sci. 285 (1) (2002)
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. FSTTCS (2002)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Theor. Comput. Sci. 285 (1) (2002)
Sebastian Seibert
Efficient Transformations from Regular Expressions to Finite Automata. Developments in Language Theory (2002)
Juraj Hromkovic, Sebastian Seibert, Thomas Wilke
Translating Regular Expressions into Small -Free Nondeterministic Finite Automata. J. Comput. Syst. Sci. 62 (4) (2001)
Sebastian Seibert, Walter Unger
The Hardness of Placing Street Names in a Manhattan Type Map. CIAC (2000)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. STACS (2000)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. CIAC (2000)
Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert
Measures of Nondeterminism in Finite Automata. ICALP (2000)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
Approximation algorithms for the TSP with sharpened triangle inequality. Inf. Process. Lett. 75 (3) (2000)
Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert
Measures of Nondeterminism in Finite Automata Electron. Colloquium Comput. Complex. 7 (76) (2000)
Hans-Joachim Böckenhauer, Sebastian Seibert
Improved lower bounds on the approximability of the Traveling Salesman Problem. RAIRO Theor. Informatics Appl. 34 (3) (2000)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem Electron. Colloquium Comput. Complex. 6 (31) (1999)
Juraj Hromkovic, Sebastian Seibert, Thomas Wilke
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. STACS (1997)
Sebastian Seibert, Thomas Wilke
Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT. Lectures on Proof Verification and Approximation Algorithms (1997)
Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas
Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems. Inf. Comput. 125 (1) (1996)
Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas
Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems. STACS (1994)
Sebastian Seibert
Quantifier Hierarchies over Word Relations. CSL (1991)

Sebastian Seibert.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sebastian Seibert