A Computational Study of Routing Algorithms for Realistic Transportation Networks. - Riko Jacob; Madhav V. Marathe; Kai Nagel (ACM J. Exp. Algorithmics, 1999)

Dynamic Planar Convex Hull with Optimal Query Time. - Gerth Stølting Brodal; Riko Jacob (SWAT, 2000)

Formal-Language-Constrained Path Problems. - Christopher L. Barrett; Riko Jacob; Madhav V. Marathe (SIAM J. Comput., 2000)

Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router. - Christopher L. Barrett; Keith R. Bisset; Riko Jacob; Goran Konjevod; Madhav V. Marathe (ESA, 2002)

Dynamic Planar Convex Hull. - Gerth Stølting Brodal; Riko Jacob (FOCS, 2002)

Cache oblivious search trees via binary trees of small height. - Gerth Stølting Brodal; Rolf Fagerberg; Riko Jacob (SODA, 2002)

Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries. - Gerth Stølting Brodal; Riko Jacob (ATMOS, 2003)

Online Delay Management on a Single Train Line. - Michael Gatto; Riko Jacob; Leon Peeters; Peter Widmayer (ATMOS, 2004)

Algorithms for Centrality Indices. - Riko Jacob; Dirk Koschützki; Katharina Anna Lehmann; Leon Peeters; Dagmar Tenfelde-Podehl (Network Analysis, 2004)

Railway Delay Management: Exploring Its Algorithmic Complexity. - Michael Gatto; Björn Glaus; Riko Jacob; Leon Peeters; Peter Widmayer (SWAT, 2004)

Joint Base Station Scheduling. - Thomas Erlebach; Riko Jacob; Matús Mihalák; Marc Nunkesser; Gábor Szabó 001; Peter Widmayer (WAOA, 2004)

Theory on the Tracks: A Selection of Railway Optimization Problems (Column: Algorithmics). - Michael Gatto; Riko Jacob; Leon Peeters; Birgitta Weber; Peter Widmayer (Bull. EATCS, 2004)

The Computational Complexity of Delay Management. - Michael Gatto; Riko Jacob; Leon Peeters; Anita Schöbel (WG, 2005)

ATMOS 2006 Preface - Algorithmic Methods and Models for Optimization of Railways. - Riko Jacob; Matthias Müller-Hannemann (ATMOS, 2006)

ATMOS 2006 Abstracts Collection - Presentations at the 6th Workshop on Algorithmic Methods and Models for Optimization of Railways. - Riko Jacob; Matthias Müller-Hannemann (ATMOS, 2006)

Optimal Randomized Comparison Based Algorithms for Collision. - Riko Jacob (MFCS, 2007)

An Algorithmic View on OVSF Code Assignment. - Thomas Erlebach; Riko Jacob; Matús Mihalák; Marc Nunkesser; Gábor Szabó 001; Peter Widmayer (Algorithmica, 2007)

PepSplice: cache-efficient search algorithms for comprehensive identification of tandem mass spectra. - Franz F. Roos; Riko Jacob; Jonas Grossmann; Bernd Fischer 003; Joachim M. Buhmann; Wilhelm Gruissem; Sacha Baginsky; Peter Widmayer (Bioinform., 2007)

Sequential vector packing. - Mark Cieliebak; Alexander Hall; Riko Jacob; Marc Nunkesser (Theor. Comput. Sci., 2008)

Shortest Paths Approaches for Timetable Information. - Riko Jacob (Encyclopedia of Algorithms, 2008)

A Self-stabilizing and Local Delaunay Graph Construction. - Riko Jacob; Stephan Ritscher; Christian Scheideler; Stefan Schmid 001 (ISAAC, 2009)

A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. - Riko Jacob; Andréa W. Richa; Christian Scheideler; Stefan Schmid 001; Hanjo Täubig (PODC, 2009)

Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. - Dominik Gall; Riko Jacob; Andréa W. Richa; Christian Scheideler; Stefan Schmid 001; Hanjo Täubig (SSS, 2009)

On Computational Models for Flash Memory Devices. - Deepak Ajwani; Andreas Beckmann; Riko Jacob; Ulrich Meyer 001; Gabriel Moruz (SEA, 2009)

Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. - Dominik Gall; Riko Jacob; Andréa W. Richa; Christian Scheideler; Stefan Schmid 001; Hanjo Täubig (LATIN, 2010)

The I/O Complexity of Sparse Matrix Dense Matrix Multiplication. - Gero Greiner; Riko Jacob (LATIN, 2010)

Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model. - Gero Greiner; Riko Jacob (MFCS, 2010)

Approximate Shortest Paths Guided by a Small Index. - Jörg Derungs; Riko Jacob; Peter Widmayer (Algorithmica, 2010)

Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model. - Michael A. Bender; Gerth Stølting Brodal; Rolf Fagerberg; Riko Jacob; Elias Vicari (Theory Comput. Syst., 2010)

Hierarchical Package Bidding: Computational Complexity and Bidder Behavior. - Riko Jacob; Tobias Scheffel; Georg Ziegler; Martin Bichler (AMMA, 2011)

Multistage methods for freight train classification. - Riko Jacob; Peter Márton; Jens Maue; Marc Nunkesser (Networks, 2011)

A Non-static Data Layout Enhancing Parallelism and Vectorization in Sparse Grid Algorithms. - Gerrit Buse; Dirk Pflüger; Alin Florindor Murarasu; Riko Jacob (ISPDC, 2012)

The Efficiency of MapReduce in Parallel External Memory. - Gero Greiner; Riko Jacob (LATIN, 2012)

Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs. - Riko Jacob; Stephan Ritscher; Christian Scheideler; Stefan Schmid 001 (Theor. Comput. Sci., 2012)

Global Communication Schemes for the Sparse Grid Combination Technique. - Philipp Hupp; Riko Jacob; Mario Heene; Dirk Pflüger; Markus Hegland (PARCO, 2013)

Tight Bounds for Low Dimensional Star Stencils in the External Memory Model. - Philipp Hupp; Riko Jacob (WADS, 2013)

Data Delivery by Energy-Constrained Mobile Agents on a Line. - Jérémie Chalopin; Riko Jacob; Matús Mihalák; Peter Widmayer (ICALP (2), 2014)

Treewidth Computation and Kernelization in the Parallel External Memory Model. - Riko Jacob; Tobias Lieber; Matthias Mnich (IFIP TCS, 2014)

On the Complexity of List Ranking in the Parallel External Memory Model. - Riko Jacob; Tobias Lieber; Nodari Sitchinava (MFCS (2), 2014)

SKIP+: A Self-Stabilizing Skip Graph. - Riko Jacob; Andréa W. Richa; Christian Scheideler; Stefan Schmid 001; Hanjo Täubig (J. ACM, 2014)

A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. - Dominik Gall; Riko Jacob; Andréa W. Richa; Christian Scheideler; Stefan Schmid 001; Hanjo Täubig (Theory Comput. Syst., 2014)

Fast Output-Sensitive Matrix Multiplication. - Riko Jacob; Morten Stöckel (ESA, 2015)

Global communication schemes for the numerical solution of high-dimensional PDEs. - Philipp Hupp; Mario Heene; Riko Jacob; Dirk Pflüger (Parallel Comput., 2016)

Shortest Paths Approaches for Timetable Information. - Riko Jacob (Encyclopedia of Algorithms, 2016)

List Ranking. - Riko Jacob; Ulrich Meyer 001; Laura Toma (Encyclopedia of Algorithms, 2016)

Lower Bounds in the Asymmetric External Memory Model. - Riko Jacob; Nodari Sitchinava (SPAA, 2017)

Charting the Complexity Landscape of Waypoint Routing. - Saeed Akhoondian Amiri; Klaus-Tycho Foerster; Riko Jacob; Stefan Schmid 001 (CoRR, 2017)

Cache Oblivious Sparse Matrix Multiplication. - Matteo Dusefante; Riko Jacob (LATIN, 2018)

Waypoint Routing in Special Networks. - Saeed Akhoondian Amiri; Klaus-Tycho Foerster; Riko Jacob; Mahmoud Parham; Stefan Schmid 001 (Networking, 2018)

Charting the Algorithmic Complexity of Waypoint Routing. - Saeed Akhoondian Amiri; Klaus-Tycho Foerster; Riko Jacob; Stefan Schmid 001 (Comput. Commun. Rev., 2018)

Fragile Complexity of Comparison-Based Algorithms. - Peyman Afshani; Rolf Fagerberg; David Hammer; Riko Jacob; Irina Kostitsyna; Ulrich Meyer 001; Manuel Penschuck; Nodari Sitchinava (ESA, 2019)

External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms. - John Iacono; Riko Jacob; Konstantinos Tsakalidis (ESA, 2019)

Lower Bounds for Oblivious Data Structures. - Riko Jacob; Kasper Green Larsen; Jesper Buus Nielsen (SODA, 2019)

On the I/O Complexity of the k-Nearest Neighbors Problem. - Mayank Goswami 001; Riko Jacob; Rasmus Pagh (PODS, 2020)

On the I/O complexity of the k-nearest neighbor problem. - Mayank Goswami 001; Riko Jacob; Rasmus Pagh (CoRR, 2020)

Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model. - Michael T. Goodrich; Riko Jacob; Nodari Sitchinava (SODA, 2021)

Universal Sorting: Finding a DAG using Priced Comparisons. - Mayank Goswami 001; Riko Jacob (CoRR, 2022)

Fragile complexity of adaptive algorithms. - Prosenjit Bose; Pilar Cano; Rolf Fagerberg; John Iacono; Riko Jacob; Stefan Langerman (Theor. Comput. Sci., 2022)

Optimal Parallel Sorting with Comparison Errors. - Michael T. Goodrich; Riko Jacob (SPAA, 2023)

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting. - Mayank Goswami 001; Riko Jacob (APPROX/RANDOM, 2024)

Unplugging Dijkstra's Algorithm as a Mechanical Device. - Riko Jacob; Francesco Silvestri 001 (CMSC, 2024)

An Optimal Randomized Algorithm for Finding the Saddlepoint. - Justin Dallant; Frederik Haagensen; Riko Jacob; László Kozma 002; Sebastian Wild (ESA, 2024)

An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio. - Mayank Goswami 001; Riko Jacob (ITCS, 2024)

Finding the saddlepoint faster than sorting. - Justin Dallant; Frederik Haagensen; Riko Jacob; László Kozma 002; Sebastian Wild (SOSA, 2024)

The Case for External Graph Sketching. - Michael A. Bender; Martín Farach-Colton; Riko Jacob; Hanna Komlós; David Tench; Evan West (CoRR, 2025)