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 2020Show all

2 papers · 1 filter

cs.DS2020★ 4 cited

Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters

Martin Kučera, Ondřej Suchý

The Minimum Eccentricity Shortest Path Problem consists in finding a shortest path with minimum eccentricity in a given undirected graph. The problem is known to be NP-complete and…

cs.DS2020

Waypoint Routing on Bounded Treewidth Graphs

Šimon Schierreich, Ondřej Suchý

In the \textsc{Waypoint Routing Problem} one is given an undirected capacitated and weighted graph , a source-destination pair and a set , of \emp…