Ondřej Suchý

activity

20122026

most citedA parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack

28 citations · 71 across the 13 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

cs.DS2019

Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem

Josef Malík, Ondřej Suchý, Tomáš Valla

We consider the subgraph isomorphism problem where, given two graphs G (source graph) and F (pattern graph), one is to decide whether there is a (not necessarily induced) subgraph…

cs.DS2019

Faster FPT Algorithm for 5-Path Vertex Cover

Radovan Červený, Ondřej Suchý

The problem of $d$ -Path Vertex Cover, $d$ -PVC lies in determining a subset $F$ of vertices of a given graph $G = (V, E)$ such that $G ∖ F$ does not contain a path on $d$ verti…