J. Graph Algorithms & Applications
- Confluent drawings: visualizing non-planar diagrams in a planar way, DicEppGoo-JGAA-05
- Geometric thickness of complete graphs, DilEppHir-JGAA-00
- Small maximal independent sets and faster exact graph coloring, Epp-JGAA-03
- The traveling salesman problem for cubic graphs, Epp-JGAA-07
- Subgraph isomorphism in planar graphs and related problems, Epp-JGAA-99
- Fast approximation of centrality, EppWan-JGAA-04
- Planarizing graphs — a survey and annotated bibliography, Lie-JGAA-01
- Shelling hexahedral complexes for mesh generation, Mue-JGAA-01
