| 2026 | SODA | Dichotomy for orderings? | Gbor Kun, Jaroslav Nesetril |
| 2026 | SOFSEM | Complexity Aspects of Homomorphisms of Ordered Graphs. | Michal Certk, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski |
| 2025 | ICTAC | On Computational Aspects of Ordered Matching Problems. | Michal Certk, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski |
| 2022 | CSL | Structural Properties of the First-Order Transduction Quasiorder. | Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz |
| 2021 | SODA | Rankwidth meets stability. | Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz |
| 2020 | SODA | Linear rankwidth meets stability. | Jaroslav Nesetril, Roman Rabinovich, Patrice Ossona de Mendez, Sebastian Siebertz |
| 2018 | ICALP | First-Order Interpretations of Bounded Expansion Classes. | Jakub Gajarsk, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk |
| 2018 | ICALP | Sparsity - an Algorithmic Perspective (Invited Paper). | Jaroslav Nesetril |
| 2012 | MFCS | When Trees Grow Low: Shrubs and Fast MSO1. | Robert Ganian, Petr Hlinen, Jaroslav Nesetril, Jan Obdrzlek, Patrice Ossona de Mendez, Reshma Ramadurai |
| 2007 | MFCS | NP by Means of Lifts and Shadows. | Gbor Kun, Jaroslav Nesetril |
| 2007 | MFCS | Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete. | Jaroslav Nesetril, Mark H. Siggers |
| 2006 | STOC | Linear time low tree-width partitions and algorithmic consequences. | Jaroslav Nesetril, Patrice Ossona de Mendez |
| 2006 | WG | Generalised Dualities and Finite Maximal Antichains. | Jan Foniok, Jaroslav Nesetril, Claude Tardif |
| 2003 | CSL | Constraint Satisfaction with Countable Homogeneous Templates. | Manuel Bodirsky, Jaroslav Nesetril |
| 2002 | ESA | Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations. | Jana Maxov, Jaroslav Nesetril |
| 2002 | WG | More about Subcolorings. | Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger |
| 2001 | GD | Towards an Aesthetic Invariant for Graph Drawing. | Jan Adamec, Jaroslav Nesetril |
| 1999 | GD | Art of Drawing. | Jaroslav Nesetril |
| 1997 | SOFSEM | Solving and Approximating Combinatorial Optimization Problems (Towards MAX CUT and TSP). | Jaroslav Nesetril, Daniel Turzk |
| 1988 | STOC | Linearity and Unprovability of Set Union Problem Strategies | Martin Loebl, Jaroslav Nesetril |
| 1987 | ICALP | Posets, Boolean Representations and Quick Path Searching. | Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo |
| 1981 | MFCS | Representations of Graphs by Means of Products and Their Complexity. | Jaroslav Nesetril |
| 1977 | FCT | A Dushnik - Miller Type Dimension of Graphs and its Complexity. | Jaroslav Nesetril, Ales Pultr |