Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Independence free graphs and vertex connectivity augmentation
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |