• PO Box 513, Department of Mathematics and Computer Science

    5600 MB Eindhoven

    Netherlands

  • 143 Citations
19982019

Research output per year

If you made any changes in Pure these will be visible here soon.

Personal profile

Research profile

Rudi Pendavingh is affiliated with TU/e since 1999. He obtained a PhD at the University of Amsterdam on a topic in topological graph theory, and has worked on very diverse topics in combinatorics and geometry since. In recent years, his research has focussed on matroid theory. Working in the chair of Combinatorial Optimization, he has taught courses on many aspects of mathematical programming, including linear-, integer-, and semidefinite optimization.

Fingerprint Dive into the research topics where Rudi A. Pendavingh is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output

Asymptotics of symmetry in matroids

Pendavingh, R. & van der Pol, J., 1 Mar 2019, In : Journal of Combinatorial Theory, Series B. 135, p. 349-365 17 p.

Research output: Contribution to journalArticleAcademicpeer-review

  • 1 Downloads (Pure)

    Perfect matroids over hyperfields

    Bowler, N. & Pendavingh, R. A., 9 Aug 2019, In : arXiv.org,e-Print Archive, Mathematics. 16 p., 1908.03420vl.

    Research output: Contribution to journalArticleAcademic

    Open Access
    File
  • 9 Downloads (Pure)

    Algebraic matroids and Frobenius flocks

    Bollen, G. P., Draisma, J. & Pendavingh, R., 7 Jan 2018, In : Advances in Mathematics. 323, p. 688-719 32 p.

    Research output: Contribution to journalArticleAcademicpeer-review

    Open Access
    File
  • 2 Citations (Scopus)
    57 Downloads (Pure)

    Field extensions, derivations, and matroids over skew hyperfields

    Pendavingh, R., 7 Feb 2018, In : arXiv. 1802.02447.

    Research output: Contribution to journalArticleAcademic

    Open Access
    File
  • 86 Downloads (Pure)

    On the number of bases of almost all matroids

    Pendavingh, R. & van der Pol, J., 1 Aug 2018, In : Combinatorica. 38, 4 , p. 955–985 31 p.

    Research output: Contribution to journalArticleAcademicpeer-review

    Open Access
    File
  • 2 Citations (Scopus)
    26 Downloads (Pure)

    Courses

    Graphs and algorithms

    1/09/15 → …

    Course

    Integer programming

    1/09/15 → …

    Course

    Linear optimization

    1/09/13 → …

    Course

    Professional portfolio

    1/09/15 → …

    Course

    Student theses

    Analysis of an algorithm for finding perfect matching in k-regular bipartite graphs

    Author: Blom, D. A., 31 Aug 2017

    Supervisor: Pendavingh, R. (Supervisor 1)

    Student thesis: Bachelor

    File

    Connectivity algorithms for undirected graphs in Sage

    Author: Oosterhof, F., 7 Jul 2014

    Supervisor: Pendavingh, R. (Supervisor 1)

    Student thesis: Bachelor

    File

    Counting matroids

    Author: van der Pol, J., 30 Jun 2013

    Supervisor: Bansal, N. (Supervisor 1), van der Hofstad, R. (Supervisor 2) & Pendavingh, R. (Supervisor 2)

    Student thesis: Master

    File

    Depth estimation for stereo image pairs

    Author: Boesten, D., 31 Jan 2010

    Supervisor: Vandewalle, P. (External person) (Supervisor 1), Hurkens, C. (Supervisor 2) & Pendavingh, R. (Supervisor 2)

    Student thesis: Master

    File

    Fast matrix multiplication

    Author: Takke, E. C., 3 Jul 2019

    Supervisor: Pendavingh, R. (Supervisor 1)

    Student thesis: Bachelor

    File