Bert Gerards
Impact in
-
- Limits and Structures in Graph Theory
- Advanced Combinatorial Mathematics
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 17
- Complexity and Algorithms in Graphs 6
- Graph Labeling and Dimension Problems 6
-
- Limits and Structures in Graph Theory 4
- Advanced Combinatorial Mathematics 4
- Co-authors
- Jim Geelen (15 shared papers)Geoff Whittle (11 shared papers)Paul D. Seymour (2 shared papers)Michele Conforti (4 shared papers)Adrian R. Vetta (1 shared paper)Bruce A. Reed (1 shared paper)Maria Chudnovsky (1 shared paper)Luis Goddyn (1 shared paper)
- Journals
- Journal of Combinatorial Theory Series B (8 papers)SIAM Journal on Discrete Mathematics (2 papers)COMBINATORICA (2 papers)Mathematical Programming (1 paper)Annals of Combinatorics (1 paper)
- Partner nations
- NetherlandsCanadaNew Zealand
In The Last Decade
Bert Gerards
21 papers receiving 319 citations
Peers
Comparison fields: 5 of 30
- Discrete Mathematics and Combinatorics 114
- Computational Theory and Mathematics 335
- Geometry and Topology 56
- Computer Graphics and Computer-Aided Design 19
- Computer Networks and Communications 93
Countries citing papers authored by Bert Gerards
This map shows the geographic impact of Bert Gerards'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 Bert Gerards with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bert Gerards more than expected).
Fields of papers citing papers by Bert Gerards
This network shows the impact of papers produced by Bert Gerards. 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 Bert Gerards. The network helps show where Bert Gerards may publish in the future.
Co-authors
The 13 scholars most cited alongside Bert Gerards, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 21 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2008 | 50 | |
| 2 | 2006 | 43 | |
| 3 | 2014 | 33 | |
| 4 | 2007 | 28 | |
| 5 | 2005 | 25 | |
| 6 | 2007 | 23 | |
| 7 | 2005 | 22 | |
| 8 | 2015 | 20 | |
| 9 | Graphs and polyhedra binary spaces and cutting planes | 1990 | 18 |
| 10 | 2009 | 16 | |
| 11 | 2007 | 13 | |
| 12 | 2007 | 12 | |
| 13 | 2000 | 11 | |
| 14 | Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization | 2001 | 10 |
| 15 | 2007 | 8 | |
| 16 | 2013 | 7 | |
| 17 | 2013 | 7 | |
| 18 | 2008 | 6 | |
| 19 | 2015 | 4 | |
| 20 | 2010 | 3 |
About Bert Gerards
Bert Gerards is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Computer Graphics and Computer-Aided Design and Computer Networks and Communications, having authored 21 papers that have together received 361 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (17 papers), Complexity and Algorithms in Graphs (6 papers), Graph Labeling and Dimension Problems (6 papers), graph theory and CDMA systems (5 papers), Limits and Structures in Graph Theory (4 papers), Advanced Combinatorial Mathematics (4 papers), Optimization and Search Problems (2 papers) and Graph theory and applications (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (114 citations), Computational Theory and Mathematics (335 citations), Geometry and Topology (56 citations), Computer Graphics and Computer-Aided Design (19 citations) and Computer Networks and Communications (93 citations). Bert Gerards has collaborated with scholars based in Netherlands, Canada and New Zealand. Frequent co-authors include Jim Geelen, Geoff Whittle, Paul D. Seymour, Michele Conforti, Adrian R. Vetta, Bruce A. Reed, Maria Chudnovsky, Luis Goddyn, Neil R. Robertson and Karen Aardal. Their work appears in journals such as Journal of Combinatorial Theory Series B, SIAM Journal on Discrete Mathematics, COMBINATORICA, Mathematical Programming and Annals of Combinatorics.
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.