| Publication | Date of Publication | Type |
|---|
| Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths | 2024-12-03 | Paper |
| Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths | 2024-04-23 | Paper |
| A Simple 2-Approximation for Maximum-Leaf Spanning Tree | 2023-11-16 | Paper |
| Finding a shortest even hole in polynomial time | 2023-10-05 | Paper |
| An Optimal Multiple-Class Encoding Scheme for a Graph of Bounded Hadwiger Number | 2023-07-04 | Paper |
| Detecting race conditions in parallel programs that use one semaphore | 2023-01-18 | Paper |
| Improved Algorithms for Recognizing Perfect Graphs and Finding Shortest Odd and Even Holes | 2022-07-15 | Paper |
| Three-in-a-tree in near linear time | 2021-01-19 | Paper |
| Three-in-a-Tree in Near Linear Time | 2019-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743476 | 2019-05-10 | Paper |
| Balanced parentheses strike back | 2018-11-05 | Paper |
| Race-condition detection in parallel computation with semaphores (extended abstract) | 2017-12-05 | Paper |
| Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths | 2017-03-16 | Paper |
| A faster algorithm to recognize even-hole-free graphs | 2015-06-10 | Paper |
| Linear-time algorithms for tree root problems | 2015-05-26 | Paper |
| Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits | 2014-07-30 | Paper |
| Replacement Paths via Row Minima of Concise Matrices | 2014-06-19 | Paper |
| Computing the girth of a planar graph in linear time | 2013-09-25 | Paper |
| Two-dimensional homing sort | 2013-04-04 | Paper |
| Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors | 2013-03-21 | Paper |
| Computing the girth of a planar graph in linear time | 2011-08-17 | Paper |
| Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees | 2010-12-03 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| An optimal labeling for node connectivity | 2009-12-17 | Paper |
| Minimum cycle bases of weighted outerplanar graphs | 2009-12-17 | Paper |
| Visibility representations of four-connected plane graphs with near optimal heights | 2009-08-14 | Paper |
| Fast algorithms for the density finding problem | 2009-06-17 | Paper |
| Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights | 2009-03-03 | Paper |
| Width-Optimal Visibility Representations of Plane Graphs | 2008-05-27 | Paper |
| Linear-Time Algorithms for Tree Root Problems | 2007-09-07 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| Computational Science – ICCS 2005 | 2005-11-30 | Paper |
| Orderly Spanning Trees with Applications | 2005-09-16 | Paper |
| Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications | 2005-05-12 | Paper |
| Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer | 2005-02-28 | Paper |
| An Optimal Algorithm for the Maximum-Density Segment Problem | 2005-02-21 | Paper |
| Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808622 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043739 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472326 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472482 | 2004-08-04 | Paper |
| Compact floor-planning via orderly spanning trees | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422293 | 2003-09-03 | Paper |
| Detecting race conditions in parallel programs that use semaphores | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418633 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410125 | 2003-07-02 | Paper |
| Orderly spanning trees with applications to graph encoding and graph drawing | 2002-03-24 | Paper |
| A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228487 | 2000-05-28 | Paper |
| Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings | 1999-11-23 | Paper |
| Operations of interlaced trees and graceful trees | 1999-11-01 | Paper |
| Approximating Maximum Leaf Spanning Trees in Almost Linear Time | 1998-11-11 | Paper |
