default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastian Seibert
Person information
- affiliation: RWTH Aachen University, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1996
[b1]Sebastian Seibert:
Effektive Strategiekonstruktionen für Gale-Stewart-Spiele auf Transitionsgraphen. University of Kiel, Germany, 1996, pp. 1-160
Journal Articles
- 2011
- [j13]Davide Bilò
, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych:
Reoptimization of the Shortest Common Superstring Problem. Algorithmica 61(2): 227-251 (2011) - 2008
- [j12]Hans-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) - 2007
- [j11]Ira Assent, Sebastian Seibert:
An upper bound for transforming self-verifying automata into deterministic ones. RAIRO Theor. Informatics Appl. 41(3): 261-265 (2007) - 2006
- [j10]Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert:
On the Stability of Approximation for Hamiltonian Path Problems. Algorithmic Oper. Res. 1(1) (2006) - 2004
- [j9]Hans-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
- [j8]Mika Hirvensalo, Sebastian Seibert:
Lower Bounds for Las Vegas Automata by Information Theory. RAIRO Theor. Informatics Appl. 37(1): 39-49 (2003) - 2002
- [j7]Juraj 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) - [j6]Hans-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) - [j5]Sebastian Seibert, Walter Unger:
The hardness of placing street names in a Manhattan type map. Theor. Comput. Sci. 285(1): 89-99 (2002) - 2001
- [j4]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
- [j3]Hans-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) - [j2]Hans-Joachim Böckenhauer, Sebastian Seibert:
Improved lower bounds on the approximability of the Traveling Salesman Problem. RAIRO Theor. Informatics Appl. 34(3): 213-255 (2000) - 1996
- [j1]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)
Conference and Workshop Papers
- 2013
- [c16]Sebastian Seibert, Andreas Sprock, Walter Unger:
Advice Complexity of the Online Coloring Problem. CIAC 2013: 345-357 - 2009
- [c15]Davide 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 - [c14]Xavier Muñoz, Sebastian Seibert, Walter Unger:
The Minimal Manhattan Network Problem in Three Dimensions. WALCOM 2009: 369-380 - 2005
- [c13]Sebastian Seibert, Walter Unger:
A 1.5-Approximation of the Minimal Manhattan Network Problem. ISAAC 2005: 246-255 - [c12]Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert:
On the Stability of Approximation for Hamiltonian Path Problems. SOFSEM 2005: 147-156 - 2003
- [c11]Hans-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 - 2002
- [c10]Sebastian Seibert:
Efficient Transformations from Regular Expressions to Finite Automata. Developments in Language Theory 2002: 28-42 - [c9]Hans-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 - 2000
- [c8]Hans-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 - [c7]Sebastian Seibert, Walter Unger:
The Hardness of Placing Street Names in a Manhattan Type Map. CIAC 2000: 102-112 - [c6]Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert:
Measures of Nondeterminism in Finite Automata. ICALP 2000: 199-210 - [c5]Hans-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 - 1997
- [c4]Sebastian Seibert, Thomas Wilke:
Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT. Lectures on Proof Verification and Approximation Algorithms 1997: 179-212 - [c3]Juraj Hromkovic, Sebastian Seibert, Thomas Wilke:
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. STACS 1997: 55-66 - 1994
- [c2]Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas:
Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems. STACS 1994: 365-375 - 1991
- [c1]Sebastian Seibert:
Quantifier Hierarchies over Word Relations. CSL 1991: 329-352
Parts in Books or Collections
- 2018
- [p1]Hans-Joachim Böckenhauer, Juraj Hromkovic, Sebastian Seibert:
Stability of Approximation. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 473-487
Reference Works
- 2007
- [r1]Hans-Joachim Böckenhauer, Sebastian Seibert, Juraj Hromkovic:
Stability of Approximation. Handbook of Approximation Algorithms and Metaheuristics 2007
Informal and Other Publications
- 2000
- [i2]Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert:
Measures of Nondeterminism in Finite Automata. Electron. Colloquium Comput. Complex. TR00 (2000) - 1999
- [i1]Hans-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. Electron. Colloquium Comput. Complex. TR99 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
