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