Self-adjusting binary search trees
Journal of the ACM (JACM)
A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Multicommodity flows in planar undirected graphs and shortest paths
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
An efficient algorithm for the “optimal” stable marriage
Journal of the ACM (JACM)
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Finding minimum-cost circulations by canceling negative cycles
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Forests, frames, and games: algorithms for matroid sums and applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Finding minimum-cost circulations by canceling negative cycles
Journal of the ACM (JACM)
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Dynamic trees and dynamic point location
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Transitions in geometric minimum spanning trees (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A one-way array algorithm for matroid scheduling
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Minimum Spanning Trees of Moving Points in the Plane
IEEE Transactions on Computers
Dynamic expression trees and their applications
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Planar separators and parallel polygon triangulation (preliminary version)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A faster deterministic maximum flow algorithm
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A framework for dynamic graph drawing
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Indexing for data models with constraints and classes (extended abstract)
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A categorized bibliography on incremental computation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dynamic ray shooting and shortest paths via balanced geodesic triangulations
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A theory of parameterized pattern matching: algorithms and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Biased finger trees and three-dimensional layers of maxima: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
An incremental algorithm for maintaining the dominator tree of a reducible flowgraph
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dynamic parallel tree contraction (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Journal of Computer and System Sciences
Alpha-algorithms for incremental planarity testing (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimal evaluation of array expressions on massively parallel machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
An optimal algorithm for closest pair maintenance (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Randomized dynamic graph algorithms with polylogarithmic time per operation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
String matching in Lempel-Ziv compressed strings
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Environmental acquisition: a new inheritance-like abstraction mechanism
Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Minimum cuts in near-linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Proximity problems on moving points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Finding maximum flows in undirected graphs seems easier than bipartite matching
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Implementation of dynamic trees with in-subtree operations
Journal of Experimental Algorithmics (JEA)
Winnowing sequences from a database search
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A data structure for dynamically maintaining rooted trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Average case analysis of dynamic graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
The Suffix of a square matrix, with applications
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Experimental analysis of dynamic minimum spanning tree algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Average case analysis of dynamic geometric optimization
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Clustering for faster network simplex pivots
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Dynamic two-connectivity with backtracking
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic algorithms for chordal graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Incremental algorithms for minimal length paths
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
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
Minimum cuts in near-linear time
Journal of the ACM (JACM)
Near-optimal fully-dynamic graph connectivity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Faster suffix tree construction with missing suffix links
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Efficiency by Incrementalization: An Introduction
Higher-Order and Symbolic Computation
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Heuristics for semi-external depth first search on directed graphs
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Analysis of FPGA/FPIC switch modules
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Dynamic generators of topologically embedded graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Maintaining Center and Median in Dynamic Trees
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
On the Analysis of On-Line Database Reorganization
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Linear-Time Construction of Two-Dimensional Suffix Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Intersecting Red and Blue Line Segments in Optimal Time and Precision
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Dynamic Compressed Hypertoctrees with Application to the N-Body Problem
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Computing the Edit-Distance between Unrooted Ordered Trees
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A Functional Approach to External Graph Algorithms
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Using sparsification for parametric minimum spanning tree problems
Nordic Journal of Computing
Dynamic rectangular intersection with priorities
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Data structures for on-line updating of matroid intersection solutions
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Dynamic Reorganization of Object Databases
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms
Journal of Experimental Algorithmics (JEA)
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms
Journal of Experimental Algorithmics (JEA)
Solving the Convex Cost Integer Dual Network Flow Problem
Management Science
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamizing static algorithms, with applications to dynamic trees and history independence
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for dynamic connectivity
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A generalization of the scaling max-flow algorithm
Computers and Operations Research
Multiple-source shortest paths in planar graphs
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
Maintaining information in fully dynamic trees with top trees
ACM Transactions on Algorithms (TALG)
Design of data structures for mergeable trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An O (n log n) algorithm for maximum st-flow in a directed planar graph
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A subset spanner for Planar graphs,: with application to subset TSP
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Two flow network simplification algorithms
Information Processing Letters
Adaptive functional programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Algorithms (TALG)
Drawing c-planar biconnected clustered graphs
Discrete Applied Mathematics
Near-entropy hotlink assignments
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Balancing applied to maximum network flow problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Free multiflows in bidirected and skew-symmetric graphs
Discrete Applied Mathematics
Matrix scaling by network flow
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic dictionary matching using inverted lists
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
Journal of the ACM (JACM)
Shape matching and modeling using skeletal context
Pattern Recognition
Shape matching and modeling using skeletal context
Pattern Recognition
Using First-Order Logic to Reason about Policies
ACM Transactions on Information and System Security (TISSEC)
Fully dynamic algorithms for chordal graphs and split graphs
ACM Transactions on Algorithms (TALG)
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
I/O Efficient Dynamic Data Structures for Longest Prefix Queries
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Confluently Persistent Tries for Efficient Version Control
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
The Partial Augment---Relabel Algorithm for the Maximum Flow Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Athos: Efficient Authentication of Outsourced File Systems
ISC '08 Proceedings of the 11th international conference on Information Security
Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Self-adjusting computation: (an overview)
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
An algorithm for minimum flows
WSEAS Transactions on Computers
A near-linear time algorithm for constructing a cactus representation of minimum cuts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
An O(n log n) algorithm for maximum st-flow in a directed planar graph
Journal of the ACM (JACM)
Succinct Greedy Graph Drawing in the Hyperbolic Plane
Graph Drawing
The Generalized Stable Allocation Problem
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Decreasing path algorithm for minimum flows: dynamic tree implementations
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Theoretical Computer Science
Efficient algorithms for computing Reeb graphs
Computational Geometry: Theory and Applications
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
Graph partitioning using single commodity flows
Journal of the ACM (JACM)
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
Two-Level Push-Relabel Algorithm for the Maximum Flow Problem
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Journal of Experimental Algorithmics (JEA)
An experimental analysis of self-adjusting computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
An optimal decomposition algorithm for tree edit distance
ACM Transactions on Algorithms (TALG)
Succinct Greedy Geometric Routing in the Euclidean Plane
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A faster algorithm for matching a set of patterns with variable length don't cares
Information Processing Letters
Two flow network simplification algorithms
Information Processing Letters
Maintaining dynamic minimum spanning trees: An experimental study
Discrete Applied Mathematics
Context-similarity based hotlinks assignment: Model, metrics and algorithm
Data & Knowledge Engineering
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Fractal Merkle tree representation and traversal
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Fast reoptimization for the minimum spanning tree problem
Journal of Discrete Algorithms
A dynamic data structure for approximate range searching
Proceedings of the twenty-sixth annual symposium on Computational geometry
A new self-stabilizing minimum spanning tree construction with loop-free property
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Self-adjusting computation with Delta ML
AFP'08 Proceedings of the 6th international conference on Advanced functional programming
Maximum flows and parametric shortest paths in planar graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
Data structures for mergeable trees
ACM Transactions on Algorithms (TALG)
Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Efficient distributed communication in ad-hoc radio networks
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Computing the girth of a planar graph in linear time
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Path minima queries in dynamic weighted trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
ESA'11 Proceedings of the 19th European conference on Algorithms
Maximum flows by incremental breadth-first search
ESA'11 Proceedings of the 19th European conference on Algorithms
Shortest path based planar graph cuts for bi-layer segmentation of binocular stereo video
ACCV'10 Proceedings of the 2010 international conference on Computer vision - Volume part II
Adaptive Exact Inference in Graphical Models
The Journal of Machine Learning Research
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Price roll-backs and path auctions: an approximation scheme for computing the market equilibrium
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Single source distance oracle for planar digraphs avoiding a failed node or link
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Algorithms for the transportation problem in geometric settings
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
RTED: a robust algorithm for the tree edit distance
Proceedings of the VLDB Endowment
Properties of Gomory-Hu co-cycle bases
Theoretical Computer Science
Efficient algorithms for simplifying flow networks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Minimum cuts and shortest non-separating cycles via homology covers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Computing replacement paths in surface embedded graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
General compact labeling schemes for dynamic trees
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Dinitz' algorithm: the original version and even's version
Theoretical Computer Science
Data structures for halfplane proximity queries and incremental voronoi diagrams
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Journal of Graph Theory
A deterministic o(m log m) time algorithm for the reeb graph
Proceedings of the twenty-eighth annual symposium on Computational geometry
A new Karzanov-type O(n3) max-flow algorithm
Mathematical and Computer Modelling: An International Journal
Research paper: The saga of minimum spanning trees
Computer Science Review
A simple version of Karzanov's blocking flow algorithm
Operations Research Letters
On finding the K best cuts in a network
Operations Research Letters
A simple version of Karzanov's blocking flow algorithm
Operations Research Letters
New labeling procedures for the basis graph in generalized networks
Operations Research Letters
An O(m(m+nlogn)log(nC)) -time algorithm to solve the minimum cost tension problem
Theoretical Computer Science
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
SIAM Journal on Computing
Link-state routing with hop-by-hop forwarding can achieve optimal traffic engineering
IEEE/ACM Transactions on Networking (TON)
Local exact pattern matching for non-fixed RNA structures
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Kinetic pie delaunay graph and its applications
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Compact separator decompositions in dynamic trees and applications to labeling schemes
DISC'07 Proceedings of the 21st international conference on Distributed Computing
An improved algorithm for tree edit distance incorporating structural linearity
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Graph drawing in the cloud: privately visualizing relational data using small working storage
GD'12 Proceedings of the 20th international conference on Graph Drawing
An overview of algorithms for network survivability
ISRN Communications and Networking
Structured recursive separator decompositions for planar graphs in linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A new approach to computing maximum flows using electrical flows
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Max flows in O(nm) time, or better
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
Formal Methods in System Design
Output-sensitive well-separated pair decompositions for dynamic point sets
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Reoptimization of maximum weight induced hereditary subgraph problems
Theoretical Computer Science
Journal of Combinatorial Optimization
| Hi-index | 0.01 |