| Publication | Date of Publication | Type |
|---|
| Dynamic Dominators and Low-High Orders in DAGs | 2022-05-11 | Paper |
An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph
2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
2-connectivity in directed graphs: an experimental study
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
2-Edge Connectivity in Directed Graphs
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Incremental low-high orders of directed graphs and applications
(available as arXiv preprint) | 2018-08-13 | Paper |
2-vertex connectivity in directed graphs
Information and Computation | 2018-06-14 | Paper |
On the Complexity of Removing Z-Cycles from a Checkpoints and Communication Pattern
IEEE Transactions on Computers | 2018-06-12 | Paper |
2-edge connectivity in directed graphs
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Directed hypergraphs: introduction and fundamental algorithms -- a survey
Theoretical Computer Science | 2017-02-06 | Paper |
Strong articulation points and strong bridges in large scale graphs
Algorithmica | 2016-04-06 | Paper |
Dynamic subtrees queries revisited: the depth first tour tree
Lecture Notes in Computer Science | 2016-04-04 | Paper |
2-vertex connectivity in directed graphs
Automata, Languages, and Programming | 2015-10-27 | Paper |
| Is timetabling routing always reliable for public transport? | 2014-02-24 | Paper |
Structure theorems for optimum hyperpaths in directed hypergraphs
Lecture Notes in Computer Science | 2012-11-02 | Paper |
An experimental study of dynamic dominators
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Finding strong bridges and strong articulation points in linear time
Theoretical Computer Science | 2012-08-13 | Paper |
Computing strongly connected components in the streaming model
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
Linear time analysis of properties of conflict-free and general Petri nets
Theoretical Computer Science | 2011-02-02 | Paper |
Finding strong bridges and strong articulation points in linear time
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
The online prize-collecting traveling salesman problem
Information Processing Letters | 2010-04-19 | Paper |
Algorithms for the on-line quota traveling salesman problem
Information Processing Letters | 2009-08-27 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | 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 the power of lookahead in on-line server routing problems
Theoretical Computer Science | 2008-12-12 | Paper |
The on-line asymmetric traveling salesman problem
Journal of Discrete Algorithms | 2008-08-08 | Paper |
The complexity of uniform Nash equilibria and related regular subgraph problems
Theoretical Computer Science | 2008-07-31 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
| scientific article; zbMATH DE number 1947058 (Why is no real title available?) | 2003-07-07 | Paper |
