| Temporal Meta-Adaptor for Video Object Detection. | 0 | 0.34 | 2021 |
| SC-RANK - Improving Convolutional Image Captioning with Self-Critical Learning and Ranking Metric-based Reward. | 0 | 0.34 | 2019 |
| Flexibility of projective-planar embeddings. | 0 | 0.34 | 2017 |
| The structure of graphs not topologically containing the Wagner graph. | 1 | 0.36 | 2016 |
| Excluding A Grid Minor In Planar Digraphs | 0 | 0.34 | 2015 |
| Discharging cartwheels. | 0 | 0.34 | 2014 |
| Reducibility in the Four-Color Theorem. | 0 | 0.34 | 2014 |
| K4-free graphs with no odd holes | 8 | 0.77 | 2010 |
| On structural descriptions of lower ideals of trees | 4 | 0.67 | 2005 |
| Graph Minors. XIX. Well-quasi-ordering on a surface | 20 | 2.80 | 2004 |
| Progress on perfect graphs | 16 | 2.19 | 2003 |
| Directed tree-width | 86 | 3.70 | 2001 |
| Permanents, Pfaffian orientations, and even directed circuits (extended abstract) | 12 | 1.14 | 1997 |
| Graph minors XV: giant steps | 10 | 1.57 | 1996 |
| Planar graphs on the projective plane | 3 | 0.59 | 1996 |
| Sachs' linkless embedding conjecture | 37 | 4.77 | 1995 |
| Kuratowski chains | 8 | 1.08 | 1995 |
| Hadwiger's conjecture for K 6-free graphs | 99 | 6.09 | 1993 |
| 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 | 46 | 29.92 | 1993 |
| A survey of linkless embeddings | 9 | 1.12 | 1991 |
| Finding dsjoint trees in planar graphs in linear time | 14 | 0.83 | 1991 |
| Excluding a graph with one crossing | 19 | 1.04 | 1991 |
| On the orientable genus of graphs embedded in the Klein bottle | 9 | 1.42 | 1991 |
| Structural descriptions of lower ideals of trees | 3 | 0.58 | 1991 |
| Disjoint Essential Circuits in Toroidal Maps. | 1 | 0.51 | 1991 |
| Quickly excluding a forest | 49 | 8.29 | 1991 |
| Graph minors. VII. Disjoint paths on a surface | 70 | 7.03 | 1988 |
| Path traversability in planar graphs | 0 | 0.34 | 1974 |
