Solving Simple Stochastic Games with Few Coin Toss Positions. - Rasmus Ibsen-Jensen; Peter Bro Miltersen (ESA, 2012)

Strategy Complexity of Finite-Horizon Markov Decision Processes and Simple Stochastic Games. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (MEMICS, 2012)

The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games. - Thomas Dueholm Hansen; Rasmus Ibsen-Jensen (CiE, 2013)

A Faster Algorithm for Solving One-Clock Priced Timed Games. - Thomas Dueholm Hansen; Rasmus Ibsen-Jensen; Peter Bro Miltersen (CONCUR, 2013)

Patience of matrix games. - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Vladimir V. Podolskii; Elias P. Tsigaridas (Discret. Appl. Math., 2013)

Edit distance for timed automata. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Rupak Majumdar (HSCC, 2014)

The Complexity of Ergodic Mean-payoff Games. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (ICALP (2), 2014)

Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis; Prateesh Goyal (CoRR, 2014)

Generalized Risk-Aversion in Stochastic Multi-Armed Bandits. - Alexander Zimin; Rasmus Ibsen-Jensen; Krishnendu Chatterjee (CoRR, 2014)

The Complexity of Solving Reachability Games Using Value and Strategy Iteration. - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Peter Bro Miltersen (Theory Comput. Syst., 2014)

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (CAV (1), 2015)

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis; Prateesh Goyal (POPL, 2015)

The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (SODA, 2015)

Strategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives. - Krishnendu Chatterjee; Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen (CoRR, 2015)

Qualitative analysis of concurrent mean-payoff games. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (Inf. Comput., 2015)

The Complexity of Deciding Legality of a Single Step of Magic: The Gathering. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (ECAI, 2016)

Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (ESA, 2016)

Robust Draws in Balanced Knockout Tournaments. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Josef Tkadlec (IJCAI, 2016)

The Big Match in Small Space - (Extended Abstract). - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Michal Koucký 001 (SAGT, 2016)

The Big Match in Small Space. - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Michal Koucký 001 (CoRR, 2016)

Strategy Complexity of Concurrent Safety Games. - Krishnendu Chatterjee; Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen (MFCS, 2017)

Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Martin A. Nowak (MFCS, 2017)

A short proof of correctness of the quasi-polynomial time algorithm for parity games. - Hugo Gimbert; Rasmus Ibsen-Jensen (CoRR, 2017)

Edit Distance for Pushdown Automata. - Krishnendu Chatterjee; Thomas A. Henzinger; Rasmus Ibsen-Jensen; Jan Otop (Log. Methods Comput. Sci., 2017)

Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Rasmus Ibsen-Jensen; Yaron Velner (CONCUR, 2018)

Infinite-Duration Poorman-Bidding Games. - Guy Avni; Thomas A. Henzinger; Rasmus Ibsen-Jensen (WINE, 2018)

Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Amir Kafshdar Goharshady; Andreas Pavlogiannis (ACM Trans. Program. Lang. Syst., 2018)

Bidding Games on Markov Decision Processes. - Guy Avni; Thomas A. Henzinger; Rasmus Ibsen-Jensen; Petr Novotný 001 (RP, 2019)

Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Prateesh Goyal; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (ACM Trans. Program. Lang. Syst., 2019)

All-Pay Bidding Games on Graphs. - Guy Avni; Rasmus Ibsen-Jensen; Josef Tkadlec (AAAI, 2020)

Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (ESOP, 2020)

One-Clock Priced Timed Games are PSPACE-hard. - John Fearnley; Rasmus Ibsen-Jensen; Rahul Savani (LICS, 2020)

Simplified Game of Life: Algorithms and Complexity. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Ismaël Jecker; Jakub Svoboda (MFCS, 2020)

Quantitative Verification on Product Graphs of Small Treewidth. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (FSTTCS, 2021)

Faster algorithms for quantitative verification in bounded treewidth graphs. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (Formal Methods Syst. Des., 2021)

Absorbing games with a clock and two bits of memory. - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Abraham Neyman (Games Econ. Behav., 2021)

Complexity of Spatial Games. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Ismaël Jecker; Jakub Svoboda (FSTTCS, 2022)

Games on Graphs. - Nathanaël Fijalkow; Nathalie Bertrand 001; Patricia Bouyer-Decitre; Romain Brenguier; Arnaud Carayol; John Fearnley; Hugo Gimbert; Florian Horn 001; Rasmus Ibsen-Jensen; Nicolas Markey; Benjamin Monmege; Petr Novotný 001; et al. (CoRR, 2023)

The Big Match with a Clock and a Bit of Memory. - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Abraham Neyman (Math. Oper. Res., 2023)

The Power of Counting Steps in Quantitative Games. - Sougata Bose; Rasmus Ibsen-Jensen; David Purser; Patrick Totzke; Pierre Vandenhove (CONCUR, 2024)

Bounded-Memory Strategies in Partial-Information Games. - Sougata Bose; Rasmus Ibsen-Jensen; Patrick Totzke (LICS, 2024)

Stochastic Games with Limited Public Memory. - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Abraham Neyman (CoRR, 2025)