Let A and B be sets of vertices in a graph G. Menger's theorem states
th...
An independent set in a graph G is a set S of pairwise non-adjacent
vert...
In the Minimum Bisection problem, input is a graph G and the goal is to
...
We present the first polynomial-time algorithm to exactly compute the nu...
We re-visit the complexity of kernelization for the d-Hitting Set proble...
A graph G contains a graph H as an induced minor if H can be obtained
fr...
We introduce a new framework for the analysis of preprocessing routines ...
The streaming model was introduced to parameterized complexity independe...
We show that the Maximum Weight Independent Set problem
(MWIS) can be so...
We investigate a fundamental vertex-deletion problem called (Induced)
Su...
We give an algorithm that takes as input an n-vertex graph G and an
inte...
We introduce the following submodular generalization of the Shortest Cyc...
We initiate a systematic study of approximation schemes for fundamental
...
We prove that Graph Isomorphism and Canonization in graphs excluding a f...
A set X ⊆ V(G) in a graph G is (q,k)-unbreakable if every
separation (A,...
Wordle is a single-player word-guessing game where the goal is to discov...
Suppose we are given a pair of points s, t and a set S of n geometric
ob...
We design the first subexponential-time (parameterized) algorithms for
s...
The emergence of programmable data-plane targets has motivated a new hyb...
In its most traditional setting, the main concern of optimization theory...
In the literature on parameterized graph problems, there has been an
inc...
In the Disjoint Paths problem, the input is an undirected graph G on n
v...
Given two points s and t in the plane and a set of obstacles defined by
...
In the Disjoint Paths problem, the input consists of an n-vertex graph G...
We give an algorithm that takes as input a graph G with weights on the
v...
A class F of graphs is called tame if there exists a constant
k so that ...
The cut-set ∂(S) of a graph G=(V,E) is the set of edges that have
one en...
A graph operation that contracts edges is one of the fundamental
operati...
We present an algorithm that takes as input a graph G with weights on th...
In the Min k-Cut problem, input is an edge weighted graph G and an
integ...
We prove that the Hadwiger number of an n-vertex graph G (the maximum
si...
Art Gallery is a fundamental visibility problem in Computational Geometr...
We provide a polynomial-time algorithm for b-Coloring on graphs of const...
We present an algorithm for the extensively studied Long Path and Long C...
Given two points in the plane, a set of obstacles defined by closed curv...
We design two incremental algorithms for computing an inclusion-minimal
...
A bond of a graph G is an inclusion-wise minimal disconnecting set of G,...
In a reconfiguration version of an optimization problem Q the
input is a...
Let G be a directed graph with n vertices and m edges, and let s ∈
V(G) ...
In the Topological Minor Containment problem (TMC) problem two undirecte...
Bidimensionality is the most common technique to design subexponential-t...
A central problem in parameterized algorithms is to obtain algorithms
...
Perturbed graphic matroids are binary matroids that can be obtained from...
An undirected graph G is d-degenerate if every subgraph of G has a verte...
The randomized contractions technique, introduced by Chitnis et al. in 2...
A tournament is a directed graph T such that every pair of vertices
is ...
We consider problems where the input is a set of points in the plane and...
We provide a randomized linear time approximation scheme for a generic
p...
We study the first-order (FO) model checking problem of dense graphs, na...
In algorithmic graph theory, a classic open question is to determine the...