dblp.uni-trier.dewww.uni-trier.de

Sebastian Seibert Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
28EEDavide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych: Reoptimization of the Shortest Common Superstring Problem. CPM 2009: 78-91
27EEXavier Muñoz, Sebastian Seibert, Walter Unger: The Minimal Manhattan Network Problem in Three Dimensions. WALCOM 2009: 369-380
2008
26EEHans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger: On k-connectivity problems with sharpened triangle inequality. J. Discrete Algorithms 6(4): 605-617 (2008)
2006
25EELuca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert: On the Stability of Approximation for Hamiltonian Path Problems. Algorithmic Operations Research 1(1): (2006)
2005
24EESebastian Seibert, Walter Unger: A 1.5-Approximation of the Minimal Manhattan Network Problem. ISAAC 2005: 246-255
23EELuca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert: On the Stability of Approximation for Hamiltonian Path Problems. SOFSEM 2005: 147-156
2004
22EEHans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger: On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Theor. Comput. Sci. 326(1-3): 137-153 (2004)
2003
21EEHans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger: On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. CIAC 2003: 189-200
20EEMika Hirvensalo, Sebastian Seibert: Lower Bounds for Las Vegas Automata by Information Theory. ITA 37(1): 39-49 (2003)
2002
19EESebastian Seibert: Efficient Transformations from Regular Expressions to Finite Automata. Developments in Language Theory 2002: 28-42
18EEHans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger: On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. FSTTCS 2002: 59-70
17EEJuraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger: Communication Complexity Method for Measuring Nondeterminism in Finite Automata. Inf. Comput. 172(2): 202-217 (2002)
16EEHans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger: Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Theor. Comput. Sci. 285(1): 3-24 (2002)
15EESebastian Seibert, Walter Unger: The hardness of placing street names in a Manhattan type map. Theor. Comput. Sci. 285(1): 89-99 (2002)
2001
14 Juraj Hromkovic, Sebastian Seibert, Thomas Wilke: Translating Regular Expressions into Small -Free Nondeterministic Finite Automata. J. Comput. Syst. Sci. 62(4): 565-588 (2001)
2000
13EESebastian Seibert, Walter Unger: The Hardness of Placing Street Names in a Manhattan Type Map. CIAC 2000: 102-112
12EEHans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger: Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. CIAC 2000: 72-86
11EEJuraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert: Measures of Nondeterminism in Finite Automata. ICALP 2000: 199-210
10EEHans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger: An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. STACS 2000: 382-394
9EEJuraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert: Measures of Nondeterminism in Finite Automata Electronic Colloquium on Computational Complexity (ECCC) 7(76): (2000)
8 Hans-Joachim Böckenhauer, Sebastian Seibert: Improved lower bounds on the approximability of the Traveling Salesman Problem. ITA 34(3): 213-255 (2000)
7EEHans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger: Approximation algorithms for the TSP with sharpened triangle inequality. Inf. Process. Lett. 75(3): 133-138 (2000)
1999
6EEHans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger: Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem Electronic Colloquium on Computational Complexity (ECCC) 6(31): (1999)
1997
5EESebastian Seibert, Thomas Wilke: Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT. Lectures on Proof Verification and Approximation Algorithms 1997: 179-212
4EEJuraj Hromkovic, Sebastian Seibert, Thomas Wilke: Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. STACS 1997: 55-66
1996
3 Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas: Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems. Inf. Comput. 125(1): 32-45 (1996)
1994
2EEDora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas: Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems. STACS 1994: 365-375
1991
1EESebastian Seibert: Quantifier Hierarchies over Word Relations. CSL 1991: 329-352

Coauthor Index

1Davide Bilò [28]
2Hans-Joachim Böckenhauer [6] [7] [8] [10] [12] [16] [18] [21] [22] [26] [28]
3Dirk Bongartz [18] [21] [22] [26]
4Luca Forlizzi [23] [25]
5Dora Giammarresi [2] [3]
6Mika Hirvensalo [20]
7Juraj Hromkovic [4] [6] [7] [9] [10] [11] [12] [14] [16] [17] [18] [21] [22] [23] [25] [26]
8Juhani Karhumäki [9] [11] [17]
9Ralf Klasing [6] [7] [10] [12] [16] [18] [21] [22] [26]
10Hartmut Klauck [9] [11] [17]
11Dennis Komm [28]
12Richard Královic [28]
13Tobias Mömke [28]
14Xavier Muñoz [27]
15Guido Proietti [18] [21] [22] [23] [25] [26]
16Antonio Restivo [2] [3]
17Georg Schnitger [9] [11] [17]
18Wolfgang Thomas [2] [3]
19Walter Unger [6] [7] [10] [12] [13] [15] [16] [18] [21] [22] [24] [26] [27]
20Thomas Wilke [4] [5] [14]
21Anna Zych [28]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)