default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRalf Klasing
Person information
- affiliation: University of Bordeaux 1, LABRI, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j75]Romaric Duvignau
, Vincenzo Gulisano, Marina Papatriantafilou, Ralf Klasing:
Geographical Peer Matching for P2P Energy Sharing. IEEE Access 13: 9718-9738 (2025)- [j74]Chenxu Yang, Yaping Mao, Ralf Klasing, Gang Yang, Yuzhi Xiao, Xiaoyan Zhang:
Fault-tolerance in distance-edge-monitoring sets. Acta Informatica 62(1): 9 (2025) - [j73]Zhen Ji, Zhiwei Guo, Eddie Cheng, Ralf Klasing, Yaping Mao:
The distance-edge-monitoring numbers of subdivision graphs. Discret. Appl. Math. 372: 37-47 (2025) - [j72]Wen Li, Ralf Klasing, Yaping Mao, Bo Ning:
Monitoring the edges of product networks using distances. J. Comput. Syst. Sci. 148: 103602 (2025) - [j71]Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker:
Online Unbounded Knapsack. Theory Comput. Syst. 69(1): 14 (2025) - [i19]Matthias Gehnen, Ralf Klasing, Émile Naquin:
Graph Exploration with Edge Weight Estimates. CoRR abs/2501.18496 (2025) - [i18]Zhao Wang, Yaping Mao, Sun-Yuan Hsieh, Ralf Klasing:
The g-good-neighbor diagnosability of product networks under the PMC model. CoRR abs/2503.19463 (2025) - 2024
- [j70]Chenxu Yang, Ralf Klasing, Yaping Mao, Xingchao Deng:
On the distance-edge-monitoring numbers of graphs. Discret. Appl. Math. 342: 153-167 (2024) - [j69]Zhen Ji, Ralf Klasing, Wen Li, Yaping Mao, Xiaoyan Zhang:
Erdös-Gallai-type problems for distance-edge-monitoring numbers. Discret. Appl. Math. 342: 275-285 (2024) - [j68]Chenxu Yang, Ralf Klasing, Changxiang He, Yaping Mao:
Perturbation Results for Distance-edge-monitoring Numbers. Fundam. Informaticae 191(2): 141-163 (2024) - [j67]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: 105194 (2024) - [j66]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: 103476 (2024) - [j65]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: 103528 (2024) - [j64]Zhao Wang, Yaping Mao, Sun-Yuan Hsieh, Ralf Klasing, Yuzhi Xiao:
The g-extra connectivity of graph products. J. Comput. Syst. Sci. 145: 103552 (2024) - [c61]Li-Hsuan Chen, Ling-Ju Hung, Ralf Klasing:
Improved Approximation Algorithms for Patrol-Scheduling with Min-Max Latency Using Multiclass Minimum Spanning Forests. AAIM (2) 2024: 99-110 - [c60]Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing:
Algorithms and Complexity for Path Covers of Temporal DAGs. MFCS 2024: 38:1-38:17 - [e7]Henning Fernau, Serge Gaspers, Ralf Klasing:
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. Lecture Notes in Computer Science 14519, Springer 2024, ISBN 978-3-031-52112-6 [contents] - [i17]Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing:
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic? CoRR abs/2403.04589 (2024) - [i16]Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker:
Online Unbounded Knapsack. CoRR abs/2407.02045 (2024) - [i15]Romaric Duvignau, Noël Gillet, Ralf Klasing:
Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems. CoRR abs/2410.09434 (2024) - 2023
- [j63]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: 104731 (2023) - [j62]Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä:
The RED-BLUE SEPARATION problem on graphs. Theor. Comput. Sci. 970: 114061 (2023) - [c59]Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner:
Online Knapsack with Removal and Recourse. IWOCA 2023: 123-135 - [c58]Romaric Duvignau, Ralf Klasing:
Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems. LAGOS 2023: 43-52 - [i14]Chenxu Yang, Ralf Klasing, Changxiang He, Yaping Mao:
Perturbation results for distance-edge-monitoring numbers. CoRR abs/2301.02507 (2023) - [i13]Chenxu Yang, Ping Li, Yaping Mao, Eddie Cheng, Ralf Klasing:
Constructing disjoint Steiner trees in Sierpiński graphs. CoRR abs/2310.16463 (2023) - 2022
- [j61]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): 1993-2027 (2022) - [j60]Leszek Gasieniec, Ralf Klasing, Tomasz Radzik:
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. Algorithmica 84(10): 3103-3106 (2022) - [j59]Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller, Joe Ryan:
Monitoring the edges of a graph using distances. Discret. Appl. Math. 319: 424-438 (2022) - [j58]Hao-Ping Yeh, Wei Lu, Li-Hsuan Chen, Ling-Ju Hung, Ralf Klasing, Sun-Yuan Hsieh:
Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs. Theor. Comput. Sci. 922: 13-24 (2022) - [c57]Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä:
The Red-Blue Separation Problem on Graphs. IWOCA 2022: 285-298 - [e6]Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Sheng-Lung Peng:
New Trends in Computer Technologies and Applications - 25th International Computer Symposium, ICS 2022, Taoyuan, Taiwan, December 15-17, 2022, Proceedings. Communications in Computer and Information Science 1723, Springer 2022, ISBN 978-981-19-9581-1 [contents] - [i12]Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik:
Perpetual maintenance of machines with different urgency requirements. CoRR abs/2202.01567 (2022) - [i11]Chengxu Yang, Ralf Klasing, Yaping Mao, Xingchao Deng:
On the distance-edge-monitoring numbers of graphs. CoRR abs/2211.04920 (2022) - [i10]Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä:
The RED-BLUE SEPARATION problem on graphs. CoRR abs/2211.08283 (2022) - [i9]Wen Li, Ralf Klasing, Yaping Mao, Bo Ning:
Monitoring the edges of product networks using distances. CoRR abs/2211.10743 (2022) - 2021
- [j57]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: 16679-16691 (2021) - [c56]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: 252-264 - [e5]Leszek Gasieniec, Ralf Klasing, Tomasz Radzik:
Algorithms for Sensor Systems - 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2021, Lisbon, Portugal, September 9-10, 2021, Proceedings. Lecture Notes in Computer Science 12961, Springer 2021, ISBN 978-3-030-89239-5 [contents] - 2020
- [j56]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: 112333-112347 (2020) - [j55]Florent Foucaud, Leszek Gasieniec, Ralf Klasing, Tomasz Radzik, Bill Smyth:
IWOCA 2020 in Bordeaux (Oops! On-Line!). Bull. EATCS 132 (2020) - [j54]Chia-Wen Cheng, Sun-Yuan Hsieh, Ralf Klasing:
Vulnerability of super extra edge-connected graphs. J. Comput. Syst. Sci. 108: 1-9 (2020) - [j53]Ralf Klasing, Marc Zeitoun:
Selected papers of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017. J. Comput. Syst. Sci. 114: 105-106 (2020) - [j52]Evangelos Bampas, Jurek Czyzowicz, David Ilcinkas, Ralf Klasing:
Beachcombing on strips and islands. Theor. Comput. Sci. 806: 236-255 (2020) - [j51]Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing:
Approximation algorithms for the p-hub center routing problem in parameterized metric graphs. Theor. Comput. Sci. 806: 271-280 (2020) - [c55]Florent Foucaud, Ralf Klasing, Mirka Miller, Joe Ryan:
Monitoring the Edges of a Graph Using Distances. CALDAM 2020: 28-40 - [c54]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: 126-130 - [e4]Leszek Gasieniec, Ralf Klasing, Tomasz Radzik:
Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings. Lecture Notes in Computer Science 12126, Springer 2020, ISBN 978-3-030-48965-6 [contents] - [i8]Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller, Joe Ryan:
Monitoring the edges of a graph using distances. CoRR abs/2011.00029 (2020)
2010 – 2019
- 2019
- [j50]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): 317-342 (2019) - [j49]Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters:
Computing Parameters of Sequence-Based Dynamic Graphs. Theory Comput. Syst. 63(3): 394-417 (2019) - [j48]Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski:
Improved Analysis of Deterministic Load-Balancing Schemes. ACM Trans. Algorithms 15(1): 10:1-10:22 (2019) - 2018
- [j47]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: 92-112 (2018) - [c53]Ralf Klasing, Tobias Mömke:
A Modern View on Stability of Approximation. Adventures Between Lower Bounds and Higher Altitudes 2018: 393-408 - [c52]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: 115-127 - 2017
- [j46]Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski, Tomasz Radzik:
Robustness of the Rotor-Router Mechanism. Algorithmica 78(3): 869-895 (2017) - [j45]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): 127-148 (2017) - [j44]Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Dominik Pajak:
Collision-free network exploration. J. Comput. Syst. Sci. 86: 70-81 (2017) - [j43]Florent Foucaud, Ralf Klasing:
Parameterized and approximation complexity of the detection pair problem in graphs. J. Graph Algorithms Appl. 21(6): 1039-1056 (2017) - [c51]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: 152-163 - [c50]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: 112-123 - [c49]Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters:
A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs. SIROCCO 2017: 321-338 - [c48]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: 229-240 - [e3]Marek Chrobak, Antonio Fernández Anta, Leszek Gasieniec, Ralf Klasing:
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. Lecture Notes in Computer Science 10050, Springer 2017, ISBN 978-3-319-53057-4 [contents] - [e2]Ralf Klasing, Marc Zeitoun:
Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings. Lecture Notes in Computer Science 10472, Springer 2017, ISBN 978-3-662-55750-1 [contents] - 2016
- [j42]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: 158-168 (2016) - [c47]Ralf Klasing, Adrian Kosowski, Dominik Pajak:
Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? SIROCCO 2016: 35-48 - [c46]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: 195-211 - [i7]Florent Foucaud, Ralf Klasing:
Parameterized and approximation complexity of the detection pair problem in graphs. CoRR abs/1601.05003 (2016) - 2015
- [j41]Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti:
Network verification via routing table queries. J. Comput. Syst. Sci. 81(1): 234-248 (2015) - [j40]Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner:
Rendezvous of heterogeneous mobile agents in edge-weighted networks. Theor. Comput. Sci. 608: 219-230 (2015) - [c45]Evangelos Bampas, Jurek Czyzowicz, David Ilcinkas, Ralf Klasing:
Beachcombing on Strips and Islands. ALGOSENSORS 2015: 155-168 - [c44]Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters:
Efficiently Testing T -Interval Connectivity in Dynamic Graphs. CIAC 2015: 89-100 - [c43]Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski:
Improved Analysis of Deterministic Load-Balancing Schemes. PODC 2015: 301-310 - [i6]Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters:
Efficiently Testing T-Interval Connectivity in Dynamic Graphs. CoRR abs/1502.00089 (2015) - 2014
- [j39]Ralf Klasing:
Editorial. ACM J. Exp. Algorithmics 19(1) (2014) - [j38]Florent Foucaud, Ralf Klasing, Peter J. Slater:
Centroidal bases in graphs. Networks 64(2): 96-108 (2014) - [c42]Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Dominik Pajak:
Collision-Free Network Exploration. LATIN 2014: 342-354 - [c41]David Ilcinkas, Ralf Klasing, Ahmed Mouhamadou Wade:
Exploration of Constantly Connected Dynamic Graphs Based on Cactuses. SIROCCO 2014: 250-262 - [c40]Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner:
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks. SIROCCO 2014: 311-326 - [i5]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 abs/1404.4344 (2014) - [i4]Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner:
Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks. CoRR abs/1406.2008 (2014) - 2013
- [j37]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) - [c39]Ralf Klasing:
Efficient Exploration of Anonymous Undirected Graphs. IWOCA 2013: 7-13 - [c38]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: 365-374 - 2012
- [j36]Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud:
On the size of identifying codes in triangle-free graphs. Discret. Appl. Math. 160(10-11): 1532-1546 (2012) - [j35]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: 60-76 (2012) - [c37]Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra:
Gathering of Robots on Anonymous Grids without Multiplicity Detection. SIROCCO 2012: 327-338 - [e1]Ralf Klasing:
Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings. Lecture Notes in Computer Science 7276, Springer 2012, ISBN 978-3-642-30849-9 [contents] - 2011
- [j34]Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski:
Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Comput. 24(2): 91-99 (2011) - [c36]Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti:
Network Verification via Routing Table Queries. SIROCCO 2011: 270-281 - 2010
- [j33]Colin Cooper, Ralf Klasing, Tomasz Radzik:
Locating and repairing faults in a network with mobile agents. Theor. Comput. Sci. 411(14-15): 1638-1647 (2010) - [j32]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): 3235-3246 (2010) - [c35]Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová:
Improved Approximations for TSP with Simple Precedence Constraints. CIAC 2010: 61-72 - [p3]Alfredo Navarra, Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Ralf Klasing:
Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks. Graphs and Algorithms in Communication Networks 2010: 335-355 - [p2]Vincenzo Bonifaci, Ralf Klasing, Peter Korteweg, Leen Stougie, Alberto Marchetti-Spaccamela:
Data Gathering in Wireless Networks. Graphs and Algorithms in Communication Networks 2010: 357-377 - [i3]Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud:
On the size of identifying codes in triangle-free graphs. CoRR abs/1010.5975 (2010)
2000 – 2009
- 2009
- [j31]Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stéphane Pérennes:
From Balls and Bins to Points and Vertices. Algorithmic Oper. Res. 4(2): 133-143 (2009) - [j30]Ralf Klasing, Adrian Kosowski, Alfredo Navarra:
Cost minimization in wireless networks with a bounded and unbounded number of interfaces. Networks 53(3): 266-275 (2009) - [j29]Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner, Alfredo Navarra:
On the complexity of distributed graph coloring with local minimality constraints. Networks 54(1): 12-19 (2009) - [j28]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): 1612-1645 (2009) - [c34]Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski:
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. ICALP (2) 2009: 411-422 - [c33]Evangelos Bampas, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Tomasz Radzik:
Robustness of the Rotor-router Mechanism. OPODIS 2009: 345-358 - [c32]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: 167-181 - [c31]Evangelos 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 - [i2]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 abs/0905.1737 (2009) - 2008
- [j27]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) - [j26]Leszek 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) - [j25]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): 605-617 (2008) - [j24]Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco:
Approximation bounds for Black Hole Search problems. Networks 52(4): 216-226 (2008) - [j23]Ralf Klasing, Euripides Markou, Andrzej Pelc:
Gathering asynchronous oblivious mobile robots in a ring. Theor. Comput. Sci. 390(1): 27-39 (2008) - [j22]Ralf Klasing, Nelson Morales, Stéphane Pérennes:
On the complexity of bandwidth allocation in radio networks. Theor. Comput. Sci. 406(3): 225-239 (2008) - [j21]Colin Cooper, Ralf Klasing, Tomasz Radzik:
A randomized algorithm for the joining protocol in dynamic distributed networks. Theor. Comput. Sci. 406(3): 248-262 (2008) - [j20]Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes:
Tightening the upper bound for the minimum energy broadcasting. Wirel. Networks 14(5): 659-669 (2008) - [c30]Ralf Klasing, Adrian Kosowski, Alfredo Navarra:
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring. OPODIS 2008: 446-462 - [c29]Colin Cooper, Ralf Klasing, Tomasz Radzik:
Locating and Repairing Faults in a Network with Mobile Agents. SIROCCO 2008: 20-32 - 2007
- [j19]Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes:
Improved Approximation Results for the Minimum Energy Broadcasting Problem. Algorithmica 49(4): 318-336 (2007) - [j18]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): 201-221 (2007) - [c28]Ralf Klasing, Adrian Kosowski, Alfredo Navarra:
Cost Minimisation in Multi-interface Networks. NET-COOP 2007: 276-285 - [c27]Leszek Gasieniec, Ralf Klasing, Russell A. Martin, Alfredo Navarra, Xiaohui Zhang:
Fast Periodic Graph Exploration with Constant Memory. SIROCCO 2007: 26-40 - [c26]Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra:
On the Complexity of Distributed Greedy Coloring. DISC 2007: 482-484 - 2006
- [j17]Ralf Klasing, Christian Laforest, Joseph G. Peters, Nicolas Thibault:
Constructing Incremental Sequences in Graphs. Algorithmic Oper. Res. 1(2) (2006) - [j16]Jean-Claude Bermond, Jérôme Galtier, Ralf Klasing, Nelson Morales, Stephane Perennes:
Hardness and Approximation of Gathering in Static Radio Networks. Parallel Process. Lett. 16(2): 165-184 (2006) - [c25]Ralf Klasing, Euripides Markou, Andrzej Pelc:
Gathering Asynchronous Oblivious Mobile Robots in a Ring. ISAAC 2006: 744-753 - [c24]Colin Cooper, Ralf Klasing, Tomasz Radzik:
Searching for Black-Hole Faults in a Network Using Multiple Agents. OPODIS 2006: 320-332 - [c23]Jean-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 - 2005
- [b2]Juraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger:
Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Texts in Theoretical Computer Science. An EATCS Series, Springer 2005, ISBN 978-3-540-00846-0, pp. 1-361 - [j15]Colin Cooper, Ralf Klasing, Michele Zito:
Lower Bounds and Algorithms for Dominating Sets in Web Graphs. Internet Math. 2(3): 275-300 (2005) - [c22]Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes:
From Balls and Bins to Points and Vertices. ISAAC 2005: 757-766 - [c21]Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco:
Approximation Bounds for Black Hole Search Problems. OPODIS 2005: 261-274 - [c20]Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco:
Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. SIROCCO 2005: 200-215 - 2004
- [j14]Ralf Klasing, Christian Laforest:
Hardness results and approximation algorithms of k-tuple domination in graphs. Inf. Process. Lett. 89(2): 75-83 (2004) - [j13]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. 326(1-3): 137-153 (2004) - [c19]Michele Flammini, Alfredo Navarra, Ralf Klasing, Stéphane Pérennes:
Improved approximation results for the minimum energy broadcasting problem. DIALM-POMC 2004: 85-91 - [c18]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. NETWORKING 2004: 866-877 - [c17]Colin Cooper, Ralf Klasing, Michele Zito:
Dominating Sets in Web Graphs. WAW 2004: 31-43 - 2003
- [c16]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. CIAC 2003: 189-200 - 2002
- [j12]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. 285(1): 3-24 (2002) - [c15]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. FSTTCS 2002: 59-70 - 2000
- [j11]Hans-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) - [c14]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. CIAC 2000: 72-86 - [c13]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: 382-394
1990 – 1999
- 1999
- [i1]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. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [j10]Ralf Klasing:
The Relationship between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width. Discret. Appl. Math. 83(1-3): 229-246 (1998) - [j9]Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger:
Optimal Embedding of Complete Binary Trees into Lines and Grids. J. Parallel Distributed Comput. 49(1): 40-56 (1998) - [j8]Ralf Klasing, Reinhard Lüling, Burkhard Monien:
Compressing cube-connected cycles and butterfly networks. Networks 32(1): 47-65 (1998) - [j7]Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener:
Effective Systolic Algorithms for Gossiping in Cycles. Parallel Process. Lett. 8(2): 197-205 (1998) - [j6]Ralf Klasing:
Improved Compressions of Cube-Connected Cycles Networks. IEEE Trans. Parallel Distributed Syst. 9(8): 803-812 (1998) - [c12]Ralf Klasing:
Improved Compressions of Cube-Connected Cycles Networks. WG 1998: 242-256 - 1997
- [j5]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
- [b1]Ralf Klasing:
On the Complexity of Broadcast and Gossip in Different Communication Modes. Verlag Shaker, Aachen 1996, ISBN 3-8265-1281-2, pp. 1-98 - [j4]Juraj Hromkovic, Ralf Klasing, Elena Stöhr:
Dissemination of Information in Vertex-Disjoint Paths Mode. Comput. Artif. Intell. 15(4): 295-318 (1996) - 1995
- [j3]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) - [c11]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 - [c10]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: 255-266 - [p1]Burkhard Monien, Ralf Diekmann, Rainer Feldmann, Ralf Klasing, Reinhard Lüling, Knut Menzel, Thomas Römke, Ulf-Peter Schroeder:
Efficient Use of Parallel & Distributed Systems: From Theory to Practice. Computer Science Today 1995: 62-77 - 1994
- [j2]Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr:
Broadcasting in Butterfly and deBruijn Networks. Discret. Appl. Math. 53(1-3): 183-197 (1994) - [j1]Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská:
The Complexity of Systolic Dissemination of Information in Interconnection Networks. RAIRO Theor. Informatics Appl. 28(3-4): 303-342 (1994) - [c9]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 - [c8]Ralf Klasing:
The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width. MFCS 1994: 473-483 - [c7]Juraj 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 - 1993
- [c6]Juraj 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 - [c5]Burkhard Monien, Rainer Feldmann, Ralf Klasing, Reinhard Lüling:
Parallel Architectures: Design and Efficient Use. STACS 1993: 247-269 - [c4]Juraj Hromkovic, Ralf Klasing, Elena Stöhr:
Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks. WG 1993: 288-300 - 1992
- [c3]Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr:
Broadcasting in Butterfly and DeBruijn Networks. STACS 1992: 351-362 - 1991
- [c2]Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger:
Optimal Embedding of Complete Binary Trees into Lines and Grids. WG 1991: 25-35 - 1990
- [c1]Ralf Klasing, Reinhard Lüling, Burkhard Monien:
Compressing cube-connected cycles and butterfly networks. SPDP 1990: 858-865
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-03 01:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
