Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="P{\'{e}}rennes, St{\'{e}}phane"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimal selectors and fault tolerant networks
Omid Amini
,
Frédéric Giroire
,
Stéphane Pérennes
,
Florian Huc
Networks
55
(4), 2010, pp. 326-340
Approximate constrained bipartite edge coloring
Ioannis Caragiannis
,
Afonso Ferreira
,
Christos Kaklamanis
,
Stéphane Pérennes
,
Pino Persiano
,
Hervé Rivano
Lecture Notes in Computer Science
2204
, 2001, pp. 21-31
Efficient communication in unknown networks
Luisa Gargano
,
Andrzej Pelc
,
Stéphane Pérennes
,
Ugo Vaccaro
Networks
38
(1), 2001, pp. 39-49
All-to-all routing and coloring in weighted trees of rings
Bruno Beauquier
,
Stéphane Pérennes
,
David Tóth
Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'99 (Saint-Malo, France, June 27-30,1999)
, 1999, pp. 185-190
Optimal wavelength-routed multicasting
Bruno Beauqier
,
Pavol Hell
,
Stéphane Pérennes
Discrete Applied Mathematics
84
(1-3), 1998, pp. 15-20
Gossiping in Cayley graphs by packets
Jean-Claude Bermond
,
Takako Kodate
,
Stéphane Pérennes
Lecture Notes in Computer Science
1120
, 1996, pp. 301-315