Dirk Vertigan

1.5k total citations
30 papers, 752 citations indexed

About

Dirk Vertigan is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Dirk Vertigan has authored 30 papers receiving a total of 752 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 11 papers in Electrical and Electronic Engineering and 9 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Dirk Vertigan's work include Advanced Graph Theory Research (22 papers), graph theory and CDMA systems (11 papers) and Graph Labeling and Dimension Problems (8 papers). Dirk Vertigan is often cited by papers focused on Advanced Graph Theory Research (22 papers), graph theory and CDMA systems (11 papers) and Graph Labeling and Dimension Problems (8 papers). Dirk Vertigan collaborates with scholars based in United States, Canada and New Zealand. Dirk Vertigan's co-authors include Dominic Welsh, François Jaeger, James Oxley, Guoli Ding, Bogdan Oporowski, Geoff Whittle, Isidoro Gitler, Daniel P. Sanders, Yves Colin de Verdìère and Noga Alon and has published in prestigious journals such as Transactions of the American Mathematical Society, SIAM Journal on Computing and Mathematical Proceedings of the Cambridge Philosophical Society.

In The Last Decade

Dirk Vertigan

30 papers receiving 688 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Dirk Vertigan United States 15 543 298 227 124 109 30 752
François Jaeger France 13 444 0.8× 391 1.3× 390 1.7× 101 0.8× 66 0.6× 36 779
Imre Leader United Kingdom 15 398 0.7× 385 1.3× 309 1.4× 121 1.0× 46 0.4× 71 706
Roy Meshulam Israel 18 575 1.1× 380 1.3× 285 1.3× 117 0.9× 52 0.5× 59 878
Tom Bohman United States 15 394 0.7× 362 1.2× 227 1.0× 78 0.6× 47 0.4× 54 649
Martin Klazar Czechia 14 323 0.6× 386 1.3× 131 0.6× 121 1.0× 45 0.4× 43 566
N. L. Biggs United Kingdom 17 283 0.5× 323 1.1× 204 0.9× 179 1.4× 45 0.4× 34 718
K. Vesztergombi Hungary 9 296 0.5× 262 0.9× 234 1.0× 21 0.2× 97 0.9× 12 639
Igor Pak United States 18 294 0.5× 653 2.2× 369 1.6× 106 0.9× 132 1.2× 120 1.0k
Robert Cori France 13 397 0.7× 263 0.9× 199 0.9× 26 0.2× 30 0.3× 41 693
David P. Robbins United States 14 188 0.3× 476 1.6× 369 1.6× 118 1.0× 95 0.9× 37 788

Countries citing papers authored by Dirk Vertigan

Since Specialization
Citations

This map shows the geographic impact of Dirk Vertigan'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 Dirk Vertigan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dirk Vertigan more than expected).

Fields of papers citing papers by Dirk Vertigan

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Dirk Vertigan. 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 Dirk Vertigan. The network helps show where Dirk Vertigan may publish in the future.

Co-authorship network of co-authors of Dirk Vertigan

This figure shows the co-authorship network connecting the top 25 collaborators of Dirk Vertigan. A scholar is included among the top collaborators of Dirk Vertigan 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 Dirk Vertigan. Dirk Vertigan 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.
Vertigan, Dirk. (2005). The Computational Complexity of Tutte Invariants for Planar Graphs. SIAM Journal on Computing. 35(3). 690–712. 27 indexed citations
2.
DeVos, Matt, Guoli Ding, Bogdan Oporowski, et al.. (2004). Excluding any graph as a minor allows a low tree-width 2-coloring. Journal of Combinatorial Theory Series B. 91(1). 25–41. 41 indexed citations
3.
DeVos, Matt, Luis Goddyn, Bojan Mohar, Dirk Vertigan, & Xuding Zhu. (2004). Coloring-flow duality of embedded graphs. Transactions of the American Mathematical Society. 357(10). 3993–4016. 13 indexed citations
4.
Alon, Noga, Guoli Ding, Bogdan Oporowski, & Dirk Vertigan. (2003). Partitioning into graphs with only small components. Journal of Combinatorial Theory Series B. 87(2). 231–243. 49 indexed citations
5.
Geelen, James F., James Oxley, Dirk Vertigan, & Geoff Whittle. (2002). Totally Free Expansions of Matroids. Journal of Combinatorial Theory Series B. 84(1). 130–179. 13 indexed citations
6.
Oxley, James, Charles Semple, & Dirk Vertigan. (2000). Generalized Δ–Y Exchange and k-Regular Matroids. Journal of Combinatorial Theory Series B. 79(1). 1–65. 25 indexed citations
7.
Ding, Guoli, Bogdan Oporowski, Daniel P. Sanders, & Dirk Vertigan. (2000). Surfaces, Tree-Width, Clique-Minors, and Partitions. Journal of Combinatorial Theory Series B. 79(2). 221–246. 23 indexed citations
8.
Geelen, Jim, James Oxley, Dirk Vertigan, & Geoff Whittle. (2000). On the Excluded Minors for Quaternary Matroids. Journal of Combinatorial Theory Series B. 80(1). 57–68. 3 indexed citations
9.
Vertigan, Dirk. (1998). Bicycle Dimension and Special Points of the Tutte Polynomial. Journal of Combinatorial Theory Series B. 74(2). 378–396. 14 indexed citations
10.
Geelen, James F., James Oxley, Dirk Vertigan, & Geoff Whittle. (1998). Weak Maps and Stabilizers of Classes of Matroids. Advances in Applied Mathematics. 21(2). 305–341. 15 indexed citations
11.
Ding, Guoli, Bogdan Oporowski, James Oxley, & Dirk Vertigan. (1997). Unavoidable Minors of Large 3-Connected Matroids. Journal of Combinatorial Theory Series B. 71(2). 244–293. 24 indexed citations
12.
Massey, David B., Rodica Simion, Richard P. Stanley, et al.. (1997). Lê Numbers of Arrangements and Matroid Identities. Journal of Combinatorial Theory Series B. 70(1). 118–133. 2 indexed citations
13.
Vertigan, Dirk & Geoff Whittle. (1997). A 2-Isomorphism Theorem for Hypergraphs. Journal of Combinatorial Theory Series B. 71(2). 215–230. 4 indexed citations
14.
Oxley, James, Dirk Vertigan, & Geoff Whittle. (1996). On Inequivalent Representations of Matroids over Finite Fields. Journal of Combinatorial Theory Series B. 67(2). 325–343. 37 indexed citations
15.
Verdìère, Yves Colin de, Isidoro Gitler, & Dirk Vertigan. (1996). Reseaux électriques planaires II. Commentarii Mathematici Helvetici. 71(1). 144–167. 47 indexed citations
16.
Ding, Guoli, Bogdan Oporowski, James Oxley, & Dirk Vertigan. (1996). Unavoidable Minors of Large 3-Connected Binary Matroids. Journal of Combinatorial Theory Series B. 66(2). 334–360. 26 indexed citations
17.
Colbourn, Charles J., J. Scott Provan, & Dirk Vertigan. (1995). A new approach to solving three combinatorial enumeration problems on planar graphs. Discrete Applied Mathematics. 60(1-3). 119–129. 9 indexed citations
18.
Colbourn, Charles J., J. Scott Provan, & Dirk Vertigan. (1995). The complexity of computing the tutte polynomial on transversal matroids. COMBINATORICA. 15(1). 1–10. 14 indexed citations
19.
Vertigan, Dirk. (1991). On the computational complexity of tutte, jones, homfly and kauffman invariants (tutte polynomial, jones polynomial, homfly polynomial, kauffman polynomial). 4 indexed citations
20.
Jaeger, François, Dirk Vertigan, & Dominic Welsh. (1990). On the computational complexity of the Jones and Tutte polynomials. Mathematical Proceedings of the Cambridge Philosophical Society. 108(1). 35–53. 241 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

Breakdown of academic impact, for papers by François Jaeger Breakdown of academic impact, for papers by Imre Leader Breakdown of academic impact, for papers by Roy Meshulam Breakdown of academic impact, for papers by Tom Bohman Breakdown of academic impact, for papers by Martin Klazar Breakdown of academic impact, for papers by N. L. Biggs Breakdown of academic impact, for papers by K. Vesztergombi Breakdown of academic impact, for papers by Igor Pak Breakdown of academic impact, for papers by Robert Cori Breakdown of academic impact, for papers by David P. Robbins
Rankless by CCL
2026