2005 |
5 | EE | Thomas Erlebach,
Klaus Jansen,
Eike Seidel:
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs.
SIAM J. Comput. 34(6): 1302-1323 (2005) |
4 | EE | Klaus Jansen,
Marek Karpinski,
Andrzej Lingas,
Eike Seidel:
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs.
SIAM J. Comput. 35(1): 110-119 (2005) |
2001 |
3 | EE | Thomas Erlebach,
Klaus Jansen,
Eike Seidel:
Polynomial-time approximation schemes for geometric graphs.
SODA 2001: 671-679 |
2 | EE | Klaus Jansen,
Marek Karpinski,
Andrzej Lingas,
Eike Seidel:
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs.
STACS 2001: 365-375 |
1 | EE | Jirí Fiala,
Klaus Jansen,
Van Bang Le,
Eike Seidel:
Graph Subcolorings: Complexity and Algorithms.
WG 2001: 154-165 |