Ondrej Suchý

95 papers A* 3A 6B 20C 2Journal 58Unranked 6
YearRankTypeTitle / Venue / Authors
2025 B conf
Parameterized Complexity of Directed Traveling Salesman Problem.
ISAAC
Václav Blazej, Andreas Emil Feldmann, Foivos Fioravantes, Pawel Rzazewski, Ondrej Suchý
2025 J jnl
Parameterized Complexity of Directed Traveling Salesman Problem.
CoRR
Václav Blazej, Andreas Emil Feldmann, Foivos Fioravantes, Pawel Rzazewski, Ondrej Suchý
2025 B conf
Pathfinding in Self-Deleting Graphs.
ISAAC
Michal Dvorák, Dusan Knop, Michal Opler, Jan Pokorný, Ondrej Suchý, Krisztina Szilágyi
2025 J jnl
Pathfinding in Self-Deleting Graphs.
CoRR
Michal Dvorák, Dusan Knop, Michal Opler, Jan Pokorný, Ondrej Suchý, Krisztina Szilágyi
2025 J jnl
Treewidth is NP-Complete on Cubic Graphs.
Electron. J. Comb.
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2024 J jnl
Cluster Editing for Multi-Layer and Temporal Graphs.
Theory Comput. Syst.
Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2024 J jnl
On kernels for d-path vertex cover.
J. Comput. Syst. Sci.
Radovan Cervený, Pratibha Choudhary, Ondrej Suchý
2023 J jnl
Constant factor approximation for tracking paths and fault tolerant feedback vertex set.
Discret. Optim.
Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla
2023 B conf
Generating Faster Algorithms for d-Path Vertex Cover.
WG
Radovan Cervený, Ondrej Suchý
2023 J jnl
Hedonic diversity games: A complexity picture with more than two colors.
Artif. Intell.
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
2023 B conf
Maximizing Social Welfare in Score-Based Social Distance Games.
TARK
Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý
2023 J jnl
Maximizing Social Welfare in Score-Based Social Distance Games.
CoRR
Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý
2023 J jnl
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters.
Algorithmica
Martin Kucera, Ondrej Suchý
2023 J jnl
Polynomial kernels for tracking shortest paths.
Inf. Process. Lett.
Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla
2023 B conf
Treewidth Is NP-Complete on Cubic Graphs.
IPEC
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2023 J jnl
Treewidth is NP-Complete on Cubic Graphs (and related results).
CoRR
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2022 A* conf
Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract).
AAAI
Dusan Knop, Simon Schierreich, Ondrej Suchý
2022 A* conf
Hedonic Diversity Games: A Complexity Picture with More than Two Colors.
AAAI
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
2022 J jnl
Hedonic Diversity Games: A Complexity Picture with More than Two Colors.
CoRR
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
2022 B conf
On Kernels for d-Path Vertex Cover.
MFCS
Radovan Cervený, Pratibha Choudhary, Ondrej Suchý
2022 A conf
On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations.
ESA
Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla
2022 J jnl
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations.
CoRR
Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla
2022 J jnl
Polynomial Kernels for Tracking Shortest Paths.
CoRR
Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla
2022 J jnl
Waypoint routing on bounded treewidth graphs.
Inf. Process. Lett.
Simon Schierreich, Ondrej Suchý
2021 J jnl
A Parameterized Complexity View on Collapsing k-Cores.
Theory Comput. Syst.
Junjie Luo, Hendrik Molter, Ondrej Suchý
2021 J jnl
Balancing the Spread of Two Opinions in Sparse Social Networks.
CoRR
Dusan Knop, Simon Schierreich, Ondrej Suchý
2021 B conf
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set.
WAOA
Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla
2021 J jnl
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set.
CoRR
Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla
2021 J jnl
Generating faster algorithms for d-Path Vertex Cover.
CoRR
Radovan Cervený, Ondrej Suchý
2021 C conf
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters.
IWOCA
Martin Kucera, Ondrej Suchý
2021 J jnl
On Kernels for d-Path Vertex Cover.
CoRR
Radovan Cervený, Pratibha Choudhary, Ondrej Suchý
2020 J jnl
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters.
CoRR
Martin Kucera, Ondrej Suchý
2020 J jnl
Waypoint Routing on Bounded Treewidth Graphs.
CoRR
Simon Schierreich, Ondrej Suchý
2019 J jnl
A Tight Lower Bound for Planar Steiner Orientation.
Algorithmica
Rajesh Chitnis, Andreas Emil Feldmann, Ondrej Suchý
2019 A conf
Complexity of the Steiner Network Problem with Respect to the Number of Terminals.
STACS
Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý
2019 — conf
Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem.
SEA²
Josef Malík, Ondrej Suchý, Tomás Valla
2019 J jnl
Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem.
CoRR
Josef Malík, Ondrej Suchý, Tomás Valla
2019 B conf
Faster FPT Algorithm for 5-Path Vertex Cover.
MFCS
Radovan Cervený, Ondrej Suchý
2019 J jnl
Faster FPT Algorithm for 5-Path Vertex Cover.
CoRR
Radovan Cervený, Ondrej Suchý
2018 B conf
A Parameterized Complexity View on Collapsing k-Cores.
IPEC
Junjie Luo, Hendrik Molter, Ondrej Suchý
2018 J jnl
A Parameterized Complexity View on Collapsing k-Cores.
CoRR
Junjie Luo, Hendrik Molter, Ondrej Suchý
2018 B conf
Cluster Editing in Multi-Layer and Temporal Graphs.
ISAAC
Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2018 J jnl
Complexity of the Steiner Network Problem with Respect to the Number of Terminals.
CoRR
Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý
2018 J jnl
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs.
Discret. Optim.
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2017 J jnl
A Parameterized View on Multi-Layer Cluster Editing.
CoRR
Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2017 — conf
A Simple Streaming Bit-Parallel Algorithm for Swap Pattern Matching.
MACIS
Václav Blazej, Ondrej Suchý, Tomás Valla
2017 J jnl
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack.
J. Sched.
René van Bevern, Rolf Niedermeier, Ondrej Suchý
2017 J jnl
Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices.
Algorithmica
Ondrej Suchý
2017 J jnl
Fixed-parameter algorithms for DAG Partitioning.
Discret. Appl. Math.
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
2017 J jnl
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs.
SIAM J. Discret. Math.
Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
2016 J jnl
A Simpler Bit-parallel Algorithm for Swap Matching.
CoRR
Václav Blazej, Ondrej Suchý, Tomás Valla
2016 B conf
Finding Secluded Places of Special Interest in Graphs.
IPEC
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2016 J jnl
Finding Secluded Places of Special Interest in Graphs.
CoRR
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2016 J jnl
Fixed-Parameter Algorithms for DAG Partitioning.
CoRR
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
2016 B conf
On Directed Steiner Trees with Multiple Roots.
WG
Ondrej Suchý
2016 J jnl
On Directed Steiner Trees with Multiple Roots.
CoRR
Ondrej Suchý
2016 J jnl
Tree Deletion Set Has a Polynomial Kernel but No OPT
SIAM J. Discret. Math.
Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
2015 J jnl
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack.
CoRR
René van Bevern, Rolf Niedermeier, Ondrej Suchý
2015 J jnl
A refined complexity analysis of degree anonymization in graphs.
Inf. Comput.
Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý
2015 B conf
Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices.
IPEC
Ondrej Suchý
2015 J jnl
On explaining integer vectors by few homogeneous segments.
J. Comput. Syst. Sci.
Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý
2015 J jnl
On structural parameterizations for the 2-club problem.
Discret. Appl. Math.
Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý
2015 J jnl
On the Parameterized Complexity of Computing Balanced Partitions in Graphs.
Theory Comput. Syst.
René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
2015 J jnl
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem.
SIAM J. Discret. Math.
Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller
2014 J jnl
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.
J. Artif. Intell. Res.
Robert Bredereck, Jiehua Chen, Sepp Hartung, Stefan Kratsch, Rolf Niedermeier, Ondrej Suchý, Gerhard J. Woeginger
2014 J jnl
Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound.
J. Comput. Syst. Sci.
Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý
2014 A conf
Solving Multicut Faster Than 2 n.
ESA
Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
2014 — conf
Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation).
FSTTCS
Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
2013 — conf
A Refined Complexity Analysis of Degree Anonymization in Graphs.
ICALP (2)
Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý
2013 B conf
An FPT Algorithm for Tree Deletion Set.
WALCOM
Venkatesh Raman, Saket Saurabh, Ondrej Suchý
2013 J jnl
An FPT algorithm for Tree Deletion Set.
J. Graph Algorithms Appl.
Venkatesh Raman, Saket Saurabh, Ondrej Suchý
2013 B conf
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem.
ISAAC
Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller
2013 J jnl
Feedback vertex set on graphs of low clique-width.
Eur. J. Comb.
Binh-Minh Bui-Xuan, Ondrej Suchý, Jan Arne Telle, Martin Vatshelle
2013 B conf
On Explaining Integer Vectors by Few Homogenous Segments.
WADS
Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý
2013 J jnl
On Structural Parameterizations for the 2-Club Problem
CoRR
Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý
2013 J jnl
On the Parameterized Complexity of Computing Balanced Partitions in Graphs.
CoRR
René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
2013 B conf
On the Parameterized Complexity of Computing Graph Bisections.
WG
René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
2013 C conf
Parameterized Complexity of DAG Partitioning.
CIAC
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
2013 A conf
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs.
ESA
Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
2013 J jnl
The Parameterized Complexity of Local Search for TSP, More Refined.
Algorithmica
Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý
2013 J jnl
Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation).
CoRR
Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
2012 A* conf
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.
AAAI
Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý, Stefan Kratsch
2012 — conf
Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound.
FSTTCS
Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý
2012 J jnl
Beyond Max-Cut: λ-Extendible Properties Parameterized Above the Poljak-Turzík Bound
CoRR
Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý
2012 J jnl
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
CoRR
Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
2012 J jnl
Parameterized complexity of generalized domination problems.
Discret. Appl. Math.
Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý
2011 J jnl
Parameterized Complexity of Arc-Weighted Directed Steiner Problems.
SIAM J. Discret. Math.
Jiong Guo, Rolf Niedermeier, Ondrej Suchý
2011 J jnl
Parameterized Problems Related to Seidel's Switching.
Discret. Math. Theor. Comput. Sci.
Eva Jelínková, Ondrej Suchý, Petr Hlinený, Jan Kratochvíl
2011 B conf
The Parameterized Complexity of Local Search for TSP, More Refined.
ISAAC
Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý
2009 J jnl
Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs.
J. Graph Algorithms Appl.
Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil
2009 B conf
Parameterized Complexity of Arc-Weighted Directed Steiner Problems.
ISAAC
Jiong Guo, Rolf Niedermeier, Ondrej Suchý
2009 B conf
Parameterized Complexity of Generalized Domination Problems.
WG
Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý
2009 — conf
What Makes Equitable Connected Partition Easy.
IWPEC
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý
2008 A conf
Clustered Planarity: Clusters with Few Outgoing Edges.
GD
Vít Jelínek, Ondrej Suchý, Marek Tesar, Tomás Vyskocil
2007 A conf
Clustered Planarity: Small Clusters in Eulerian Graphs.
GD
Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil