| Publication | Date of Publication | Type |
|---|
Certifying induced subgraphs in large graphs
Journal of Graph Algorithms and Applications | 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
(available as arXiv preprint) | 2022-05-11 | Paper |
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
(available as arXiv preprint) | 2022-05-11 | Paper |
Generating Massive Scale-Free Networks under Resource Constraints
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
I/O-efficient generation of massive graphs following the LFR benchmark
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
An I/O-efficient distance oracle for evolving real-world graphs
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Design and implementation of a practical I/O-efficient shortest paths algorithm
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Improved external memory BFS implementations
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
| Large-scale graph generation and big data: an overview on recent results | 2019-07-03 | Paper |
An O ( n 2.75 ) algorithm for incremental topological ordering
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Mechanisms with monitoring for truthful RAM allocation
Web and Internet Economics | 2016-01-08 | Paper |
The optimal structure of algorithms for \(\alpha\)-paging
Information Processing Letters | 2015-09-15 | Paper |
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths
ACM Transactions on Algorithms | 2014-09-09 | Paper |
An implementation of I/O-efficient dynamic breadth-first search using level-aligned hierarchical clustering
Lecture Notes in Computer Science | 2013-09-17 | Paper |
| The nature of time | 2013-07-31 | Paper |
| On dynamic breadth-first search in external-memory | 2013-03-19 | Paper |
I/O-efficient hierarchical diameter approximation
Algorithms – ESA 2012 | 2012-09-25 | Paper |
New bounds for old algorithms: on the average-case behavior of classic single-source shortest-paths approaches
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
A computational study of external-memory BFS algorithms
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5734730 (Why is no real title available?) | 2010-07-09 | Paper |
I/O-efficient undirected shortest paths
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Online Paging for Flash Memory Devices
Algorithms and Computation | 2009-12-17 | Paper |
Times in tense logic
Notre Dame Journal of Formal Logic | 2009-11-18 | Paper |
Via Detours to I/O-Efficient Shortest Paths
Lecture Notes in Computer Science | 2009-11-12 | Paper |
`Now' and `then' in tense logic
Journal of Philosophical Logic | 2009-08-06 | Paper |
Design and Engineering of External Memory Traversal Algorithms for General Graphs
Algorithmics of Large and Complex Networks | 2009-07-09 | Paper |
Algorithms and Experiments for the Webgraph
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Algorithms and Experiments for the Webgraph
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
On Trade-Offs in External-Memory Diameter-Approximation
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
Lecture Notes in Computer Science | 2008-03-11 | Paper |
An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
An algorithm for online topological ordering
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Worlds and times
Notre Dame Journal of Formal Logic | 2006-10-04 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
An experimental study of priority queues in external memory
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
How to apply mathematics
Erkenntnis | 2005-04-07 | Paper |
Δ-stepping: a parallelizable shortest path algorithm
Journal of Algorithms | 2004-10-01 | Paper |
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Journal of Algorithms | 2004-03-14 | Paper |
On External-Memory Planar Depth First Search
Journal of Graph Algorithms and Applications | 2003-11-30 | Paper |
| Is science first-order? | 2003-11-18 | Paper |
| Prior and the Platonist | 2003-11-18 | Paper |
| scientific article; zbMATH DE number 1984681 (Why is no real title available?) | 2003-09-22 | Paper |
| scientific article; zbMATH DE number 1947435 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1882050 (Why is no real title available?) | 2003-03-13 | Paper |
| scientific article; zbMATH DE number 1863286 (Why is no real title available?) | 2003-02-04 | Paper |
| scientific article; zbMATH DE number 1830757 (Why is no real title available?) | 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
Journal of Algorithms | 2002-03-07 | Paper |
| External memory BFS on undirected graphs with bounded degree. | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1424323 (Why is no real title available?) | 2000-06-07 | Paper |
| scientific article; zbMATH DE number 1305103 (Why is no real title available?) | 2000-03-13 | Paper |
| scientific article; zbMATH DE number 1222607 (Why is no real title available?) | 1999-05-10 | Paper |
| scientific article; zbMATH DE number 1026283 (Why is no real title available?) | 1997-10-16 | Paper |
