D. de Werra

6.3k total citations
190 papers, 3.7k citations indexed

About

D. de Werra is a scholar working on Computational Theory and Mathematics, Industrial and Manufacturing Engineering and Management Science and Operations Research. According to data from OpenAlex, D. de Werra has authored 190 papers receiving a total of 3.7k indexed citations (citations by other indexed papers that have themselves been cited), including 86 papers in Computational Theory and Mathematics, 64 papers in Industrial and Manufacturing Engineering and 52 papers in Management Science and Operations Research. Recurrent topics in D. de Werra's work include Advanced Graph Theory Research (69 papers), Scheduling and Timetabling Solutions (50 papers) and Scheduling and Optimization Algorithms (38 papers). D. de Werra is often cited by papers focused on Advanced Graph Theory Research (69 papers), Scheduling and Timetabling Solutions (50 papers) and Scheduling and Optimization Algorithms (38 papers). D. de Werra collaborates with scholars based in Switzerland, France and United States. D. de Werra's co-authors include Alain Hertz, N. V. R. Mahadev, Armen S. Asratian, Tınaz Ekim, Jacek Błażewicz, Marc Demange, Bernard Ries, Christophe Picouleau, P. L. Hammer and Vašek Chvátal and has published in prestigious journals such as European Journal of Operational Research, IEEE Transactions on Power Systems and Mathematical Programming.

In The Last Decade

D. de Werra

183 papers receiving 3.3k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
D. de Werra Switzerland 26 1.6k 1.5k 1.2k 1.0k 538 190 3.7k
Lyle A. McGeoch United States 15 1.1k 0.7× 831 0.6× 728 0.6× 1.7k 1.6× 693 1.3× 26 3.4k
Allan Borodin Canada 33 484 0.3× 833 0.6× 2.0k 1.7× 2.9k 2.8× 1.4k 2.6× 105 5.2k
Yossi Azar Israel 34 941 0.6× 972 0.7× 990 0.8× 3.0k 2.8× 626 1.2× 152 4.2k
Eugene L. Lawler United States 33 2.7k 1.7× 374 0.3× 1.4k 1.2× 2.3k 2.2× 1.1k 2.0× 79 6.1k
Robert E. Bixby United States 27 875 0.6× 285 0.2× 980 0.8× 563 0.5× 534 1.0× 56 2.6k
Chandra Chekuri United States 36 819 0.5× 436 0.3× 2.0k 1.7× 2.7k 2.6× 864 1.6× 130 4.6k
R. Ravi United States 33 809 0.5× 448 0.3× 1.6k 1.3× 1.5k 1.4× 315 0.6× 175 3.5k
Shimon Even Israel 33 601 0.4× 446 0.3× 2.4k 2.1× 2.3k 2.2× 1.7k 3.1× 94 5.5k
Daniel D. Sleator United States 27 691 0.4× 851 0.6× 1.7k 1.4× 4.0k 3.8× 2.2k 4.0× 41 6.4k
Gerhard Reinelt Germany 30 2.2k 1.4× 316 0.2× 1.3k 1.1× 979 0.9× 1.7k 3.1× 95 4.9k

Countries citing papers authored by D. de Werra

Since Specialization
Citations

This map shows the geographic impact of D. de Werra's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by D. de Werra with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites D. de Werra more than expected).

Fields of papers citing papers by D. de Werra

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by D. de Werra. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by D. de Werra. The network helps show where D. de Werra may publish in the future.

Co-authorship network of co-authors of D. de Werra

This figure shows the co-authorship network connecting the top 25 collaborators of D. de Werra. A scholar is included among the top collaborators of D. de Werra based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with D. de Werra. D. de Werra is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Ribeiro, Celso C., Sebastián Urrutia, & D. de Werra. (2023). Combinatorial Models for Scheduling Sports Tournaments. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 5 indexed citations
2.
Dabrowski, Konrad K., et al.. (2015). Combinatorics and Algorithms for Augmenting Graphs. Graphs and Combinatorics. 32(4). 1339–1352. 2 indexed citations
3.
Ries, Bernard, et al.. (2009). Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. Discrete Mathematics. 310(1). 132–146. 23 indexed citations
4.
Werra, D. de, et al.. (2005). Construction of sports schedules with multiple venues. Discrete Applied Mathematics. 154(1). 47–58. 19 indexed citations
5.
Lozin, Vadim & D. de Werra. (2003). Special issue on stability in graphs and related topics. Discrete Applied Mathematics. 132(1-3). 1–2. 7 indexed citations
6.
Alexe, Gabriela, Peter L. Hammer, Vadim Lozin, & D. de Werra. (2003). Struction revisited. Discrete Applied Mathematics. 132(1-3). 27–46. 12 indexed citations
7.
Werra, D. de, et al.. (1997). Nesticity, DIMACS series. Discrete Mathematics & Theoretical Computer Science. 37. 225–232. 2 indexed citations
8.
Werra, D. de. (1996). Some combinatorial models for course scheduling. Lecture notes in computer science. 1153. 296–308. 7 indexed citations
9.
Werra, D. de & Jacek Błażewicz. (1993). Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource. Discrete Applied Mathematics. 43(1). 103–104. 4 indexed citations
10.
Mahadev, N. V. R., et al.. (1993). The cyclic compact open-shop scheduling problem. Discrete Mathematics. 111(1-3). 361–366. 2 indexed citations
11.
Werra, D. de & Fred S. Roberts. (1991). On the use of augmenting chains in chain packings. Discrete Applied Mathematics. 30(2-3). 137–149. 1 indexed citations
12.
Błażewicz, Jacek, Maciej Drozdowski, Günter Schmidt, & D. de Werra. (1990). Scheduling independent two processor tasks on a uniform duo-processor system. Discrete Applied Mathematics. 28(1). 11–20. 12 indexed citations
13.
Werra, D. de, et al.. (1990). A constrained sports scheduling problem. Discrete Applied Mathematics. 26(1). 41–49. 20 indexed citations
14.
Werra, D. de. (1985). Some uses of hypergraphs in timetabling. Asia Pacific Journal of Operational Research. 2. 2–12. 4 indexed citations
15.
Werra, D. de. (1984). Variation on a theorem of König. Discrete Mathematics. 51(3). 319–321. 6 indexed citations
16.
Werra, D. de. (1982). Minimizing irregularities in sports schedules using graph theory. Discrete Applied Mathematics. 4(3). 217–226. 29 indexed citations
17.
Werra, D. de. (1980). Geography, games and graphs. Discrete Applied Mathematics. 2(4). 327–337. 70 indexed citations
18.
Werra, D. de, et al.. (1977). Compactness and balancing in scheduling.. Mathematical Methods of Operations Research. 21. 65–73. 1 indexed citations
19.
Werra, D. de. (1974). Some results in chromatic scheduling. Mathematical Methods of Operations Research. 18(5). 167–175. 1 indexed citations
20.
Werra, D. de. (1972). Decomposition of bipartite multigraphs into matchings. Mathematical Methods of Operations Research. 16(3). 85–90. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026