| Publication | Date of Publication | Type |
|---|
| Revisiting the random subset sum problem | 2025-01-06 | Paper |
| Computing graph hyperbolicity using dominating sets | 2024-05-24 | Paper |
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
ACM Journal of Experimental Algorithmics | 2024-04-14 | Paper |
Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
A compact data structure and parallel algorithms for permutation graphs
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks
Networks | 2023-12-18 | Paper |
| A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs | 2023-04-03 | Paper |
Diameter, eccentricities and distance oracle computations on \(H\)-minor free graphs and graphs of bounded (distance) Vapnik-Chervonenkis dimension
SIAM Journal on Computing | 2022-11-15 | Paper |
scientific article; zbMATH DE number 7561636 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Fast diameter computation within split graphs
Discrete Mathematics & Theoretical Computer Science | 2022-01-27 | Paper |
LiveRank: how to refresh old datasets
Internet Mathematics | 2021-03-26 | Paper |
On computing Pareto optimal paths in weighted time-dependent networks
Information Processing Letters | 2021-03-11 | Paper |
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Hardness of exact distance queries in sparse graphs through hub labeling
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| Decomposing a graph into shortest paths with bounded eccentricity | 2020-11-25 | Paper |
Decomposing a graph into shortest paths with bounded eccentricity
Discrete Applied Mathematics | 2020-07-07 | Paper |
Fast diameter computation within split graphs
(available as arXiv preprint) | 2020-05-13 | Paper |
| Fast diameter computation within split graphs | 2020-05-13 | Paper |
Independent lazy better-response dynamics on network games
(available as arXiv preprint) | 2020-02-06 | Paper |
Average size of unstretched remote-spanners
2009 Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Beyond highway dimension: small distance labels using tree skeletons
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Parallel comparability graph recognition and modular decomposition
STACS 96 | 2017-11-16 | Paper |
Toward more localized local algorithms, removing assumptions concerning global knowledge
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
LiveRank: how to refresh old crawls
Lecture Notes in Computer Science | 2015-09-09 | Paper |
LiveRank: how to refresh old crawls
Lecture Notes in Computer Science | 2015-09-09 | Paper |
Self-organizing flows in social networks
Theoretical Computer Science | 2015-05-22 | Paper |
Partition refinement techniques: an interesting algorithmic tool kit
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
On the locality of distributed sparse spanner construction
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Toward more localized local algorithms: removing assumptions concerning global knowledge
Distributed Computing | 2014-03-28 | Paper |
Self-organizing flows in social networks
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners
Lecture Notes in Computer Science | 2012-07-27 | Paper |
Asymptotic modularity of some graph classes
Algorithms and Computation | 2011-12-16 | Paper |
Multipath spanners
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Local Computation of Nearly Additive Spanners
Lecture Notes in Computer Science | 2009-11-19 | Paper |
| scientific article; zbMATH DE number 2088547 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 1930132 (Why is no real title available?) | 2003-06-18 | Paper |
Some algorithms for synchronizing clocks of base transceiver stations in a cellular network
Journal of Parallel and Distributed Computing | 2002-10-09 | Paper |
Linear time recognition of \(P_4\)-indifference graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2002-01-07 | Paper |
Linear time recognition of \(P_4\)-indifference graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2002-01-07 | Paper |
Parallel \(N\)-free order recognition
Theoretical Computer Science | 1998-07-23 | Paper |
Revisiting the Random Subset Sum problem
(available as arXiv preprint) | N/A | Paper |
Temporalizing digraphs via linear-size balanced bi-trees
(available as arXiv preprint) | N/A | Paper |
