|
Search the dblp DataBase
Neil Robertson:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Neil Robertson, Paul D. Seymour
Graph Minors. II. Algorithmic Aspects of Tree-Width. [Citation Graph (2, 0)][DBLP] J. Algorithms, 1986, v:7, n:3, pp:309-322 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] CSB Workshops, 2005, pp:203-206 [Conf]
- Neil Robertson, Ian Reid
Estimating Gaze Direction from Low-Resolution Faces in Video. [Citation Graph (0, 0)][DBLP] ECCV (2), 2006, pp:402-415 [Conf]
- Bruce A. Reed, Neil Robertson, Alexander Schrijver, Paul D. Seymour
Finding dsjoint trees in planar graphs in linear time. [Citation Graph (0, 0)][DBLP] Graph Structure Theory, 1991, pp:295-302 [Conf]
- Neil Robertson, Paul D. Seymour
Excluding a graph with one crossing. [Citation Graph (0, 0)][DBLP] Graph Structure Theory, 1991, pp:669-676 [Conf]
- Neil Robertson, Paul D. Seymour, Robin Thomas
A survey of linkless embeddings. [Citation Graph (0, 0)][DBLP] Graph Structure Theory, 1991, pp:125-136 [Conf]
- Neil Robertson, Paul D. Seymour, Robin Thomas
Structural descriptions of lower ideals of trees. [Citation Graph (0, 0)][DBLP] Graph Structure Theory, 1991, pp:525-538 [Conf]
- Neil Robertson, Ian Reid
Behaviour Understanding in Video: A Combined Method. [Citation Graph (0, 0)][DBLP] ICCV, 2005, pp:808-815 [Conf]
- William McCuaig, Neil Robertson, Paul D. Seymour, Robin Thomas
Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract). [Citation Graph (0, 0)][DBLP] STOC, 1997, pp:402-405 [Conf]
- Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
Efficiently Four-Coloring Planar Graphs. [Citation Graph (0, 0)][DBLP] STOC, 1996, pp:571-575 [Conf]
- Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas
Packing Directed Circuits. [Citation Graph (0, 0)][DBLP] Combinatorica, 1996, v:16, n:4, pp:535-554 [Journal]
- Neil Robertson, Paul D. Seymour, Robin Thomas
Hadwiger's conjecture for K 6-free graphs. [Citation Graph (0, 0)][DBLP] Combinatorica, 1993, v:13, n:3, pp:279-361 [Journal]
- Arthur M. Hobbs, Hong-Jian Lai, Neil Robertson
Paul Catlin 1948-1995. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:230, n:1-3, pp:3-12 [Journal]
- Neil Robertson, Xiaoya Zha
Closed 2-cell embeddings of graphs with no V8-minors. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:230, n:1-3, pp:207-213 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] IBM Journal of Research and Development, 2005, v:49, n:1, pp:103-126 [Journal]
- Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas
Quickly excluding a forest. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1991, v:52, n:2, pp:274-283 [Journal]
- James F. Geelen, A. M. H. Gerards, Neil Robertson, Geoff Whittle
On the excluded minors for the matroids of branch-width k. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:261-265 [Journal]
- Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas
Directed Tree-Width. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2001, v:82, n:1, pp:138-154 [Journal]
- Bojan Mohar, Neil Robertson
Flexibility of Polyhedral Embeddings of Graphs in Surfaces. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2001, v:83, n:1, pp:38-57 [Journal]
- Bojan Mohar, Neil Robertson
Planar Graphs on Nonplanar Surfaces. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1996, v:68, n:1, pp:87-111 [Journal]
- Bojan Mohar, Neil Robertson
Disjoint Essential Cycles. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1996, v:68, n:2, pp:324-349 [Journal]
- Neil Robertson, Paul D. Seymour
Graph Minors. XVI. Excluding a non-planar graph. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2003, v:89, n:1, pp:43-76 [Journal]
- Neil Robertson, Paul D. Seymour
Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2003, v:89, n:1, pp:77-108 [Journal]
- Neil Robertson, Paul D. Seymour
Graph Minors. XX. Wagner's conjecture. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2004, v:92, n:2, pp:325-357 [Journal]
- Neil Robertson, Paul D. Seymour
Graph Minors. XIX. Well-quasi-ordering on a surface. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2004, v:90, n:2, pp:325-385 [Journal]
- Neil Robertson, Paul D. Seymour
Graph minors. I. Excluding a forest. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1983, v:35, n:1, pp:39-61 [Journal]
- Neil Robertson, Paul D. Seymour
Graph minors. III. Planar tree-width. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1984, v:36, n:1, pp:49-64 [Journal]
- Neil Robertson, Paul D. Seymour
Graph minors. V. Excluding a planar graph. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1986, v:41, n:1, pp:92-114 [Journal]
- Neil Robertson, Paul D. Seymour
Graph minors. VI. Disjoint paths across a disc. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1986, v:41, n:1, pp:115-138 [Journal]
- Neil Robertson, Paul D. Seymour
Graph minors. VII. Disjoint paths on a surface. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1988, v:45, n:2, pp:212-254 [Journal]
- Neil Robertson, Paul D. Seymour
Graph minors. IX. Disjoint crossed paths. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1990, v:49, n:1, pp:40-77 [Journal]
- Neil Robertson, Paul D. Seymour
Graph minors. IV. Tree-width and well-quasi-ordering. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1990, v:48, n:2, pp:227-254 [Journal]
- Neil Robertson, Paul D. Seymour
Graph minors. VIII. A kuratowski theorem for general surfaces. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1990, v:48, n:2, pp:255-288 [Journal]
- Neil Robertson, Paul D. Seymour
Graph minors. X. Obstructions to tree-decomposition. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1991, v:52, n:2, pp:153-190 [Journal]
- Neil Robertson, Paul D. Seymour
Graph Minors. XI. Circuits on a Surface. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1994, v:60, n:1, pp:72-106 [Journal]
- Neil Robertson, Paul D. Seymour
Graph Miners .XIV. Extending an Embedding. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1995, v:65, n:1, pp:23-50 [Journal]
- Neil Robertson, Paul D. Seymour
Graph Minors .XII. Distance on a Surface. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1995, v:64, n:2, pp:240-272 [Journal]
- Neil Robertson, Paul D. Seymour
Graph Minors .XIII. The Disjoint Paths Problem. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1995, v:63, n:1, pp:65-110 [Journal]
- Neil Robertson, Paul D. Seymour
Graph Minors: XV. Giant Steps. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1996, v:68, n:1, pp:112-148 [Journal]
- Neil Robertson, Paul D. Seymour
Graph Minors: XVII. Taming a Vortex. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1999, v:77, n:1, pp:162-210 [Journal]
- Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
The Four-Colour Theorem. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1997, v:70, n:1, pp:2-44 [Journal]
- Neil Robertson, Paul D. Seymour, Robin Thomas
Quickly Excluding a Planar Graph. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1994, v:62, n:2, pp:323-348 [Journal]
- Neil Robertson, Paul D. Seymour, Robin Thomas
Kuratowski Chains. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1995, v:64, n:2, pp:127-154 [Journal]
- Neil Robertson, Paul D. Seymour, Robin Thomas
Petersen Family Minors. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1995, v:64, n:2, pp:155-184 [Journal]
- Neil Robertson, Paul D. Seymour, Robin Thomas
Sachs' Linkless Embedding Conjecture. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1995, v:64, n:2, pp:185-227 [Journal]
- Neil Robertson, Paul D. Seymour, Robin Thomas
Tutte's Edge-Colouring Conjecture. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1997, v:70, n:1, pp:166-183 [Journal]
- James F. Geelen, Bert Gerards, Neil Robertson, Geoff Whittle
Obstructions to branch-decomposition of matroids. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:560-570 [Journal]
- Gordon Robertson, Misha Bilenky, K. Lin, A. 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. [Citation Graph (0, 0)][DBLP] Nucleic Acids Research, 2006, v:34, n:Database-Issue, pp:68-73 [Journal]
- Yared Nigussie, Neil Robertson
On structural descriptions of lower ideals of trees. [Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2005, v:50, n:3, pp:220-233 [Journal]
- Ram Prakash Gupta, Jeff Kahn, Neil Robertson
On the maximum number of diagonals of a circuit in a graph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1980, v:32, n:1, pp:37-43 [Journal]
- Neil Robertson, Paul D. Seymour, Robin Thomas
Excluding infinite minors. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:95, n:1-3, pp:303-319 [Journal]
- Bojan Mohar, Neil Robertson, Richard P. Vitray
Planar graphs on the projective plane. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:149, n:1-3, pp:141-157 [Journal]
A general method for human activity recognition in video. [Citation Graph (, )][DBLP]
Search in 0.007secs, Finished in 0.424secs
|