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
Hilfe
Suche: Author="Guenin, Bertrand"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The cycling property for the clutter of odd
st
-walks
Ahmad Abdi
,
Bertrand Guenin
Lecture Notes in Computer Science
8494
, 2014, pp. 1-12
Relationships between pairs of representations of signed binary matroids
Bertrand Guenin
,
Irene Pivotto
,
Paul Wollan
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 329-341
Single commodity-flow algorithms for lifts of graphic and co-graphic matroids
Bertrand Guenin
,
Leanne Stuive
Lecture Notes in Computer Science
7801
, 2013, pp. 193-204
Packing directed circuits exactly
Bertrand Guenin
,
Robin Thomas
Combinatorica
31
(4), 2011, pp. 397-421
Lehman matrices
Gérard Cornuéjols
,
Bertrand Guenin
,
Levent Tunçel
Journal of Combinatorial Theory Series B
99
(3), 2009, pp. 531-556
Ideal binary clutters, connectivity, and a conjecture of Seymour
Gérard Cornuéjols
,
Bertrand Guenin
SIAM Journal on Discrete Mathematics
15
(3), 2002, pp. 329-352
Packing odd circuits in Eulerian graphs
James F. Geelen
,
Bertrand Guenin
Journal of Combinatorial Theory Series B
86
(2), 2002, pp. 280-295
A short proof of Seymour's characterization of the matroids with the max-flow min-cut property
Bertrand Guenin
Journal of Combinatorial Theory Series B
86
(2), 2002, pp. 273-279
A short proof of Seymour's characterization of the matroids with the Max-Flow Min-Cut property
Bertrand Guenin
Lecture Notes in Computer Science
2337
, 2002, pp. 188-193
A characterization of weakley bipartite graphs
Bertrand Guenin
Journal of Combinatorial Theory Series B
83
(1), 2001, pp. 112-168
Circuit Mengerian directed graphs
Bertrand Guenin
Lecture Notes in Computer Science
2081
, 2001, pp. 185-195
Integral polyhedra related to even cycle and even cut matroids
Bertrand Guenin
Lecture Notes in Computer Science
2081
, 2001, pp. 196-209
The packing property
Gérard Cornuéjols
,
Bertrand Guenin
,
François Margot
Lecture Notes in Computer Science
1412
, 1998, pp. 1-8
A characterization of weakly bipartite graphs
Bertrand Guenin
Lecture Notes in Computer Science
1412
, 1998, pp. 9-22