| 2026 | FOSSACS | The Complexity of Games with Randomised Control. | Sarvin Bahmani, Rasmus Ibsen-Jensen, Soumyajit Paul, Sven Schewe, Friedrich Slivovsky, Qiyi Tang, Dominik Wojtczak, Shufang Zhu |
| 2024 | CONCUR | The Power of Counting Steps in Quantitative Games. | Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke, Pierre Vandenhove |
| 2024 | LICS | Bounded-Memory Strategies in Partial-Information Games. | Sougata Bose, Rasmus Ibsen-Jensen, Patrick Totzke |
| 2020 | AAAI | All-Pay Bidding Games on Graphs. | Guy Avni, Rasmus Ibsen-Jensen, Josef Tkadlec |
| 2020 | ESOP | Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis. | Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis |
| 2020 | LICS | One-Clock Priced Timed Games are PSPACE-hard. | John Fearnley, Rasmus Ibsen-Jensen, Rahul Savani |
| 2020 | MFCS | Simplified Game of Life: Algorithms and Complexity. | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismal Jecker, Jakub Svoboda |
| 2018 | CONCUR | Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. | Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Yaron Velner |
| 2017 | MFCS | Strategy Complexity of Concurrent Safety Games. | Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen |
| 2017 | MFCS | Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs. | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Martin A. Nowak |
| 2016 | ECAI | The Complexity of Deciding Legality of a Single Step of Magic: The Gathering. | Krishnendu Chatterjee, Rasmus Ibsen-Jensen |
| 2016 | ESA | Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs. | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis |
| 2016 | IJCAI | Robust Draws in Balanced Knockout Tournaments. | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Josef Tkadlec |
| 2016 | POPL | Algorithms for algebraic path properties in concurrent systems of constant treewidth components. | Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis |
| 2016 | SAGT | The Big Match in Small Space - (Extended Abstract). | Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Michal Kouck |
| 2015 | CAV | Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis |
| 2015 | ICALP | Edit Distance for Pushdown Automata. | Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop |
| 2015 | POPL | Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth. | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal |
| 2015 | SODA | The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games. | Krishnendu Chatterjee, Rasmus Ibsen-Jensen |
| 2014 | ICALP | The Complexity of Ergodic Mean-payoff Games. | Krishnendu Chatterjee, Rasmus Ibsen-Jensen |
| 2013 | CiE | The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games. | Thomas Dueholm Hansen, Rasmus Ibsen-Jensen |
| 2013 | CONCUR | A Faster Algorithm for Solving One-Clock Priced Timed Games. | Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen |
| 2012 | ESA | Solving Simple Stochastic Games with Few Coin Toss Positions. | Rasmus Ibsen-Jensen, Peter Bro Miltersen |
| 2011 | CSR | The Complexity of Solving Reachability Games Using Value and Strategy Iteration. | Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen |