research
∙
07/01/2023
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard
Let d be a positive integer. For a finite set X ⊆ℝ^d, we define its inte...
share
research
∙
02/26/2023
Partitioning edges of a planar graph into linear forests and a matching
We show that the edges of any planar graph of maximum degree at most 9 c...
research
∙
07/23/2020
The Asymmetric Travelling Salesman Problem in Sparse Digraphs
Asymmetric Travelling Salesman Problem (ATSP) and its special case Direc...
research
∙
05/05/2020
Many visits TSP revisited
We study the Many Visits TSP problem, where given a number k(v) for each...
research
∙
08/25/2019
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP
Local search is a widely-employed strategy for finding good solutions to...
research
∙
04/07/2018
Tight Lower Bounds for List Edge Coloring
The fastest algorithms for edge coloring run in time 2^m n^O(1), where m...
research
∙
07/05/2017
On Directed Feedback Vertex Set parameterized by treewidth
We study the Directed Feedback Vertex Set problem parameterized by the t...
research
∙
07/26/2016
