| 2026 | ESA | Tree-Independence Number of P₅-Free Graphs with No Large Bicliques. | Vclav Blazej, Jochen Pascal Gollin, Toms Hons, Toms Masark, Martin Milanic, Pawel Rzazewski, Ondrej Such, Alexandra Wesolek |
| 2025 | ISAAC | Parameterized Complexity of Directed Traveling Salesman Problem. | Vclav Blazej, Andreas Emil Feldmann, Foivos Fioravantes, Pawel Rzazewski, Ondrej Such |
| 2025 | ISAAC | Pathfinding in Self-Deleting Graphs. | Michal Dvork, Dusan Knop, Michal Opler, Jan Pokorn, Ondrej Such, Krisztina Szilgyi |
| 2025 | IECON | Voltage Zero-Sequence Components in Optimal Control of Five-Phase PMSM Drives. | Jan Laksar, Toms Komrska, Ondrej Such, Vclav Smdl |
| 2024 | IECON | Predictive control of IPMSM using a precise mathematical model with low implementation demands. | Ondrej Such, Stepn Janous, Jakub Talla, Toms Kosan |
| 2023 | WG | Generating Faster Algorithms for d-Path Vertex Cover. | Radovan Cerven, Ondrej Such |
| 2022 | AAAI | Hedonic Diversity Games: A Complexity Picture with More than Two Colors. | Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Such |
| 2022 | AAAI | Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract). | Dusan Knop, Simon Schierreich, Ondrej Such |
| 2022 | ESA | On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. | Vclav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Such, Toms Valla |
| 2022 | MFCS | On Kernels for d-Path Vertex Cover. | Radovan Cerven, Pratibha Choudhary, Ondrej Such |
| 2021 | IECON | Predictive control of PMSM using improved model of the drive. | Ondrej Such, Stepn Janous, Jakub Talla, Zdenek Peroutka |
| 2021 | IWOCA | Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters. | Martin Kucera, Ondrej Such |
| 2021 | WAOA | Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set. | Vclav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matys Kristan, Ondrej Such, Toms Valla |
| 2019 | MFCS | Faster FPT Algorithm for 5-Path Vertex Cover. | Radovan Cerven, Ondrej Such |
| 2019 | STACS | Complexity of the Steiner Network Problem with Respect to the Number of Terminals. | Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Such |
| 2018 | ISAAC | Cluster Editing in Multi-Layer and Temporal Graphs. | Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Such |
| 2016 | WG | On Directed Steiner Trees with Multiple Roots. | Ondrej Such |
| 2014 | ESA | Solving Multicut Faster Than 2 n. | Daniel Lokshtanov, Saket Saurabh, Ondrej Such |
| 2013 | CIAC | Parameterized Complexity of DAG Partitioning. | Ren van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hffner, Andr Nichterlein, Ondrej Such |
| 2013 | ESA | Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. | Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Such |
| 2013 | ICALP | A Refined Complexity Analysis of Degree Anonymization in Graphs. | Sepp Hartung, Andr Nichterlein, Rolf Niedermeier, Ondrej Such |
| 2013 | ISAAC | Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. | Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Such, Mathias Weller |
| 2013 | WADS | On Explaining Integer Vectors by Few Homogenous Segments. | Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Such |
| 2013 | WALCOM | An FPT Algorithm for Tree Deletion Set. | Venkatesh Raman, Saket Saurabh, Ondrej Such |
| 2013 | WG | On the Parameterized Complexity of Computing Graph Bisections. | Ren van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Such |
| 2012 | AAAI | A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. | Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf Niedermeier, Ondrej Such, Stefan Kratsch |
| 2011 | ISAAC | The Parameterized Complexity of Local Search for TSP, More Refined. | Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Such |
| 2009 | ISAAC | Parameterized Complexity of Arc-Weighted Directed Steiner Problems. | Jiong Guo, Rolf Niedermeier, Ondrej Such |
| 2009 | WG | Parameterized Complexity of Generalized Domination Problems. | Petr A. Golovach, Jan Kratochvl, Ondrej Such |
| 2008 | GD | Clustered Planarity: Clusters with Few Outgoing Edges. | Vt Jelnek, Ondrej Such, Marek Tesar, Toms Vyskocil |
| 2007 | GD | Clustered Planarity: Small Clusters in Eulerian Graphs. | Eva Jelnkov, Jan Kra, Jan Kratochvl, Martin Pergel, Ondrej Such, Toms Vyskocil |