8 citations · 66 across the 52 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CC2013
Vertex Disjoint Path in Upward Planar Graphs
Saeed Amiri, Ali Golshani, Stephan Kreutzer +1
The -vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time f…
cs.LO2013★ 6 cited
Deciding first-order properties of nowhere dense graphs
Martin Grohe, Stephan Kreutzer, Sebastian Siebertz
Nowhere dense graph classes, introduced by Nesetril and Ossona de Mendez, form a large variety of classes of "sparse graphs" including the class of planar graphs, actually all clas…