For each constant k, we present a linear time algorithm that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is no transv...
Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian...
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometri...
We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignas...
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...