
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
We study the Steiner Tree problem, in which a set of terminal vertices n...
10/02/2017 ∙ by Pavel Dvořák, et al. ∙ 0 ∙ shareread it

Parameterized complexity of fair deletion problems II
Vertex deletion problems are those where given a graph G and a graph pro...
03/19/2018 ∙ by Dušan Knop, et al. ∙ 0 ∙ shareread it

Notes on complexity of packing coloring
A packing kcoloring for some integer k of a graph G=(V,E) is a mapping ...
12/22/2017 ∙ by Minki Kim, et al. ∙ 0 ∙ shareread it

Colouring (P_r+P_s)Free Graphs
The kColouring problem is to decide if the vertices of a graph can be c...
04/30/2018 ∙ by Tereza Klimošová, et al. ∙ 0 ∙ shareread it

On difference graphs and the local dimension of posets
The dimension of a partiallyordered set (poset), introduced by Dushnik ...
03/23/2018 ∙ by Jinha Kim, et al. ∙ 0 ∙ shareread it

Duality Gap in Interval Linear Programming
This paper deals with the problem of linear programming with inexact dat...
02/15/2018 ∙ by Jana Novotná, et al. ∙ 0 ∙ shareread it

Parameterized Complexity of Fair Vertex Evaluation Problems
A prototypical graph problem is centered around a graph theoretic proper...
03/19/2018 ∙ by Dušan Knop, et al. ∙ 0 ∙ shareread it

Flexibility of trianglefree planar graphs
Let G be a planar graph with a list assignment L. Suppose a preferred co...
02/08/2019 ∙ by Zdeněk Dvořák, et al. ∙ 0 ∙ shareread it

Flexibility of planar graphs of girth at least six
Let G be a planar graph with a list assignment L. Suppose a preferred co...
02/11/2019 ∙ by Zdeněk Dvořák, et al. ∙ 0 ∙ shareread it

Flexibility of planar graphs without 4cycles
Proper graph coloring assigns different colors to adjacent vertices of t...
03/04/2019 ∙ by Tomáš Masařík, et al. ∙ 0 ∙ shareread it

Diversity in Combinatorial Optimization
When modeling an application of practical relevance as an instance of a ...
03/18/2019 ∙ by Julien Baste, et al. ∙ 0 ∙ shareread it

Packing directed circuits quarterintegrally
The celebrated ErdősPósa theorem states that every undirected graph tha...
07/04/2019 ∙ by Tomáš Masařík, et al. ∙ 0 ∙ shareread it

FPT Algorithms for Diverse Collections of Hitting Sets
In this work, we study the dHitting Set and Feedback Vertex Set problem...
11/12/2019 ∙ by Julien Baste, et al. ∙ 0 ∙ shareread it
Tomáš Masařík
is this you? claim profile