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="Ding, Guoli"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Internally 4-connected projective-planar graphs
Guoli Ding
,
Perry Iverson
Journal of Combinatorial Theory Series B
108
, 2014, pp. 123-138
On 3-connected graphs of path-width at most three
Guoli Ding
,
Stan Dziobiak
SIAM Journal on Discrete Mathematics
27
(3), 2013, pp. 1514-1526
A characterization of graphs with no octahedron minor
Guoli Ding
Journal of Graph Theory
74
(2), 2013, pp. 143-162
The maximum-weight stable matching problem: Duality and efficiency
Xujin Chen
,
Guoli Ding
,
Xiaodong Hu
,
Wenan Zang
SIAM Journal on Discrete Mathematics
26
(3), 2012, pp. 1346-1360
Bonds with parity constraints
Xujin Chen
,
Guoli Ding
,
Xingxing Yu
,
Wenan Zang
Journal of Combinatorial Theory Series B
102
(3), 2012, pp. 588-609
A chain theorem for
3^+
-connected graphs
Guoli Ding
,
Cheng Liu
SIAM Journal on Discrete Mathematics
26
(1), 2012, pp. 102-113
Large non-planar graphs and an application to crossing-critical graphs
Guoli Ding
,
Bogdan Oporowski
,
Robin Thomas
,
Dirk Vertigan
Journal of Combinatorial Theory Series B
101
(2), 2011, pp. 111-121
Splitter theorems for 4-regular graphs
Guoli Ding
,
Jinko Kanno
Graphs and Combinatorics
26
(3), 2010, pp. 329-344
Unavoidable parallel minors of 4-connected graphs
Carolyn Chun
,
Guoli Ding
,
Bogdan Oporowski
,
Dirk Vertigan
Journal of Graph Theory
60
(4), 2009, pp. 313-326
Generating 5-regular planar graphs
Guoli Ding
,
Jinko Kanno
,
Jianning Su
Journal of Graph Theory
61
(3), 2009, pp. 219-240
A min-max relation on packing feedback vertex sets
Xujin Chen
,
Guoli Ding
,
Xiaodong Hu
,
Wenan Zang
Lecture Notes in Computer Science
3827
, 2005, pp. 126-135
New bounds for randomized busing
Steven S. Seiden
,
Peter P. Chen
,
R.F. Lax
,
J. Chen
,
Guoli Ding
Theoretical Computer Science
332
(1-3), 2005, pp. 63-81
The best expert versus the smartest algorithm
Peter Chen
,
Guoli Ding
Theoretical Computer Science
324
(2-3), 2004, pp. 361-380
Excluding any graph as a minor allows a low tree-width 2-coloring
Matt DeVos
,
Guoli Ding
,
Bogdan Oporowski
,
Daniel P. Sanders
,
Bruce Reed
,
Paul Seymour
,
Dirk Vertigan
Journal of Combinatorial Theory Series B
91
(1), 2004, pp. 25-41
Partitioning into graphs with only small components
Noga Alon
,
Guoli Ding
,
Bogdan Oporowski
,
Dirk Vertigan
Journal of Combinatorial Theory Series B
87
(2), 2003, pp. 231-243
Packing cycles in graphs, II
Guoli Ding
,
Zhenzhen Xu
,
Wenan Zang
Journal of Combinatorial Theory Series B
87
(2), 2003, pp. 244-253
Packing cycles in graphs
Guoli Ding
,
Wenan Zang
Journal of Combinatorial Theory Series B
86
(2), 2002, pp. 381-407
Spanning trees with many leaves
Guoli Ding
,
Thor Johnson
,
Paul Seymour
Journal of Graph Theory
(4), 2001, pp. 189-197
Surfaces, tree-width, clique-minors, and partitions
Guoli Ding
,
Bogdan Oporowski
,
Daniel P. Sanders
,
Dirk Vertigan
Journal of Combinatorial Theory Series B
79
(2), 2000, pp. 221-246
Partitioning graphs of bounded tree-width
Guoli Ding
,
Bogdan Oporowski
,
Daniel P. Sanders
,
Dirk Vertigan
Combinatorica
18
(1), 1998, pp. 1-12
Chordal graphs, interval graphs, and wqo
Guoli Ding
Journal of Graph Theory
28
(2), 1998, pp. 105-114
Unavoidable minors of large 3-connected matroids
Guoli Ding
,
Bogdan Oporowski
,
James Oxley
,
Dirk Vertigan
Journal of Combinatorial Theory Series B
71
(2), 1997, pp. 244-293
Unavoidable minors of large 3-connected binary matroids
Guoli Ding
,
Bogdan Oporowski
,
James Oxley
,
Dirk Vertigan
Journal of Combinatorial Theory Series B
66
(2), 1996, pp. 334-360
Bounding the number of circuits of a graph
Guoli Ding
Combinatorica
16
(3), 1996, pp. 331-341
Excluding a long double path minor
Guoli Ding
Journal of Combinatorial Theory Series B
66
(1), 1996, pp. 11-23
Seiten 1
2
>