The following pages link to Sebastian Seibert (Q208755):
Displaying 31 items.
- Approximation algorithms for the TSP with sharpened triangle inequality (Q294819) (← links)
- Reoptimization of the shortest common superstring problem (Q639296) (← links)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
- On \(k\)-connectivity problems with sharpened triangle inequality (Q1002105) (← links)
- Nondeterminism versus determinism of finite automata over directed acyclic graphs (Q1326955) (← links)
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. (Q1608333) (← links)
- The hardness of placing street names in a Manhattan type map (Q1608339) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems (Q1917078) (← links)
- (Q2728893) (← links)
- (Q2754144) (← links)
- (Q3415353) (← links)
- The Minimal Manhattan Network Problem in Three Dimensions (Q3605512) (← links)
- Reoptimization of the Shortest Common Superstring Problem (Q3637106) (← links)
- (Q4202955) (← links)
- (Q4339226) (← links)
- (Q4412097) (← links)
- (Q4415244) (← links)
- (Q4437508) (← links)
- Lower Bounds for Las Vegas Automata by Information Theory (Q4462677) (← links)
- (Q4501548) (← links)
- (Q4503938) (← links)
- Improved Lower Bounds on the Approximability of the Traveling Salesman Problem (Q4522114) (← links)
- Bounds for approximating MaxLinEq3-2 and MaxEkSat (Q4571892) (← links)
- Advice Complexity of the Online Coloring Problem (Q4924664) (← links)
- (Q4942615) (← links)
- Translating regular expressions into small ε-free nondeterministic finite automata (Q5047159) (← links)
- An upper bound for transforming self-verifying automata into deterministic ones (Q5425747) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711527) (← links)
- Algorithms and Computation (Q5897858) (← links)
- Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata (Q5946055) (← links)
