| The Precise Complexity of Finding Rainbow Even Matchings. | 0 | 0.34 | 2019 |
| Binary linear codes, dimers and hypermatrices | 0 | 0.34 | 2017 |
| Cubic Bridgeless Graphs and Braces. | 0 | 0.34 | 2016 |
| Discrete Dirac Operators, Critical Embeddings and Ihara-Selberg Functions. | 0 | 0.34 | 2015 |
| Deciding 4-colorability of planar triangulations | 0 | 0.34 | 2015 |
| Directed cycle double covers and cut-obstacles. | 1 | 0.48 | 2014 |
| Tournaments and colouring | 10 | 1.37 | 2013 |
| Bass' identity and a coin arrangements lemma | 0 | 0.34 | 2012 |
| A permanent formula for the Jones polynomial | 0 | 0.34 | 2011 |
| DNA-inspired information concealing: A survey | 1 | 0.35 | 2010 |
| Satisfying states of triangulations of a convex n-gon | 4 | 0.74 | 2010 |
| DNA-Inspired Information Concealing | 1 | 0.39 | 2009 |
| The 3D Dimer and Ising problems revisited | 0 | 0.34 | 2008 |
| Perfect Matching Preservers | 0 | 0.34 | 2006 |
| Jamming and Geometric Representations of Graphs | 0 | 0.34 | 2006 |
| The Edmonds-Gallai Decomposition for the k-Piece Packing Problem | 0 | 0.34 | 2005 |
| Random Walks And The Colored Jones Function | 1 | 0.36 | 2005 |
| Ground State Incongruence in 2D Spin Glasses Revisited | 0 | 0.34 | 2004 |
| Triangles in random graphs | 2 | 0.62 | 2004 |
| Expected length of the longest common subsequence for large alphabets | 6 | 0.80 | 2004 |
| A note on random homomorphism from arbitrary graphs to Z | 1 | 0.48 | 2003 |
| Towards a theory of frustrated degeneracy | 4 | 0.78 | 2003 |
| Largest planar matching in random bipartite graphs | 1 | 0.47 | 2002 |
| On the Dimer Problem and the Ising Problem in Finite 3-dimensional Lattices | 2 | 0.81 | 2002 |
| Optimization via enumeration: a new algorithm for the Max Cut Problem | 11 | 1.39 | 2001 |
| Some remarks on cycles in graphs and digraphs | 2 | 0.46 | 2001 |
| On the Theory of Pfaan Orientations. I. Perfect Matchings and Permanents | 25 | 3.71 | 1999 |
| On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration | 1 | 0.42 | 1999 |
| Cycle bases for lattices of binary matroids with no Fano dual Minor and their one-element extensions | 1 | 0.42 | 1999 |
| Even directed cycles in H-free digraphs | 0 | 0.34 | 1998 |
| On Defect Sets in Bipartite Graphs (Extended Abstract) | 2 | 0.39 | 1997 |
| Linearity and unprovability of set union problem strategies I: linearity of strong postorder | 4 | 0.46 | 1997 |
| Bases of cocycle lattices and submatrices of a Hadamard matrix. | 0 | 0.34 | 1997 |
| Jordan graphs | 7 | 0.65 | 1996 |
| (P,Q)-odd digraphs | 2 | 0.46 | 1996 |
| Generating convex polyominoes at random | 16 | 1.27 | 1996 |
| Complexity of circuit intersection in graphs | 1 | 0.37 | 1995 |
| Efficient subgraph packing | 16 | 1.16 | 1993 |
| Gadget classification | 0 | 0.34 | 1993 |
| Cycles of prescribed modularity in planar digraphs | 3 | 0.44 | 1993 |
| Efficient maximal cubic graph cuts (extended abstract) | 5 | 0.81 | 1991 |
| Greedy Compression Systems | 0 | 0.34 | 1990 |
| Linearity and Unprovability of Set Union Problem Strategies | 5 | 0.56 | 1988 |
| On matroids induced by packing subgraphs | 13 | 1.42 | 1988 |
| Postorder hierarchy for path compressions and set union | 2 | 0.44 | 1988 |
| Epidemiography II. Games with a dozing yet winning player | 2 | 0.75 | 1988 |
