Almost-optimum speed-ups of algorithms for bipartite matching and related problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Parallel depth-first search in general directed graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Algorithms for parallel k-vertex connectivity and sparse certificates
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Directed s-t numberings, rubber bands, and testing digraph k-vertex connectivity
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Parallel and output sensitive algorithms for combinatorial and linear algebra problems
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An Õ(n2) algorithm for minimum cuts
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Derandomization through approximation: an NC algorithm for minimum cuts
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Augmenting undirected connectivity in RNC and in randomized Õ(n3) time
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Evaluation may be easier than generation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Is there an algebraic proof for P ≠ NC? (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Checking polynomial identities over any field: towards a derandomization?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Random Weighted Laplacians, Lovász minimum digraphs and finding minimum separators
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A Las Vegas O(n2.38 algorithm for the cardinality of a maximum matching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On the number of minimum size separating vertex sets in a graph and how to find all of them
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Combinatorial approximation algorithms for the maximum directed cut problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Randomness efficient identity testing of multivariate polynomials
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Optimally cutting a surface into a disk
Proceedings of the eighteenth annual symposium on Computational geometry
Routing Strategies for Fast Networks
IEEE Transactions on Computers
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
Selected topics on assignment problems
Discrete Applied Mathematics
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Primality and identity testing via Chinese remaindering
Journal of the ACM (JACM)
Primality and Identity Testing via Chinese Remaindering
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The complexity of tensor calculus
Computational Complexity
List edge multicoloring in graphs with few cycles
Information Processing Letters
Typical properties of winners and losers in discrete optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The combinatorial approach yields an NC algorithm for computing Pfaffians
Discrete Applied Mathematics
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Fast sparse matrix multiplication
ACM Transactions on Algorithms (TALG)
Improved deterministic approximation algorithms for Max TSP
Information Processing Letters
The complexity of matrix completion
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximating weighted matchings in parallel
Information Processing Letters
Decision-making based on approximate and smoothed Pareto curves
Theoretical Computer Science
Multiple source shortest paths in a genus g graph
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An algebraic algorithm for weighted linear matroid intersection
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Faster approximate lossy generalized flow via interior point algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Hardness-randomness tradeoffs for bounded depth arithmetic circuits
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
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
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters
Directed Planar Reachability Is in Unambiguous Log-Space
ACM Transactions on Computation Theory (TOCT)
Cooperation in Multiorganization Matching
Approximation and Online Algorithms
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
Incremental Network Optimization: Theory and Algorithms
Operations Research
Nonlinear Optimization over a Weighted Independence System
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Maximum weight bipartite matching in matrix multiplication time
Theoretical Computer Science
Improved deterministic approximation algorithms for Max TSP
Information Processing Letters
A combinatorial algorithm for Pfaffians
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Budgeted matching and budgeted matroid intersection via the gasoline puzzle
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
The time complexity of constraint satisfaction
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
Proceedings of the forty-second ACM symposium on Theory of computing
Belief propagation for min-cost network flow: convergence & correctness
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the relation between polynomial identity testing and finding variable disjoint factors
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithms and theory of computation handbook
Approximation schemes for multi-budgeted independence systems
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Approximate Nonlinear Optimization over Weighted Independence Systems
SIAM Journal on Discrete Mathematics
Black-box identity testing of depth-4 multilinear circuits
Proceedings of the forty-third annual ACM symposium on Theory of computing
Shortest non-trivial cycles in directed surface graphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
On the Power of Isolation in Planar Graphs
ACM Transactions on Computation Theory (TOCT)
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
Recent results on polynomial identity testing
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Stochastic mean payoff games: smoothed analysis and approximation schemes
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Global minimum cuts in surface embedded graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Decision making based on approximate and smoothed pareto curves
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Multi-budgeted matchings and matroid intersection via dependent rounding
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Computing replacement paths in surface embedded graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A new NC-algorithm for finding a perfect matching in d-regular bipartite graphs when d is small
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On the bipartite unique perfect matching problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Space complexity of perfect matching in bounded genus bipartite graphs
Journal of Computer and System Sciences
Worst-case vs. algorithmic average-case complexity in the polynomial-time hierarchy
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Approximation algorithms for multi-criteria traveling salesman problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Green's theorem and isolation in planar graphs
Information and Computation
On the robust assignment problem under a fixed number of cost scenarios
Operations Research Letters
Survey: The consequences of eliminating NP solutions
Computer Science Review
Approximation algorithms for maximum latency and partial cycle cover
Discrete Optimization
Discrete Optimization
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
Discrete Optimization
Space-round tradeoffs for MapReduce computations
Proceedings of the 26th ACM international conference on Supercomputing
Parallel algorithms for the assignment and minimum-cost flow problems
Operations Research Letters
Belief Propagation for Min-Cost Network Flow: Convergence and Correctness
Operations Research
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
A combinatoric interpretation of dual variables for weighted matching and f-factors
Theoretical Computer Science
Randomized and approximation algorithms for blue-red matching
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
A fast parallel algorithm for minimum-cost small integral flows
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Runtime guarantees for regression problems
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Bisimplicial edges in bipartite graphs
Discrete Applied Mathematics
Fast hamiltonicity checking via bases of perfect matchings
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Log-Space Algorithms for Paths and Matchings in k-Trees
Theory of Computing Systems
Isolating an Odd Number of Elements and Applications in Complexity Theory
Theory of Computing Systems
| Hi-index | 0.01 |