Preprocessing, or data reduction, is a standard technique for simplifying and speeding up
computation. Written by a team of experts in the field, this book introduces a rapidly …

In this paper we propose a new framework for analyzing the performance of preprocessing
algorithms. Our framework builds on the notion of kernelization from parameterized …

We show that the problem of finding the simplex of largest volume in the convex hull of n
points in ℚ d can be approximated with a factor of O (log d) d/2 in polynomial time. This …

An outerstring graph is the intersection graph of curves lying inside a disk with one endpoint
on the boundary of the disk. We show that an outerstring graph with $ n $ vertices has …

Let H be a planar graph. By a classical result of Robertson and Seymour, there is a function
f: ℕ→ ℝ such that for all k∊ ℕ and all graphs G, either G contains k vertex-disjoint subgraphs …

The Cycle Packing problem asks whether a given undirected graph G=(V,E) contains k
vertex-disjoint cycles. Since the publication of the classic Erdös--Pósa theorem in 1965 …

The c-pumpkin is the graph with two vertices linked by c≧1 parallel edges. A c-pumpkin-
model in a graph G is a pair {A,B\} of disjoint subsets of vertices of G, each inducing a …

We devise constant-factor approximation algorithms for finding as many disjoint cycles as
possible from a certain family of cycles in a given planar or bounded-genus graph. Here …

In this paper, we consider the Cycle Packing problem on unit disk graphs defined as follows.
Given a unit disk graph G with n vertices and an integer k, the goal is to find a set of $ k …

The study of graph products is a major research topic and typically concerns the term f (G*
H), eg, to show that f (G* H)= f (G) f (H). In this paper, we study graph products in a non …