Sebastian Seibert

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