| Publication | Date of Publication | Type |
|---|
| Reconfiguration of non-crossing spanning trees | 2024-12-19 | Paper |
| Optimal-area visibility representations of outer-1-plane graphs | 2024-10-18 | Paper |
| Lower bounds on retroactive data structures | 2024-09-11 | Paper |
| Pushing blocks via checkable gadgets: PSPACE-completeness of push-1f and block/box dude | 2024-05-16 | Paper |
| The Legend of Zelda: the complexity of mechanics | 2024-04-09 | Paper |
| Characterizing the decidability of finite state automata team games with communication | 2024-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187829 | 2024-01-15 | Paper |
| Traversability, reconfiguration, and reachability in the gadget framework | 2023-11-17 | Paper |
| Arithmetic Expression Construction. | 2023-11-14 | Paper |
| Recursed Is Not Recursive: A Jarring Result | 2023-11-14 | Paper |
| When Can You Tile an Integer Rectangle with Integer Squares? | 2023-08-29 | Paper |
| Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets | 2023-08-01 | Paper |
| Negative instance for the edge patrolling beacon problem | 2023-03-31 | Paper |
| Tatamibari is NP-complete | 2023-02-07 | Paper |
| Walking through doors is hard, even without staircases: proving PSPACE-hardness via planar assemblies of door gadgets | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875768 | 2023-02-03 | Paper |
| This Game Is Not Going To Analyze Itself | 2023-02-02 | Paper |
| PSPACE-completeness of reversible deterministic systems | 2022-12-09 | Paper |
| Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets | 2022-07-13 | Paper |
| Traversability, reconfiguration, and reachability in the gadget framework | 2022-07-13 | Paper |
| Optimal-area visibility representations of outer-1-plane graphs | 2022-07-01 | Paper |
| Snipperclips: cutting tools into desired polygons using themselves | 2021-09-17 | Paper |
| Continuous flattening of all polyhedral manifolds using countably infinite creases | 2021-09-17 | Paper |
| Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy | 2021-06-15 | Paper |
| Generalized LR-drawings of trees | 2021-05-14 | Paper |
| Cooperating in video games? Impossible! Undecidability of team multiplayer games | 2020-09-03 | Paper |
| Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible | 2020-09-03 | Paper |
| Computational complexity of motion planning of a robot through simple gadgets | 2020-08-11 | Paper |
| The computational complexity of Portal and other 3D video games | 2020-08-11 | Paper |
| Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible | 2020-08-11 | Paper |
| Cooperating in video games? Impossible! Undecidability of team multiplayer games | 2020-08-11 | Paper |
| Escaping a Polygon | 2020-07-17 | Paper |
| Cookie clicker | 2020-04-03 | Paper |
| Pachinko | 2018-02-19 | Paper |
| Who needs crossings? Hardness of plane graph rigidity | 2018-01-30 | Paper |
| Push-pull block puzzles are hard | 2017-07-21 | Paper |
| Minimal forcing sets for 1D origami | 2017-03-18 | Paper |
| Mario Kart is hard | 2017-02-01 | Paper |
| Dissection with the fewest pieces is hard, even to approximate | 2017-02-01 | Paper |
| Toward an energy efficient language and compiler for (partially) reversible algorithms | 2016-08-10 | Paper |
| Energy-efficient algorithms | 2016-04-15 | Paper |
| Folding equilateral plane graphs | 2015-12-22 | Paper |
| Folding equilateral plane graphs | 2011-12-16 | Paper |
| Super Guarding and Dark Rays in Art Galleries | N/A | Paper |
