Ralf Klasing
Affiliations:- University of Bordeaux 1, LABRI, France
According to our database1,
Ralf Klasing
authored at least 112 papers
between 1993 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on labri.fr
On csauthors.net:
Bibliography
2024
J. Comput. Syst. Sci., February, 2024
Discret. Appl. Math., January, 2024
Discret. Appl. Math., January, 2024
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
CoRR, 2024
2023
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks.
J. Parallel Distributed Comput., November, 2023
Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023
2022
Hardness and approximation for the star <i>p</i>-Hub Routing Cost Problem in metric graphs.
Theor. Comput. Sci., 2022
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020.
Algorithmica, 2022
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality.
Algorithmica, 2022
2021
IEEE Access, 2021
A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks.
Proceedings of the Algorithmic Aspects in Information and Management, 2021
2020
Approximation algorithms for the <i>p</i>-hub center routing problem in parameterized metric graphs.
Theor. Comput. Sci., 2020
Selected papers of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017.
J. Comput. Syst. Sci., 2020
IEEE Access, 2020
The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs.
Proceedings of the International Computer Symposium, 2020
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020
2019
ACM Trans. Algorithms, 2019
2018
Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality.
J. Comput. Syst. Sci., 2018
Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018
2017
J. Graph Algorithms Appl., 2017
The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks.
Distributed Comput., 2017
Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors).
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017
Proceedings of the Structural Information and Communication Complexity, 2017
The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017
2016
Theor. Comput. Sci., 2016
Proceedings of the Structural Information and Communication Complexity, 2016
2015
Theor. Comput. Sci., 2015
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015
2014
Be Fair and Be Selfish! Characterizing Deterministic Diffusive Load-Balancing Schemes with Small Discrepancy.
CoRR, 2014
Proceedings of the Structural Information and Communication Complexity, 2014
2013
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013
2012
Theor. Comput. Sci., 2012
Proceedings of the Structural Information and Communication Complexity, 2012
2011
Derandomizing random walks in undirected graphs using locally fair exploration strategies.
Distributed Comput., 2011
2010
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring.
Theor. Comput. Sci., 2010
Theor. Comput. Sci., 2010
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010
2009
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
SIAM J. Discret. Math., 2009
Cost minimization in wireless networks with a bounded and unbounded number of interfaces.
Networks, 2009
Networks, 2009
Proceedings of the Distributed Computing, 23rd International Symposium, 2009
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009
2008
Wirel. Networks, 2008
Theor. Comput. Sci., 2008
Theor. Comput. Sci., 2008
J. Discrete Algorithms, 2008
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs.
Algorithmic Oper. Res., 2008
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008
2007
Theor. Comput. Sci., 2007
Algorithmica, 2007
Proceedings of the Distributed Computing, 21st International Symposium, 2007
Proceedings of the Network Control and Optimization, 2007
2006
Parallel Process. Lett., 2006
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006
2005
Proceedings of the Structural Information and Communication Complexity, 2005
Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-26663-1, 2005
2004
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality.
Theor. Comput. Sci., 2004
Inf. Process. Lett., 2004
Proceedings of the Algorithms and Models for the Web-Graph: Third International Workshop, 2004
Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem.
Proceedings of the NETWORKING 2004, 2004
2003
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003
2002
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
Theor. Comput. Sci., 2002
2000
Inf. Process. Lett., 2000
An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality.
Proceedings of the STACS 2000, 2000
1998
IEEE Trans. Parallel Distributed Syst., 1998
J. Parallel Distributed Comput., 1998
The Relationship between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width.
Discret. Appl. Math., 1998
1997
Inf. Comput., 1997
1996
Comput. Artif. Intell., 1996
Verlag Shaker, Aachen, ISBN: 3-8265-1281-2, 1996
1995
Inf. Comput., 1995
On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
Proceedings of the STACS 95, 1995
Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995
Proceedings of the Computer Science Today: Recent Trends and Developments, 1995
1994
RAIRO Theor. Informatics Appl., 1994
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract).
Proceedings of the Algorithm Theory, 1994
The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994
1993
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993