| Publication | Date of Publication | Type |
|---|
| Certifying induced subgraphs in large graphs | 2024-11-12 | Paper |
| Engineering uniform sampling of graphs with a prescribed power-law degree sequence | 2024-05-24 | Paper |
| Parallel and I/O-efficient algorithms for non-linear preferential attachment | 2024-05-24 | Paper |
| On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape? | 2023-02-03 | Paper |
| Fragile complexity of comparison-based algorithms | 2022-05-11 | Paper |
| Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. | 2022-05-11 | Paper |
| Generating Massive Scale-Free Networks under Resource Constraints | 2019-09-12 | Paper |
| I/O-efficient Generation of Massive Graphs Following the LFR Benchmark | 2019-09-12 | Paper |
| An I/O-efficient Distance Oracle for Evolving Real-World Graphs | 2019-09-12 | Paper |
| Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm | 2019-09-11 | Paper |
| Improved external memory BFS implementations | 2019-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967231 | 2019-07-03 | Paper |
| An O ( n 2.75 ) algorithm for incremental topological ordering | 2018-11-05 | Paper |
| Mechanisms with Monitoring for Truthful RAM Allocation | 2016-01-08 | Paper |
| The optimal structure of algorithms for \(\alpha\)-paging | 2015-09-15 | Paper |
| I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths | 2014-09-09 | Paper |
| An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering | 2013-09-17 | Paper |
| The Nature of Time | 2013-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910749 | 2013-03-19 | Paper |
| I/O-efficient Hierarchical Diameter Approximation | 2012-09-25 | Paper |
| New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches | 2011-05-12 | Paper |
| A computational study of external-memory BFS algorithms | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3574271 | 2010-07-09 | Paper |
| I/O-efficient undirected shortest paths | 2010-03-03 | Paper |
| Online Paging for Flash Memory Devices | 2009-12-17 | Paper |
| Times in tense logic | 2009-11-18 | Paper |
| Via Detours to I/O-Efficient Shortest Paths | 2009-11-12 | Paper |
| `Now' and `then' in tense logic | 2009-08-06 | Paper |
| Design and Engineering of External Memory Traversal Algorithms for General Graphs | 2009-07-09 | Paper |
| Algorithms and Experiments for the Webgraph | 2009-01-19 | Paper |
| On Trade-Offs in External-Memory Diameter-Approximation | 2008-07-15 | Paper |
| I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths | 2008-03-11 | Paper |
| An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering | 2007-09-07 | Paper |
| An algorithm for online topological ordering | 2007-05-29 | Paper |
| Worlds and times | 2006-10-04 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| An experimental study of priority queues in external memory | 2005-08-04 | Paper |
| RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS | 2005-06-10 | Paper |
| How to apply mathematics | 2005-04-07 | Paper |
| Δ-stepping: a parallelizable shortest path algorithm | 2004-10-01 | Paper |
| Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds | 2004-03-14 | Paper |
| On External-Memory Planar Depth First Search | 2003-11-30 | Paper |
| Is science first-order? | 2003-11-18 | Paper |
| Prior and the Platonist | 2003-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428992 | 2003-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411404 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4797426 | 2003-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791917 | 2003-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778580 | 2002-11-18 | Paper |
| Single-source shortest-paths on arbitrary directed graphs in linear average-case time | 2002-07-22 | Paper |
| Oblivious gossiping on tori | 2002-03-07 | Paper |
| External memory BFS on undirected graphs with bounded degree. | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945537 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252046 | 2000-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218150 | 1999-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4342908 | 1997-10-16 | Paper |
