#### Filter Results:

#### Publication Year

1991

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger
- Inf. Comput.
- 2002

While deterministic finite automata seem to be well understood, surprisingly many important problems concerning nondeterministic finite automata (nfa's) remain open. One such problem area is the study of different measures of nondeterminism in finite automata and the estimation of the sizes of minimal nondeterministic finite automata. In this paper the… (More)

- Sebastian Seibert, Walter Unger
- ISAAC
- 2005

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

- Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas
- Inf. Comput.
- 1996

- Hans-Joachim Böckenhauer, Dirk Bongartz, +4 authors Walter Unger
- FSTTCS
- 2002

In this paper we investigate the problem of finding a 2-connected spanning subgraph of minimal cost in a complete and weighted graph G. This problem is known to be APX-hard, for both the edge and the vertex connectivity case. Here we prove that the APX-hardness still holds even if one restricts the edge costs to an interval [1, 1 + ε], for an arbitrary… (More)

- Juraj Hromkovic, Sebastian Seibert, Thomas Wilke
- J. Comput. Syst. Sci.
- 2001

It is proved that every regular expression of size n can be converted into an equivalent nondeterministic nite automaton (NFA) of size O(n(log n) 2) in polynomial time. The best previous conversions result in NFAs of worst case size (n 2). Moreover, the nonexistence of any linear conversion is proved: we give a language Ln described by a regular expression… (More)

The investigation of the possibility to eeciently compute approximations of hard optimization problems is one of the central and most fruitful areas of current algorithm and complexity theory. The aim of this paper is twofold. First, we introduce the notion of stability of approximation algorithms. This notion is shown to be of practical as well as of… (More)

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

- Davide Bilò, Hans-Joachim Böckenhauer, +4 authors Anna Zych
- Algorithmica
- 2009

A reoptimization problem describes the following scenario: Given an instance of an optimization problem together with an optimal solution for it, we want to find a good solution for a locally modified instance. In this paper, we deal with reoptimization variants of the shortest common superstring problem where the local modifications consist of adding or… (More)