What is he best known for?
The fields of study he is best known for:
- Algorithm
- Graph theory
- Graph coloring
D. de Werra spends much of his time researching Combinatorics, Discrete mathematics, Tabu search, Mathematical optimization and Theoretical computer science.
His study in Indifference graph, Chordal graph, Graph, Graph coloring and Greedy coloring falls within the category of Combinatorics.
His Edge coloring study in the realm of Discrete mathematics interacts with subjects such as Preemption.
His research in Tabu search is mostly focused on Guided Local Search.
His study in Guided Local Search is interdisciplinary in nature, drawing from both Optimization problem and Combinatorial optimization.
His work focuses on many connections between Mathematical optimization and other disciplines, such as Graph theory, that overlap with his field of interest in Function, Tabu list and Simulated annealing.
His most cited work include:
- A user's guide to tabu search (775 citations)
- Using tabu search techniques for graph coloring (541 citations)
- An introduction to timetabling (517 citations)
What are the main themes of his work throughout his whole career to date?
His main research concerns Combinatorics, Discrete mathematics, Bipartite graph, Mathematical optimization and Graph.
His study in Edge coloring, Graph coloring, Chordal graph, Indifference graph and Greedy coloring falls under the purview of Combinatorics.
His research in Edge coloring tackles topics such as Complete coloring which are related to areas like List coloring and Fractional coloring.
His work is dedicated to discovering how Discrete mathematics, Graph theory are connected with Flow network and other disciplines.
His research integrates issues of Time complexity and Extension in his study of Bipartite graph.
His Mathematical optimization research focuses on Theoretical computer science and how it connects with Scheduling.
He most often published in these fields:
- Combinatorics (56.34%)
- Discrete mathematics (43.28%)
- Bipartite graph (17.54%)
What were the highlights of his more recent work (between 2005-2021)?
- Combinatorics (56.34%)
- Discrete mathematics (43.28%)
- Graph (15.30%)
In recent papers he was focusing on the following fields of study:
Combinatorics, Discrete mathematics, Graph, Bipartite graph and Edge coloring are his primary areas of study.
D. de Werra regularly links together related areas like Matching in his Discrete mathematics studies.
D. de Werra combines subjects such as Time complexity, Theory of computation and Mathematical optimization with his study of Graph.
His studies deal with areas such as Graph theory, Theoretical computer science and Permutation as well as Mathematical optimization.
In Edge coloring, D. de Werra works on issues like Discrete tomography, which are connected to Flow network.
In his study, Brooks' theorem is inextricably linked to Greedy coloring, which falls within the broad field of Complete coloring.
Between 2005 and 2021, his most popular works were:
- Blockers and transversals (45 citations)
- Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid (31 citations)
- Polarity of chordal graphs (31 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Graph coloring
- Graph theory
His primary areas of study are Combinatorics, Discrete mathematics, Bipartite graph, Edge coloring and Graph.
His research ties Polynomial and Combinatorics together.
The various areas that he examines in his Edge coloring study include Graph coloring, Discrete tomography and Greedy coloring.
His Graph coloring research includes themes of Robotics, Industrial engineering, Permutation and Artificial intelligence.
His Greedy coloring research is multidisciplinary, incorporating elements of Graph theory, Graph homomorphism and Brooks' theorem.
D. de Werra combines subjects such as Operations research, Decision problem, Mathematical optimization and Of the form with his study of Graph.
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.
