1

Planarity allowing few error vertices in linear time
– Kenichi Kawarabayashi

15

Graph and map isomorphism and all polyhedral embeddings in linear time
– Kenichi Kawarabayashi, Bojan Mohar
 2008


Linkless and flat embeddings in 3space and the Unknot problem (Extended Abstract)
– Kenichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar
 2010

8

Graph Minors and Graphs on Surfaces
– Bojan Mohar
 2001

10

Obtaining a planar graph by vertex deletion
– Dániel Marx, Ildikó Schlotter

7

Universal obstructions for embedding extension problems
– Bojan Mohar

28

Computing crossing numbers in quadratic time
– Martin Grohe
 2004

4

The edge disjoint paths problem in Eulerian graphs and 4edgeconnected graphs
– Kenichi Kawarabayashi , Yusuke Kobayashi
 2010

3

An (almost) Linear Time Algorithm For Odd Cycles Transversal
– Kenichi Kawarabayashi, Bruce Reed
 2009


A Simple Algorithm for the Graph Minor Decomposition – Logic meets Structural Graph Theory–
– Martin Grohe, Kenichi Kawarabayashi, Bruce Reed


Linear Connectivity Forces Large Bipartite Minors
– Thomas Böhme, Kenichi Kawarabayashi, John Maharry, Bojan Mohar
 2004

13

Algorithmic MetaTheorems
– Stephan Kreutzer
 2008

10

An algorithm for finding an induced cycle in planar graphs and bounded genus graphs
– Yusuke Kobayashi, Kenichi Kawarabayashi

4

Embedding a Graph Into the Torus in Linear Time
– Martin Juvan, Joze Marincek, Bojan Mohar
 1994


K6 Minors in 6Connected Graphs . . .
– Kenichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan
 2008

2

Solving Problems on Recursively Constructed Graphs
– Richard B. Borie, R. Gary Parker, Craig A. Tovey

10

Practical Toroidality Testing
– Eugene Neufeld, Wendy Myrvold
 1996

1

Recognizing a totally odd K4subdivision, parity 2disjoint rooted paths and a parity cycle through specified elements (extended abstract)
– Kenichi Kawarabayashi, Zhentao Li, Bruce Reed

139

Approximation Algorithms for Disjoint Paths Problems
– Jon Michael Kleinberg
 1996
