Discrete Applied Mathematics
Good characterizations for some degree constrained subgraphs
Journal of Combinatorial Theory Series B
Efficient algorithms for the 2-gathering problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Efficient algorithms for the 2-gathering problem
ACM Transactions on Algorithms (TALG)
Editing graphs to satisfy degree constraints: A parameterized approach
Journal of Computer and System Sciences
A 12-integral relaxation for the A-matching problem
Operations Research Letters
| Hi-index | 0.00 |