Bisubmodular Function Minimization
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
The complexity of chromatic strength and chromatic edge strength
Computational Complexity
Induction of M-convex functions by linking systems
Discrete Applied Mathematics
Even factors, jump systems, and discrete convexity
Journal of Combinatorial Theory Series B
Complexity results for minimum sum edge coloring
Discrete Applied Mathematics
Faster algorithms for semi-matching problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Neighbor Systems and the Greedy Algorithm
SIAM Journal on Discrete Mathematics
Algebraic algorithms for linear matroid parity problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach
Journal of Combinatorial Theory Series B
A proof of Cunningham's conjecture on restricted subgraphs and jump systems
Journal of Combinatorial Theory Series B
A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs
Discrete Optimization
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra
SIAM Journal on Discrete Mathematics
Hi-index | 0.00 |