| Publication | Date of Publication | Type |
|---|
| Optimal energetic paths for electric cars | 2025-01-06 | Paper |
| Optimal resizable arrays | 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 | 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 | 2024-01-16 | Paper |
| Simple confluently persistent catenable lists | 2022-12-09 | Paper |
| Zip Trees | 2022-02-22 | Paper |
| Concurrent disjoint set union | 2022-01-04 | Paper |
| Isomorphism of Planar Graphs (Working Paper) | 2021-07-06 | Paper |
| Randomized Concurrent Set Union and Generalized Wake-Up | 2021-01-20 | Paper |
| Splaying preorders and postorders | 2020-01-16 | Paper |
| Zip trees | 2020-01-16 | Paper |
| A New Path from Splay to Dynamic Optimality | 2019-10-15 | Paper |
| A Back-to-Basics Empirical Study of Priority Queues | 2019-09-12 | Paper |
| An Experimental Study of Minimum Mean Cycle Algorithms | 2019-09-11 | Paper |
| Shortest Path Feasibility Algorithms: An Experimental Evaluation | 2019-09-11 | Paper |
| Fibonacci heaps and their uses in improved network optimization algorithms | 2019-07-19 | Paper |
| Disjoint Set Union with Randomized Linking | 2019-06-20 | Paper |
| Better Approximation Algorithms for the Graph Diameter | 2019-06-20 | Paper |
| Hollow Heaps | 2018-11-12 | Paper |
| Addendum to “Dominator Tree Certification and Divergent Spanning Trees” | 2018-11-05 | Paper |
| Thin heaps, thick heaps | 2018-11-05 | Paper |
| Deletion Without Rebalancing in Binary Search Trees | 2018-11-05 | Paper |
| A New Approach to Incremental Cycle Detection and Related Problems | 2018-10-30 | Paper |
| Dominator Tree Certification and Divergent Spanning Trees | 2018-10-30 | Paper |
| Rank-Balanced Trees | 2018-10-30 | Paper |
| Minimum-cost flows in unit-capacity networks | 2018-02-01 | Paper |
| A Randomized Concurrent Algorithm for Disjoint Set Union | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2955012 | 2017-01-24 | Paper |
| Unique maximum matching algorithms | 2016-09-29 | Paper |
| A randomized linear-time algorithm for finding minimum spanning trees (extended abstract) | 2016-09-01 | Paper |
| Amortized rotation cost in AVL trees | 2016-03-01 | Paper |
| Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search | 2015-11-19 | Paper |
| Hollow Heaps | 2015-10-27 | Paper |
| Deletion without rebalancing in multiway search trees | 2015-09-03 | Paper |
| Melding priority queues | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501812 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501349 | 2015-08-03 | Paper |
| The CB tree: a practical concurrent self-adjusting search tree | 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 | 2014-10-08 | Paper |
| Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance | 2014-09-09 | Paper |
| Data structures for mergeable trees | 2014-09-09 | Paper |
| Finding dominators via disjoint set union | 2014-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417725 | 2014-05-22 | Paper |
| Strict fibonacci heaps | 2014-05-13 | Paper |
| Shortest-path feasibility algorithms | 2014-04-01 | Paper |
| Dynamic trees in practice | 2014-04-01 | Paper |
| A representation for linear lists with movable fingers | 2014-03-14 | Paper |
| Soft heaps simplified | 2013-11-14 | Paper |
| Dominators, Directed Bipolar Orders, and Independent Spanning Trees | 2013-08-12 | Paper |
| Planarity Algorithms via PQ-Trees (Extended Abstract) | 2013-06-28 | Paper |
| CBTree: A Practical Concurrent Self-Adjusting Search Tree | 2013-03-13 | Paper |
| An optimal dynamic data structure for stabbing-semigroup queries | 2012-05-30 | Paper |
| Rank-Pairing Heaps | 2012-03-15 | Paper |
| Maximum Flows by Incremental Breadth-First Search | 2011-09-16 | Paper |
| Finding strongly knit clusters in social networks | 2011-02-28 | Paper |
| Dynamic rectangular intersection with priorities | 2010-08-16 | Paper |
| Design of data structures for mergeable trees | 2010-08-16 | Paper |
| Meldable heaps and boolean union-find | 2010-08-05 | Paper |
| Deletion without rebalancing in multiway search trees | 2009-12-17 | Paper |
| Notes on introductory combinatorics | 2009-10-29 | Paper |
| Rank-Pairing Heaps | 2009-10-29 | Paper |
| Rank-Balanced Trees | 2009-10-20 | Paper |
| Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems | 2009-08-20 | Paper |
| Efficiently Generating k-Best Solutions to Procurement Auctions | 2009-07-02 | Paper |
| Finding a feasible flow in a strongly connected network | 2009-03-04 | Paper |
| Reachability Problems on Directed Graphs | 2009-01-29 | Paper |
| Finding Dominators in Practice | 2009-01-19 | Paper |
| Faster Algorithms for Incremental Topological Ordering | 2008-08-28 | Paper |
| Clustering Social Networks | 2008-04-11 | Paper |
| Server allocation algorithms for tiered systems | 2007-10-10 | Paper |
| Problems in data structures and algorithms | 2006-03-09 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Graph Clustering and Minimum Cut Trees | 2005-05-03 | Paper |
| Purely functional, real-time deques with catenation | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828911 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738945 | 2004-08-11 | Paper |
| Unique maximum matching algorithms | 2002-04-08 | Paper |
| Faster kinetic heaps and their use in broadcast scheduling. (Extended abstract) | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234055 | 2002-01-27 | Paper |
| Simple Confluently Persistent Catenable Lists | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763619 | 2000-07-06 | Paper |
| A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals | 2000-03-19 | Paper |
| Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228472 | 1999-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230325 | 1999-04-22 | Paper |
| A randomized linear-time algorithm to find minimum spanning trees | 1998-02-02 | Paper |
| Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm | 1997-11-25 | Paper |
| Dominating sets in planar graphs | 1997-05-19 | Paper |
| Optimal parallel verification of minimum spanning trees in logarithmic time | 1997-01-22 | Paper |
| Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues | 1996-09-15 | Paper |
| Computing Minimal Spanning Subgraphs in Linear Time | 1996-07-14 | Paper |
| Improved Algorithms for Bipartite Network Flow | 1996-07-04 | Paper |
| Confluently Persistent Deques via Data-Structural Bootstrapping | 1996-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4853487 | 1995-11-01 | Paper |
| Lazy structure sharing for query optimization | 1995-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763401 | 1995-04-11 | Paper |
| Dynamic Perfect Hashing: Upper and Lower Bounds | 1994-10-17 | Paper |
| Faster scaling algorithms for general graph matching problems | 1994-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4302465 | 1994-09-13 | Paper |
| Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences | 1994-03-27 | Paper |
| An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem | 1994-02-07 | Paper |
| Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network | 1994-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138871 | 1994-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140416 | 1993-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138943 | 1993-10-20 | Paper |
| More efficient bottom-up multi-pattern matching in trees | 1993-10-17 | Paper |
| ERRATUM: "RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS" | 1993-04-01 | Paper |
| Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time | 1993-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4027620 | 1993-02-21 | Paper |
| RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010349 | 1992-09-27 | Paper |
| Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures | 1992-09-26 | Paper |
| Maintenance of a minimum spanning forest in a dynamic plane graph | 1992-06-28 | Paper |
| Finding minimum-cost flows by double scaling | 1992-06-28 | Paper |
| Maintaining bridge-connected and biconnected components on-line | 1992-06-28 | Paper |
| Use of dynamic trees in a network simplex algorithm for the maximum flow problem | 1992-06-25 | Paper |
| Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem | 1992-06-25 | Paper |
| Faster parametric shortest path and minimum‐balance algorithms | 1991-01-01 | Paper |
| Transitive compaction in parallel via branchings | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3352816 | 1990-01-01 | Paper |
| Finding Minimum-Cost Circulations by Successive Approximation | 1990-01-01 | Paper |
| Faster algorithms for the shortest path problem | 1990-01-01 | Paper |
| Simplified linear-time Jordan sorting and polygon clipping | 1990-01-01 | Paper |
| Faster Scaling Algorithms for Network Problems | 1989-01-01 | Paper |
| A Fast Parametric Maximum Flow Algorithm and Applications | 1989-01-01 | Paper |
| Finding minimum-cost circulations by canceling negative cycles | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3358267 | 1989-01-01 | Paper |
| Improved Time Bounds for the Maximum Flow Problem | 1989-01-01 | Paper |
| A fast Las Vegas algorithm for triangulating a simple polygon | 1989-01-01 | Paper |
| Amortized Analysis of Algorithms for Set Union with Backtracking | 1989-01-01 | Paper |
| A parallel algorithm for finding a blocking flow in an acyclic network | 1989-01-01 | Paper |
| A new approach to the maximum-flow problem | 1988-01-01 | Paper |
| One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties | 1988-01-01 | Paper |
| Algorithms for two bottleneck optimization problems | 1988-01-01 | Paper |
| An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon | 1988-01-01 | Paper |
| A linear-time algorithm for finding a minimum spanning pseudoforest | 1988-01-01 | Paper |
| Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon | 1988-01-01 | Paper |
| The analysis of a nested dissection algorithm | 1987-01-01 | Paper |
| Three Partition Refinement Algorithms | 1987-01-01 | Paper |
| Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons | 1987-01-01 | Paper |
| Rectilinear planar layouts and bipolar orientations of planar graphs | 1986-01-01 | Paper |
| Self-Adjusting Heaps | 1986-01-01 | Paper |
| Efficient algorithms for finding minimum spanning trees in undirected and directed graphs | 1986-01-01 | Paper |
| Sorting jordan sequences in linear time using level-linked search trees | 1986-01-01 | Paper |
| Algorithms for maximum network flow | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3719851 | 1986-01-01 | Paper |
| Decomposition by clique separators | 1985-01-01 | Paper |
| Strongly connected orientations of mixed multigraphs | 1985-01-01 | Paper |
| A linear-time algorithm for a special case of disjoint set union | 1985-01-01 | Paper |
| Self-adjusting binary search trees | 1985-01-01 | Paper |
| An Efficient Parallel Biconnectivity Algorithm | 1985-01-01 | Paper |
| A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees | 1985-01-01 | Paper |
| Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs | 1985-01-01 | Paper |
| A linear time solution to the single function coarsest partition problem | 1985-01-01 | Paper |
| Amortized Computational Complexity | 1985-01-01 | Paper |
| Sequential access in splay trees takes linear time | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3710540 | 1985-01-01 | Paper |
| Coding Strings by Pairs of Strings | 1985-01-01 | Paper |
| Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs | 1984-01-01 | Paper |
| Worst-case Analysis of Set Union Algorithms | 1984-01-01 | Paper |
| Fast Algorithms for Finding Nearest Common Ancestors | 1984-01-01 | Paper |
| A quick method for finding shortest pairs of disjoint paths | 1984-01-01 | Paper |
| Efficient algorithms for a family of matroid intersection problems | 1984-01-01 | Paper |
| A separator theorem for graphs of bounded genus | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3679010 | 1984-01-01 | Paper |
| Gauss codes, planar hamiltonian graphs, and stack-sortable permutations | 1984-01-01 | Paper |
| A simple version of Karzanov's blocking flow algorithm | 1984-01-01 | Paper |
| Input-output decomposition of dynamic systems is NP-complete | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217616 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3678992 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3679216 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3707420 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3768905 | 1983-01-01 | Paper |
| Updating a balanced search tree in 0(1) rotations | 1983-01-01 | Paper |
| Scheduling Opposing Forests | 1983-01-01 | Paper |
| Space-Efficient Implementations of Graph Search Methods | 1983-01-01 | Paper |
| An improved algorithm for hierarchical clustering using strong components | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3329369 | 1983-01-01 | Paper |
| The Recognition of Series Parallel Digraphs | 1982-01-01 | Paper |
| Asymptotically tight bounds on time-space trade-offs in a pebble game | 1982-01-01 | Paper |
| Symbolic Program Analysis in Almost-Linear Time | 1982-01-01 | Paper |
| Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines | 1981-01-01 | Paper |
| On a Greedy Heuristic for Complete Matching | 1981-01-01 | Paper |
| Fast Algorithms for Solving Path Problems | 1981-01-01 | Paper |
| A Unified Approach to Path Problems | 1981-01-01 | Paper |
| Applications of a Planar Separator Theorem | 1980-01-01 | Paper |
| Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms | 1980-01-01 | Paper |
| Variations on the Common Subexpression Problem | 1980-01-01 | Paper |
| Design and Analysis of a Data Structure for Representing Sorted Lists | 1980-01-01 | Paper |
| The space complexity of pebble games on trees | 1980-01-01 | Paper |
| The Pebbling Problem is Complete in Polynomial Space | 1980-01-01 | Paper |
| Linear expected-time algorithms for connectivity problems | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3904047 | 1980-01-01 | Paper |
| Generalized Nested Dissection | 1979-01-01 | Paper |
| A class of algorithms which require nonlinear time to maintain disjoint sets | 1979-01-01 | Paper |
| A Fast Merging Algorithm | 1979-01-01 | Paper |
| A linear-time algorithm for testing the truth of certain quantified Boolean formulas | 1979-01-01 | Paper |
| Applications of Path Compression on Balanced Trees | 1979-01-01 | Paper |
| A Separator Theorem for Planar Graphs | 1979-01-01 | Paper |
| A fast algorithm for finding dominators in a flowgraph | 1979-01-01 | Paper |
| Storing a sparse table | 1979-01-01 | Paper |
| Algorithmic Aspects of Vertex Elimination on Directed Graphs | 1978-01-01 | Paper |
| Triangulating a simple polygon | 1978-01-01 | Paper |
| Complexity of Monotone Networks for Computing Conjunctions | 1978-01-01 | Paper |
| Complexity of Combinatorial Algorithms | 1978-01-01 | Paper |
| Time-space trade-offs in a pebble game | 1978-01-01 | Paper |
| A linear-time algorithm for finding all feedback vertices | 1978-01-01 | Paper |
| Finding optimum branchings | 1977-01-01 | Paper |
| Finding a Maximum Independent Set | 1977-01-01 | Paper |
| Space bounds for a game on graphs | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206972 | 1977-01-01 | Paper |
| Correction to “Space Bounds for a Game on Graphs” by Wolfgang J. Paul, Robert Endre Tarjan and James R. Celoni | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4137204 | 1977-01-01 | Paper |
| Lower bounds on the lengths of node sequences in directed graphs | 1977-01-01 | Paper |
| The Planar Hamiltonian Circuit Problem is NP-Complete | 1976-01-01 | Paper |
| Edge-disjoint spanning trees and depth-first search | 1976-01-01 | Paper |
| Algorithmic Aspects of Vertex Elimination on Graphs | 1976-01-01 | Paper |
| A Combinatorial Problem Which Is Complete in Polynomial Space | 1976-01-01 | Paper |
| Augmentation Problems | 1976-01-01 | Paper |
| Computing an st-numbering | 1976-01-01 | Paper |
| Finding Minimum Spanning Trees | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4117301 | 1976-01-01 | Paper |
| b-Matchings in Trees | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4141274 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4144770 | 1976-01-01 | Paper |
| Efficiency of a Good But Not Linear Set Union Algorithm | 1975-01-01 | Paper |
| Network Flow and Testing Graph Connectivity | 1975-01-01 | Paper |
| Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4161356 | 1975-01-01 | Paper |
| Optimal chain partitions of trees | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4093467 | 1975-01-01 | Paper |
| A note on finding the bridges of a graph | 1974-01-01 | Paper |
| Efficient Planarity Testing | 1974-01-01 | Paper |
| Testing flow graph reducibility | 1974-01-01 | Paper |
| Finding Dominators in Directed Graphs | 1974-01-01 | Paper |
| A good algorithm for edge-disjoint branching | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4196458 | 1974-01-01 | Paper |
| A new algorithm for finding weak components | 1974-01-01 | Paper |
| Dividing a Graph into Triconnected Components | 1973-01-01 | Paper |
| Time bounds for selection | 1973-01-01 | Paper |
| Enumeration of the Elementary Circuits of a Directed Graph | 1973-01-01 | Paper |
| A V log V algorithm for isomorphism of triconnected planar graphs | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4062628 | 1973-01-01 | Paper |
| Depth-First Search and Linear Graph Algorithms | 1972-01-01 | Paper |
| Sorting Using Networks of Queues and Stacks | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3875946 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4125778 | 1972-01-01 | Paper |
| Determining whether a groupoid is a group | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5668808 | 1972-01-01 | Paper |
| \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs | 1971-01-01 | Paper |
