| Select a publication |
| Show |
Title |
Venue |
Rating |
Date |
|
Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski.
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies.
|
Automata, Languages and Programming, 36th Internatilonal Collogquium, ICALP 2009, Rhodes, greece, July 5-12, 2009, Proceedings, Part II 2009 |
 (0)
|
2009 |
|
|
Evangelos Bampas, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Tomasz Radzik.
Robustness of the Rotor-router Mechanism.
|
Principles of Distributed Systems, 13th International Conference, OPODIS 2009, Nîmes, France, December 15-18, 2009. Proceedings 2009 |
(0)
|
2009 |
|
|
Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski.
Euler Tour Lock-In Problem in the Rotor-Router Model.
|
Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings 2009 |
(0)
|
2009 |
|
|
Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung Sung.
More efficient periodic traversal in anonymous undirected graphs
|
CoRR 2009, Volume 0 |
(0)
|
2009 |
|
|
Ralf Klasing, Adrian Kosowski, Alfredo Navarra.
Cost minimization in wireless networks with a bounded and unbounded number of interfaces.
|
Networks 2009, Volume 53 |
(0)
|
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. Discrete Math. 2009, Volume 23 |
(0)
|
2009 |
|
|
Ralf Klasing, Adrian Kosowski, Alfredo Navarra.
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring.
|
Principles of Distributed Systems, 12th International Conference, OPODIS 2008, Luxor, Egypt, December 15-18, 2008. Proceedings 2008 |
(0)
|
2008 |
|
|
Colin Cooper, Ralf Klasing, Tomasz Radzik.
Locating and Repairing Faults in a Network with Mobile Agents.
|
Structural Information and Communication Complexity, 15th International Colloquium, SIROCCO 2008, Villars-sur-Ollon, Switzerland, June 17-20, 2008, Proceedings 2008 |
(0)
|
2008 |
|
|
Leszek Gasieniec, Ralf Klasing, Russell A. Martin, Alfredo Navarra, Xiaohui Zhang.
Fast periodic graph exploration with constant memory.
|
J. Comput. Syst. Sci. 2008, Volume 74 |
(0)
|
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 2008, Volume 6 |
(0)
|
2008 |
|
|
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco.
Approximation bounds for Black Hole Search problems.
|
Networks 2008, Volume 52 |
(0)
|
2008 |
|
|
Ralf Klasing, Euripides Markou, Andrzej Pelc.
Gathering asynchronous oblivious mobile robots in a ring.
|
Theor. Comput. Sci. 2008, Volume 390 |
(0)
|
2008 |
|
|
Ralf Klasing, Nelson Morales, Stéphane Pérennes.
On the complexity of bandwidth allocation in radio networks.
|
Theor. Comput. Sci. 2008, Volume 406 |
(0)
|
2008 |
|
|
Colin Cooper, Ralf Klasing, Tomasz Radzik.
A randomized algorithm for the joining protocol in dynamic distributed networks.
|
Theor. Comput. Sci. 2008, Volume 406 |
(0)
|
2008 |
|
|
Michele Flammini, Ralf Klasing, Alfredo Navarra, Stéphane Pérennes.
Tightening the upper bound for the minimum energy broadcasting.
|
Wireless Networks 2008, Volume 14 |
(0)
|
2008 |
|
|
Leszek Gasieniec, Ralf Klasing, Russell A. Martin, Alfredo Navarra, Xiaohui Zhang.
Fast Periodic Graph Exploration with Constant Memory.
|
Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings 2007 |
(0)
|
2007 |
|
|
Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra.
On the Complexity of Distributed Greedy Coloring.
|
Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings 2007 |
(0)
|
2007 |
|
|
Ralf Klasing, Adrian Kosowski, Alfredo Navarra.
Cost Minimisation in Multi-interface Networks.
|
Network Control and Optimization, First EuroFGI International Conference, NET-COOP 2007, Avignon, France, June 5-7, 2007, Proceedings 2007 |
(0)
|
2007 |
|
|
Michele Flammini, Ralf Klasing, Alfredo Navarra, Stéphane Pérennes.
Improved Approximation Results for the Minimum Energy Broadcasting Problem.
|
Algorithmica 2007, Volume 49 |
(0)
|
2007 |
|
|
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco.
Hardness and approximation results for Black Hole Search in arbitrary networks.
|
Theor. Comput. Sci. 2007, Volume 384 |
(0)
|
2007 |
|
|
Ralf Klasing, Euripides Markou, Andrzej Pelc.
Gathering Asynchronous Oblivious Mobile Robots in a Ring.
|
Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings 2006 |
(0)
|
2006 |
|
|
Colin Cooper, Ralf Klasing, Tomasz Radzik.
Searching for Black-Hole Faults in a Network Using Multiple Agents.
|
Principles of Distributed Systems, 10th International Conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006, Proceedings 2006 |
(0)
|
2006 |
|
|
Jean-Claude Bermond, Nelson Morales, Stéphane Pérennes, Jérôme Galtier, Ralf Klasing.
Hardness and approximation of Gathering in static radio networks.
|
4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 13-17 March 2006, Pisa, Italy 2006 |
(0)
|
2006 |
|
|
Jean-Claude Bermond, Jérôme Galtier, Ralf Klasing, Nelson Morales, Stéphane Pérennes.
Hardness and Approximation of Gathering in Static Radio Networks.
|
Parallel Processing Letters 2006, Volume 16 |
(0)
|
2006 |
|
|
Ralf Klasing, Christian Laforest, Joseph Peters, Nicolas Thibault.
Constructing Incremental Sequences in Graphs.
|
Algorithmic Operations Research 2006, Volume 1 |
(0)
|
2006 |
|
|
Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stéphane Pérennes.
From Balls and Bins to Points and Vertices.
|
Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings 2005 |
(0)
|
2005 |
|
|
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco.
Approximation Bounds for Black Hole Search Problems.
|
Principles of Distributed Systems, 9th International Conference, OPODIS 2005, Pisa, Italy, December 12-14, 2005, Revised Selected Papers 2006 |
(0)
|
2005 |
|
|
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco.
Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs.
|
Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings 2005 |
(0)
|
2005 |
|
|
Colin Cooper, Ralf Klasing, Michele Zito.
Lower Bounds and Algorithms for Dominating Sets in Web Graphs.
|
Internet Mathematics 2005, Volume 2 |
(0)
|
2005 |
|
|
Michele Flammini, Alfredo Navarra, Ralf Klasing, Stéphane Pérennes.
Improved approximation results for the minimum energy broadcasting problem.
|
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Philadelphia, PA, USA, October 1, 2004 2004 |
(0)
|
2004 |
|
|
Ralf Klasing, Alfredo Navarra, Aris A. Papadopoulos, Stéphane Pérennes.
Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem.
|
NETWORKING 2004, Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication, Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004, Proceedings 2004 |
(0)
|
2004 |
|
|
Colin Cooper, Ralf Klasing, Michele Zito.
Dominating Sets in Web Graphs.
|
Algorithms and Models for the Web-Graph: Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004, Proceeedings 2004 |
(0)
|
2004 |
|
|
Ralf Klasing, Christian Laforest.
Hardness results and approximation algorithms of k-tuple domination in graphs.
|
Inf. Process. Lett. 2004, Volume 89 |
(0)
|
2004 |
|
|
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger.
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality.
|
Theor. Comput. Sci. 2004, Volume 326 |
(0)
|
2004 |
|
|
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger.
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality.
|
Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings 2003 |
(0)
|
2003 |
|
|
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger.
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality.
|
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings 2002 |
(0)
|
2002 |
|
|
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger.
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
|
Theor. Comput. Sci. 2002, Volume 285 |
(0)
|
2002 |
|
|
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger.
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem.
|
Algorithms and Complexity, 4th Italian Conference, CIAC 2000, Rome, Italy, March 2000, Proceedings 2000 |
(0)
|
2000 |
|
|
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger.
An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality.
|
STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings 2000 |
(0)
|
2000 |
|
|
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger.
Approximation algorithms for the TSP with sharpened triangle inequality.
|
Inf. Process. Lett. 2000, Volume 75 |
(0)
|
2000 |
|
|
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger.
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem
|
Electronic Colloquium on Computational Complexity (ECCC) 1999, Volume 6 |
(0)
|
1999 |
|
|
Ralf Klasing.
Improved Compressions of Cube-Connected Cycles Networks.
|
Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings 1998 |
(0)
|
1998 |
|
|
Ralf Klasing.
The Relationship between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width.
|
Discrete Applied Mathematics 1998, Volume 83 |
(0)
|
1998 |
|
|
Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger.
Optimal Embedding of Complete Binary Trees into Lines and Grids.
|
J. Parallel Distrib. Comput. 1998, Volume 49 |
(0)
|
1998 |
|
|
Ralf Klasing, Reinhard Lüling, Burkhard Monien.
Compressing cube-connected cycles and butterfly networks.
|
Networks 1998, Volume 32 |
(0)
|
1998 |
|
|
Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener.
Effective Systolic Algorithms for Gossiping in Cycles.
|
Parallel Processing Letters 1998, Volume 8 |
(0)
|
1998 |
|
|
Ralf Klasing.
Improved Compressions of Cube-Connected Cycles Networks.
|
IEEE Trans. Parallel Distrib. Syst. 1998, Volume 9 |
(0)
|
1998 |
|
|
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener.
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes.
|
Inf. Comput. 1997, Volume 133 |
(0)
|
1997 |
|
|
Juraj Hromkovic, Ralf Klasing, Elena Stöhr.
Dissemination of Information in Vertex-Disjoint Paths Mode.
|
Computers and Artificial Intelligence 1996, Volume 15 |
(0)
|
1996 |
|
|
Burkhard Monien, Ralf Diekmann, Rainer Feldmann, Ralf Klasing, Reinhard Lüling, Knuth Menzel, Thomas Römke, Ulf-Peter Schroeder.
Efficient Use of Parallel Distributed Systems: From Theory to Practice.
|
Computer Science Today: Recent Trends and Developments 1995, Volume 1000 |
(0)
|
1995 |
|
|
Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Walter Unger, Juraj Waczulík, Hubert Wagener.
Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract).
|
Fundamentals of Computation Theory, 10th International Symposium, FCT '95, Dresden, Germany, August 22-25, 1995, Proceedings 1995 |
(0)
|
1995 |
|
|
Juraj Hromkovic, Krzysztof Lorys, Przemyslawa Kanarek, Ralf Klasing, Walter Unger, Hubert Wagener.
On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
|
STACS 1995 |
(0)
|
1995 |
|
|
Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener.
Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs.
|
Inf. Comput. 1995, Volume 123 |
(0)
|
1995 |
|
|
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská.
The Complexity of Systolic Dissemination of Information in Interconnection Networks.
|
Parallel and Distributed Computing, First Canada-France Conference, Montréal, Canada, May 19-21, 1994, Proceedings 1994 |
(0)
|
1994 |
|
|
Ralf Klasing.
The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width.
|
Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings 1994 |
(0)
|
1994 |
|
|
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener.
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract).
|
Algorithm Theory - SWAT '94, 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings 1994 |
(0)
|
1994 |
|
|
Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr.
Broadcasting in Butterfly and deBruijn Networks.
|
Discrete Applied Mathematics 1994, Volume 53 |
(0)
|
1994 |
|
|
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská.
The Complexity of Systolic Dissemination of Information in Interconnection Networks.
|
ITA 1994, Volume 28 |
(0)
|
1994 |
|
|
Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener.
Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs.
|
Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings 1993 |
(0)
|
1993 |
|
|
Burkhard Monien, Rainer Feldmann, Ralf Klasing, Reinhard Lüling.
Parallel Architectures: Design and Efficient Use.
|
STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings 1993 |
(0)
|
1993 |
|
|
Juraj Hromkovic, Ralf Klasing, Elena Stöhr.
Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks.
|
Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings 1994 |
(0)
|
1993 |
|
|
Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr.
Broadcasting in Butterfly and DeBruijn Networks.
|
STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings 1992 |
(0)
|
1992 |
|
|
Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger.
Optimal Embedding of Complete Binary Trees into Lines and Grids.
|
17th International Workshop, WG '91, Fischbachau, Germany, June 17-19, 1991, Proceedings 1992 |
(0)
|
1991 |
|
|
Ralf Klasing, Reinhard Lüling, Burkhard Monien.
Compressing cube-connected cycles and butterfly networks.
|
SPDP 1990 |
(0)
|
1990 |
k/RalfKlasing