dblp.uni-trier.dewww.uni-trier.de

Ralf Klasing Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
64EEEvangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski: Euler Tour Lock-In Problem in the Rotor-Router Model. DISC 2009: 423-435
63EEColin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski: Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. ICALP (2) 2009: 411-422
62EEJurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, R. Martin, Kunihiko Sadakane, W.-K. Sung: More efficient periodic traversal in anonymous undirected graphs CoRR abs/0905.1737: (2009)
61EERalf Klasing, Adrian Kosowski, Alfredo Navarra: Cost minimization in wireless networks with a bounded and unbounded number of interfaces. Networks 53(3): 266-275 (2009)
2008
60EERalf Klasing, Adrian Kosowski, Alfredo Navarra: Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring. OPODIS 2008: 446-462
59EEColin Cooper, Ralf Klasing, Tomasz Radzik: Locating and Repairing Faults in a Network with Mobile Agents. SIROCCO 2008: 20-32
58EELeszek Gasieniec, Ralf Klasing, Russell A. Martin, Alfredo Navarra, Xiaohui Zhang: Fast periodic graph exploration with constant memory. J. Comput. Syst. Sci. 74(5): 808-822 (2008)
57EEHans-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): 605-617 (2008)
56EERalf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco: Approximation bounds for Black Hole Search problems. Networks 52(4): 216-226 (2008)
55EERalf Klasing, Euripides Markou, Andrzej Pelc: Gathering asynchronous oblivious mobile robots in a ring. Theor. Comput. Sci. 390(1): 27-39 (2008)
54EERalf Klasing, Nelson Morales, Stéphane Pérennes: On the complexity of bandwidth allocation in radio networks. Theor. Comput. Sci. 406(3): 225-239 (2008)
53EEColin Cooper, Ralf Klasing, Tomasz Radzik: A randomized algorithm for the joining protocol in dynamic distributed networks. Theor. Comput. Sci. 406(3): 248-262 (2008)
52EEMichele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes: Tightening the upper bound for the minimum energy broadcasting. Wireless Networks 14(5): 659-669 (2008)
2007
51EECyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra: On the Complexity of Distributed Greedy Coloring. DISC 2007: 482-484
50EERalf Klasing, Adrian Kosowski, Alfredo Navarra: Cost Minimisation in Multi-interface Networks. NET-COOP 2007: 276-285
49EELeszek Gasieniec, Ralf Klasing, Russell A. Martin, Alfredo Navarra, Xiaohui Zhang: Fast Periodic Graph Exploration with Constant Memory. SIROCCO 2007: 26-40
48EEMichele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes: Improved Approximation Results for the Minimum Energy Broadcasting Problem. Algorithmica 49(4): 318-336 (2007)
47EERalf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco: Hardness and approximation results for Black Hole Search in arbitrary networks. Theor. Comput. Sci. 384(2-3): 201-221 (2007)
2006
46EERalf Klasing, Euripides Markou, Andrzej Pelc: Gathering Asynchronous Oblivious Mobile Robots in a Ring. ISAAC 2006: 744-753
45EEColin Cooper, Ralf Klasing, Tomasz Radzik: Searching for Black-Hole Faults in a Network Using Multiple Agents. OPODIS 2006: 320-332
44EEJean-Claude Bermond, Nelson Morales, Stéphane Pérennes, Jérôme Galtier, Ralf Klasing: Hardness and approximation of Gathering in static radio networks. PerCom Workshops 2006: 75-79
43EERalf Klasing, Christian Laforest, Joseph Peters, Nicolas Thibault: Constructing Incremental Sequences in Graphs. Algorithmic Operations Research 1(2): (2006)
42EEJean-Claude Bermond, Jérôme Galtier, Ralf Klasing, Nelson Morales, Stephane Perennes: Hardness and Approximation of Gathering in Static Radio Networks. Parallel Processing Letters 16(2): 165-184 (2006)
2005
41 Juraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger: Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance Springer 2005
40EERalf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes: From Balls and Bins to Points and Vertices. ISAAC 2005: 757-766
39EERalf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco: Approximation Bounds for Black Hole Search Problems. OPODIS 2005: 261-274
38EERalf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco: Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. SIROCCO 2005: 200-215
37 Colin Cooper, Ralf Klasing, Michele Zito: Lower Bounds and Algorithms for Dominating Sets in Web Graphs. Internet Mathematics 2(3): (2005)
2004
36EEMichele Flammini, Alfredo Navarra, Ralf Klasing, Stéphane Pérennes: Improved approximation results for the minimum energy broadcasting problem. DIALM-POMC 2004: 85-91
35EERalf 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. NETWORKING 2004: 866-877
34EEColin Cooper, Ralf Klasing, Michele Zito: Dominating Sets in Web Graphs. WAW 2004: 31-43
33EERalf Klasing, Christian Laforest: Hardness results and approximation algorithms of k-tuple domination in graphs. Inf. Process. Lett. 89(2): 75-83 (2004)
32EEHans-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. 326(1-3): 137-153 (2004)
2003
31EEHans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger: On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. CIAC 2003: 189-200
2002
30EEHans-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. FSTTCS 2002: 59-70
29EEHans-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. 285(1): 3-24 (2002)
2000
28EEHans-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. CIAC 2000: 72-86
27EEHans-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: 382-394
26EEHans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger: Approximation algorithms for the TSP with sharpened triangle inequality. Inf. Process. Lett. 75(3): 133-138 (2000)
1999
25EEHans-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) 6(31): (1999)
1998
24EERalf Klasing: Improved Compressions of Cube-Connected Cycles Networks. WG 1998: 242-256
23EERalf Klasing: The Relationship between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width. Discrete Applied Mathematics 83(1-3): 229-246 (1998)
22EERalf Klasing: Improved Compressions of Cube-Connected Cycles Networks. IEEE Trans. Parallel Distrib. Syst. 9(8): 803-812 (1998)
21 Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger: Optimal Embedding of Complete Binary Trees into Lines and Grids. J. Parallel Distrib. Comput. 49(1): 40-56 (1998)
20EERalf Klasing, Reinhard Lüling, Burkhard Monien: Compressing cube-connected cycles and butterfly networks. Networks 32(1): 47-65 (1998)
19 Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener: Effective Systolic Algorithms for Gossiping in Cycles. Parallel Processing Letters 8(2): 197-205 (1998)
1997
18 Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener: Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes. Inf. Comput. 133(1): 1-33 (1997)
1996
17 Ralf Klasing: On the Complexity of Broadcast and Gossip in Different Communication Modes. Verlag Shaker, Aachen 1996
16 Juraj Hromkovic, Ralf Klasing, Elena Stöhr: Dissemination of Information in Vertex-Disjoint Paths Mode. Computers and Artificial Intelligence 15(4): (1996)
1995
15 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). FCT 1995: 273-282
14EEJuraj 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: 255-266
13EEBurkhard 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 1995: 62-77
12 Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener: Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. Inf. Comput. 123(1): 17-28 (1995)
1994
11 Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská: The Complexity of Systolic Dissemination of Information in Interconnection Networks. Canada-France Conference on Parallel and Distributed Computing 1994: 235-249
10EERalf Klasing: The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width. MFCS 1994: 473-483
9EEJuraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener: Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract). SWAT 1994: 219-230
8 Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr: Broadcasting in Butterfly and deBruijn Networks. Discrete Applied Mathematics 53(1-3): 183-197 (1994)
7 Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská: The Complexity of Systolic Dissemination of Information in Interconnection Networks. ITA 28(3-4): 303-342 (1994)
1993
6EEJuraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener: Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. ESA 1993: 200-211
5EEBurkhard Monien, Rainer Feldmann, Ralf Klasing, Reinhard Lüling: Parallel Architectures: Design and Efficient Use. STACS 1993: 247-269
4EEJuraj Hromkovic, Ralf Klasing, Elena Stöhr: Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks. WG 1993: 288-300
1992
3EERalf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr: Broadcasting in Butterfly and DeBruijn Networks. STACS 1992: 351-362
1991
2EERalf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger: Optimal Embedding of Complete Binary Trees into Lines and Grids. WG 1991: 25-35
1990
1EERalf Klasing, Reinhard Lüling, Burkhard Monien: Compressing cube-connected cycles and butterfly networks. SPDP 1990: 858-865

Coauthor Index

1Evangelos Bampas [64]
2Jean-Claude Bermond [42] [44]
3Hans-Joachim Böckenhauer [25] [26] [27] [28] [29] [30] [31] [32] [57]
4Dirk Bongartz [30] [31] [32] [57]
5Colin Cooper [34] [37] [45] [53] [59] [63]
6Jurek Czyzowicz [62]
7Ralf Diekmann [13]
8Stefan Dobrev [62]
9Rainer Feldmann [5] [13]
10Michele Flammini [36] [48] [52]
11Jérôme Galtier [42] [44]
12Leszek Gasieniec [49] [58] [62] [64]
13Cyril Gavoille [51]
14Nicolas Hanusse [64]
15Ralf Heckmann [2] [21]
16Juraj Hromkovic [4] [6] [7] [9] [11] [12] [14] [15] [16] [18] [19] [25] [26] [27] [28] [29] [30] [31] [32] [41] [57]
17David Ilcinkas [62] [63] [64]
18Jesper Jansson [62]
19Przemyslawa Kanarek [14]
20Adrian Kosowski [50] [51] [60] [61] [63] [64]
21Christian Laforest [33] [43]
22Yannis Lignos [62]
23Krzysztof Lorys [14]
24Zvi Lotker [40]
25Reinhard Lüling [1] [5] [13] [20]
26Euripides Markou [38] [39] [46] [47] [55] [56]
27R. Martin [62]
28Russell A. Martin [49] [58]
29Knuth Menzel [13]
30Burkhard Monien [1] [2] [3] [5] [8] [13] [20] [21]
31Nelson Morales [42] [44] [54]
32Alfredo Navarra [35] [36] [40] [48] [49] [50] [51] [52] [58] [60] [61]
33Aris A. Papadopoulos [35]
34Dana Pardubská [7] [11] [15] [19]
35Regine Peine [3] [8]
36Andrzej Pelc [41] [46] [55]
37Stéphane Pérennes (Stephane Perennes) [35] [36] [40] [42] [44] [48] [52] [54]
38Joseph Peters [43]
39Guido Proietti [30] [31] [32] [57]
40Tomasz Radzik [38] [39] [45] [47] [53] [56] [59]
41Thomas Römke [13]
42Peter Ruzicka [41]
43Kunihiko Sadakane [62]
44Fabiano Sarracco [38] [39] [47] [56]
45Ulf-Peter Schroeder [13]
46Sebastian Seibert [25] [26] [27] [28] [29] [30] [31] [32] [57]
47Elena Stöhr [3] [4] [6] [8] [12] [16]
48W.-K. Sung [62]
49Nicolas Thibault [43]
50Walter Unger [2] [7] [9] [11] [14] [15] [18] [21] [25] [26] [27] [28] [29] [30] [31] [32] [41] [57]
51Juraj Waczulík [15] [19]
52Hubert Wagener [6] [7] [9] [11] [12] [14] [15] [18] [19]
53Xiaohui Zhang [49] [58]
54Michele Zito [34] [37]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)