Clustered Planarity: Small Clusters in Eulerian Graphs. - Eva Jelínková; Jan Kára; Jan Kratochvíl; Martin Pergel; Ondrej Suchý 001; Tomás Vyskocil (GD, 2007)

Clustered Planarity: Clusters with Few Outgoing Edges. - Vít Jelínek; Ondrej Suchý 001; Marek Tesar 001; Tomás Vyskocil (GD, 2008)

What Makes Equitable Connected Partition Easy. - Rosa Enciso; Michael R. Fellows; Jiong Guo; Iyad A. Kanj; Frances A. Rosamond; Ondrej Suchý 001 (IWPEC, 2009)

Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs. - Eva Jelínková; Jan Kára; Jan Kratochvíl; Martin Pergel; Ondrej Suchý 001; Tomás Vyskocil (J. Graph Algorithms Appl., 2009)

Parameterized Problems Related to Seidel's Switching. - Eva Jelínková; Ondrej Suchý 001; Petr Hlinený; Jan Kratochvíl (Discret. Math. Theor. Comput. Sci., 2011)

Parameterized Complexity of Arc-Weighted Directed Steiner Problems. - Jiong Guo; Rolf Niedermeier; Ondrej Suchý 001 (SIAM J. Discret. Math., 2011)

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. - Robert Bredereck; Jiehua Chen 001; Sepp Hartung; Rolf Niedermeier; Ondrej Suchý 001; Stefan Kratsch (AAAI, 2012)

Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound. - Matthias Mnich; Geevarghese Philip; Saket Saurabh 001; Ondrej Suchý 001 (FSTTCS, 2012)

Parameterized complexity of generalized domination problems. - Petr A. Golovach; Jan Kratochvíl; Ondrej Suchý 001 (Discret. Appl. Math., 2012)

Parameterized Complexity of DAG Partitioning. - René van Bevern; Robert Bredereck; Morgan Chopin; Sepp Hartung; Falk Hüffner; André Nichterlein; Ondrej Suchý 001 (CIAC, 2013)

Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. - Jiehua Chen 001; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge; Ondrej Suchý 001; Mathias Weller (ISAAC, 2013)

On Explaining Integer Vectors by Few Homogenous Segments. - Robert Bredereck; Jiehua Chen 001; Sepp Hartung; Christian Komusiewicz; Rolf Niedermeier; Ondrej Suchý 001 (WADS, 2013)

On the Parameterized Complexity of Computing Graph Bisections. - René van Bevern; Andreas Emil Feldmann; Manuel Sorge; Ondrej Suchý 001 (WG, 2013)

The Parameterized Complexity of Local Search for TSP, More Refined. - Jiong Guo; Sepp Hartung; Rolf Niedermeier; Ondrej Suchý 001 (Algorithmica, 2013)

Feedback vertex set on graphs of low clique-width. - Binh-Minh Bui-Xuan; Ondrej Suchý 001; Jan Arne Telle; Martin Vatshelle (Eur. J. Comb., 2013)

An FPT algorithm for Tree Deletion Set. - Venkatesh Raman 001; Saket Saurabh 001; Ondrej Suchý 001 (J. Graph Algorithms Appl., 2013)

Solving Multicut Faster Than 2 n. - Daniel Lokshtanov; Saket Saurabh 001; Ondrej Suchý 001 (ESA, 2014)

Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation). - Archontia C. Giannopoulou; Daniel Lokshtanov; Saket Saurabh 001; Ondrej Suchý 001 (FSTTCS, 2014)

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. - Robert Bredereck; Jiehua Chen 001; Sepp Hartung; Stefan Kratsch; Rolf Niedermeier; Ondrej Suchý 001; Gerhard J. Woeginger (J. Artif. Intell. Res., 2014)

Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound. - Matthias Mnich; Geevarghese Philip; Saket Saurabh 001; Ondrej Suchý 001 (J. Comput. Syst. Sci., 2014)

On structural parameterizations for the 2-club problem. - Sepp Hartung; Christian Komusiewicz; André Nichterlein; Ondrej Suchý 001 (Discret. Appl. Math., 2015)

A refined complexity analysis of degree anonymization in graphs. - Sepp Hartung; André Nichterlein; Rolf Niedermeier; Ondrej Suchý 001 (Inf. Comput., 2015)

On explaining integer vectors by few homogeneous segments. - Robert Bredereck; Jiehua Chen 001; Sepp Hartung; Christian Komusiewicz; Rolf Niedermeier; Ondrej Suchý 001 (J. Comput. Syst. Sci., 2015)

On the Parameterized Complexity of Computing Balanced Partitions in Graphs. - René van Bevern; Andreas Emil Feldmann; Manuel Sorge; Ondrej Suchý 001 (Theory Comput. Syst., 2015)

Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. - Jiehua Chen 001; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge; Ondrej Suchý 001; Mathias Weller (SIAM J. Discret. Math., 2015)

Finding Secluded Places of Special Interest in Graphs. - René van Bevern; Till Fluschnik; George B. Mertzios; Hendrik Molter; Manuel Sorge; Ondrej Suchý 001 (IPEC, 2016)

On Directed Steiner Trees with Multiple Roots. - Ondrej Suchý 001 (WG, 2016)

A Simpler Bit-parallel Algorithm for Swap Matching. - Václav Blazej; Ondrej Suchý 001; Tomás Valla (CoRR, 2016)

Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation. - Archontia C. Giannopoulou; Daniel Lokshtanov; Saket Saurabh 001; Ondrej Suchý 001 (SIAM J. Discret. Math., 2016)

A Simple Streaming Bit-Parallel Algorithm for Swap Pattern Matching. - Václav Blazej; Ondrej Suchý 001; Tomás Valla (MACIS, 2017)

Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices. - Ondrej Suchý 001 (Algorithmica, 2017)

A Parameterized View on Multi-Layer Cluster Editing. - Jiehua Chen 001; Hendrik Molter; Manuel Sorge; Ondrej Suchý 001 (CoRR, 2017)

Fixed-parameter algorithms for DAG Partitioning. - René van Bevern; Robert Bredereck; Morgan Chopin; Sepp Hartung; Falk Hüffner; André Nichterlein; Ondrej Suchý 001 (Discret. Appl. 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ý 001 (J. Sched., 2017)

Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. - Mark Jones 001; Daniel Lokshtanov; M. S. Ramanujan 001; Saket Saurabh 001; Ondrej Suchý 001 (SIAM J. Discret. Math., 2017)

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ý 001 (Discret. Optim., 2018)

Faster FPT Algorithm for 5-Path Vertex Cover. - Radovan Cervený; Ondrej Suchý 001 (MFCS, 2019)

Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem. - Josef Malík; Ondrej Suchý 001; Tomás Valla (SEA², 2019)

Complexity of the Steiner Network Problem with Respect to the Number of Terminals. - Eduard Eiben; Dusan Knop; Fahad Panolan; Ondrej Suchý 001 (STACS, 2019)

A Tight Lower Bound for Planar Steiner Orientation. - Rajesh Chitnis; Andreas Emil Feldmann; Ondrej Suchý 001 (Algorithmica, 2019)

Balancing the Spread of Two Opinions in Sparse Social Networks. - Dusan Knop; Simon Schierreich; Ondrej Suchý 001 (CoRR, 2021)

A Parameterized Complexity View on Collapsing k-Cores. - Junjie Luo 001; Hendrik Molter; Ondrej Suchý 001 (Theory Comput. Syst., 2021)

Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract). - Dusan Knop; Simon Schierreich; Ondrej Suchý 001 (AAAI, 2022)

On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. - Václav Blazej; Pratibha Choudhary; Dusan Knop; Simon Schierreich; Ondrej Suchý 001; Tomás Valla (ESA, 2022)

Waypoint routing on bounded treewidth graphs. - Simon Schierreich; Ondrej Suchý 001 (Inf. Process. Lett., 2022)

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ý 001 (IPEC, 2023)

Generating Faster Algorithms for d-Path Vertex Cover. - Radovan Cervený; Ondrej Suchý 001 (WG, 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ý 001 (CoRR, 2023)

Maximizing Social Welfare in Score-Based Social Distance Games. - Robert Ganian; Thekla Hamm; Dusan Knop; Sanjukta Roy 001; Simon Schierreich; Ondrej Suchý 001 (TARK, 2023)

Polynomial kernels for tracking shortest paths. - Václav Blazej; Pratibha Choudhary; Dusan Knop; Jan Matyás Kristan; Ondrej Suchý 001; Tomás Valla (Inf. Process. Lett., 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ý 001; Tomás Valla (Discret. Optim., 2023)

Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters. - Martin Kucera; Ondrej Suchý 001 (Algorithmica, 2023)

Hedonic diversity games: A complexity picture with more than two colors. - Robert Ganian; Thekla Hamm; Dusan Knop; Simon Schierreich; Ondrej Suchý 001 (Artif. Intell., 2023)

On kernels for d-path vertex cover. - Radovan Cervený; Pratibha Choudhary; Ondrej Suchý 001 (J. Comput. Syst. Sci., 2024)

Cluster Editing for Multi-Layer and Temporal Graphs. - Jiehua Chen 001; Hendrik Molter; Manuel Sorge; Ondrej Suchý 001 (Theory Comput. Syst., 2024)

Parameterized Complexity of Directed Traveling Salesman Problem. - Václav Blazej; Andreas Emil Feldmann; Foivos Fioravantes; Pawel Rzazewski; Ondrej Suchý 001 (CoRR, 2025)

Pathfinding in Self-Deleting Graphs. - Michal Dvorák; Dusan Knop; Michal Opler; Jan Pokorný; Ondrej Suchý 001; Krisztina Szilágyi (CoRR, 2025)