A Back-to-Basics Empirical Study of Priority Queues

A Combinatorial Problem Which Is Complete in Polynomial Space

article by S. Even & R. E. Tarjan published 1 October 1976 in Journal of the ACM

A Faster Deterministic Maximum Flow Algorithm

A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

article

A Separator Theorem for Planar Graphs

article

A class of algorithms which require nonlinear time to maintain disjoint sets

scholarly article by Robert Tarjan published April 1979 in Journal of Computer and System Sciences

A data structure for dynamic trees

article

A data structure for dynamic trees

A fast algorithm for finding dominators in a flowgraph

A fast las vegas algorithm for triangulating a simple polygon

article

A linear-time algorithm for a special case of disjoint set union

A linear-time algorithm for testing the truth of certain quantified boolean formulas

scientific article (publication date: March 1979)

A locally adaptive data compression scheme

article

A new approach to the maximum flow problem

A new approach to the maximum-flow problem

article

A randomized linear-time algorithm to find minimum spanning trees

article

Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs

Algorithm 447: efficient algorithms for graph manipulation

scientific article (publication date: June 1973)

Algorithms for two bottleneck optimization problems

Amortized Computational Complexity

article

Amortized efficiency of list update and paging rules

article

An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon

article

An Efficient Parallel Biconnectivity Algorithm

article

An interview with the 1986 A. M. Turing Award recipients—John E. Hopcroft and Robert E. Tarjan

scientific article published on 27 July 2002

Applications of Path Compression on Balanced Trees

article

Applications of a Planar Separator Theorem

article

Asymptotically Tight Bounds on Time-Space Trade-offs in a Pebble Game

scientific article published in 1982

Computing an st-numbering

Decomposition by clique separators

article

Depth-First Search and Linear Graph Algorithms

article

Determining whether a groupoid is a group

scientific article

Dividing a Graph into Triconnected Components

scientific article (publication date: September 1973)

Dynamic Perfect Hashing: Upper and Lower Bounds

article

Dynamic trees as search trees via euler tours, applied to the network simplex algorithm

article

Edge-disjoint spanning trees and depth-first search

article

Efficiency of a Good But Not Linear Set Union Algorithm

article

Efficient Planarity Testing

article

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

article

Efficient maximum flow algorithms

article

Enumeration of the Elementary Circuits of a Directed Graph

scientific article published in 1973

Erratum

scholarly article published in Journal of Algorithms

Fast Algorithms for Finding Nearest Common Ancestors

scientific article (publication date: May 1984)

Fast exact and heuristic methods for role minimization problems

scientific article published on 10 June 2008

Fast, Scalable, and Machine-Verified Multicore Disjoint Set Union Data Structures and their Wide Deployment in Parallel Algorithms (Abstract)

scientific article published on 26 July 2024

Faster algorithms for the shortest path problem

article

Faster scaling algorithms for general graph matching problems

scholarly article

Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms

scholarly article

Fibonacci heaps and their uses in improved network optimization algorithms

article

Finding Minimum Spanning Trees

article

Finding Minimum-Cost Circulations by Successive Approximation

scientific article (publication date: August 1990)

Finding a Maximum Independent Set

article

Finding minimum-cost circulations by canceling negative cycles

article

Finding minimum-cost flows by double scaling

article

Gauss codes, planar hamiltonian graphs, and stack-sortable permutations

Hollow Heaps

article

Maintaining bridge-connected and biconnected components on-line

article

Maintenance of a minimum spanning forest in a dynamic plane graph

Making data structures persistent

scientific article (publication date: February 1989)

Making data structures persistent

Planar point location using persistent search trees

article

Polygon triangulation inO(n log logn) time with simple data structures

Prime subprogram parsing of a program

article

RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS

Rank-Pairing Heaps

article

Rectilinear planar layouts and bipolar orientations of planar graphs

article

Rotation Distance, Triangulations, and Hyperbolic Geometry

article

Scaling and related techniques for geometry problems

article

Self-adjusting binary search trees

scientific article (publication date: July 1985)

Sequential access in splay trees takes linear time

Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs

scientific article published in 1984

Soft Heaps Simplified

Sorting Using Networks of Queues and Stacks

article

Strict fibonacci heaps

The Recognition of Series Parallel Digraphs

scientific article (publication date: May 1982)

The pairing heap: A new form of self-adjusting heap

article

Three Partition Refinement Algorithms

article

Time bounds for selection

article

Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs

article

Worst-case Analysis of Set Union Algorithms

article