Sebastian Seibert

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Translating regular expressions into small -free nondeterministic finite automata
Lecture Notes in Computer Science
2022-11-09Paper
Bounds for approximating MaxLinEq3-2 and MaxEkSat
Lectures on Proof Verification and Approximation Algorithms
2018-07-03Paper
Approximation algorithms for the TSP with sharpened triangle inequality
Information Processing Letters
2016-06-16Paper
Advice complexity of the online coloring problem
Lecture Notes in Computer Science
2013-06-07Paper
Reoptimization of the shortest common superstring problem
Algorithmica
2011-09-20Paper
Reoptimization of the Shortest Common Superstring Problem
Combinatorial Pattern Matching
2009-07-07Paper
The Minimal Manhattan Network Problem in Three Dimensions
WALCOM: Algorithms and Computation
2009-02-24Paper
On k-connectivity problems with sharpened triangle inequality
Journal of Discrete Algorithms
2009-02-23Paper
An upper bound for transforming self-verifying automata into deterministic ones
RAIRO - Theoretical Informatics and Applications
2007-11-14Paper
An upper bound for transforming self-verifying automata into deterministic ones
RAIRO - Theoretical Informatics and Applications
2007-11-14Paper
An upper bound for transforming self-verifying automata into deterministic ones
RAIRO - Theoretical Informatics and Applications
2007-11-14Paper
On the stability of approximation for Hamiltonian path problems2007-01-18Paper
Algorithms and Computation
Lecture Notes in Computer Science
2006-11-14Paper
On the stability of approximation for Hamiltonian path problems
Lecture Notes in Computer Science
2005-12-07Paper
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Theoretical Computer Science
2005-01-11Paper
Lower Bounds for Las Vegas Automata by Information Theory
RAIRO - Theoretical Informatics and Applications
2004-05-18Paper
Lower Bounds for Las Vegas Automata by Information Theory
RAIRO - Theoretical Informatics and Applications
2004-05-18Paper
Lower Bounds for Las Vegas Automata by Information Theory
RAIRO - Theoretical Informatics and Applications
2004-05-18Paper
An improved lower bound on the approximability of metric TSP and approximation algorithms for the TSP with sharpened triangle inequality (extended abstract)
Lecture Notes in Computer Science
2004-01-27Paper
On k-edge-connectivity problems with sharpened triangle inequality
Lecture Notes in Computer Science
2003-12-02Paper
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Theoretical Computer Science
2003-07-28Paper
Efficient transformations from regular expressions to finite automata
Lecture Notes in Computer Science
2003-07-13Paper
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation
2003-01-14Paper
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
Theoretical Computer Science
2002-08-05Paper
The hardness of placing street names in a Manhattan type map
Theoretical Computer Science
2002-08-05Paper
Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
Journal of Computer and System Sciences
2002-07-02Paper
Measures of nondeterminism in finite automata
Lecture Notes in Computer Science
2001-11-11Paper
The hardness of placing street names in a Manhattan type map
Lecture Notes in Computer Science
2001-11-06Paper
Improved Lower Bounds on the Approximability of the Traveling Salesman Problem
RAIRO - Theoretical Informatics and Applications
2001-10-30Paper
Improved Lower Bounds on the Approximability of the Traveling Salesman Problem
RAIRO - Theoretical Informatics and Applications
2001-10-30Paper
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem
Lecture Notes in Computer Science
2001-05-28Paper
Monadic second-order logic over pictures and recognizability by tiling systems
Lecture Notes in Computer Science
2000-03-16Paper
scientific article; zbMATH DE number 1017515 (Why is no real title available?)1997-06-06Paper
Monadic second-order logic over rectangular pictures and recognizability by tiling systems
Information and Computation
1996-07-03Paper
Nondeterminism versus determinism of finite automata over directed acyclic graphs
Bulletin of the Belgian Mathematical Society - Simon Stevin
1994-06-15Paper
scientific article; zbMATH DE number 408810 (Why is no real title available?)1993-09-06Paper


Research outcomes over time


This page was built for person: Sebastian Seibert