|
MASCOTTE no longer exists => visit the new project-team
Publications of C. Kaklamanis
BACK TO MASCOTTE PUBLICATION INDEX
Publications of C. Kaklamanis
-
I. Caragiannis,
A. Ferreira,
C. Kaklamanis,
S. Pérennes,
and H. Rivano.
Fractional Path Coloring in Bounded Degree Trees with Applications.
Algorithmica,
58(2):516-540,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
V. Bilò,
I. Caragiannis,
A. Fanelli,
M. Flammini,
C. Kaklamanis,
G. Monaco,
and L. Moscardelli.
Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks,
volume XXVII of EATCS Texts in Theoretical Computer Science,
chapter Game-Theoretic Approaches to Optimization Problems in Communication Networks,
pages 241-264.
Springer,
A. Koster and X. Muñoz edition,
November 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
I. Caragiannis,
A. Ferreira,
C. Kaklamanis,
S. Pérennes,
P. Persiano,
and H. Rivano.
Approximate Constrained Bipartite Edge Coloring.
Discrete Applied Mathematics,
143(1-3):54--61,
September 2004.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
I. Caragianis,
A. Ferreira,
C. Kaklamanis,
S. Pérennes,
and H. Rivano.
Fractional path coloring on bounded degree trees.
In F. Orejas,
P. G. Spirakis,
and J. van Leeuwen, editors,
Proceedings of the 28th ICALP,
volume 2076 of Lecture Notes in Computer Science,
Crete, Greece,
pages 732--743,
July 2001.
Springer-Verlag.
[PDF
] [Abstract] [bibtex-entry]
-
I. Caragiannis,
A. Ferreira,
C. Kaklamanis,
S. Pérennes,
P. Persiano,
and H. Rivano.
Approximate Constrained Bipartite Edge Coloring.
In V.B. Le A. Branstädt, editor,
27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'01),
volume 2204 of Lecture Notes in Computer Science,
Boltenhagen, Germany,
pages 21--31,
June 2001.
Springer-Verlag.
[PDF
] [Abstract] [bibtex-entry]
BACK TO MASCOTTE PUBLICATION INDEX
Last modified: Thu Oct 10 14:10:01 2013
This document was translated from BibTEX by
bibtex2html
|
