research
∙
01/22/2022
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems
Finding a single best solution is the most common objective in combinato...
share
research
∙
01/23/2021
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity
For intractable problems on graphs of bounded treewidth, two graph param...
research
∙
12/09/2020
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion
A cactus is a connected graph that does not contain K_4 - e as a minor. ...
research
∙
09/18/2020
Longest Common Subsequence in Sublinear Space
We present the first o(n)-space polynomial-time algorithm for computing ...
research
∙
08/08/2020
Parameterized Complexity of (A,â„“)-Path Packing
Given a graph G = (V,E), A ⊆ V, and integers k and ℓ, the (A,ℓ)-Path Pac...
research
∙
04/23/2018
How Bad is the Freedom to Flood-It?
Fixed-Flood-It and Free-Flood-It are combinatorial problems on graphs th...
research
∙
12/26/2017
