Ondrej Suchý

According to our database, Ondrej Suchý authored at least 57 papers between 2007 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Hedonic diversity games: A complexity picture with more than two colors.

Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý

Artif. Intell., December, 2023

Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters.

Martin Kucera, Ondrej Suchý

Algorithmica, March, 2023

Constant factor approximation for tracking paths and fault tolerant feedback vertex set.

Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla

Discret. Optim., February, 2023

Polynomial kernels for tracking shortest paths.

Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla

Inf. Process. Lett., 2023

Maximizing Social Welfare in Score-Based Social Distance Games.

Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý

Proceedings of the Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge, 2023

Treewidth is NP-Complete on Cubic Graphs (and related results).

Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý

CoRR, 2023

Generating Faster Algorithms for d-Path Vertex Cover.

Radovan Cervený, Ondrej Suchý

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Treewidth Is NP-Complete on Cubic Graphs.

Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

2022

Waypoint routing on bounded treewidth graphs.

Simon Schierreich, Ondrej Suchý

Inf. Process. Lett., 2022

On Kernels for d-Path Vertex Cover.

Radovan Cervený, Pratibha Choudhary, Ondrej Suchý

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Torque Ripple Reduction of IPMSM Drive with Non-sinusoidal Back-EMF by Predictive Control.

Ondrej Suchý, Stepán Janous, Jakub Talla, Zdenek Peroutka

Proceedings of the 31st IEEE International Symposium on Industrial Electronics, 2022

On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations.

Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract).

Dusan Knop, Simon Schierreich, Ondrej Suchý

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

A Parameterized Complexity View on Collapsing k-Cores.

Junjie Luo, Hendrik Molter, Ondrej Suchý

Theory Comput. Syst., 2021

Balancing the Spread of Two Opinions in Sparse Social Networks.

Dusan Knop, Simon Schierreich, Ondrej Suchý

CoRR, 2021

Predictive control of PMSM using improved model of the drive.

Ondrej Suchý, Stepán Janous, Jakub Talla, Zdenek Peroutka

Proceedings of the IECON 2021, 2021

2019

A Tight Lower Bound for Planar Steiner Orientation.

Rajesh Chitnis, Andreas Emil Feldmann, Ondrej Suchý

Algorithmica, 2019

Complexity of the Steiner Network Problem with Respect to the Number of Terminals.

Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem.

Josef Malík, Ondrej Suchý, Tomás Valla

Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

Faster FPT Algorithm for 5-Path Vertex Cover.

Radovan Cervený, Ondrej Suchý

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs.

René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý

Discret. Optim., 2018

Cluster Editing in Multi-Layer and Temporal Graphs.

Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

Parameterized Complexity of Directed Steiner Tree on Sparse Graphs.

Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý

SIAM J. Discret. Math., 2017

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

René van Bevern, Rolf Niedermeier, Ondrej Suchý

J. Sched., 2017

Fixed-parameter algorithms for DAG Partitioning.

René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý

Discret. Appl. Math., 2017

A Parameterized View on Multi-Layer Cluster Editing.

Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý

CoRR, 2017

Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices.

Ondrej Suchý

Algorithmica, 2017

A Simple Streaming Bit-Parallel Algorithm for Swap Pattern Matching.

Václav Blazej, Ondrej Suchý, Tomás Valla

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

2016

Tree Deletion Set Has a Polynomial Kernel but No OPT^<i>O</i>(1) Approximation.

Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý

SIAM J. Discret. Math., 2016

A Simpler Bit-parallel Algorithm for Swap Matching.

Václav Blazej, Ondrej Suchý, Tomás Valla

CoRR, 2016

On Directed Steiner Trees with Multiple Roots.

Ondrej Suchý

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

Finding Secluded Places of Special Interest in Graphs.

René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015

Polynomial-Time Data Reduction for the Subset Interconnection Design Problem.

Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller

SIAM J. Discret. Math., 2015

On the Parameterized Complexity of Computing Balanced Partitions in Graphs.

René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý

Theory Comput. Syst., 2015

On explaining integer vectors by few homogeneous segments.

Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý

J. Comput. Syst. Sci., 2015

A refined complexity analysis of degree anonymization in graphs.

Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý

Inf. Comput., 2015

On structural parameterizations for the 2-club problem.

Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý

Discret. Appl. Math., 2015

2014

Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound.

Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý

J. Comput. Syst. Sci., 2014

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.

Robert Bredereck, Jiehua Chen, Sepp Hartung, Stefan Kratsch, Rolf Niedermeier, Ondrej Suchý, Gerhard J. Woeginger

J. Artif. Intell. Res., 2014

Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation).

Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Solving Multicut Faster Than 2 n.

Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý

Proceedings of the Algorithms - ESA 2014, 2014

2013

An FPT algorithm for Tree Deletion Set.

Venkatesh Raman, Saket Saurabh, Ondrej Suchý

J. Graph Algorithms Appl., 2013

Feedback vertex set on graphs of low clique-width.

Binh-Minh Bui-Xuan, Ondrej Suchý, Jan Arne Telle, Martin Vatshelle

Eur. J. Comb., 2013

The Parameterized Complexity of Local Search for TSP, More Refined.

Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý

Algorithmica, 2013

On the Parameterized Complexity of Computing Graph Bisections.

René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

On Explaining Integer Vectors by Few Homogenous Segments.

Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Effective and Efficient Data Reduction for the Subset Interconnection Design Problem.

Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Parameterized Complexity of DAG Partitioning.

René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012

Parameterized complexity of generalized domination problems.

Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý

Discret. Appl. Math., 2012

Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound.

Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.

Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý, Stefan Kratsch

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Parameterized Complexity of Arc-Weighted Directed Steiner Problems.

Jiong Guo, Rolf Niedermeier, Ondrej Suchý

SIAM J. Discret. Math., 2011

Parameterized Problems Related to Seidel's Switching.

Eva Jelínková, Ondrej Suchý, Petr Hlinený, Jan Kratochvíl

Discret. Math. Theor. Comput. Sci., 2011

2009

Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs.

Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil

J. Graph Algorithms Appl., 2009

What Makes Equitable Connected Partition Easy.

Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

2008

Clustered Planarity: Clusters with Few Outgoing Edges.

Vít Jelínek, Ondrej Suchý, Marek Tesar, Tomás Vyskocil

Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007

Clustered Planarity: Small Clusters in Eulerian Graphs.

Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil

Proceedings of the Graph Drawing, 15th International Symposium, 2007