| 2019 | FCT | Highly Succinct Dynamic Data Structures. | Torben Hagerup |
| 2019 | MFCS | A Constant-Time Colored Choice Dictionary with Almost Robust Iteration. | Torben Hagerup |
| 2019 | WADS | Rank-Select Indices Without Tears. | Tim Baumann, Torben Hagerup |
| 2019 | WG | Fast Breadth-First Search in Still Less Space. | Torben Hagerup |
| 2017 | CIAC | Space-Efficient Euler Partition and Bipartite Edge Coloring. | Torben Hagerup, Frank Kammer, Moritz Laudahn |
| 2017 | ISAAC | On-the-Fly Array Initialization in Less Space. | Torben Hagerup, Frank Kammer |
| 2015 | MFCS | Easy Multiple-Precision Divisors and Word-RAM Constants. | Torben Hagerup |
| 2015 | STACS | Space-efficient Basic Graph Algorithms. | Amr Elmasry, Torben Hagerup, Frank Kammer |
| 2012 | MFCS | Kernels for Edge Dominating Set: Simpler or Smaller. | Torben Hagerup |
| 2010 | CIAC | Finding the Maximum Suffix with Fewer Comparisons. | Gianni Franceschini, Torben Hagerup |
| 2009 | WG | An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees. | Torben Hagerup |
| 2008 | STACS | Trimming of Graphs, with Application to Point Labeling. | Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff |
| 2007 | MFCS | Online and Offline Access to Short Lists. | Torben Hagerup |
| 2007 | WG | A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs. | Torben Hagerup |
| 2004 | STACS | Simpler Computation of Single-Source Shortest Paths in Linear Average Time. | Torben Hagerup |
| 2002 | ESA | Translating a Planar Object to Maximize Point Containment. | Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl |
| 2001 | ESA | Simple Minimal Perfect Hashing in Less Space. | Martin Dietzfelbinger, Torben Hagerup |
| 2001 | STACS | Efficient Minimal Perfect Hashing in Nearly Minimal Space. | Torben Hagerup, Torsten Tholey |
| 2000 | ICALP | Improved Shortest Paths on the Word RAM. | Torben Hagerup |
| 1999 | SODA | Fast Deterministic Construction of Static Dictionaries. | Torben Hagerup |
| 1998 | ICALP | Simpler and Faster Dictionaries on the AC | Torben Hagerup |
| 1998 | MFCS | Tree Decompositions of Small Diameter. | Hans L. Bodlaender, Torben Hagerup |
| 1998 | STACS | Sorting and Searching on the Word RAM. | Torben Hagerup |
| 1997 | ICALP | Dynamic Algorithms for Graphs of Bounded Treewidth. | Torben Hagerup |
| 1996 | WG | More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. | Krzysztof Diks, Torben Hagerup |
| 1995 | ESA | Self-Simulation for the Passive Optical Star Model. | Pascal Berthom, Th. Duboux, Torben Hagerup, Ilan Newman, Assaf Schuster |
| 1995 | ICALP | Parallel Algorithms with Optimal Speedup for Bounded Treewidth. | Hans L. Bodlaender, Torben Hagerup |
| 1995 | ISAAC | More Efficient Parallel Flow Algorithms. | Jrgen Dedorath, Jordan Gergov, Torben Hagerup |
| 1995 | SODA | Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. | Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde |
| 1995 | STOC | Sorting in linear time? | Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman |
| 1994 | STOC | The complexity of searching a sorted array of strings. | Arne Andersson, Torben Hagerup, Johan Hstad, Ola Petersson |
| 1994 | STOC | Optimal parallel string algorithms: sorting, merging and computing the minimum. | Torben Hagerup |
| 1994 | WG | Prefix Graphs and Their Applications. | Shiva Chaudhuri, Torben Hagerup |
| 1993 | FCT | Generalized Topological Sorting in Linear Time. | Torben Hagerup, Martin Maas |
| 1993 | ICALP | Maintaining Discrete Probability Distributions Optimally. | Torben Hagerup, Kurt Mehlhorn, J. Ian Munro |
| 1993 | MFCS | Approximate and Exact Deterministic Parallel Selection. | Shiva Chaudhuri, Torben Hagerup, Rajeev Raman |
| 1993 | SODA | Fast Deterministic Processor Allocation. | Torben Hagerup |
| 1993 | SPAA | Fast Deterministic Approximate and Exact Parallel Sorting. | Torben Hagerup, Rajeev Raman |
| 1992 | FOCS | Waste Makes Haste: Tight Bounds for Loose Parallel Sorting | Torben Hagerup, Rajeev Raman |
| 1992 | ICALP | Fast Integer Merging on the EREW PRAM. | Torben Hagerup |
| 1992 | MFCS | A Perfect Parallel Dictionary. | Hannah Bast, Martin Dietzfelbinger, Torben Hagerup |
| 1992 | MFCS | Merging and Sorting Strings in Parallel. | Torben Hagerup, Ola Petersson |
| 1992 | SODA | Improved Parallel Integer Sorting Without Concurrent Writing. | Susanne Albers, Torben Hagerup |
| 1992 | STACS | Fast and Optimal Simulations between CRCW PRAMs. | Torben Hagerup |
| 1992 | STACS | The Log-Star Revolution. | Torben Hagerup |
| 1991 | ICALP | Fast Parallel Generation of Random Permutations. | Torben Hagerup |
| 1991 | STOC | Constant-Time Parallel Integer Sorting (Extended Abstract) | Torben Hagerup |
| 1991 | SPAA | Fast and Reliable Parallel Hashing. | Hannah Bast, Torben Hagerup |
| 1990 | FOCS | Drawing Graphs in the Plane with High Resolution | Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger |
| 1990 | GI | Neue Algorithmen fr das Maximum-Flow-Problem. | Torben Hagerup |
| 1990 | ICALP | Can A Maximum Flow be Computed on o(nm) Time? | Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn |
| 1990 | SPAA | Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions. | Torben Hagerup, H. Jung, Emo Welzl |
| 1990 | SPAA | Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM. | Torben Hagerup, Tomasz Radzik |
| 1989 | FCT | New Simulations between CRCW PRAMs. | Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik |
| 1989 | FOCS | A Randomized Maximum-Flow Algorithm | Joseph Cheriyan, Torben Hagerup |
| 1989 | ICALP | Parallel Retrieval of Scattered Information. | Torben Hagerup, Manfred Nowak |
| 1989 | MFCS | Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). | Krzysztof Diks, Torben Hagerup, Wojciech Rytter |
| 1988 | MFCS | Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. | Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik |
| 1987 | ICALP | Parallel 5-Colouring of Planar Graphs. | Torben Hagerup, Marek Chrobak, Krzysztof Diks |
| 1986 | MFCS | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. | Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata |