On Cost-Optimal Merge of Two Intransitive Sorted Sequences
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A note on the query complexity of the Condorcet winner problem
Information Processing Letters
Vertex cover, dominating set and my encounters with parameterized complexity and mike fellows
The Multivariate Algorithmic Revolution and Beyond
A refined view of causal graphs and component sizes: SP-closed graph classes and beyond
Journal of Artificial Intelligence Research
| Hi-index | 0.01 |