Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Pendavingh, R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An entropy argument for counting matroids
N. Bansal
,
R.A. Pendavingh
,
J.G. van der Pol
Journal of Combinatorial Theory Series B
109
, 2014, pp. 258-262
Lifts of matroid representations over partial fields
R.A. Pendavingh
,
S.H.M. van Zwam
Journal of Combinatorial Theory Series B
100
(1), 2010, pp. 36-67
Confinement of matroid representations to subsets of partial fields
R.A. Pendavingh
,
S.H.M. van Zwam
Journal of Combinatorial Theory Series B
100
(6), 2010, pp. 510-545
A linear programming formulation of Mader's edge-disjoint paths problem
J.C.M. Keijsper
,
R.A. Pendavingh
,
L. Stougie
Journal of Combinatorial Theory Series B
96
(1), 2006, pp. 159-163
An efficient algorithm for minimum-weight bibranching
J. Keijsper
,
R. Pendavingh
Journal of Combinatorial Theory Series B
73
(2), 1998, pp. 130-145
On the relation between two minor-monotone graph parameters
R. Pendavingh
Combinatorica
18
(2), 1998, pp. 281-292