dblp.uni-trier.dewww.uni-trier.de

Bruce A. Reed Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
128EEMichael Molloy, Bruce A. Reed: Asymptotically optimal frugal colouring. SODA 2009: 106-114
127EEKen-ichi Kawarabayashi, Bruce A. Reed: A nearly linear time algorithm for the half integral parity disjoint paths packing problem. SODA 2009: 1183-1192
126EEKen-ichi Kawarabayashi, Bruce A. Reed: Hadwiger's conjecture is decidable. STOC 2009: 445-454
125EEEtienne Birmelé, John Adrian Bondy, Bruce A. Reed: Tree-width of graphs without a 3×3 grid minor. Discrete Applied Mathematics 157(12): 2577-2596 (2009)
124EEJim Geelen, Bert Gerards, Bruce A. Reed, Paul D. Seymour, Adrian Vetta: On the odd-minor variant of Hadwiger's conjecture. J. Comb. Theory, Ser. B 99(1): 20-29 (2009)
123EEKen-ichi Kawarabayashi, Bruce A. Reed, Orlando Lee: Removable cycles in non-bipartite graphs. J. Comb. Theory, Ser. B 99(1): 30-38 (2009)
122EEBenjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon: Coloring Artemis graphs. Theor. Comput. Sci. 410(21-23): 2234-2240 (2009)
2008
121EEKen-ichi Kawarabayashi, Bojan Mohar, Bruce A. Reed: A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. FOCS 2008: 771-780
120EEBruce A. Reed, Zhentao Li: Optimization and Recognition for K 5-minor Free Graphs in Linear Time. LATIN 2008: 206-215
119EEKen-ichi Kawarabayashi, Bruce A. Reed: A nearly linear time algorithm for the half integral disjoint paths packing. SODA 2008: 446-454
118EEFrédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni: L(2, 1)-labelling of graphs. SODA 2008: 621-630
117EEColin McDiarmid, Bruce A. Reed: On the Maximum Degree of a Random Planar Graph. Combinatorics, Probability & Computing 17(4): 591-601 (2008)
116EEConor Meagher, Bruce A. Reed: Fractionally total colouring Gn, p. Discrete Applied Mathematics 156(7): 1112-1124 (2008)
115EEBruce A. Reed: Skew partitions in perfect graphs. Discrete Applied Mathematics 156(7): 1150-1156 (2008)
114EELouigi Addario-Berry, Ketan Dalal, Bruce A. Reed: Degree constrained subgraphs. Discrete Applied Mathematics 156(7): 1168-1174 (2008)
113EESamuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta: Planar graph bipartization in linear time. Discrete Applied Mathematics 156(7): 1175-1180 (2008)
112EEOmid Amini, Bruce A. Reed: List Colouring Constants of Triangle Free Graphs. Electronic Notes in Discrete Mathematics 30: 135-140 (2008)
111EEKen-ichi Kawarabayashi, Bruce A. Reed: Fractional coloring and the odd Hadwiger's conjecture. Eur. J. Comb. 29(2): 411-417 (2008)
110EEKen-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed, Paul Wollan: A weaker version of Lovász' path removal conjecture. J. Comb. Theory, Ser. B 98(5): 972-979 (2008)
109EELouigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour: Bisimplicial vertices in even-hole-free graphs. J. Comb. Theory, Ser. B 98(6): 1119-1164 (2008)
108EEAndrew D. King, Bruce A. Reed: Bounding chi in terms of omega and delta for quasi-line graphs. Journal of Graph Theory 59(3): 215-228 (2008)
107EENikolaos Fountoulakis, Bruce A. Reed: The evolution of the mixing rate of a simple random walk on the giant component of a random graph. Random Struct. Algorithms 33(1): 68-86 (2008)
106EECláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed: On Planar Quasi-Parity Graphs. SIAM J. Discrete Math. 22(1): 329-347 (2008)
2007
105EEArkadev Chattopadhyay, Bruce A. Reed: Properly 2-Colouring Linear Hypergraphs. APPROX-RANDOM 2007: 395-408
104EEKen-ichi Kawarabayashi, Bruce A. Reed: Computing crossing number in linear time. STOC 2007: 382-390
103EELouigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason: Vertex-Colouring Edge-Weightings. Combinatorica 27(1): 1-12 (2007)
102EEEtienne Birmelé, John Adrian Bondy, Bruce A. Reed: The Erdös-Pósa Property For Long Circuits. Combinatorica 27(2): 135-145 (2007)
101EEAndrew D. King, Bruce A. Reed: Asymptotics of the chromatic number for quasi-line graphs. Electronic Notes in Discrete Mathematics 29: 327-331 (2007)
100EEFrédéric Havet, Jan van den Heuvel, Colin McDiarmid, Bruce A. Reed: List Colouring Squares of Planar Graphs. Electronic Notes in Discrete Mathematics 29: 515-519 (2007)
99EEAndrew D. King, Bruce A. Reed, Adrian Vetta: An upper bound for the chromatic number of line graphs. Eur. J. Comb. 28(8): 2182-2187 (2007)
98EESamuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta: Approximate min-max relations for odd cycles in planar graphs. Math. Program. 110(1): 71-91 (2007)
2006
97EEColin McDiarmid, Bruce A. Reed: Concentration for self-bounding functions and an inequality of Talagrand. Random Struct. Algorithms 29(4): 549-557 (2006)
2005
96EESamuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta: Approximate Min-max Relations for Odd Cycles in Planar Graphs. IPCO 2005: 35-50
95EEZhentao Li, Bruce A. Reed: Heap Building Bounds. WADS 2005: 14-23
94EEBenjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon: Coloring Artemis graphs CoRR abs/cs/0504082: (2005)
93EELouigi Addario-Berry, Ketan Dalal, Bruce A. Reed: Degree constrained subgraphs. Electronic Notes in Discrete Mathematics 19: 257-263 (2005)
92EESamuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta: Planar graph bipartization in linear time. Electronic Notes in Discrete Mathematics 19: 265-271 (2005)
91EEConor Meagher, Bruce A. Reed: Fractionally total colouring Gn, p. Electronic Notes in Discrete Mathematics 19: 297-303 (2005)
90EEBabak Farzad, Michael S. O. Molloy, Bruce A. Reed: (Delta-k)-critical graphs. J. Comb. Theory, Ser. B 93(2): 173-185 (2005)
89EELouigi Addario-Berry, Robert E. L. Aldred, Ketan Dalal, Bruce A. Reed: Vertex colouring edge partitions. J. Comb. Theory, Ser. B 94(2): 237-244 (2005)
88EEDavid Avis, Caterina De Simone, Bruce A. Reed: On the fractional chromatic index of a graph and its complement. Oper. Res. Lett. 33(4): 385-388 (2005)
2004
87EEBruce A. Reed, Benny Sudakov: List Colouring When The Chromatic Number Is Close To the Order Of The Graph. Combinatorica 25(1): 117-123 (2004)
86EEBruce A. Reed, Siang W. Song, Jayme Luiz Szwarcfiter: Preface. Discrete Applied Mathematics 141(1-3): 1 (2004)
85EESimone Dantas, Celina M. Herrera de Figueiredo, Sulamita Klein, Sylvain Gravier, Bruce A. Reed: Stable skew partition problem. Discrete Applied Mathematics 143(1-3): 17-22 (2004)
84EEBruce A. Reed, Paul D. Seymour: Hadwiger's conjecture for line graphs. Eur. J. Comb. 25(6): 873-876 (2004)
83EEMatt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan: Excluding any graph as a minor allows a low tree-width 2-coloring. J. Comb. Theory, Ser. B 91(1): 25-41 (2004)
82EEGuillaume Fertin, André Raspaud, Bruce A. Reed: Star coloring of graphs. Journal of Graph Theory 47(3): 163-182 (2004)
81EEBruce A. Reed, Kaleigh Smith, Adrian Vetta: Finding odd cycle transversals. Oper. Res. Lett. 32(4): 299-301 (2004)
80EEChính T. Hoàng, Bruce A. Reed: On the Co-P3-Structure of Perfect Graphs. SIAM J. Discrete Math. 18(3): 571-576 (2004)
2003
79EEMartin Loebl, Jaroslav Nesetril, Bruce A. Reed: A note on random homomorphism from arbitrary graphs to Z. Discrete Mathematics 273(1-3): 173-181 (2003)
78EEColin McDiarmid, Bruce A. Reed: Channel assignment on graphs of bounded treewidth. Discrete Mathematics 273(1-3): 183-192 (2003)
77EEBruce A. Reed: The height of a random binary search tree. J. ACM 50(3): 306-332 (2003)
76EEGruia Calinescu, Cristina G. Fernandes, Bruce A. Reed: Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J. Algorithms 48(2): 333-359 (2003)
2002
75EERyan B. Hayward, Stefan Hougardy, Bruce A. Reed: Polynomial time recognition of P4-structure. SODA 2002: 382-389
74 Colin Cooper, Alan M. Frieze, Bruce A. Reed: Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. Combinatorics, Probability & Computing 11(3): (2002)
73 Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan: Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. Combinatorics, Probability & Computing 11(4): (2002)
72EEBruce A. Reed, Benny Sudakov: Asymptotically the List Colouring Constants Are 1. J. Comb. Theory, Ser. B 86(1): 27-37 (2002)
2001
71EEDieter Rautenbach, Bruce A. Reed: Approximately covering by cycles in planar graphs. SODA 2001: 402-406
70EEMichael Molloy, Bruce A. Reed: Colouring graphs when the number of colours is nearly the maximum degree. STOC 2001: 462-470
69EEGuillaume Fertin, André Raspaud, Bruce A. Reed: On Star Coloring of Graphs. WG 2001: 140-153
68EEDieter Rautenbach, Bruce A. Reed: The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs. Combinatorica 21(2): 267-278 (2001)
67EEMartin Loebl, Jaroslav Nesetril, Bruce A. Reed: A note on Random Homomorphism from ArbitraryGraphs to Z. Electronic Notes in Discrete Mathematics 10: 176-180 (2001)
66EEColin McDiarmid, Bruce A. Reed: Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs. Electronic Notes in Discrete Mathematics 10: 198-201 (2001)
65EEHazel Everett, Celina M. Herrera de Figueiredo, Sulamita Klein, Bruce A. Reed: Bull-Reducible Berge Graphs are Perfect. Electronic Notes in Discrete Mathematics 10: 93-95 (2001)
64EECláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed: Recognizing Planar Strict Quasi-Parity Graphs. Graphs and Combinatorics 17(4): 745-757 (2001)
2000
63 Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics: Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract). LATIN 2000: 126-134
62 Celina M. Herrera de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed: Finding Skew Partitions Efficiently. LATIN 2000: 163-172
61EEBruce A. Reed: How tall is a tree? STOC 2000: 479-483
60EEClaude Berge, Bruce A. Reed: Optimal packings of edge-disjoint odd cycles. Discrete Mathematics 211: 197-202 (2000)
59EEMichael Molloy, Bruce A. Reed: k-Colouring when k is close to Delta. Electronic Notes in Discrete Mathematics 5: 235-238 (2000)
58 Ljubomir Perkovic, Bruce A. Reed: An Improved Algorithm for Finding Tree Decompositions of Small Width. Int. J. Found. Comput. Sci. 11(3): 365-371 (2000)
57 Celina M. Herrera de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed: Finding Skew Partitions Efficiently. J. Algorithms 37(2): 505-521 (2000)
56EEBruce A. Reed, Robin Thomas: Clique Minors in Graphs and Their Complements. J. Comb. Theory, Ser. B 78(1): 81-85 (2000)
55EEColin McDiarmid, Bruce A. Reed: Channel assignment and weighted coloring. Networks 36(2): 114-117 (2000)
54 Michael Molloy, Bruce A. Reed: Near-optimal list colorings. Random Struct. Algorithms 17(3-4): 376-402 (2000)
1999
53EELjubomir Perkovic, Bruce A. Reed: An Improved Algorithm for Finding Tree Decompositions of Small Width. WG 1999: 148-154
52EEBruce A. Reed: Mangoes and Blueberries. Combinatorica 19(2): 267-296 (1999)
51EEColin McDiarmid, Bruce A. Reed: Colouring proximity graphs in the plane. Discrete Mathematics 199(1-3): 123-137 (1999)
50EEMichael Molloy, Bruce A. Reed: Critical Subgraphs of a Random Graph. Electr. J. Comb. 6: (1999)
49EEFrédéric Maffray, Bruce A. Reed: A Description of Claw-Free Perfect Graphs. J. Comb. Theory, Ser. B 75(1): 134-156 (1999)
48EEBruce A. Reed: A Strengthening of Brooks' Theorem. J. Comb. Theory, Ser. B 76(2): 136-149 (1999)
47EEBruce A. Reed: Edge coloring nearly bipartite graphs. Oper. Res. Lett. 24(1-2): 11-14 (1999)
1998
46EEGruia Calinescu, Cristina G. Fernandes, Bruce A. Reed: Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. IPCO 1998: 137-152
45EEMichael Molloy, Bruce A. Reed: Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree. LATIN 1998: 216-225
44EEMichael Molloy, Bruce A. Reed: Further Algorithmic Aspects of the Local Lemma. STOC 1998: 524-529
43EEMichael Molloy, Bruce A. Reed: A Bound on the Total Chromatic Number. Combinatorica 18(2): 241-280 (1998)
42 Michael Molloy, Bruce A. Reed: The Size of the Giant Component of a Random Graph with a Given Degree Sequence. Combinatorics, Probability & Computing 7(3): 295-305 (1998)
41EEBruce A. Reed, Paul D. Seymour: Fractional Colouring and Hadwiger's Conjecture. J. Comb. Theory, Ser. B 74(2): 147-152 (1998)
40 Hugh Hind, Michael Molloy, Bruce A. Reed: Total Coloring With Delta + (log Delta) Colors. SIAM J. Comput. 28(3): 816-821 (1998)
1997
39 Hugh Hind, Michael Molloy, Bruce A. Reed: Colouring a Graph Frugally. Combinatorica 17(4): 469-482 (1997)
38EEHazel Everett, Sulamita Klein, Bruce A. Reed: An Algorithm for Finding Homogeneous Pairs. Discrete Applied Mathematics 72(3): 209-218 (1997)
37EEHazel Everett, Celina M. Herrera de Figueiredo, Cláudia Linhares Sales, Frédéric Maffray, Oscar Porto, Bruce A. Reed: Path parity and perfection. Discrete Mathematics 165-166: 233-252 (1997)
36EELjubomir Perkovic, Bruce A. Reed: Edge coloring regular graphs of high degree. Discrete Mathematics 165-166: 567-578 (1997)
35EEMichael S. O. Molloy, Bruce A. Reed: A Bound on the Strong Chromatic Index of a Graph, . J. Comb. Theory, Ser. B 69(2): 103-109 (1997)
1996
34 Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas: Packing Directed Circuits. Combinatorica 16(4): 535-554 (1996)
33 Bruce A. Reed, F. Bruce Shepherd: The Gallai-Younger Conjecture for Planar Graphs. Combinatorica 16(4): 555-566 (1996)
32 Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed: Perfect Matchings in Random r-regular, s-uniform Hypergraphs. Combinatorics, Probability & Computing 5: 1-14 (1996)
31 Bruce A. Reed: Paths, Stars and the Number Three. Combinatorics, Probability & Computing 5: 277-295 (1996)
30EES. E. Markossian, G. S. Gasparian, Bruce A. Reed: beta-Perfect Graphs. J. Comb. Theory, Ser. B 67(1): 1-11 (1996)
1995
29 Alan M. Frieze, Bruce A. Reed: Covering the Edges of a Random Graph by Cliques. Combinatorica 15(4): 489-497 (1995)
28 Colin McDiarmid, Bruce A. Reed: Almost Every Graph can be Covered by [fracDelta2] Linear Forests. Combinatorics, Probability & Computing 4: 257-268 (1995)
27EEBruce A. Reed: Rooted Routing in the Plane. Discrete Applied Mathematics 57(2-3): 213-227 (1995)
26EEMichael H. Albert, Alan M. Frieze, Bruce A. Reed: Multicoloured Hamilton Cycles. Electr. J. Comb. 2: (1995)
25 Michael Molloy, Bruce A. Reed: A Critical Point for Random Graphs with a Given Degree Sequence. Random Struct. Algorithms 6(2/3): 161-180 (1995)
24 Michael Molloy, Bruce A. Reed: The Dominating Number of Random Cubic Graph. Random Struct. Algorithms 7(3): 209-222 (1995)
23 Alan M. Frieze, Richard M. Karp, Bruce A. Reed: When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? SIAM J. Comput. 24(3): 484-493 (1995)
22 Luc Devroye, Bruce A. Reed: On the Variance of the Height of Random Binary Search Trees. SIAM J. Comput. 24(6): 1157-1162 (1995)
1994
21EEColin J. H. McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd: Induced Circuits in Planar Graphs. J. Comb. Theory, Ser. B 60(2): 169-176 (1994)
1993
20EEAlan M. Frieze, Bruce A. Reed: Polychromatic Hamilton cycles. Discrete Mathematics 118(1-3): 69-74 (1993)
19EEColin J. H. McDiarmid, Bruce A. Reed: On Total Colorings of Graphs. J. Comb. Theory, Ser. B 57(1): 122-130 (1993)
18EEGérard Cornuéjols, Bruce A. Reed: Complete Multi-partite Cutsets in Minimal Imperfect Graphs. J. Comb. Theory, Ser. B 59(2): 191-198 (1993)
1992
17 Alan M. Frieze, Richard M. Karp, Bruce A. Reed: When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? IPCO 1992: 453-461
16 Bruce A. Reed: Finding Approximate Separators and Computing Tree Width Quickly STOC 1992: 221-228
15EEColin McDiarmid, Bruce A. Reed, Alexander Schrijver, B. Shepherd: Non-Interfering Network Flows. SWAT 1992: 245-257
14 Noga Alon, Colin McDiarmid, Bruce A. Reed: Star arboricity. Combinatorica 12(4): 375-380 (1992)
13 Bruce A. Reed, Colin McDiarmid: The Strongly Connected Components of 1-in, 1-out. Combinatorics, Probability & Computing 1: 265-274 (1992)
1991
12 Bruce A. Reed: Counterexamples to a conjecture of Las Vergnas and Meyniel. Graph Structure Theory 1991: 157-160
11 Béla Bollobás, Bruce A. Reed, Andrew Thomason: An extremal function for the achromatic number. Graph Structure Theory 1991: 161-166
10 Bruce A. Reed, Neil Robertson, Alexander Schrijver, Paul D. Seymour: Finding dsjoint trees in planar graphs in linear time. Graph Structure Theory 1991: 295-302
9 Noga Alon, Colin McDiarmid, Bruce A. Reed: Acyclic Coloring of Graphs. Random Struct. Algorithms 2(3): 277-288 (1991)
1990
8 Bruce A. Reed: Perfection, Parity, Planarity, and Packing Paths. IPCO 1990: 407-419
7 Colin McDiarmid, Bruce A. Reed: Linear Arboricity of Random Regular Graphs. Random Struct. Algorithms 1(4): 443-447 (1990)
6 Alan M. Frieze, Colin McDiarmid, Bruce A. Reed: Greedy Matching on the Line. SIAM J. Comput. 19(4): 666-672 (1990)
1989
5EEChính T. Hoàng, Bruce A. Reed: P4-comparability graphs. Discrete Mathematics 74(1-2): 173-200 (1989)
4 Colin McDiarmid, Bruce A. Reed: Building Heaps Fast. J. Algorithms 10(3): 352-365 (1989)
1988
3EEAlan M. Frieze, B. Jackson, Colin J. H. McDiarmid, Bruce A. Reed: Edge-colouring random graphs. J. Comb. Theory, Ser. B 45(2): 135-149 (1988)
1987
2EEBruce A. Reed: A note on even pairs. Discrete Mathematics 65(3): 317-318 (1987)
1EEChính T. Hoàng, Bruce A. Reed: A note on short cycles in diagraphs. Discrete Mathematics 66(1-2): 103-107 (1987)

Coauthor Index

1Louigi Addario-Berry [89] [93] [103] [109] [114]
2Michael H. Albert [26]
3Robert E. L. Aldred [89]
4Noga Alon [9] [14]
5Omid Amini [112]
6David Avis [88]
7Claude Berge [60]
8Etienne Birmelé [102] [125]
9Béla Bollobás [11]
10John Adrian Bondy [102] [125]
11Gruia Calinescu [46] [76]
12Arkadev Chattopadhyay [105]
13Maria Chudnovsky [109]
14Colin Cooper [32] [73] [74]
15Derek G. Corneil [63]
16Gérard Cornuéjols [18]
17Ketan Dalal [89] [93] [103] [114]
18Simone Dantas [85]
19Matt DeVos [83]
20Luc Devroye [22]
21Guoli Ding [83]
22Hazel Everett [37] [38] [65]
23Babak Farzad [90]
24Cristina G. Fernandes [46] [76]
25Guillaume Fertin [69] [82]
26Celina M. Herrera de Figueiredo [37] [57] [62] [65] [85]
27Samuel Fiorini [92] [96] [98] [113]
28Nikolaos Fountoulakis [107]
29Alan M. Frieze [3] [6] [17] [20] [23] [26] [29] [32] [73] [74]
30G. S. Gasparian [30]
31Jim Geelen [124]
32Bert Gerards [124]
33Sylvain Gravier [85]
34Michel Habib [63]
35Nadia Hardy [92] [96] [98] [113]
36Frédéric Havet [100] [109] [118]
37Ryan B. Hayward (Ryan Hayward) [75]
38Jan van den Heuvel [100]
39Hugh Hind [39] [40]
40Chính T. Hoàng [1] [5] [80]
41Stefan Hougardy [75]
42B. Jackson [3]
43Richard M. Karp [17] [23]
44Ken-ichi Kawarabayashi [104] [110] [111] [119] [121] [123] [126] [127]
45Andrew D. King [99] [101] [108]
46Sulamita Klein [38] [57] [62] [65] [85]
47Yoshiharu Kohayakawa [57] [62]
48Jean-Marc Lanlignel [63]
49Orlando Lee [110] [123]
50Benjamin Lévêque [94] [122]
51Zhentao Li [95] [120]
52Martin Loebl [67] [79]
53Frédéric Maffray [37] [49] [64] [94] [106] [122]
54S. E. Markossian [30]
55Colin McDiarmid (Colin J. H. McDiarmid) [3] [4] [6] [7] [9] [13] [14] [15] [19] [21] [28] [51] [55] [66] [78] [97] [100] [103] [117]
56Conor Meagher [91] [116]
57Bojan Mohar [121]
58Michael Molloy (Michael S. O. Molloy) [24] [25] [32] [35] [39] [40] [42] [43] [44] [45] [50] [54] [59] [70] [90] [128]
59Jaroslav Nesetril (Jarik Nesetril) [67] [79]
60Bogdan Oporowski [83]
61Ljubomir Perkovic [36] [53] [58]
62Oscar Porto [37]
63André Raspaud [69] [82]
64Dieter Rautenbach [68] [71]
65Oliver Riordan [73]
66Neil Robertson [10] [34]
67Udi Rotics [63]
68Cláudia Linhares Sales [37] [64] [106]
69Daniel P. Sanders [83]
70Alexander Schrijver [10] [15] [21]
71Jean-Sébastien Sereni [118]
72Paul D. Seymour [10] [34] [41] [83] [84] [109] [124]
73B. Shepherd [15]
74F. Bruce Shepherd [21] [33]
75Caterina De Simone [88]
76Kaleigh Smith [81]
77Siang Wun Song (Siang W. Song) [86]
78Benny Sudakov [72] [87]
79Jayme Luiz Szwarcfiter [86]
80Robin Thomas [34] [56]
81Andrew Thomason [11] [103]
82Nicolas Trotignon [94] [122]
83Dirk L. Vertigan (Dirk Vertigan) [83]
84Adrian Vetta [81] [92] [96] [98] [99] [113] [124]
85Paul Wollan [110]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)