31 citations · 256 across the 67 of their papers we have counts for
4 papers · 1 filter
Approximation schemes for bounded distance problems on fractionally treewidth-fragile graphs
Zdeněk Dvořák, Abhiruk Lahiri
We give polynomial-time approximation schemes for monotone maximization problems expressible in terms of distances (up to a fixed upper bound) and efficiently solvable in graphs of…
Dynamic Data Structure for Tree-Depth Decomposition
Zdenek Dvorak, Martin Kupec, Vojtech Tuma
We present a dynamic data structure for representing a graph with tree-depth at most . Tree-depth is an important graph parameter which arose in the study of sparse graph cl…
List-coloring embedded graphs
Zdenek Dvorak, Ken-ichi Kawarabayashi
For any fixed surface Sigma of genus g, we give an algorithm to decide whether a graph G of girth at least five embedded in Sigma is colorable from an assignment of lists of size t…
A dynamic data structure for counting subgraphs in sparse graphs
Zdenek Dvorak, Vojtech Tuma
We present a dynamic data structure representing a graph G, which allows addition and removal of edges from G and can determine the number of appearances of a graph of a bounded si…