| Distributed Matrix Tiling Using A Hypergraph Labeling Formulation. | 0 | 0.34 | 2022 |
| Ranking tournaments with no errors I: Structural description | 0 | 0.34 | 2020 |
| Ranking tournaments with no errors II: Minimax relation | 0 | 0.34 | 2020 |
| A chain theorem for 4-connected graphs. | 0 | 0.34 | 2019 |
| On box-perfect graphs. | 0 | 0.34 | 2018 |
| Excluding a large theta graph. | 0 | 0.34 | 2018 |
| On Almost-Planar Graphs. | 0 | 0.34 | 2018 |
| When Is the Matching Polytope Box-Totally Dual Integral? | 2 | 0.39 | 2018 |
| Minimal k-Connected Non-Hamiltonian Graphs. | 0 | 0.34 | 2018 |
| Hall‐Type Results for 3‐Connected Projective Graphs | 0 | 0.34 | 2016 |
| Graphs with no $\bar P_7$-Minor. | 0 | 0.34 | 2016 |
| Excluded-Minor Characterization of Apex-Outerplanar Graphs. | 1 | 0.37 | 2016 |
| Large Wk‐ or K3,t‐Minors in 3‐Connected Graphs | 1 | 0.38 | 2016 |
| Unavoidable Connected Matroids Retaining a Specified Minor. | 0 | 0.34 | 2016 |
| Excluding a small minor | 4 | 0.75 | 2013 |
| On 3-Connected Graphs of Path-Width at Most Three. | 0 | 0.34 | 2013 |
| A Characterization of Graphs with No Octahedron Minor. | 4 | 0.52 | 2013 |
| Bonds with parity constraints | 0 | 0.34 | 2012 |
| A chain theorem for 3 +-connected graphs | 1 | 0.41 | 2012 |
| The Maximum-Weight Stable Matching Problem: Duality and Efficiency. | 2 | 0.43 | 2012 |
| Bandwidth of trees of diameter at most 4. | 0 | 0.34 | 2012 |
| Large non-planar graphs and an application to crossing-critical graphs | 3 | 0.50 | 2011 |
| Splitter Theorems for 4-Regular Graphs | 1 | 0.38 | 2010 |
| Vertex-bipartition method for colouring minor-closed classes of graphs | 1 | 0.38 | 2010 |
| Unavoidable topological minors of infinite graphs | 0 | 0.34 | 2010 |
| Transforms of pseudo-Boolean random variables | 4 | 0.51 | 2010 |
| Structural Properties and Hamiltonicity of Neighborhood Graphs | 2 | 0.43 | 2010 |
| Unavoidable parallel minors of 4-connected graphs | 3 | 0.50 | 2009 |
| On canonical antichains | 4 | 0.43 | 2009 |
| Generating 5-regular planar graphs | 1 | 0.38 | 2009 |
| The box-TDI system associated with 2-edge connected spanning subgraphs | 2 | 0.39 | 2009 |
| Packing circuits in matroids | 4 | 0.44 | 2009 |
| The edge version of Hadwiger's conjecture | 0 | 0.34 | 2009 |
| Learning Terrorist Profiles by Optimization with Two Objectives | 0 | 0.34 | 2009 |
| The complexity of recognizing linear systems with certain integrality properties | 17 | 1.30 | 2008 |
| Local soft belief updating for relational classification | 2 | 0.44 | 2008 |
| Formulas for approximating pseudo-Boolean random variables | 3 | 0.53 | 2008 |
| A Characterization of Box-Mengerian Matroid Ports | 3 | 0.42 | 2008 |
| Fuzzy clustering and iterative relational classification for terrorist profiling | 3 | 0.44 | 2008 |
| Graph-theoretic method for merging security system specifications | 7 | 0.49 | 2007 |
| Comparison of Greedy Strategies for Learning Markov Networks of Treewidth k | 0 | 0.34 | 2007 |
| Asymptotic Behavior Of Linear Approximations Of Pseudo-Boolean Functions | 0 | 0.34 | 2007 |
| A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest Converters | 0 | 0.34 | 2007 |
| Splitter Theorems for Cubic Graphs | 2 | 0.44 | 2006 |
| New bounds for randomized busing | 0 | 0.34 | 2005 |
| Efficient learning of pseudo-boolean functions from limited training data | 3 | 0.46 | 2005 |
| Approximating pseudo-Boolean functions on non-uniform domains | 2 | 0.54 | 2005 |
| Unavoidable doubly connected large graphs | 2 | 0.44 | 2004 |
| The best expert versus the smartest algorithm | 1 | 0.36 | 2004 |
| Excluding any graph as a minor allows a low tree-width 2-coloring | 53 | 2.67 | 2004 |
