| Publication | Date of Publication | Type |
|---|
| Counting edges in a dag | 2024-06-05 | Paper |
On-line graph algorithms for incremental compilation
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Multi-dimensional Interval Routing Schemes
Distributed Algorithms | 2023-12-01 | Paper |
An experimental study of dynamic algorithms for transitive closure
ACM Journal of Experimental Algorithmics | 2017-06-15 | Paper |
The incremental maintenance of a depth-first-search tree in directed acyclic graphs
Information Processing Letters | 2016-05-26 | Paper |
Structure theorems for optimum hyperpaths in directed hypergraphs
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Linear time analysis of properties of conflict-free and general Petri nets
Theoretical Computer Science | 2011-02-02 | Paper |
Power balance and apportionment algorithms for the United States Congress
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
Fully dynamic shortest paths in digraphs with arbitrary arc weights
Journal of Algorithms | 2004-10-01 | Paper |
Incremental algorithms for the single-source shortest path problem
Lecture Notes in Computer Science | 2004-07-01 | Paper |
A fully dynamic algorithm for distributed shortest paths.
Theoretical Computer Science | 2003-08-17 | Paper |
Characterization results of all shortest paths interval routing schemes
Networks | 2003-06-26 | Paper |
Characterization results of all shortest paths interval routing schemes
Networks | 2003-06-26 | Paper |
Maintaining a topological order under edge insertions
Information Processing Letters | 2003-06-24 | Paper |
Dynamic algorithms for classes of constraint satisfaction problems
Theoretical Computer Science | 2001-08-20 | Paper |
A fully dynamic algorithm for distributed shortest paths
Lecture Notes in Computer Science | 2000-10-03 | Paper |
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
Journal of Algorithms | 2000-08-28 | Paper |
Fully dynamic shortest paths and negative cycles detection on digraphs with arbitrary arc weights
Lecture Notes in Computer Science | 2000-03-13 | Paper |
Hypergraph traversal revisited: Cost measures and dynamic algorithms
Lecture Notes in Computer Science | 1999-07-14 | Paper |
Semidynamic algorithms for maintaining single-source shortest path trees
Algorithmica | 1999-06-22 | Paper |
A uniform approach to semi-dynamic problems on digraphs
Theoretical Computer Science | 1999-01-12 | Paper |
Multidimensional interval routing schemes
Theoretical Computer Science | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 871917 (Why is no real title available?) | 1996-04-28 | Paper |
| scientific article; zbMATH DE number 432746 (Why is no real title available?) | 1994-01-02 | Paper |
Competitive algorithms for the weighted list update problem
Lecture Notes in Computer Science | 1993-05-18 | Paper |
The weighted list update problem and the lazy adversary
Theoretical Computer Science | 1993-05-16 | Paper |
| Dynamic data structures for series parallel digraphs | 1993-03-28 | Paper |
On-line computation of minimal and maximal length paths
Theoretical Computer Science | 1992-06-28 | Paper |
Incremental algorithms for minimal length paths
Journal of Algorithms | 1992-06-28 | Paper |
Dynamic maintenance of directed hypergraphs
Theoretical Computer Science | 1990-01-01 | Paper |
