Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Some Matching Problems for Bipartite Graphs
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Fast geometric approximation techniques and geometric embedding problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Approximating the minimum degree spanning tree to within one from the optimal degree
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the power of cascade ciphers
ACM Transactions on Computer Systems (TOCS)
Solving the three-star tree isomorphism problem using genetic algorithms
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Matching is as easy as matrix inversion
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Heuristic and exact algorithms for the spanning tree detection problem
Computers and Operations Research
Decision-making based on approximate and smoothed Pareto curves
Theoretical Computer Science
Spanning trees with minimum weighted degrees
Information Processing Letters
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Cooperation in Multiorganization Matching
Approximation and Online Algorithms
Monotone Covering Problems with an Additional Covering Constraint
Mathematics of Operations Research
Winner determination in sequential majority voting
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Budgeted matching and budgeted matroid intersection via the gasoline puzzle
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
INFOCOM'10 Proceedings of the 29th conference on Information communications
Approximate Nonlinear Optimization over Weighted Independence Systems
SIAM Journal on Discrete Mathematics
Minimizing the number of late jobs on a single machine under due date uncertainty
Journal of Scheduling
Deterministic algorithms for multi-criteria TSP
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
On computing the minimum 3-path vertex cover and dissociation number of graphs
Theoretical Computer Science
Decision making based on approximate and smoothed pareto curves
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximation algorithms for multi-criteria traveling salesman problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Structural complexity of multiobjective NP search problems
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
On the robust assignment problem under a fixed number of cost scenarios
Operations Research Letters
Discrete Optimization
Deterministic algorithms for multi-criteria Max-TSP
Discrete Applied Mathematics
Planarizing gadgets for perfect matching do not exist
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Randomized and approximation algorithms for blue-red matching
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.02 |