Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Data structures and network algorithms
Data structures and network algorithms
Scaling algorithms for network problems
Journal of Computer and System Sciences
An O(EV log V) algorithm for finding a maximal weighted matching in general graphs
SIAM Journal on Computing
A linear algorithm for finding dominators in flow graphs and related problems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
A data structure for dynamic trees
Journal of Computer and System Sciences
Forests, frames, and games: algorithms for matroid sums and applications
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)
The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Applications of Path Compression on Balanced Trees
Journal of the ACM (JACM)
Efficient Algorithms for Graphic Intersection and Parity (Extended Abstract)
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Implementation of algorithms for maximum matching on nonbipartite graphs.
Implementation of algorithms for maximum matching on nonbipartite graphs.
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
Alpha-algorithms for incremental planarity testing (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Unique maximum matching algorithms
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Worst-case and amortised optimality in union-find (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Path problems in skew-symmetric graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Maintaining hierarchical graph views
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On loops, dominators, and dominance frontier
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Compact labeling schemes for ancestor queries
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Wavefront Diffusion and LMSR: Algorithms for Dynamic Repartitioning of Adaptive Meshes
IEEE Transactions on Parallel and Distributed Systems
Three-Dimensional Reconstruction of Points and Lines with Unknown Correspondence across Images
International Journal of Computer Vision
Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
On loops, dominators, and dominance frontiers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Analyzing the Multiple-target-multiple-agent Scenario Using Optimal Assignment Algorithms
Journal of Intelligent and Robotic Systems
Dynamic ordering for a parallel block-Jacobi SVD algorithm
Parallel Computing - Parallel matrix algorithms and applications
Parallel dynamic lowest common ancestors
Nordic Journal of Computing
A simple approximation algorithm for the weighted matching problem
Information Processing Letters
The level-ancestor problem on pure pointer machines
Information Processing Letters
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Ancestor Problems on Pure Pointer Machines
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Range Searching Over Tree Cross Products
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Dominator Trees and Fast Verification of Proof Nets
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Sourcebook of parallel computing
Implementation of O(nmlogn) weighted matchings in general graphs: the power of data structures
Journal of Experimental Algorithmics (JEA)
Journal of Experimental Algorithmics (JEA)
Algorithms for four variants of the exact satisfiability problem
Theoretical Computer Science
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
On the complexity of vertex-disjoint length-restricted path problems
Computational Complexity
Coresets in dynamic geometric data streams
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A price-anticipating resource allocation mechanism for distributed shared clusters
Proceedings of the 6th ACM conference on Electronic commerce
Dominance analysis of irreducible CFGs by reduction
ACM SIGPLAN Notices
A linear-time approximation algorithm for weighted matchings in graphs
ACM Transactions on Algorithms (TALG)
A Novel Approach to Recover Writing Order From Single Stroke Offline Handwritten Images
ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
Design of data structures for mergeable trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
ACM SIGCOMM Computer Communication Review
Fast verification of MLL proof nets via IMLL
ACM Transactions on Computational Logic (TOCL)
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
A Framework Toward Restoration of Writing Order from Single-Stroked Handwriting Image
IEEE Transactions on Pattern Analysis and Machine Intelligence
Incremental assignment problem
Information Sciences: an International Journal
Computing the bipartite edge frustration of fullerene graphs
Discrete Applied Mathematics
Rectangular layouts and contact graphs
ACM Transactions on Algorithms (TALG)
A matrix-based multilevel approach to identify functional protein modules
International Journal of Bioinformatics Research and Applications
Undirected postman problems with zigzagging option: A cutting-plane approach
Computers and Operations Research
Energy and bandwidth-efficient key distribution in wireless ad hoc networks: a cross-layer approach
IEEE/ACM Transactions on Networking (TON)
Path Minima in Incremental Unrooted Trees
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Journal of Discrete Algorithms
Paths and trails in edge-colored graphs
Theoretical Computer Science
1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
Information Processing Letters
Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Optimization-based approach for curve and surface reconstruction
Computer-Aided Design
Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Properly Coloured Cycles and Paths: Results and Open Problems
Graph Theory, Computational Intelligence and Thought
Distributed link scheduling with constant overhead
IEEE/ACM Transactions on Networking (TON)
New common ancestor problems in trees and directed acyclic graphs
Information Processing Letters
Schematisation of tree drawings
GD'06 Proceedings of the 14th international conference on Graph drawing
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
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
Paths and trails in edge-colored graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Proceedings of the 11th ACM conference on Electronic commerce
On distributed scheduling in wireless networks exploiting broadcast and network coding
IEEE Transactions on Communications
On channel-discontinuity-constraint routing in wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
The complexity of RP selection in multicast channelization
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Multilevel algorithms for partitioning power-law graphs
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
On the complexity of scheduling in wireless networks
EURASIP Journal on Wireless Communications and Networking - Special issue on adaptive cross-layer strategies for fourth generation wireless communications
SMI 2011: Full Paper: Template-based quadrilateral meshing
Computers and Graphics
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
Linear programming in the semi-streaming model with application to the maximum matching problem
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Matching and P2-packing: weighted versions
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Test Planning in Digital Microfluidic Biochips Using Efficient Eulerization Techniques
Journal of Electronic Testing: Theory and Applications
Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees
ACM Transactions on Algorithms (TALG)
Scheduling mobile collaborating workforce for multiple urgent events
Journal of Network and Computer Applications
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
Efficient distributed weighted matchings on trees
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Approximation strategies for routing edge disjoint paths in complete graphs
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
On degree constrained shortest paths
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Computing convex quadrangulations
Discrete Applied Mathematics
Partitioning planar graphs: a fast combinatorial approach for max-cut
Computational Optimization and Applications
On bounded load routings for modeling k-regular connection topologies
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Finding graph matchings in data streams
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On solution concepts for matching games
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Augmenting the edge-connectivity of a spider tree
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Efficient algorithms for the longest path problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach
Journal of Combinatorial Theory Series B
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
A multilevel approach to identify functional modules in a yeast protein-protein interaction network
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Survey: Cycle bases in graphs characterization, algorithms, complexity, and applications
Computer Science Review
A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs
Discrete Optimization
Approximation algorithms for maximum dispersion
Operations Research Letters
Lexicographic bottleneck combinatorial problems
Operations Research Letters
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
Operations Research Letters
A simple reduction from maximum weight matching to maximum cardinality matching
Information Processing Letters
A multithreaded algorithm for network alignment via approximate matching
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Approximating the maximum sharing problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Efficient approximation algorithms for the routing open shop problem
Computers and Operations Research
An experimental study of dynamic dominators
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Linear programming in the semi-streaming model with application to the maximum matching problem
Information and Computation
Minimum weighted clique cover on strip-composed perfect graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
On channel-discontinuity-constraint routing in wireless networks
Ad Hoc Networks
Finding dominators via disjoint set union
Journal of Discrete Algorithms
Matching and Weighted P2-Packing: Algorithms and Kernels
Theoretical Computer Science
A reduction algorithm for the weighted stable set problem in claw-free graphs
Discrete Applied Mathematics
The density maximization problem in graphs
Journal of Combinatorial Optimization
| Hi-index | 0.00 |