| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126484 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6191023 | 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 |
| Traversability, reconfiguration, and reachability in the gadget framework | 2022-07-13 | Paper |
| Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets | 2022-07-13 | Paper |
| Optimal-area visibility representations of outer-1-plane graphs | 2022-07-01 | Paper |
| Continuous flattening of all polyhedral manifolds using countably infinite creases | 2021-09-17 | Paper |
| Snipperclips: cutting tools into desired polygons using themselves | 2021-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993299 | 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 |
| 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 |
| https://portal.mardi4nfdi.de/entity/Q3305736 | 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 |
| Dissection with the Fewest Pieces is Hard, Even to Approximate | 2017-02-01 | Paper |
| Mario Kart Is Hard | 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 | 0001-01-03 | Paper |
