Cyril Gavoille
Orcid: 0000-0003-3671-8607
According to our database1,
Cyril Gavoille
authored at least 117 papers
between 1994 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
2023
2022
2021
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021
2020
Proceedings of the Innovations and Interdisciplinary Solutions for Underserved Areas, 2020
2019
Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs.
SIAM J. Comput., 2019
Proceedings of the Combinatorics on Words - 12th International Conference, 2019
2018
A fast network-decomposition algorithm and its applications to constant-time distributed computation.
Theor. Comput. Sci., 2018
2017
2016
ACM Trans. Algorithms, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
2015
Comput. Geom., 2015
A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract).
Proceedings of the Structural Information and Communication Complexity, 2015
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015
2013
Proceedings of the Distributed Computing - 27th International Symposium, 2013
2012
CoRR, 2012
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
Proceedings of the Algorithms - ESA 2012, 2012
2011
Tech. Sci. Informatiques, 2011
Proceedings of the Distributed Computing - 25th International Symposium, 2011
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011
Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011
Proceedings of the Towards an Information Theory of Complex Networks, 2011
2010
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010
Proceedings of the Structural Information and Communication Complexity, 2010
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010
2009
Networks, 2009
Distributed Comput., 2009
Proceedings of the Distributed Computing, 23rd International Symposium, 2009
Proceedings of the Distributed Computing, 23rd International Symposium, 2009
2008
Theor. Comput. Sci., 2008
SIAM J. Discret. Math., 2008
Electron. Notes Discret. Math., 2008
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008
Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008
2007
Proceedings of the Distributed Computing, 21st International Symposium, 2007
Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time.
Proceedings of the Distributed Computing, 21st International Symposium, 2007
Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007
Proceedings of the Algorithms, 2007
2006
Comput. Networks, 2006
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006
Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006
2005
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation.
J. Graph Algorithms Appl., 2005
Electron. Notes Discret. Math., 2005
Proceedings of the Distributed Computing, 19th International Conference, 2005
Proceedings of the Structural Information and Communication Complexity, 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
2004
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment.
Theory Comput. Syst., 2004
Proceedings of the Distributed Computing, 18th International Conference, 2004
Proceedings of the Structural Information and Communication Complexity, 2004
2003
Proceedings of the Distributed Computing, 17th International Conference, 2003
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003
Proceedings of the Algorithms, 2003
2002
Proceedings of the Distributed Computing, 16th International Conference, 2002
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002
2001
J. Parallel Distributed Comput., 2001
Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs.
Electron. Notes Discret. Math., 2001
Distributed Comput., 2001
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
2000
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000
1999
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999
Proceedings of the Automata, 1999
1998
A Theoretical Model for Routing Complexity.
Proceedings of the SIROCCO'98, 1998
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998
1997
An Omega(n2)-Lower Bound for Space-Efficiency of Routing Schemes of Stretch Factor Three.
Proceedings of the SIROCCO'97, 1997
1996
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996
Lower Bounds for Shortest Path Interval Routing.
Proceedings of the SIROCCO'96, 1996
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996
1995
On the Compactness of Bounded Degree Graphs for Shortest Path Interval Routing.
Proceedings of the Structure, Information and Communication Complexity, 1995
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995
1994
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994