Ralf Klasing

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 54

Top Venues

CoRR

J. Comput. Syst. Sci.

Theor. Comput. Sci.

SIROCCO

Publications

Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker
Online Unbounded Knapsack. CoRR (2024)
Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing
Algorithms and Complexity for Path Covers of Temporal DAGs. MFCS (2024)
Leszek Gasieniec, Tomasz Jurdzinski, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
Perpetual maintenance of machines with different urgency requirements. J. Comput. Syst. Sci. 139 (2024)
Xiaojuan Zhang, Gang Yang, Changxiang He, Ralf Klasing, Yaping Mao
The number of spanning trees for Sierpiński graphs and data center networks. Inf. Comput. 300 (2024)
Zhen Ji, Ralf Klasing, Wen Li, Yaping Mao, Xiaoyan Zhang
Erdös-Gallai-type problems for distance-edge-monitoring numbers. Discret. Appl. Math. 342 (2024)
Chenxu Yang, Gang Yang, Sun-Yuan Hsieh, Yaping Mao, Ralf Klasing
Monitoring the edges of a graph using distances with given girth. J. Comput. Syst. Sci. 143 (2024)
Chenxu Yang, Ralf Klasing, Yaping Mao, Xingchao Deng
On the distance-edge-monitoring numbers of graphs. Discret. Appl. Math. 342 (2024)
Zhao Wang, Yaping Mao, Sun-Yuan Hsieh, Ralf Klasing, Yuzhi Xiao
The g-extra connectivity of graph products. J. Comput. Syst. Sci. 145 (2024)
Chenxu Yang, Ralf Klasing, Changxiang He, Yaping Mao
Perturbation Results for Distance-edge-monitoring Numbers. Fundam. Informaticae 191 (2) (2024)
Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic? CoRR (2024)
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
The RED-BLUE SEPARATION problem on graphs. Theor. Comput. Sci. 970 (2023)
Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner
Online Knapsack with Removal and Recourse. IWOCA (2023)
Shih-Shun Kao, Ralf Klasing, Ling-Ju Hung, Chia-Wei Lee, Sun-Yuan Hsieh
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks. J. Parallel Distributed Comput. 181 (2023)
Chenxu Yang, Ping Li, Yaping Mao, Eddie Cheng, Ralf Klasing
Constructing disjoint Steiner trees in Sierpiński graphs. CoRR (2023)
Romaric Duvignau, Ralf Klasing
Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems. LAGOS (2023)
Chenxu Yang, Ralf Klasing, Changxiang He, Yaping Mao
Perturbation results for distance-edge-monitoring numbers. CoRR (2023)
Wen Li, Ralf Klasing, Yaping Mao, Bo Ning
Monitoring the edges of product networks using distances. CoRR (2022)
Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller, Joe Ryan
Monitoring the edges of a graph using distances. Discret. Appl. Math. 319 (2022)
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
The Red-Blue Separation Problem on Graphs. IWOCA (2022)
Chengxu Yang, Ralf Klasing, Yaping Mao, Xingchao Deng
On the distance-edge-monitoring numbers of graphs. CoRR (2022)
Hao-Ping Yeh, Wei Lu, Li-Hsuan Chen, Ling-Ju Hung, Ralf Klasing, Sun-Yuan Hsieh
-Hub Routing Cost Problem in metric graphs. Theor. Comput. Sci. 922 (2022)
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality. Algorithmica 84 (7) (2022)
Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
Perpetual maintenance of machines with different urgency requirements. CoRR (2022)
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
The RED-BLUE SEPARATION problem on graphs. CoRR (2022)
Leszek Gasieniec, Ralf Klasing, Tomasz Radzik
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. Algorithmica 84 (10) (2022)
Shih-Shun Kao, Ralf Klasing, Ling-Ju Hung, Sun-Yuan Hsieh
A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks. AAIM (2021)
Yi-Cheng Yang, Shih-Shun Kao, Ralf Klasing, Sun-Yuan Hsieh, Hsin-Hung Chou, Jou-Ming Chang
The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks. IEEE Access 9 (2021)
Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller, Joe Ryan
Monitoring the edges of a graph using distances. CoRR (2020)
Chia-Wen Cheng, Sun-Yuan Hsieh, Ralf Klasing
Vulnerability of super extra edge-connected graphs. J. Comput. Syst. Sci. 108 (2020)
Shih-Chia Chang, Li-Hsuan Chen, Ling-Ju Hung, Shih-Shun Kao, Ralf Klasing
The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs. ICS (2020)
Florent Foucaud, Leszek Gasieniec, Ralf Klasing, Tomasz Radzik, Bill Smyth
IWOCA 2020 in Bordeaux (Oops! On-Line!). Bull. EATCS 132 (2020)
Jie-Fu Huang, Shih-Shun Kao, Sun-Yuan Hsieh, Ralf Klasing
Top-Down Construction of Independent Spanning Trees in Alternating Group Networks. IEEE Access 8 (2020)
Evangelos Bampas, Jurek Czyzowicz, David Ilcinkas, Ralf Klasing
Beachcombing on strips and islands. Theor. Comput. Sci. 806 (2020)
Ralf Klasing, Marc Zeitoun
Selected papers of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017. J. Comput. Syst. Sci. 114 (2020)
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing
-hub center routing problem in parameterized metric graphs. Theor. Comput. Sci. 806 (2020)
Florent Foucaud, Ralf Klasing, Mirka Miller, Joe Ryan
Monitoring the Edges of a Graph Using Distances. CALDAM (2020)
Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak
Linear Search by a Pair of Distinct-Speed Robots. Algorithmica 81 (1) (2019)
Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski
Improved Analysis of Deterministic Load-Balancing Schemes. ACM Trans. Algorithms 15 (1) (2019)
Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters
Computing Parameters of Sequence-Based Dynamic Graphs. Theory Comput. Syst. 63 (3) (2019)
Ralf Klasing, Tobias Mömke
A Modern View on Stability of Approximation. Adventures Between Lower Bounds and Higher Altitudes (2018)
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing
Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs. IWOCA (2018)
Li-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu
Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality. J. Comput. Syst. Sci. 92 (2018)
Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters
A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs. SIROCCO (2017)
Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski, Tomasz Radzik
Robustness of the Rotor-Router Mechanism. Algorithmica 78 (3) (2017)
Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors). SOFSEM (2017)
Florent Foucaud, Ralf Klasing
Parameterized and approximation complexity of the detection pair problem in graphs. J. Graph Algorithms Appl. 21 (6) (2017)
Ralf Klasing, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald
The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks. Distributed Comput. 30 (2) (2017)
Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Dominik Pajak
Collision-free network exploration. J. Comput. Syst. Sci. 86 (2017)
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing
The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality. COCOON (2017)
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality. CIAC (2017)
Ralf Klasing, Adrian Kosowski, Dominik Pajak
Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? SIROCCO (2016)
Florent Foucaud, Ralf Klasing
Parameterized and approximation complexity of the detection pair problem in graphs. CoRR (2016)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra
Gathering of robots on anonymous grids and trees without multiplicity detection. Theor. Comput. Sci. 610 (2016)
Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak
Linear Search by a Pair of Distinct-Speed Robots. SIROCCO (2016)
Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti
Network verification via routing table queries. J. Comput. Syst. Sci. 81 (1) (2015)
Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski
Improved Analysis of Deterministic Load-Balancing Schemes. PODC (2015)
Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner
Rendezvous of heterogeneous mobile agents in edge-weighted networks. Theor. Comput. Sci. 608 (2015)
Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters
Efficiently Testing T-Interval Connectivity in Dynamic Graphs. CoRR (2015)
Evangelos Bampas, Jurek Czyzowicz, David Ilcinkas, Ralf Klasing
Beachcombing on Strips and Islands. ALGOSENSORS (2015)
Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters
Efficiently Testing T -Interval Connectivity in Dynamic Graphs. CIAC (2015)
Ralf Klasing
Editorial. ACM J. Exp. Algorithmics 19 (1) (2014)
David Ilcinkas, Ralf Klasing, Ahmed Mouhamadou Wade
Exploration of Constantly Connected Dynamic Graphs Based on Cactuses. SIROCCO (2014)
Florent Foucaud, Ralf Klasing, Peter J. Slater
Centroidal bases in graphs. Networks 64 (2) (2014)
Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks. SIROCCO (2014)
Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner
Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks. CoRR (2014)
Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski
Be Fair and Be Selfish! Characterizing Deterministic Diffusive Load-Balancing Schemes with Small Discrepancy. CoRR (2014)
Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Dominik Pajak
Collision-Free Network Exploration. LATIN (2014)
Jean-Claude Bermond, Ralf Klasing, Nelson Morales, Stéphane Pérennes, Patricio Reyes
Gathering Radio Messages in the Path. Discret. Math. Algorithms Appl. 5 (1) (2013)
Ralf Klasing, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald
The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks. PODC (2013)
Ralf Klasing
Efficient Exploration of Anonymous Undirected Graphs. IWOCA (2013)
Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell Martin, Kunihiko Sadakane, Wing-Kin Sung
More efficient periodic traversal in anonymous undirected graphs. Theor. Comput. Sci. 444 (2012)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra
Gathering of Robots on Anonymous Grids without Multiplicity Detection. SIROCCO (2012)
Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud
On the size of identifying codes in triangle-free graphs. Discret. Appl. Math. 160 (10-11) (2012)
Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti
Network Verification via Routing Table Queries. SIROCCO (2011)
Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski
Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Comput. 24 (2) (2011)
Ralf Klasing, Adrian Kosowski, Alfredo Navarra
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring. Theor. Comput. Sci. 411 (34-36) (2010)
Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová
Improved Approximations for TSP with Simple Precedence Constraints. CIAC (2010)
Colin Cooper, Ralf Klasing, Tomasz Radzik
Locating and repairing faults in a network with mobile agents. Theor. Comput. Sci. 411 (14-15) (2010)
Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud
On the size of identifying codes in triangle-free graphs CoRR (2010)
Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung
More Efficient Periodic Traversal in Anonymous Undirected Graphs. SIROCCO (2009)
Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner, Alfredo Navarra
On the complexity of distributed graph coloring with local minimality constraints. Networks 54 (1) (2009)
Evangelos Bampas, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Tomasz Radzik
Robustness of the Rotor-router Mechanism. OPODIS (2009)
Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski
Euler Tour Lock-In Problem in the Rotor-Router Model. DISC (2009)
Ralf Klasing, Adrian Kosowski, Alfredo Navarra
Cost minimization in wireless networks with a bounded and unbounded number of interfaces. Networks 53 (3) (2009)
Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. ICALP (2) (2009)
Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stéphane Pérennes
From Balls and Bins to Points and Vertices. Algorithmic Oper. Res. 4 (2) (2009)
Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung
More efficient periodic traversal in anonymous undirected graphs CoRR (2009)
Juraj Hromkovic, Przemyslawa Kanarek, Ralf Klasing, Krzysztof Lorys, Walter Unger, Hubert Wagener
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. SIAM J. Discret. Math. 23 (3) (2009)
Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes
Tightening the upper bound for the minimum energy broadcasting. Wirel. Networks 14 (5) (2008)
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
Approximation bounds for Black Hole Search problems. Networks 52 (4) (2008)
Colin Cooper, Ralf Klasing, Tomasz Radzik
A randomized algorithm for the joining protocol in dynamic distributed networks. Theor. Comput. Sci. 406 (3) (2008)
Sylvain Gravier, Ralf Klasing, Julien Moncel
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs. Algorithmic Oper. Res. 3 (1) (2008)
Ralf Klasing, Nelson Morales, Stéphane Pérennes
On the complexity of bandwidth allocation in radio networks. Theor. Comput. Sci. 406 (3) (2008)
Leszek Gasieniec, Ralf Klasing, Russell A. Martin, Alfredo Navarra, Xiaohui Zhang
Fast periodic graph exploration with constant memory. J. Comput. Syst. Sci. 74 (5) (2008)
Ralf Klasing, Adrian Kosowski, Alfredo Navarra
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring. OPODIS (2008)
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On k-connectivity problems with sharpened triangle inequality. J. Discrete Algorithms 6 (4) (2008)
Ralf Klasing, Euripides Markou, Andrzej Pelc
Gathering asynchronous oblivious mobile robots in a ring. Theor. Comput. Sci. 390 (1) (2008)
Colin Cooper, Ralf Klasing, Tomasz Radzik
Locating and Repairing Faults in a Network with Mobile Agents. SIROCCO (2008)
Leszek Gasieniec, Ralf Klasing, Russell A. Martin, Alfredo Navarra, Xiaohui Zhang
Fast Periodic Graph Exploration with Constant Memory. SIROCCO (2007)
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
Hardness and approximation results for Black Hole Search in arbitrary networks. Theor. Comput. Sci. 384 (2-3) (2007)

Ralf Klasing.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ralf Klasing