Polynomial-time approximation schemes for geometric graphs. - Thomas Erlebach; Klaus Jansen; Eike Seidel (SODA, 2001)

Graph Subcolorings: Complexity and Algorithms. - Jirí Fiala 001; Klaus Jansen; Van Bang Le; Eike Seidel (SIAM J. Discret. Math., 2003)

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs. - Thomas Erlebach; Klaus Jansen; Eike Seidel (SIAM J. Comput., 2005)

Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. - Klaus Jansen; Marek Karpinski; Andrzej Lingas; Eike Seidel (SIAM J. Comput., 2005)