| 2024 | AAIM | Improved Approximation Algorithms for Patrol-Scheduling with Min-Max Latency Using Multiclass Minimum Spanning Forests. | Li-Hsuan Chen, Ling-Ju Hung, Ralf Klasing |
| 2024 | MFCS | Algorithms and Complexity for Path Covers of Temporal DAGs. | Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing |
| 2023 | IWOCA | Online Knapsack with Removal and Recourse. | Hans-Joachim Bckenhauer, Ralf Klasing, Tobias Mmke, Peter Rossmanith, Moritz Stocker, David Wehner |
| 2023 | LAGOS | Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems. | Romaric Duvignau, Ralf Klasing |
| 2022 | IWOCA | The Red-Blue Separation Problem on Graphs. | Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtil |
| 2021 | AAIM | A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks. | Shih-Shun Kao, Ralf Klasing, Ling-Ju Hung, Sun-Yuan Hsieh |
| 2018 | IWOCA | Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs. | Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing |
| 2017 | CIAC | On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality. | Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu |
| 2017 | COCOON | The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality. | Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing |
| 2017 | SIROCCO | A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs. | Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters |
| 2017 | SOFSEM | Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors). | Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik |
| 2016 | SIROCCO | Linear Search by a Pair of Distinct-Speed Robots. | Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak |
| 2016 | SIROCCO | Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? | Ralf Klasing, Adrian Kosowski, Dominik Pajak |
| 2015 | Algosensors | Beachcombing on Strips and Islands. | Evangelos Bampas, Jurek Czyzowicz, David Ilcinkas, Ralf Klasing |
| 2015 | CIAC | Efficiently Testing T -Interval Connectivity in Dynamic Graphs. | Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters |
| 2015 | PODC | Improved Analysis of Deterministic Load-Balancing Schemes. | Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski |
| 2014 | LATIN | Collision-Free Network Exploration. | Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Dominik Pajak |
| 2014 | SIROCCO | Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks. | Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner |
| 2014 | SIROCCO | Exploration of Constantly Connected Dynamic Graphs Based on Cactuses. | David Ilcinkas, Ralf Klasing, Ahmed Mouhamadou Wade |
| 2013 | IWOCA | Efficient Exploration of Anonymous Undirected Graphs. | Ralf Klasing |
| 2013 | PODC | The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks. | Ralf Klasing, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald |
| 2012 | SIROCCO | Gathering of Robots on Anonymous Grids without Multiplicity Detection. | Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra |
| 2011 | SIROCCO | Network Verification via Routing Table Queries. | Evangelos Bampas, Davide Bil, Guido Drovandi, Luciano Gual, Ralf Klasing, Guido Proietti |
| 2010 | CIAC | Improved Approximations for TSP with Simple Precedence Constraints. | Hans-Joachim Bckenhauer, Ralf Klasing, Tobias Mmke, Monika Steinov |
| 2009 | ICALP | Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. | Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski |
| 2009 | OPODIS | Robustness of the Rotor-router Mechanism. | Evangelos Bampas, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Tomasz Radzik |
| 2009 | SIROCCO | More Efficient Periodic Traversal in Anonymous Undirected Graphs. | Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung |
| 2008 | OPODIS | Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring. | Ralf Klasing, Adrian Kosowski, Alfredo Navarra |
| 2008 | SIROCCO | Locating and Repairing Faults in a Network with Mobile Agents. | Colin Cooper, Ralf Klasing, Tomasz Radzik |
| 2007 | SIROCCO | Fast Periodic Graph Exploration with Constant Memory. | Leszek Gasieniec, Ralf Klasing, Russell A. Martin, Alfredo Navarra, Xiaohui Zhang |
| 2006 | ISAAC | Gathering Asynchronous Oblivious Mobile Robots in a Ring. | Ralf Klasing, Euripides Markou, Andrzej Pelc |
| 2006 | OPODIS | Searching for Black-Hole Faults in a Network Using Multiple Agents. | Colin Cooper, Ralf Klasing, Tomasz Radzik |
| 2006 | PERCOM | Hardness and approximation of Gathering in static radio networks. | Jean-Claude Bermond, Nelson Morales, Stphane Prennes, Jrme Galtier, Ralf Klasing |
| 2005 | ISAAC | From Balls and Bins to Points and Vertices. | Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes |
| 2005 | OPODIS | Approximation Bounds for Black Hole Search Problems. | Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco |
| 2005 | SIROCCO | Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. | Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco |
| 2004 | Networking | Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem. | Ralf Klasing, Alfredo Navarra, Aris A. Papadopoulos, Stephane Perennes |
| 2004 | WAW | Dominating Sets in Web Graphs. | Colin Cooper, Ralf Klasing, Michele Zito |
| 2003 | CIAC | On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. | Hans-Joachim Bckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger |
| 2000 | CIAC | Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger |
| 2000 | STACS | An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger |
| 1998 | WG | Improved Compressions of Cube-Connected Cycles Networks. | Ralf Klasing |
| 1995 | FCT | Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract). | Juraj Hromkovic, Ralf Klasing, Dana Pardubsk, Walter Unger, Juraj Waczulk, Hubert Wagener |
| 1995 | STACS | On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. | Juraj Hromkovic, Krzysztof Lorys, Przemyslawa Kanarek, Ralf Klasing, Walter Unger, Hubert Wagener |
| 1994 | MFCS | The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width. | Ralf Klasing |
| 1993 | ESA | Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. | Juraj Hromkovic, Ralf Klasing, Elena Sthr, Hubert Wagener |
| 1993 | STACS | Parallel Architectures: Design and Efficient Use. | Burkhard Monien, Rainer Feldmann, Ralf Klasing, Reinhard Lling |
| 1993 | WG | Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks. | Juraj Hromkovic, Ralf Klasing, Elena Sthr |
| 1992 | STACS | Broadcasting in Butterfly and DeBruijn Networks. | Ralf Klasing, Burkhard Monien, Regine Peine, Elena Sthr |
| 1991 | WG | Optimal Embedding of Complete Binary Trees into Lines and Grids. | Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger |