Ralf Klasing

176 papers A* 2A 9B 29C 16Misc 1Journal 103Unranked 11
YearRankTypeTitle / Venue / Authors
2026 J jnl
Approximation algorithm for connected Roman k-dominating set.
J. Comput. Syst. Sci.
Mengmeng He, Ralf Klasing, Yaping Mao, Xiaoyan Zhang
2026 J jnl
Greediness is not always a vice: Efficient discovery algorithms for assignment problems.
Discret. Appl. Math.
Romaric Duvignau, Noël Gillet, Ralf Klasing
2026 J jnl
On the g-extra connectivity of graphs.
J. Comput. Syst. Sci.
Zhao Wang, Yaping Mao, Sun-Yuan Hsieh, Ralf Klasing
2026 J jnl
On the hardness and approximation of the densest k-subgraph problem in parameterized metric graphs.
Acta Informatica
Shih-Chia Chang, Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Shih-Shun Kao, Ralf Klasing
2026 J jnl
Online knapsack with removal and recourse.
J. Comput. Syst. Sci.
Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner
2026 J jnl
Ramsey achievement games on graphs : algorithms and bounds.
Acta Informatica
Xiumin Wang, Zhong Huang, Xiangqian Zhou, Ralf Klasing, Yaping Mao
2025 J jnl
Constructing disjoint Steiner trees in Sierpiński graphs.
Fundam. Informaticae
Chenxu Yang, Ping Li, Yaping Mao, Eddie Cheng, Ralf Klasing
2025 J jnl
Fault-tolerance in distance-edge-monitoring sets.
Acta Informatica
Chenxu Yang, Yaping Mao, Ralf Klasing, Gang Yang, Yuzhi Xiao, Xiaoyan Zhang
2025 J jnl
Geographical Peer Matching for P2P Energy Sharing.
IEEE Access
Romaric Duvignau, Vincenzo Gulisano, Marina Papatriantafilou, Ralf Klasing
2025 J jnl
Graph Exploration with Edge Weight Estimates.
CoRR
Matthias Gehnen, Ralf Klasing, Émile Naquin
2025 J jnl
Linear programming of monitoring the links of a fractional weighted network using distance.
Inf. Comput.
Wen Li, Yaping Mao, Ralf Klasing
2025 J jnl
Monitoring the edges of product networks using distances.
J. Comput. Syst. Sci.
Wen Li, Ralf Klasing, Yaping Mao, Bo Ning
2025 J jnl
Online Unbounded Knapsack.
Theory Comput. Syst.
Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker
2025 J jnl
The
CoRR
Zhao Wang, Yaping Mao, Sun-Yuan Hsieh, Ralf Klasing
2025 J jnl
The distance-edge-monitoring numbers of subdivision graphs.
Discret. Appl. Math.
Zhen Ji, Zhiwei Guo, Eddie Cheng, Ralf Klasing, Yaping Mao
2025 J jnl
The g-good-neighbor diagnosability of product networks under the PMC model.
Inf. Comput.
Zhao Wang, Yaping Mao, Sun-Yuan Hsieh, Ralf Klasing
2024 B conf
Algorithms and Complexity for Path Covers of Temporal DAGs.
MFCS
Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing
2024 J jnl
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
CoRR
Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing
2024 J jnl
Erdös-Gallai-type problems for distance-edge-monitoring numbers.
Discret. Appl. Math.
Zhen Ji, Ralf Klasing, Wen Li, Yaping Mao, Xiaoyan Zhang
2024 J jnl
Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems.
CoRR
Romaric Duvignau, Noël Gillet, Ralf Klasing
2024 — conf
Improved Approximation Algorithms for Patrol-Scheduling with Min-Max Latency Using Multiclass Minimum Spanning Forests.
AAIM (2)
Li-Hsuan Chen, Ling-Ju Hung, Ralf Klasing
2024 J jnl
Monitoring the edges of a graph using distances with given girth.
J. Comput. Syst. Sci.
Chenxu Yang, Gang Yang, Sun-Yuan Hsieh, Yaping Mao, Ralf Klasing
2024 J jnl
On the distance-edge-monitoring numbers of graphs.
Discret. Appl. Math.
Chenxu Yang, Ralf Klasing, Yaping Mao, Xingchao Deng
2024 J jnl
Online Unbounded Knapsack.
CoRR
Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker
2024 J jnl
Perpetual maintenance of machines with different urgency requirements.
J. Comput. Syst. Sci.
Leszek Gasieniec, Tomasz Jurdzinski, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
2024 J jnl
Perturbation Results for Distance-edge-monitoring Numbers.
Fundam. Informaticae
Chenxu Yang, Ralf Klasing, Changxiang He, Yaping Mao
2024 B ed.
SOFSEM 2024: Theory and Practice of Computer Science - 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19-23, 2024, Proceedings
SOFSEM
Henning Fernau, Serge Gaspers, Ralf Klasing
2024 J jnl
The g-extra connectivity of graph products.
J. Comput. Syst. Sci.
Zhao Wang, Yaping Mao, Sun-Yuan Hsieh, Ralf Klasing, Yuzhi Xiao
2024 J jnl
The number of spanning trees for Sierpiński graphs and data center networks.
Inf. Comput.
Xiaojuan Zhang, Gang Yang, Changxiang He, Ralf Klasing, Yaping Mao
2023 J jnl
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks.
J. Parallel Distributed Comput.
Shih-Shun Kao, Ralf Klasing, Ling-Ju Hung, Chia-Wei Lee, Sun-Yuan Hsieh
2023 J jnl
Constructing disjoint Steiner trees in Sierpiński graphs.
CoRR
Chenxu Yang, Ping Li, Yaping Mao, Eddie Cheng, Ralf Klasing
2023 C conf
Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems.
LAGOS
Romaric Duvignau, Ralf Klasing
2023 C conf
Online Knapsack with Removal and Recourse.
IWOCA
Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner
2023 J jnl
Perturbation results for distance-edge-monitoring numbers.
CoRR
Chenxu Yang, Ralf Klasing, Changxiang He, Yaping Mao
2023 J jnl
The RED-BLUE SEPARATION problem on graphs.
Theor. Comput. Sci.
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
2022 J jnl
Hardness and approximation for the star
Theor. Comput. Sci.
Hao-Ping Yeh, Wei Lu, Li-Hsuan Chen, Ling-Ju Hung, Ralf Klasing, Sun-Yuan Hsieh
2022 J jnl
Monitoring the edges of a graph using distances.
Discret. Appl. Math.
Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller, Joe Ryan
2022 J jnl
Monitoring the edges of product networks using distances.
CoRR
Wen Li, Ralf Klasing, Yaping Mao, Bo Ning
2022 A ed.
New Trends in Computer Technologies and Applications - 25th International Computer Symposium, ICS 2022, Taoyuan, Taiwan, December 15-17, 2022, Proceedings
ICS
Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Sheng-Lung Peng
2022 J jnl
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality.
Algorithmica
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing
2022 J jnl
On the distance-edge-monitoring numbers of graphs.
CoRR
Chengxu Yang, Ralf Klasing, Yaping Mao, Xingchao Deng
2022 J jnl
Perpetual maintenance of machines with different urgency requirements.
CoRR
Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
2022 J jnl
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020.
Algorithmica
Leszek Gasieniec, Ralf Klasing, Tomasz Radzik
2022 J jnl
The RED-BLUE SEPARATION problem on graphs.
CoRR
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
2022 C conf
The Red-Blue Separation Problem on Graphs.
IWOCA
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
2021 C conf
A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks.
AAIM
Shih-Shun Kao, Ralf Klasing, Ling-Ju Hung, Sun-Yuan Hsieh
2021 C ed.
Algorithms for Sensor Systems - 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2021, Lisbon, Portugal, September 9-10, 2021, Proceedings
ALGOSENSORS
Leszek Gasieniec, Ralf Klasing, Tomasz Radzik
2021 J jnl
The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks.
IEEE Access
Yi-Cheng Yang, Shih-Shun Kao, Ralf Klasing, Sun-Yuan Hsieh, Hsin-Hung Chou, Jou-Ming Chang
2020 J jnl
Approximation algorithms for the
Theor. Comput. Sci.
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing
2020 J jnl
Beachcombing on strips and islands.
Theor. Comput. Sci.
Evangelos Bampas, Jurek Czyzowicz, David Ilcinkas, Ralf Klasing
2020 C ed.
Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings
IWOCA
Leszek Gasieniec, Ralf Klasing, Tomasz Radzik
2020 J jnl
IWOCA 2020 in Bordeaux (Oops! On-Line!).
Bull. EATCS
Florent Foucaud, Leszek Gasieniec, Ralf Klasing, Tomasz Radzik, Bill Smyth
2020 — conf
Monitoring the Edges of a Graph Using Distances.
CALDAM
Florent Foucaud, Ralf Klasing, Mirka Miller, Joe Ryan
2020 J jnl
Monitoring the edges of a graph using distances.
CoRR
Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller, Joe Ryan
2020 J jnl
Selected papers of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017.
J. Comput. Syst. Sci.
Ralf Klasing, Marc Zeitoun
2020 A conf
The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs.
ICS
Shih-Chia Chang, Li-Hsuan Chen, Ling-Ju Hung, Shih-Shun Kao, Ralf Klasing
2020 J jnl
Top-Down Construction of Independent Spanning Trees in Alternating Group Networks.
IEEE Access
Jie-Fu Huang, Shih-Shun Kao, Sun-Yuan Hsieh, Ralf Klasing
2020 J jnl
Vulnerability of super extra edge-connected graphs.
J. Comput. Syst. Sci.
Chia-Wen Cheng, Sun-Yuan Hsieh, Ralf Klasing
2019 J jnl
Computing Parameters of Sequence-Based Dynamic Graphs.
Theory Comput. Syst.
Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters
2019 J jnl
Improved Analysis of Deterministic Load-Balancing Schemes.
ACM Trans. Algorithms
Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski
2019 J jnl
Linear Search by a Pair of Distinct-Speed Robots.
Algorithmica
Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak
2018 — conf
A Modern View on Stability of Approximation.
Adventures Between Lower Bounds and Higher Altitudes
Ralf Klasing, Tobias Mömke
2018 J jnl
Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality.
J. Comput. Syst. Sci.
Li-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu
2018 C conf
Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs.
IWOCA
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing
2017 B conf
A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs.
SIROCCO
Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters
2017 C ed.
Algorithms for Sensor Systems - 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers
ALGOSENSORS
Marek Chrobak, Antonio Fernández Anta, Leszek Gasieniec, Ralf Klasing
2017 B conf
Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors).
SOFSEM
Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
2017 J jnl
Collision-free network exploration.
J. Comput. Syst. Sci.
Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Dominik Pajak
2017 B ed.
Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings
FCT
Ralf Klasing, Marc Zeitoun
2017 C conf
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality.
CIAC
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu
2017 J jnl
Parameterized and approximation complexity of the detection pair problem in graphs.
J. Graph Algorithms Appl.
Florent Foucaud, Ralf Klasing
2017 J jnl
Robustness of the Rotor-Router Mechanism.
Algorithmica
Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski, Tomasz Radzik
2017 Misc conf
The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality.
COCOON
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing
2017 J jnl
The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks.
Distributed Comput.
Ralf Klasing, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald
2016 J jnl
Gathering of robots on anonymous grids and trees without multiplicity detection.
Theor. Comput. Sci.
Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra
2016 B conf
Linear Search by a Pair of Distinct-Speed Robots.
SIROCCO
Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak
2016 J jnl
Parameterized and approximation complexity of the detection pair problem in graphs.
CoRR
Florent Foucaud, Ralf Klasing
2016 B conf
Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?
SIROCCO
Ralf Klasing, Adrian Kosowski, Dominik Pajak
2015 C conf
Beachcombing on Strips and Islands.
ALGOSENSORS
Evangelos Bampas, Jurek Czyzowicz, David Ilcinkas, Ralf Klasing
2015 C conf
Efficiently Testing T -Interval Connectivity in Dynamic Graphs.
CIAC
Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters
2015 J jnl
Efficiently Testing T-Interval Connectivity in Dynamic Graphs.
CoRR
Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters
2015 A* conf
Improved Analysis of Deterministic Load-Balancing Schemes.
PODC
Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski
2015 J jnl
Network verification via routing table queries.
J. Comput. Syst. Sci.
Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti
2015 J jnl
Rendezvous of heterogeneous mobile agents in edge-weighted networks.
Theor. Comput. Sci.
Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner
2014 J jnl
Be Fair and Be Selfish! Characterizing Deterministic Diffusive Load-Balancing Schemes with Small Discrepancy.
CoRR
Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski
2014 J jnl
Centroidal bases in graphs.
Networks
Florent Foucaud, Ralf Klasing, Peter J. Slater
2014 B conf
Collision-Free Network Exploration.
LATIN
Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Dominik Pajak
2014 J jnl
Editorial.
ACM J. Exp. Algorithmics
Ralf Klasing
2014 B conf
Exploration of Constantly Connected Dynamic Graphs Based on Cactuses.
SIROCCO
David Ilcinkas, Ralf Klasing, Ahmed Mouhamadou Wade
2014 B conf
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks.
SIROCCO
Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner
2014 J jnl
Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks.
CoRR
Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner
2013 C conf
Efficient Exploration of Anonymous Undirected Graphs.
IWOCA
Ralf Klasing
2013 J jnl
Gathering Radio Messages in the Path.
Discret. Math. Algorithms Appl.
Jean-Claude Bermond, Ralf Klasing, Nelson Morales, Stéphane Pérennes, Patricio Reyes
2013 A* conf
The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks.
PODC
Ralf Klasing, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald
2012 B ed.
Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings
SEA
Ralf Klasing
2012 B conf
Gathering of Robots on Anonymous Grids without Multiplicity Detection.
SIROCCO
Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra
2012 J jnl
More efficient periodic traversal in anonymous undirected graphs.
Theor. Comput. Sci.
Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell Martin, Kunihiko Sadakane, Wing-Kin Sung
2012 J jnl
On the size of identifying codes in triangle-free graphs.
Discret. Appl. Math.
Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud
2011 J jnl
Derandomizing random walks in undirected graphs using locally fair exploration strategies.
Distributed Comput.
Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski
2011 B conf
Network Verification via Routing Table Queries.
SIROCCO
Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti
2010 — ch.
Data Gathering in Wireless Networks.
Graphs and Algorithms in Communication Networks
Vincenzo Bonifaci, Ralf Klasing, Peter Korteweg, Leen Stougie, Alberto Marchetti-Spaccamela
2010 — ch.
Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks.
Graphs and Algorithms in Communication Networks
Alfredo Navarra, Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Ralf Klasing
2010 C conf
Improved Approximations for TSP with Simple Precedence Constraints.
CIAC
Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová
2010 J jnl
Locating and repairing faults in a network with mobile agents.
Theor. Comput. Sci.
Colin Cooper, Ralf Klasing, Tomasz Radzik
2010 J jnl
On the size of identifying codes in triangle-free graphs
CoRR
Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud
2010 J jnl
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring.
Theor. Comput. Sci.
Ralf Klasing, Adrian Kosowski, Alfredo Navarra
2009 J jnl
Cost minimization in wireless networks with a bounded and unbounded number of interfaces.
Networks
Ralf Klasing, Adrian Kosowski, Alfredo Navarra
2009 — conf
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies.
ICALP (2)
Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski
2009 A conf
Euler Tour Lock-In Problem in the Rotor-Router Model.
DISC
Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski
2009 J jnl
From Balls and Bins to Points and Vertices.
Algorithmic Oper. Res.
Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stéphane Pérennes
2009 B conf
More Efficient Periodic Traversal in Anonymous Undirected Graphs.
SIROCCO
Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung
2009 J jnl
More efficient periodic traversal in anonymous undirected graphs
CoRR
Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung
2009 J jnl
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
SIAM J. Discret. Math.
Juraj Hromkovic, Przemyslawa Kanarek, Ralf Klasing, Krzysztof Lorys, Walter Unger, Hubert Wagener
2009 J jnl
On the complexity of distributed graph coloring with local minimality constraints.
Networks
Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner, Alfredo Navarra
2009 B conf
Robustness of the Rotor-router Mechanism.
OPODIS
Evangelos Bampas, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Tomasz Radzik
2008 J jnl
A randomized algorithm for the joining protocol in dynamic distributed networks.
Theor. Comput. Sci.
Colin Cooper, Ralf Klasing, Tomasz Radzik
2008 J jnl
Approximation bounds for Black Hole Search problems.
Networks
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
2008 J jnl
Fast periodic graph exploration with constant memory.
J. Comput. Syst. Sci.
Leszek Gasieniec, Ralf Klasing, Russell A. Martin, Alfredo Navarra, Xiaohui Zhang
2008 J jnl
Gathering asynchronous oblivious mobile robots in a ring.
Theor. Comput. Sci.
Ralf Klasing, Euripides Markou, Andrzej Pelc
2008 J jnl
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs.
Algorithmic Oper. Res.
Sylvain Gravier, Ralf Klasing, Julien Moncel
2008 B conf
Locating and Repairing Faults in a Network with Mobile Agents.
SIROCCO
Colin Cooper, Ralf Klasing, Tomasz Radzik
2008 J jnl
On k-connectivity problems with sharpened triangle inequality.
J. Discrete Algorithms
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
2008 J jnl
On the complexity of bandwidth allocation in radio networks.
Theor. Comput. Sci.
Ralf Klasing, Nelson Morales, Stéphane Pérennes
2008 B conf
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring.
OPODIS
Ralf Klasing, Adrian Kosowski, Alfredo Navarra
2008 J jnl
Tightening the upper bound for the minimum energy broadcasting.
Wirel. Networks
Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes
2007 — conf
Cost Minimisation in Multi-interface Networks.
NET-COOP
Ralf Klasing, Adrian Kosowski, Alfredo Navarra
2007 B conf
Fast Periodic Graph Exploration with Constant Memory.
SIROCCO
Leszek Gasieniec, Ralf Klasing, Russell A. Martin, Alfredo Navarra, Xiaohui Zhang
2007 J jnl
Hardness and approximation results for Black Hole Search in arbitrary networks.
Theor. Comput. Sci.
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
2007 J jnl
Improved Approximation Results for the Minimum Energy Broadcasting Problem.
Algorithmica
Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes
2007 A conf
On the Complexity of Distributed Greedy Coloring.
DISC
Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra
2006 J jnl
Constructing Incremental Sequences in Graphs.
Algorithmic Oper. Res.
Ralf Klasing, Christian Laforest, Joseph G. Peters, Nicolas Thibault
2006 B conf
Gathering Asynchronous Oblivious Mobile Robots in a Ring.
ISAAC
Ralf Klasing, Euripides Markou, Andrzej Pelc
2006 J jnl
Hardness and Approximation of Gathering in Static Radio Networks.
Parallel Process. Lett.
Jean-Claude Bermond, Jérôme Galtier, Ralf Klasing, Nelson Morales, Stephane Perennes
2006 — conf
Hardness and approximation of Gathering in static radio networks.
PerCom Workshops
Jean-Claude Bermond, Nelson Morales, Stéphane Pérennes, Jérôme Galtier, Ralf Klasing
2006 B conf
Searching for Black-Hole Faults in a Network Using Multiple Agents.
OPODIS
Colin Cooper, Ralf Klasing, Tomasz Radzik
2005 B conf
Approximation Bounds for Black Hole Search Problems.
OPODIS
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
2005 — book
Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
Juraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger
2005 B conf
From Balls and Bins to Points and Vertices.
ISAAC
Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes
2005 B conf
Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs.
SIROCCO
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
2005 J jnl
Lower Bounds and Algorithms for Dominating Sets in Web Graphs.
Internet Math.
Colin Cooper, Ralf Klasing, Michele Zito
2004 B conf
Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem.
NETWORKING
Ralf Klasing, Alfredo Navarra, Aris A. Papadopoulos, Stephane Perennes
2004 C conf
Dominating Sets in Web Graphs.
WAW
Colin Cooper, Ralf Klasing, Michele Zito
2004 J jnl
Hardness results and approximation algorithms of k-tuple domination in graphs.
Inf. Process. Lett.
Ralf Klasing, Christian Laforest
2004 — conf
Improved approximation results for the minimum energy broadcasting problem.
DIALM-POMC
Michele Flammini, Alfredo Navarra, Ralf Klasing, Stéphane Pérennes
2004 J jnl
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
2003 C conf
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality.
CIAC
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
2002 — conf
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality.
FSTTCS
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
2002 J jnl
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
2000 A conf
An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality.
STACS
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
2000 J jnl
Approximation algorithms for the TSP with sharpened triangle inequality.
Inf. Process. Lett.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
2000 C conf
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem.
CIAC
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
1999 J jnl
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem
Electron. Colloquium Comput. Complex.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
1998 J jnl
Compressing cube-connected cycles and butterfly networks.
Networks
Ralf Klasing, Reinhard Lüling, Burkhard Monien
1998 J jnl
Effective Systolic Algorithms for Gossiping in Cycles.
Parallel Process. Lett.
Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener
1998 B conf
Improved Compressions of Cube-Connected Cycles Networks.
WG
Ralf Klasing
1998 J jnl
Improved Compressions of Cube-Connected Cycles Networks.
IEEE Trans. Parallel Distributed Syst.
Ralf Klasing
1998 J jnl
Optimal Embedding of Complete Binary Trees into Lines and Grids.
J. Parallel Distributed Comput.
Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger
1998 J jnl
The Relationship between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width.
Discret. Appl. Math.
Ralf Klasing
1997 J jnl
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes.
Inf. Comput.
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener
1996 J jnl
Dissemination of Information in Vertex-Disjoint Paths Mode.
Comput. Artif. Intell.
Juraj Hromkovic, Ralf Klasing, Elena Stöhr
1996 — book
On the Complexity of Broadcast and Gossip in Different Communication Modes.
Ralf Klasing
1995 B conf
Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract).
FCT
Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Walter Unger, Juraj Waczulík, Hubert Wagener
1995 — ch.
Efficient Use of Parallel & Distributed Systems: From Theory to Practice.
Computer Science Today
Burkhard Monien, Ralf Diekmann, Rainer Feldmann, Ralf Klasing, Reinhard Lüling, Knut Menzel, Thomas Römke, Ulf-Peter Schroeder
1995 J jnl
Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs.
Inf. Comput.
Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener
1995 A conf
On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
STACS
Juraj Hromkovic, Krzysztof Lorys, Przemyslawa Kanarek, Ralf Klasing, Walter Unger, Hubert Wagener
1994 J jnl
Broadcasting in Butterfly and deBruijn Networks.
Discret. Appl. Math.
Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr
1994 — conf
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract).
SWAT
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener
1994 — conf
The Complexity of Systolic Dissemination of Information in Interconnection Networks.
Canada-France Conference on Parallel and Distributed Computing
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská
1994 J jnl
The Complexity of Systolic Dissemination of Information in Interconnection Networks.
RAIRO Theor. Informatics Appl.
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská
1994 B conf
The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width.
MFCS
Ralf Klasing
1993 B conf
Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks.
WG
Juraj Hromkovic, Ralf Klasing, Elena Stöhr
1993 A conf
Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs.
ESA
Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener
1993 A conf
Parallel Architectures: Design and Efficient Use.
STACS
Burkhard Monien, Rainer Feldmann, Ralf Klasing, Reinhard Lüling
1992 A conf
Broadcasting in Butterfly and DeBruijn Networks.
STACS
Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr
1991 B conf
Optimal Embedding of Complete Binary Trees into Lines and Grids.
WG
Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger
1990 — conf
Compressing cube-connected cycles and butterfly networks.
SPDP
Ralf Klasing, Reinhard Lüling, Burkhard Monien