| Publication | Date of Publication | Type |
|---|
| Analysis of smooth heaps and slim heaps | 2026-05-12 | Paper |
Zip-zip trees: making zip trees more balanced, biased, compact, or persistent
Algorithmica | 2026-05-08 | Paper |
Efficiency of self-adjusting heaps
ACM Transactions on Algorithms | 2025-11-03 | Paper |
Strict Fibonacci heaps
ACM Transactions on Algorithms | 2025-07-22 | Paper |
| A weight-scaling algorithm for min-cost imperfect matchings in bipartite graphs | 2025-05-05 | Paper |
| Optimal energetic paths for electric cars | 2025-01-06 | Paper |
Optimal resizable arrays
SIAM Journal on Computing | 2024-10-21 | Paper |
| Simple concurrent labeling algorithms for connected components | 2024-08-26 | Paper |
| Simulating a stack using queues | 2024-07-19 | Paper |
Finding strong components using depth-first search
European Journal of Combinatorics | 2024-06-28 | Paper |
| Minimum-cost paths for electric cars | 2024-05-29 | Paper |
| A nearly-tight analysis of multipass pairing heaps | 2024-05-14 | Paper |
| A tight analysis of slim heaps and smooth heaps | 2024-05-14 | Paper |
| An auction algorithm for bipartite matching in streaming and massively parallel computation models | 2024-05-14 | Paper |
| Optimal resizable arrays | 2024-05-14 | Paper |
Zip-zip trees: making zip trees more balanced, biased, compact, or persistent
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Simple confluently persistent catenable lists
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Zip Trees
ACM Transactions on Algorithms | 2022-02-22 | Paper |
Concurrent disjoint set union
Distributed Computing | 2022-01-04 | Paper |
Isomorphism of planar graphs (working paper)
Complexity of Computer Computations | 2021-07-06 | Paper |
Randomized Concurrent Set Union and Generalized Wake-Up
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Splaying preorders and postorders
(available as arXiv preprint) | 2020-01-16 | Paper |
Zip trees
(available as arXiv preprint) | 2020-01-16 | Paper |
A new path from Splay to dynamic optimality
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
A Back-to-Basics Empirical Study of Priority Queues
2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
An experimental study of minimum mean cycle algorithms
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Shortest path feasibility algorithms: an experimental evaluation
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM | 2019-07-19 | Paper |
Disjoint set union with randomized linking
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Better approximation algorithms for the graph diameter
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Hollow heaps
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Addendum to “Dominator Tree Certification and Divergent Spanning Trees”
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Thin heaps, thick heaps
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Deletion without rebalancing in binary search trees
ACM Transactions on Algorithms | 2018-11-05 | Paper |
A new approach to incremental cycle detection and related problems
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Dominator tree certification and divergent spanning trees
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Rank-Balanced Trees
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Minimum-cost flows in unit-capacity networks
Theory of Computing Systems | 2018-02-01 | Paper |
A randomized concurrent algorithm for disjoint set union
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| Minimum cost flows in graphs with unit capacities | 2017-01-24 | Paper |
Unique maximum matching algorithms
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
A randomized linear-time algorithm for finding minimum spanning trees (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Amortized rotation cost in AVL trees
Information Processing Letters | 2016-03-01 | Paper |
Faster and more dynamic maximum flow by incremental breadth-first search
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Hollow Heaps
Automata, Languages, and Programming | 2015-10-27 | Paper |
Deletion without rebalancing in multiway search trees
ACM Transactions on Database Systems | 2015-09-03 | Paper |
Melding priority queues
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| scientific article; zbMATH DE number 6472609 (Why is no real title available?) | 2015-08-14 | Paper |
| Finding dominators revisited (extended abstract) | 2015-08-03 | Paper |
The CB tree: a practical concurrent self-adjusting search tree
Distributed Computing | 2015-02-23 | Paper |
| Dominator tree verification and vertex-disjoint paths | 2014-10-13 | Paper |
| Self-adjusting top trees | 2014-10-13 | Paper |
Nested set union
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Incremental cycle detection, topological ordering, and strong component maintenance
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Data structures for mergeable trees
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Finding dominators via disjoint set union
Journal of Discrete Algorithms | 2014-08-13 | Paper |
| Deletion without rebalancing in balanced binary trees | 2014-05-22 | Paper |
Strict Fibonacci heaps
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Shortest-path feasibility algorithms, an experimental evaluation
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Dynamic trees in practice
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
A representation for linear lists with movable fingers
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 2014-03-14 | Paper |
Soft heaps simplified
SIAM Journal on Computing | 2013-11-14 | Paper |
Dominators, directed bipolar orders, and independent spanning trees
Automata, Languages, and Programming | 2013-08-12 | Paper |
Planarity algorithms via PQ-trees (extended abstract)
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
CBTree: a practical concurrent self-adjusting search tree
Lecture Notes in Computer Science | 2013-03-13 | Paper |
An optimal dynamic data structure for stabbing-semigroup queries
SIAM Journal on Computing | 2012-05-30 | Paper |
Rank-pairing heaps
SIAM Journal on Computing | 2012-03-15 | Paper |
Maximum flows by incremental breadth-first search
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Finding strongly knit clusters in social networks
Internet Mathematics | 2011-02-28 | Paper |
Dynamic rectangular intersection with priorities
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Design of data structures for mergeable trees
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Meldable heaps and boolean union-find
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Deletion without rebalancing in multiway search trees
Algorithms and Computation | 2009-12-17 | Paper |
Notes on introductory combinatorics
Modern Birkhäuser Classics | 2009-10-29 | Paper |
Rank-Pairing Heaps
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Rank-Balanced Trees
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
SIAM Journal on Computing | 2009-08-20 | Paper |
Efficiently Generating k-Best Solutions to Procurement Auctions
Algorithmic Aspects in Information and Management | 2009-07-02 | Paper |
Finding a feasible flow in a strongly connected network
Operations Research Letters | 2009-03-04 | Paper |
Reachability Problems on Directed Graphs
Algorithms and Computation | 2009-01-29 | Paper |
Finding Dominators in Practice
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Finding Dominators in Practice
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Faster Algorithms for Incremental Topological Ordering
Automata, Languages and Programming | 2008-08-28 | Paper |
Clustering Social Networks
Algorithms and Models for the Web-Graph | 2008-04-11 | Paper |
Server allocation algorithms for tiered systems
Algorithmica | 2007-10-10 | Paper |
| Problems in data structures and algorithms | 2006-03-09 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Graph Clustering and Minimum Cut Trees
Internet Mathematics | 2005-05-03 | Paper |
Purely functional, real-time deques with catenation
Journal of the ACM | 2005-01-25 | Paper |
| scientific article; zbMATH DE number 2119640 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2087915 (Why is no real title available?) | 2004-08-11 | Paper |
Unique maximum matching algorithms
Journal of Algorithms | 2002-04-08 | Paper |
| Faster kinetic heaps and their use in broadcast scheduling. (Extended abstract) | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1263185 (Why is no real title available?) | 2002-01-27 | Paper |
Simple Confluently Persistent Catenable Lists
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 744105 (Why is no real title available?) | 2000-07-06 | Paper |
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
SIAM Journal on Computing | 2000-03-19 | Paper |
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1256736 (Why is no real title available?) | 1999-10-04 | Paper |
| scientific article; zbMATH DE number 1256639 (Why is no real title available?) | 1999-04-22 | Paper |
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM | 1998-02-02 | Paper |
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
Mathematical Programming. Series A. Series B | 1997-11-25 | Paper |
Dominating sets in planar graphs
European Journal of Combinatorics | 1997-05-19 | Paper |
Optimal parallel verification of minimum spanning trees in logarithmic time
Algorithmica | 1997-01-22 | Paper |
Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues
SIAM Journal on Computing | 1996-09-15 | Paper |
Computing Minimal Spanning Subgraphs in Linear Time
SIAM Journal on Computing | 1996-07-14 | Paper |
Improved Algorithms for Bipartite Network Flow
SIAM Journal on Computing | 1996-07-04 | Paper |
Confluently Persistent Deques via Data-Structural Bootstrapping
Journal of Algorithms | 1996-03-18 | Paper |
| scientific article; zbMATH DE number 811823 (Why is no real title available?) | 1995-11-01 | Paper |
Lazy structure sharing for query optimization
Acta Informatica | 1995-06-21 | Paper |
| scientific article; zbMATH DE number 742959 (Why is no real title available?) | 1995-04-11 | Paper |
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing | 1994-10-17 | Paper |
Faster scaling algorithms for general graph matching problems
Journal of the ACM | 1994-10-06 | Paper |
| scientific article; zbMATH DE number 619546 (Why is no real title available?) | 1994-09-13 | Paper |
Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences
SIAM Journal on Computing | 1994-03-27 | Paper |
An O(m\log n)-Time Algorithm for the Maximal Planar Subgraph Problem
SIAM Journal on Computing | 1994-02-07 | Paper |
Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network
Journal of Algorithms | 1994-01-13 | Paper |
| scientific article; zbMATH DE number 432745 (Why is no real title available?) | 1994-01-02 | Paper |
| scientific article; zbMATH DE number 437540 (Why is no real title available?) | 1993-12-15 | Paper |
| scientific article; zbMATH DE number 432809 (Why is no real title available?) | 1993-10-20 | Paper |
More efficient bottom-up multi-pattern matching in trees
Theoretical Computer Science | 1993-10-17 | Paper |
ERRATUM: "RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS"
International Journal of Computational Geometry & Applications | 1993-04-01 | Paper |
Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
SIAM Journal on Computing | 1993-03-09 | Paper |
| scientific article; zbMATH DE number 125882 (Why is no real title available?) | 1993-02-21 | Paper |
RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS
International Journal of Computational Geometry & Applications | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 65738 (Why is no real title available?) | 1992-09-27 | Paper |
Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures
Discrete & Computational Geometry | 1992-09-26 | Paper |
Maintenance of a minimum spanning forest in a dynamic plane graph
Journal of Algorithms | 1992-06-28 | Paper |
Finding minimum-cost flows by double scaling
Mathematical Programming. Series A. Series B | 1992-06-28 | Paper |
Maintaining bridge-connected and biconnected components on-line
Algorithmica | 1992-06-28 | Paper |
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
Mathematical Programming. Series A. Series B | 1992-06-25 | Paper |
Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
Mathematics of Operations Research | 1992-06-25 | Paper |
Faster parametric shortest path and minimum‐balance algorithms
Networks | 1991-01-01 | Paper |
Transitive compaction in parallel via branchings
Journal of Algorithms | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4204092 (Why is no real title available?) | 1990-01-01 | Paper |
Faster algorithms for the shortest path problem
Journal of the ACM | 1990-01-01 | Paper |
Simplified linear-time Jordan sorting and polygon clipping
Information Processing Letters | 1990-01-01 | Paper |
Finding Minimum-Cost Circulations by Successive Approximation
Mathematics of Operations Research | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4211552 (Why is no real title available?) | 1989-01-01 | Paper |
Faster Scaling Algorithms for Network Problems
SIAM Journal on Computing | 1989-01-01 | Paper |
A Fast Parametric Maximum Flow Algorithm and Applications
SIAM Journal on Computing | 1989-01-01 | Paper |
Finding minimum-cost circulations by canceling negative cycles
Journal of the ACM | 1989-01-01 | Paper |
Improved Time Bounds for the Maximum Flow Problem
SIAM Journal on Computing | 1989-01-01 | Paper |
Amortized Analysis of Algorithms for Set Union with Backtracking
SIAM Journal on Computing | 1989-01-01 | Paper |
A parallel algorithm for finding a blocking flow in an acyclic network
Information Processing Letters | 1989-01-01 | Paper |
A fast Las Vegas algorithm for triangulating a simple polygon
Discrete & Computational Geometry | 1989-01-01 | Paper |
A new approach to the maximum-flow problem
Journal of the ACM | 1988-01-01 | Paper |
An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon
SIAM Journal on Computing | 1988-01-01 | Paper |
A linear-time algorithm for finding a minimum spanning pseudoforest
Information Processing Letters | 1988-01-01 | Paper |
Erratum: An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon
SIAM Journal on Computing | 1988-01-01 | Paper |
One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
Mathematics of Operations Research | 1988-01-01 | Paper |
Algorithms for two bottleneck optimization problems
Journal of Algorithms | 1988-01-01 | Paper |
The analysis of a nested dissection algorithm
Numerische Mathematik | 1987-01-01 | Paper |
Three Partition Refinement Algorithms
SIAM Journal on Computing | 1987-01-01 | Paper |
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
Algorithmica | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3949734 (Why is no real title available?) | 1986-01-01 | Paper |
Self-Adjusting Heaps
SIAM Journal on Computing | 1986-01-01 | Paper |
Rectilinear planar layouts and bipolar orientations of planar graphs
Discrete & Computational Geometry | 1986-01-01 | Paper |
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
Combinatorica | 1986-01-01 | Paper |
Sorting jordan sequences in linear time using level-linked search trees
Information and Control | 1986-01-01 | Paper |
Algorithms for maximum network flow
Mathematical Programming Studies | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3937196 (Why is no real title available?) | 1985-01-01 | Paper |
Self-adjusting binary search trees
Journal of the ACM | 1985-01-01 | Paper |
An Efficient Parallel Biconnectivity Algorithm
SIAM Journal on Computing | 1985-01-01 | Paper |
Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
SIAM Journal on Computing | 1985-01-01 | Paper |
Decomposition by clique separators
Discrete Mathematics | 1985-01-01 | Paper |
Strongly connected orientations of mixed multigraphs
Networks | 1985-01-01 | Paper |
A linear-time algorithm for a special case of disjoint set union
Journal of Computer and System Sciences | 1985-01-01 | Paper |
A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
Mathematics of Operations Research | 1985-01-01 | Paper |
A linear time solution to the single function coarsest partition problem
Theoretical Computer Science | 1985-01-01 | Paper |
Amortized Computational Complexity
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
Sequential access in splay trees takes linear time
Combinatorica | 1985-01-01 | Paper |
Coding Strings by Pairs of Strings
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3900567 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3883625 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3900543 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3900790 (Why is no real title available?) | 1984-01-01 | Paper |
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
SIAM Journal on Computing | 1984-01-01 | Paper |
Worst-case Analysis of Set Union Algorithms
Journal of the ACM | 1984-01-01 | Paper |
Fast Algorithms for Finding Nearest Common Ancestors
SIAM Journal on Computing | 1984-01-01 | Paper |
A quick method for finding shortest pairs of disjoint paths
Networks | 1984-01-01 | Paper |
Efficient algorithms for a family of matroid intersection problems
Journal of Algorithms | 1984-01-01 | Paper |
A separator theorem for graphs of bounded genus
Journal of Algorithms | 1984-01-01 | Paper |
Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
Journal of Algorithms | 1984-01-01 | Paper |
A simple version of Karzanov's blocking flow algorithm
Operations Research Letters | 1984-01-01 | Paper |
Input-output decomposition of dynamic systems is NP-complete
IEEE Transactions on Automatic Control | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3936534 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 4027472 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3861050 (Why is no real title available?) | 1983-01-01 | Paper |
Updating a balanced search tree in 0(1) rotations
Information Processing Letters | 1983-01-01 | Paper |
Space-Efficient Implementations of Graph Search Methods
ACM Transactions on Mathematical Software | 1983-01-01 | Paper |
An improved algorithm for hierarchical clustering using strong components
Information Processing Letters | 1983-01-01 | Paper |
Scheduling Opposing Forests
SIAM Journal on Algebraic Discrete Methods | 1983-01-01 | Paper |
The Recognition of Series Parallel Digraphs
SIAM Journal on Computing | 1982-01-01 | Paper |
Asymptotically tight bounds on time-space trade-offs in a pebble game
Journal of the ACM | 1982-01-01 | Paper |
Symbolic Program Analysis in Almost-Linear Time
SIAM Journal on Computing | 1982-01-01 | Paper |
Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
SIAM Journal on Computing | 1981-01-01 | Paper |
On a Greedy Heuristic for Complete Matching
SIAM Journal on Computing | 1981-01-01 | Paper |
Fast Algorithms for Solving Path Problems
Journal of the ACM | 1981-01-01 | Paper |
A Unified Approach to Path Problems
Journal of the ACM | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3713181 (Why is no real title available?) | 1980-01-01 | Paper |
Applications of a Planar Separator Theorem
SIAM Journal on Computing | 1980-01-01 | Paper |
Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
SIAM Journal on Computing | 1980-01-01 | Paper |
Variations on the Common Subexpression Problem
Journal of the ACM | 1980-01-01 | Paper |
Design and Analysis of a Data Structure for Representing Sorted Lists
SIAM Journal on Computing | 1980-01-01 | Paper |
The space complexity of pebble games on trees
Information Processing Letters | 1980-01-01 | Paper |
The Pebbling Problem is Complete in Polynomial Space
SIAM Journal on Computing | 1980-01-01 | Paper |
Linear expected-time algorithms for connectivity problems
Journal of Algorithms | 1980-01-01 | Paper |
Generalized Nested Dissection
SIAM Journal on Numerical Analysis | 1979-01-01 | Paper |
A Fast Merging Algorithm
Journal of the ACM | 1979-01-01 | Paper |
A linear-time algorithm for testing the truth of certain quantified Boolean formulas
Information Processing Letters | 1979-01-01 | Paper |
Applications of Path Compression on Balanced Trees
Journal of the ACM | 1979-01-01 | Paper |
A Separator Theorem for Planar Graphs
SIAM Journal on Applied Mathematics | 1979-01-01 | Paper |
Storing a sparse table
Communications of the ACM | 1979-01-01 | Paper |
A class of algorithms which require nonlinear time to maintain disjoint sets
Journal of Computer and System Sciences | 1979-01-01 | Paper |
A fast algorithm for finding dominators in a flowgraph
ACM Transactions on Programming Languages and Systems | 1979-01-01 | Paper |
Complexity of Monotone Networks for Computing Conjunctions
Algorithmic Aspects of Combinatorics | 1978-01-01 | Paper |
Algorithmic Aspects of Vertex Elimination on Directed Graphs
SIAM Journal on Applied Mathematics | 1978-01-01 | Paper |
Triangulating a simple polygon
Information Processing Letters | 1978-01-01 | Paper |
A linear-time algorithm for finding all feedback vertices
Information Processing Letters | 1978-01-01 | Paper |
Complexity of Combinatorial Algorithms
SIAM Review | 1978-01-01 | Paper |
Time-space trade-offs in a pebble game
Acta Informatica | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3648730 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3565023 (Why is no real title available?) | 1977-01-01 | Paper |
Finding a Maximum Independent Set
SIAM Journal on Computing | 1977-01-01 | Paper |
Finding optimum branchings
Networks | 1977-01-01 | Paper |
Space bounds for a game on graphs
Mathematical Systems Theory | 1977-01-01 | Paper |
Correction to “Space Bounds for a Game on Graphs” by Wolfgang J. Paul, Robert Endre Tarjan and James R. Celoni
Mathematical Systems Theory | 1977-01-01 | Paper |
Lower bounds on the lengths of node sequences in directed graphs
Discrete Mathematics | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3541864 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3568726 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3574953 (Why is no real title available?) | 1976-01-01 | Paper |
The Planar Hamiltonian Circuit Problem is NP-Complete
SIAM Journal on Computing | 1976-01-01 | Paper |
Algorithmic Aspects of Vertex Elimination on Graphs
SIAM Journal on Computing | 1976-01-01 | Paper |
A Combinatorial Problem Which Is Complete in Polynomial Space
Journal of the ACM | 1976-01-01 | Paper |
Augmentation Problems
SIAM Journal on Computing | 1976-01-01 | Paper |
Finding Minimum Spanning Trees
SIAM Journal on Computing | 1976-01-01 | Paper |
<i>b</i>-Matchings in Trees
SIAM Journal on Computing | 1976-01-01 | Paper |
Edge-disjoint spanning trees and depth-first search
Acta Informatica | 1976-01-01 | Paper |
Computing an st-numbering
Theoretical Computer Science | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3593613 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3513809 (Why is no real title available?) | 1975-01-01 | Paper |
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM | 1975-01-01 | Paper |
Network Flow and Testing Graph Connectivity
SIAM Journal on Computing | 1975-01-01 | Paper |
Optimal chain partitions of trees
Information Processing Letters | 1975-01-01 | Paper |
Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
Networks | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3636069 (Why is no real title available?) | 1974-01-01 | Paper |
A note on finding the bridges of a graph
Information Processing Letters | 1974-01-01 | Paper |
Efficient Planarity Testing
Journal of the ACM | 1974-01-01 | Paper |
Finding Dominators in Directed Graphs
SIAM Journal on Computing | 1974-01-01 | Paper |
A good algorithm for edge-disjoint branching
Information Processing Letters | 1974-01-01 | Paper |
A new algorithm for finding weak components
Information Processing Letters | 1974-01-01 | Paper |
Testing flow graph reducibility
Journal of Computer and System Sciences | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3480088 (Why is no real title available?) | 1973-01-01 | Paper |
Dividing a Graph into Triconnected Components
SIAM Journal on Computing | 1973-01-01 | Paper |
Enumeration of the Elementary Circuits of a Directed Graph
SIAM Journal on Computing | 1973-01-01 | Paper |
Time bounds for selection
Journal of Computer and System Sciences | 1973-01-01 | Paper |
A V log V algorithm for isomorphism of triconnected planar graphs
Journal of Computer and System Sciences | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3679848 (Why is no real title available?) | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3551902 (Why is no real title available?) | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3400905 (Why is no real title available?) | 1972-01-01 | Paper |
Depth-First Search and Linear Graph Algorithms
SIAM Journal on Computing | 1972-01-01 | Paper |
Sorting Using Networks of Queues and Stacks
Journal of the ACM | 1972-01-01 | Paper |
Determining whether a groupoid is a group
Information Processing Letters | 1972-01-01 | Paper |
A\,V^ 2 algorithm for determining isomorphism of planar graphs
Information Processing Letters | 1971-01-01 | Paper |
