W. Mader

2.4k total citations
50 papers, 1.2k citations indexed

About

W. Mader is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Geometry and Topology. According to data from OpenAlex, W. Mader has authored 50 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 35 papers in Computational Theory and Mathematics, 13 papers in Computer Networks and Communications and 12 papers in Geometry and Topology. Recurrent topics in W. Mader's work include Advanced Graph Theory Research (31 papers), Interconnection Networks and Systems (11 papers) and Graph theory and applications (11 papers). W. Mader is often cited by papers focused on Advanced Graph Theory Research (31 papers), Interconnection Networks and Systems (11 papers) and Graph theory and applications (11 papers). W. Mader collaborates with scholars based in Germany. W. Mader's co-authors include and has published in prestigious journals such as Mathematische Annalen, Mathematische Zeitschrift and Discrete Mathematics.

In The Last Decade

W. Mader

50 papers receiving 1.1k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
W. Mader Germany 19 1.1k 492 476 364 217 50 1.2k
Katsuhiro Ota Japan 14 506 0.4× 279 0.6× 103 0.2× 163 0.4× 125 0.6× 88 613
Lorna Stewart Canada 15 662 0.6× 133 0.3× 236 0.5× 86 0.2× 113 0.5× 35 782
Stanislav Jendrol′ Slovakia 19 1.3k 1.2× 380 0.8× 72 0.2× 299 0.8× 680 3.1× 137 1.5k
Seiya Negami Japan 15 480 0.4× 208 0.4× 36 0.1× 235 0.6× 116 0.5× 75 669
C. Balbuena Spain 16 491 0.4× 246 0.5× 466 1.0× 200 0.5× 244 1.1× 109 791
Qinglin Yu China 12 365 0.3× 114 0.2× 118 0.2× 160 0.4× 109 0.5× 49 526
J. Fàbrega Spain 11 339 0.3× 92 0.2× 589 1.2× 194 0.5× 214 1.0× 26 671
Jung-Heum Park South Korea 18 588 0.5× 28 0.1× 840 1.8× 79 0.2× 467 2.2× 56 928
S.A. Choudum India 10 235 0.2× 101 0.2× 208 0.4× 81 0.2× 145 0.7× 37 392
Mercè Ferrater Mora Spain 13 802 0.7× 60 0.1× 64 0.1× 227 0.6× 219 1.0× 49 870

Countries citing papers authored by W. Mader

Since Specialization
Citations

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

Fields of papers citing papers by W. Mader

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

No nodes

All Works

20 of 20 papers shown
1.
Mader, W.. (2011). Connectivity keeping trees in k‐connected graphs. Journal of Graph Theory. 69(3). 324–329. 15 indexed citations
2.
Mader, W.. (2010). Connectivity keeping paths in k-connected graphs. Journal of Graph Theory. 65(1). 61–69. 7 indexed citations
3.
Mader, W.. (2005). High connectivity keeping sets in graphs and digraphs. Discrete Mathematics. 302(1-3). 173–187. 3 indexed citations
4.
Mader, W.. (2002). On k-con-Critically n-Connected Graphs. Journal of Combinatorial Theory Series B. 86(2). 296–314. 10 indexed citations
5.
Mader, W.. (1998). Topological Subgraphs in Graphs of Large Girth. COMBINATORICA. 18(3). 405–412. 20 indexed citations
6.
Mader, W.. (1995). Exixtence of vertices of local connectivityk in digraphs of large outdegree. COMBINATORICA. 15(4). 533–539. 6 indexed citations
7.
Mader, W.. (1994). On Vertex-Edge-Critically n-Connected Graphs. Combinatorics Probability Computing. 3(2). 257–271. 1 indexed citations
8.
Mader, W.. (1988). Generalizations of critical connectivity of graphs. Discrete Mathematics. 72(1-3). 267–283. 45 indexed citations
9.
Mader, W.. (1985). Paths in graphs, reducing the edge-connectivity only by two. Graphs and Combinatorics. 1(1). 81–89. 12 indexed citations
10.
Mader, W.. (1985). Degree and local connectivity in digraphs. COMBINATORICA. 5(2). 161–165. 13 indexed citations
11.
Mader, W.. (1982). Konstruktion aller n-fach kantenzusammenhängenden Digraphen. European Journal of Combinatorics. 3(1). 63–67. 40 indexed citations
12.
Mader, W.. (1980). Über ein graphentheoretisches Ergebnis von T. Gallai. Acta Mathematica Academiae Scientiarum Hungaricae. 35(1-2). 205–215. 2 indexed citations
13.
Mader, W.. (1978). Über n-fach zusammenhängende Eckenmengen in Graphen. Journal of Combinatorial Theory Series B. 25(1). 74–93. 7 indexed citations
14.
Mader, W.. (1973). Grad und lokaler Zusammenhang in endlichen Graphen. Mathematische Annalen. 205(1). 9–11. 23 indexed citations
15.
Mader, W.. (1973). Ein Extremalproblem des Zusammenhangs von Graphen. Mathematische Zeitschrift. 131(3). 223–231. 5 indexed citations
16.
Mader, W.. (1973). 1-Faktoren von Graphen. Mathematische Annalen. 201(4). 269–282. 26 indexed citations
17.
Mader, W.. (1973). Über die Anzahl der von den 1‐Faktoren eines Graphen überdeckten Ecken. Mathematische Nachrichten. 56(1-6). 195–200. 2 indexed citations
18.
Mader, W.. (1972). Wohlquasigeordnete Klassen endlicher Graphen. Journal of Combinatorial Theory Series B. 12(2). 105–122. 16 indexed citations
19.
Mader, W.. (1968). Homomorphies�tze f�r Graphen. Mathematische Annalen. 178(2). 154–168. 106 indexed citations
20.
Mader, W.. (1967). Homomorphieeigenschaften und mittlere Kantendichte von Graphen. Mathematische Annalen. 174(4). 265–268. 163 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 Katsuhiro Ota Breakdown of academic impact, for papers by Lorna Stewart Breakdown of academic impact, for papers by Stanislav Jendrol′ Breakdown of academic impact, for papers by Seiya Negami Breakdown of academic impact, for papers by C. Balbuena Breakdown of academic impact, for papers by Qinglin Yu Breakdown of academic impact, for papers by J. Fàbrega Breakdown of academic impact, for papers by Jung-Heum Park Breakdown of academic impact, for papers by S.A. Choudum Breakdown of academic impact, for papers by Mercè Ferrater Mora
Rankless by CCL
2026