default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRudi Pendavingh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Nick Brettell, Rudi Pendavingh:
Computing Excluded Minors for Classes of Matroids Representable over Partial Fields. Electron. J. Comb. 31(3) (2024)- [j25]Camille Lanuel, Francis Lazarus, Rudi Pendavingh:
A Linear Bound for the Colin de Verdière Parameter \(\boldsymbol{\mu }\) for Graphs Embedded on Surfaces. SIAM J. Discret. Math. 38(3): 2289-2296 (2024) - 2023
- [j24]Lukas Kühne
, Rudi Pendavingh, Geva Yashfe:
Von Staudt constructions for skew-linear and multilinear matroids. Comb. Theory 3(1) (2023) - [i3]Camille Lanuel, Francis Lazarus, Rudi Pendavingh:
A linear bound for the Colin de Verdiére parameter μ for graphs embedded on surfaces. CoRR abs/2303.00556 (2023) - 2022
- [j23]Danny Blom, Rudi Pendavingh, Frits C. R. Spieksma:
Filling a Theater During the COVID-19 Pandemic. INFORMS J. Appl. Anal. 52(6): 473-484 (2022) - 2020
- [i2]Danny Blom, Rudi Pendavingh, Frits C. R. Spieksma:
Filling a theatre in times of corona. CoRR abs/2010.01981 (2020)
2010 – 2019
- 2019
- [j22]Rudi Pendavingh, Jorn G. van der Pol:
Asymptotics of symmetry in matroids. J. Comb. Theory B 135: 349-365 (2019) - 2018
- [j21]Rudi Pendavingh, Jorn G. van der Pol:
On the Number of Bases of Almost All Matroids. Comb. 38(4): 955-985 (2018) - 2017
- [j20]Rudi Pendavingh, Jorn G. van der Pol:
Enumerating Matroids of Fixed Rank. Electron. J. Comb. 24(1): 1 (2017) - 2016
- [j19]Tom de Greef, Saeed Masroor, Mark A. Peletier, Rudi Pendavingh:
Precision and Sensitivity in Detailed-Balance Reaction Networks. SIAM J. Appl. Math. 76(6): 2123-2153 (2016) - 2015
- [j18]Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol:
On the number of matroids. Comb. 35(3): 253-277 (2015) - [j17]Rudi Pendavingh, Jorn G. van der Pol:
On the Number of Matroids Compared to the Number of Sparse Paving Matroids. Electron. J. Comb. 22(2): 2 (2015) - [j16]Rudi Pendavingh, Jorn G. van der Pol:
Counting matroids in minor-closed classes. J. Comb. Theory B 111: 126-147 (2015) - 2014
- [j15]Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol:
An entropy argument for counting matroids. J. Comb. Theory B 109: 258-262 (2014) - 2013
- [j14]Rudi Pendavingh, Stefan H. M. van Zwam:
Skew partial fields, multilinear representations of matroids, and a matrix tree theorem. Adv. Appl. Math. 50(1): 201-227 (2013) - [c3]Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol:
On the number of matroids. SODA 2013: 675-694 - 2012
- [i1]Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol:
An entropy argument for counting matroids. CoRR abs/1210.6581 (2012) - 2011
- [j13]J. C. M. Keijsper, Rudi Pendavingh:
Convex minization over Z2. Oper. Res. Lett. 39(1): 53-56 (2011) - 2010
- [j12]Rudi Pendavingh, Stefan H. M. van Zwam:
Lifts of matroid representations over partial fields. J. Comb. Theory B 100(1): 36-67 (2010) - [j11]Rudi Pendavingh, Stefan H. M. van Zwam:
Confinement of matroid representations to subsets of partial fields. J. Comb. Theory B 100(6): 510-545 (2010)
2000 – 2009
- 2009
- [j10]Hein van der Holst, Rudi Pendavingh:
On a graph property generalizing planarity and flatness. Comb. 29(3): 337-361 (2009) - 2008
- [j9]Rudi Pendavingh, Quintijn Puite, Gerhard J. Woeginger:
2-piercings via graph theory. Discret. Appl. Math. 156(18): 3510-3512 (2008) - [j8]Cor A. J. Hurkens, Rudi Pendavingh, Gerhard J. Woeginger:
The Magnus-Derek game revisited. Inf. Process. Lett. 109(1): 38-40 (2008) - 2007
- [j7]Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, Yunhong Zhou:
Server Allocation Algorithms for Tiered Systems. Algorithmica 48(2): 129-146 (2007) - [j6]Rudi Pendavingh, Stefan H. M. van Zwam:
New Korkin--Zolotarev Inequalities. SIAM J. Optim. 18(1): 364-378 (2007) - 2006
- [j5]Judith Keijsper, Rudi Pendavingh, Leen Stougie:
A linear programming formulation of Mader's edge-disjoint paths problem. J. Comb. Theory B 96(1): 159-163 (2006) - 2005
- [c2]Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, Yunhong Zhou:
Server Allocation Algorithms for Tiered Systems. COCOON 2005: 632-643 - 2003
- [j4]Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger:
Recognizing DNA graphs is difficult. Discret. Appl. Math. 127(1): 85-94 (2003) - 2001
- [c1]Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger:
De Bruijn Graphs and DNA Graphs. WG 2001: 296-305 - 2000
- [j3]Judith Keijsper, Rudi Pendavingh, Alexander Schrijver:
Adjacency, Inseparability, and Base Orderability in Matroids. Eur. J. Comb. 21(4): 487-502 (2000)
1990 – 1999
- 1998
- [j2]Rudi Pendavingh:
On the Relation Between Two Minor-Monotone Graph Parameters. Comb. 18(2): 281-292 (1998) - [j1]Judith Keijsper, Rudi Pendavingh:
An Efficient Algorithm for Minimum-Weight Bibranching. J. Comb. Theory B 73(2): 130-145 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
