Finding minimum-cost circulations by canceling negative cycles
Journal of the ACM (JACM)
Fast approximation algorithms for multicommodity flow problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Geometric algorithms for a minimum cost assignment problem
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Understanding retiming through maximum average-weight cycles
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
General techniques for comparing unrooted evolutionary trees
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Using random sampling to find maximum flows in uncapacitated undirected graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Algorithmic aspects in speech recognition: an introduction
Journal of Experimental Algorithmics (JEA)
Analyzing Asynchronous Pipeline Schedules
International Journal of Parallel Programming
Scaling algorithms for the shortest paths problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fast comparison of evolutionary trees
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Shortest paths algorithms: theory and experimental evaluation
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for bipartite and non-bipartite matching in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Heuristic Algorithms for Scheduling Iterative Task Computations on Distributed Memory Machines
IEEE Transactions on Parallel and Distributed Systems
Journal of Algorithms
Computing in Science and Engineering
Optimal roundings of sequences and matrices
Nordic Journal of Computing
Index Structures for Path Expressions
ICDT '99 Proceedings of the 7th International Conference on Database Theory
On the Complexities of the Optimal Rounding Problems of Sequences and Matrices
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A Faster and Unifying Algorithm for Comparing Trees
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Computing unrooted maximum subtrees in sub-quartic time
Nordic Journal of Computing
Sensitivity Analysis for Scheduling Problems
Journal of Scheduling
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
A near-linear constant-factor approximation for euclidean bipartite matching?
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Algorithms for solving the symmetry number problem on trees
Information Processing Letters
A simpler linear time 2/3 - ε approximation for maximum weight matching
Information Processing Letters
The effect of post-layout pin permutation on timing
Proceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays
Persistence barcodes for shapes
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Combinatorics and algorithms for low-discrepancy, roundings of a real sequence
Theoretical Computer Science - Automata, languages and programming
Exact and Approximate Graph Matching Using Random Walks
IEEE Transactions on Pattern Analysis and Machine Intelligence
Improved algorithm for the symmetry number problem on trees
Information Processing Letters
Planar graphs, negative weight edges, shortest paths, and near linear time
Journal of Computer and System Sciences - Special issue on FOCS 2001
Temporal stratification tests for linear and branching-time deductive databases
Theoretical Computer Science
Pattern Identification in Biogeography
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
ACM Transactions on Algorithms (TALG)
Gestalt-based feature similarity measure in trademark database
Pattern Recognition
A Network Flow Algorithm for Reconstructing Binary Images from Discrete X-rays
Journal of Mathematical Imaging and Vision
Approximate parameterized matching
ACM Transactions on Algorithms (TALG)
An algebraic algorithm for weighted linear matroid intersection
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Association-based similarity testing and its applications
Intelligent Data Analysis
Reducing rank-maximal to maximum weight matching
Theoretical Computer Science
Approximate labelled subtree homeomorphism
Journal of Discrete Algorithms
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Theoretical Computer Science
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
Declarative Agent Languages and Technologies VI
Padded frames: a novel algorithm for stable scheduling in load-balanced switches
IEEE/ACM Transactions on Networking (TON)
A static API birthmark for Windows binary executables
Journal of Systems and Software
Stable marriage with ties and bounded length preference lists
Journal of Discrete Algorithms
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Algorithmics of Large and Complex Networks
Graph Theory, Computational Intelligence and Thought
Maximum weight bipartite matching in matrix multiplication time
Theoretical Computer Science
Using combinatorial optimization in model-based trimmed clustering with cardinality constraints
Computational Statistics & Data Analysis
Improved algorithm for the symmetry number problem on trees
Information Processing Letters
ACM Transactions on Algorithms (TALG)
Finding paths with the right cost
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Optimal partial tiling of Manhattan polyominoes
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Single source shortest paths in H-minor free graphs
Theoretical Computer Science
Distributed tracking in a large-scale network of smart cameras
Proceedings of the Fourth ACM/IEEE International Conference on Distributed Smart Cameras
Minimum cost edge-colorings of trees can be reduced to matchings
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
ACM Transactions on Computation Theory (TOCT)
Near approximation of maximum weight matching through efficient weight reduction
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
A metric for phylogenetic trees based on matching
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Structure-based evaluation methodology for curvilinear structure detection algorithms
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Matching Split Distance for Unrooted Binary Phylogenetic Trees
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Assignment problems in rental markets
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Algorithms for the transportation problem in geometric settings
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Efficient algorithms for maximum weight matchings in general graphs with small edge weights
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A scaling algorithm for maximum weight matching in bipartite graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Shortest paths in matrix multiplication time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A novel approach for affine point pattern matching
ICIAR'06 Proceedings of the Third international conference on Image Analysis and Recognition - Volume Part II
Pareto optimality in house allocation problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Weighted bipartite matching in matrix multiplication time
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Pareto optimality in house allocation problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Fast algorithms for weighted bipartite matching
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
The k-allocation problem and its variants
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
A faster polynomial algorithm for the constrained maximum flow problem
Computers and Operations Research
A near-linear time ε-approximation algorithm for geometric bipartite matching
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A Metric for Phylogenetic Trees Based on Matching
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Parallel algorithms for the assignment and minimum-cost flow problems
Operations Research Letters
A simple reduction from maximum weight matching to maximum cardinality matching
Information Processing Letters
RNA tree comparisons via unrooted unordered alignments
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
Proceedings of the twenty-ninth annual symposium on Computational geometry
Upper and lower degree bounded graph orientation with minimum penalty
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
A distributed algorithm for large-scale generalized matching
Proceedings of the VLDB Endowment
| Hi-index | 0.01 |