What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Algorithm
- Graph theory
His primary areas of investigation include Combinatorics, Routing, Destination-Sequenced Distance Vector routing, Theoretical computer science and Discrete mathematics.
His research links Upper and lower bounds with Combinatorics.
His work carried out in the field of Destination-Sequenced Distance Vector routing brings together such families of science as Routing table, Equal-cost multi-path routing and Multipath routing.
As a part of the same scientific study, Cyril Gavoille usually deals with the Routing table, concentrating on Routing Information Protocol and frequently concerns with Path vector protocol and DSRFLOW.
His Theoretical computer science research is multidisciplinary, incorporating perspectives in Theory of computation, Data structure and Binary tree.
Much of his study explores Discrete mathematics relationship to Bounded function.
His most cited work include:
- Distance labeling in graphs (198 citations)
- Routing in Trees (171 citations)
- Compact and localized distributed data structures (129 citations)
What are the main themes of his work throughout his whole career to date?
The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Routing table, Graph and Routing.
His research in Combinatorics intersects with topics in Upper and lower bounds and Bounded function.
As part of his studies on Discrete mathematics, he frequently links adjacent subjects like Shortest path problem.
His Routing table study combines topics from a wide range of disciplines, such as Algorithm and Destination-Sequenced Distance Vector routing.
The study incorporates disciplines such as Node, Interval, Dimension and Stretch factor in addition to Routing.
His research integrates issues of Topology, Path vector protocol and Routing Information Protocol in his study of Equal-cost multi-path routing.
He most often published in these fields:
- Combinatorics (69.23%)
- Discrete mathematics (44.38%)
- Routing table (20.12%)
What were the highlights of his more recent work (between 2012-2021)?
- Combinatorics (69.23%)
- Graph (17.16%)
- Adjacency list (6.51%)
In recent papers he was focusing on the following fields of study:
His primary scientific interests are in Combinatorics, Graph, Adjacency list, Upper and lower bounds and Bounded function.
His Combinatorics study often links to related topics such as Convex position.
His Graph study results in a more complete grasp of Discrete mathematics.
He focuses mostly in the field of Adjacency list, narrowing it down to topics relating to Binary logarithm and, in certain cases, Epigraph and Coloring problem.
His Upper and lower bounds research includes themes of Time complexity, Decoding methods, Bit-length and Bipartite graph.
He works mostly in the field of Bounded function, limiting it down to topics relating to Vertex and, in certain cases, Asymptotically optimal algorithm, Edge-graceful labeling and Distance labeling, as a part of the same area of interest.
Between 2012 and 2021, his most popular works were:
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs (20 citations)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (16 citations)
- Simpler, faster and shorter labels for distances in graphs (16 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Combinatorics
- Graph theory
Combinatorics, Adjacency list, Planar graph, Bounded function and Partition are his primary areas of study.
His Combinatorics research includes elements of Discrete mathematics, Communication complexity, Asynchronous algorithms and Routing table.
His studies deal with areas such as Upper and lower bounds and Graph as well as Adjacency list.
His study in Planar graph is interdisciplinary in nature, drawing from both Asymptotically optimal algorithm and Vertex, Induced subgraph.
His Bounded function research includes themes of Time complexity and Bit-length.
His Partition research incorporates themes from Coloring problem, Open problem, Algorithm, Approximation algorithm and Distributed algorithm.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
