| Publication | Date of Publication | Type |
|---|
Space-efficient graph kernelizations
| 2024-11-12 | Paper |
Space-efficient graph coarsening with applications to succinct planar encodings
| 2024-09-11 | Paper |
Sorting and ranking of self-delimiting numbers with applications to tree isomorphism
Lecture Notes in Computer Science | 2023-12-22 | Paper |
Space-efficient vertex separators for treewidth
Algorithmica | 2022-08-18 | Paper |
Simple 2^f-Color Choice Dictionaries
| 2022-07-21 | Paper |
Two moves per time step make a difference
| 2022-07-21 | Paper |
Extra space during initialization of succinct data structures and dynamical initializable arrays
| 2021-08-04 | Paper |
Multistage graph problems on a global budget
Theoretical Computer Science | 2021-05-10 | Paper |
On temporal graph exploration
Journal of Computer and System Sciences | 2021-04-14 | Paper |
On-the-fly array initialization in less space
| 2020-11-25 | Paper |
Linear-time in-place DFS and BFS on the word RAM
| 2020-02-06 | Paper |
Approximate tree decompositions of planar graphs in linear time
| 2019-05-10 | Paper |
Space-efficient biconnected components and recognition of outerplanar graphs
Algorithmica | 2019-03-11 | Paper |
Space-efficient Euler partition and bipartite edge coloring
Theoretical Computer Science | 2018-12-04 | Paper |
Space-efficient plane-sweep algorithms
| 2018-04-19 | Paper |
Space-efficient biconnected components and recognition of outerplanar graphs
| 2018-03-21 | Paper |
Space-Efficient Euler Partition and Bipartite Edge Coloring
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Space-efficient basic graph algorithms
| 2017-01-24 | Paper |
Approximate tree decompositions of planar graphs in linear time
Theoretical Computer Science | 2016-08-31 | Paper |
On temporal graph exploration
Lecture Notes in Computer Science | 2015-10-27 | Paper |
A linear-time kernelization for the rooted \(k\)-leaf outbranching problem
Discrete Applied Mathematics | 2015-07-24 | Paper |
Approximation algorithms for intersection graphs
Algorithmica | 2014-12-02 | Paper |
Query-competitive algorithms for cheapest set problems under uncertainty
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
A linear-time kernelization for the rooted \(k\)-leaf outbranching problem
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Linear-time computation of a linear problem kernel for dominating set on planar graphs
Parameterized and Exact Computation | 2012-06-15 | Paper |
Removing local extrema from imprecise terrains
Computational Geometry | 2012-05-18 | Paper |
The complexity of minimum convex coloring
Discrete Applied Mathematics | 2012-05-11 | Paper |
Approximation algorithms for intersection graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
The \(k\)-disjoint paths problem on chordal graphs
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
The Complexity of Minimum Convex Coloring
Algorithms and Computation | 2009-01-29 | Paper |
Determining the Smallest k Such That G Is k-Outerplanar
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Simultaneous Embedding with Two Bends per Edge in Polynomial Area
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Network Analysis
Lecture Notes in Computer Science | 2005-11-11 | Paper |
