Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
Data structures and network algorithms
Data structures and network algorithms
SIAM Journal on Computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Applications of Path Compression on Balanced Trees
Journal of the ACM (JACM)
A data structure for manipulating priority queues
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Efficient Algorithms for Graphic Intersection and Parity (Extended Abstract)
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Communications of the ACM
Finding minimum-cost circulations by canceling negative cycles
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
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
Efficient implementation of graph algorithms using contraction
Journal of the ACM (JACM)
Fast geometric approximation techniques and geometric embedding problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
A top down unification of minimum cost spanning tree algorithms
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Finding minimum-cost circulations by canceling negative cycles
Journal of the ACM (JACM)
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Planar graph decomposition and all pairs shortest paths
Journal of the ACM (JACM)
Geometric algorithms for a minimum cost assignment problem
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
An optimal algorithm to find the degrees of connectedness in an undirected edge-weighted graph
Pattern Recognition Letters
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
The Canadian Traveller Problem
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
On the all-pairs-shortest-path problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Minkowski-type theorems and least-squares partitioning
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Scheduling algorithms for multi-hop radio networks
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs
IEEE Transactions on Computers
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
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
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A shortest path approach to wireframe to solid model conversion
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Shortest path queries among weighted obstacles in the rectilinear plane
Proceedings of the eleventh annual symposium on Computational geometry
Yet another efficient algorithm for replacing the edges of a minimum spanning tree
CSC '96 Proceedings of the 1996 ACM 24th annual conference on Computer science
Developing algorithms and software for geometric path planning problems
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Two algorithms for nearest-neighbor search in high dimensions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Time-work tradeoffs for parallel algorithms
Journal of the ACM (JACM)
Efficient solutions to multicast routing in communication networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices
IEEE Transactions on Computers
Information theoretic implications for pairing heaps
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An iterative algorithm for delay-constrained minimum-cost multicasting
IEEE/ACM Transactions on Networking (TON)
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Weight-biased leftist trees and modified skip lists
Journal of Experimental Algorithmics (JEA)
Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
All pairs lightest shortest paths
STOC '99 Proceedings of the thirty-first 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
Scaling algorithms for the shortest paths problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Balancing minimum spanning and shortest path trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Buckets, heaps, lists, and monotone priority queues
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Fast approximate graph partitioning algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Polynomial time algorithms for some evacuation problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Reconstructing a history of recombinations from a set of sequences
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
Path problems in skew-symmetric graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A generalization of Janson inequalities and its application to finding shortest paths
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
Incremental algorithms for minimal length paths
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
On the efficiency of pairing heaps and related data structures
Journal of the ACM (JACM)
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
On dual minimum cost flow algorithms (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximation algorithms for geometric shortest path problems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Shortest path queries in planar graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Correspondence-based data structures for double-ended priority queues
Journal of Experimental Algorithmics (JEA)
The soft heap: an approximate priority queue with optimal error rate
Journal of the ACM (JACM)
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Journal of the ACM (JACM)
Scheduling Classes on a College Campus
Computational Optimization and Applications
Fast approximation of centrality
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Single-source shortest-paths on arbitrary directed graphs in linear average-case time
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Faster kinetic heaps and their use in broadcast scheduling
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Concurrent threads and optimal parallel minimum spanning trees algorithm
Journal of the ACM (JACM)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Implementing weighted b-matching algorithms: insights from a computational study
Journal of Experimental Algorithmics (JEA)
Computing the nxm shortest path efficiently
Journal of Experimental Algorithmics (JEA)
An experimental study of priority queues in external memory
Journal of Experimental Algorithmics (JEA)
Combinatorial auctions with decreasing marginal utilities
Proceedings of the 3rd ACM conference on Electronic Commerce
Compiler optimization on instruction scheduling for low power
ISSS '00 Proceedings of the 13th international symposium on System synthesis
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
Meldable heaps and boolean union-find
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
SODA '02 Proceedings of the thirteenth 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
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Oracles for distances avoiding a link-failure
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving aProduction-Transportation Problem
Journal of Global Optimization
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
Computing in Science and Engineering
An external memory data structure for shortest path queries
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Least and greatest solutions of equations over N
Nordic Journal of Computing
Constructing the Spanners of Graphs in Parallel
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
A Parallel Priority Data Structure with Applications
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Robust Routing in Wide-Area WDM Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Directed Automated Theorem Proving
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Improved Upper Bounds for Pairing Heaps
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
An Optimal Minimum Spanning Tree Algorithm
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Quick k-Median, k-Center, and Facility Location for Sparse Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Improved Shortest Paths on the Word RAM
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Shortest Path Algorithms: Engineering Aspects
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On the Comparison-Addition Complexity of All-Pairs Shortest Paths
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Improved Distance Oracles for Avoiding Link-Failure
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Finding the Most Vital Node of a Shortest Path
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Algorithms for Restoration Planning in a Telecommunications Network
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Experimental Evaluation of a New Shortest Path Algorithm
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Mobile Journey Planning for Bus Passengers
GIScience '02 Proceedings of the Second International Conference on Geographic Information Science
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
An Experimental Study of Priority Queues in External Memory
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Pushing the Limits in Sequential Sorting
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Generic epsilon -Removal Algorithm for Weighted Automata
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
A Placement Algorithm for FPGA Designs with Multiple I/O Standards
FPL '00 Proceedings of the The Roadmap to Reconfigurable Computing, 10th International Workshop on Field-Programmable Logic and Applications
Car-Pooling as a Data Structuring Device: The Soft Heap
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
K-D Trees Are Better when Cut on the Longest Side
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Maintaining a Minimum Spanning Tree Under Transient Node Failures
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
A Simple Shortest Path Algorithm with Linear Average Time
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Computing the n × m Shortest Paths Efficently
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Shipping problems with body clock constraints
Computers and Operations Research
Compiler optimization on VLIW instruction scheduling for low power
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Finding the most vital node of a shortest path
Theoretical Computer Science - Computing and combinatorics
Optimal clip ordering for multi-clip queries
The VLDB Journal — The International Journal on Very Large Data Bases
Improved shortest path algorithms for nearly acyclic graphs
Theoretical Computer Science
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
Computers and Operations Research
Fuzzy-connected 3D image segmentation at interactive speeds
Graphical Models
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A new approach to dynamic all pairs shortest paths
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Information Processing Letters
All Pairs Shortest Paths in Undirected Graphs with Integer Weights
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Route planning and map inference with global positioning traces
Computer Science in Perspective
The number of tests required to search an unordered table
Information Processing Letters
Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons
Journal of Experimental Algorithmics (JEA)
Learning with mixtures of trees
The Journal of Machine Learning Research
Algorithms for shortest paths and d-cycle problems
Journal of Discrete Algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
The weighted farthest color Voronoi diagram on trees and graphs
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
Finding optimal paths in MREP routing
Information Processing Letters
Finding the first K shortest paths in a time-window network
Computers and Operations Research
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
Experimental analysis of dynamic all pairs shortest path algorithms
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
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Cache-oblivious shortest paths in graphs using buffer heap
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Optimal paths in weighted timed automata
Theoretical Computer Science - Logic, semantics and theory of programming
Improved algorithm for all pairs shortest paths
Information Processing Letters
Journal of Computer and System Sciences - Special issue: STOC 2003
Journal of the ACM (JACM)
The effect of post-layout pin permutation on timing
Proceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays
Maintaining Longest Paths Incrementally
Constraints
Worst-case update times for fully-dynamic all-pairs shortest paths
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
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A contraction algorithm for finding minimal feedback sets
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Calculating the meeting point of scattered robots on weighted terrain surfaces
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Efficient algorithms for solving shortest paths on nearly acyclic directed graphs
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Efficient query processing on spatial networks
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Towards a Final Analysis of Pairing Heaps
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Answering distance queries in directed graphs using fast matrix multiplication
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Shortest-Path Kernels on Graphs
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Loop scheduling with timing and switching-activity minimization for VLIW DSP
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Journal of Global Optimization
Learner interaction with algorithm visualizations: viewing vs. changing vs. constructing
Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education
Proceedings of the 2006 ACM symposium on Applied computing
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences - Special issue on FOCS 2001
On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay
IEEE Transactions on Mobile Computing
ACM Transactions on Algorithms (TALG)
Iuriservice II: ontology development and architectural design
ICAIL '05 Proceedings of the 10th international conference on Artificial intelligence and law
Combining speed-up techniques for shortest-path computations
Journal of Experimental Algorithmics (JEA)
ACM Transactions on Algorithms (TALG)
Experimental analysis of dynamic all pairs shortest path algorithms
ACM Transactions on Algorithms (TALG)
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Predictive log-synchronization
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Optimal constituent alignment with edge covers for semantic projection
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Spatially-decaying aggregation over a network
Journal of Computer and System Sciences
Solving shortest paths efficiently on nearly acyclic directed graphs
Theoretical Computer Science
Parameterized matching with mismatches
Journal of Discrete Algorithms
Two fast algorithms for all-pairs shortest paths
Computers and Operations Research
Ortholog Clustering on a Multipartite Graph
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Approximate distance oracles for graphs with dense clusters
Computational Geometry: Theory and Applications
All-pairs bottleneck paths for general graphs in truly sub-cubic time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Computing all efficient solutions of the biobjective minimum spanning tree problem
Computers and Operations Research
Approximate parameterized matching
ACM Transactions on Algorithms (TALG)
On the power of structural violations in priority queues
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Improved shortest path algorithms for nearly acyclic directed graphs
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
An O(n3 (loglogn/logn)5/4) time algorithm for all pairs shortest paths
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
All-pairs bottleneck paths in vertex weighted graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding the k shortest simple paths: A new algorithm and its implementation
ACM Transactions on Algorithms (TALG)
Association-based similarity testing and its applications
Intelligent Data Analysis
Journal of Symbolic Computation
A tight analysis of the Katriel–Bodlaender algorithm for online topological ordering
Theoretical Computer Science
A note of an O(n3/logn) time algorithm for all pairs shortest paths
Information Processing Letters
ACM Transactions on Algorithms (TALG)
Proceedings of the 16th international ACM/SIGDA symposium on Field programmable gate arrays
Improved distance sensitivity oracles via random sampling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate labelled subtree homeomorphism
Journal of Discrete Algorithms
Geodesic Gaussian kernels for value function approximation
Autonomous Robots
Point-to-Point Shortest Path Algorithms with Preprocessing
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
PittPatt Face Detection and Tracking for the CLEAR 2007 Evaluation
Multimodal Technologies for Perception of Humans
Ranking of Closeness Centrality for Large-Scale Social Networks
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Faster Swap Edge Computation in Minimum Diameter Spanning Trees
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Generalized network Voronoi diagrams: Concepts, computational methods, and applications
International Journal of Geographical Information Science
A fast algorithm for computing minimum routing cost spanning trees
Computer Networks: The International Journal of Computer and Telecommunications Networking
An exterior simplex type algorithm for the Minimum Cost Network Flow Problem
Computers and Operations Research
Spatialized audio streaming for networked virtual environments
MM '08 Proceedings of the 16th ACM international conference on Multimedia
The computational power and complexity of constraint handling rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Exploiting sparsity in pricing routines for the capacitated arc routing problem
Computers and Operations Research
Efficient Algorithms for the Computational Design of Optimal Tiling Arrays
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Routing policy of stochastic-flow networks under time threshold and budget constraint
Expert Systems with Applications: An International Journal
Improved algorithms for the k simple shortest paths and the replacement paths problems
Information Processing Letters
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
Graph-Theoretic Concepts in Computer Science
Discrete Applied Mathematics
Practical and effective IR-style keyword search over semantic web
Information Processing and Management: an International Journal
Computation and data transfer co-scheduling for interconnection bus minimization
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
Theory and Practice of Logic Programming
Time version of the shortest path problem in a stochastic-flow network
Journal of Computational and Applied Mathematics
Combinatorial optimization in system configuration design
Automation and Remote Control
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Finding non-dominated bicriteria shortest pairs of disjoint simple paths
Computers and Operations Research
Optimal routing policy of a stochastic-flow network
Computers and Industrial Engineering
A Weighted kt, t-Free t-Factor Algorithm for Bipartite Graphs
Mathematics of Operations Research
CUDA Solutions for the SSSP Problem
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Design and Engineering of External Memory Traversal Algorithms for General Graphs
Algorithmics of Large and Complex Networks
On A☆ search with stopover areas
International Journal of Geographical Information Science
On a pair of job-machine assignment problems with two stages
Computers and Operations Research
Robust and Efficient Routing in Wireless Mesh Networks with Unreliable Nodes
NEW2AN '09 and ruSMART '09 Proceedings of the 9th International Conference on Smart Spaces and Next Generation Wired/Wireless Networking and Second Conference on Smart Spaces
Hybrid shortest path algorithm for vehicle navigation
The Journal of Supercomputing
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
Journal of Discrete Algorithms
An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
Computers and Operations Research
Shortest paths in time-dependent FIFO networks using edge load forecasts
Proceedings of the Second International Workshop on Computational Transportation Science
Finding multiple routing paths in wide-area WDM networks
Computer Communications
Computation of multi-constrained paths in multi-domain MPLS-TE networks
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
Efficient implementation of the generalized Tunstall code generation algorithm
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
On the minimum diameter spanning tree problem
Information Processing Letters
Optimizing scheduling and intercluster connection for application-specific DSP processors
IEEE Transactions on Signal Processing
Suboptimal Fault Tolerant Control Design with the Use of Discrete Optimization
International Journal of Applied Mathematics and Computer Science - Issues in Fault Diagnosis and Fault Tolerant Control
ACM Transactions on Algorithms (TALG)
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
ACM Transactions on Algorithms (TALG)
Proceedings of the 3rd Workshop on Social Network Mining and Analysis
Cross-lingual annotation projection of semantic roles
Journal of Artificial Intelligence Research
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Compiler-assisted leakage-aware loop scheduling for embedded VLIW DSP processors
Journal of Systems and Software
A faster algorithm for the single source shortest path problem with few distinct positive lengths
Journal of Discrete Algorithms
Approximation algorithms for shortest descending paths in terrains
Journal of Discrete Algorithms
Speed-up techniques for shortest-path computations
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Constructing light spanning trees with small routing cost
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On coordination among multiple auctions
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
The correspondence between the logical algorithms language and CHR
ICLP'07 Proceedings of the 23rd international conference on Logic programming
On the cost of interchange rearrangement in strings
ESA'07 Proceedings of the 15th annual European conference on Algorithms
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A weighted Kt, t-free t-factor algorithm for bipartite graphs
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Solving path problems on the GPU
Parallel Computing
Computers and Operations Research
Proceedings of the forty-second ACM symposium on Theory of computing
Revisiting priority queues for image analysis
Pattern Recognition
Finding shortest non-trivial cycles in directed graphs on surfaces
Proceedings of the twenty-sixth annual symposium on Computational geometry
Nondecreasing paths in a weighted graph or: How to optimally read a train schedule
ACM Transactions on Algorithms (TALG)
Single source shortest paths in H-minor free graphs
Theoretical Computer Science
Risk-aware routing for optical transport networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Fast euclidean minimum spanning tree: algorithm, analysis, and applications
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
An edge-wise linear shortest path algorithm for non negative weighted undirected graphs
Proceedings of the 7th International Conference on Frontiers of Information Technology
A new public transportation data model and shortest-path algorithms
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 1
Fast algorithms for placing large entries along the diagonal of a sparse matrix
Journal of Computational and Applied Mathematics
A method to evaluate routing policy through p minimal paths for stochastic case
Information Sciences: an International Journal
Transitive node similarity for link prediction in social networks with positive and negative links
Proceedings of the fourth ACM conference on Recommender systems
System reliability for quickest path problems under time threshold and budget
Computers & Mathematics with Applications
Local network Voronoi diagrams
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Highway dimension, shortest paths, and provably efficient algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Expert Systems with Applications: An International Journal
Pairing heaps with costless meld
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Algorithm design and analysis techniques
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
The violation heap: a relaxed Fibonacci-like heap
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
Energy efficient joint scheduling and multi-core interconnect design
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
Shortest vertex-disjoint two-face paths in planar graphs
ACM Transactions on Algorithms (TALG)
An algorithm for calculating the similarity measures of surfaces represented as point clouds
Pattern Recognition and Image Analysis
Journal of Intelligent and Robotic Systems
Parameterized searching with mismatches for run-length encoded strings
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Providing built-in keyword search capabilities in RDBMS
The VLDB Journal — The International Journal on Very Large Data Bases
A simpler algorithm for the all pairs shortest path problem with o(n2 log n) expected time
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
A simpler and more efficient algorithm for the next-to-shortest path problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Computers and Industrial Engineering
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Optimizing protein importance assessment through a Dijkstra-based sequential optimization technique
NNECFSIC'12 Proceedings of the 12th WSEAS international conference on Neural networks, fuzzy systems, evolutionary computing & automation
Aggregate distance based clustering using fibonacci series-FIBCLUS
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
All-pairs shortest paths with a sublinear additive error
ACM Transactions on Algorithms (TALG)
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
Optimal allocation in combinatorial auctions with quadratic utility functions
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
A survey of geodesic paths on 3D surfaces
Computational Geometry: Theory and Applications
CoNLL '11 Proceedings of the Fifteenth Conference on Computational Natural Language Learning
Faster Algorithms for Max-Product Message-Passing
The Journal of Machine Learning Research
Incremental algorithm for hierarchical minimum spanning forests and saliency of watershed cuts
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
Stochastic flow networks via multiple paths under time threshold and budget constraint
Computers & Mathematics with Applications
MCPR'11 Proceedings of the Third Mexican conference on Pattern recognition
Four-layer framework for combinatorial optimization problems domain
Advances in Engineering Software
GAPs: Geospatial Abduction Problems
ACM Transactions on Intelligent Systems and Technology (TIST)
A shortest cycle for each vertex of a graph
Information Processing Letters
Faster algorithm for optimum Steiner trees
Information Processing Letters
Dynamic programming algorithms for efficiently computing cosegmentations between biological images
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Hierarchically nested convex VCSP
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Risk-aware provisioning for optical WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
Selection of the most suitable measurement path for router abnormality detection
CSCS '11 Proceedings of the 2nd international conference on Circuits, systems, control, signals
Transmission reliability of k minimal paths within time threshold
Computers and Industrial Engineering
IUKM'11 Proceedings of the 2011 international conference on Integrated uncertainty in knowledge modelling and decision making
Energy efficiency mechanism using mobile-based Fermat's spiral in WSN
ACS'11 Proceedings of the 11th WSEAS international conference on Applied computer science
Scene reconstruction and visualization from internet photo collections
Scene reconstruction and visualization from internet photo collections
Approximation algorithms for the loop cutset problem
UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
Extending Dijkstra's algorithm to maximize the shortest path by node-wise limited arc interdiction
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
A scaling algorithm for maximum weight matching in bipartite graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
GD'05 Proceedings of the 13th international conference on Graph Drawing
Deterministic constructions of approximate distance oracles and spanners
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Finding the K shortest paths in a schedule-based transit network
Computers and Operations Research
Performance evaluation of object detection and tracking in video
ACCV'06 Proceedings of the 7th Asian conference on Computer Vision - Volume Part II
Policy-based benchmarking of weak heaps and their relatives,
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Developments in data structure research during the first 25 years of FSTTCS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Efficient truthful mechanisms for the single-source shortest paths tree problem
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
The complexity of implicit and space efficient priority queues
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Ortholog clustering on a multipartite graph
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Approximate distance oracles for graphs with dense clusters
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
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
Human-centric panoramic imaging stitching
AH '12 Proceedings of the 3rd Augmented Human International Conference
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On the implementation of parallel shortest path algorithms on a supercomputer
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Evaluation framework for video OCR
ICVGIP'06 Proceedings of the 5th Indian conference on Computer Vision, Graphics and Image Processing
Buffer sizing for self-timed stream programs on heterogeneous distributed memory multiprocessors
HiPEAC'10 Proceedings of the 5th international conference on High Performance Embedded Architectures and Compilers
CIARP'11 Proceedings of the 16th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Performance evaluation of text detection and tracking in video
DAS'06 Proceedings of the 7th international conference on Document Analysis Systems
A 7/6-approximation algorithm for the max-min connected bipartition problem on grid graphs
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
SARA: combining stack allocation and register allocation
CC'06 Proceedings of the 15th international conference on Compiler Construction
Fat heaps without regular counters
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On performance evaluation for a multistate network under spare routing
Information Sciences: an International Journal
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths
ACM Transactions on Algorithms (TALG)
Generalized maximum flows over time
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Distributed algorithms for the constrained routing problem in computer networks
Computer Communications
Collaborative similarity measure for intra graph clustering
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications
An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem
Mathematical and Computer Modelling: An International Journal
The first K shortest unique-arc walks in a traffic-light network
Mathematical and Computer Modelling: An International Journal
Direct graph k-partitioning with a Kernighan-Lin like heuristic
Operations Research Letters
Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
Operations Research Letters
Path selection in user-controlled circuit-switched optical networks
Optical Switching and Networking
Computational Geometry: Theory and Applications
Research paper: The saga of minimum spanning trees
Computer Science Review
Approximating minimum-cost graph problems with spanning tree edges
Operations Research Letters
Monge matrices make maximization manageable
Operations Research Letters
Parallel algorithms for the assignment and minimum-cost flow problems
Operations Research Letters
Minimizing a linear multiplicative-type function under network flow constraints
Operations Research Letters
An algorithm for the quickest path problem
Operations Research Letters
A new scaling algorithm for the minimum cost network flow problem
Operations Research Letters
Improved algorithms for replacement paths problems in restricted graphs
Operations Research Letters
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
Operations Research Letters
A new algorithm for reoptimizing shortest paths when the arc costs change
Operations Research Letters
A sequential dual simplex algorithm for the linear assignment problem
Operations Research Letters
The k most vital arcs in the shortest path problem
Operations Research Letters
Graph and matrix metrics to analyze ergodic literature for children
Proceedings of the 23rd ACM conference on Hypertext and social media
An O(m(m+nlogn)log(nC)) -time algorithm to solve the minimum cost tension problem
Theoretical Computer Science
Fast and accurate link prediction in social networking systems
Journal of Systems and Software
QoS-aware automatic service composition: a graph view
Journal of Computer Science and Technology - Special issue on Community Analysis and Information Recommendation
SIAM Journal on Computing
The weak-heap data structure: Variants and applications
Journal of Discrete Algorithms
An O(n3 log log n/ log2 n) time algorithm for all pairs shortest paths
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Parameterized searching with mismatches for run-length encoded strings
Theoretical Computer Science
A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors
Fundamenta Informaticae
Computing all-pairs shortest paths by leveraging low treewidth
Journal of Artificial Intelligence Research
Tractable triangles and cross-free convexity in discrete optimisation
Journal of Artificial Intelligence Research
Finding Alternative Shortest Paths in Spatial Networks
ACM Transactions on Database Systems (TODS)
Efficient computational design of tiling arrays using a shortest path approach
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Theoretical Computer Science
Hierarchical hub labelings for shortest paths
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
RNA tree comparisons via unrooted unordered alignments
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
HLDB: location-based services in databases
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Proceedings of the Winter Simulation Conference
Reoptimizing the rural postman problem
Computers and Operations Research
A simplified algorithm for the all pairs shortest path problem with O(n2logn) expected time
Journal of Combinatorial Optimization
Robust and efficient object segmentation using pseudo-elastica
Pattern Recognition Letters
Software verification and graph similarity for automated evaluation of students' assignments
Information and Software Technology
Sharing information in all pairs shortest path algorithms
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
How to grow more pairs: suggesting review targets for comparison-friendly review ecosystems
Proceedings of the 22nd international conference on World Wide Web
All-pairs shortest paths in O(n2) time with high probability
Journal of the ACM (JACM)
An efficient algorithm for approximate betweenness centrality computation
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Bi-Objective Bus Routing: An Application to School Buses in Rural Areas
Transportation Science
DACCER: Distributed Assessment of the Closeness CEntrality Ranking in complex networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient algorithms for the all pairs shortest path problem with limited edge costs
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
The weak-heap family of priority queues in theory and praxis
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Capacity-Constrained network-voronoi diagram: a summary of results
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
Finding a smallest odd hole in a claw-free graph using global structure
Discrete Applied Mathematics
Information Sciences: an International Journal
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
Journal of Discrete Algorithms
On the computation of fully proportional representation
Journal of Artificial Intelligence Research
Sharing information for the all pairs shortest path problem
Theoretical Computer Science
A game-theoretic approach to stable routing in max-min fair networks
IEEE/ACM Transactions on Networking (TON)
Aggregate nearest neighbor queries in uncertain graphs
World Wide Web
Journal of Combinatorial Optimization
Measuring similarity of graph nodes by neighbor matching
Intelligent Data Analysis
Faster algorithm to find anti-risk path between two nodes of an undirected graph
Journal of Combinatorial Optimization
Hi-index | 0.04 |
In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated F-heaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. F-heaps support arbitrary deletion from an n-item heap in O(log n) amortized time and all other standard heap operations in O(1) amortized time. Using F-heaps we are able to obtain improved running times for several network optimization algorithms. In particular, we obtain the following worst-case bounds, where n is the number of vertices and m the number of edges in the problem graph:O(n log n + m) for the single-source shortest path problem with nonnegative edge lengths, improved from O(mlog(m/n+2)n);O(n2log n + nm) for the all-pairs shortest path problem, improved from O(nm log(m/n+2)n);O(n2log n + nm) for the assignment problem (weighted bipartite matching), improved from O(nmlog(m/n+2)n);O(m&bgr;(m, n)) for the minimum spanning tree problem, improved from O(mlog log(m/n+2)n); where &bgr;(m, n) = min {i ↿ log(i)n ≤ m/n}. Note that &bgr;(m, n) ≤ log*n if m ≥ n.Of these results, the improved bound for minimum spanning trees is the most striking, although all the results give asymptotic improvements for graphs of appropriate densities.