A Generalized Topological Sorting Problem. - Torben Hagerup; Wolfgang Rülling (Aegean Workshop on Computing, 1986)

Parallel 5-Colouring of Planar Graphs. - Torben Hagerup; Marek Chrobak; Krzysztof Diks (ICALP, 1987)

Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. - Helmut Alt; Torben Hagerup; Kurt Mehlhorn; Franco P. Preparata (SIAM J. Comput., 1987)

Towards Optimal Parallel Bucket Sorting - Torben Hagerup (Inf. Comput., 1987)

Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. - Bogdan S. Chlebus; Krzysztof Diks; Torben Hagerup; Tomasz Radzik (MFCS, 1988)

On Saving Space in Parallel Computation (Note). - Torben Hagerup (Inf. Process. Lett., 1988)

Parallel algorithms on planar graphs. - Torben Hagerup (1988)

New Simulations between CRCW PRAMs. - Bogdan S. Chlebus; Krzysztof Diks; Torben Hagerup; Tomasz Radzik (FCT, 1989)

Parallel Retrieval of Scattered Information. - Torben Hagerup; Manfred Nowak (ICALP, 1989)

Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). - Krzysztof Diks; Torben Hagerup; Wojciech Rytter (MFCS, 1989)

Hybridsort Revisited and Parallelized. - Torben Hagerup (Inf. Process. Lett., 1989)

Optimal Merging and Sorting on the Erew Pram. - Torben Hagerup; Christine Rüb (Inf. Process. Lett., 1989)

Optimal Parallel 5-Colouring of Planar Graphs. - Torben Hagerup; Marek Chrobak; Krzysztof Diks (SIAM J. Comput., 1989)

Neue Algorithmen für das Maximum-Flow-Problem. - Torben Hagerup (GI Jahrestagung (2), 1990)

Can A Maximum Flow be Computed on o(nm) Time? - Joseph Cheriyan; Torben Hagerup; Kurt Mehlhorn (ICALP, 1990)

Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions. - Torben Hagerup; H. Jung; Emo Welzl (SPAA, 1990)

Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM. - Torben Hagerup; Tomasz Radzik (SPAA, 1990)

A Guided Tour of Chernoff Bounds. - Torben Hagerup; Christine Rüb (Inf. Process. Lett., 1990)

Improved Nonconservative Sequential and Parallel Integer Sorting. - Torben Hagerup; Hong Shen 001 (Inf. Process. Lett., 1990)

Planar Depth-First Search in O(log n) Parallel Time. - Torben Hagerup (SIAM J. Comput., 1990)

Optimal Parallel Algorithms on Planar Graphs - Torben Hagerup (Inf. Comput., 1990)

Fast Parallel Generation of Random Permutations. - Torben Hagerup (ICALP, 1991)

Fast and Reliable Parallel Hashing. - Hannah Bast; Torben Hagerup (SPAA, 1991)

Constant-Time Parallel Integer Sorting (Extended Abstract) - Torben Hagerup (STOC, 1991)

Improved Deterministic Parallel Integer Sorting - P. C. P. Bhatt; Krzysztof Diks; Torben Hagerup; V. C. Prasad; Tomasz Radzik; Sanjeev Saxena (Inf. Comput., 1991)

Waste Makes Haste: Tight Bounds for Loose Parallel Sorting - Torben Hagerup; Rajeev Raman (FOCS, 1992)

Fast Integer Merging on the EREW PRAM. - Torben Hagerup (ICALP, 1992)

A Perfect Parallel Dictionary. - Hannah Bast; Martin Dietzfelbinger; Torben Hagerup (MFCS, 1992)

Merging and Sorting Strings in Parallel. - Torben Hagerup; Ola Petersson (MFCS, 1992)

Fast and Optimal Simulations between CRCW PRAMs. - Torben Hagerup (STACS, 1992)

The Log-Star Revolution. - Torben Hagerup (STACS, 1992)

FORK: A high-level language for PRAMs. - Torben Hagerup; Arno Schmitt; Helmut Seidl (Future Gener. Comput. Syst., 1992)

On a Compaction Theorem of Ragde. - Torben Hagerup (Inf. Process. Lett., 1992)

Maintaining Discrete Probability Distributions Optimally. - Torben Hagerup; Kurt Mehlhorn; J. Ian Munro (ICALP, 1993)

Approximate and Exact Deterministic Parallel Selection. - Shiva Chaudhuri; Torben Hagerup; Rajeev Raman (MFCS, 1993)

Fast Deterministic Approximate and Exact Parallel Sorting. - Torben Hagerup; Rajeev Raman (SPAA, 1993)

Drawing Graphs in the Plane with High Resolution. - Michael Formann; Torben Hagerup; James Haralambides; Michael Kaufmann 001; Frank Thomson Leighton; Antonios Symvonis; Emo Welzl; Gerhard J. Woeginger (SIAM J. Comput., 1993)

The complexity of searching a sorted array of strings. - Arne Andersson; Torben Hagerup; Johan Håstad; Ola Petersson (STOC, 1994)

Optimal parallel string algorithms: sorting, merging and computing the minimum. - Torben Hagerup (STOC, 1994)

Prefix Graphs and Their Applications. - Shiva Chaudhuri; Torben Hagerup (WG, 1994)

Generalized Topological Sorting in Linear Time. - Torben Hagerup; Martin Maas 003 (Nord. J. Comput., 1994)

Self-Simulation for the Passive Optical Star Model. - Pascal Berthomé; Th. Duboux; Torben Hagerup; Ilan Newman; Assaf Schuster (ESA, 1995)

More Efficient Parallel Flow Algorithms. - Jürgen Dedorath; Jordan Gergov; Torben Hagerup (ISAAC, 1995)

Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. - Torben Hagerup; Jyrki Katajainen; Naomi Nishimura; Prabhakar Ragde (SODA, 1995)

Fast Parallel Space Allocation, Estimation and Integer Sorting. - Hannah Bast; Torben Hagerup (Inf. Comput., 1995)

The Parallel Complexity of Integer Prefix Summation. - Torben Hagerup (Inf. Process. Lett., 1995)

Fast Deterministic Processor Allocation. - Torben Hagerup (J. Algorithms, 1995)

Fast Parallel Permutation Algorithms. - Torben Hagerup; Jörg Keller 001 (Parallel Process. Lett., 1995)

A Randomized Maximum-Flow Algorithm. - Joseph Cheriyan; Torben Hagerup (SIAM J. Comput., 1995)

A Lower Bound for the Emulation of PRAM Memories on Processor Networks - Torben Hagerup (Inf. Comput., 1995)

An o(n³)-Time Algorithm Maximum-Flow Algorithm. - Joseph Cheriyan; Torben Hagerup; Kurt Mehlhorn (SIAM J. Comput., 1996)

Fast Integer Merging on the EREW PRAM. - Torben Hagerup; Miroslaw Kutylowski (Algorithmica, 1997)

Improved Parallel Integer Sorting without Concurrent Writing. - Susanne Albers; Torben Hagerup (Inf. Comput., 1997)

A Reliable Randomized Algorithm for the Closest-Pair Problem. - Martin Dietzfelbinger; Torben Hagerup; Jyrki Katajainen; Martti Penttonen (J. Algorithms, 1997)

Allocating Independent Tasks to Parallel Processors: An Experimental Study. - Torben Hagerup (J. Parallel Distributed Comput., 1997)

Simpler and Faster Dictionaries on the AC0 RAM. - Torben Hagerup (ICALP, 1998)

Tree Decompositions of Small Diameter. - Hans L. Bodlaender; Torben Hagerup (MFCS, 1998)

Sorting and Searching on the Word RAM. - Torben Hagerup (STACS, 1998)

An Implementation of the Binary Blocking Flow Algorithm. - Torben Hagerup; Peter Sanders 001; Jesper Larsson Träff (WAE, 1998)

Sorting in Linear Time? - Arne Andersson; Torben Hagerup; Stefan Nilsson; Rajeev Raman (J. Comput. Syst. Sci., 1998)

Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. - Torben Hagerup; Jyrki Katajainen; Naomi Nishimura; Prabhakar Ragde (J. Comput. Syst. Sci., 1998)

Parallel Algorithms with Optimal Speedup for Bounded Treewidth. - Hans L. Bodlaender; Torben Hagerup (SIAM J. Comput., 1998)

More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. - Krzysztof Diks; Torben Hagerup (Theor. Comput. Sci., 1998)

Fast Deterministic Construction of Static Dictionaries. - Torben Hagerup (SODA, 1999)

Improved Shortest Paths on the Word RAM. - Torben Hagerup (ICALP, 2000)

Dynamic Algorithms for Graphs of Bounded Treewidth. - Torben Hagerup (Algorithmica, 2000)

Parallel Preprocessing for Path Queries without Concurrent Reading. - Torben Hagerup (Inf. Comput., 2000)

Self-Simulation for the Passive Optical Star. - Pascal Berthomé; Torben Hagerup; Ilan Newman; Assaf Schuster (J. Algorithms, 2000)

Tight Bounds for Searching a Sorted Array of Strings. - Arne Andersson; Torben Hagerup; Johan Håstad; Ola Petersson (SIAM J. Comput., 2000)

Simple Minimal Perfect Hashing in Less Space. - Martin Dietzfelbinger; Torben Hagerup (ESA, 2001)

Efficient Minimal Perfect Hashing in Nearly Minimal Space. - Torben Hagerup; Torsten Tholey (STACS, 2001)

Deterministic Dictionaries. - Torben Hagerup; Peter Bro Miltersen; Rasmus Pagh (J. Algorithms, 2001)

Translating a Planar Object to Maximize Point Containment. - Pankaj K. Agarwal; Torben Hagerup; Rahul Ray; Micha Sharir; Michiel H. M. Smid; Emo Welzl (ESA, 2002)

An Efficient Quasidictionary. - Torben Hagerup; Rajeev Raman (SWAT, 2002)

Routing Flow Through a Strongly Connected Graph. - Thomas Erlebach; Torben Hagerup (Algorithmica, 2002)

On the parameterized complexity of the generalized rush hour puzzle. - Henning Fernau; Torben Hagerup; Naomi Nishimura; Prabhakar Ragde; Klaus Reinhardt (CCCG, 2003)

Simpler Computation of Single-Source Shortest Paths in Linear Average Time. - Torben Hagerup (Theory Comput. Syst., 2006)

Online and Offline Access to Short Lists. - Torben Hagerup (MFCS, 2007)

A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs. - Torben Hagerup (WG, 2007)

A Pictorial Description of Cole's Parallel Merge Sort. - Torben Hagerup (Efficient Algorithms, 2009)

An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees. - Torben Hagerup (WG, 2009)

Trimming of Graphs, with Application to Point Labeling. - Thomas Erlebach; Torben Hagerup; Klaus Jansen; Moritz Minzlaff; Alexander Wolff 001 (Theory Comput. Syst., 2010)

Simpler Linear-Time Kernelization for Planar Dominating Set. - Torben Hagerup (IPEC, 2011)

Finding the maximum suffix with fewer comparisons. - Gianni Franceschini; Torben Hagerup (J. Discrete Algorithms, 2011)

Kernels for Edge Dominating Set: Simpler or Smaller. - Torben Hagerup (MFCS, 2012)

A strengthened analysis of an algorithm for Dominating Set in planar graphs. - Torben Hagerup (Discret. Appl. Math., 2012)

Easy Multiple-Precision Divisors and Word-RAM Constants. - Torben Hagerup (MFCS (2), 2015)

Space-efficient Basic Graph Algorithms. - Amr Elmasry; Torben Hagerup; Frank Kammer (STACS, 2015)

Succinct Choice Dictionaries. - Torben Hagerup; Frank Kammer (CoRR, 2016)

On-the-Fly Array Initialization in Less Space. - Torben Hagerup; Frank Kammer (ISAAC, 2017)

An Optimal Choice Dictionary. - Torben Hagerup (CoRR, 2017)

Space-Efficient DFS and Applications: Simpler, Leaner, Faster. - Torben Hagerup (CoRR, 2018)

Guidesort: Simpler Optimal Deterministic Sorting for the Parallel Disk Model. - Torben Hagerup (CoRR, 2018)

Small Uncolored and Colored Choice Dictionaries. - Torben Hagerup (CoRR, 2018)

Highly Succinct Dynamic Data Structures. - Torben Hagerup (FCT, 2019)

A Constant-Time Colored Choice Dictionary with Almost Robust Iteration. - Torben Hagerup (MFCS, 2019)

Rank-Select Indices Without Tears. - Tim Baumann; Torben Hagerup (WADS, 2019)

Fast Breadth-First Search in Still Less Space. - Torben Hagerup (WG, 2019)

Space-efficient Euler partition and bipartite edge coloring. - Torben Hagerup; Frank Kammer; Moritz Laudahn (Theor. Comput. Sci., 2019)

Space-Efficient DFS and Applications to Connectivity Problems: Simpler, Leaner, Faster. - Torben Hagerup (Algorithmica, 2020)

Still Simpler Static Level Ancestors. - Torben Hagerup (CoRR, 2020)