STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The combinatorial approach yields an NC algorithm for computing Pfaffians
Discrete Applied Mathematics
Budgeted matching and budgeted matroid intersection via the gasoline puzzle
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Matroid matching: the power of local search
Proceedings of the forty-second ACM symposium on Theory of computing
Utilitarian mechanism design for multi-objective optimization
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximation schemes for multi-budgeted independence systems
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Multi-budgeted matchings and matroid intersection via dependent rounding
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Algebraic algorithms for linear matroid parity problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Bounding the payment of approximate truthful mechanisms
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Stochastic combinatorial optimization via poisson approximation
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A simple PTAS for weighted matroid matching on strongly base orderable matroids
Discrete Applied Mathematics
| Hi-index | 0.00 |