| 2025 | IJCAI | Using Planning for Automated Testing of Video Games. | Toms Balyo, Roman Bartk, Luks Chrpa, Michal Cervenka, Filip Dvork, Stephan Gocht, Luks Lipck, Viktor Macek, Dominik Rohcek, Josef Ryz, Martin Suda, Dominik Safrnek, Slavomr Svancr, G. Michael Youngblood |
| 2024 | KR | Planning Domain Model Acquisition from State Traces without Action Parameters. | Toms Balyo, Martin Suda, Luks Chrpa, Dominik Safrnek, Stephan Gocht, Filip Dvork, Roman Bartk, G. Michael Youngblood |
| 2022 | SPLC | Black-box optimization in a configuration system. | Maximilian Kucher, Toms Balyo, Noemi Christensen |
| 2022 | WI | Explainable AI for Constraint-Based Expert Systems. | Jan Bode, Max Schemmer, Toms Balyo |
| 2021 | ArtsIT | AI Assisted Design of Sokoban Puzzles Using Automated Planning. | Toms Balyo, Nils Froleyks |
| 2021 | CP | Unit Propagation with Stable Watches (Short Paper). | Ashlin Iser, Toms Balyo |
| 2021 | CP | Parallelizing a SAT-Based Product Configurator. | Nils Merlin Ullmann, Toms Balyo, Michael Klein |
| 2019 | ICAART | Efficient SAT Encodings for Hierarchical Planning. | Dominik Schreiber, Damien Pellier, Humbert Fiorino, Toms Balyo |
| 2019 | ICFEM | Using DimSpec for Bounded and Unbounded Software Model Checking. | Marko Kleine Bning, Toms Balyo, Carsten Sinz |
| 2019 | ICTAI | Memory Efficient Parallel SAT Solving with Inprocessing. | Ashlin Iser, Toms Balyo, Carsten Sinz |
| 2019 | SoCS | Finding Optimal Longest Paths by Dynamic Programming in Parallel. | Kai Fieger, Toms Balyo, Christian Schulz, Dominik Schreiber |
| 2019 | SoCS | PASAR - Planning as Satisfiability with Abstraction Refinement. | Nils Christian Froleyks, Toms Balyo, Dominik Schreiber |
| 2018 | SoCS | Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks. | Toms Balyo, Luks Chrpa |
| 2017 | AAAI | SAT Competition 2016: Recent Developments. | Toms Balyo, Marijn J. H. Heule, Matti Jrvisalo |
| 2017 | SoCS | Using an Algorithm Portfolio to Solve Sokoban. | Nils Christian Froleyks, Toms Balyo |
| 2016 | SAT | HordeQBF: A Modular and Massively Parallel QBF Solver. | Toms Balyo, Florian Lonsing |
| 2015 | SAT | HordeSat: A Massively Parallel Portfolio SAT Solver. | Toms Balyo, Peter Sanders, Carsten Sinz |
| 2015 | SoCS | No One SATPlan Encoding To Rule Them All. | Toms Balyo, Roman Bartk |
| 2014 | SAT | Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask). | Toms Balyo, Andreas Frhlich, Marijn Heule, Armin Biere |
| 2014 | SoCS | On Different Strategies for Eliminating Redundant Actions from Plans. | Toms Balyo, Luks Chrpa, Asma Kilani |
| 2013 | ICTAI | Relaxing the Relaxed Exist-Step Parallel Planning Semantics. | Toms Balyo |
| 2013 | SERA | Solving SMT Problems with a Costly Decision Procedure by Finding Minimum Satisfying Assignments of Boolean Formulas. | Martin Babka, Toms Balyo, Jaroslav Keznikl |
| 2012 | ISAIM | On hierarchies over the SLUR class. | Vclav Vlcek, Toms Balyo, Stefan Gursk, Petr Kucera |
| 2012 | ICTAI | Shortening Plans by Local Re-planning. | Toms Balyo, Roman Bartk, Pavel Surynek |
| 2012 | SoCS | On Improving Plan Quality via Local Enhancements. | Toms Balyo, Roman Bartk, Pavel Surynek |