The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ralf Klasing: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská
    The Complexity of Systolic Dissemination of Information in Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Canada-France Conference on Parallel and Distributed Computing, 1994, pp:235-249 [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:189-200 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:72-86 [Conf]
  4. Michele Flammini, Alfredo Navarra, Ralf Klasing, Stéphane Pérennes
    Improved approximation results for the minimum energy broadcasting problem. [Citation Graph (0, 0)][DBLP]
    DIALM-POMC, 2004, pp:85-91 [Conf]
  5. Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener
    Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:200-211 [Conf]
  6. 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). [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:273-282 [Conf]
  7. 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. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:59-70 [Conf]
  8. Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes
    From Balls and Bins to Points and Vertices. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:757-766 [Conf]
  9. Ralf Klasing, Euripides Markou, Andrzej Pelc
    Gathering Asynchronous Oblivious Mobile Robots in a Ring. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:744-753 [Conf]
  10. Ralf Klasing
    The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:473-483 [Conf]
  11. Ralf Klasing, Alfredo Navarra, Aris A. Papadopoulos, Stephane Perennes
    Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem. [Citation Graph (0, 0)][DBLP]
    NETWORKING, 2004, pp:866-877 [Conf]
  12. Colin Cooper, Ralf Klasing, Tomasz Radzik
    Searching for Black-Hole Faults in a Network Using Multiple Agents. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2006, pp:320-332 [Conf]
  13. Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
    Approximation Bounds for Black Hole Search Problems. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:261-274 [Conf]
  14. Jean-Claude Bermond, Nelson Morales, Stéphane Pérennes, Jérôme Galtier, Ralf Klasing
    Hardness and approximation of Gathering in static radio networks. [Citation Graph (0, 0)][DBLP]
    PerCom Workshops, 2006, pp:75-79 [Conf]
  15. Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
    Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:200-215 [Conf]
  16. Ralf Klasing, Reinhard Lüling, Burkhard Monien
    Compressing cube-connected cycles and butterfly networks. [Citation Graph (0, 0)][DBLP]
    SPDP, 1990, pp:858-865 [Conf]
  17. 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. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:382-394 [Conf]
  18. 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. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:255-266 [Conf]
  19. Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr
    Broadcasting in Butterfly and DeBruijn Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:351-362 [Conf]
  20. Burkhard Monien, Rainer Feldmann, Ralf Klasing, Reinhard Lüling
    Parallel Architectures: Design and Efficient Use. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:247-269 [Conf]
  21. Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener
    Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:219-230 [Conf]
  22. Colin Cooper, Ralf Klasing, Michele Zito
    Dominating Sets in Web Graphs. [Citation Graph (0, 0)][DBLP]
    WAW, 2004, pp:31-43 [Conf]
  23. Juraj Hromkovic, Ralf Klasing, Elena Stöhr
    Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:288-300 [Conf]
  24. Ralf Klasing
    Improved Compressions of Cube-Connected Cycles Networks. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:242-256 [Conf]
  25. Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger
    Optimal Embedding of Complete Binary Trees into Lines and Grids. [Citation Graph (0, 0)][DBLP]
    WG, 1991, pp:25-35 [Conf]
  26. Juraj Hromkovic, Ralf Klasing, Elena Stöhr
    Dissemination of Information in Vertex-Disjoint Paths Mode. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 1996, v:15, n:4, pp:- [Journal]
  27. Ralf Klasing
    The Relationship between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:229-246 [Journal]
  28. Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr
    Broadcasting in Butterfly and deBruijn Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:183-197 [Journal]
  29. 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 [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:31, pp:- [Journal]
  30. Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener
    Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:123, n:1, pp:17-28 [Journal]
  31. Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener
    Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:133, n:1, pp:1-33 [Journal]
  32. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    Approximation algorithms for the TSP with sharpened triangle inequality. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:3, pp:133-138 [Journal]
  33. Ralf Klasing, Christian Laforest
    Hardness results and approximation algorithms of k-tuple domination in graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:2, pp:75-83 [Journal]
  34. Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská
    The Complexity of Systolic Dissemination of Information in Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    ITA, 1994, v:28, n:3-4, pp:303-342 [Journal]
  35. Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger
    Optimal Embedding of Complete Binary Trees into Lines and Grids. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:49, n:1, pp:40-56 [Journal]
  36. Ralf Klasing, Reinhard Lüling, Burkhard Monien
    Compressing cube-connected cycles and butterfly networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:32, n:1, pp:47-65 [Journal]
  37. Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener
    Effective Systolic Algorithms for Gossiping in Cycles. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:2, pp:197-205 [Journal]
  38. Jean-Claude Bermond, Jérôme Galtier, Ralf Klasing, Nelson Morales, Stephane Perennes
    Hardness and Approximation of Gathering in Static Radio Networks. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2006, v:16, n:2, pp:165-184 [Journal]
  39. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:137-153 [Journal]
  40. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:285, n:1, pp:3-24 [Journal]
  41. Ralf Klasing
    Improved Compressions of Cube-Connected Cycles Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:8, pp:803-812 [Journal]
  42. Ralf Klasing, Christian Laforest, Joseph Peters, Nicolas Thibault
    Constructing Incremental Sequences in Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmic Operations Research, 2006, v:1, n:2, pp:- [Journal]
  43. Leszek Gasieniec, Ralf Klasing, Russell Martin, Alfredo Navarra, Xiaohui Zhang
    Fast Periodic Graph Exploration with Constant Memory. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:26-40 [Conf]
  44. Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra
    On the Complexity of Distributed Greedy Coloring. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:482-484 [Conf]
  45. Ralf Klasing, Adrian Kosowski, Alfredo Navarra
    Cost Minimisation in Multi-interface Networks. [Citation Graph (0, 0)][DBLP]
    NET-COOP, 2007, pp:276-285 [Conf]
  46. Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
    Hardness and approximation results for Black Hole Search in arbitrary networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:2-3, pp:201-221 [Journal]

  47. Improved Approximations for TSP with Simple Precedence Constraints. [Citation Graph (, )][DBLP]


  48. Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. [Citation Graph (, )][DBLP]


  49. Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring. [Citation Graph (, )][DBLP]


  50. Robustness of the Rotor-router Mechanism. [Citation Graph (, )][DBLP]


  51. Locating and Repairing Faults in a Network with Mobile Agents. [Citation Graph (, )][DBLP]


  52. More Efficient Periodic Traversal in Anonymous Undirected Graphs. [Citation Graph (, )][DBLP]


  53. Euler Tour Lock-In Problem in the Rotor-Router Model. [Citation Graph (, )][DBLP]


  54. Improved Approximation Results for the Minimum Energy Broadcasting Problem. [Citation Graph (, )][DBLP]


  55. More efficient periodic traversal in anonymous undirected graphs [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002