Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete. | 0 | 0.34 | 2019 |
Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors. | 0 | 0.34 | 2018 |
Gallai's path decomposition conjecture for triangle-free planar graphs. | 0 | 0.34 | 2018 |
Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations | 2 | 0.39 | 2016 |
A Capabilities Approach to Innovation: a Case Study of a Technology and Innovation Hub in Zambia. | 0 | 0.34 | 2016 |
Cubic Bridgeless Graphs and Braces. | 0 | 0.34 | 2016 |
On path decompositions of 2k-regular graphs. | 3 | 0.49 | 2015 |
Directed cycle double covers and cut-obstacles. | 1 | 0.48 | 2014 |
Small degeneracy of antiferromagnetic triangulations. | 0 | 0.34 | 2013 |
Counting perfect matchings in the geometric dual. | 2 | 0.40 | 2011 |
Computational Hardness of Enumerating Satisfying Spin-Assignments in Triangulations | 0 | 0.34 | 2011 |