BACK TO MASCOTTE PUBLICATION INDEX
Publications of R. Klasing

J. Hromkovic,
R. Klasing,
A. Pelc,
P. Ruzicka,
and W. Unger.
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and FaultTolerance,
Springer Monograph.
SpringerVerlag,
2005.
[bibtexentry]

R. Klasing,
Z. Lotker,
A. Navarra,
and S. Pérennes.
From Balls and Bins to Points and Vertices.
Algorithmic Operations Research (AlgOR),
4(2):133143,
2009.
[Abstract] [bibtexentry]

M. Flammini,
R. Klasing,
A. Navarra,
and S. Pérennes.
Tightening the Upper Bound for the Minimum Energy Broadcasting problem.
Wireless Networks,
14(5):659669,
October 2008.
Note: Special Issue associated to the 3rd International Symposium on Modelling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt 2005).
[WWW
] [bibtexentry]

R. Klasing,
N. Morales,
and S. Pérennes.
On the Complexity of Bandwidth Allocation in Radio Networks.
Theoretical Computer Science,
406(3):225239,
October 2008.
[WWW
] [PDF
] [Abstract] [bibtexentry]

M. Flammini,
R. Klasing,
A. Navarra,
and S. Pérennes.
Improved approximation results for the Minimum Energy Broadcasting problem.
Algorithmica,
49(4):318336,
2007.
[WWW
] [Abstract] [bibtexentry]

JC. Bermond,
J. Galtier,
R. Klasing,
N. Morales,
and S. Pérennes.
Hardness and approximation of Gathering in static radio networks.
Parallel Processing Letters,
16(2):165183,
2006.
[PDF
] [Abstract] [bibtexentry]

C. Cooper,
R. Klasing,
and M. Zito.
Lower Bounds and Algorithms for Dominating Sets in Web Graphs.
Internet Mathematics,
2(3):275300,
2005.
[bibtexentry]

H.J. Böckenhauer,
D. Bongartz,
J. Hromkovic,
R. Klasing,
G. Proietti,
S. Seibert,
and W. Unger.
On the hardness of constructing minimal 2connected spanning subgraphs in complete graphs with sharpened triangle inequality.
Theoretical Computer Science,
326(13):137153,
2004.
[bibtexentry]

R. Klasing and C. Laforest.
Hardness results and approximation algorithms of $k$tuple domination in graphs.
Information Processing Letters,
89(2):7583,
2004.
[WWW
] [bibtexentry]

H.J. Böckenhauer,
J. Hromkovic,
R. Klasing,
S. Seibert,
and W. Unger.
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem.
Theoretical Computer Science,
285(1):324,
2002.
[bibtexentry]

G. D'Angelo,
G. Di Stefano,
R. Klasing,
and A. Navarra.
Gathering of Robots on Anonymous Grids without multiplicity detection.
In 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012),
volume 7355 of Lecture Notes in Computer Science,
Reykjavìk, Iceland,
pages 327338,
June 2012.
Springer.
[WWW
] [PDF
] [Abstract] [bibtexentry]

JC. Bermond,
J. Galtier,
R. Klasing,
N. Morales,
and S. Pérennes.
Gathering in specific radio networks.
In Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06),
Trégastel, France,
pages 8588,
May 2006.
[WWW
] [PDF
] [bibtexentry]

JC. Bermond,
J. Galtier,
R. Klasing,
N. Morales,
and S. Pérennes.
Hardness and approximation of Gathering in static radio networks.
In FAWN06,
Pisa, Italy,
pages 7579,
March 2006.
[WWW
] [PDF
] [bibtexentry]

R. Klasing,
Z. Lotker,
A. Navarra,
and S. Pérennes.
From Balls and Bins to Points and Vertices.
In Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005),
volume 3827 of Lecture Notes in Computer Science,
pages 757766,
December 2005.
Springer Verlag.
[WWW
] [PDF
] [bibtexentry]

R. Klasing,
E. Markou,
T. Radzik,
and F. Sarracco.
Approximation bounds for Black Hole Search problems.
In Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS 2005),
volume 3974 of Lecture Notes in Computer Science,
December 2005.
Springer Verlag.
[WWW
] [bibtexentry]

R. Klasing,
E. Markou,
T. Radzik,
and F. Sarracco.
Hardness and approximation results for black hole search in arbitrary graphs.
In Proceedings of the 12th Colloquium on Structural Information and Communication Complexity (SIROCCO 2005),
volume 3499 of Lecture Notes in Computer Science,
pages 200215,
May 2005.
Springer Verlag.
[WWW
] [bibtexentry]

C. Cooper,
R. Klasing,
and M. Zito.
Dominating Sets in Web Graphs.
In Proceedings of the Third Workshop on Algorithms and Models for the WebGraph (WAW 2004),
volume 3243 of Lecture Notes in Computer Science,
pages 3143,
October 2004.
SpringerVerlag.
[bibtexentry]

M. Flammini,
R. Klasing,
A. Navarra,
and S. Pérennes.
Improved approximation results for the Minimum Energy Broadcasting Problem.
In 2nd ACM/SIGMOBILE Annual International Joint Workshop on Foundation of Mobile Computing (DIALMPOMC 2004),
pages 8591,
2004.
ACM Press.
[WWW
] [POSTSCRIPT
] [bibtexentry]

R. Klasing,
A. Navarra,
A. Papadopoulos,
and S. Pérennes.
Adaptive Broadcast Consumption (ABC), a new heuristic and new bounds for the Minimum Energy Broadcast Routing Problem.
In Proc. 3rd FIPTC6 Networking Conference ( Networking 2004),
volume 3042 of Lecture Notes in Computer Science,
pages 866877,
2004.
SpringerVerlag.
[POSTSCRIPT
] [bibtexentry]

H.J. Böckenhauer,
D. Bongartz,
J. Hromkovic,
R. Klasing,
G. Proietti,
S. Seibert,
and W. Unger.
On $k$EdgeConnectivity Problems with Sharpened Triangle Inequality (Extended Abstract).
In Proc. 5th Italian Conference on Algorithms and Complexity ( CIAC 2003),
volume 2653 of Lecture Notes in Computer Science,
pages 189200,
2003.
SpringerVerlag.
[bibtexentry]

H.J. Böckenhauer,
D. Bongartz,
J. Hromkovic,
R. Klasing,
G. Proietti,
S. Seibert,
and W. Unger.
On the hardness of constructing minimal 2connected spanning subgraphs in complete graphs with sharpened triangle inequality.
In Proc. of the 22nd Conference on Foundations of Software Technology and Theoretial Computer Science (FSTTCS 2002),
volume 2556 of Lecture Notes in Computer Science,
pages 5970,
2002.
SpringerVerlag.
[bibtexentry]

R. Klasing,
Z. Lotker,
A. Navarra,
and S. Pérennes.
From Balls and Bins to Points and Vertices.
Technical Report RR143707,
LaBRI,
October 2007.
[bibtexentry]

JC. Bermond,
J. Galtier,
R. Klasing,
N. Morales,
and S. Pérennes.
Hardness and approximation of gathering in static radio networks.
Research Report 5936,
INRIA,
06 2006.
[WWW
] [PDF
] [Abstract] [bibtexentry]

C. Cooper,
R. Klasing,
and M. Zito.
Lower Bounds and Algorithms for Dominating Sets in Web Graphs.
Technical report,
INRIA Research Report RR5529 and I3S Research Report I3S/RR200509FR,
2005.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtexentry]

R. Klasing,
C. Laforest,
J. Peters,
and N. Thibault.
Constructing Incremental Sequences in Graphs.
Research Report,
INRIA Research Report RR5648 and I3S Research Report I3S/RR200522FR,
2005.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtexentry]

R. Klasing,
E. Markou,
T. Radzik,
and F. Sarracco.
Approximation Results for Black Hole Search in Arbitrary Networks.
Research Report,
INRIA Research Report RR5659 and I3S Research Report I3S/RR200523FR,
2005.
[PDF
] [POSTSCRIPT
] [bibtexentry]

C. Cooper,
R. Klasing,
and T. Radzik.
A randomized algorithm for the joining protocol in dynamic distributed networks.
Research Report,
INRIA Research Report RR5376 and I3S Research Report I3S/RR200439FR,
2004.
[PDF
] [POSTSCRIPT
] [bibtexentry]

R. Klasing,
Z. Lotker,
A. Navarra,
and S. Pérennes.
The Points and Vertices Game.
Research Report TRCS 030/2004,
Dipartimento di Informatica, Università degli Studi di L'Aquila,
2004.
[PDF
] [POSTSCRIPT
] [bibtexentry]

R. Klasing,
N. Morales,
and S. Pérennes.
On the Complexity of Bandwidth Allocation in Radio Networks with Steady Traffic Demands.
Research Report,
INRIA Research Report RR5432 and I3S Research Report I3S/RR200440FR,
2004.
Note: Submitted to Theoretical Computer Science.
[PDF
] [POSTSCRIPT
] [bibtexentry]
BACK TO MASCOTTE PUBLICATION INDEX
Last modified: Thu Oct 10 14:10:02 2013
This document was translated from BibT_{E}X by
bibtex2html