Ralf KLASING
Ralf Klasing Directeur de Recherches (CNRS)

Équipe LaBRI : Combinatoire et Algorithmique
Équipe projet commune INRIA-LaBRI : CEPAGE
Fonction administrative :
Page personnelle : http://www.labri.fr/~klasing
Courrier électronique : ralf.klasingarobaselabri.fr
Bureau : 317
Tél : +33 (0)5 40 00 35 24


Recherche

My research interests are in "Design and Analysis of Algorithms" and in "Complexity". More particularly, my research focuses on "Communication algorithms in networks", "Approximation algorithms for combinatorially hard problems", "Algorithmic methods for telecommunication", and "Distributed algorithms".

I have co-authored three book chapters, two Springer Monographs, and have published 33 papers in refereed international journals and 35 papers in refereed international conferences with proceedings. I have been appointed as a member of the Editorial Board of the nine international journals "Theoretical Computer Science", "Discrete Applied Mathematics", "Wireless Networks", "Networks", "Journal of Interconnection Networks", "Parallel Processing Letters", "Algorithmic Operations Research", "Fundamenta Informaticae", and "Computing and Informatics". I have recently acted as a member of the Program Committees of SIROCCO 2006, SIROCCO 2009, MFCS 2009, ADHOC-NOW 2009, OPODIS 2009, STACS 2010, ALGOSENSORS 2010, ADHOC-NOW 2010, and IWOCA 2010. I will act as a member of the Program Committees of SIROCCO 2011, FOMC 2011, ADHOC-NOW 2011, and IWOCA 2011. I have co-supervised 5 PhD students. I have supervised 16 master theses and 7 Predocs/Postdocs/internships. I have been a reviewer for 6 PhD theses, and a member of 4 PhD committees. I have acted as a referee for NSERC, for the ANR, for Mathematical Reviews, for national and international journals and conferences.

I have been actively involved in several national and international research projects. (I have been a site leader or overall leader for some of them; e.g. I am the overall coordinator of the ANR project "IDEA".) I have also been involved in several national and international research collaborations. (For many of these, I obtained partial funding.) I have had several research visits in other labs, leading to joint work and joint publications. I have presented my research work on several occasions, nationally and internationally.

I have been appointed as a member of the Evaluation Committee of the programme "ANR Défis 2009". I am the Head of the "Combinatorics and Algorithms" team of the LaBRI. I am responsible for the International Relations of the LaBRI. I am animating the "Groupe de travail Algorithmique distribuée" at the LaBRI. I have been elected to the "Conseil Scientifique" of the LaBRI. I have (co-)organized AlgoTel 2007, STACS 2008, DICS 2008, EuroComb 2009, ICALP 2010, and BGW 2010. I was the Workshops Chair of ICALP 2010.

Extrait de publications


Ralf Klasing. Computing parameters of sequence-based dynamic graphs. ICALP 2018 workshop on Algorithmic Aspects of Temporal Graphs, Jul 2018, Prague, Czech Republic

Ralf Klasing. On the Approximabilty of Hub Allocation Problems. 23rd International Symposium on Mathematical Programming (ISMP 2018), Jul 2018, Bordeaux, France

Ralf Klasing, Tobias Mömke. A Modern View on Stability of Approximation. Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday, 11011, Springer, pp.393--408, 2018, Lecture Notes in Computer Science

Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing. Approximation algorithms for the p-hub center routing problem in parameterized metric graphs. Proceedings of the 29th International Workshop on Combinatorial Algorithms (IWOCA 2018), Jul 2018, Singapore, Singapore. Springer, 10979, pp.115--127, Lecture Notes in Computer Science

Li-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, et al.. Approximability and inapproximability of the star p -hub center problem with parameterized triangle inequality. Journal of Computer and System Sciences, Elsevier, 2018, 92, pp.92 - 112


Page mise à jour le 13/08/2010 à 10:56