Sebastian Seibert

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2013

Advice Complexity of the Online Coloring Problem.

[BibT_eX]

[DOI]

Andreas Sprock

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2011

Reoptimization of the Shortest Common Superstring Problem.

[BibT_eX]

[DOI]

Davide Bilò

Algorithmica, 2011

2009

The Minimal Manhattan Network Problem in Three Dimensions.

[BibT_eX]

[DOI]

Xavier Muñoz

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

2008

On k-connectivity problems with sharpened triangle inequality.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

2007

Stability of Approximation.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

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

[BibT_eX]

[DOI]

Ira Assent

RAIRO Theor. Informatics Appl., 2007

2006

On the Stability of Approximation for Hamiltonian Path Problems.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2006

2005

A 1.5-Approximation of the Minimal Manhattan Network Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

2003

Lower Bounds for Las Vegas Automata by Information Theory.

[BibT_eX]

[DOI]

Mika Hirvensalo

RAIRO Theor. Informatics Appl., 2003

On k-Edge-Connectivity Problems with Sharpened Triangle Inequality.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

The hardness of placing street names in a Manhattan type map.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Communication Complexity Method for Measuring Nondeterminism in Finite Automata.

[BibT_eX]

[DOI]

Inf. Comput., 2002

Efficient Transformations from Regular Expressions to Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001

Translating Regular Expressions into Small -Free Nondeterministic Finite Automata.

[BibT_eX]

[DOI]

Thomas Wilke

J. Comput. Syst. Sci., 2001

2000

Improved lower bounds on the approximability of the Traveling Salesman Problem.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2000

Approximation algorithms for the TSP with sharpened triangle inequality.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Measures of Nondeterminism in Finite Automata

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2000

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

[BibT_eX]

[DOI]

Proceedings of the STACS 2000, 2000

1997

Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata.

[BibT_eX]

[DOI]

Thomas Wilke

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT.

[BibT_eX]

[DOI]

Thomas Wilke

Proceedings of the Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, 1997

1996

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

[BibT_eX]

[DOI]

PhD thesis, 1996

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

[BibT_eX]

[DOI]

Inf. Comput., 1996

1994

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

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

1991

Quantifier Hierarchies over Word Relations.

[BibT_eX]

[DOI]