Rudi Pendavingh

According to our database1, Rudi Pendavingh authored at least 28 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Linear Bound for the Colin de Verdière Parameter \(\boldsymbol{\mu }\) for Graphs Embedded on Surfaces.
SIAM J. Discret. Math., 2024

Computing Excluded Minors for Classes of Matroids Representable over Partial Fields.
Electron. J. Comb., 2024

2023
A linear bound for the Colin de Verdiére parameter μ for graphs embedded on surfaces.
CoRR, 2023

2022
Filling a Theater During the COVID-19 Pandemic.
INFORMS J. Appl. Anal., 2022

2020
Filling a theatre in times of corona.
CoRR, 2020

2019
Asymptotics of symmetry in matroids.
J. Comb. Theory B, 2019

2018
On the Number of Bases of Almost All Matroids.
Comb., 2018

2017
Enumerating Matroids of Fixed Rank.
Electron. J. Comb., 2017

2016
Precision and Sensitivity in Detailed-Balance Reaction Networks.
SIAM J. Appl. Math., 2016

2015
Counting matroids in minor-closed classes.
J. Comb. Theory B, 2015

On the Number of Matroids Compared to the Number of Sparse Paving Matroids.
Electron. J. Comb., 2015

On the number of matroids.
Comb., 2015

2014
An entropy argument for counting matroids.
J. Comb. Theory B, 2014

2013
Skew partial fields, multilinear representations of matroids, and a matrix tree theorem.
Adv. Appl. Math., 2013

2011
Convex minization over Z<sup>2</sup>.
Oper. Res. Lett., 2011

2010
Confinement of matroid representations to subsets of partial fields.
J. Comb. Theory B, 2010

Lifts of matroid representations over partial fields.
J. Comb. Theory B, 2010

2009
On a graph property generalizing planarity and flatness.
Comb., 2009

2008
The Magnus-Derek game revisited.
Inf. Process. Lett., 2008

2-piercings via graph theory.
Discret. Appl. Math., 2008

2007
New Korkin--Zolotarev Inequalities.
SIAM J. Optim., 2007

Server Allocation Algorithms for Tiered Systems.
Algorithmica, 2007

2006
A linear programming formulation of Mader's edge-disjoint paths problem.
J. Comb. Theory B, 2006

2003
Recognizing DNA graphs is difficult.
Discret. Appl. Math., 2003

2001
De Bruijn Graphs and DNA Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

2000
Adjacency, Inseparability, and Base Orderability in Matroids.
Eur. J. Comb., 2000

1998
An Efficient Algorithm for Minimum-Weight Bibranching.
J. Comb. Theory B, 1998

On the Relation Between Two Minor-Monotone Graph Parameters.
Comb., 1998


  Loading...