| Publication | Date of Publication | Type |
|---|
| Dynamic planar embedding is in DynFO | 2024-12-03 | Paper |
| Dynamic meta-theorems for distance and matching | 2024-06-24 | Paper |
| USSR is in P/poly | 2024-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187029 | 2024-02-05 | Paper |
| On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 | 2023-09-13 | Paper |
| Depth-First Search in Directed Planar Graphs, Revisited | 2023-08-08 | Paper |
| Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles | 2023-08-08 | Paper |
| Randomized and Symmetric Catalytic Computation | 2022-10-19 | Paper |
| Depth-first search in directed planar graphs, revisited | 2022-08-30 | Paper |
| Planar Maximum Matching: Towards a Parallel Algorithm | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090955 | 2022-07-21 | Paper |
| Dynamic complexity of expansion | 2022-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002805 | 2021-07-28 | Paper |
| A Strategy for Dynamic Programs: Start over and Muddle through | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5376663 | 2019-05-17 | Paper |
| Reachability Is in DynFO | 2019-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4584898 | 2018-09-04 | Paper |
| Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs | 2018-03-21 | Paper |
| Graph properties in node-query setting: effect of breaking symmetry | 2018-03-21 | Paper |
| Counting Euler Tours in Undirected Bounded Treewidth Graphs | 2017-07-13 | Paper |
| Reachability is in DynFO | 2015-11-04 | Paper |
| Bounded Treewidth and Space-Efficient Linear Algebra | 2015-09-30 | Paper |
| Planarity, Determinants, Permanents, and (Unique) Matchings | 2015-09-24 | Paper |
| Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs | 2014-10-14 | Paper |
| Dynamic Complexity of Directed Reachability and Other Problems | 2014-07-01 | Paper |
| Space Complexity of Optimization Problems in Planar Graphs | 2014-04-16 | Paper |
| Collapsing Exact Arithmetic Hierarchies | 2014-02-18 | Paper |
| Tree-width and Logspace: Determinants and Counting Euler Tours | 2013-12-28 | Paper |
| Log-space algorithms for paths and matchings in \(k\)-trees | 2013-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910722 | 2013-03-19 | Paper |
| Graph isomorphism for \(K_{3,3}\)-free and \(K_5\)-free graphs is in Log-space | 2012-10-24 | Paper |
| 3-connected Planar Graph Isomorphism is in Log-space | 2012-10-19 | Paper |
| Improved bounds for bipartite matching on surfaces | 2012-08-23 | Paper |
| Space complexity of perfect matching in bounded genus bipartite graphs | 2012-08-17 | Paper |
| Computing Bits of Algebraic Numbers | 2012-07-16 | Paper |
| Log-space algorithms for paths and matchings in \(k\)-trees | 2012-01-23 | Paper |
| Space complexity of perfect matching in bounded genus bipartite graphs | 2012-01-23 | Paper |
| Planarity testing revisited | 2011-07-01 | Paper |
| Some tractable win-lose games | 2011-07-01 | Paper |
| Deterministically isolating a perfect matching in bipartite planar graphs | 2010-10-06 | Paper |
| Planar and grid graph reachability problems | 2009-10-19 | Paper |
| Planarity, Determinants, Permanents, and (Unique) Matchings | 2008-06-03 | Paper |
| One-Input-Face MPCVP Is Hard for L, But in LogDCFL | 2008-04-17 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| Characterizing small depth and small space classes by operators of higher types | 2001-05-15 | Paper |
| On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits | 2001-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938621 | 2000-04-25 | Paper |
