| Publication | Date of Publication | Type |
|---|
Counting edges in a dag
| 2024-06-05 | Paper |
Semi-dynamic shortest paths and breadth-first search in digraphs
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Dynamically switching vertices in planar graphs (extended abstract)
| 2021-12-20 | Paper |
Rigorous DC Solution of Partial Element Equivalent Circuit Models
IEEE Transactions on Circuits and Systems I: Regular Papers | 2021-08-26 | Paper |
scientific article; zbMATH DE number 7121837 (Why is no real title available?)
| 2019-10-24 | Paper |
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Fully Dynamic 2-Hop Cover Labeling
ACM Journal of Experimental Algorithmics | 2019-03-27 | Paper |
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
Information and Computation | 2018-12-03 | Paper |
Fully dynamic update of arc-flags
Networks | 2018-05-23 | Paper |
Engineering graph-based models for dynamic timetable information systems
Journal of Discrete Algorithms | 2017-11-09 | Paper |
An experimental study of dynamic algorithms for transitive closure
ACM Journal of Experimental Algorithmics | 2017-06-15 | Paper |
Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments
ACM Journal of Experimental Algorithmics | 2016-10-24 | Paper |
Distance Queries in Large-Scale Fully Dynamic Complex Networks
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Synchronous robots vs asynchronous lights-enhanced robots on graphs
| 2016-08-05 | Paper |
Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios
Theory of Computing Systems | 2016-01-28 | Paper |
Path-fault-tolerant approximate shortest-path trees
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Explore and repair graphs with black holes using mobile entities
Theoretical Computer Science | 2015-10-30 | Paper |
Dynamically maintaining shortest path trees under batches of updates
Structural Information and Communication Complexity | 2013-12-17 | Paper |
A loop-free shortest-path routing algorithm for dynamic networks
Theoretical Computer Science | 2013-12-13 | Paper |
Recoverable robustness for train shunting problems
Algorithmic Operations Research | 2013-12-11 | Paper |
Engineering a new algorithm for distributed shortest paths on dynamic networks
Algorithmica | 2013-05-16 | Paper |
Enhancing the computation of distributed shortest paths on real dynamic networks
Lecture Notes in Computer Science | 2013-04-19 | Paper |
Robust algorithms and price of robustness in shunting problems
| 2012-09-28 | Paper |
15. Maintenance of multi-level overlay graphs for timetable queries
| 2012-09-28 | Paper |
Partially dynamic efficient algorithms for distributed shortest paths
Theoretical Computer Science | 2010-03-09 | Paper |
Recoverable Robustness in Shunting and Timetabling
Robust and Online Large-Scale Optimization | 2009-12-03 | Paper |
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
Journal of Combinatorial Optimization | 2009-12-02 | Paper |
Delay Management Problem: Complexity Results and Robust Algorithms
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Dynamic multi-level overlay graphs for shortest paths
Mathematics in Computer Science | 2008-09-08 | Paper |
Power balance and apportionment algorithms for the United States Congress
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
Partially dynamic maintenance of minimum weight hyperpaths
Journal of Discrete Algorithms | 2005-05-04 | Paper |
Fully dynamic shortest paths in digraphs with arbitrary arc weights
Journal of Algorithms | 2004-10-01 | Paper |
scientific article; zbMATH DE number 2077114 (Why is no real title available?)
| 2004-07-01 | Paper |
scientific article; zbMATH DE number 2044509 (Why is no real title available?)
| 2004-02-18 | Paper |
A fully dynamic algorithm for distributed shortest paths.
Theoretical Computer Science | 2003-08-17 | Paper |
A general strategy for decomposing topological invariants of spatial databases and an application
Data & Knowledge Engineering | 2002-07-15 | Paper |
scientific article; zbMATH DE number 1942825 (Why is no real title available?)
| 2002-01-01 | Paper |
Dynamic algorithms for classes of constraint satisfaction problems
Theoretical Computer Science | 2001-08-20 | Paper |
Dynamically switching vertices in planar graphs
Algorithmica | 2001-04-26 | Paper |
Semi-dynamic breadth-first search in digraphs
Theoretical Computer Science | 2000-12-12 | Paper |
scientific article; zbMATH DE number 1512693 (Why is no real title available?)
| 2000-10-03 | Paper |
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
Journal of Algorithms | 2000-08-28 | Paper |
scientific article; zbMATH DE number 1305092 (Why is no real title available?)
| 2000-03-13 | 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 |
scientific article; zbMATH DE number 1104331 (Why is no real title available?)
| 1998-02-05 | Paper |
scientific article; zbMATH DE number 871917 (Why is no real title available?)
| 1996-04-28 | Paper |
