Sebastian Seibert

Available identifiers

zbMath Open seibert.sebastianMaRDI QIDQ208755

List of research outcomes

Publication	Date of Publication	Type
Translating regular expressions into small ε-free nondeterministic finite automata	2022-11-09	Paper
Bounds for approximating MaxLinEq3-2 and MaxEkSat	2018-07-03	Paper
Approximation algorithms for the TSP with sharpened triangle inequality	2016-06-16	Paper
Advice Complexity of the Online Coloring Problem	2013-06-07	Paper
Reoptimization of the shortest common superstring problem	2011-09-20	Paper
Reoptimization of the Shortest Common Superstring Problem	2009-07-07	Paper
The Minimal Manhattan Network Problem in Three Dimensions	2009-02-24	Paper
On \(k\)-connectivity problems with sharpened triangle inequality	2009-02-23	Paper
An upper bound for transforming self-verifying automata into deterministic ones	2007-11-14	Paper
On the stability of approximation for Hamiltonian path problems	2007-01-18	Paper
Algorithms and Computation	2006-11-14	Paper
SOFSEM 2005: Theory and Practice of Computer Science	2005-12-07	Paper
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality	2005-01-11	Paper
Lower Bounds for Las Vegas Automata by Information Theory	2004-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q4501548	2004-01-27	Paper
https://portal.mardi4nfdi.de/entity/Q4437508	2003-12-02	Paper
https://portal.mardi4nfdi.de/entity/Q4415244	2003-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q4412097	2003-07-13	Paper
Communication complexity method for measuring nondeterminism in finite automata	2003-01-14	Paper
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.	2002-08-05	Paper
The hardness of placing street names in a Manhattan type map	2002-08-05	Paper
Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata	2002-07-02	Paper
https://portal.mardi4nfdi.de/entity/Q2754144	2001-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q2728893	2001-11-06	Paper
Improved Lower Bounds on the Approximability of the Traveling Salesman Problem	2001-10-30	Paper
https://portal.mardi4nfdi.de/entity/Q4503938	2001-05-28	Paper
https://portal.mardi4nfdi.de/entity/Q4942615	2000-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q4339226	1997-06-06	Paper
Monadic second-order logic over rectangular pictures and recognizability by tiling systems	1996-07-03	Paper
Nondeterminism versus determinism of finite automata over directed acyclic graphs	1994-06-15	Paper
https://portal.mardi4nfdi.de/entity/Q4202955	1993-09-06	Paper

Research outcomes over time

This page was built for person: Sebastian Seibert