7 Result(s)
within
Pavel Dvořák
Computer Science
-
Article
Parameterized Inapproximability of Independent Set in H-Free Graphs
We study the Independent Set problem in H-free graphs, i.e., graphs excluding some fixed graph H as an induced subgraph. We prove several inapproximability results both for polynomial-time and parameterized algor...
-
Chapter and Conference Paper
Parameterized Inapproximability of Independent Set in H-Free Graphs
We study the Independent Set problem in H-free graphs, i.e., graphs excluding some fixed graph H as an induced subgraph. We prove several inapproximability results both for polynomial-time and parameterized algor...
-
Chapter and Conference Paper
On Induced Online Ramsey Number of Paths, Cycles, and Trees
An online Ramsey game is a game between Builder and Painter, alternating in turns. They are given a fixed graph H and a an infinite set of independent vertices G. In each round Builder draws a new edge in G and P...
-
Article
Parameterized Complexity of Length-bounded Cuts and Multicuts
We study the Minimum Length-Bounded Cut problem where the task is to find a set of edges of a graph such that after removal of this set, the shortest path between two prescribed vertices is at least ...
-
Chapter and Conference Paper
Local Structure Prediction with Convolutional Neural Networks for Multimodal Brain Tumor Segmentation
Most medical images feature a high similarity in the intensities of nearby pixels and a strong correlation of intensity profiles across different image modalities. One way of dealing with – and even exploiting...
-
Chapter and Conference Paper
Automorphisms of the Cube \(n^d\)
Consider a hypergraph \(H_n^d\) where the vertices are points of the d-dimensional combinatorial cube ...
-
Chapter and Conference Paper
Parametrized Complexity of Length-Bounded Cuts and Multi-cuts
We show that the minimal length-bounded \(L\) -cut can be computed in linear time with respect to
