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="Gerards, Bert"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Characterizing graphic matroids by a system of linear equations
Jim Geelen
,
Bert Gerards
Journal of Combinatorial Theory Series B
103
(5), 2013, pp. 642-646
On inequivalent representations of matroids over non-prime fields
Jim Geelen
,
Bert Gerards
,
Geoff Whittle
Journal of Combinatorial Theory Series B
100
(6), 2010, pp. 740-743
On the odd-minor variant of Hadwiger's conjecture
Jim Geelen
,
Bert Gerards
,
Bruce Reed
,
Paul Seymour
,
Adrian Vetta
Journal of Combinatorial Theory Series B
99
(1), 2009, pp. 20-29
Tangles, tree-decompositions and grids in matroids
Jim Geelen
,
Bert Gerards
,
Geoff Whittle
Journal of Combinatorial Theory Series B
99
(4), 2009, pp. 657-667
Excluding a group-labelled graph
Jim Geelen
,
Bert Gerards
Journal of Combinatorial Theory Series B
99
(1), 2009, pp. 247-253
Mixed-integer vertex covers on bipartite graphs
Michele Conforti
,
Bert Gerards
,
Giacomo Zambelli
Lecture Notes in Computer Science
4513
, 2007, pp. 324-336
Packing odd circuits
Michele Conforti
,
Bert Gerards
SIAM Journal on Discrete Mathematics
21
(2), 2007, pp. 273-302
Excluding a planar graph from
GF(q)
-representable matroids
Jim Geelen
,
Bert Gerards
,
Geoff Whittle
Journal of Combinatorial Theory Series B
97
(6), 2007, pp. 971-998
Packing non-Zero
A
-paths in group-labelled graphs
Maria Chudnovsky
,
Jim Geelen
,
Bert Gerards
,
Luis Goddyn
,
Michael Lohman
,
Paul Seymour
Combinatorica
26
(5), 2006, pp. 521-532
On Rota's conjecture and excluded minors containing large projective geometries
Jim Geelen
,
Bert Gerards
,
Geoff Whittle
Journal of Combinatorial Theory Series B
96
(3), 2006, pp. 405-425
Matroid
T
-connectivity
Jim Geelen
,
Bert Gerards
,
Geoff Whittle
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 588-596
Regular matroid decomposition via signed graphs
Jim Geelen
,
Bert Gerards
Journal of Graph Theory
48
(1), 2005, pp. 74-84
Two
O(\log ^* k)
-approximation algorithms for the asymmetric
k
-center problem
Aaron Archer
Lecture Notes in Computer Science
2081
, 2001, pp. 1-14
Strongly polynomial algorithms for the unsplittable flow problem
Yossi Azar
,
Oded Regev
Lecture Notes in Computer Science
2081
, 2001, pp. 15-29
Edge covers of setpairs and the iterative rounding method
Joseph Cheriyan
,
Santosh Vempala
Lecture Notes in Computer Science
2081
, 2001, pp. 30-44
The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
Cheng-Feng Mabel Chou
,
Maurice Queyranne
,
David Simchi-Levi
Lecture Notes in Computer Science
2081
, 2001, pp. 45-59
Approximate
k
-MSTs and
k
-Steiner trees via the primal-dual method and Lagrangean relaxation
Fabián A. Chudak
,
Tim Roughgarden
,
David P. Williamson
Lecture Notes in Computer Science
2081
, 2001, pp. 60-70
On the rank of mixed 0,1 polyhedra
Gérard Cornuéjols
,
Yanjun Li
Lecture Notes in Computer Science
2081
, 2001, pp. 71-77
Fast 2-variable integer programming
Friedrich Eisenbrand
,
Günter Rote
Lecture Notes in Computer Science
2081
, 2001, pp. 78-89
Approximating
k
-spanner problems for
k>2
Michael Elkin
,
David Peleg
Lecture Notes in Computer Science
2081
, 2001, pp. 90-104
A matroid generalization of the stable matching polytope
Tamás Fleiner
Lecture Notes in Computer Science
2081
, 2001, pp. 105-114
A 2-approximation for minimum cost 0,1,2 vertex connectivity
Lisa Fleischer
Lecture Notes in Computer Science
2081
, 2001, pp. 115-129
Combined connectivity augmentation and orientation problems
András Frank
,
Tamás Király
Lecture Notes in Computer Science
2081
, 2001, pp. 130-144
An extension of a theorem of Henneberg and Laman
András Frank
,
László Szegŏ
Lecture Notes in Computer Science
2081
, 2001, pp. 145-159
Bisubmodular function minimization
Satoru Fujishige
,
Satoru Iwata
Lecture Notes in Computer Science
2081
, 2001, pp. 160-169
Seiten 1
2
>