Rudi Pendavingh

404 total citations
26 papers, 138 citations indexed

About

Rudi Pendavingh is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Rudi Pendavingh has authored 26 papers receiving a total of 138 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Computational Theory and Mathematics, 8 papers in Discrete Mathematics and Combinatorics and 5 papers in Geometry and Topology. Recurrent topics in Rudi Pendavingh's work include Advanced Graph Theory Research (14 papers), Complexity and Algorithms in Graphs (6 papers) and Limits and Structures in Graph Theory (6 papers). Rudi Pendavingh is often cited by papers focused on Advanced Graph Theory Research (14 papers), Complexity and Algorithms in Graphs (6 papers) and Limits and Structures in Graph Theory (6 papers). Rudi Pendavingh collaborates with scholars based in Netherlands, United States and Austria. Rudi Pendavingh's co-authors include Henning Bruhn, Matthias Kriesell, Nikhil Bansal, Paul Wollan, Reinhard Diestel, Gerhard J. Woeginger, Petra Schuurman, Leen Stougie, Jarosław Byrka and Kamalika Chaudhuri and has published in prestigious journals such as Advances in Mathematics, SIAM Journal on Optimization and Bulletin of Mathematical Biology.

In The Last Decade

Rudi Pendavingh

22 papers receiving 123 citations

Peers

Rudi Pendavingh
Jérémie Chalopin France
Bartosz Walczak Poland
Dimitrios M. Thilikos France
Jean-Luc Baril France
Rudini Sampaio Brazil
Michał Adamaszek United Kingdom
Torsten Mütze Germany
Aline Parreau France
Ross J. Kang Netherlands
Luérbio Faria Brazil
Jérémie Chalopin France
Rudi Pendavingh
Citations per year, relative to Rudi Pendavingh Rudi Pendavingh (= 1×) peers Jérémie Chalopin

Countries citing papers authored by Rudi Pendavingh

Since Specialization
Citations

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

Fields of papers citing papers by Rudi Pendavingh

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Rudi Pendavingh

This figure shows the co-authorship network connecting the top 25 collaborators of Rudi Pendavingh. A scholar is included among the top collaborators of Rudi Pendavingh 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 Rudi Pendavingh. Rudi Pendavingh 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.
Pendavingh, Rudi, et al.. (2024). Computing Excluded Minors for Classes of Matroids Representable over Partial Fields. The Electronic Journal of Combinatorics. 31(3). 1 indexed citations
2.
Pendavingh, Rudi, et al.. (2024). How to Design a Stable Serial Knockout Competition. Mathematics of Operations Research. 50(2). 1421–1432. 1 indexed citations
3.
Pendavingh, Rudi, et al.. (2018). Asymptotics of symmetry in matroids. Journal of Combinatorial Theory Series B. 135. 349–365. 1 indexed citations
4.
Pendavingh, Rudi, et al.. (2015). On the Number of Matroids Compared to the Number of Sparse Paving Matroids. The Electronic Journal of Combinatorics. 22(2). 12 indexed citations
5.
Pendavingh, Rudi, et al.. (2014). Reconstructing a Phylogenetic Level-1 Network from Quartets. Bulletin of Mathematical Biology. 76(10). 2517–2541. 6 indexed citations
6.
Bansal, Nikhil, et al.. (2014). An entropy argument for counting matroids. Journal of Combinatorial Theory Series B. 109. 258–262. 1 indexed citations
7.
Bansal, Nikhil, et al.. (2014). On the number of matroids. COMBINATORICA. 35(3). 253–277. 13 indexed citations
8.
Pendavingh, Rudi, et al.. (2014). Counting matroids in minor-closed classes. Journal of Combinatorial Theory Series B. 111. 126–147. 3 indexed citations
9.
Bansal, Nikhil, et al.. (2013). On the number of matroids. Symposium on Discrete Algorithms. 675–694. 1 indexed citations
10.
Bruhn, Henning, Reinhard Diestel, Matthias Kriesell, Rudi Pendavingh, & Paul Wollan. (2013). Axioms for infinite matroids. Advances in Mathematics. 239. 18–46. 24 indexed citations
11.
Pendavingh, Rudi, et al.. (2012). Skew partial fields, multilinear representations of matroids, and a matrix tree theorem. Advances in Applied Mathematics. 50(1). 201–227. 8 indexed citations
12.
Pendavingh, Rudi, et al.. (2010). Confinement of matroid representations to subsets of partial fields. Journal of Combinatorial Theory Series B. 100(6). 510–545. 13 indexed citations
13.
Pendavingh, Rudi, et al.. (2008). 2-piercings via graph theory. Discrete Applied Mathematics. 156(18). 3510–3512.
14.
Pendavingh, Rudi, et al.. (2007). New Korkin–Zolotarev Inequalities. SIAM Journal on Optimization. 18(1). 364–378. 4 indexed citations
15.
Pendavingh, Rudi, et al.. (2005). A linear programming formulation of Mader's edge-disjoint paths problem. Journal of Combinatorial Theory Series B. 96(1). 159–163. 6 indexed citations
16.
Bisseling, Rob H., et al.. (2005). Partitioning a Call Graph. Data Archiving and Networked Services (DANS). 33(2). 209–14. 6 indexed citations
17.
Pendavingh, Rudi, Petra Schuurman, & Gerhard J. Woeginger. (2003). Recognizing DNA graphs is difficult. Discrete Applied Mathematics. 127(1). 85–94. 8 indexed citations
18.
Pendavingh, Rudi, et al.. (2000). Adjacency, Inseparability, and Base Orderability in Matroids. European Journal of Combinatorics. 21(4). 487–502.
19.
Pendavingh, Rudi, et al.. (1998). An Efficient Algorithm for Minimum-Weight Bibranching. Journal of Combinatorial Theory Series B. 73(2). 130–145. 9 indexed citations
20.
Pendavingh, Rudi. (1998). On the Relation Between Two Minor-Monotone Graph Parameters. COMBINATORICA. 18(2). 281–292. 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

Breakdown of academic impact, for papers by Jérémie Chalopin Breakdown of academic impact, for papers by Bartosz Walczak Breakdown of academic impact, for papers by Dimitrios M. Thilikos Breakdown of academic impact, for papers by Jean-Luc Baril Breakdown of academic impact, for papers by Rudini Sampaio Breakdown of academic impact, for papers by Michał Adamaszek Breakdown of academic impact, for papers by Torsten Mütze Breakdown of academic impact, for papers by Aline Parreau Breakdown of academic impact, for papers by Ross J. Kang Breakdown of academic impact, for papers by Luérbio Faria
Rankless by CCL
2026