Quantifier Hierarchies over Word Relations. - Sebastian Seibert (CSL, 1991)

Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems. - Dora Giammarresi; Antonio Restivo; Sebastian Seibert; Wolfgang Thomas (STACS, 1994)

Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems. - Dora Giammarresi; Antonio Restivo; Sebastian Seibert; Wolfgang Thomas (Inf. Comput., 1996)

Effektive Strategiekonstruktionen für Gale-Stewart-Spiele auf Transitionsgraphen. - Sebastian Seibert (1996)

Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT. - Sebastian Seibert; Thomas Wilke (Lectures on Proof Verification and Approximation Algorithms, 1997)

Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. - Juraj Hromkovic; Sebastian Seibert; Thomas Wilke (STACS, 1997)

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, 2000)

Measures of Nondeterminism in Finite Automata - Juraj Hromkovic; Juhani Karhumäki; Hartmut Klauck; Georg Schnitger; Sebastian Seibert (Electron. Colloquium Comput. Complex., 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., 2000)

Improved lower bounds on the approximability of the Traveling Salesman Problem. - Hans-Joachim Böckenhauer; Sebastian Seibert (RAIRO Theor. Informatics Appl., 2000)

Translating Regular Expressions into Small -Free Nondeterministic Finite Automata. - Juraj Hromkovic; Sebastian Seibert; Thomas Wilke (J. Comput. Syst. Sci., 2001)

Efficient Transformations from Regular Expressions to Finite Automata. - Sebastian Seibert (Developments in Language Theory, 2002)

Communication Complexity Method for Measuring Nondeterminism in Finite Automata. - Juraj Hromkovic; Sebastian Seibert; Juhani Karhumäki; Hartmut Klauck; Georg Schnitger (Inf. Comput., 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., 2002)

The hardness of placing street names in a Manhattan type map. - Sebastian Seibert; Walter Unger (Theor. Comput. Sci., 2002)

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, 2003)

Lower Bounds for Las Vegas Automata by Information Theory. - Mika Hirvensalo; Sebastian Seibert (RAIRO Theor. Informatics Appl., 2003)

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., 2004)

A 1.5-Approximation of the Minimal Manhattan Network Problem. - Sebastian Seibert; Walter Unger (ISAAC, 2005)

On the Stability of Approximation for Hamiltonian Path Problems. - Luca Forlizzi; Juraj Hromkovic; Guido Proietti; Sebastian Seibert (Algorithmic Oper. Res., 2006)

An upper bound for transforming self-verifying automata into deterministic ones. - Ira Assent; Sebastian Seibert (RAIRO Theor. Informatics Appl., 2007)

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

On k-connectivity problems with sharpened triangle inequality. - Hans-Joachim Böckenhauer; Dirk Bongartz; Juraj Hromkovic; Ralf Klasing; Guido Proietti; Sebastian Seibert; Walter Unger (J. Discrete Algorithms, 2008)

The Minimal Manhattan Network Problem in Three Dimensions. - Xavier Muñoz; Sebastian Seibert; Walter Unger (WALCOM, 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 (Algorithmica, 2011)

Advice Complexity of the Online Coloring Problem. - Sebastian Seibert; Andreas Sprock; Walter Unger (CIAC, 2013)

Stability of Approximation. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Sebastian Seibert (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)