Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Branch-width and well-quasi-ordering in matroids and graphs
Journal of Combinatorial Theory Series B
Branch-width and Rota's conjecture
Journal of Combinatorial Theory Series B
Two Short Proofs Concerning Tree-Decompositions
Combinatorics, Probability and Computing
European Journal of Combinatorics - Special issue: Topological graph theory
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Graph minors. XXI. Graphs with unique linkages
Journal of Combinatorial Theory Series B
The edge-density for K2,t minors
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |