Sebastian Seibert

发表

On k-Edge-Connectivity Problems with Sharpened Triangle Inequality

Guido Proietti, Juraj Hromkovic, Hans-Joachim Böckenhauer, 2003, CIAC.

An upper bound for transforming self-verifying automata into deterministic ones

Ira Assent, Sebastian Seibert, 2007, RAIRO Theor. Informatics Appl..

The Minimal Manhattan Network Problem in Three Dimensions

Sebastian Seibert, Walter Unger, Xavier Muñoz, 2009, WALCOM.

Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem

Juraj Hromkovic, Hans-Joachim Böckenhauer, Ralf Klasing, 2002, Theor. Comput. Sci..

Approximation algorithms for the TSP with sharpened triangle inequality

Juraj Hromkovic, Hans-Joachim Böckenhauer, Ralf Klasing, 2000, Inf. Process. Lett..

Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem

Juraj Hromkovic, Hans-Joachim Böckenhauer, Ralf Klasing, 2000, CIAC.

Stability of Approximation

Juraj Hromkovic, Hans-Joachim Böckenhauer, Sebastian Seibert, 2018, Handbook of Approximation Algorithms and Metaheuristics.

Advice Complexity of the Online Coloring Problem

Sebastian Seibert, Walter Unger, Andreas Sprock, 2013, CIAC.

Communication Complexity Method for Measuring Nondeterminism in Finite Automata

Hartmut Klauck, Juraj Hromkovic, Georg Schnitger, 2002, Inf. Comput..

Efficient Transformations from Regular Expressions to Finite Automata

Sebastian Seibert, 2002, Developments in Language Theory.

On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality

Guido Proietti, Juraj Hromkovic, Hans-Joachim Böckenhauer, 2002, Theor. Comput. Sci..

Stability of Approximation

Juraj Hromkovic, Hans-Joachim Böckenhauer, Sebastian Seibert, 2007, Handbook of Approximation Algorithms and Metaheuristics.

An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality

Juraj Hromkovic, Hans-Joachim Böckenhauer, Ralf Klasing, 2000, STACS.

Effektive Strategiekonstruktionen für Gale-Stewart-Spiele auf Transitionsgraphen

Sebastian Seibert, 1996 .

The hardness of placing street names in a Manhattan type map

Sebastian Seibert, Walter Unger, 2002, Theor. Comput. Sci..

A 1.5-Approximation of the Minimal Manhattan Network Problem

Sebastian Seibert, Walter Unger, 2005, ISAAC.

The hardness of placing street names in a Manhattan type map

Sebastian Seibert, Walter Unger, S. Seibert, 2000, Theor. Comput. Sci..

On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality

Guido Proietti, Juraj Hromkovic, Hans-Joachim Böckenhauer, 2004, Theor. Comput. Sci..

Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata

Thomas Wilke, Juraj Hromkovic, Sebastian Seibert, 1997, STACS.

Quantifier Hierarchies over Word Relations

Sebastian Seibert, 1991, CSL.

Measures of Nondeterminism in Finite Automata

Hartmut Klauck, Juraj Hromkovic, Georg Schnitger, 2000, ICALP.

Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata

Thomas Wilke, Juraj Hromkovic, Sebastian Seibert, 1997, STACS.

On k-connectivity problems with sharpened triangle inequality

Guido Proietti, Juraj Hromkovic, Hans-Joachim Böckenhauer, 2008, J. Discrete Algorithms.

Reoptimization of the Shortest Common Superstring Problem

Dennis Komm, Anna Zych, Davide Bilò, 2009, Algorithmica.

Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems

Antonio Restivo, Wolfgang Thomas, Dora Giammarresi, 1994, STACS.

Improved lower bounds on the approximability of the Traveling Salesman Problem

Hans-Joachim Böckenhauer, Sebastian Seibert, Hans-Joachim Böckenhauer, 2000, RAIRO Theor. Informatics Appl..

Developments in Language Theory

Sebastian Seibert, 2003, Lecture Notes in Computer Science.

Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems

Antonio Restivo, Wolfgang Thomas, Dora Giammarresi, 1996, Inf. Comput..

Lower Bounds for Las Vegas Automata by Information Theory

Mika Hirvensalo, Sebastian Seibert, 2003, RAIRO Theor. Informatics Appl..

Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT

Thomas Wilke, Sebastian Seibert, 1997, Lectures on Proof Verification and Approximation Algorithms.

Reoptimization of the Shortest Common Superstring Problem

Dennis Komm, Anna Zych, Davide Bilò, 2009, CPM.

On the Stability of Approximation for Hamiltonian Path Problems

Guido Proietti, Juraj Hromkovic, Sebastian Seibert, 2006, Algorithmic Oper. Res..

NONDETERMINISM VERSUS DETERMINISM OF FINITE AUTOMATA OVER DIRECTED ACYCLIC GRAPHS

Wolfgang Thomas, Sebastian Seibert, Andreas Potthoff, 1994 .

Advice Complexity of the Online Vertex Coloring Problem

Sebastian Seibert, Walter Unger, Andreas Sprock, 2012 .