Finding a single best solution is the most common objective in
combinato...
For intractable problems on graphs of bounded treewidth, two graph param...
A cactus is a connected graph that does not contain K_4 - e as a minor.
...
We present the first o(n)-space polynomial-time algorithm for
computing ...
Given a graph G = (V,E), A ⊆ V, and integers k and ℓ, the
(A,ℓ)-Path Pac...
Fixed-Flood-It and Free-Flood-It are combinatorial problems on graphs th...
Given a sequence of integers, we want to find a longest increasing
subse...