Ondrej Suchý

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 53

Top Topics

Parameterized Complexity

Top Venues

J. Comput. Syst. Sci.

SIAM J. Discret. Math.

Publications

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