Data structures and network algorithms
Data structures and network algorithms
Scaling algorithms for network problems
Journal of Computer and System Sciences
A strongly polynomial minimum cost circulation algorithm
Combinatorica
An O(EV log V) algorithm for finding a maximal weighted matching in general graphs
SIAM Journal on Computing
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Algorithms for two bottleneck optimization problems
Journal of Algorithms
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Efficient implementation of graph algorithms using contraction
Journal of the ACM (JACM)
Faster scaling algorithms for network problems
SIAM Journal on Computing
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
Journal of the ACM (JACM)
Applications of Path Compression on Balanced Trees
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS
Band Ordering in Lossless Compression of Multispectral Images
IEEE Transactions on Computers
Optimal phase conflict removal for layout of dark field alternating phase shifting masks
ISPD '99 Proceedings of the 1999 international symposium on Physical design
Unique maximum matching algorithms
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Path problems in skew-symmetric graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
A simple approximation algorithm for the weighted matching problem
Information Processing Letters
Max- and Min-Neighborhood Monopolies
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Packing Cycles and Cuts in Undirected Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Optimizing multiple dimensional queries simultaneously in multidimensional databases
The VLDB Journal — The International Journal on Very Large Data Bases
Optimizing Processing of Query Subscription in an WDM Network Environment
ITCC '00 Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00)
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
Processor efficient parallel matching
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
A linear-time approximation algorithm for weighted matchings in graphs
ACM Transactions on Algorithms (TALG)
Answering distance queries in directed graphs using fast matrix multiplication
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
ACM SIGCOMM Computer Communication Review
Improved algorithm for the symmetry number problem on trees
Information Processing Letters
The representation and matching of categorical shape
Computer Vision and Image Understanding
Propositional Logic Constraint Patterns and Their Use in UML-Based Conceptual Modeling and Analysis
IEEE Transactions on Knowledge and Data Engineering
Maximum matching in graphs with an excluded minor
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A distributed switch scheduling algorithm
Performance Evaluation
Mapping model with inter-array memory sharing for multidimensional signal processing
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Analysis and approximation of optimal co-scheduling on chip multiprocessors
Proceedings of the 17th international conference on Parallel architectures and compilation techniques
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Journal of Discrete Algorithms
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
Paths and trails in edge-colored graphs
Theoretical Computer Science
Efficient algorithms for the 2-gathering problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating the Metric TSP in Linear Time
Graph-Theoretic Concepts in Computer Science
Edges and switches, tunnels and bridges
Computational Geometry: Theory and Applications
Improved algorithm for the symmetry number problem on trees
Information Processing Letters
Efficient algorithms for the 2-gathering problem
ACM Transactions on Algorithms (TALG)
Optimal matching between spatial datasets under capacity constraints
ACM Transactions on Database Systems (TODS)
Linear time local improvements for weighted matchings in graphs
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Linear time 1/2 -approximation algorithm for maximum weighted matching in general graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Engineering algorithms for approximate weighted matching
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Continuous spatial assignment of moving users
The VLDB Journal — The International Journal on Very Large Data Bases
ESA'07 Proceedings of the 15th annual European conference on Algorithms
The stable roommates problem with globally-ranked pairs
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Paths and trails in edge-colored graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
An FPTAS for bargaining networks with unequal bargaining powers
WINE'10 Proceedings of the 6th international conference on Internet and network economics
An improved algorithm for multi-way trading for exchange and barter
Electronic Commerce Research and Applications
Signal Assignment Model for the Memory Management of Multidimensional Signal Processing Applications
Journal of Signal Processing Systems
Object categorization using bone graphs
Computer Vision and Image Understanding
Approximating edge dominating set in dense graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
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
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
ESA'11 Proceedings of the 19th European conference on Algorithms
Approximating edge dominating set in dense graphs
Theoretical Computer Science
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
Approximate shortest paths in weighted graphs
Journal of Computer and System Sciences
Sensitivity analysis of minimum spanning trees in sub-inverse-ackermann time
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach
Journal of Combinatorial Theory Series B
Popular matchings in the marriage and roommates problems
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
A near-linear time ε-approximation algorithm for geometric bipartite matching
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Improved bounds for vehicle routing solutions
Discrete Optimization
A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs
Discrete Optimization
Generalized Swept Mid-structure for Polygonal Models
Computer Graphics Forum
Reordering rows for better compression: Beyond the lexicographic order
ACM Transactions on Database Systems (TODS)
Cluster editing with locally bounded modifications
Discrete Applied Mathematics
A simple reduction from maximum weight matching to maximum cardinality matching
Information Processing Letters
Edges and switches, tunnels and bridges
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A model for minimizing active processor time
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Fork-forests in bi-colored complete bipartite graphs
Discrete Applied Mathematics
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
Equistable simplicial, very well-covered, and line graphs
Discrete Applied Mathematics
| Hi-index | 0.01 |