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

Neil Robertson

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
56EENeil Robertson, Xiaoya Zha, Yue Zhao: On the flexibility of toroidal embeddings. J. Comb. Theory, Ser. B 98(1): 43-61 (2008)
2006
55EENeil Robertson, Ian D. Reid: Estimating Gaze Direction from Low-Resolution Faces in Video. ECCV (2) 2006: 402-415
54EENeil Robertson, Ian Reid: A general method for human activity recognition in video. Computer Vision and Image Understanding 104(2-3): 232-248 (2006)
53EEJames F. Geelen, Bert Gerards, Neil Robertson, Geoff Whittle: Obstructions to branch-decomposition of matroids. J. Comb. Theory, Ser. B 96(4): 560-570 (2006)
52EEGordon Robertson, Misha Bilenky, K. 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, B. 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)
2005
51EEAsim 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
50EENeil Robertson, Ian D. Reid: Behaviour Understanding in Video: A Combined Method. ICCV 2005: 808-815
49EEEmanuel 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)
48EEYared Nigussie, Neil Robertson: On structural descriptions of lower ideals of trees. Journal of Graph Theory 50(3): 220-233 (2005)
2004
47EENeil Robertson, Paul D. Seymour: Graph Minors. XIX. Well-quasi-ordering on a surface. J. Comb. Theory, Ser. B 90(2): 325-385 (2004)
46EENeil Robertson, Paul D. Seymour: Graph Minors. XX. Wagner's conjecture. J. Comb. Theory, Ser. B 92(2): 325-357 (2004)
2003
45EEJames 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)
44EENeil Robertson, Paul D. Seymour: Graph Minors. XVI. Excluding a non-planar graph. J. Comb. Theory, Ser. B 89(1): 43-76 (2003)
43EENeil Robertson, Paul D. Seymour: Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering. J. Comb. Theory, Ser. B 89(1): 77-108 (2003)
2001
42EENeil Robertson, Xiaoya Zha: Closed 2-cell embeddings of graphs with no V8-minors. Discrete Mathematics 230(1-3): 207-213 (2001)
41EEArthur M. Hobbs, Hong-Jian Lai, Neil Robertson: Paul Catlin 1948-1995. Discrete Mathematics 230(1-3): 3-12 (2001)
40EEThor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas: Directed Tree-Width. J. Comb. Theory, Ser. B 82(1): 138-154 (2001)
39EEBojan Mohar, Neil Robertson: Flexibility of Polyhedral Embeddings of Graphs in Surfaces. J. Comb. Theory, Ser. B 83(1): 38-57 (2001)
1999
38EENeil Robertson, Paul D. Seymour: Graph Minors: XVII. Taming a Vortex. J. Comb. Theory, Ser. B 77(1): 162-210 (1999)
1998
37EEPanos 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)
1997
36EEWilliam McCuaig, Neil Robertson, Paul D. Seymour, Robin Thomas: Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract). STOC 1997: 402-405
35EENeil Robertson, Paul D. Seymour, Robin Thomas: Tutte's Edge-Colouring Conjecture. J. Comb. Theory, Ser. B 70(1): 166-183 (1997)
34EENeil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas: The Four-Colour Theorem. J. Comb. Theory, Ser. B 70(1): 2-44 (1997)
1996
33EENeil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas: Efficiently Four-Coloring Planar Graphs. STOC 1996: 571-575
32 Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas: Packing Directed Circuits. Combinatorica 16(4): 535-554 (1996)
31EEBojan Mohar, Neil Robertson, Richard P. Vitray: Planar graphs on the projective plane. Discrete Mathematics 149(1-3): 141-157 (1996)
30EENeil Robertson, Paul D. Seymour: Graph Minors: XV. Giant Steps. J. Comb. Theory, Ser. B 68(1): 112-148 (1996)
29EEBojan Mohar, Neil Robertson: Planar Graphs on Nonplanar Surfaces. J. Comb. Theory, Ser. B 68(1): 87-111 (1996)
28EEBojan Mohar, Neil Robertson: Disjoint Essential Cycles. J. Comb. Theory, Ser. B 68(2): 324-349 (1996)
1995
27EENeil Robertson, Paul D. Seymour: Graph Minors .XIII. The Disjoint Paths Problem. J. Comb. Theory, Ser. B 63(1): 65-110 (1995)
26EENeil Robertson, Paul D. Seymour, Robin Thomas: Kuratowski Chains. J. Comb. Theory, Ser. B 64(2): 127-154 (1995)
25EENeil Robertson, Paul D. Seymour, Robin Thomas: Petersen Family Minors. J. Comb. Theory, Ser. B 64(2): 155-184 (1995)
24EENeil Robertson, Paul D. Seymour, Robin Thomas: Sachs' Linkless Embedding Conjecture. J. Comb. Theory, Ser. B 64(2): 185-227 (1995)
23EENeil Robertson, Paul D. Seymour: Graph Minors .XII. Distance on a Surface. J. Comb. Theory, Ser. B 64(2): 240-272 (1995)
22EENeil Robertson, Paul D. Seymour: Graph Miners .XIV. Extending an Embedding. J. Comb. Theory, Ser. B 65(1): 23-50 (1995)
1994
21EENeil Robertson, Paul D. Seymour: Graph Minors. XI. Circuits on a Surface. J. Comb. Theory, Ser. B 60(1): 72-106 (1994)
20EENeil Robertson, Paul D. Seymour, Robin Thomas: Quickly Excluding a Planar Graph. J. Comb. Theory, Ser. B 62(2): 323-348 (1994)
1993
19 Neil Robertson, Paul D. Seymour: 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 American Mathematical Society 1993
18 Neil Robertson, Paul D. Seymour, Robin Thomas: Hadwiger's conjecture for K 6-free graphs. Combinatorica 13(3): 279-361 (1993)
1991
17 Neil Robertson, Paul D. Seymour, Robin Thomas: A survey of linkless embeddings. Graph Structure Theory 1991: 125-136
16 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
15 Neil Robertson, Paul D. Seymour, Robin Thomas: Structural descriptions of lower ideals of trees. Graph Structure Theory 1991: 525-538
14 Neil Robertson, Paul D. Seymour: Excluding a graph with one crossing. Graph Structure Theory 1991: 669-676
13EENeil Robertson, Paul D. Seymour, Robin Thomas: Excluding infinite minors. Discrete Mathematics 95(1-3): 303-319 (1991)
12EENeil Robertson, Paul D. Seymour: Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory, Ser. B 52(2): 153-190 (1991)
11EEDaniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas: Quickly excluding a forest. J. Comb. Theory, Ser. B 52(2): 274-283 (1991)
1990
10EENeil Robertson, Paul D. Seymour: Graph minors. IV. Tree-width and well-quasi-ordering. J. Comb. Theory, Ser. B 48(2): 227-254 (1990)
9EENeil Robertson, Paul D. Seymour: Graph minors. VIII. A kuratowski theorem for general surfaces. J. Comb. Theory, Ser. B 48(2): 255-288 (1990)
8EENeil Robertson, Paul D. Seymour: Graph minors. IX. Disjoint crossed paths. J. Comb. Theory, Ser. B 49(1): 40-77 (1990)
1988
7EENeil Robertson, Paul D. Seymour: Graph minors. VII. Disjoint paths on a surface. J. Comb. Theory, Ser. B 45(2): 212-254 (1988)
1986
6 Neil Robertson, Paul D. Seymour: Graph Minors. II. Algorithmic Aspects of Tree-Width. J. Algorithms 7(3): 309-322 (1986)
5EENeil Robertson, Paul D. Seymour: Graph minors. VI. Disjoint paths across a disc. J. Comb. Theory, Ser. B 41(1): 115-138 (1986)
4EENeil Robertson, Paul D. Seymour: Graph minors. V. Excluding a planar graph. J. Comb. Theory, Ser. B 41(1): 92-114 (1986)
1984
3EENeil Robertson, Paul D. Seymour: Graph minors. III. Planar tree-width. J. Comb. Theory, Ser. B 36(1): 49-64 (1984)
1983
2EENeil Robertson, Paul D. Seymour: Graph minors. I. Excluding a forest. J. Comb. Theory, Ser. B 35(1): 39-61 (1983)
1980
1EERam 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)

Coauthor Index

1Panos C. Andricacos [37]
2Tamara Astakhova [51] [52]
3Daniel Bienstock [11]
4Misha Bilenky [51] [52]
5Christian Bonhôte [49]
6M. Chuang [52]
7Emanuel I. Cooper [49]
8M. Dagpinar [52]
9C. Fjell [52]
10James F. Geelen [45] [53]
11A. M. H. Gerards [45]
12Bert Gerards [53]
13Obi L. Griffith [51] [52]
14Ram Prakash Gupta [1]
15H. Hao [52]
16Maik Hassel [51] [52]
17An He [52]
18Jürgen Heidmann [49]
19Arthur M. Hobbs [41]
20Yimin Hsu [49]
21Thor Johnson [40]
22Steven J. M. Jones [51] [52]
23Jeff Kahn [1]
24Philippe Kern [49]
25Hong-Jian Lai [41]
26John W. Lam [49]
27B. Li [52]
28Yvonne Y. Li [52]
29K. Lin [52]
30Keven Lin [51]
31William McCuaig [36]
32Bojan Mohar [28] [29] [31] [39]
33Stephen Montgomery [51] [52]
34Yared Nigussie [48]
35Mehrdad Oveisi [51]
36W. Pan [52]
37Y. Pan [52]
38Erin Pleasance [51] [52]
39Murali Ramasubramanian [49]
40Bruce A. Reed [16] [32]
41Ian Reid [54]
42Ian D. Reid [50] [55]
43Gordon Robertson [51] [52]
44Lubomyr T. Romankiw [49]
45Jörg Sander [52]
46Daniel P. Sanders [33] [34]
47Alexander Schrijver [16]
48Paul D. Seymour [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [30] [32] [33] [34] [35] [36] [38] [40] [43] [44] [46] [47]
49Asim S. Siddiqui [51] [52]
50Monica C. Sleumer [51] [52]
51Kevin Teague [51] [52]
52Robin Thomas [11] [13] [15] [17] [18] [20] [24] [25] [26] [32] [33] [34] [35] [36] [40]
53Richard Varhol [51] [52]
54Richard P. Vitray [31]
55Geoff Whittle (Geoffrey P. Whittle) [45] [53]
56Hong Xu [49]
57W. Yuen [52]
58Xiaoya Zha [42] [56]
59Maggie Zhang [51]
60X. Zhang [52]
61Yue Zhao [56]
62Jianjun Zhou [52]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)