Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Communications of the ACM
Efficient implementation of graph algorithms using contraction
Journal of the ACM (JACM)
Construction of multidimensional spanner graphs, with applications to minimum spanning trees
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Efficient sequential and parallel algorithms for computing recovery points in trees and paths
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
A randomized linear-time algorithm for finding minimum spanning trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
Proximity problems on moving points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Balancing minimum spanning and shortest path trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Approximating the minimum equivalent digraph
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On the parallel time complexity of undirected connectivity and minimum spanning trees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Journal of the ACM (JACM)
Concurrent threads and optimal parallel minimum spanning trees algorithm
Journal of the ACM (JACM)
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
Programming and Computing Software
A note on practical construction of maximum bandwidth paths
Information Processing Letters
The expected complexity of Prim's minimum spanning tree algorithm
Information Processing Letters
An Optimal Graph-Construction Approach to Placing Program Signatures for Signature Monitoring
IEEE Transactions on Computers
Increasing digraph arc-connectivity by arc addition, reversal and complement
Discrete Applied Mathematics
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
An Optimal Minimum Spanning Tree Algorithm
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
A Memetic Algorithm for Vertex-Biconnectivity Augmentation
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Using sparsification for parametric minimum spanning tree problems
Nordic Journal of Computing
The Delay-Constrained Minimum Spanning Tree Problem
ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Efficient collective communication in distributed heterogeneous systems
Journal of Parallel and Distributed Computing
Arborescence optimization problems solvable by Edmonds' algorithm
Theoretical Computer Science
An optimal PRAM algorithm for a spanning tree on trapezoid graphs
The Korean Journal of Computational & Applied Mathematics
Towards Compressing Web Graphs
DCC '01 Proceedings of the Data Compression Conference
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs
Journal of Heuristics
The non-approximability of bicriteria network design problems
Journal of Discrete Algorithms
Meldable RAM priority queues and minimum directed spanning trees
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay
IEEE Transactions on Mobile Computing
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks
IEEE Transactions on Mobile Computing
ACM Transactions on Algorithms (TALG)
ACM Transactions on Algorithms (TALG)
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
Special classes of mathematical programming models with fuzzy random variables
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Adding magic to an optimising datalog compiler
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficiently answering reachability queries on very large directed graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Approximating optimum branchings in linear time
Information Processing Letters
Combinatorial optimization in system configuration design
Automation and Remote Control
Approximation algorithm for maximum lifetime in wireless sensor networks with data aggregation
International Journal of Sensor Networks
Building taxonomy of web search intents for name entity queries
Proceedings of the 19th international conference on World wide web
Distributed approximation algorithms for finding 2-edge-connected subgraphs
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Event sequence processing: new models and optimization techniques
Proceedings of the Fourth SIGMOD PhD Workshop on Innovative Database Research
Fast euclidean minimum spanning tree: algorithm, analysis, and applications
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Advanced combinatorial algorithms
Algorithms and theory of computation handbook
Path-tree: An efficient reachability indexing scheme for large directed graphs
ACM Transactions on Database Systems (TODS)
Efficient execution plans for distributed skyline query processing
Proceedings of the 14th International Conference on Extending Database Technology
E-Cube: multi-dimensional event sequence analysis using hierarchical pattern query sharing
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
An LP-based heuristic algorithm for the node capacitated in-tree packing problem
Computers and Operations Research
On minimum changeover cost arborescences
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Updating directed minimum cost spanning trees
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Improved negative-border online mining approaches
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Weighted broadcast in linear radio networks
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Restoration of virtual private networks with qos guarantees in the pipe model
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Robustness of minimum cost arborescences
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
A random fuzzy minimum spanning tree problem through a possibility-based value at risk model
Expert Systems with Applications: An International Journal
Research paper: The saga of minimum spanning trees
Computer Science Review
Semi-preemptive routing on a linear and circular track
Discrete Optimization
Lexicographic balanced optimization problems
Operations Research Letters
Operations Research Letters
SIAM Journal on Computing
A new approach to complex web site organization
Journal of Information Science
A hierarchical Dirichlet model for taxonomy expansion for search engines
Proceedings of the 23rd international conference on World wide web
| Hi-index | 0.02 |