| Publication | Date of Publication | Type |
|---|
| Framing algorithms for approximate multicriteria shortest paths | 2024-08-13 | Paper |
A fully asynchronous and fault tolerant distributed algorithm to compute a minimum graph orientation
Lecture Notes in Computer Science | 2022-11-04 | Paper |
Skycube materialization using the topmost skyline or functional dependencies
ACM Transactions on Database Systems | 2021-11-25 | Paper |
Robustness of the rotor-router mechanism
Algorithmica | 2017-10-09 | Paper |
The impact of dynamic events on the number of errors in networks
Theoretical Computer Science | 2016-04-01 | Paper |
Locating a target with an agent guided by unreliable local advice, how to beat the random walk when you have a clock?
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Tight stretch factors for \(L_1\)- and \(L_\infty\)-Delaunay triangulations
Computational Geometry | 2014-12-23 | Paper |
Non-searchability of random scale-free graphs
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps
Towards an Information Theory of Complex Networks | 2013-01-11 | Paper |
The stretch factor of \(L _{1}\)- and \(L _{ \infty }\)-Delaunay triangulations
Algorithms – ESA 2012 | 2012-09-25 | Paper |
On power-law distributed balls in bins and its applications to view size estimation
Algorithms and Computation | 2011-12-16 | Paper |
Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Plane Spanners of Maximum Degree Six
Automata, Languages and Programming | 2010-09-07 | Paper |
Canonical decomposition of outerplanar maps and application to enumeration, coding, and generation (extended abstract)
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Euler Tour Lock-In Problem in the Rotor-Router Model
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Memoryless search algorithms in a network with faulty advice
Theoretical Computer Science | 2008-08-06 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Planar graphs, via well-orderly maps and trees
Graphs and Combinatorics | 2006-09-12 | Paper |
Broadcast in the rendezvous model
Information and Computation | 2006-06-30 | Paper |
Could any graph be turned into a small-world?
Theoretical Computer Science | 2006-04-28 | Paper |
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation
Journal of Graph Algorithms and Applications | 2006-04-03 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings
Lecture Notes in Computer Science | 2005-08-17 | Paper |
Searching with mobile agents in networks with liars.
Discrete Applied Mathematics | 2004-02-14 | Paper |
| scientific article; zbMATH DE number 1962839 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1552835 (Why is no real title available?) | 2001-12-12 | Paper |
Cacti, braids and complex polynomials
Séminaire Lotharingien de Combinatoire | 1998-03-12 | Paper |
Cacti, braids and complex polynomials
Séminaire Lotharingien de Combinatoire | 1998-03-12 | Paper |
