World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
39
Citations
5348
World Ranking
9874
National Ranking
235

Overview

Cyril Gavoille is affiliated with the University of Bordeaux in France and specializes in Computer Science. Their research primarily spans Computational Theory and Mathematics, with contributions in related subfields including Computer Graphics and Computer-Aided Design, Computer Networks and Communications, Artificial Intelligence, and Atomic and Molecular Physics, and Optics.

Their work covers several main topics such as Advanced Graph Theory Research, Computational Geometry and Mesh Generation, Optimization and Search Problems, Graph Labeling and Dimension Problems, Quantum Computing Algorithms and Architecture, Quantum many-body systems, and Advanced Graph Neural Networks.

Cyril Gavoille has published research in various reputable venues. The most frequent publication venues include arXiv (Cornell University) with five publications, Leibniz-Zentrum für Informatik (Schloss Dagstuhl) with two, and one in the Society for Industrial and Applied Mathematics eBooks.

Selected recent papers authored or coauthored by Cyril Gavoille are:

  • Minor-Universal Graph for Graphs on Surfaces, 2023, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Shorter Labeling Schemes for Planar Graphs, 2022, Society for Industrial and Applied Mathematics eBooks

Other papers associated with their frequent coauthors include:

  • Freeze-Tag in L₁ Has Wake-Up Time Five with Linear Complexity, 2024, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Freeze-Tag in L₁ Has Wake-Up Time Five with Linear Complexity, 2024, arXiv (Cornell University)
  • Isometric-Universal Graphs for Trees, 2025, arXiv (Cornell University)

Frequent collaborators in Cyril Gavoille's network are Nicolas Hanusse, Marthe Bonamy, Nicolas Bonichon, Arnaud Casteigts, and Youssou Dieng. This network reflects several joint contributions in the areas mentioned above.

Best Publications

  • Distance labeling in graphs

    Cyril Gavoille;David Peleg;Stéphane Pérennes;Ran Raz

  • Routing in Trees

    Pierre Fraigniaud;Cyril Gavoille

  • Compact name-independent routing with minimum stretch

    Ittai Abraham;Cyril Gavoille;Dahlia Malkhi;Noam Nisan

  • Compact and localized distributed data structures

    Cyril Gavoille;David Peleg

  • Space-Efficiency for Routing Schemes of Stretch Factor Three

    Cyril Gavoille;Marc Gengler

  • Routing in distributed networks: overview and open problems

    Cyril Gavoille

  • Routing in Networks with Low Doubling Dimension

    I. Abraham;C. Gavoille;A.V. Goldberg;D. Malkhi

  • Memory requirement for routing in distributed networks

    Cyril Gavoille;Stéphane Pérennès

  • Approximate Distance Labeling Schemes

    Cyril Gavoille;Michal Katz;Nir A. Katz;Christophe Paul

  • Nearest common ancestors: a survey and a new distributed algorithm

    Stephen Alstrup;Cyril Gavoille;Haim Kaplan;Theis Rauhe

  • A survey on interval routing

    Cyril Gavoille

  • Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment

    Stephen Alstrup;Cyril Gavoille;Haim Kaplan;Theis Rauhe

  • Distributed computing with advice: information sensitivity of graph coloring

    Pierre Fraigniaud;Cyril Gavoille;David Ilcinkas;Andrzej Pelc

  • Object location using path separators

    Ittai Abraham;Cyril Gavoille

  • Tree-decompositions with bags of small diameter

    Yon Dourisboure;Cyril Gavoille

  • Connections between theta-graphs, delaunay triangulations, and orthogonal surfaces

    Nicolas Bonichon;Cyril Gavoille;Nicolas Hanusse;David Ilcinkas

  • Planar graphs, via well-orderly maps and trees

    Nicolas Bonichon;Cyril Gavoille;Nicolas Hanusse;Dominique Poulalhon

  • Compact routing schemes with low stretch factor

    Tamar Eilam;Cyril Gavoille;David Peleg

  • Eclecticism shrinks even small worlds

    Pierre Fraigniaud;Cyril Gavoille;Christophe Paul

  • Distance labeling in hyperbolic graphs

    Cyril Gavoille;Olivier Ly

  • Automata, Languages and Programming

    Samson Abramsky;Cyril Gavoille;Claude Kirchner;Friedhelm Meyer Auf der Heide

Frequent Co-Authors

Pierre Fraigniaud
Pierre Fraigniaud Université Paris Cité
David Peleg
David Peleg Weizmann Institute of Science
Christophe Paul
Christophe Paul University of Montpellier
Dahlia Malkhi
Dahlia Malkhi Diem Association
Bruno Courcelle
Bruno Courcelle University of Bordeaux
Zvi Lotker
Zvi Lotker Bar-Ilan University
Paul G. Spirakis
Paul G. Spirakis University of Liverpool
Michael Elkin
Michael Elkin Ben-Gurion University of the Negev
Prosenjit Bose
Prosenjit Bose Carleton University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Computer Science in the USA opens numerous flexible and accessible opportunities for learners at all stages. Many students seek the quickest online masters degree to fast-track their careers or switch fields efficiently. These accelerated programs are ideal for working professionals who want to upskill without pausing their current jobs.

Choosing which master's degree is most in demand in USA can also influence future career prospects. Computer Science consistently ranks as one of the most valuable degrees, with high demand across a broad range of industries.

For those just starting, earning an associate degree online can be a budget-friendly and flexible first step, offering foundational knowledge that paves the way for entry-level careers or transfer into a bachelor's program.

Finally, students searching for cost-effective ways to study can find quality courses and programs at cheap online college classes. These options help make a Computer Science education more affordable and accessible for everyone.

Best Scientists Citing Cyril Gavoille

Trending Scientists