Neil Robertson

Neil Robertson, Paul D. Seymour: Graph Minors. XXII. Irrelevant vertices in linkage problems. J. Comb. Theory, Ser. B 102(2): 530-563 (2012)

Christian Wögerer, Harald Bauer, Martijn N. Rooker, Gerhard Ebenhofer, Alberto Rovetta, Neil Robertson, Andreas Pichler: LOCOBOT - Low Cost Toolkit for Building Robot Co-workers in Assembly Lines. ICIRA (2) 2012: 449-459

Donald Nelson, Michael D. Plummer, Neil Robertson, Xiaoya Zha: On a Conjecture Concerning the Petersen Graph. Electr. J. Comb. 18(1) (2011)

Neil Robertson, Paul D. Seymour: Graph minors XXIII. Nash-Williams' immersion conjecture. J. Comb. Theory, Ser. B 100(2): 181-205 (2010)

Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas: K₄-free graphs with no odd holes. J. Comb. Theory, Ser. B 100(3): 313-331 (2010)

Neil Robertson, Zi-Xia Song: Hadwiger number and chromatic number for near regular degree sequences. Journal of Graph Theory 64(3): 175-183 (2010)

Neil Robertson, Paul D. Seymour: Graph minors. XXI. Graphs with unique linkages. J. Comb. Theory, Ser. B 99(3): 583-616 (2009)

Neil Robertson, Xiaoya Zha, Yue Zhao: On the flexibility of toroidal embeddings. J. Comb. Theory, Ser. B 98(1): 43-61 (2008)

James F. Geelen, Bert Gerards, Neil Robertson, Geoff Whittle: Obstructions to branch-decomposition of matroids. J. Comb. Theory, Ser. B 96(4): 560-570 (2006)

Gordon Robertson, Misha Bilenky, Keven Lin, An He, W. Yuen, M. Dagpinar, Richard Varhol, Kevin Teague, Obi L. Griffith, X. Zhang, Y. Pan, Maik Hassel, Monica C. Sleumer, W. Pan, Erin Pleasance, M. Chuang, H. Hao, Yvonne Y. Li, Neil Robertson, C. Fjell, Bernard Li, Stephen Montgomery, Tamara Astakhova, Jianjun Zhou, Jörg Sander, Asim S. Siddiqui, Steven J. M. Jones: cisRED: a database system for genome-scale computational discovery of regulatory elements. Nucleic Acids Research 34(Database-Issue): 68-73 (2006)

Emanuel I. Cooper, Christian Bonhôte, Jürgen Heidmann, Yimin Hsu, Philippe Kern, John W. Lam, Murali Ramasubramanian, Neil Robertson, Lubomyr T. Romankiw, Hong Xu: Recent developments in high-moment electroplated materials for recording heads. IBM Journal of Research and Development 49(1): 103-126 (2005)

Yared Nigussie, Neil Robertson: On structural descriptions of lower ideals of trees. Journal of Graph Theory 50(3): 220-233 (2005)

Asim S. Siddiqui, Gordon Robertson, Misha Bilenky, Tamara Astakhova, Obi L. Griffith, Maik Hassel, Keven Lin, Stephen Montgomery, Mehrdad Oveisi, Erin Pleasance, Neil Robertson, Monica C. Sleumer, Kevin Teague, Richard Varhol, Maggie Zhang, Steven J. M. Jones: cis-Regulatory Element Prediction in Mammalian Genomes. CSB Workshops 2005: 203-206

Neil Robertson, Paul D. Seymour: Graph Minors. XIX. Well-quasi-ordering on a surface. J. Comb. Theory, Ser. B 90(2): 325-385 (2004)

Neil Robertson, Paul D. Seymour: Graph Minors. XX. Wagner's conjecture. J. Comb. Theory, Ser. B 92(2): 325-357 (2004)

James F. Geelen, A. M. H. Gerards, Neil Robertson, Geoff Whittle: On the excluded minors for the matroids of branch-width k. J. Comb. Theory, Ser. B 88(2): 261-265 (2003)

Neil Robertson, Paul D. Seymour: Graph Minors. XVI. Excluding a non-planar graph. J. Comb. Theory, Ser. B 89(1): 43-76 (2003)

Neil Robertson, Paul D. Seymour: Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering. J. Comb. Theory, Ser. B 89(1): 77-108 (2003)

Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas: Progress on perfect graphs. Math. Program. 97(1-2): 405-422 (2003)

Arthur M. Hobbs, Hong-Jian Lai, Neil Robertson: Paul Catlin 1948-1995. Discrete Mathematics 230(1-3): 3-12 (2001)

Neil Robertson, Xiaoya Zha: Closed 2-cell embeddings of graphs with no V₈-minors. Discrete Mathematics 230(1-3): 207-213 (2001)

Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas: Directed Tree-Width. J. Comb. Theory, Ser. B 82(1): 138-154 (2001)

Bojan Mohar, Neil Robertson: Flexibility of Polyhedral Embeddings of Graphs in Surfaces. J. Comb. Theory, Ser. B 83(1): 38-57 (2001)

Neil Robertson, Paul D. Seymour: Graph Minors: XVII. Taming a Vortex. J. Comb. Theory, Ser. B 77(1): 162-210 (1999)

Panos C. Andricacos, Neil Robertson: Future directions in electroplated materials for thin-film recording heads. IBM Journal of Research and Development 42(5): 671-680 (1998)

Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas: The Four-Colour Theorem. J. Comb. Theory, Ser. B 70(1): 2-44 (1997)

Neil Robertson, Paul D. Seymour, Robin Thomas: Tutte's Edge-Colouring Conjecture. J. Comb. Theory, Ser. B 70(1): 166-183 (1997)

William McCuaig, Neil Robertson, Paul D. Seymour, Robin Thomas: Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract). STOC 1997: 402-405

Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas: Packing Directed Circuits. Combinatorica 16(4): 535-554 (1996)

Bojan Mohar, Neil Robertson, Richard P. Vitray: Planar graphs on the projective plane. Discrete Mathematics 149(1-3): 141-157 (1996)

Bojan Mohar, Neil Robertson: Planar Graphs on Nonplanar Surfaces. J. Comb. Theory, Ser. B 68(1): 87-111 (1996)

Neil Robertson, Paul D. Seymour: Graph Minors: XV. Giant Steps. J. Comb. Theory, Ser. B 68(1): 112-148 (1996)

Bojan Mohar, Neil Robertson: Disjoint Essential Cycles. J. Comb. Theory, Ser. B 68(2): 324-349 (1996)

Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas: Efficiently Four-Coloring Planar Graphs. STOC 1996: 571-575

Neil Robertson, Paul D. Seymour: Graph Minors .XIII. The Disjoint Paths Problem. J. Comb. Theory, Ser. B 63(1): 65-110 (1995)

Neil Robertson, Paul D. Seymour, Robin Thomas: Kuratowski Chains. J. Comb. Theory, Ser. B 64(2): 127-154 (1995)

Neil Robertson, Paul D. Seymour, Robin Thomas: Petersen Family Minors. J. Comb. Theory, Ser. B 64(2): 155-184 (1995)

Neil Robertson, Paul D. Seymour, Robin Thomas: Sachs' Linkless Embedding Conjecture. J. Comb. Theory, Ser. B 64(2): 185-227 (1995)

Neil Robertson, Paul D. Seymour: Graph Minors .XII. Distance on a Surface. J. Comb. Theory, Ser. B 64(2): 240-272 (1995)

Neil Robertson, Paul D. Seymour: Graph Miners .XIV. Extending an Embedding. J. Comb. Theory, Ser. B 65(1): 23-50 (1995)

Neil Robertson, Paul D. Seymour: Graph Minors. XI. Circuits on a Surface. J. Comb. Theory, Ser. B 60(1): 72-106 (1994)

Neil Robertson, Paul D. Seymour, Robin Thomas: Quickly Excluding a Planar Graph. J. Comb. Theory, Ser. B 62(2): 323-348 (1994)

Neil Robertson, Paul D. Seymour, Robin Thomas: Hadwiger's conjecture for K ₆-free graphs. Combinatorica 13(3): 279-361 (1993)

Neil Robertson, Paul D. Seymour (Eds.): Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors held June 22 to July 5, 1991, at the University of Washington, Seattle. Contemporary Mathematics 147, American Mathematical Society 1993, isbn 0-8218-5160-8

Neil Robertson, Paul D. Seymour, Robin Thomas: Excluding infinite minors. Discrete Mathematics 95(1-3): 303-319 (1991)

Neil Robertson, Paul D. Seymour: Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory, Ser. B 52(2): 153-190 (1991)

Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas: Quickly excluding a forest. J. Comb. Theory, Ser. B 52(2): 274-283 (1991)

Neil Robertson, Robin Thomas: On the orientable genus of graphs embedded in the klein bottle. Journal of Graph Theory 15(4): 407-419 (1991)

Neil Robertson, Paul D. Seymour, Robin Thomas: A survey of linkless embeddings. Graph Structure Theory 1991: 125-136

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

Neil Robertson, Paul D. Seymour, Robin Thomas: Structural descriptions of lower ideals of trees. Graph Structure Theory 1991: 525-538

Neil Robertson, Paul D. Seymour: Excluding a graph with one crossing. Graph Structure Theory 1991: 669-676

Neil Robertson, Paul D. Seymour: Graph minors. IV. Tree-width and well-quasi-ordering. J. Comb. Theory, Ser. B 48(2): 227-254 (1990)

Neil Robertson, Paul D. Seymour: Graph minors. VIII. A kuratowski theorem for general surfaces. J. Comb. Theory, Ser. B 48(2): 255-288 (1990)

Neil Robertson, Paul D. Seymour: Graph minors. IX. Disjoint crossed paths. J. Comb. Theory, Ser. B 49(1): 40-77 (1990)

Neil Robertson, Paul D. Seymour: Graph minors. VII. Disjoint paths on a surface. J. Comb. Theory, Ser. B 45(2): 212-254 (1988)

Neil Robertson, Paul D. Seymour: Graph Minors. II. Algorithmic Aspects of Tree-Width. J. Algorithms 7(3): 309-322 (1986)

Neil Robertson, Paul D. Seymour: Graph minors. V. Excluding a planar graph. J. Comb. Theory, Ser. B 41(1): 92-114 (1986)

Neil Robertson, Paul D. Seymour: Graph minors. VI. Disjoint paths across a disc. J. Comb. Theory, Ser. B 41(1): 115-138 (1986)

Neil Robertson, Paul D. Seymour: Graph minors. III. Planar tree-width. J. Comb. Theory, Ser. B 36(1): 49-64 (1984)

Neil Robertson, Paul D. Seymour: Graph minors. I. Excluding a forest. J. Comb. Theory, Ser. B 35(1): 39-61 (1983)

Ram Prakash Gupta, Jeff Kahn, Neil Robertson: On the maximum number of diagonals of a circuit in a graph. Discrete Mathematics 32(1): 37-43 (1980)