%
%
%
% automatically generated
% % ./bibtex2html scripts/coati-all-coauthors.cfg bruce-before-2003.bib bruce-03-05.bib luigi-03-05.bib luigi-before-2003.bib before-1997.bib sloop1997.bib sloop1998.bib sloop1999.bib mascotte2000.bib mascotte2001.bib mascotte2002.bib mascotte2003.bib mascotte2004.bib mascotte2005.bib mascotte2006.bib mascotte2007.bib mascotte2008.bib mascotte2009.bib mascotte2010.bib mascotte2011.bib mascotte2012.bib nisse-before-2008.bib giroire-before-2008.bib coati2013.bib coati2014.bib coati2015.bib coati2016.bib coati2017.bib coati2018.bib coati2019.bib coati2020.bib coati2021.bib coati2022.bib
% Date: Sat Jan 29 19:00:47 2022

% Author: dcoudert
%
%
%











@article{bensmail:hal-02947399,
TITLE = {{On the signed chromatic number of some classes of graphs}},
AUTHOR = {Bensmail, Julien and Das, Sandip and Nandi, Soumen and Pierron, Th{\'e}o and Sen, Sagnik and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-02947399},
TYPE = {Research Report},
JOURNAL = {{Discrete Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {345},
PAGES = {112664},
INSTITUTION = {{Universit{\'e} C{\^o}te D'Azur ; Universit{\'e} de Bordeaux ; Universit{\'e} Lyon 1}},
YEAR = {2022},
DOI = {10.1016/j.disc.2021.112664},
KEYWORDS = {Kn-minor-free graph ; bounded-degree graph ; triangle-free planar graph ; homomorphism of signed graphs ; planar graph ; signed chromatic number},
PDF = {https://hal.archives-ouvertes.fr/hal-02947399v2/file/BDNPSS.pdf},
HAL_ID = {hal-02947399},
HAL_VERSION = {v2},

}

@article{bensmail:hal-02546401,
TITLE = {{Further Evidence Towards the Multiplicative 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Hocquard, Herv{\'e} and Lajou, Dimitri and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-02546401},
TYPE = {Research Report},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {307},
PAGES = {135-144},
INSTITUTION = {{Universit{\'e} c{\^o}te d'azur ; Universit{\'e} de bordeaux}},
YEAR = {2022},
DOI = {10.1016/j.dam.2021.10.014},
KEYWORDS = {1-2-3 Conjecture ; multiset version ; product version ; 4-chromatic graphs},
PDF = {https://hal.archives-ouvertes.fr/hal-02546401/file/product123.pdf},
HAL_ID = {hal-02546401},
HAL_VERSION = {v1},

}

@article{bensmail:hal-01988399,
TITLE = {{On {a,b}-edge-weightings of bipartite graphs with odd a,b}},
AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn and Lyngsie, Kasper},
URL = {https://hal.archives-ouvertes.fr/hal-01988399},
JOURNAL = {{Discussiones Mathematicae Graph Theory}},
PUBLISHER = {{University of Zielona G{\'o}ra}},
VOLUME = {42},
NUMBER = {1},
PAGES = {159-185},
YEAR = {2022},
DOI = {10.7151/dmgt.2250},
PDF = {https://hal.archives-ouvertes.fr/hal-01988399v2/file/odd-odd-bip.pdf},
HAL_ID = {hal-01988399},
HAL_VERSION = {v2},

}

@article{sulkowska:hal-03462292,
TITLE = {{Maximizing the expected number of components in an online search of a graph}},
AUTHOR = {Sulkowska, Malgorzata and Benevides, Fabr{\'i}cio Siqueira},
URL = {https://hal.archives-ouvertes.fr/hal-03462292},
JOURNAL = {{Discrete Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {345},
NUMBER = {1},
PAGES = {112668},
YEAR = {2022},
MONTH = Jan,
DOI = {10.1016/j.disc.2021.112668},
PDF = {https://hal.archives-ouvertes.fr/hal-03462292/file/maxcomps.pdf},
HAL_ID = {hal-03462292},
HAL_VERSION = {v1},

}

@article{sulkowska:hal-03462302,
TITLE = {{An optimal algorithm for stopping on the element closest to the center of an interval}},
AUTHOR = {Sulkowska, Malgorzata and Kubicka, Ewa and Kubicki, Grzegorz and Kuchta, Malgorzata},
URL = {https://hal.archives-ouvertes.fr/hal-03462302},
JOURNAL = {{Advances in Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {133},
PAGES = {102281},
YEAR = {2022},
MONTH = Feb,
DOI = {10.1016/j.aam.2021.102281},
PDF = {https://hal.archives-ouvertes.fr/hal-03462302/file/KKKS_Stopping.August5.2021.pdf},
HAL_ID = {hal-03462302},
HAL_VERSION = {v1},

}

@inproceedings{bensmail:hal-03427170,
TITLE = {{A proof of the Multiplicative 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Hocquard, Herv{\'e} and Lajou, Dimitri and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-03427170},
BOOKTITLE = {{CALDAM 2022 - 8th Annual International Conference on Algorithms and Discrete Applied Mathematics}},
ADDRESS = {Puducherry, India},
YEAR = {2022},
KEYWORDS = {1-2-3 Conjecture ; product version ; labels 1-2-3},
PDF = {https://hal.archives-ouvertes.fr/hal-03427170/file/proof123p.pdf},
HAL_ID = {hal-03427170},
HAL_VERSION = {v1},

}

@inproceedings{coudert:hal-03431155,
TITLE = {{Hyperbolicity Computation through Dominating Sets}},
AUTHOR = {Coudert, David and Nusser, Andr{\'e} and Viennot, Laurent},
URL = {https://hal.inria.fr/hal-03431155},
BOOKTITLE = {{ALENEX 2022 - Symposium on Algorithm Engineering and Experiments}},
ADDRESS = {Alexandria, VA, United States},
PAGES = {78-90},
YEAR = {2022},
MONTH = Jan,
DOI = {10.1137/1.9781611977042.7},
KEYWORDS = {Algorithm engineering ; Graph algorithms ; Gromov hyperbolicity},
PDF = {https://hal.inria.fr/hal-03431155v2/file/domset-main-arxiv.pdf},
HAL_ID = {hal-03431155},
HAL_VERSION = {v2},

}

@techreport{bensmail:hal-03531789,
TITLE = {{On the pushable chromatic number of various types of grids}},
AUTHOR = {Bensmail, Julien and Das, Tapas and Lajou, Dimitri and Nandi, Soumen and Sen, Sagnik},
URL = {https://hal.archives-ouvertes.fr/hal-03531789},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur ; Universit{\'e} de Bordeaux}},
YEAR = {2022},
KEYWORDS = {oriented graph ; oriented colouring ; pushable chromatic number ; grid},
PDF = {https://hal.archives-ouvertes.fr/hal-03531789/file/push-grids.pdf},
HAL_ID = {hal-03531789},
HAL_VERSION = {v1},

}

@techreport{bensmail:hal-03536425,
TITLE = {{On proper 2-labellings distinguishing by sums, multisets or products}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos},
URL = {https://hal.archives-ouvertes.fr/hal-03536425},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2022},
KEYWORDS = {proper labelling ; sum of labels ; multiset of labels ; product of labels},
PDF = {https://hal.archives-ouvertes.fr/hal-03536425/file/2labels.pdf},
HAL_ID = {hal-03536425},
HAL_VERSION = {v1},

}

@proceedings{coudert:hal-03250984,
TITLE = {{19th International Symposium on Experimental Algorithms (SEA 2021)}},
AUTHOR = {Coudert, David and Natale, Emanuele},
URL = {https://hal.inria.fr/hal-03250984},
BOOKTITLE = {{19th International Symposium on Experimental Algorithms (SEA 2021)}},
ADDRESS = {Nice, France},
ORGANIZATION = {{David Coudert and Emanuele Natale}},
EDITOR = {David Coudert and Emanuele Natale},
PUBLISHER = {{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}},
VOLUME = {190},
PAGES = {434},
YEAR = {2021},
MONTH = Jun,
DOI = {10.4230/LIPIcs.SEA.2021},
HAL_ID = {hal-03250984},
HAL_VERSION = {v1},

}

@phdthesis{dilena:tel-03343533,
TITLE = {{Distributed and trustable SDN-NFV-enabled network emulation on testbeds and cloud infrastructures}},
AUTHOR = {Di Lena, Giuseppe},
URL = {https://tel.archives-ouvertes.fr/tel-03343533},
NUMBER = {2021COAZ4028},
SCHOOL = {{Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2021},
MONTH = Mar,
KEYWORDS = {Emulation ; SDN ; NFV ; Mininet ; Virtualization ; Emulation ; SDN ; NFV ; Mininet ; Virtualisation},
TYPE = {Theses},
PDF = {https://tel.archives-ouvertes.fr/tel-03343533/file/2021COAZ4028.pdf},
HAL_ID = {tel-03343533},
HAL_VERSION = {v1},

}

@phdthesis{gausseran:tel-03463096,
TITLE = {{Optimization algorithms for network slicing for 5G}},
AUTHOR = {Gausseran, Adrien},
URL = {https://tel.archives-ouvertes.fr/tel-03463096},
NUMBER = {2021COAZ4090},
SCHOOL = {{Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2021},
MONTH = Nov,
KEYWORDS = {SDN ; NFV ; SFC ; 5G ; Slicing ; Reconfiguration ; SDN ; NFV ; SFC ; 5G ; Slicing ; Reconfiguration},
TYPE = {Theses},
PDF = {https://tel.archives-ouvertes.fr/tel-03463096/file/2021COAZ4090.pdf},
HAL_ID = {tel-03463096},
HAL_VERSION = {v1},

}

@phdthesis{nguyen:hal-03510188,
TITLE = {{Graph problems motivated by (low and high) resolution models of large protein assemblies}},
AUTHOR = {Nguyen, Viet-Ha},
URL = {https://hal.inria.fr/hal-03510188},
TYPE = {Research Report},
SCHOOL = {{I3S, Universit{\'e} C{\^o}te d'Azur ; ABS, Inria Sophia Antipolis ; COATI, Inria Sophia Antipolis}},
YEAR = {2021},
MONTH = Dec,
KEYWORDS = {esolution of protein assembly ; structural biology ; complexity ; algorithm ; graph ; hypergraph ; coloring. ; complexit{\'e} ; algorithme ; r{\'e}solution d’assemblage de prot{\'e}ines ; biologie structurale ; graphe ; hypergraphe ; coloration.},
TYPE = {Theses},
PDF = {https://hal.inria.fr/hal-03510188/file/Ha_couv_thesis.pdf},
HAL_ID = {hal-03510188},
HAL_VERSION = {v1},

}

@phdthesis{trolliet:tel-03468769,
TITLE = {{Study of the properties and modeling of complex social graphs}},
AUTHOR = {Trolliet, Thibaud},
URL = {https://tel.archives-ouvertes.fr/tel-03468769},
NUMBER = {2021COAZ4048},
SCHOOL = {{Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2021},
MONTH = Jun,
KEYWORDS = {Complex networks ; Social networks ; Twitter ; Modelling ; Directed graphs ; Hypergraphs ; Syst{\`e}mes complexes ; R{\'e}seaux sociaux ; Twitter ; Mod{\'e}lisation ; Graphes dirig{\'e}s ; Hypergraphes},
TYPE = {Theses},
PDF = {https://tel.archives-ouvertes.fr/tel-03468769/file/2021COAZ4048.pdf},
HAL_ID = {tel-03468769},
HAL_VERSION = {v1},

}

@incollection{aboulker:hal-03424140,
TITLE = {{On the dichromatic number of surfaces}},
AUTHOR = {Aboulker, Pierre and Havet, Fr{\'e}d{\'e}ric and Knauer, Kolja and Rambaud, Cl{\'e}ment},
URL = {https://hal.inria.fr/hal-03424140},
BOOKTITLE = {{Extended Abstracts EuroComb 2021}},
PUBLISHER = {{Springer International Publishing}},
SERIES = {Trends in Mathematics},
VOLUME = {14},
PAGES = {181-187},
YEAR = {2021},
MONTH = Aug,
DOI = {10.1007/978-3-030-83823-2\_29},
KEYWORDS = {dichromatic number ; planar graphs ; graphs on surfaces},
PDF = {https://hal.inria.fr/hal-03424140/file/dichromatic-eurocomb.pdf},
HAL_ID = {hal-03424140},
HAL_VERSION = {v1},

}

@article{arroyo:hal-03120899,
TITLE = {{Extending Drawings of Graphs to Arrangements of Pseudolines}},
AUTHOR = {Arroyo, Alan and Bensmail, Julien and Richter, Bruce R.},
URL = {https://hal.archives-ouvertes.fr/hal-03120899},
JOURNAL = {{Journal of Computational Geometry}},
PUBLISHER = {{Carleton University, Computational Geometry Laboratory}},
VOLUME = {12},
NUMBER = {2},
PAGES = {3-24},
YEAR = {2021},
DOI = {10.20382/jocg.v12i2a2},
KEYWORDS = {graphs ; graph drawings ; geometric graph drawings ; arrangements of pseudolines ; crossing numbers ; stretchability},
PDF = {https://hal.archives-ouvertes.fr/hal-03120899/file/pseudolines.pdf},
HAL_ID = {hal-03120899},
HAL_VERSION = {v1},

}

@article{bensmail:hal-02373515,
TITLE = {{Pushable chromatic number of graphs with degree constraints}},
AUTHOR = {Bensmail, Julien and Das, Sandip and Nandi, Soumen and Paul, Soumyajit and Pierron, Th{\'e}o and Sen, Sagnik and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-02373515},
JOURNAL = {{Discrete Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {344},
NUMBER = {1},
PAGES = {112151},
YEAR = {2021},
DOI = {10.1016/j.disc.2020.112151 Get},
KEYWORDS = {graph homomorphism ; maximum degree ; subcubicgraph ; oriented coloring ; push operation},
PDF = {https://hal.archives-ouvertes.fr/hal-02373515v2/file/main.pdf},
HAL_ID = {hal-02373515},
HAL_VERSION = {v2},

}

@article{bensmail:hal-02975031,
TITLE = {{On the Role of 3s for the 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn},
URL = {https://hal.archives-ouvertes.fr/hal-02975031},
TYPE = {Research Report},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {892},
PAGES = {238-257},
INSTITUTION = {{Universit{\'e} c{\^o}te d'azur ; Aix-Marseille Universite}},
YEAR = {2021},
DOI = {10.1016/j.tcs.2021.09.023},
KEYWORDS = {Proper labellings ; 3-chromatic graphs ; 1-2-3 Conjecture},
PDF = {https://hal.archives-ouvertes.fr/hal-02975031v3/file/main.pdf},
HAL_ID = {hal-02975031},
HAL_VERSION = {v3},

}

@article{bensmail:hal-02533537,
TITLE = {{Further Results on an Equitable 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-02533537},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {297},
PAGES = {1-20},
YEAR = {2021},
DOI = {10.1016/j.dam.2021.02.037 Get},
KEYWORDS = {Proper labellings ; Equitable labellings ; 1-2-3 Conjecture},
PDF = {https://hal.archives-ouvertes.fr/hal-02533537v2/file/main.pdf},
HAL_ID = {hal-02533537},
HAL_VERSION = {v2},

}

@article{bensmail:hal-03455908,
TITLE = {{On Proper Labellings of Graphs with Minimum Label Sum}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-03455908},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
YEAR = {2021},
PDF = {https://hal.archives-ouvertes.fr/hal-03455908/file/Minimize_Sum_of_Edge_Labels%282%29.pdf},
HAL_ID = {hal-03455908},
HAL_VERSION = {v1},

}

@article{bensmail:hal-02554102,
TITLE = {{On a graph labelling conjecture involving coloured labels}},
AUTHOR = {Bensmail, Julien},
URL = {https://hal.archives-ouvertes.fr/hal-02554102},
JOURNAL = {{Discussiones Mathematicae Graph Theory}},
PUBLISHER = {{University of Zielona G{\'o}ra}},
YEAR = {2021},
KEYWORDS = {Proper labellings ; Coloured labels ; Weak (2 ; 2)-Conjecture ; 1-2-3 Conjecture},
PDF = {https://hal.archives-ouvertes.fr/hal-02554102v2/file/22weak.pdf},
HAL_ID = {hal-02554102},
HAL_VERSION = {v2},

}

@article{bensmail:hal-02195028,
TITLE = {{On BMRN*-colouring of planar digraphs}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos},
URL = {https://hal.archives-ouvertes.fr/hal-02195028},
TYPE = {Research Report},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {23},
NUMBER = {1},
PAGES = {\#4},
INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur, CNRS, I3S, France}},
YEAR = {2021},
MONTH = Feb,
DOI = {10.46298/dmtcs.5798},
KEYWORDS = {BMRN*-colouring ; planar digraphs ; TDMA scheduling},
PDF = {https://hal.archives-ouvertes.fr/hal-02195028v6/file/bmrn-planar.pdf},
HAL_ID = {hal-02195028},
HAL_VERSION = {v6},

}

@article{bensmail:hal-02459377,
TITLE = {{An injective version of the 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Li, Bi and Li, Binlong},
URL = {https://hal.archives-ouvertes.fr/hal-02459377},
TYPE = {Research Report},
JOURNAL = {{Graphs and Combinatorics}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {37},
PAGES = {281-311},
INSTITUTION = {{Universit{\'e} c{\^o}te d'azur}},
YEAR = {2021},
DOI = {10.1007/s00373-020-02252-y},
PDF = {https://hal.archives-ouvertes.fr/hal-02459377/file/injective123c.pdf},
HAL_ID = {hal-02459377},
HAL_VERSION = {v1},

}

@article{bensmail:hal-02330418,
TITLE = {{On Minimizing the Maximum Color for the 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Li, Bi and Li, Binlong and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-02330418},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {289},
PAGES = {32-51},
YEAR = {2021},
DOI = {10.1016/j.dam.2020.09.020},
KEYWORDS = {proper vertex-colorings ; edge labelings ; 1-2-3 Conjecture ; small vertex colors},
PDF = {https://hal.archives-ouvertes.fr/hal-02330418v2/file/maxWeightIndirectColoring_revised.pdf},
HAL_ID = {hal-02330418},
HAL_VERSION = {v2},

}

@article{bensmail:hal-02613858,
TITLE = {{On Generalisations of the AVD Conjecture to Digraphs}},
AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn},
URL = {https://hal.archives-ouvertes.fr/hal-02613858},
JOURNAL = {{Graphs and Combinatorics}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {37},
PAGES = {545-558},
YEAR = {2021},
DOI = {10.1007/s00373-020-02263-9},
KEYWORDS = {Digraphs ; AVD Conjecture ; Proper edge-colourings ; proper edge-colourings ; digraphs},
PDF = {https://hal.archives-ouvertes.fr/hal-02613858v2/file/avd-directed.pdf},
HAL_ID = {hal-02613858},
HAL_VERSION = {v2},

}

@article{bermond:hal-03455881,
TITLE = {{Graphes et T{\'e}l{\'e}communications}},
AUTHOR = {Bermond, Jean-Claude and Giroire, Fr{\'e}d{\'e}ric and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-03455881},
JOURNAL = {{Biblioth{\`e}que Tangente}},
PUBLISHER = {{Editions P{\^o}le Paris}},
SERIES = {Hors Serie 75 La recherche op{\'e}rationnelle},
NUMBER = {Hors Serie 75},
PAGES = {120-125},
YEAR = {2021},
PDF = {https://hal.archives-ouvertes.fr/hal-03455881/file/Tangente.pdf},
HAL_ID = {hal-03455881},
HAL_VERSION = {v1},

}

@article{clementi:hal-03548136,
TITLE = {{Parallel Load Balancing on constrained client-server topologies}},
AUTHOR = {Clementi, Andrea and Natale, Emanuele and Ziccardi, Isabella},
URL = {https://hal.archives-ouvertes.fr/hal-03548136},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {895},
PAGES = {16-33},
YEAR = {2021},
MONTH = Dec,
DOI = {10.1016/j.tcs.2021.09.026},
HAL_ID = {hal-03548136},
HAL_VERSION = {v1},

}

@article{cruciani:hal-03548134,
TITLE = {{Phase transition of the 2-Choices dynamics on core--periphery networks}},
AUTHOR = {Cruciani, Emilio and Natale, Emanuele and Nusser, Andr{\'e} and Scornavacca, Giacomo},
URL = {https://hal.archives-ouvertes.fr/hal-03548134},
JOURNAL = {{Distributed Computing}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {34},
NUMBER = {3},
PAGES = {207-225},
YEAR = {2021},
MONTH = Jun,
DOI = {10.1007/s00446-021-00396-5},
HAL_ID = {hal-03548134},
HAL_VERSION = {v1},

}

@article{dehghan:hal-03035385,
TITLE = {{On the semi-proper orientations of graphs}},
AUTHOR = {Dehghan, Ali and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-03035385},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {296},
PAGES = {9-25},
YEAR = {2021},
MONTH = Jun,
DOI = {10.1016/j.dam.2020.07.003},
PDF = {https://hal.inria.fr/hal-03035385/file/semi-proper.pdf},
HAL_ID = {hal-03035385},
HAL_VERSION = {v1},

}

@article{dilena:hal-03000617,
TITLE = {{Distrinet: a Mininet Implementation for the Cloud}},
AUTHOR = {Di Lena, Giuseppe and Tomassilli, Andrea and Saucez, Damien and Giroire, Fr{\'e}d{\'e}ric and Turletti, Thierry and Lac, Chidung},
URL = {https://hal.inria.fr/hal-03000617},
JOURNAL = {{Computer Communication Review}},
PUBLISHER = {{Association for Computing Machinery}},
VOLUME = {51},
NUMBER = {1},
PAGES = {2-9},
YEAR = {2021},
MONTH = Jan,
DOI = {10.1145/3457175.3457177},
PDF = {https://hal.inria.fr/hal-03000617/file/CCR_New_version.pdf},
HAL_ID = {hal-03000617},
HAL_VERSION = {v1},

}

@article{draganic:hal-03269230,
TITLE = {{Powers of paths in tournaments}},
AUTHOR = {Dragani{\'c}, Nemanja and Dross, Fran{\c c}ois and Fox, Jacob and Gir{\~a}o, Ant{\'o}nio and Havet, Fr{\'e}d{\'e}ric and Kor{\'a}ndi, D{\'a}niel and Lochet, William and Correia, David Munh{\'a} and Scott, Alex and Sudakov, Benny},
URL = {https://hal.inria.fr/hal-03269230},
JOURNAL = {{Combinatorics, Probability and Computing}},
PUBLISHER = {{Cambridge University Press (CUP)}},
PAGES = {1-5},
YEAR = {2021},
DOI = {10.1017/S0963548321000067},
PDF = {https://hal.inria.fr/hal-03269230/file/powers-of-path-tournaments.pdf},
HAL_ID = {hal-03269230},
HAL_VERSION = {v1},

}

@article{dross:hal-03269226,
TITLE = {{On the unavoidability of oriented trees}},
AUTHOR = {Dross, Fran{\c c}ois and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-03269226},
JOURNAL = {{Journal of Combinatorial Theory, Series B}},
PUBLISHER = {{Elsevier}},
VOLUME = {151},
PAGES = {83-110},
YEAR = {2021},
MONTH = Nov,
DOI = {10.1016/j.jctb.2021.06.003},
KEYWORDS = {Tournament ; Oriented tree ; Unavoidable},
PDF = {https://hal.inria.fr/hal-03269226/file/unavoidability-revise2.pdf},
HAL_ID = {hal-03269226},
HAL_VERSION = {v1},

}

@article{duong:hal-03274803,
TITLE = {{Efficient Make-Before-Break Layer 2 Reoptimization}},
AUTHOR = {Duong, Huy and Jaumard, Brigitte and Coudert, David and Armolavicius, Romualdas},
URL = {https://hal.inria.fr/hal-03274803},
JOURNAL = {{IEEE/ACM Transactions on Networking}},
PUBLISHER = {{IEEE/ACM}},
VOLUME = {29},
NUMBER = {5},
PAGES = {1910-1921},
YEAR = {2021},
MONTH = Oct,
DOI = {10.1109/TNET.2021.3078581},
KEYWORDS = {Network reconfiguration ; rerouting ; reoptimization ; make-before-break},
PDF = {https://hal.inria.fr/hal-03274803/file/MBB_layer2_ToN.pdf},
HAL_ID = {hal-03274803},
HAL_VERSION = {v1},

}

@article{frigo:hal-03033777,
TITLE = {{Network alignment and similarity reveal atlas-based topological differences in structural connectomes}},
AUTHOR = {Frigo, Matteo and Cruciani, Emilio and Coudert, David and Deriche, Rachid and Deslauriers-Gauthier, Samuel and Natale, Emanuele},
URL = {https://hal.archives-ouvertes.fr/hal-03033777},
JOURNAL = {{Network Neuroscience}},
PUBLISHER = {{MIT Press}},
YEAR = {2021},
MONTH = May,
DOI = {10.1162/netn\_a\_00199},
KEYWORDS = {Weisfeiler-Lehman ; graph Jaccard index ; graph alignment ; structural connectome ; brain network topology ; neuroscience ; OPAL-Meso ; brain parcellation ; brain network ; graph matching ; Network alignment},
PDF = {https://hal.archives-ouvertes.fr/hal-03033777v2/file/netn-manuscript.pdf},
HAL_ID = {hal-03033777},
HAL_VERSION = {v2},

}

@article{gausseran:hal-03430584,
TITLE = {{Be Scalable and Rescue My Slices During Reconfiguration}},
AUTHOR = {Gausseran, Adrien and Giroire, Frederic and Jaumard, Brigitte and Moulierac, Joanna},
URL = {https://hal.archives-ouvertes.fr/hal-03430584},
JOURNAL = {{The Computer Journal}},
PUBLISHER = {{Oxford University Press (UK)}},
VOLUME = {64},
NUMBER = {10},
PAGES = {1584-1599},
YEAR = {2021},
MONTH = Oct,
DOI = {10.1093/comjnl/bxab108},
PDF = {https://hal.archives-ouvertes.fr/hal-03430584/file/Journal_Chaining_Adrien%20-%20Copie.pdf},
HAL_ID = {hal-03430584},
HAL_VERSION = {v1},

}

@article{gausseran:hal-03430469,
TITLE = {{Don't Interrupt Me When You Reconfigure my Service Function Chains}},
AUTHOR = {Gausseran, Adrien and Tomassilli, Andrea and Giroire, Frederic and Moulierac, Joanna},
URL = {https://hal.archives-ouvertes.fr/hal-03430469},
JOURNAL = {{Computer Communications}},
PUBLISHER = {{Elsevier}},
VOLUME = {171},
PAGES = {39-53},
YEAR = {2021},
MONTH = Apr,
DOI = {10.1016/j.comcom.2021.02.008},
KEYWORDS = {Software Defined Networks ; Network Function Virtualization ; Service Function Chaining ; Network reconfiguration ; optimization},
PDF = {https://hal.archives-ouvertes.fr/hal-03430469/file/ComCom%20-%20Copie.pdf},
HAL_ID = {hal-03430469},
HAL_VERSION = {v1},

}

@article{jaumard:hal-03345749,
TITLE = {{Dantzig--Wolfe decomposition for the design of filterless optical networks}},
AUTHOR = {Jaumard, Brigitte and Wang, Yan and Coudert, David},
URL = {https://hal.inria.fr/hal-03345749},
JOURNAL = {{Journal of Optical Communications and Networking}},
PUBLISHER = {{Piscataway, NJ ; Washington, DC : IEEE : Optical Society of America}},
VOLUME = {13},
NUMBER = {12},
PAGES = {10},
YEAR = {2021},
DOI = {10.1364/JOCN.424415},
PDF = {https://hal.inria.fr/hal-03345749/file/JOCN_2021_hal_2col.pdf},
HAL_ID = {hal-03345749},
HAL_VERSION = {v1},

}

@article{mcinerney:hal-02801932,
TITLE = {{Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between}},
AUTHOR = {Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-02801932},
TYPE = {Research Report},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {83},
NUMBER = {5},
PAGES = {1459-1492},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Aix-Marseille Universite}},
YEAR = {2021},
DOI = {10.1007/s00453-020-00790-8},
KEYWORDS = {King's graph ; Strong grid ; Cartesian grid ; Grids ; Graphs ; Eternal Domination ; Combinatorial Games},
PDF = {https://hal.inria.fr/hal-02801932v2/file/eter_dom_grids_journal.pdf},
HAL_ID = {hal-02801932},
HAL_VERSION = {v2},

}

@article{sulkowska:hal-03462305,
TITLE = {{Protection numbers in simply generated trees and P{\'o}lya trees}},
AUTHOR = {Sulkowska, Malgorzata and Gittenberger, Bernhard and Golębiewski, Zbigniew and Larcher, Isabella},
URL = {https://hal.archives-ouvertes.fr/hal-03462305},
JOURNAL = {{Applicable Analysis and Discrete Mathematics}},
PUBLISHER = {{Department of Applied Mathematics, University of Belgrade}},
NUMBER = {00},
PAGES = {10-10},
YEAR = {2021},
DOI = {10.2298/AADM190329010G},
PDF = {https://hal.archives-ouvertes.fr/hal-03462305/file/protection_number.pdf},
HAL_ID = {hal-03462305},
HAL_VERSION = {v1},

}

@article{tomassilli:hal-03441630,
TITLE = {{Design of Robust Programmable Networks with Bandwidth-optimal Failure Recovery Scheme}},
AUTHOR = {Tomassilli, Andrea and Di Lena, Giuseppe and Giroire, Fr{\'e}d{\'e}ric and Tahiri, Issam and Saucez, Damien and P{\'e}rennes, St{\'e}phane and Turletti, Thierry and Sadykov, Ruslan and Vanderbeck, Fran{\c c}ois and Lac, Chidung},
URL = {https://hal.inria.fr/hal-03441630},
JOURNAL = {{Computer Networks}},
PUBLISHER = {{Elsevier}},
VOLUME = {192},
NUMBER = {108043},
YEAR = {2021},
MONTH = Jun,
DOI = {10.1016/j.comnet.2021.108043},
PDF = {https://hal.inria.fr/hal-03441630/file/2021-COMPNET-Global_Rerouting.pdf},
HAL_ID = {hal-03441630},
HAL_VERSION = {v1},

}

@article{trolliet:hal-03441498,
TITLE = {{Interest clustering coefficient: a new metric for directed networks like Twitter}},
AUTHOR = {Trolliet, Thibaud and Cohen, Nathann and Giroire, Fr{\'e}d{\'e}ric and Hogie, Luc and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-03441498},
JOURNAL = {{Journal of Complex Networks}},
PUBLISHER = {{Oxford University Press}},
YEAR = {2021},
DOI = {10.1093/comnet/cnab030},
KEYWORDS = {complex networks ; clustering coefficient ; directed networks ; social networks ; Twitter ; link recommendation},
PDF = {https://hal.inria.fr/hal-03441498/file/Interest%20clustering%20coefficient%3A%20a%20new%20metric%20for%20directed%20networks%20like%20Twitter.pdf},
HAL_ID = {hal-03441498},
HAL_VERSION = {v1},

}

@article{zorbas:hal-03142035,
TITLE = {{Fast Data Collection in LoRa Networks: a Time-Slotted Approach}},
AUTHOR = {Zorbas, Dimitrios and Caillouet, Christelle and Abdelfadeel Hassan, Khaled and Pesch, Dirk},
URL = {https://hal.inria.fr/hal-03142035},
JOURNAL = {{Sensors}},
PUBLISHER = {{MDPI}},
VOLUME = {21},
NUMBER = {4},
PAGES = {1193},
YEAR = {2021},
MONTH = Feb,
DOI = {10.3390/s21041193},
PDF = {https://hal.inria.fr/hal-03142035/file/Offline_scheduling_journal_HAL_.pdf},
HAL_ID = {hal-03142035},
HAL_VERSION = {v1},

}

@inproceedings{alzoobi:hal-03219987,
TITLE = {{De la difficult{\'e} de trouver des chemins dissimilaires}},
AUTHOR = {Al Zoobi, Ali and Coudert, David and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-03219987},
BOOKTITLE = {{ALGOTEL 2021 - 23{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {La Rochelle, France},
YEAR = {2021},
MONTH = Sep,
KEYWORDS = {Similarit{\'e} entre chemins ; $k$ plus courts chemins simples},
PDF = {https://hal.archives-ouvertes.fr/hal-03219987v2/file/On_the_k_top_shortest_paths_with_diversity_constraints_c.pdf},
HAL_ID = {hal-03219987},
HAL_VERSION = {v2},

}

@inproceedings{bensmail:hal-03211446,
TITLE = {{Connexions ! Le jeu du plus grand sous-graphe connexe}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-03211446},
BOOKTITLE = {{ALGOTEL 2021 - 23{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {La Rochelle, France},
YEAR = {2021},
MONTH = Sep,
KEYWORDS = {Games on graphs ; Scoring games ; Connection games ; PSPACE-complete ; Jeux {\`a} deux joueurs dans les graphes ; Jeux de connexion ; Jeux {\`a} score},
PDF = {https://hal.inria.fr/hal-03211446v2/file/The_Largest_Connected_Subgraph_Game_AlgoTel2.pdf},
HAL_ID = {hal-03211446},
HAL_VERSION = {v2},

}

@inproceedings{bensmail:hal-03219636,
TITLE = {{The Largest Connected Subgraph Game}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-03219636},
BOOKTITLE = {{WG 2021 - The 47th International Workshop on Graph-Theoretic Concepts in Computer Science}},
ADDRESS = {Warsaw, Poland},
PUBLISHER = {{Springer}},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {12911},
PAGES = {296-307},
YEAR = {2021},
MONTH = Jun,
DOI = {10.1007/978-3-030-86838-3\_23},
KEYWORDS = {Games on graphs ; Scoring games ; Connection games ; PSPACE-complete},
PDF = {https://hal.inria.fr/hal-03219636/file/The_Largest_Connected_Subgraph_Game%285%29%20%281%29.pdf},
HAL_ID = {hal-03219636},
HAL_VERSION = {v1},

}

@inproceedings{bensmail:hal-03119119,
TITLE = {{On the Role of 3's for the 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn},
URL = {https://hal.archives-ouvertes.fr/hal-03119119},
BOOKTITLE = {{CIAC 2021 - 12th International Conference on Algorithms and Complexity}},
ADDRESS = {Larnaca, Cyprus},
PUBLISHER = {{Springer}},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {12701},
PAGES = {103-115},
YEAR = {2021},
MONTH = May,
DOI = {10.1007/978-3-030-75242-2\_7},
KEYWORDS = {3-chromatic graphs ; Proper labellings ; 1-2-3 Conjecture},
PDF = {https://hal.archives-ouvertes.fr/hal-03119119/file/Count3_CIAC2021%20%281%29.pdf},
HAL_ID = {hal-03119119},
HAL_VERSION = {v1},

}

@inproceedings{caillouet:hal-03213988,
TITLE = {{Optimiser l'{\'e}quit{\'e} dans les r{\'e}seaux LoRaWAN}},
AUTHOR = {Caillouet, Christelle and Heusse, Martin and Rousseau, Franck},
URL = {https://hal.archives-ouvertes.fr/hal-03213988},
BOOKTITLE = {{CORES 2021 - 6{\`e}me Rencontres Francophones sur la Conception de Protocoles, l’{\'E}valuation de Performance et l’Exp{\'e}rimentation des R{\'e}seaux de Communication}},
ADDRESS = {La Rochelle, France},
SERIES = {CORES 2021 - 6{\`e}me Rencontres Francophones sur la Conception de Protocoles, l’{\'E}valuation de Performance et l’Exp{\'e}rimentation des R{\'e}seaux de Communication},
YEAR = {2021},
MONTH = May,
KEYWORDS = {LoRaWAN ; optimization ; fairness},
PDF = {https://hal.archives-ouvertes.fr/hal-03213988/file/CoRes2021_Fairness_LoRa-2.pdf},
HAL_ID = {hal-03213988},
HAL_VERSION = {v1},

}

@inproceedings{clementi:hal-02530253,
TITLE = {{Search via Parallel L{\'e}vy Walks on ${\mathbb Z}^2$}},
AUTHOR = {Clementi, Andrea and d'Amore, Francesco and Giakkoupis, George and Natale, Emanuele},
URL = {https://hal.archives-ouvertes.fr/hal-02530253},
TYPE = {Research Report},
BOOKTITLE = {{PODC 2021 - ACM Symposium on Principles of Distributed Computing}},
ADDRESS = {Salerno, Italy},
PAGES = {81--91},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Universit{\`a} degli Studi di Roma ''Tor Vergata'' ; Univ Rennes, Inria, CNRS, IRISA, France}},
YEAR = {2021},
MONTH = Jul,
DOI = {10.1145/3465084.3467921},
PDF = {https://hal.archives-ouvertes.fr/hal-02530253v5/file/levy.pdf},
HAL_ID = {hal-02530253},
HAL_VERSION = {v5},

}

@inproceedings{cruciani:hal-03007242,
TITLE = {{Phase Transitions of the $k$-Majority Dynamics in a Biased Communication Model}},
AUTHOR = {Cruciani, Emilio and Mimun, Hlafo Alfie and Quattropani, Matteo and Rizzo, Sara},
URL = {https://hal.archives-ouvertes.fr/hal-03007242},
BOOKTITLE = {{ICDCN 2021 - 22nd International Conference on Distributed Computing and Networking}},
ADDRESS = {Nara / Virtual, Japan},
PUBLISHER = {{ACM}},
PAGES = {146-155},
YEAR = {2021},
MONTH = Jan,
DOI = {10.1145/3427796.3427811},
PDF = {https://hal.archives-ouvertes.fr/hal-03007242/file/2007.15306.pdf},
HAL_ID = {hal-03007242},
HAL_VERSION = {v1},

}

@inproceedings{dilena:hal-03001913,
TITLE = {{A Right Placement Makes a Happy Emulator: a Placement Module for Distributed SDN/NFV Emulation}},
AUTHOR = {Di Lena, Giuseppe and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Saucez, Damien and Turletti, Thierry and Lac, Chidung},
URL = {https://hal.inria.fr/hal-03001913},
BOOKTITLE = {{ICC 2021 - IEEE International Conference on Communications}},
ADDRESS = {Montr{\'e}al, Canada},
PUBLISHER = {{IEEE}},
YEAR = {2021},
MONTH = Jun,
DOI = {10.1109/ICC42927.2021.9500359},
PDF = {https://hal.inria.fr/hal-03001913v2/file/distributed-emulation-placement-ICC-2021.pdf},
HAL_ID = {hal-03001913},
HAL_VERSION = {v2},

}

@inproceedings{diasdasilva:hal-03461101,
TITLE = {{Optimizing FANET deployment for mobile sensor tracking in disaster management scenario}},
AUTHOR = {Dias Da Silva, Igor and Caillouet, Christelle and Coudert, David},
URL = {https://hal.inria.fr/hal-03461101},
BOOKTITLE = {{7th International Conference on Information and Communication Technologies for Disaster Management (ICT-DM)}},
ADDRESS = {Hangzhou, China},
PUBLISHER = {{IEEE}},
PAGES = {134-141},
YEAR = {2021},
MONTH = Dec,
DOI = {10.1109/ICT-DM52643.2021.9664204},
KEYWORDS = {UAVs ; disaster management ; linear programming ; column generation},
PDF = {https://hal.inria.fr/hal-03461101/file/ICTDM21.pdf},
HAL_ID = {hal-03461101},
HAL_VERSION = {v1},

}

@inproceedings{dissaux:hal-03217731,
TITLE = {{Longueur Arborescente des Graphes S{\'e}rie-Parall{\`e}les}},
AUTHOR = {Dissaux, Thomas and Ducoffe, Guillaume and Nisse, Nicolas and Nivelle, Simon},
URL = {https://hal.archives-ouvertes.fr/hal-03217731},
BOOKTITLE = {{ALGOTEL 2021 - 23{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {La Rochelle, France},
YEAR = {2021},
MONTH = Sep,
KEYWORDS = {d{\'e}composition arborescente ; longueur arborescente ; graphes s{\'e}rie-parall{\`e}les ; sous-graphes isom{\'e}triques},
PDF = {https://hal.archives-ouvertes.fr/hal-03217731v2/file/algotel.pdf},
HAL_ID = {hal-03217731},
HAL_VERSION = {v2},

}

@inproceedings{dissaux:hal-03175837,
TITLE = {{Treelength of Series-parallel graphs}},
AUTHOR = {Dissaux, Thomas and Ducoffe, Guillaume and Nisse, Nicolas and Nivelle, Simon},
URL = {https://hal.inria.fr/hal-03175837},
BOOKTITLE = {{LAGOS 2021 - XI Latin and American Algorithms, Graphs and Optimization Symposium}},
ADDRESS = {S{\~a}o Paulo / Virtual, Brazil},
YEAR = {2021},
MONTH = May,
PDF = {https://hal.inria.fr/hal-03175837/file/Lagos_2021%289%29.pdf},
HAL_ID = {hal-03175837},
HAL_VERSION = {v1},

}

@inproceedings{duong:hal-03311598,
TITLE = {{Minimum Disturbance Rerouting to Optimize Bandwidth Usage}},
AUTHOR = {Duong, Huy and Jaumard, Brigitte and Coudert, David},
URL = {https://hal.inria.fr/hal-03311598},
BOOKTITLE = {{ONDM 2021 - International Conference on Optical Network Design and Modeling}},
ADDRESS = {Gothenburg, Sweden},
PUBLISHER = {{IEEE}},
PAGES = {1-6},
YEAR = {2021},
MONTH = Jun,
DOI = {10.23919/ONDM51796.2021.9492388},
KEYWORDS = {Network reconfiguration ; rerouting ; reoptimization ; make-before-break},
PDF = {https://hal.inria.fr/hal-03311598/file/ONDM_2021_hal.pdf},
HAL_ID = {hal-03311598},
HAL_VERSION = {v1},

}

@inproceedings{lesfari:hal-03364714,
TITLE = {{A multidimensional colored packing approach for network slicing with dedicated protection}},
AUTHOR = {Lesfari, Hicham and Giroire, Fr{\'e}d{\'e}ric and Lena, Giuseppe Di and Lac, Chidung},
URL = {https://hal.inria.fr/hal-03364714},
BOOKTITLE = {{IEEE Global Communications Conference (GLOBECOM)}},
ADDRESS = {Madrid, Spain},
YEAR = {2021},
MONTH = Dec,
PDF = {https://hal.inria.fr/hal-03364714/file/VNFC_Protection_New%20%282%29.pdf},
HAL_ID = {hal-03364714},
HAL_VERSION = {v1},

}

@inproceedings{lesfari:hal-03221201,
TITLE = {{Une rencontre entre les noyaux de graphes et la detection d’anomalies dans les reseaux}},
AUTHOR = {Lesfari, Hicham and Giroire, Fr{\'e}d{\'e}ric},
URL = {https://hal.archives-ouvertes.fr/hal-03221201},
BOOKTITLE = {{ALGOTEL 2021 - 23{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {La Rochelle, France},
YEAR = {2021},
MONTH = Sep,
KEYWORDS = {Noyaux de graphe ; D{\'e}tection d'anomalies ; Apprentissage automatique ; R{\'e}seaux informatiques},
PDF = {https://hal.archives-ouvertes.fr/hal-03221201/file/algotel_2021.pdf},
HAL_ID = {hal-03221201},
HAL_VERSION = {v1},

}

@inproceedings{ma:hal-03441537,
TITLE = {{When Locality is not enough: Boosting Peer Selection of Hybrid CDN-P2P Live Streaming Systems using Machine Learning}},
AUTHOR = {Ma, Zhejiayu and Roubia, Soufiane and Giroire, Fr{\'e}d{\'e}ric and Urvoy-Keller, Guillaume},
URL = {https://hal.inria.fr/hal-03441537},
BOOKTITLE = {{Network Traffic Measurement and Analysis Conference (IFIP TMA 2021)}},
ADDRESS = {Virtual, France},
PUBLISHER = {{IFIP}},
YEAR = {2021},
MONTH = Sep,
KEYWORDS = {hybrid P2P ; live streaming ; peer selection ; machine learning},
PDF = {https://hal.inria.fr/hal-03441537/file/2021-TMA-Peer-Selection-Hybrid%20CDN-P2P-Streaming-Systems.pdf},
HAL_ID = {hal-03441537},
HAL_VERSION = {v1},

}

@inproceedings{trolliet:hal-03220068,
TITLE = {{Un mod{\`e}le de graphes al{\'e}atoires croissants pour n'importe quelle distribution des degr{\'e}s}},
AUTHOR = {Trolliet, Thibaud and Giroire, Fr{\'e}d{\'e}ric and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.archives-ouvertes.fr/hal-03220068},
BOOKTITLE = {{ALGOTEL 2021 - 23{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {La Rochelle, France},
YEAR = {2021},
MONTH = Sep,
KEYWORDS = {Syst{\`e}mes Complexes ; Mod{\'e}lisation ; Attachement Pr{\'e}f{\'e}rentiel ; Distribution des degr{\'e}s ; Twitter},
PDF = {https://hal.archives-ouvertes.fr/hal-03220068/file/Algotel_Trolliet_Submission7.pdf},
HAL_ID = {hal-03220068},
HAL_VERSION = {v1},

}

@inproceedings{xu:hal-03364766,
TITLE = {{What else is leaked when eavesdropping Federated Learning?}},
AUTHOR = {Xu, Chuan and Neglia, Giovanni},
URL = {https://hal.archives-ouvertes.fr/hal-03364766},
NOTE = {Virtual, Contributed talk},
BOOKTITLE = {{CCS workshop Privacy Preserving Machine Learning (PPML)}},
ADDRESS = {Soeul, South Korea},
YEAR = {2021},
MONTH = Nov,
DOI = {10.1145/1122445.1122456},
PDF = {https://hal.archives-ouvertes.fr/hal-03364766v2/file/What_else_is_leaked_in_FL_ACM%281%29.pdf},
HAL_ID = {hal-03364766},
HAL_VERSION = {v2},

}

@inproceedings{zari:hal-03410152,
TITLE = {{Efficient passive membership inference attack in federated learning}},
AUTHOR = {Zari, Oualid and Xu, Chuan and Neglia, Giovanni},
URL = {https://hal.archives-ouvertes.fr/hal-03410152},
BOOKTITLE = {{Privacy in Machine Learning - NeurIPS PriML workshop}},
ADDRESS = {Virtual, France},
YEAR = {2021},
MONTH = Dec,
PDF = {https://hal.archives-ouvertes.fr/hal-03410152/file/Passive_inference_attack%282%29.pdf},
HAL_ID = {hal-03410152},
HAL_VERSION = {v1},

}

@techreport{aboulker:hal-03269426,
TITLE = {{On the dichromatic number of surfaces}},
AUTHOR = {Aboulker, Pierre and Havet, Fr{\'e}d{\'e}ric and Knauer, Kolja and Rambaud, Cl{\'e}ment},
URL = {https://hal.inria.fr/hal-03269426},
NOTE = {25 pages, 5 figures, improved asymptotic bounds},
TYPE = {Research Report},
INSTITUTION = {{Inria ; CNRS ; I3S ; Universit{\'e} C{\^o}te D'Azur}},
YEAR = {2021},
HAL_ID = {hal-03269426},
HAL_VERSION = {v1},

}

@techreport{alzoobi:hal-03196830,
TITLE = {{Finding the k Shortest Simple Paths: Time and Space trade-offs}},
AUTHOR = {Al Zoobi, Ali and Coudert, David and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-03196830},
TYPE = {Research Report},
INSTITUTION = {{Inria ; I3S, Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2021},
MONTH = Apr,
KEYWORDS = {k shortest simple paths ; graph algorithm ; space-time trade-off},
PDF = {https://hal.archives-ouvertes.fr/hal-03196830/file/Journal-kssp.pdf},
HAL_ID = {hal-03196830},
HAL_VERSION = {v1},

}

@techreport{alzoobi:hal-03187276,
TITLE = {{On the complexity of finding $k$ shortest dissimilar paths in a graph}},
AUTHOR = {Al Zoobi, Ali and Coudert, David and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-03187276},
TYPE = {Research Report},
PAGES = {9},
INSTITUTION = {{Inria ; CNRS ; I3S ; Universit{\'e} C{\^o}te d’Azur}},
YEAR = {2021},
PDF = {https://hal.archives-ouvertes.fr/hal-03187276v2/file/On_the_k_top_shortest_paths_with_dissimilarity_constraints-v2.pdf},
HAL_ID = {hal-03187276},
HAL_VERSION = {v2},

}

@techreport{benevides:hal-03161419,
TITLE = {{Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation}},
AUTHOR = {Benevides, Fabricio and Bermond, Jean-Claude and Lesfari, Hicham and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-03161419},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2021},
PDF = {https://hal.archives-ouvertes.fr/hal-03161419v4/file/virality__contamination_game_%2813%29.pdf},
HAL_ID = {hal-03161419},
HAL_VERSION = {v4},

}

@techreport{bensmail:hal-03355826,
TITLE = {{Generalising the achromatic number to Zaslavsky's colourings of signed graphs}},
AUTHOR = {Bensmail, Julien and Dross, Fran{\c c}ois and Oijid, Nacim and Sopena, {\'E}ric},
URL = {https://hal.archives-ouvertes.fr/hal-03355826},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} c{\^o}te d'azur ; Universit{\'e} de Bordeaux ; Universit{\'e} lyon 1}},
YEAR = {2021},
KEYWORDS = {chromatic number ; achromatic number ; complete colouring ; Zaslavsky's colouring ; signed graph},
PDF = {https://hal.archives-ouvertes.fr/hal-03355826/file/achromatic-signed.pdf},
HAL_ID = {hal-03355826},
HAL_VERSION = {v1},

}

@techreport{bensmail:hal-03500888,
TITLE = {{The Maker-Breaker Largest Connected Subgraph Game}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn and Nisse, Nicolas and Oijid, Nacim},
URL = {https://hal.inria.fr/hal-03500888},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te d’Azur, CNRS, Inria, I3S, Biot, France}},
YEAR = {2021},
DOI = {10.1007/978-3-030-86838-3\_23},
KEYWORDS = {Maker-Breaker games ; Largest connected subgraph game ; Connection games ; PSPACE-complete},
PDF = {https://hal.inria.fr/hal-03500888/file/The_Largest_Connected_Subgraph_Game__maker_breaker_version%286%29.pdf},
HAL_ID = {hal-03500888},
HAL_VERSION = {v1},

}

@techreport{bensmail:hal-03137305,
TITLE = {{The Largest Connected Subgraph Game}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-03137305},
TYPE = {Research Report},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; CISPA Helmholtz Center for Information Security, Saarbr{\"u}cken, Germany}},
YEAR = {2021},
KEYWORDS = {Games on graphs ; Scoring games ; Connection games ; PSPACE-complete ; GI-hard},
PDF = {https://hal.inria.fr/hal-03137305v4/file/The_Largest_Connected_Subgraph_Game.pdf},
HAL_ID = {hal-03137305},
HAL_VERSION = {v4},

}

@techreport{bensmail:hal-03324458,
TITLE = {{A proof of the Multiplicative 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Hocquard, Herv{\'e} and Lajou, Dimitri and Sopena, {\'E}ric},
URL = {https://hal.archives-ouvertes.fr/hal-03324458},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} c{\^o}te d'azur ; Universit{\'e} de bordeaux}},
YEAR = {2021},
KEYWORDS = {1-2-3 Conjecture ; product version ; labels 1-2-3},
PDF = {https://hal.archives-ouvertes.fr/hal-03324458/file/proof123p.pdf},
HAL_ID = {hal-03324458},
HAL_VERSION = {v1},

}

@techreport{bensmail:hal-03120800,
TITLE = {{On a List Variant of the Multiplicative 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Hocquard, Herv{\'e} and Lajou, Dimitri and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-03120800},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} de bordeaux ; Universit{\'e} c{\^o}te d'azur}},
YEAR = {2021},
KEYWORDS = {proper labelling ; 1-2-3 Conjecture ; product ; list},
PDF = {https://hal.archives-ouvertes.fr/hal-03120800/file/main.pdf},
HAL_ID = {hal-03120800},
HAL_VERSION = {v1},

}

@techreport{bensmail:hal-03225353,
TITLE = {{Going Wide with the 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Hocquard, Herv{\'e} and Marcille, Pierre-Marie},
URL = {https://hal.archives-ouvertes.fr/hal-03225353},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur ; Universit{\'e} de Bordeaux ; ENS Lyon}},
YEAR = {2021},
KEYWORDS = {Distinguishing labelling ; 1-2-3 Conjecture ; fixed radius},
PDF = {https://hal.archives-ouvertes.fr/hal-03225353/file/radius123.pdf},
HAL_ID = {hal-03225353},
HAL_VERSION = {v1},

}

@techreport{bensmail:hal-03262227,
TITLE = {{The Vertex-Capturing Game}},
AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn},
URL = {https://hal.archives-ouvertes.fr/hal-03262227},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur ; CISPA Helmholtz Center for Information Security}},
YEAR = {2021},
KEYWORDS = {scoring game ; combinatorial game ; 2-player game ; graph},
PDF = {https://hal.archives-ouvertes.fr/hal-03262227/file/main.pdf},
HAL_ID = {hal-03262227},
HAL_VERSION = {v1},

}

@techreport{coudert:hal-03264788,
TITLE = {{On finding $k$ earliest arrival time journeys in public transit networks}},
AUTHOR = {Coudert, David and Al Zoobi, Ali and Finkelstein, Arthur},
URL = {https://hal.archives-ouvertes.fr/hal-03264788},
TYPE = {Research Report},
INSTITUTION = {{Inria}},
YEAR = {2021},
MONTH = Jun,
KEYWORDS = {Journey planning ; shortest path ; routing ; timetables},
PDF = {https://hal.archives-ouvertes.fr/hal-03264788/file/Multimod_kssp_Hal.pdf},
HAL_ID = {hal-03264788},
HAL_VERSION = {v1},

}

@techreport{coudert:hal-03201405,
TITLE = {{Enumeration of far-apart pairs by decreasing distance for faster hyperbolicity computation}},
AUTHOR = {Coudert, David and Nusser, Andr{\'e} and Viennot, Laurent},
URL = {https://hal.inria.fr/hal-03201405},
TYPE = {Research Report},
INSTITUTION = {{Inria ; I3S, Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2021},
MONTH = Apr,
KEYWORDS = {Gromov hyperbolicity ; Graph algorithms ; Far-apart pairs ; Enumeration algorithms},
PDF = {https://hal.inria.fr/hal-03201405/file/main-hal.pdf},
HAL_ID = {hal-03201405},
HAL_VERSION = {v1},

}

@techreport{damore:hal-03479582,
TITLE = {{Planning with Biological Neurons and Synapses}},
AUTHOR = {d'Amore, Francesco and Mitropolsky, Daniel and Crescenzi, Pierluigi and Natale, Emanuele and Papadimitriou, Christos H},
URL = {https://hal.archives-ouvertes.fr/hal-03479582},
NOTE = {To appear in AAAI 2022},
TYPE = {Research Report},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Gran Sasso Science Institute (L'Aquila, Italie) ; Department of Computer Science, Columbia University, New York}},
YEAR = {2021},
MONTH = Dec,
PDF = {https://hal.archives-ouvertes.fr/hal-03479582v2/file/Planning_in_AC.pdf},
HAL_ID = {hal-03479582},
HAL_VERSION = {v2},

}

@techreport{damore:hal-03467403,
TITLE = {{Phase Transition of the 3-Majority Dynamics with Uniform Communication Noise}},
AUTHOR = {d'Amore, Francesco and Ziccardi, Isabella},
URL = {https://hal.archives-ouvertes.fr/hal-03467403},
TYPE = {Research Report},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Universit{\`a} degli Studi dell'Aquila}},
YEAR = {2021},
MONTH = Dec,
KEYWORDS = {Opinion Dynamics ; Uniform Communication Noise ; Consensus Problem ; Distributed Computing ; Randomized Algorithms},
PDF = {https://hal.archives-ouvertes.fr/hal-03467403v2/file/3maj.pdf},
HAL_ID = {hal-03467403},
HAL_VERSION = {v2},

}

@techreport{dacunha:hal-03157141,
TITLE = {{Neural Network Information Leakage through Hidden Learning}},
AUTHOR = {Da Cunha, Arthur and Natale, Emanuele and Viennot, Laurent},
URL = {https://hal.archives-ouvertes.fr/hal-03157141},
TYPE = {Research Report},
INSTITUTION = {{Inria ; CNRS ; I3S ; Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2021},
PDF = {https://hal.archives-ouvertes.fr/hal-03157141/file/hidden_learning.pdf},
HAL_ID = {hal-03157141},
HAL_VERSION = {v1},

}

@techreport{dilena:hal-03132873,
TITLE = {{Placement Module for Distributed SDN/NFV Network Emulation}},
AUTHOR = {Di Lena, Giuseppe and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Saucez, Damien and Turletti, Thierry and Lac, Chidung},
URL = {https://hal.inria.fr/hal-03132873},
TYPE = {Research Report},
NUMBER = {RR-9391},
PAGES = {32},
INSTITUTION = {{Inria Sophia Antipolis - M{\'e}diterran{\'e}e ; I3S, Universit{\'e} C{\^o}te d'Azur ; Orange Labs R\&D [Lannion] (France T{\'e}l{\'e}com)}},
YEAR = {2021},
MONTH = Feb,
KEYWORDS = {Virtualization ; Emulation ; Placement ; Approximation algorithms ; Virtualisation r{\'e}seau ; Emulation distribu{\'e}e ; Algorithmes de placement},
PDF = {https://hal.inria.fr/hal-03132873/file/DistrinetPlacement_Long_version-10.pdf},
HAL_ID = {hal-03132873},
HAL_VERSION = {v1},

}

@techreport{fioravantes:hal-03358273,
TITLE = {{Complexity of Finding Maximum Locally Irregular Induced Subgraphs}},
AUTHOR = {Fioravantes, Foivos and Melissinos, Nikolaos and Triommatis, Theofilos},
URL = {https://hal.archives-ouvertes.fr/hal-03358273},
TYPE = {Research Report},
INSTITUTION = {{Inria ; I3S ; Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2021},
MONTH = Sep,
KEYWORDS = {FPT ; largest induced subgraph ; Locally irregular ; treewidth ; W-hardness},
PDF = {https://hal.archives-ouvertes.fr/hal-03358273/file/Largest_locally_irregular_induced_subgraph%284%29.pdf},
HAL_ID = {hal-03358273},
HAL_VERSION = {v1},

}

@techreport{giroire:hal-03154836,
TITLE = {{Preferential attachment hypergraph with high modularity}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Nisse, Nicolas and Trolliet, Thibaud and Sulkowska, Malgorzata},
URL = {https://hal.archives-ouvertes.fr/hal-03154836},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} Cote d'Azur}},
YEAR = {2021},
KEYWORDS = {Complex network ; Hypergraph ; Preferential attachment ; Modularity},
PDF = {https://hal.archives-ouvertes.fr/hal-03154836/file/Projet_SNIF___Hypergraph_Model_with_Modularity%282%29.pdf},
HAL_ID = {hal-03154836},
HAL_VERSION = {v1},

}

@techreport{havet:hal-03472923,
TITLE = {{Spanning eulerian subdigraphs in semicomplete digraphs}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Bang-Jensen, J{{\o}}rgen and Yeo, Anders},
URL = {https://hal.inria.fr/hal-03472923},
TYPE = {Research Report},
INSTITUTION = {{Inria ; CNRS ; I3S ; Universit{\'e} c{\^o}te d'azur}},
YEAR = {2021},
MONTH = Dec,
KEYWORDS = {Arc-connectivity ; Eulerian subdigraph ; Tournament ; Semicomplete digraph ; polynomial algorithm},
PDF = {https://hal.inria.fr/hal-03472923/file/supereulerian-revise.pdf},
HAL_ID = {hal-03472923},
HAL_VERSION = {v1},

}

@techreport{havet:hal-03368214,
TITLE = {{On the complexity of overlaying a hypergraph with a graph with bounded maximum degree}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Mazauric, Dorian and Nguyen, Viet-Ha},
URL = {https://hal.inria.fr/hal-03368214},
TYPE = {Research Report},
INSTITUTION = {{Inria ; CNRS ; I3S ; Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2021},
PDF = {https://hal.inria.fr/hal-03368214v2/file/article_appendice.pdf},
HAL_ID = {hal-03368214},
HAL_VERSION = {v2},

}

@techreport{nguyen:hal-03512769,
TITLE = {{Rikudo is NP-complete}},
AUTHOR = {Nguyen, Viet-Ha and Perrot, K{\'e}vin},
URL = {https://hal.inria.fr/hal-03512769},
TYPE = {Research Report},
INSTITUTION = {{Inria ; Universit{\'e} C{\^o}te d'Azur ; I3S ; CNRS}},
YEAR = {2021},
HAL_ID = {hal-03512769},
HAL_VERSION = {v1},

}

@techreport{sulkowska:hal-03462575,
TITLE = {{Counting embeddings of rooted trees into families of rooted trees}},
AUTHOR = {Sulkowska, Malgorzata and Gittenberger, Bernhard and Golębiewski, Zbigniew and Larcher, Isabella},
URL = {https://hal.archives-ouvertes.fr/hal-03462575},
NOTE = {20 pages, 6 figures},
TYPE = {Research Report},
INSTITUTION = {{Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142) ; Wroclaw University of Science and Technology ; Technische Universit{\"a}t Wien}},
YEAR = {2021},
MONTH = Sep,
PDF = {https://hal.archives-ouvertes.fr/hal-03462575/file/tree_embeddings.pdf},
HAL_ID = {hal-03462575},
HAL_VERSION = {v1},

}

@techreport{sulkowska:hal-03462375,
TITLE = {{Running minimum in the best-choice problem}},
AUTHOR = {Sulkowska, Malgorzata and Gnedin, Alexander and Koziel, Patryk},
URL = {https://hal.archives-ouvertes.fr/hal-03462375},
NOTE = {22 pages, 9 figures},
TYPE = {Research Report},
INSTITUTION = {{Wroclaw University of Science and Technology ; University of London, Queen Mary ; Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142)}},
YEAR = {2021},
MONTH = Oct,
PDF = {https://hal.archives-ouvertes.fr/hal-03462375/file/HittingTimes.pdf},
HAL_ID = {hal-03462375},
HAL_VERSION = {v1},

}

@techreport{sulkowska:hal-03462572,
TITLE = {{What Do Our Choices Say About Our Preferences?}},
AUTHOR = {Sulkowska, Malgorzata and Grining, Krzysztof and Klonowski, Marek},
URL = {https://hal.archives-ouvertes.fr/hal-03462572},
NOTE = {22 pages, 6 figures},
TYPE = {Research Report},
INSTITUTION = {{Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142) ; Wroclaw University of Science and Technology}},
YEAR = {2021},
MONTH = Jun,
PDF = {https://hal.archives-ouvertes.fr/hal-03462572/file/main.pdf},
HAL_ID = {hal-03462572},
HAL_VERSION = {v1},

}

@techreport{sulkowska:hal-03462570,
TITLE = {{Modularity of minor-free graphs}},
AUTHOR = {Sulkowska, Malgorzata and Laso{\'n}, Michal},
URL = {https://hal.archives-ouvertes.fr/hal-03462570},
NOTE = {7 pages, 1 figure},
TYPE = {Research Report},
INSTITUTION = {{Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142) ; Institute of Mathematics of the Polish Academy of Sciences ; Wroclaw University of Science and Technology}},
YEAR = {2021},
MONTH = Feb,
PDF = {https://hal.archives-ouvertes.fr/hal-03462570/file/modularity.pdf},
HAL_ID = {hal-03462570},
HAL_VERSION = {v1},

}

@misc{alzoobi:hal-03438331,
TITLE = {{k shortest simple paths}},
AUTHOR = {Al Zoobi, Ali and Coudert, David and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-03438331},
NOTE = {Software},
YEAR = {2021},
KEYWORDS = {k shortest simple paths ; Graph algorithms ; Space-time trade-off},
HAL_ID = {hal-03438331},
HAL_VERSION = {v1},

}

@misc{coudert:hal-03438325,
TITLE = {{Hyperbolicity}},
AUTHOR = {Coudert, David and Nusser, Andr{\'e} and Viennot, Laurent},
URL = {https://hal.inria.fr/hal-03438325},
NOTE = {Software},
YEAR = {2021},
KEYWORDS = {Gromov hyperbolicity ; Graph algorithms ; Algorithm engineering},
HAL_ID = {hal-03438325},
HAL_VERSION = {v1},

}

@misc{cruciani:hal-03483921,
TITLE = {{On some Opinion Dynamics in Multi-Agent Systems}},
AUTHOR = {Cruciani, Emilio and d'Amore, Francesco and Natale, Emanuele},
URL = {https://hal.archives-ouvertes.fr/hal-03483921},
NOTE = {Poster},
HOWPUBLISHED = {{MOMI2021: Le Monde des Mathematiques Industrielles}},
YEAR = {2021},
MONTH = Mar,
PDF = {https://hal.archives-ouvertes.fr/hal-03483921/file/poster_momi.pdf},
HAL_ID = {hal-03483921},
HAL_VERSION = {v1},

}

@misc{dilena:hal-03364025,
TITLE = {{CloudTrace Demo: Tracing Cloud Network Delay}},
AUTHOR = {Di Lena, Giuseppe and Giroire, Fr{\'e}d{\'e}ric and Turletti, Thierry and Lac, Chidung},
URL = {https://hal.inria.fr/hal-03364025},
NOTE = {Poster},
HOWPUBLISHED = {{IEEE International Conference on Network Softwarization (NetSoft)}},
PUBLISHER = {{IEEE}},
YEAR = {2021},
MONTH = Jun,
DOI = {10.1109/NetSoft51509.2021.9492583},
PDF = {https://hal.inria.fr/hal-03364025/file/CM.pdf},
HAL_ID = {hal-03364025},
HAL_VERSION = {v1},

}

@phdthesis{bensmail:tel-03081889,
TITLE = {{A contribution to distinguishing labellings of graphs}},
AUTHOR = {Bensmail, Julien},
URL = {https://hal.archives-ouvertes.fr/tel-03081889},
SCHOOL = {{Universit{\'e} c{\^o}te d'azur}},
YEAR = {2020},
MONTH = Dec,
KEYWORDS = {distinguishing labellings ; 1-2-3 Conjecture ; locally irregular decompositions ; graph decompositions ; graph colourings ; pond{\'e}rations distinguantes},
TYPE = {Habilitation {\`a} diriger des recherches},
PDF = {https://hal.archives-ouvertes.fr/tel-03081889/file/jbensmail-hdr.pdf},
HAL_ID = {tel-03081889},
HAL_VERSION = {v1},

}

@article{aharoni:hal-02497425,
TITLE = {{Cooperative colorings of trees and of bipartite graphs}},
AUTHOR = {Aharoni, Ron and Berger, Eli and Chudnovsky, Maria and Havet, Fr{\'e}d{\'e}ric and Jiang, Zilin},
URL = {https://hal.inria.fr/hal-02497425},
JOURNAL = {{The Electronic Journal of Combinatorics}},
PUBLISHER = {{Open Journal Systems}},
YEAR = {2020},
MONTH = Feb,
PDF = {https://hal.inria.fr/hal-02497425/file/ejc-cooperative_coloring.pdf},
HAL_ID = {hal-02497425},
HAL_VERSION = {v1},

}

@article{becchetti:hal-02507613,
TITLE = {{Consensus Dynamics: An Overview}},
AUTHOR = {Becchetti, Luca and Clementi, Andrea and Natale, Emanuele},
URL = {https://hal.archives-ouvertes.fr/hal-02507613},
NOTE = {Distributed Computing Column 77},
JOURNAL = {{ACM SIGACT News}},
PUBLISHER = {{Association for Computing Machinery (ACM)}},
VOLUME = {51},
NUMBER = {1},
PAGES = {57},
YEAR = {2020},
MONTH = Mar,
DOI = {10.1145/3388392.3388402},
KEYWORDS = {distributed computing ; computational dynamics},
PDF = {https://hal.archives-ouvertes.fr/hal-02507613/file/preprint_Dynamics_Survey.pdf},
HAL_ID = {hal-02507613},
HAL_VERSION = {v1},

}

@article{becchetti:hal-03025943,
TITLE = {{Find Your Place: Simple Distributed Algorithms for Community Detection}},
AUTHOR = {Becchetti, Luca and Clementi, Andrea and Natale, Emanuele and Pasquale, Francesco and Trevisan, Luca},
URL = {https://hal.archives-ouvertes.fr/hal-03025943},
JOURNAL = {{SIAM Journal on Computing}},
PUBLISHER = {{Society for Industrial and Applied Mathematics}},
VOLUME = {49},
NUMBER = {4},
PAGES = {821-864},
YEAR = {2020},
MONTH = Jan,
DOI = {10.1137/19M1243026},
KEYWORDS = {Distributed Algorithms ; Averaging Dynamics ; Community Detection ; Spectral Analysis ; Stochastic Block Models},
PDF = {https://hal.archives-ouvertes.fr/hal-03025943/file/find_your_place_preprint.pdf},
HAL_ID = {hal-03025943},
HAL_VERSION = {v1},

}

@article{becchetti:hal-03007156,
TITLE = {{Step-by-step community detection in volume-regular graphs}},
AUTHOR = {Becchetti, Luca and Cruciani, Emilio and Pasquale, Francesco and Rizzo, Sara},
URL = {https://hal.archives-ouvertes.fr/hal-03007156},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {847},
PAGES = {49-67},
YEAR = {2020},
MONTH = Dec,
DOI = {10.1016/j.tcs.2020.09.036},
KEYWORDS = {Community detection ; Distributed algorithms ; Dynamics ; Markov chains ; Spectral analysis},
PDF = {https://hal.archives-ouvertes.fr/hal-03007156/file/1907.07149.pdf},
HAL_ID = {hal-03007156},
HAL_VERSION = {v1},

}

@article{bensmail:hal-02112188,
TITLE = {{From light edges to strong edge-colouring of 1-planar graphs}},
AUTHOR = {Bensmail, Julien and Dross, Fran{\c c}ois and Hocquard, Herv{\'e} and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-02112188},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {vol. 22 no. 1},
NUMBER = {2},
YEAR = {2020},
MONTH = Jan,
KEYWORDS = {1-planar graphs ; Light edges ; Strong edge-colouring ; Strong chromatic index},
PDF = {https://hal.archives-ouvertes.fr/hal-02112188v3/file/1planar-strong.pdf},
HAL_ID = {hal-02112188},
HAL_VERSION = {v3},

}

@article{bensmail:hal-02090804,
TITLE = {{Decomposing degenerate graphs into locally irregular subgraphs}},
AUTHOR = {Bensmail, Julien and Dross, Fran{\c c}ois and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-02090804},
JOURNAL = {{Graphs and Combinatorics}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {36},
NUMBER = {6},
PAGES = {1869--1889},
YEAR = {2020},
KEYWORDS = {planar graphs ; k-trees ; locally irregular decompositions ; degenerate graphs ; cacti},
PDF = {https://hal.archives-ouvertes.fr/hal-02090804v3/file/irregular-degenerate.pdf},
HAL_ID = {hal-02090804},
HAL_VERSION = {v3},

}

@article{bensmail:hal-02459377,
TITLE = {{An injective version of the 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Li, Bi and Li, Binlong},
URL = {https://hal.archives-ouvertes.fr/hal-02459377},
TYPE = {Research Report},
JOURNAL = {{Graphs and Combinatorics}},
PUBLISHER = {{Springer Verlag}},
INSTITUTION = {{Universit{\'e} c{\^o}te d'azur}},
YEAR = {2020},
PDF = {https://hal.archives-ouvertes.fr/hal-02459377/file/injective123c.pdf},
HAL_ID = {hal-02459377},
HAL_VERSION = {v1},

}

@article{bensmail:hal-01915633,
TITLE = {{More Aspects of Arbitrarily Partitionable Graphs}},
AUTHOR = {Bensmail, Julien and Li, Binlong},
URL = {https://hal.archives-ouvertes.fr/hal-01915633},
JOURNAL = {{Discussiones Mathematicae Graph Theory}},
PUBLISHER = {{University of Zielona G{\'o}ra}},
YEAR = {2020},
KEYWORDS = {arbitrarily partitionable graphs ; partition into connected subgraphs ; Hamiltonicity},
PDF = {https://hal.archives-ouvertes.fr/hal-01915633v2/file/moreAP.pdf},
HAL_ID = {hal-01915633},
HAL_VERSION = {v2},

}

@article{bensmail:hal-02269482,
TITLE = {{1-2-3 Conjecture in Digraphs: More Results and Directions}},
AUTHOR = {Bensmail, Julien and Lyngsie, Kasper},
URL = {https://hal.archives-ouvertes.fr/hal-02269482},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {284},
PAGES = {124-137},
YEAR = {2020},
KEYWORDS = {Choosability ; Complexity ; 1-2-3 Conjecture ; Directed variants ; Bounds},
PDF = {https://hal.archives-ouvertes.fr/hal-02269482v2/file/inverse-luczak.pdf},
HAL_ID = {hal-02269482},
HAL_VERSION = {v2},

}

@article{bensmail:hal-01717629,
TITLE = {{Sequential Metric Dimension}},
AUTHOR = {Bensmail, Julien and Mazauric, Dorian and Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.archives-ouvertes.fr/hal-01717629},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {82},
NUMBER = {10},
PAGES = {2867-2901},
YEAR = {2020},
KEYWORDS = {Complexity ; Metric dimension ; Games in graphs},
PDF = {https://hal.archives-ouvertes.fr/hal-01717629v3/file/seq_metric_dim_Algorithmica_with_corrections.pdf},
HAL_ID = {hal-01717629},
HAL_VERSION = {v3},

}

@article{bensmail:hal-02613858,
TITLE = {{On Generalisations of the AVD Conjecture to Digraphs}},
AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn},
URL = {https://hal.archives-ouvertes.fr/hal-02613858},
JOURNAL = {{Graphs and Combinatorics}},
PUBLISHER = {{Springer Verlag}},
YEAR = {2020},
KEYWORDS = {Digraphs ; AVD Conjecture ; Proper edge-colourings ; proper edge-colourings ; digraphs},
PDF = {https://hal.archives-ouvertes.fr/hal-02613858v2/file/avd-directed.pdf},
HAL_ID = {hal-02613858},
HAL_VERSION = {v2},

}

@article{bensmail:hal-01938290,
TITLE = {{Metric Dimension: from Graphs to Oriented Graphs}},
AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01938290},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
YEAR = {2020},
KEYWORDS = {Strongly-connected orientations ; Metric dimension ; Resolving sets},
PDF = {https://hal.inria.fr/hal-01938290v3/file/ori_md_DAM_version_HAL.pdf},
HAL_ID = {hal-01938290},
HAL_VERSION = {v3},

}

@article{bensmail:hal-01919007,
TITLE = {{Classification of edge-critical underlying absolute planar cliques for signed graphs}},
AUTHOR = {Bensmail, Julien and Nandi, Soumen and Roy, Mithun and Sen, Sagnik},
URL = {https://hal.archives-ouvertes.fr/hal-01919007},
JOURNAL = {{The Australasian Journal of Combinatorics}},
PUBLISHER = {{Combinatorial Mathematics Society of Australasia (Inc.)}},
VOLUME = {77},
NUMBER = {1},
PAGES = {117-135},
YEAR = {2020},
MONTH = Jun,
KEYWORDS = {planar graphs ; absolute cliques ; signed graphs ; graph homomorphisms},
PDF = {https://hal.archives-ouvertes.fr/hal-01919007v2/file/BNRS_revision2_v1.pdf},
HAL_ID = {hal-01919007},
HAL_VERSION = {v2},

}

@article{bermond:hal-01977266,
TITLE = {{Distributed Link Scheduling in Wireless Networks}},
AUTHOR = {Bermond, Jean-Claude and Mazauric, Dorian and Misra, Vishal and Nain, Philippe},
URL = {https://hal.inria.fr/hal-01977266},
JOURNAL = {{Discrete Mathematics, Algorithms and Applications}},
PUBLISHER = {{World Scientific Publishing}},
VOLUME = {12},
NUMBER = {5},
PAGES = {1-38},
YEAR = {2020},
DOI = {10.1142/S1793830920500585},
KEYWORDS = {Stability ; Distributed algorithm ; Wireless network ; Link scheduling algorithm ; Binary interference ; Graph},
PDF = {https://hal.inria.fr/hal-01977266v2/file/sans-format.pdf},
HAL_ID = {hal-01977266},
HAL_VERSION = {v2},

}

@article{cohen:hal-01881473,
TITLE = {{Study of a Combinatorial Game in Graphs Through Linear Programming}},
AUTHOR = {Cohen, Nathann and Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.archives-ouvertes.fr/hal-01881473},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {82},
NUMBER = {2},
PAGES = {212-244},
YEAR = {2020},
DOI = {10.1007/s00453-018-0503-9},
KEYWORDS = {Grid ; Tree ; Linear Programming ; Domination ; Graphs ; Spy game ; Cops and Robber games},
PDF = {https://hal.archives-ouvertes.fr/hal-01881473/file/spygame_trees_grids_July18.pdf},
HAL_ID = {hal-01881473},
HAL_VERSION = {v1},

}

@article{dehghan:hal-03035385,
TITLE = {{On the semi-proper orientations of graphs}},
AUTHOR = {Dehghan, Ali and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-03035385},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
YEAR = {2020},
MONTH = Mar,
DOI = {10.1016/j.dam.2020.07.003},
PDF = {https://hal.inria.fr/hal-03035385/file/semi-proper.pdf},
HAL_ID = {hal-03035385},
HAL_VERSION = {v1},

}

@article{ducoffe:hal-02528905,
TITLE = {{On the Complexity of Computing Treebreadth}},
AUTHOR = {Ducoffe, Guillaume and Legay, Sylvain and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-02528905},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {82},
NUMBER = {6},
PAGES = {1574-1600},
YEAR = {2020},
DOI = {10.1007/s00453-019-00657-7},
PDF = {https://hal.inria.fr/hal-02528905/file/DLN-AlgorithmicaRevised_submitted.pdf},
HAL_ID = {hal-02528905},
HAL_VERSION = {v1},

}

@article{gagnon:hal-02004770,
TITLE = {{A method for eternally dominating strong grids}},
AUTHOR = {Gagnon, Aliz{\'e}e and Hassler, Alexander and Huang, Jerry and Krim-Yee, Aaron and Mc Inerney, Fionn and Zacar{\'i}as, Andr{\'e}s Mej{\'i}a and Seamone, Ben and Virgile, Virg{\'e}lot},
URL = {https://hal.archives-ouvertes.fr/hal-02004770},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {vol. 22},
NUMBER = {1},
YEAR = {2020},
MONTH = Mar,
KEYWORDS = {Graphs ; Graph Protection ; Eternal Domination ; Combinatorial Games},
PDF = {https://hal.archives-ouvertes.fr/hal-02004770v3/file/final.pdf},
HAL_ID = {hal-02004770},
HAL_VERSION = {v3},

}

@article{havet:hal-02497401,
TITLE = {{A variant of the Erd{\"o}s-S{\'o}s conjecture}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Reed, Bruce and Stein, Maya and Wood, David R},
URL = {https://hal.inria.fr/hal-02497401},
JOURNAL = {{Journal of Graph Theory}},
PUBLISHER = {{Wiley}},
VOLUME = {94},
NUMBER = {1},
PAGES = {131-158},
YEAR = {2020},
MONTH = May,
DOI = {10.1002/jgt.22511},
PDF = {https://hal.inria.fr/hal-02497401/file/ErdosSosVariant.pdf},
HAL_ID = {hal-02497401},
HAL_VERSION = {v1},

}

@article{mcinerney:hal-02801932,
TITLE = {{Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between}},
AUTHOR = {Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-02801932},
TYPE = {Research Report},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Aix-Marseille Universite}},
YEAR = {2020},
KEYWORDS = {King's graph ; Strong grid ; Cartesian grid ; Grids ; Graphs ; Eternal Domination ; Combinatorial Games},
PDF = {https://hal.inria.fr/hal-02801932/file/eter_dom_grids_journal.pdf},
HAL_ID = {hal-02801932},
HAL_VERSION = {v1},

}

@inproceedings{aboueimehrizi:hal-03007175,
TITLE = {{Election Control Through Social Influence with Unknown Preferences}},
AUTHOR = {Abouei Mehrizi, Mohammad and Cor{\`o}, Federico and Cruciani, Emilio and D’Angelo, Gianlorenzo},
URL = {https://hal.archives-ouvertes.fr/hal-03007175},
BOOKTITLE = {{COCOON 2020 - 26th International Conference on Computing and Combinatorics}},
ADDRESS = {Atlanta / Online, United States},
PAGES = {397-410},
YEAR = {2020},
MONTH = Aug,
DOI = {10.1007/978-3-030-58150-3\_32},
PDF = {https://hal.archives-ouvertes.fr/hal-03007175/file/1905.04694.pdf},
HAL_ID = {hal-03007175},
HAL_VERSION = {v1},

}

@inproceedings{alzoobi:hal-02865918,
TITLE = {{Space and Time Trade-Off for the k Shortest Simple Paths Problem}},
AUTHOR = {Al Zoobi , Ali and Coudert, David and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-02865918},
BOOKTITLE = {{SEA 2020 - 18th International Symposium on Experimental Algorithms}},
ADDRESS = {Catania, Italy},
PUBLISHER = {{Schloss Dagstuhl--Leibniz-Zentrum f{\''u}r Informatik}},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {160},
NUMBER = {18},
PAGES = {13},
YEAR = {2020},
MONTH = Jun,
DOI = {10.4230/LIPIcs.SEA.2020.18},
KEYWORDS = {k shortest simple paths ; graph algorithm ; space-time trade-off},
PDF = {https://hal.inria.fr/hal-02865918/file/LIPIcs-SEA-2020-18.pdf},
HAL_ID = {hal-02865918},
HAL_VERSION = {v1},

}

@inproceedings{alzoobi:hal-02835953,
TITLE = {{Compromis espace-temps pour le probl{\`e}me de k plus courts chemins simples}},
AUTHOR = {Al Zoobi, Ali and Coudert, David and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-02835953},
BOOKTITLE = {{ALGOTEL 2020 -- 22{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Lyon, France},
PAGES = {4},
YEAR = {2020},
MONTH = Sep,
KEYWORDS = {k plus courts chemins simples ; algorithmes de graphes ; compromis complexit{\'e} espace-temps},
PDF = {https://hal.inria.fr/hal-02835953/file/algotel-FinalVersion.pdf},
HAL_ID = {hal-02835953},
HAL_VERSION = {v1},

}

@inproceedings{anagnostopoulos:hal-03007205,
TITLE = {{Biased Opinion Dynamics: When the Devil is in the Details}},
AUTHOR = {Anagnostopoulos, Aris and Becchetti, Luca and Cruciani, Emilio and Pasquale, Francesco and Rizzo, Sara},
URL = {https://hal.archives-ouvertes.fr/hal-03007205},
BOOKTITLE = {{IJCAI 2020 - 29th International Joint Conference on Artificial Intelligence}},
ADDRESS = {Yokohama, Japan},
PUBLISHER = {{International Joint Conferences on Artificial Intelligence Organization}},
PAGES = {53-59},
YEAR = {2020},
MONTH = Jul,
DOI = {10.24963/ijcai.2020/8},
PDF = {https://hal.archives-ouvertes.fr/hal-03007205/file/2008.13589.pdf},
HAL_ID = {hal-03007205},
HAL_VERSION = {v1},

}

@inproceedings{arroyo:hal-02471760,
TITLE = {{Extending Drawings of Graphs to Arrangements of Pseudolines}},
AUTHOR = {Arroyo, Alan and Bensmail, Julien and Richter, R. Bruce},
URL = {https://hal.archives-ouvertes.fr/hal-02471760},
BOOKTITLE = {{SoCG 2020 - 36th International Symposium on Computational Geometry}},
ADDRESS = {Z{\"u}rich, Switzerland},
YEAR = {2020},
MONTH = Jun,
KEYWORDS = {graph drawings ; geometric graph drawings ; arrangements of pseudolines ; crossing numbers ; stretchability ; graphs},
PDF = {https://hal.archives-ouvertes.fr/hal-02471760/file/main.pdf},
HAL_ID = {hal-02471760},
HAL_VERSION = {v1},

}

@inproceedings{bangjensen:hal-03035419,
TITLE = {{Inversion number of an oriented graph and related parameters}},
AUTHOR = {Bang-Jensen, J{{\o}}rgen and Ferreira Da Silva, Jonas Costa and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-03035419},
BOOKTITLE = {{ALGOS 2020 - 1st International Conference on Algebras, Graphs and Ordered Sets}},
ADDRESS = {Nancy / Virtual, France},
YEAR = {2020},
MONTH = Aug,
KEYWORDS = {Feedback vertex set ; Feedback arc set ; Inversion ; Tournament ; Oriented graph ; Intercyclic digraph},
PDF = {https://hal.inria.fr/hal-03035419/file/inversion-ALGOS.pdf},
HAL_ID = {hal-03035419},
HAL_VERSION = {v1},

}

@inproceedings{becchetti:hal-02002377,
TITLE = {{Finding a Bounded-Degree Expander Inside a Dense One}},
AUTHOR = {Becchetti, Luca and Clementi, Andrea and Natale, Emanuele and Pasquale, Francesco and Trevisan, Luca},
URL = {https://hal.archives-ouvertes.fr/hal-02002377},
BOOKTITLE = {{SODA 2020 - ACM SIAM Symposium on Discrete Algorithms}},
ADDRESS = {Salt Lake City, United States},
SERIES = {Proceedings of the thirty-first Annual ACM-SIAM Symposium on Discrete Algorithms},
YEAR = {2020},
MONTH = Jan,
DOI = {10.1137/1.9781611975994.80},
PDF = {https://hal.archives-ouvertes.fr/hal-02002377v2/file/Finding_a_Bounded_Degree_Expander_Inside_a_Dense_One.pdf},
HAL_ID = {hal-02002377},
HAL_VERSION = {v2},

}

@inproceedings{bensmail:hal-02510044,
TITLE = {{On Proper Labellings of Graphs with Minimum Label Sum}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-02510044},
BOOKTITLE = {{IWOCA 2020 - 31st International Workshop on Combinatorial Algorithms}},
ADDRESS = {Bordeaux, France},
YEAR = {2020},
MONTH = Jun,
PDF = {https://hal.archives-ouvertes.fr/hal-02510044/file/Springer_Lecture_Notes_in_Computer_Science%281%29.pdf},
HAL_ID = {hal-02510044},
HAL_VERSION = {v1},

}

@inproceedings{busnel:hal-02796530,
TITLE = {{VESPA, ou l'art de coordonner une flotte de drone sans leader}},
AUTHOR = {Busnel, Yann and Caillouet, Christelle and Coudert, David},
URL = {https://hal.inria.fr/hal-02796530},
BOOKTITLE = {{ALGOTEL 2020 -- 22{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Lyon, France},
PAGES = {1-4},
YEAR = {2020},
MONTH = Sep,
KEYWORDS = {Drone ; Auto-organisation ; D{\'e}ploiement d{\'e}centralis{\'e} ; Gestion de crise ; Connectivit{\'e} r{\'e}seau},
PDF = {https://hal.inria.fr/hal-02796530/file/vespa-algotel20.pdf},
HAL_ID = {hal-02796530},
HAL_VERSION = {v1},

}

@inproceedings{caillouet:hal-02780468,
TITLE = {{Bringing Fairness in LoRaWAN through SF Allocation Optimization}},
AUTHOR = {Caillouet, Christelle and Heusse, Martin and Rousseau, Franck},
URL = {https://hal.inria.fr/hal-02780468},
BOOKTITLE = {{ISCC 2020 - 25th IEEE Symposium on Computers and Communications}},
ADDRESS = {Rennes, France},
YEAR = {2020},
MONTH = Jul,
DOI = {10.1109/ISCC50000.2020.9219611},
PDF = {https://hal.inria.fr/hal-02780468/file/lp_oldmodel.pdf},
HAL_ID = {hal-02780468},
HAL_VERSION = {v1},

}

@inproceedings{caillouet:hal-02877138,
TITLE = {{Optimisation de la capacit{\'e} des r{\'e}seaux LoRa}},
AUTHOR = {Caillouet, Christelle and Heusse, Martin and Rousseau, Franck},
URL = {https://hal.inria.fr/hal-02877138},
BOOKTITLE = {{CORES 2020 -- 5{\`e}me Rencontres Francophones sur la Conception de Protocoles, l’{\'E}valuation de Performance et l’Exp{\'e}rimentation des R{\'e}seaux de Communication}},
ADDRESS = {Lyon, France},
YEAR = {2020},
MONTH = Sep,
PDF = {https://hal.inria.fr/hal-02877138/file/cores2020.pdf},
HAL_ID = {hal-02877138},
HAL_VERSION = {v1},

}

@inproceedings{clementi:hal-01958994,
TITLE = {{Consensus vs Broadcast, with and without Noise}},
AUTHOR = {Clementi, Andrea and Gual{\`a}, Luciano and Natale, Emanuele and Pasquale, Francesco and Scornavacca, Giacomo and Trevisan, Luca},
URL = {https://hal.inria.fr/hal-01958994},
BOOKTITLE = {{ITCS 2020 - 11th Annual Innovations in Theoretical Computer Science}},
ADDRESS = {Seattle, United States},
SERIES = {11th Innovations in Theoretical Computer Science Conference},
PAGES = {42 - 43},
YEAR = {2020},
MONTH = Jan,
DOI = {10.4230/LIPIcs.ITCS.2020.42},
KEYWORDS = {Noisy Com- 46 munication Channels 47 ; Gossip Models ; Broadcast ; Distributed computing ; and phrases Distributed Computing ; Consensus},
PDF = {https://hal.inria.fr/hal-01958994v2/file/ITCS20__Final_Version_.pdf},
HAL_ID = {hal-01958994},
HAL_VERSION = {v2},

}

@inproceedings{clementi:hal-02648649,
TITLE = {{Parallel Load Balancing on Constrained Client-Server Topologies}},
AUTHOR = {Clementi, Andrea and Natale, Emanuele and Ziccardi, Isabella},
URL = {https://hal.archives-ouvertes.fr/hal-02648649},
BOOKTITLE = {{SPAA 2020 - 32nd ACM Symposium on Parallelism in Algorithms and Architectures Proceedings}},
ADDRESS = {Philadelphia, United States},
YEAR = {2020},
MONTH = Jul,
HAL_ID = {hal-02648649},
HAL_VERSION = {v1},

}

@inproceedings{coro:hal-03007190,
TITLE = {{JTeC: A Large Collection of Java Test Classes for Test Code Analysis and Processing}},
AUTHOR = {Cor{\`o}, Federico and Verdecchia, Roberto and Cruciani, Emilio and Miranda, Breno and Bertolino, Antonia},
URL = {https://hal.archives-ouvertes.fr/hal-03007190},
BOOKTITLE = {{MSR 2020 - 17th International Conference on Mining Software Repositories}},
ADDRESS = {Seoul / Virtual, South Korea},
PUBLISHER = {{ACM}},
PAGES = {578-582},
YEAR = {2020},
MONTH = Jun,
DOI = {10.1145/3379597.3387484},
PDF = {https://hal.archives-ouvertes.fr/hal-03007190/file/main.pdf},
HAL_ID = {hal-03007190},
HAL_VERSION = {v1},

}

@inproceedings{cruciani:hal-03007234,
TITLE = {{Brief Announcement: Phase Transitions of the $k$-Majority Dynamics in a Biased Communication Model}},
AUTHOR = {Cruciani, Emilio and Mimun, Hlafo Alfie and Quattropani, Matteo and Rizzo, Sara},
URL = {https://hal.archives-ouvertes.fr/hal-03007234},
BOOKTITLE = {{DISC 2020 - 34th International Symposium on Distributed Computing}},
ADDRESS = {Freibourg / Virtual, Germany},
YEAR = {2020},
MONTH = Oct,
PDF = {https://hal.archives-ouvertes.fr/hal-03007234/file/main.pdf},
HAL_ID = {hal-03007234},
HAL_VERSION = {v1},

}

@inproceedings{damore:hal-02487650,
TITLE = {{Phase Transition of a Non-Linear Opinion Dynamics with Noisy Interactions}},
AUTHOR = {d'Amore, Francesco and Clementi, Andrea and Natale, Emanuele},
URL = {https://hal.archives-ouvertes.fr/hal-02487650},
TYPE = {Research Report},
BOOKTITLE = {{SIROCCO 2020 - 27th International Colloquium on Structural Information and Communication Complexity}},
ADDRESS = {Paderborn, Germany},
SERIES = {SIROCCO 2020. Lecture Notes in Computer Science, vol 12156. Springer},
VOLUME = {12156},
PAGES = {255--272},
INSTITUTION = {{INRIA Sophia Antipolis - I3S ; Universit{\`a} di Roma ''Tor Vergata''}},
YEAR = {2020},
MONTH = Jun,
DOI = {10.1007/978-3-030-54921-3\_15},
PDF = {https://hal.archives-ouvertes.fr/hal-02487650v2/file/main.pdf},
HAL_ID = {hal-02487650},
HAL_VERSION = {v2},

}

@inproceedings{diasdasilva:hal-02779495,
TITLE = {{Optimizing the trajectory of drones: trade-off between distance and energy}},
AUTHOR = {Dias Da Silva, Igor and Caillouet, Christelle},
URL = {https://hal.inria.fr/hal-02779495},
BOOKTITLE = {{IAUV 2020 - 2nd International Workshop on Internet of Autonomous Unmanned Vehicles}},
ADDRESS = {Cuomo, Italy},
YEAR = {2020},
MONTH = Jun,
DOI = {10.1109/SECONWorkshops50264.2020.9149781},
PDF = {https://hal.inria.fr/hal-02779495/file/UAV_tradeoff_6pages.pdf},
HAL_ID = {hal-02779495},
HAL_VERSION = {v1},

}

@inproceedings{ducoffe:hal-02872772,
TITLE = {{Revisiter l'Attachement Pr{\'e}f{\'e}rentiel, et ses applications aux R{\'e}seaux Sociaux}},
AUTHOR = {Ducoffe, Guillaume and Giroire, Fr{\'e}d{\'e}ric and P{\'e}rennes, St{\'e}phane and Trolliet, Thibaud},
URL = {https://hal.archives-ouvertes.fr/hal-02872772},
BOOKTITLE = {{ALGOTEL 2020 -- 22{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Lyon, France},
YEAR = {2020},
MONTH = Sep,
KEYWORDS = {Twitter ; R{\'e}seaux sociaux ; Graphes al{\'e}atoires ; Syst{\`e}mes complexes ; Attachement pr{\'e}f{\'e}rentiel ; Distribution des degr{\'e}s ; Chaines de Markov},
PDF = {https://hal.archives-ouvertes.fr/hal-02872772/file/Revisiter_l_Attachement_Preferentiel.pdf},
HAL_ID = {hal-02872772},
HAL_VERSION = {v1},

}

@inproceedings{gausseran:hal-02945405,
TITLE = {{Be Scalable and Rescue My Slices During Reconfiguration}},
AUTHOR = {Gausseran, Adrien and Giroire, Fr{\'e}d{\'e}ric and Jaumard, B. and Moulierac, Joanna},
URL = {https://hal.archives-ouvertes.fr/hal-02945405},
BOOKTITLE = {{ICC 2020 - 2020 IEEE International Conference on Communications}},
ADDRESS = {Dublin, Ireland},
PUBLISHER = {{IEEE}},
PAGES = {1-6},
YEAR = {2020},
MONTH = Jun,
DOI = {10.1109/ICC40277.2020.9148871},
PDF = {https://hal.archives-ouvertes.fr/hal-02945405/file/gausseran20scalable.pdf},
HAL_ID = {hal-02945405},
HAL_VERSION = {v1},

}

@inproceedings{giroire:hal-03052144,
TITLE = {{A Random Growth Model with any Real or Theoretical Degree Distribution}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and P{\'e}rennes, St{\'e}phane and Trolliet, Thibaud},
URL = {https://hal.inria.fr/hal-03052144},
BOOKTITLE = {{COMPLEX NETWORKS 2020 - The 9th International Conference on Complex Networks and their Applications}},
ADDRESS = {Madrid / Virtual, Spain},
YEAR = {2020},
MONTH = Dec,
KEYWORDS = {Complex Networks ; Random Growth Model ; Preferential Attachment ; Degree Distribution ; Twitter},
PDF = {https://hal.inria.fr/hal-03052144/file/Model_any_DD_ComplexNetwork2020.pdf},
HAL_ID = {hal-03052144},
HAL_VERSION = {v1},

}

@inproceedings{gou:hal-02973315,
TITLE = {{Improving mapping for sparse direct solvers: A trade-off between data locality and load balancing}},
AUTHOR = {Gou, Changjiang and Al Zoobi, Ali and Benoit, Anne and Faverge, Mathieu and Marchal, Loris and Pichon, Gr{\'e}goire and Ramet, Pierre},
URL = {https://hal.inria.fr/hal-02973315},
BOOKTITLE = {{EuroPar 2020 - 26th International European Conference on Parallel and Distributed Computing}},
ADDRESS = {Warsaw / Virtual, Poland},
PAGES = {1-16},
YEAR = {2020},
MONTH = Aug,
KEYWORDS = {Load balancing ; Data locality ; Sparse direct solvers ; Processor mapping ; Localit{\'e} des donn{\'e}es ; Equilibrage de charge ; Placement ; Solveurs directs creux},
PDF = {https://hal.inria.fr/hal-02973315/file/paper.pdf},
HAL_ID = {hal-02973315},
HAL_VERSION = {v1},

}

@inproceedings{havet:hal-02796730,
TITLE = {{Overlaying a hypergraph with a graph with bounded maximum degree}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Mazauric, Dorian and Nguyen, Viet-Ha and Watrigant, R{\'e}mi},
URL = {https://hal.archives-ouvertes.fr/hal-02796730},
BOOKTITLE = {{ALGOTEL 2020 -- 22{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Lyon, France},
YEAR = {2020},
MONTH = Sep,
KEYWORDS = {biologie structurale computationnelle ; hypergraphes ; graphes ; algorithmes ; complexit{\'e}},
PDF = {https://hal.archives-ouvertes.fr/hal-02796730/file/final-algotel-2020.pdf},
HAL_ID = {hal-02796730},
HAL_VERSION = {v1},

}

@inproceedings{havet:hal-03035849,
TITLE = {{Overlaying a hypergraph with a graph with bounded maximum degree}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Mazauric, Dorian and Nguyen, Viet-Ha and Watrigant, R{\'e}mi},
URL = {https://hal.inria.fr/hal-03035849},
BOOKTITLE = {{CALDAM 2020 - 6th Annual International Conference on Algorithms and Discrete Applied Mathematics}},
ADDRESS = {Hyderabad, India},
YEAR = {2020},
MONTH = Feb,
PDF = {https://hal.inria.fr/hal-03035849/file/CALDAM-12pages.pdf},
HAL_ID = {hal-03035849},
HAL_VERSION = {v1},

}

@inproceedings{morin:hal-02874121,
TITLE = {{Optimisation du co{\^u}t de d{\'e}ploiement de services r{\'e}seau virtualis{\'e}s dans le cloud}},
AUTHOR = {Morin, Cedric and Texier, G{\'e}raldine and Caillouet, Christelle and Desmangles, Gilles and Phan, Cao-Thanh},
URL = {https://hal.archives-ouvertes.fr/hal-02874121},
BOOKTITLE = {{CORES 2020 -- 5{\`e}me Rencontres Francophones sur la Conception de Protocoles, l’{\'E}valuation de Performance et l’Exp{\'e}rimentation des R{\'e}seaux de Communication}},
ADDRESS = {Lyon, France},
YEAR = {2020},
MONTH = Sep,
KEYWORDS = {NFV ; MANO ; offres cloud ; programme lin{\'e}aire},
PDF = {https://hal.archives-ouvertes.fr/hal-02874121/file/postprint.pdf},
HAL_ID = {hal-02874121},
HAL_VERSION = {v1},

}

@inproceedings{trolliet:hal-02872779,
TITLE = {{Coefficient de Clustering d'int{\'e}r{\^e}t : une nouvelle m{\'e}trique pour les graphes dirig{\'e}s comme Twitter}},
AUTHOR = {Trolliet, Thibaud and Cohen, Nathann and Giroire, Fr{\'e}d{\'e}ric and Hogie, Luc and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.archives-ouvertes.fr/hal-02872779},
BOOKTITLE = {{ALGOTEL 2020 -- 22{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Lyon, France},
YEAR = {2020},
MONTH = Sep,
KEYWORDS = {Syst{\`e}mes Complexes ; Coefficient de Clustering ; Graphes Dirig{\'e}s ; R{\'e}seaux Sociaux ; Twitter},
PDF = {https://hal.archives-ouvertes.fr/hal-02872779/file/Coefficient_de_Clustering_d_Interet.pdf},
HAL_ID = {hal-02872779},
HAL_VERSION = {v1},

}

@inproceedings{trolliet:hal-03052083,
TITLE = {{Interest Clustering Coefficient: a New Metric for Directed Networks like Twitter}},
AUTHOR = {Trolliet, Thibaud and Cohen, Nathann and Giroire, Fr{\'e}d{\'e}ric and Hogie, Luc and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-03052083},
BOOKTITLE = {{COMPLEX NETWORKS 2020 - The 9th International Conference on Complex Networks and their Applications}},
ADDRESS = {Madrid / Virtual, Spain},
YEAR = {2020},
MONTH = Dec,
KEYWORDS = {Complex networks ; Clustering Coefficient ; Directed networks ; Social networks ; Twitter},
PDF = {https://hal.inria.fr/hal-03052083/file/ICC___ComplexNet___Submission_version.pdf},
HAL_ID = {hal-03052083},
HAL_VERSION = {v1},

}

@techreport{alzoobi:hal-02465317,
TITLE = {{Space and time trade-off for the k shortest simple paths problem}},
AUTHOR = {Al Zoobi, Ali and Coudert, David and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-02465317},
TYPE = {Research Report},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France}},
YEAR = {2020},
MONTH = Feb,
PDF = {https://hal.archives-ouvertes.fr/hal-02465317/file/HAL_kSSP.pdf},
HAL_ID = {hal-02465317},
HAL_VERSION = {v1},

}

@techreport{araujo:hal-02921466,
TITLE = {{On finding the best and worst orientations for the metric dimension}},
AUTHOR = {Araujo, Julio and Bensmail, Julien and Campos, Victor and Havet, Fr{\'e}d{\'e}ric and Karolinna Maia De Oliveira, Ana and Nisse, Nicolas and Silva, Ana},
URL = {https://hal.archives-ouvertes.fr/hal-02921466},
TYPE = {Research Report},
INSTITUTION = {{Inria}},
YEAR = {2020},
KEYWORDS = {Undirected graphs ; Resolving sets ; Metric dimension ; Digraphs},
PDF = {https://hal.archives-ouvertes.fr/hal-02921466/file/oriented-md.pdf},
HAL_ID = {hal-02921466},
HAL_VERSION = {v1},

}

@techreport{bensmail:hal-02947399,
TITLE = {{On the signed chromatic number of some classes of graphs}},
AUTHOR = {Bensmail, Julien and Das, Sandip and Nandi, Soumen and Pierron, Th{\'e}o and Sen, Sagnik and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-02947399},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te D'Azur ; Universit{\'e} de Bordeaux ; Universit{\'e} Lyon 1}},
YEAR = {2020},
KEYWORDS = {Kn-minor-free graph ; bounded-degree graph ; triangle-free planar graph ; homomorphism of signed graphs ; planar graph ; signed chromatic number},
PDF = {https://hal.archives-ouvertes.fr/hal-02947399/file/main.pdf},
HAL_ID = {hal-02947399},
HAL_VERSION = {v1},

}

@techreport{bensmail:hal-02975031,
TITLE = {{On the Role of 3's for the 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn},
URL = {https://hal.archives-ouvertes.fr/hal-02975031},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} c{\^o}te d'azur ; Aix-Marseille Universite}},
YEAR = {2020},
KEYWORDS = {Proper labellings ; 3-chromatic graphs ; 1-2-3 Conjecture},
PDF = {https://hal.archives-ouvertes.fr/hal-02975031v2/file/role3.pdf},
HAL_ID = {hal-02975031},
HAL_VERSION = {v2},

}

@techreport{bensmail:hal-02195028,
TITLE = {{On BMRN*-colouring of planar digraphs}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos},
URL = {https://hal.archives-ouvertes.fr/hal-02195028},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur, CNRS, I3S, France}},
YEAR = {2020},
KEYWORDS = {BMRN*-colouring ; planar digraphs ; TDMA scheduling},
PDF = {https://hal.archives-ouvertes.fr/hal-02195028v5/file/bmrn-planar.pdf},
HAL_ID = {hal-02195028},
HAL_VERSION = {v5},

}

@techreport{bensmail:hal-02533537,
TITLE = {{Further Results on an Equitable 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-02533537},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur, CNRS, I3S, France ; Inria Sophia Antipolis ; Aix-Marseille Universit{\'e} (AMU)}},
YEAR = {2020},
MONTH = Apr,
KEYWORDS = {Proper labellings ; Equitable labellings ; 1-2-3 Conjecture},
PDF = {https://hal.archives-ouvertes.fr/hal-02533537/file/equitable123.pdf},
HAL_ID = {hal-02533537},
HAL_VERSION = {v1},

}

@techreport{bensmail:hal-02450521,
TITLE = {{On Proper Labellings of Graphs with Minimum Label Sum}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-02450521},
TYPE = {Research Report},
INSTITUTION = {{Inria - Sophia antipolis}},
YEAR = {2020},
PDF = {https://hal.archives-ouvertes.fr/hal-02450521v2/file/Minimize_Sum_of_Edge_Labels%281%29.pdf},
HAL_ID = {hal-02450521},
HAL_VERSION = {v2},

}

@techreport{bensmail:hal-02546401,
TITLE = {{Further Evidence Towards the Multiplicative 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Hocquard, Herv{\'e} and Lajou, Dimitri and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-02546401},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} c{\^o}te d'azur ; Universit{\'e} de bordeaux}},
YEAR = {2020},
MONTH = Apr,
KEYWORDS = {1-2-3 Conjecture ; multiset version ; product version ; 4-chromatic graphs},
PDF = {https://hal.archives-ouvertes.fr/hal-02546401/file/product123.pdf},
HAL_ID = {hal-02546401},
HAL_VERSION = {v1},

}

@techreport{bensmail:hal-02554102,
TITLE = {{On a graph labelling conjecture involving coloured labels}},
AUTHOR = {Bensmail, Julien},
URL = {https://hal.archives-ouvertes.fr/hal-02554102},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} c{\^o}te d'azur}},
YEAR = {2020},
MONTH = Apr,
KEYWORDS = {Proper labellings ; Coloured labels ; Weak (2 ; 2)-Conjecture ; 1-2-3 Conjecture},
PDF = {https://hal.archives-ouvertes.fr/hal-02554102/file/22weak.pdf},
HAL_ID = {hal-02554102},
HAL_VERSION = {v1},

}

@techreport{carvalho:hal-03031759,
TITLE = {{On the characterization of networks with multiple arc-disjoint branching flows}},
AUTHOR = {Carvalho, Cl{\'a}udio and Costa, Jonas and Sales, Cl{\'a}udia Linhares and Lopes, Raul and Maia De Oliveira, Ana Karolinna and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-03031759},
TYPE = {Research Report},
INSTITUTION = {{UFC ; INRIA ; CNRS ; Universit{\'e} C{\^o}te d’Azur ; I3S ; LIRMM ; Universit{\'e} de Montpellier}},
YEAR = {2020},
MONTH = Nov,
PDF = {https://hal.inria.fr/hal-03031759/file/Conjecture_results.pdf},
HAL_ID = {hal-03031759},
HAL_VERSION = {v1},

}

@techreport{clementi:hal-02530253,
TITLE = {{On the Search Efficiency of Parallel L{\'e}vy Walks on ${\mathbb Z}^2$}},
AUTHOR = {Clementi, Andrea and d'Amore, Francesco and Giakkoupis, George and Natale, Emanuele},
URL = {https://hal.archives-ouvertes.fr/hal-02530253},
TYPE = {Research Report},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Universit{\`a} degli Studi di Roma ''Tor Vergata'' ; Univ Rennes, Inria, CNRS, IRISA, France}},
YEAR = {2020},
MONTH = Apr,
PDF = {https://hal.archives-ouvertes.fr/hal-02530253v3/file/levy_walk.pdf},
HAL_ID = {hal-02530253},
HAL_VERSION = {v3},

}

@techreport{dissaux:hal-03010346,
TITLE = {{Treelength of Series-parallel graphs}},
AUTHOR = {Dissaux, Thomas and Ducoffe, Guillaume and Nisse, Nicolas and Nivelle, Simon},
URL = {https://hal.archives-ouvertes.fr/hal-03010346},
TYPE = {Research Report},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France}},
YEAR = {2020},
PDF = {https://hal.archives-ouvertes.fr/hal-03010346/file/Lagos_2021.pdf},
HAL_ID = {hal-03010346},
HAL_VERSION = {v1},

}

@techreport{gou:hal-02491495,
TITLE = {{Improving mapping for sparse direct solvers: A trade-off between data locality and load balancing}},
AUTHOR = {Gou, Changjiang and Al Zoobi, Ali and Benoit, Anne and Faverge, Mathieu and Marchal, Loris and Pichon, Gr{\'e}goire and Ramet, Pierre},
URL = {https://hal.inria.fr/hal-02491495},
TYPE = {Research Report},
NUMBER = {RR-9328},
PAGES = {21},
INSTITUTION = {{Inria Rh{\^o}ne-Alpes}},
YEAR = {2020},
MONTH = Feb,
KEYWORDS = {Load balancing ; Data locality ; Sparse direct solvers ; Processor mapping ; Localit{\'e} des donn{\'e}es ; Equilibrage de charge ; Placement ; Solveurs directs creux},
PDF = {https://hal.inria.fr/hal-02491495/file/rr9328.pdf},
HAL_ID = {hal-02491495},
HAL_VERSION = {v1},

}

@unpublished{frigo:hal-03033777,
TITLE = {{Network alignment and similarity reveal atlas-based topological differences in structural connectomes}},
AUTHOR = {Frigo, Matteo and Cruciani, Emilio and Coudert, David and Deriche, Rachid and Natale, Emanuele and Deslauriers-Gauthier, Samuel},
URL = {https://hal.archives-ouvertes.fr/hal-03033777},
NOTE = {working paper or preprint},
YEAR = {2020},
MONTH = Dec,
PDF = {https://hal.archives-ouvertes.fr/hal-03033777/file/manuscript.pdf},
HAL_ID = {hal-03033777},
HAL_VERSION = {v1},

}

@unpublished{lena:hal-03001913,
TITLE = {{A Right Placement Makes a Happy Emulator: a Placement Module for Distributed SDN/NFV Emulation}},
AUTHOR = {Lena, Giuseppe Di and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Saucez, Damien and Turletti, Thierry and Lac, Chidung},
URL = {https://hal.inria.fr/hal-03001913},
NOTE = {working paper or preprint},
YEAR = {2020},
MONTH = Nov,
PDF = {https://hal.inria.fr/hal-03001913/file/HappyEmulator.pdf},
HAL_ID = {hal-03001913},
HAL_VERSION = {v1},

}

@phdthesis{mcinerney:tel-02184625,
TITLE = {{Domination and identification games in graphs}},
AUTHOR = {Mc Inerney, Fionn},
URL = {https://tel.archives-ouvertes.fr/tel-02184625},
NUMBER = {2019AZUR4049},
SCHOOL = {{Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2019},
MONTH = Jul,
KEYWORDS = {Algorithm ; Graph theory ; Combinatorial games ; Cops and robber games ; Algorithmes ; Jeux combinatoires ; Jeux des gendarmes et voleur ; Th{\'e}orie des graphes},
TYPE = {Theses},
PDF = {https://tel.archives-ouvertes.fr/tel-02184625v2/file/2019AZUR4049.pdf},
HAL_ID = {tel-02184625},
HAL_VERSION = {v2},

}

@phdthesis{tomassilli:tel-02373758,
TITLE = {{Towards next generation networks with SDN and NFV}},
AUTHOR = {Tomassilli, Andrea},
URL = {https://tel.archives-ouvertes.fr/tel-02373758},
NUMBER = {2019AZUR4044},
SCHOOL = {{Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2019},
MONTH = Jun,
KEYWORDS = {Service Function Chaining (SFC) ; Approximations algorithms ; Network optimization ; Network Function Virtualization (NFV) ; Software Defined Networks (SDN) ; Virtualisation des fonctions r{\'e}seau NFV ; R{\'e}seaux logiciels SDN ; Algorithmes d'approximations ; Optimisation r{\'e}seaux de communication ; Cha{\"i}nes de fonctions de service},
TYPE = {Theses},
PDF = {https://tel.archives-ouvertes.fr/tel-02373758v2/file/2019AZUR4044.pdf},
HAL_ID = {tel-02373758},
HAL_VERSION = {v2},

}

@incollection{nisse:hal-02098917,
TITLE = {{Network Decontamination}},
AUTHOR = {Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-02098917},
BOOKTITLE = {{Distributed Computing by Mobile Entities}},
PUBLISHER = {{Springer}},
SERIES = {LNCS},
VOLUME = {11340},
PAGES = {516-548},
YEAR = {2019},
KEYWORDS = {Computational Complexity ; (Distributed) Graph Algorithms ; Graph Searching ; Path-and Tree-Decompositions},
PDF = {https://hal.archives-ouvertes.fr/hal-02098917/file/NetworkDecontamination.pdf},
HAL_ID = {hal-02098917},
HAL_VERSION = {v1},

}

@article{aboulker:hal-02275082,
TITLE = {{Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number}},
AUTHOR = {Aboulker, Pierre and Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric and Lochet, William and Moura, Phablo F S and Thomass{\'e}, St{\'e}phan},
URL = {https://hal.archives-ouvertes.fr/hal-02275082},
JOURNAL = {{The Electronic Journal of Combinatorics}},
PUBLISHER = {{Open Journal Systems}},
VOLUME = {26},
PAGES = {P3.19},
YEAR = {2019},
MONTH = Jul,
PDF = {https://hal.archives-ouvertes.fr/hal-02275082/file/in-arborescences.pdf},
HAL_ID = {hal-02275082},
HAL_VERSION = {v1},

}

@article{aguirreguerrero:hal-01973608,
TITLE = {{Low Time Complexity Algorithms for Path Computation in Cayley Graphs}},
AUTHOR = {Aguirre-Guerrero, Daniela and Ducoffe, Guillaume and Fabrega, Lluis and Vila, Pere and Coudert, David},
URL = {https://hal.inria.fr/hal-01973608},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {259},
PAGES = {218-225},
YEAR = {2019},
MONTH = Apr,
DOI = {10.1016/j.dam.2018.12.005},
KEYWORDS = {interconnection networks ; Cayley graphs ; path computation ; K-shortest paths},
PDF = {https://hal.inria.fr/hal-01973608/file/cga_final.pdf},
HAL_ID = {hal-01973608},
HAL_VERSION = {v1},

}

@article{andres:hal-02017462,
TITLE = {{The Orthogonal Colouring Game}},
AUTHOR = {Andres, Stephan Dominique and Huggan, Melissa and Mc Inerney, Fionn and Nowakowski, Richard J},
URL = {https://hal.inria.fr/hal-02017462},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {795},
PAGES = {312-325},
YEAR = {2019},
MONTH = Feb,
KEYWORDS = {Orthogonal Colouring Game ; strictly matched involution ; games on graphs ; scoring game ; orthogonal graph colouring ; mutually orthogonal Latin squares},
PDF = {https://hal.inria.fr/hal-02017462v4/file/Corrected_TCS_orthogonalGraphColoringGame.pdf},
HAL_ID = {hal-02017462},
HAL_VERSION = {v4},

}

@article{angelopoulos:lirmm-02342745,
TITLE = {{Preface to special issue on Theory and Applications of Graph Searching}},
AUTHOR = {Angelopoulos, Spyros and Nisse, Nicolas and Thilikos, Dimitrios M.},
URL = {https://hal-lirmm.ccsd.cnrs.fr/lirmm-02342745},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {794},
PAGES = {1-2},
YEAR = {2019},
MONTH = Nov,
DOI = {10.1016/j.tcs.2019.09.043},
PDF = {https://hal-lirmm.ccsd.cnrs.fr/lirmm-02342745/file/tcs-2017-preface.pdf},
HAL_ID = {lirmm-02342745},
HAL_VERSION = {v1},

}

@article{bangjensen:hal-02350210,
TITLE = {{Bipartite spanning sub(di)graphs induced by 2-partitions}},
AUTHOR = {Bang-Jensen, J{{\o}}rgen and Bessy, St{\'e}phane and Havet, Fr{\'e}d{\'e}ric and Yeo, Anders},
URL = {https://hal.inria.fr/hal-02350210},
JOURNAL = {{Journal of Graph Theory}},
PUBLISHER = {{Wiley}},
VOLUME = {92},
NUMBER = {2},
PAGES = {130-151},
YEAR = {2019},
MONTH = Oct,
DOI = {10.1002/jgt.22444},
KEYWORDS = {Eulerian ; Spanning bipartite subdigraph ; Strong spanning subdigraph ; 2-partition ; Minimum out-degree},
PDF = {https://hal.inria.fr/hal-02350210/file/Bipartite-revise.pdf},
HAL_ID = {hal-02350210},
HAL_VERSION = {v1},

}

@article{baudon:hal-01690222,
TITLE = {{A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions}},
AUTHOR = {Baudon, Olivier and Bensmail, Julien and Davot, Tom and Hocquard, Herv{\'e} and Przybylo, Jakub and Senhaji, Mohammed and Sopena, Eric and Wo{\'z}niak, Mariusz},
URL = {https://hal.archives-ouvertes.fr/hal-01690222},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
SERIES = {ICGT 2018},
VOLUME = {21},
NUMBER = {1},
YEAR = {2019},
MONTH = Apr,
KEYWORDS = {Coloured weighted degrees ; 1-2-3 Conjecture ; Locally irregular decompositions},
PDF = {https://hal.archives-ouvertes.fr/hal-01690222v4/file/multisums-dmtcs.pdf},
HAL_ID = {hal-01690222},
HAL_VERSION = {v4},

}

@article{baudon:hal-01839537,
TITLE = {{Edge Weights and Vertex Colours: Minimizing Sum Count}},
AUTHOR = {Baudon, Olivier and Bensmail, Julien and Hocquard, Herv{\'e} and Senhaji, Mohammed and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-01839537},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {270},
PAGES = {13-24},
YEAR = {2019},
MONTH = Nov,
PDF = {https://hal.archives-ouvertes.fr/hal-01839537v2/file/123sums-07062019.pdf},
HAL_ID = {hal-01839537},
HAL_VERSION = {v2},

}

@article{becchetti:hal-02948569,
TITLE = {{Self-stabilizing repeated balls-into-bins}},
AUTHOR = {Becchetti, L. and Clementi, A. and Natale, Emanuele and Pasquale, F. and Posta, G.},
URL = {https://hal.archives-ouvertes.fr/hal-02948569},
JOURNAL = {{Distributed Computing}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {32},
NUMBER = {1},
PAGES = {59-68},
YEAR = {2019},
MONTH = Feb,
DOI = {10.1007/s00446-017-0320-4},
HAL_ID = {hal-02948569},
HAL_VERSION = {v1},

}

@article{bensmail:hal-02264958,
TITLE = {{On the 2-edge-coloured chromatic number of grids}},
AUTHOR = {Bensmail, Julien},
URL = {https://hal.archives-ouvertes.fr/hal-02264958},
JOURNAL = {{The Australasian Journal of Combinatorics}},
PUBLISHER = {{Combinatorial Mathematics Society of Australasia (Inc.)}},
VOLUME = {75},
NUMBER = {3},
PAGES = {365-384},
YEAR = {2019},
KEYWORDS = {grids ; oriented chromatic number ; 2-edge-coloured chromatic number},
PDF = {https://hal.archives-ouvertes.fr/hal-02264958v2/file/grids.pdf},
HAL_ID = {hal-02264958},
HAL_VERSION = {v2},

}

@article{bensmail:hal-01851600,
TITLE = {{Backbone colouring and algorithms for TDMA scheduling}},
AUTHOR = {Bensmail, Julien and Blanc, Thibaut and Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric and Rocha, Leonardo},
URL = {https://hal.archives-ouvertes.fr/hal-01851600},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {Vol. 21 no. 3 },
NUMBER = {3},
PAGES = {\#24},
YEAR = {2019},
MONTH = Jul,
KEYWORDS = {Wireless networks ; TDMA scheduling ; Backbone colouring ; Algorithmic complexity},
PDF = {https://hal.archives-ouvertes.fr/hal-01851600v4/file/bmrn-dmtcs.pdf},
HAL_ID = {hal-01851600},
HAL_VERSION = {v4},

}

@article{bensmail:hal-01744515,
TITLE = {{Edge-partitioning a graph into paths: beyond the Bar{\'a}t-Thomassen conjecture}},
AUTHOR = {Bensmail, Julien and Harutyunyan, Ararat and Le, Tien-Nam and Thomass{\'e}, St{\'e}phan},
URL = {https://hal.archives-ouvertes.fr/hal-01744515},
JOURNAL = {{Combinatorica}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {39},
NUMBER = {2},
PAGES = {239-263},
YEAR = {2019},
MONTH = Apr,
DOI = {10.1007/s00493-017-3661-5},
PDF = {https://hal.archives-ouvertes.fr/hal-01744515/file/bt-paths5.pdf},
HAL_ID = {hal-01744515},
HAL_VERSION = {v1},

}

@article{bensmail:hal-01988399,
TITLE = {{On {a,b}-edge-weightings of bipartite graphs with odd a,b}},
AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn and Lyngsie, Kasper},
URL = {https://hal.archives-ouvertes.fr/hal-01988399},
JOURNAL = {{Discussiones Mathematicae Graph Theory}},
PUBLISHER = {{University of Zielona G{\'o}ra}},
YEAR = {2019},
PDF = {https://hal.archives-ouvertes.fr/hal-01988399v2/file/odd-odd-bip.pdf},
HAL_ID = {hal-01988399},
HAL_VERSION = {v2},

}

@article{bensmail:hal-02288797,
TITLE = {{Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Przybyƚo, Jakub},
URL = {https://hal.archives-ouvertes.fr/hal-02288797},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
YEAR = {2019},
MONTH = Sep,
DOI = {10.1016/j.dam.2019.04.011},
KEYWORDS = {graph decomposition ; 1-2-3 Conjecture ; locally irregular graph},
PDF = {https://hal.archives-ouvertes.fr/hal-02288797/file/regular_decomposition_123_DAM_REVISED.pdf},
HAL_ID = {hal-02288797},
HAL_VERSION = {v1},

}

@article{bensmail:hal-01509365,
TITLE = {{A 1-2-3-4 result for the 1-2-3 Conjecture in 5-regular graphs}},
AUTHOR = {Bensmail, Julien},
URL = {https://hal.archives-ouvertes.fr/hal-01509365},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {257},
PAGES = {31-39},
YEAR = {2019},
MONTH = Feb,
DOI = {10.1016/j.dam.2018.10.008},
KEYWORDS = {1-2-3 Conjecture ; Four weights ; 5-regular graphs},
PDF = {https://hal.archives-ouvertes.fr/hal-01509365v2/file/123reg.pdf},
HAL_ID = {hal-01509365},
HAL_VERSION = {v2},

}

@article{bermond:hal-02264327,
TITLE = {{How long does it take for all users in a social network to choose their communities?}},
AUTHOR = {Bermond, Jean-Claude and Chaintreau, Augustin and Ducoffe, Guillaume and Mazauric, Dorian},
URL = {https://hal.inria.fr/hal-02264327},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {270},
PAGES = {37-57},
YEAR = {2019},
DOI = {10.1016/j.dam.2019.07.023},
KEYWORDS = {graphs ; communities ; social networks ; algorithms ; integer partitions ; coloring games},
PDF = {https://hal.inria.fr/hal-02264327/file/no-format-01-08-19.pdf},
HAL_ID = {hal-02264327},
HAL_VERSION = {v1},

}

@article{bermond:hal-01962617,
TITLE = {{On spectrum assignment in elastic optical tree-networks}},
AUTHOR = {Bermond, Jean-Claude and Moataz, Fatima Zahra},
URL = {https://hal.inria.fr/hal-01962617},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {257},
PAGES = {40-52},
YEAR = {2019},
DOI = {10.1016/j.dam.2018.09.021},
KEYWORDS = {Elastic optical networks ; spectrum assignment ; interval coloring ; chordal graphs},
PDF = {https://hal.inria.fr/hal-01962617/file/elasticDAMpreprintsubmission.pdf},
HAL_ID = {hal-01962617},
HAL_VERSION = {v1},

}

@article{bonato:hal-01627391,
TITLE = {{Hyperopic Cops and Robbers}},
AUTHOR = {Bonato, Anthony and Clarke, Nancy and Cox, Danielle and Finbow, Stephen and Mc Inerney, Fionn and Messinger, Margaret-Ellen},
URL = {https://hal.inria.fr/hal-01627391},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {794},
PAGES = {59-68},
YEAR = {2019},
PDF = {https://hal.inria.fr/hal-01627391v2/file/HyperopicCops0826.pdf},
HAL_ID = {hal-01627391},
HAL_VERSION = {v2},

}

@article{borassi:hal-02043367,
TITLE = {{KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation}},
AUTHOR = {Borassi, Michele and Natale, Emanuele},
URL = {https://hal.inria.fr/hal-02043367},
JOURNAL = {{ACM Journal of Experimental Algorithmics}},
PUBLISHER = {{Association for Computing Machinery}},
VOLUME = {24},
NUMBER = {1},
YEAR = {2019},
MONTH = Feb,
DOI = {10.1145/3284359},
KEYWORDS = {shortest path algorithm ; graph mining ; sampling ; network analysis ; Betweenness centrality},
PDF = {https://hal.inria.fr/hal-02043367/file/kadabra_1604.08553.pdf},
HAL_ID = {hal-02043367},
HAL_VERSION = {v1},

}

@article{bousquet:hal-02158330,
TITLE = {{A proof of the Erd{\"o}s--Sands--Sauer--Woodrow conjecture}},
AUTHOR = {Bousquet, Nicolas and Lochet, William and Thomass{\'e}, St{\'e}phan},
URL = {https://hal.archives-ouvertes.fr/hal-02158330},
JOURNAL = {{Journal of Combinatorial Theory, Series B}},
PUBLISHER = {{Elsevier}},
SERIES = {Elsevier Journal of Combinatorial Theory, Series B},
VOLUME = {137},
PAGES = {316-319},
YEAR = {2019},
MONTH = Jul,
DOI = {10.1016/j.jctb.2018.11.005},
KEYWORDS = {Tournaments ; Domination ; Transitive digraphs},
PDF = {https://hal.archives-ouvertes.fr/hal-02158330/file/monoPath.pdf},
HAL_ID = {hal-02158330},
HAL_VERSION = {v1},

}

@article{caillouet:hal-02043136,
TITLE = {{Efficient Data Collection and Tracking with Flying Drones}},
AUTHOR = {Caillouet, Christelle and Giroire, Fr{\'e}d{\'e}ric and Razafindralambo, Tahiry},
URL = {https://hal.inria.fr/hal-02043136},
JOURNAL = {{Ad Hoc Networks}},
PUBLISHER = {{Elsevier}},
SERIES = {Ad Hoc Networks},
VOLUME = {89},
NUMBER = {C},
PAGES = {35-46},
YEAR = {2019},
DOI = {10.1016/j.adhoc.2019.01.011},
KEYWORDS = {Wireless Sensor Network ; Coverage ; UAV},
PDF = {https://hal.inria.fr/hal-02043136/file/main.pdf},
HAL_ID = {hal-02043136},
HAL_VERSION = {v1},

}

@article{coudert:hal-02152971,
TITLE = {{P-FPT algorithms for bounded clique-width graphs}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume and Popa, Alexandru},
URL = {https://hal.archives-ouvertes.fr/hal-02152971},
JOURNAL = {{ACM Transactions on Algorithms}},
PUBLISHER = {{Association for Computing Machinery}},
VOLUME = {15},
NUMBER = {3},
PAGES = {1-57},
YEAR = {2019},
MONTH = Jun,
DOI = {10.1145/3310228},
PDF = {https://hal.archives-ouvertes.fr/hal-02152971/file/hal-version-talg.pdf},
HAL_ID = {hal-02152971},
HAL_VERSION = {v1},

}

@article{dross:hal-02350215,
TITLE = {{On the Unavoidability of Oriented Trees}},
AUTHOR = {Dross, Fran{\c c}ois and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-02350215},
JOURNAL = {{Electronic Notes in Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {346},
PAGES = {425-436},
YEAR = {2019},
MONTH = Aug,
DOI = {10.1016/j.entcs.2019.08.038},
KEYWORDS = {Tournament ; oriented trees ; unavoidability ; Ramsey theory},
PDF = {https://hal.inria.fr/hal-02350215/file/ENTCS.pdf},
HAL_ID = {hal-02350215},
HAL_VERSION = {v1},

}

@article{fraigniaud:hal-02001830,
TITLE = {{Noisy rumor spreading and plurality consensus}},
AUTHOR = {Fraigniaud, Pierre and Natale, Emanuele},
URL = {https://hal.archives-ouvertes.fr/hal-02001830},
JOURNAL = {{Distributed Computing}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {32},
NUMBER = {4},
PAGES = {257-276},
YEAR = {2019},
DOI = {10.1007/s00446-018-0335-5},
KEYWORDS = {Noise ; Biological distributed algorithms ; PUSH model ; Plurality consensus ; Rumor spreading},
PDF = {https://hal.archives-ouvertes.fr/hal-02001830/file/Noisy_Plurality_Consensus.pdf},
HAL_ID = {hal-02001830},
HAL_VERSION = {v1},

}

@article{garnero:lirmm-02342736,
TITLE = {{Explicit Linear Kernels for Packing Problems}},
AUTHOR = {Garnero, Valentin and Paul, Christophe and Sau Valls, Ignasi and Thilikos, Dimitrios M.},
URL = {https://hal-lirmm.ccsd.cnrs.fr/lirmm-02342736},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {81},
NUMBER = {4},
PAGES = {1615-1656},
YEAR = {2019},
MONTH = Apr,
DOI = {10.1007/s00453-018-0495-5},
KEYWORDS = {Parameterized complexity ; linear kernels ; packing problems ; dynamic pro- gramming ; protrusion replacement ; graph minors},
PDF = {https://hal-lirmm.ccsd.cnrs.fr/lirmm-02342736/file/ALGO-D-16-00298-R1.pdf},
HAL_ID = {lirmm-02342736},
HAL_VERSION = {v1},

}

@article{havet:hal-01798795,
TITLE = {{Constrained ear decompositions in graphs and digraphs}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01798795},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {vol. 21 no. 4},
YEAR = {2019},
MONTH = Sep,
PDF = {https://hal.inria.fr/hal-01798795v3/file/oddEarDec-final.pdf},
HAL_ID = {hal-01798795},
HAL_VERSION = {v3},

}

@article{jaumard:hal-02167682,
TITLE = {{Wavelength Defragmentation for Seamless Migration}},
AUTHOR = {Jaumard, Brigitte and Pouya, Hamed and Coudert, David},
URL = {https://hal.inria.fr/hal-02167682},
JOURNAL = {{Journal of Lightwave Technology}},
PUBLISHER = {{Institute of Electrical and Electronics Engineers (IEEE)/Optical Society of America(OSA)}},
VOLUME = {37},
NUMBER = {17},
PAGES = {4382-4393},
YEAR = {2019},
MONTH = Sep,
DOI = {10.1109/JLT.2019.2924914},
KEYWORDS = {Network Reconfig- uration ; Network Reconfiguration ; Fragmented Network ; Routing and Wavelength Assignment ; Wavelength Defragmentation ; Seamless Defragmentation ; Make-Before-Break Rerouting},
PDF = {https://hal.inria.fr/hal-02167682/file/RWA_MBB_JLT_hal.pdf},
HAL_ID = {hal-02167682},
HAL_VERSION = {v1},

}

@article{knauer:hal-01612515,
TITLE = {{Computing metric hulls in graphs}},
AUTHOR = {Knauer, Kolja and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01612515},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {vol. 21 no. 1, ICGT 2018},
YEAR = {2019},
MONTH = May,
PDF = {https://hal.inria.fr/hal-01612515v4/file/DMTCS_MetricHull_Final.pdf},
HAL_ID = {hal-01612515},
HAL_VERSION = {v4},

}

@article{lochet:hal-01835124,
TITLE = {{Immersion of transitive tournaments in digraphs with large minimum outdegree}},
AUTHOR = {Lochet, William},
URL = {https://hal.archives-ouvertes.fr/hal-01835124},
JOURNAL = {{Journal of Combinatorial Theory, Series B}},
PUBLISHER = {{Elsevier}},
VOLUME = {134},
PAGES = {350-353},
YEAR = {2019},
MONTH = Jan,
DOI = {10.1016/j.jctb.2018.05.004},
KEYWORDS = {Immersions ; Digraphs ; Transitive tournaments},
PDF = {https://hal.archives-ouvertes.fr/hal-01835124/file/immersion_final.pdf},
HAL_ID = {hal-01835124},
HAL_VERSION = {v1},

}

@inproceedings{bensmail:hal-02098194,
TITLE = {{Metric Dimension: from Graphs to Oriented Graphs}},
AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-02098194},
BOOKTITLE = {{LAGOS 2019 - 10th Latin \& American Algorithms, Graphs and Optimization Symposium}},
ADDRESS = {Belo Horizonte, Brazil},
SERIES = {Electronic Notes in Theoretical Computer Science},
VOLUME = {346},
PAGES = {111-123},
YEAR = {2019},
MONTH = Jun,
KEYWORDS = {Strongly-connected orientations ; Resolving sets ; Metric dimension},
PDF = {https://hal.inria.fr/hal-02098194/file/oriented_metric_dimension_HAL_LAGOS.pdf},
HAL_ID = {hal-02098194},
HAL_VERSION = {v1},

}

@inproceedings{bensmail:hal-02118847,
TITLE = {{Dimension M{\'e}trique des Graphes Orient{\'e}s}},
AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-02118847},
BOOKTITLE = {{AlgoTel 2019 - 21{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Saint Laurent de la Cabrerisse, France},
YEAR = {2019},
MONTH = Jun,
KEYWORDS = {Graphes ; Dimension M{\'e}trique ; Ensembles Resolvants ; Orientations fortement connexes},
PDF = {https://hal.inria.fr/hal-02118847/file/corrected_algotel2019_md_oriente.pdf},
HAL_ID = {hal-02118847},
HAL_VERSION = {v1},

}

@inproceedings{bermond:hal-02316854,
TITLE = {{Gossiping with interference in radio chain networks (upper bound algorithms)}},
AUTHOR = {Bermond, Jean-Claude and Kodate, Takako and Yu, Joseph},
URL = {https://hal.inria.fr/hal-02316854},
BOOKTITLE = {{JCDCG-3 - 22th Japan Conference on Discrete and Computational Geometry, Graphs, and Games}},
ADDRESS = {Tokyo, Japan},
YEAR = {2019},
MONTH = Sep,
PDF = {https://hal.inria.fr/hal-02316854/file/abstractBKY2019.pdf},
HAL_ID = {hal-02316854},
HAL_VERSION = {v1},

}

@inproceedings{busnel:hal-02267396,
TITLE = {{Self-organized UAV-based Supervision and Connectivity: Challenges and Opportunities}},
AUTHOR = {Busnel, Yann and Caillouet, Christelle and Coudert, David},
URL = {https://hal.inria.fr/hal-02267396},
BOOKTITLE = {{NCA 2019 - 18th IEEE International Symposium on Network Computing and Applications}},
ADDRESS = {Cambridge, United States},
PUBLISHER = {{IEEE}},
PAGES = {1-5},
YEAR = {2019},
MONTH = Sep,
DOI = {10.1109/NCA.2019.8935060},
PDF = {https://hal.inria.fr/hal-02267396/file/Position_Paper___NCA_2019%282%29.pdf},
HAL_ID = {hal-02267396},
HAL_VERSION = {v1},

}

@inproceedings{busnel:hal-02349396,
TITLE = {{Self-organized Disaster Management System by Distributed Deployment of Connected UAVs}},
AUTHOR = {Busnel, Yann and Caillouet, Christelle and Coudert, David},
URL = {https://hal.inria.fr/hal-02349396},
BOOKTITLE = {{ICT-DM 2019 - 6th International Conference on Information and Communication Technologies for Disaster Management}},
ADDRESS = {Paris, France},
PAGES = {1-8},
YEAR = {2019},
MONTH = Dec,
DOI = {10.1109/ICT-DM47966.2019.9032964},
PDF = {https://hal.inria.fr/hal-02349396/file/Spread_Shrink%284%29.pdf},
HAL_ID = {hal-02349396},
HAL_VERSION = {v1},

}

@inproceedings{caillouet:hal-02267218,
TITLE = {{Optimal SF Allocation in LoRaWAN Considering Physical Capture and Imperfect Orthogonality}},
AUTHOR = {Caillouet, Christelle and Heusse, Martin and Rousseau, Franck},
URL = {https://hal.inria.fr/hal-02267218},
BOOKTITLE = {{GLOBECOM 2019 - IEEE Global Communications Conference}},
ADDRESS = {Waikoloa, United States},
YEAR = {2019},
MONTH = Dec,
DOI = {10.1109/GLOBECOM38437.2019.9013602},
PDF = {https://hal.inria.fr/hal-02267218/file/main.pdf},
HAL_ID = {hal-02267218},
HAL_VERSION = {v1},

}

@inproceedings{caillouet:hal-02043123,
TITLE = {{Optimal placement of drones for fast sensor energy replenishment using wireless power transfer}},
AUTHOR = {Caillouet, Christelle and Razafindralambo, Tahiry and Zorbas, Dimitrios},
URL = {https://hal.inria.fr/hal-02043123},
NOTE = {Best Paper Award},
BOOKTITLE = {{WD 2019 - Wireless Days 2019}},
ADDRESS = {Manchester, United Kingdom},
YEAR = {2019},
MONTH = Apr,
DOI = {10.1109/WD.2019.8734203},
PDF = {https://hal.inria.fr/hal-02043123/file/cameraReady.pdf},
HAL_ID = {hal-02043123},
HAL_VERSION = {v1},

}

@inproceedings{caillouet:hal-02129960,
TITLE = {{Utiliser des drones pour recharger efficacement des capteurs}},
AUTHOR = {Caillouet, Christelle and Razafindralambo, Tahiry and Zorbas, Dimitrios},
URL = {https://hal.inria.fr/hal-02129960},
BOOKTITLE = {{ALGOTEL 2019 - 21{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Saint Laurent de la Cabrerisse, France},
YEAR = {2019},
MONTH = Jun,
PDF = {https://hal.inria.fr/hal-02129960/file/sample-algotel.pdf},
HAL_ID = {hal-02129960},
HAL_VERSION = {v1},

}

@inproceedings{cruciani:hal-02002462,
TITLE = {{Distributed Community Detection via Metastability of the 2-Choices Dynamics}},
AUTHOR = {Cruciani, Emilio and Natale, Emanuele and Scornavacca, Giacomo},
URL = {https://hal.archives-ouvertes.fr/hal-02002462},
BOOKTITLE = {{AAAI 2019 - 33th AAAI Conference Association for the Advancement of Artificial Intelligence}},
ADDRESS = {Honolulu, United States},
YEAR = {2019},
MONTH = Jan,
PDF = {https://hal.archives-ouvertes.fr/hal-02002462/file/2_Choices_Metastability___AAAI19___HAL_version.pdf},
HAL_ID = {hal-02002462},
HAL_VERSION = {v1},

}

@inproceedings{dilena:hal-02362997,
TITLE = {{Mininet on steroids: exploiting the cloud for Mininet performance}},
AUTHOR = {Di Lena, Giuseppe and Tomassilli, Andrea and Saucez, Damien and Giroire, Fr{\'e}d{\'e}ric and Turletti, Thierry and Lac, Chidung},
URL = {https://hal.inria.fr/hal-02362997},
BOOKTITLE = {{CloudNet 2019 - IEEE International Conference on Cloud Networking}},
ADDRESS = {Coimbra, Portugal},
YEAR = {2019},
MONTH = Nov,
PDF = {https://hal.inria.fr/hal-02362997/file/CloudNet%20%2815%29.pdf},
HAL_ID = {hal-02362997},
HAL_VERSION = {v1},

}

@inproceedings{gausseran:hal-02118989,
TITLE = {{Reconfiguration de cha{\^i}nes de fonctions de services sans interruption}},
AUTHOR = {Gausseran, Adrien and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna},
URL = {https://hal.archives-ouvertes.fr/hal-02118989},
BOOKTITLE = {{CORES 2019 - Rencontres Francophones sur la Conception de Protocoles, l’{\'E}valuation de Performance et l’Exp{\'e}rimentation des R{\'e}seaux de Communication}},
ADDRESS = {Saint Laurent de la Cabrerisse, France},
YEAR = {2019},
MONTH = Jun,
KEYWORDS = {NFV ; SDN ; Reconfiguration ; SFC},
PDF = {https://hal.archives-ouvertes.fr/hal-02118989/file/AlgoTel.pdf},
HAL_ID = {hal-02118989},
HAL_VERSION = {v1},

}

@inproceedings{gausseran:hal-02295967,
TITLE = {{No Interruption When Reconfiguring my SFCs}},
AUTHOR = {Gausseran, Adrien and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna},
URL = {https://hal.inria.fr/hal-02295967},
NOTE = {This work has been supported by the French government through the UCAJEDI (ANR-15-IDEX-01) and EUR DS4H (ANR-17-EURE-004) Investments in the Future projects, and by Inria associated team EfDyNet.},
BOOKTITLE = {{CloudNet 2019 - 8th IEEE International Conference on Cloud Networking}},
ADDRESS = {Coimbra, Portugal},
YEAR = {2019},
MONTH = Nov,
PDF = {https://hal.inria.fr/hal-02295967/file/PID6145639.pdf},
HAL_ID = {hal-02295967},
HAL_VERSION = {v1},

}

@inproceedings{gausseran:hal-02083579,
TITLE = {{Poster: Don't Interrupt Me When You Reconfigure my Service Function Chains}},
AUTHOR = {Gausseran, Adrien and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna},
URL = {https://hal.inria.fr/hal-02083579},
BOOKTITLE = {{IFIP Networking Conference 2019}},
ADDRESS = {Varsovie, Poland},
YEAR = {2019},
MONTH = May,
KEYWORDS = {Reconfiguration ; Service Function Chaining ; Networking ; Routing},
PDF = {https://hal.inria.fr/hal-02083579/file/networking-short.pdf},
HAL_ID = {hal-02083579},
HAL_VERSION = {v1},

}

@inproceedings{giroire:hal-01989755,
TITLE = {{When Network Matters: Data Center Scheduling with Network Tasks}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Huin, Nicolas and Tomassilli, Andrea and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-01989755},
BOOKTITLE = {{INFOCOM 2019 - IEEE International Conference on Computer Communications}},
ADDRESS = {Paris, France},
YEAR = {2019},
MONTH = Apr,
PDF = {https://hal.inria.fr/hal-01989755/file/infocom2019_camera_ready.pdf},
HAL_ID = {hal-01989755},
HAL_VERSION = {v1},

}

@inproceedings{mcinerney:hal-02098169,
TITLE = {{Eternal Domination in Grids}},
AUTHOR = {Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-02098169},
BOOKTITLE = {{CIAC 2019 - 11th International Conference on Algorithms and Complexity}},
ADDRESS = {Rome, Italy},
SERIES = {Algorithms and Complexity. Lecture Notes in Computer Science},
VOLUME = {11485},
PAGES = {311-322},
YEAR = {2019},
MONTH = May,
KEYWORDS = {Grids ; Combinatorial Games ; Graphs ; Eternal Domination},
PDF = {https://hal.inria.fr/hal-02098169/file/eter_dom_grids_CIAC2019_Corrected.pdf},
HAL_ID = {hal-02098169},
HAL_VERSION = {v1},

}

@inproceedings{morin:hal-02313403,
TITLE = {{VNF placement algorithms to address the mono- and multi-tenant issues in edge and core networks}},
AUTHOR = {Morin, Cedric and Texier, G{\'e}raldine and Caillouet, Christelle and Desmangles, Gilles and Phan, Cao-Thanh},
URL = {https://hal.archives-ouvertes.fr/hal-02313403},
BOOKTITLE = {{CLOUDNET 2019 : 8th IEEE International Conference on Cloud Networking}},
ADDRESS = {Coimbra, Portugal},
YEAR = {2019},
MONTH = Nov,
DOI = {10.1109/CloudNet47604.2019.9064108},
KEYWORDS = {mono-tenant architecture ; multi- tenant architecture ; VNF placement optimization},
PDF = {https://hal.archives-ouvertes.fr/hal-02313403/file/1570576684%20%282%29.pdf},
HAL_ID = {hal-02313403},
HAL_VERSION = {v1},

}

@inproceedings{natale:hal-02002448,
TITLE = {{On the Necessary Memory to Compute the Plurality in Multi-Agent Systems}},
AUTHOR = {Natale, Emanuele and Ramezani, Iliad},
URL = {https://hal.archives-ouvertes.fr/hal-02002448},
NOTE = {14 pages, accepted at CIAC 2019},
BOOKTITLE = {{CIAC 2019 - 11th International Conference Algorithms and Complexity}},
ADDRESS = {Rome, Italy},
PAGES = {323-338},
YEAR = {2019},
MONTH = May,
DOI = {10.1007/978-3-030-17402-6\_27},
PDF = {https://hal.archives-ouvertes.fr/hal-02002448/file/ciac_1901.06549.pdf},
HAL_ID = {hal-02002448},
HAL_VERSION = {v1},

}

@inproceedings{tomassilli:hal-02292971,
TITLE = {{Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks}},
AUTHOR = {Tomassilli, Andrea and Di Lena, Giuseppe and Giroire, Fr{\'e}d{\'e}ric and Tahiri, Issam and Saucez, Damien and P{\'e}rennes, St{\'e}phane and Turletti, Thierry and Sadykov, Ruslan and Vanderbeck, Fran{\c c}ois and Lac, Chidung},
URL = {https://hal.inria.fr/hal-02292971},
BOOKTITLE = {{CloudNet 2019 - 8th IEEE International Conference on Cloud Networking}},
ADDRESS = {Coimbra, Portugal},
YEAR = {2019},
MONTH = Nov,
PDF = {https://hal.inria.fr/hal-02292971/file/camera-ready-cloudnet.pdf},
HAL_ID = {hal-02292971},
HAL_VERSION = {v1},

}

@inproceedings{tomassilli:hal-02366221,
TITLE = {{The Structured Way of Dealing with Heterogeneous Live Streaming Systems}},
AUTHOR = {Tomassilli, Andrea and Huin, Nicolas and Giroire, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-02366221},
BOOKTITLE = {{3PGCIC - International Conference on P2P, Parallel, Grid, Cloud and Internet Computing}},
ADDRESS = {Anvers, Belgium},
SERIES = {Advances on P2P, Parallel, Grid, Cloud and Internet Computing},
YEAR = {2019},
MONTH = Nov,
PDF = {https://hal.inria.fr/hal-02366221/file/2019-3PGCIC-P2P-streaming.pdf},
HAL_ID = {hal-02366221},
HAL_VERSION = {v1},

}

@techreport{andres:hal-02053265,
TITLE = {{On the Complexity of Orthogonal Colouring Games and the NP-Completeness of Recognising Graphs Admitting a Strictly Matched Involution}},
AUTHOR = {Andres, Stephan Dominique and Dross, Fran{\c c}ois and Huggan, Melissa and Mc Inerney, Fionn and Nowakowski, Richard J},
URL = {https://hal.inria.fr/hal-02053265},
TYPE = {Research Report},
INSTITUTION = {{Inria - Sophia Antipolis}},
YEAR = {2019},
MONTH = Mar,
KEYWORDS = {scoring game ; strictly matched involution ; NP-completeness ; combinatorial game ; Orthogonal Colouring Game ; orthogonal graph colouring ; PSPACE-completeness},
PDF = {https://hal.inria.fr/hal-02053265v2/file/final06ComplexityPaperOrthogonalColouringGame.pdf},
HAL_ID = {hal-02053265},
HAL_VERSION = {v2},

}

@techreport{baktash:hal-02321581,
TITLE = {{A Comparative Study of Neural Network Compression}},
AUTHOR = {Baktash, Hossein and Natale, Emanuele and Viennot, Laurent},
URL = {https://hal.inria.fr/hal-02321581},
TYPE = {Research Report},
INSTITUTION = {{INRIA Sophia Antipolis - I3S}},
YEAR = {2019},
MONTH = Oct,
PDF = {https://hal.inria.fr/hal-02321581/file/A_Comparative_Study_of_Neural_Network_Compression.pdf},
HAL_ID = {hal-02321581},
HAL_VERSION = {v1},

}

@techreport{busnel:hal-02125359,
TITLE = {{VESPA: Constrained target coverage by distributed deployment of connected UAVs}},
AUTHOR = {Busnel, Yann and Caillouet, Christelle and Coudert, David},
URL = {https://hal.inria.fr/hal-02125359},
TYPE = {Research Report},
INSTITUTION = {{Inria ; I3S, Universit{\'e} C{\^o}te d'Azur ; IMT Atlantique}},
YEAR = {2019},
MONTH = May,
PDF = {https://hal.inria.fr/hal-02125359/file/VESPA.pdf},
HAL_ID = {hal-02125359},
HAL_VERSION = {v1},

}

@techreport{gausseran:hal-02416096,
TITLE = {{Be Scalable and Rescue My Slices During Reconfiguration}},
AUTHOR = {Gausseran, Adrien and Giroire, Fr{\'e}d{\'e}ric and Jaumard, Brigitte and Moulierac, Joanna},
URL = {https://hal.inria.fr/hal-02416096},
TYPE = {Research Report},
INSTITUTION = {{Inria - Sophia Antipolis ; I3S, Universit{\'e} C{\^o}te d'Azur ; Concordia University}},
YEAR = {2019},
MONTH = Dec,
KEYWORDS = {Reconfiguration ; Software Defined Networking ; Service Function Chains ; Network Function Virtualization},
PDF = {https://hal.inria.fr/hal-02416096/file/report2019.pdf},
HAL_ID = {hal-02416096},
HAL_VERSION = {v1},

}

@techreport{havet:hal-02025469,
TITLE = {{Overlaying a hypergraph with a graph with bounded maximum degree}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Mazauric, Dorian and Nguyen, Viet-Ha and Watrigant, R{\'e}mi},
URL = {https://hal.inria.fr/hal-02025469},
TYPE = {Research Report},
NUMBER = {RR-9258},
INSTITUTION = {{Inria Sophia Antipolis}},
YEAR = {2019},
MONTH = Feb,
KEYWORDS = {computational structural biology ; Hypergraph ; graph ; algorithm ; complexity ; Hypergraphe ; graphe ; algorithme ; complexit{\'e} ; biologie structurale computation-nelle},
PDF = {https://hal.inria.fr/hal-02025469v2/file/v2-RR-9258.pdf},
HAL_ID = {hal-02025469},
HAL_VERSION = {v2},

}

@techreport{tomassilli:hal-02112282,
TITLE = {{Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks}},
AUTHOR = {Tomassilli, Andrea and Di Lena, Giuseppe and Giroire, Fr{\'e}d{\'e}ric and Tahiri, Issam and Saucez, Damien and Perennes, St{\'e}phane and Turletti, Thierry and Sadykov, Ruslan and Vanderbeck, Fran{\c c}ois and Lac, Chidung},
URL = {https://hal.inria.fr/hal-02112282},
TYPE = {Research Report},
INSTITUTION = {{INRIA Sophia Antipolis - I3S}},
YEAR = {2019},
MONTH = Apr,
KEYWORDS = {network resilience strategies ; Network Function Virtualization ; Software Defined Networking},
PDF = {https://hal.inria.fr/hal-02112282/file/RR9272.pdf},
HAL_ID = {hal-02112282},
HAL_VERSION = {v1},

}

@misc{dilena:hal-02359801,
TITLE = {{Distributed Network Experiment Emulation}},
AUTHOR = {Di Lena, Giuseppe and Tomassilli, Andrea and Saucez, Damien and Giroire, Fr{\'e}d{\'e}ric and Turletti, Thierry and Lac, Chidung and Dabbous, Walid},
URL = {https://hal.inria.fr/hal-02359801},
HOWPUBLISHED = {{GEFI 19 - Global Experimentation for Future Internet - Workshop}},
YEAR = {2019},
MONTH = Nov,
PDF = {https://hal.inria.fr/hal-02359801/file/GEFI%281%29.pdf},
HAL_ID = {hal-02359801},
HAL_VERSION = {v1},

}

@misc{dilena:hal-02359695,
TITLE = {{Demo Proposal - Distrinet: a Mininet implementation for the Cloud}},
AUTHOR = {Di Lena, Giuseppe and Tomassilli, Andrea and Saucez, Damien and Giroire, Fr{\'e}d{\'e}ric and Turletti, Thierry and Lac, Chidung},
URL = {https://hal.inria.fr/hal-02359695},
NOTE = {Poster},
HOWPUBLISHED = {{CoNEXT 2019 - 15th International Conference on emerging Networking EXperiments and Technologies}},
YEAR = {2019},
MONTH = Dec,
PDF = {https://hal.inria.fr/hal-02359695/file/Distrinet___demo_CoNEXT19__Hal_version_.pdf},
HAL_ID = {hal-02359695},
HAL_VERSION = {v1},

}

@misc{tomassilli:hal-02364488,
TITLE = {{Poster: Design of Survivable SDN/NFV-enabled Networks with Bandwidth-optimal Failure Recovery}},
AUTHOR = {Tomassilli, Andrea and Di Lena, Giuseppe and Giroire, Fr{\'e}d{\'e}ric and Tahiri, Issam and P{\'e}rennes, St{\'e}phane and Saucez, Damien and Turletti, Thierry and Sadykov, Ruslan and Vanderbeck, Fran{\c c}ois and Lac, Chidung},
URL = {https://hal.inria.fr/hal-02364488},
NOTE = {Poster},
HOWPUBLISHED = {{NETWORKING 2019 - IFIP Networking conference}},
YEAR = {2019},
MONTH = May,
PDF = {https://hal.inria.fr/hal-02364488/file/2019-POSTER-IFIP-global-rerouting.pdf},
HAL_ID = {hal-02364488},
HAL_VERSION = {v1},

}

@unpublished{bermond:hal-02424099,
TITLE = {{Gossiping with interference in radio ring networks}},
AUTHOR = {Bermond, Jean-Claude and Kodate, Takako and Yu, Joseph},
URL = {https://hal.inria.fr/hal-02424099},
NOTE = {working paper or preprint},
YEAR = {2019},
MONTH = Dec,
KEYWORDS = {Gossiping ; Radio Networks ; Interference ; Rings},
PDF = {https://hal.inria.fr/hal-02424099/file/BKY19-gossipingcycles-hal.pdf},
HAL_ID = {hal-02424099},
HAL_VERSION = {v1},

}

@unpublished{bermond:hal-02424017,
TITLE = {{Gossiping with interference in radio chain networks}},
AUTHOR = {Bermond, Jean-Claude and Kodate, Takako and Yu, Joseph},
URL = {https://hal.inria.fr/hal-02424017},
NOTE = {working paper or preprint},
YEAR = {2019},
MONTH = Dec,
KEYWORDS = {chains ; Interference ; paths ; Radio Networks ; Gossiping},
PDF = {https://hal.inria.fr/hal-02424017/file/BKY19-hal.pdf},
HAL_ID = {hal-02424017},
HAL_VERSION = {v1},

}

@unpublished{cohen:inria-00504914,
TITLE = {{Several Graph problems and their Linear Program formulations}},
AUTHOR = {Cohen, Nathann},
URL = {https://hal.inria.fr/inria-00504914},
NOTE = {working paper or preprint},
YEAR = {2019},
MONTH = Jan,
PDF = {https://hal.inria.fr/inria-00504914v2/file/LP_formulations.pdf},
HAL_ID = {inria-00504914},
HAL_VERSION = {v2},

}

@phdthesis{giroire:tel-01942208,
TITLE = {{Optimization of Network Infrastructures}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/tel-01942208},
SCHOOL = {{Universit{\'e} C{\^o}te D'Azur}},
YEAR = {2018},
MONTH = Oct,
KEYWORDS = {Network optimization ; Energy efficiency ; Algorithmics ; Optimization ; Software Defined Networks SDN ; Network Function Virtualization NFV ; Service Function Chaining SFC ; Optimisation des r{\'e}seaux ; Efficacit{\'e} {\'e}nerg{\'e}tique ; Algorithmique ; Optimisation ; R{\'e}seaux logiciels SDN ; Virtualisation des fonctions r{\'e}seau NFV ; Cha{\^i}ne de fonction de services SFC},
TYPE = {Habilitation {\`a} diriger des recherches},
PDF = {https://hal.inria.fr/tel-01942208/file/hdr.pdf},
HAL_ID = {tel-01942208},
HAL_VERSION = {v1},

}

@phdthesis{lochet:tel-01957030,
TITLE = {{Substructures in digraphs}},
AUTHOR = {Lochet, William},
URL = {https://hal.archives-ouvertes.fr/tel-01957030},
NUMBER = {2018AZUR4052},
SCHOOL = {{Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2018},
MONTH = Jul,
KEYWORDS = {Digraphs ; Entropy compression ; Tournaments ; Graphes dirig{\'e}s ; Compression d'entropie ; Tournois},
TYPE = {Theses},
PDF = {https://hal.archives-ouvertes.fr/tel-01957030/file/2018AZUR4052.pdf},
HAL_ID = {tel-01957030},
HAL_VERSION = {v2},

}

@incollection{havet:hal-01958359,
TITLE = {{Tournaments and Semicomplete Digraphs.}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Bang-Jensen, Joergen},
URL = {https://hal.inria.fr/hal-01958359},
BOOKTITLE = {{Classes of Directed Graphs}},
YEAR = {2018},
HAL_ID = {hal-01958359},
HAL_VERSION = {v1},

}

@article{aboulker:hal-01882395,
TITLE = {{$$\chi$$-bounded families of oriented graphs}},
AUTHOR = {Aboulker, P. and Bang-Jensen, J. and Bousquet, Nicolas and Charbit, Pierre and Havet, Fr{\'e}d{\'e}ric and Maffray, F. and Zamora, J.},
URL = {https://hal.inria.fr/hal-01882395},
JOURNAL = {{Journal of Graph Theory}},
PUBLISHER = {{Wiley}},
VOLUME = {89},
NUMBER = {3},
PAGES = {304 - 326},
YEAR = {2018},
MONTH = Sep,
DOI = {10.1002/jgt.22252},
PDF = {https://hal.inria.fr/hal-01882395/file/Induced-digraphs-revised.pdf},
HAL_ID = {hal-01882395},
HAL_VERSION = {v1},

}

@article{araujo:hal-01394201,
TITLE = {{On interval number in cycle convexity}},
AUTHOR = {Araujo, Julio and Ducoffe, Guillaume and Nisse, Nicolas and Suchan, Karol},
URL = {https://hal.inria.fr/hal-01394201},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {Vol. 20 no. 1},
NUMBER = {1},
PAGES = {1-28},
YEAR = {2018},
MONTH = May,
KEYWORDS = { convexity ; domination problems in graphs ; interval number ; graph convexity ; complexity ; complexity and algorithms ; dominating set ; graph},
PDF = {https://hal.inria.fr/hal-01394201/file/DMTCS_final.pdf},
HAL_ID = {hal-01394201},
HAL_VERSION = {v4},

}

@article{araujo:hal-01796713,
TITLE = {{Steinberg-like theorems for backbone colouring}},
AUTHOR = {Araujo, J. and Havet, Fr{\'e}d{\'e}ric and Schmitt, M.},
URL = {https://hal.inria.fr/hal-01796713},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
YEAR = {2018},
DOI = {10.1016/j.dam.2017.03.009},
PDF = {https://hal.inria.fr/hal-01796713/file/backbone-steinberg.pdf},
HAL_ID = {hal-01796713},
HAL_VERSION = {v1},

}

@article{bampis:hal-01725140,
TITLE = {{Energy Efficient Scheduling and Routing via Randomized Rounding}},
AUTHOR = {Bampis, Evripidis and Kononov, Alexander and Letsios, Dimitrios and Lucarelli, Giorgio and Sviridenko, Maxim},
URL = {https://hal.inria.fr/hal-01725140},
JOURNAL = {{Journal of Scheduling}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {21},
NUMBER = {1},
PAGES = {35-51},
YEAR = {2018},
MONTH = Feb,
DOI = {10.1007/s10951-016-0500-2},
PDF = {https://hal.inria.fr/hal-01725140/file/journal-hal.pdf},
HAL_ID = {hal-01725140},
HAL_VERSION = {v1},

}

@article{bangjensen:hal-01765642,
TITLE = {{Out-degree reducing partitions of digraphs}},
AUTHOR = {Bang-Jensen, Joergen and Bessy, St{\'e}phane and Havet, Fr{\'e}d{\'e}ric and Yeo, Anders},
URL = {https://hal.inria.fr/hal-01765642},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {719},
PAGES = {64-72},
YEAR = {2018},
MONTH = Apr,
DOI = {10.1016/j.tcs.2017.11.007},
KEYWORDS = {Polynomial algorithm ; 2-partition ; Maximum out-degree reducing partition ; NP-complete},
PDF = {https://hal.inria.fr/hal-01765642/file/Maxreduce2part-revised.pdf},
HAL_ID = {hal-01765642},
HAL_VERSION = {v1},

}

@article{baudon:hal-01398228,
TITLE = {{On locally irregular decompositions of subcubic graphs}},
AUTHOR = {Baudon, Olivier and Bensmail, Julien and Hocquard, Herv{\'e} and Senhaji, Mohammed and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-01398228},
JOURNAL = {{Opuscula Mathematica}},
PUBLISHER = {{AGH University of Science and Technology}},
VOLUME = {38},
NUMBER = {6},
PAGES = {795-817},
YEAR = {2018},
MONTH = Jul,
PDF = {https://hal.archives-ouvertes.fr/hal-01398228/file/irrsubcub2703.pdf},
HAL_ID = {hal-01398228},
HAL_VERSION = {v2},

}

@article{baudon:hal-01374427,
TITLE = {{On locally irregular decompositions and the 1-2 Conjecture in digraphs}},
AUTHOR = {Baudon, Olivier and Bensmail, Julien and Przybylo, Jakub and Wo{\'z}niak, Mariusz},
URL = {https://hal.archives-ouvertes.fr/hal-01374427},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {vol. 20 no. 2},
YEAR = {2018},
MONTH = Oct,
KEYWORDS = {1-2 Conjecture ; locally irregular decompositions ; digraphs},
PDF = {https://hal.archives-ouvertes.fr/hal-01374427/file/12-oriented.pdf},
HAL_ID = {hal-01374427},
HAL_VERSION = {v5},

}

@article{baudon:hal-01522853,
TITLE = {{Neighbour-Sum-2-Distinguishing Edge-Weightings: Doubling the 1-2-3 Conjecture}},
AUTHOR = {Baudon, Olivier and Bensmail, Julien and Senhaji, Mohammed and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-01522853},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {251},
NUMBER = {83-92},
YEAR = {2018},
MONTH = Nov,
KEYWORDS = {Bipartite graphs ; 1-2-3 Conjecture ; Difference-2 distinction},
PDF = {https://hal.archives-ouvertes.fr/hal-01522853/file/v6_123doubled.pdf},
HAL_ID = {hal-01522853},
HAL_VERSION = {v2},

}

@article{bensmail:hal-01166577,
TITLE = {{Orienting edges to fight fire in graphs}},
AUTHOR = {Bensmail, Julien and Brettell, Nick},
URL = {https://hal.archives-ouvertes.fr/hal-01166577},
JOURNAL = {{The Australasian Journal of Combinatorics}},
PUBLISHER = {{Combinatorial Mathematics Society of Australasia (Inc.)}},
VOLUME = {71},
NUMBER = {1},
PAGES = {12-42},
YEAR = {2018},
MONTH = Mar,
PDF = {https://hal.archives-ouvertes.fr/hal-01166577/file/firefight.pdf},
HAL_ID = {hal-01166577},
HAL_VERSION = {v2},

}

@article{bensmail:hal-01790130,
TITLE = {{On improving matchings in trees, via bounded-length augmentations}},
AUTHOR = {Bensmail, Julien and Garnero, Valentin and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01790130},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {250},
NUMBER = {11},
PAGES = {110-129},
YEAR = {2018},
KEYWORDS = {trees ; maximum matchings ; bounded-length augmentations},
PDF = {https://hal.inria.fr/hal-01790130/file/revised-matchings.pdf},
HAL_ID = {hal-01790130},
HAL_VERSION = {v1},

}

@article{bensmail:hal-01711077,
TITLE = {{List coloring digraphs}},
AUTHOR = {Bensmail, Julien and Harutyunyan, Ararat and Le, Ngoc Khang},
URL = {https://hal.archives-ouvertes.fr/hal-01711077},
JOURNAL = {{Journal of Graph Theory}},
PUBLISHER = {{Wiley}},
VOLUME = {87},
NUMBER = {4},
PAGES = {492-508},
YEAR = {2018},
MONTH = Apr,
DOI = {10.1002/jgt.22170},
KEYWORDS = {dichromatic number ; list dichromatic number ; list coloring ; digraphs},
PDF = {https://hal.archives-ouvertes.fr/hal-01711077/file/list-acyclic.pdf},
HAL_ID = {hal-01711077},
HAL_VERSION = {v1},

}

@article{bensmail:hal-01744515,
TITLE = {{Edge-partitioning a graph into paths: beyond the Bar{\'a}t-Thomassen conjecture}},
AUTHOR = {Bensmail, Julien and Harutyunyan, Ararat and Le, Tien-Nam and Thomass{\'e}, St{\'e}phan},
URL = {https://hal.archives-ouvertes.fr/hal-01744515},
JOURNAL = {{Combinatorica}},
PUBLISHER = {{Springer Verlag}},
YEAR = {2018},
PDF = {https://hal.archives-ouvertes.fr/hal-01744515/file/bt-paths5.pdf},
HAL_ID = {hal-01744515},
HAL_VERSION = {v1},

}

@article{bonato:hal-01627391,
TITLE = {{Hyperopic Cops and Robbers}},
AUTHOR = {Bonato, Anthony and Clarke, Nancy and Cox, Danielle and Finbow, Stephen and Mc Inerney, Fionn and Messinger, Margaret-Ellen},
URL = {https://hal.inria.fr/hal-01627391},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
YEAR = {2018},
PDF = {https://hal.inria.fr/hal-01627391/file/HyperopicCops0826.pdf},
HAL_ID = {hal-01627391},
HAL_VERSION = {v2},

}

@article{bosek:hal-01790276,
TITLE = {{Centroidal Localization Game}},
AUTHOR = {Bosek, Bartlomiej and Gordinowicz, Przemyslaw and Grytczuk, Jaroslaw and Nisse, Nicolas and Sokol, Joanna and Sleszynska-Nowak, Malgorzata},
URL = {https://hal.inria.fr/hal-01790276},
JOURNAL = {{The Electronic Journal of Combinatorics}},
PUBLISHER = {{Open Journal Systems}},
YEAR = {2018},
PDF = {https://hal.inria.fr/hal-01790276/file/Centroidal%20Game%20171120.pdf},
HAL_ID = {hal-01790276},
HAL_VERSION = {v1},

}

@article{bosek:hal-01959013,
TITLE = {{Localization game on geometric and planar graphs}},
AUTHOR = {Bosek, Bartlomiej and Gordinowicz, Przemyslaw and Grytczuk, Jaroslaw and Nisse, Nicolas and Sokol, Joanna and Sleszynska-Nowak, Malgorzata},
URL = {https://hal.inria.fr/hal-01959013},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
YEAR = {2018},
PDF = {https://hal.inria.fr/hal-01959013/file/Localization%20Game%20171018.pdf},
HAL_ID = {hal-01959013},
HAL_VERSION = {v1},

}

@article{cohen:hal-01810706,
TITLE = {{Bispindles in strongly connected digraphs with large chromatic number}},
AUTHOR = {Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric and Lochet, William and Lopes, Raul},
URL = {https://hal.inria.fr/hal-01810706},
JOURNAL = {{The Electronic Journal of Combinatorics}},
PUBLISHER = {{Open Journal Systems}},
YEAR = {2018},
MONTH = Jun,
PDF = {https://hal.inria.fr/hal-01810706/file/6922-24594-2-PB.pdf},
HAL_ID = {hal-01810706},
HAL_VERSION = {v1},

}

@article{cohen:hal-01834779,
TITLE = {{Subdivisions of oriented cycles in digraphs with large chromatic number}},
AUTHOR = {Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric and Lochet, William and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-01834779},
JOURNAL = {{Journal of Graph Theory}},
PUBLISHER = {{Wiley}},
VOLUME = {89},
NUMBER = {4},
PAGES = {439-456},
YEAR = {2018},
MONTH = Apr,
DOI = {10.1002/jgt.22360},
PDF = {https://hal.archives-ouvertes.fr/hal-01834779/file/bounded-chi-cycle.pdf},
HAL_ID = {hal-01834779},
HAL_VERSION = {v1},

}

@article{cohen:hal-01947563,
TITLE = {{Complexity dichotomies for the Minimum F -Overlay problem}},
AUTHOR = {Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric and Mazauric, Dorian and Sau, Ignasi and Watrigant, R{\'e}mi},
URL = {https://hal.inria.fr/hal-01947563},
JOURNAL = {{Journal of Discrete Algorithms}},
PUBLISHER = {{Elsevier}},
VOLUME = {52-53},
PAGES = {133-142},
YEAR = {2018},
MONTH = Sep,
DOI = {10.1016/j.jda.2018.11.010},
PDF = {https://hal.inria.fr/hal-01947563/file/jda-revised.pdf},
HAL_ID = {hal-01947563},
HAL_VERSION = {v1},

}

@article{cohen:hal-01765643,
TITLE = {{On the minimum size of an identifying code over all orientations of a graph}},
AUTHOR = {Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-01765643},
JOURNAL = {{The Electronic Journal of Combinatorics}},
PUBLISHER = {{Open Journal Systems}},
VOLUME = {25},
NUMBER = {1},
PAGES = {\#P1.49},
YEAR = {2018},
KEYWORDS = {identifying code ; orientations ; NP-complete},
PDF = {https://hal.inria.fr/hal-01765643/file/ejc-idor.pdf},
HAL_ID = {hal-01765643},
HAL_VERSION = {v1},

}

@article{cohen:hal-01782246,
TITLE = {{Spy-game on graphs: Complexity and simple topologies}},
AUTHOR = {Cohen, Nathann and Martins, Nicolas and Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane and Sampaio, Rudini},
URL = {https://hal.inria.fr/hal-01782246},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {725},
PAGES = {1 - 15},
YEAR = {2018},
MONTH = May,
DOI = {10.1016/j.tcs.2017.11.015},
KEYWORDS = {Graphs ; Cops and Robber games ; PSPACE-hard},
PDF = {https://hal.inria.fr/hal-01782246/file/Spygames1.pdf},
HAL_ID = {hal-01782246},
HAL_VERSION = {v1},

}

@article{cohen:hal-01881473,
TITLE = {{Study of a Combinatorial Game in Graphs Through Linear Programming}},
AUTHOR = {Cohen, Nathann and Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.archives-ouvertes.fr/hal-01881473},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
YEAR = {2018},
MONTH = Aug,
DOI = {10.1007/s00453-018-0503-9},
KEYWORDS = {Domination ; Graphs ; Spy game ; Cops and Robber games ; Linear Programming ; Tree ; Grid},
PDF = {https://hal.archives-ouvertes.fr/hal-01881473/file/spygame_trees_grids_July18.pdf},
HAL_ID = {hal-01881473},
HAL_VERSION = {v1},

}

@article{coudert:hal-01753324,
TITLE = {{Revisiting Decomposition by Clique Separators}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume},
URL = {https://hal.inria.fr/hal-01753324},
JOURNAL = {{Siam Journal on Discrete Mathematics}},
PUBLISHER = {{Society for Industrial and Applied Mathematics}},
VOLUME = {32},
NUMBER = {1},
PAGES = {682 - 694},
YEAR = {2018},
MONTH = Jan,
DOI = {10.1137/16M1059837},
KEYWORDS = {Keyword: clique minimal separator decomposition ; minimal triangulation ; clique-number ; treewidth ; planar graphs ; bounded-degree graphs},
PDF = {https://hal.inria.fr/hal-01753324/file/decomposition_by_clique_separators.pdf},
HAL_ID = {hal-01753324},
HAL_VERSION = {v1},

}

@article{coudert:hal-01741277,
TITLE = {{On distance-preserving elimination orderings in graphs: Complexity and algorithms}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume and Nisse, Nicolas and Soto, Mauricio},
URL = {https://hal.inria.fr/hal-01741277},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {243},
PAGES = {140-153},
YEAR = {2018},
MONTH = Mar,
DOI = {10.1016/j.dam.2018.02.007},
KEYWORDS = {bounded treewidth ; integer linear programming ; Keyword: distance-preserving elimination ordering ; metric graph theory ; NP-complete ; exact exponential algorithm},
PDF = {https://hal.inria.fr/hal-01741277/file/dpo-hal.pdf},
HAL_ID = {hal-01741277},
HAL_VERSION = {v1},

}

@article{dantas:hal-01861913,
TITLE = {{Minimum density of identifying codes of king grids}},
AUTHOR = {Dantas, Rennan and Havet, Fr{\'e}d{\'e}ric and Sampaio, Rudini},
URL = {https://hal.inria.fr/hal-01861913},
JOURNAL = {{Discrete Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {341},
NUMBER = {10},
PAGES = {2708 - 2719},
YEAR = {2018},
MONTH = Oct,
DOI = {10.1016/j.disc.2018.06.035},
KEYWORDS = {identifying codes ; king grids ; Discharging Method},
PDF = {https://hal.inria.fr/hal-01861913/file/idcodes-king.pdf},
HAL_ID = {hal-01861913},
HAL_VERSION = {v1},

}

@article{ducoffe:hal-01735826,
TITLE = {{A short note on the complexity of computing strong pathbreadth}},
AUTHOR = {Ducoffe, Guillaume},
URL = {https://hal.archives-ouvertes.fr/hal-01735826},
JOURNAL = {{Information Processing Letters}},
PUBLISHER = {{Elsevier}},
VOLUME = {133},
PAGES = {56-58},
YEAR = {2018},
DOI = {10.1016/j.ipl.2018.01.005},
KEYWORDS = {NP-complete ; strong pathbreadth ; path decomposition ; acyclic clustering ; graph theory},
PDF = {https://hal.archives-ouvertes.fr/hal-01735826/file/IPL5627.pdf},
HAL_ID = {hal-01735826},
HAL_VERSION = {v1},

}

@article{fraigniaud:hal-02001830,
TITLE = {{Noisy rumor spreading and plurality consensus}},
AUTHOR = {Fraigniaud, Pierre and Natale, Emanuele},
URL = {https://hal.archives-ouvertes.fr/hal-02001830},
JOURNAL = {{Distributed Computing}},
PUBLISHER = {{Springer Verlag}},
YEAR = {2018},
MONTH = Jun,
HAL_ID = {hal-02001830},
HAL_VERSION = {v1},

}

@article{giroire:hal-01686641,
TITLE = {{On the Complexity of Compressing Two Dimensional Routing Tables with Order}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Havet, Fr{\'e}d{\'e}ric and Moulierac, Joanna},
URL = {https://hal.inria.fr/hal-01686641},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {80},
NUMBER = {1},
PAGES = {209 - 233},
YEAR = {2018},
MONTH = Jan,
DOI = {10.1007/s00453-016-0243-7},
PDF = {https://hal.inria.fr/hal-01686641/file/compacting.pdf},
HAL_ID = {hal-01686641},
HAL_VERSION = {v1},

}

@article{giroire:hal-01920970,
TITLE = {{Energy-Aware Routing in Software-Defined Network using Compression}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Huin, Nicolas and Moulierac, Joanna and Phan, Truong Khoa},
URL = {https://hal.inria.fr/hal-01920970},
JOURNAL = {{The Computer Journal}},
PUBLISHER = {{Oxford University Press (UK)}},
VOLUME = {61},
NUMBER = {10},
PAGES = {1537 - 1556},
YEAR = {2018},
MONTH = Oct,
DOI = {10.1093/comjnl/bxy029},
KEYWORDS = {Software defined networks ; Energy-aware Routing ; Forwarding tables ; Compression with wildcards ; Algorithms ; Green Networking},
PDF = {https://hal.inria.fr/hal-01920970/file/2018-EAR-compression-COMPJ.pdf},
HAL_ID = {hal-01920970},
HAL_VERSION = {v1},

}

@article{havet:hal-01711403,
TITLE = {{Finding a subdivision of a prescribed digraph of order 4}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Maia, A. Karolinna and Mohar, Bojan},
URL = {https://hal.inria.fr/hal-01711403},
JOURNAL = {{Journal of Graph Theory}},
PUBLISHER = {{Wiley}},
VOLUME = {87},
NUMBER = {4},
PAGES = {536-560},
YEAR = {2018},
MONTH = Apr,
DOI = {10.1002/jgt.22174},
PDF = {https://hal.inria.fr/hal-01711403/file/revised1_JGT.pdf},
HAL_ID = {hal-01711403},
HAL_VERSION = {v1},

}

@article{huin:hal-01920951,
TITLE = {{Optimal Network Service Chain Provisioning}},
AUTHOR = {Huin, Nicolas and Jaumard, Brigitte and Giroire, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-01920951},
JOURNAL = {{IEEE/ACM Transactions on Networking}},
PUBLISHER = {{IEEE/ACM}},
VOLUME = {26},
NUMBER = {3},
PAGES = {1320 - 1333},
YEAR = {2018},
MONTH = Jun,
DOI = {10.1109/TNET.2018.2833815},
KEYWORDS = {Service Function Chains ; Column Generation ; Soft-ware Defined Network ; Network Function Virtualization ; Optimiza-tion},
PDF = {https://hal.inria.fr/hal-01920951/file/2018-TON_NFV_Placement.pdf},
HAL_ID = {hal-01920951},
HAL_VERSION = {v1},

}

@article{huin:hal-01877868,
TITLE = {{Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks}},
AUTHOR = {Huin, N. and Rifai, M. and Giroire, Fr{\'e}d{\'e}ric and Pacheco, D. Lopez and Urvoy-Keller, Guillaume and Moulierac, Joanna},
URL = {https://hal.archives-ouvertes.fr/hal-01877868},
JOURNAL = {{IEEE Transactions on Green Communications and Networking}},
PUBLISHER = {{IEEE}},
PAGES = {1128 - 1139},
YEAR = {2018},
MONTH = May,
DOI = {10.1109/TGCN.2018.2842123},
PDF = {https://hal.archives-ouvertes.fr/hal-01877868/file/journal.pdf},
HAL_ID = {hal-01877868},
HAL_VERSION = {v1},

}

@article{huin:hal-01920960,
TITLE = {{Energy-Efficient Service Function Chain Provisioning}},
AUTHOR = {Huin, Nicolas and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Jaumard, Brigitte},
URL = {https://hal.inria.fr/hal-01920960},
JOURNAL = {{Journal of optical communications and networking}},
PUBLISHER = {{Piscataway, NJ ; Washington, DC : IEEE : Optical Society of America}},
VOLUME = {10},
NUMBER = {3},
YEAR = {2018},
DOI = {10.1364/JOCN.10.000114},
PDF = {https://hal.inria.fr/hal-01920960/file/2018-NFV-Energy-JOCN.pdf},
HAL_ID = {hal-01920960},
HAL_VERSION = {v1},

}

@article{lochet:hal-01835124,
TITLE = {{Immersion of transitive tournaments in digraphs with large minimum outdegree}},
AUTHOR = {Lochet, William},
URL = {https://hal.archives-ouvertes.fr/hal-01835124},
JOURNAL = {{Journal of Combinatorial Theory, Series B}},
PUBLISHER = {{Elsevier}},
PAGES = {4},
YEAR = {2018},
MONTH = May,
DOI = {10.1016/j.jctb.2018.05.004},
KEYWORDS = {Transitive tournaments ; Digraphs ; Immersions},
PDF = {https://hal.archives-ouvertes.fr/hal-01835124/file/immersion_final.pdf},
HAL_ID = {hal-01835124},
HAL_VERSION = {v1},

}

@inproceedings{bensmail:hal-01774827,
TITLE = {{Localiser une cible dans un graphe}},
AUTHOR = {Bensmail, Julien and Mazauric, Dorian and Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-01774827},
BOOKTITLE = {{ALGOTEL 2018 - 20{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Roscoff, France},
YEAR = {2018},
MONTH = May,
KEYWORDS = {Mots-clefs : Graphes ; Dimension M{\'e}trique ; Dimension Centro¨{\i}daleCentro¨{\i}dale ; Jeux dans les graphes},
PDF = {https://hal.inria.fr/hal-01774827/file/algotel_localizationRevised.pdf},
HAL_ID = {hal-01774827},
HAL_VERSION = {v1},

}

@inproceedings{bensmail:hal-01883712,
TITLE = {{Sequential Metric Dimension}},
AUTHOR = {Bensmail, Julien and Mazauric, Dorian and Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-01883712},
BOOKTITLE = {{16th Workshop on Approximation and Online Algorithms (WAOA 2018)}},
ADDRESS = {Helsinki, Finland},
YEAR = {2018},
MONTH = Aug,
KEYWORDS = {metric dimension ; Games in graphs ; complexity},
PDF = {https://hal.inria.fr/hal-01883712/file/localizationWAOA18.pdf},
HAL_ID = {hal-01883712},
HAL_VERSION = {v2},

}

@inproceedings{bermond:hal-01780627,
TITLE = {{How long does it take for all users in a social network to choose their communities?}},
AUTHOR = {Bermond, Jean-Claude and Chaintreau, Augustin and Ducoffe, Guillaume and Mazauric, Dorian},
URL = {https://hal.inria.fr/hal-01780627},
BOOKTITLE = {{9th International Conference on Fun with Algorithms (FUN 2018)}},
ADDRESS = {La Maddalena, Italy},
YEAR = {2018},
KEYWORDS = {graphs ; communities ; social networks ; integer partitions ; coloring games},
PDF = {https://hal.inria.fr/hal-01780627/file/article-funrapport.pdf},
HAL_ID = {hal-01780627},
HAL_VERSION = {v1},

}

@inproceedings{bermond:hal-01960744,
TITLE = {{Gossiping with interference in radio chain networks}},
AUTHOR = {Bermond, Jean-Claude and Kodate, Takako and Yu, Joseph},
URL = {https://hal.inria.fr/hal-01960744},
BOOKTITLE = {{21th Japan Conference on Discrete and Computational Geometry, Graphs, and Games}},
ADDRESS = {Manila, Philippines},
YEAR = {2018},
MONTH = Sep,
PDF = {https://hal.inria.fr/hal-01960744/file/abstractrev.pdf},
HAL_ID = {hal-01960744},
HAL_VERSION = {v1},

}

@inproceedings{caillouet:hal-01850442,
TITLE = {{Optimization of mobile sensor coverage with UAVs}},
AUTHOR = {Caillouet, Christelle and Giroire, Fr{\'e}d{\'e}ric and Razafindralambo, Tahiry},
URL = {https://hal.inria.fr/hal-01850442},
BOOKTITLE = {{11th International Workshop on Wireless Sensor, Robot and UAV Networks (WiSARN@IEEE INFOCOM 2018)}},
ADDRESS = {Honolulu, United States},
YEAR = {2018},
MONTH = Apr,
DOI = {10.1109/INFCOMW.2018.8406980},
PDF = {https://hal.inria.fr/hal-01850442/file/main.pdf},
HAL_ID = {hal-01850442},
HAL_VERSION = {v1},

}

@inproceedings{caillouet:hal-01786010,
TITLE = {{D{\'e}ploiement efficace de drones pour la collecte de donn{\'e}es de capteurs mobiles}},
AUTHOR = {Caillouet, Christelle and Giroire, Fr{\'e}d{\'e}ric and Razafindralambo, Tahiry},
URL = {https://hal.archives-ouvertes.fr/hal-01786010},
BOOKTITLE = {{Rencontres Francophones sur la Conception de Protocoles, l’{\'E}valuation de Performance et l’Exp{\'e}rimentation des R{\'e}seaux de Communication}},
ADDRESS = {Roscoff, France},
YEAR = {2018},
MONTH = May,
PDF = {https://hal.archives-ouvertes.fr/hal-01786010/file/mobileOpt.pdf},
HAL_ID = {hal-01786010},
HAL_VERSION = {v1},

}

@inproceedings{caillouet:hal-01850446,
TITLE = {{Recharging wireless sensor networks using drones and wireless power transfer}},
AUTHOR = {Caillouet, Christelle and Razafindralambo, Tahiry and Zorbas, Dimitrios},
URL = {https://hal.inria.fr/hal-01850446},
BOOKTITLE = {{29th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE PIMRC 2018) Recent Results track}},
ADDRESS = {Bologne, Italy},
YEAR = {2018},
MONTH = Sep,
PDF = {https://hal.inria.fr/hal-01850446/file/PIMRC_conf_2.pdf},
HAL_ID = {hal-01850446},
HAL_VERSION = {v1},

}

@inproceedings{caillouet:hal-01784809,
TITLE = {{Analyse bi-objectif pour la couverture de cibles par des drones}},
AUTHOR = {Caillouet, Christelle and Razafindralambo, Tahiry},
URL = {https://hal.archives-ouvertes.fr/hal-01784809},
BOOKTITLE = {{Rencontres Francophones sur la Conception de Protocoles, l’{\'E}valuation de Performance et l’Exp{\'e}rimentation des R{\'e}seaux de Communication}},
ADDRESS = {Roscoff, France},
YEAR = {2018},
MONTH = May,
PDF = {https://hal.archives-ouvertes.fr/hal-01784809/file/multiobj.pdf},
HAL_ID = {hal-01784809},
HAL_VERSION = {v1},

}

@inproceedings{coudert:hal-01676187,
TITLE = {{Fully polynomial FPT algorithms for some classes of bounded clique-width graphs}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume and Popa, Alexandru},
URL = {https://hal.inria.fr/hal-01676187},
BOOKTITLE = {{ACM-SIAM Symposium on Discrete Algorithms}},
ADDRESS = {New Orleans, United States},
PUBLISHER = {{SIAM}},
PAGES = {20},
YEAR = {2018},
MONTH = Jan,
DOI = {10.1137/1.9781611975031.176},
PDF = {https://hal.inria.fr/hal-01676187/file/P-FPT-2018.pdf},
HAL_ID = {hal-01676187},
HAL_VERSION = {v1},

}

@inproceedings{duong:hal-01930552,
TITLE = {{Efficient Make Before Break Capacity Defragmentation}},
AUTHOR = {Duong, Huy and Jaumard, Brigitte and Coudert, David and Armolavicius, Ron},
URL = {https://hal.inria.fr/hal-01930552},
BOOKTITLE = {{IEEE International Conference on High Performance Switching and Routing}},
ADDRESS = {Bucharest, Romania},
PUBLISHER = {{IEEE}},
PAGES = {6},
YEAR = {2018},
MONTH = Jun,
KEYWORDS = {Network reconfiguration ; rerouting ; defragmentation ; make-before-break},
PDF = {https://hal.inria.fr/hal-01930552/file/HPSR_2018_final.pdf},
HAL_ID = {hal-01930552},
HAL_VERSION = {v1},

}

@inproceedings{duong:hal-01773572,
TITLE = {{Mod{\`e}le d'optimisation pour la d{\'e}fragmentation de la capacit{\'e}}},
AUTHOR = {Duong, Huy and Jaumard, Brigitte and Coudert, David and Armolavicius, Ron},
URL = {https://hal.inria.fr/hal-01773572},
BOOKTITLE = {{ALGOTEL 2018 - 20{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Roscoff, France},
YEAR = {2018},
MONTH = May,
KEYWORDS = {Fragmentation des ressources ; r{\'e}seau optique ; couche utilisateur ; reroutage transparent ; reroutage MBB},
PDF = {https://hal.inria.fr/hal-01773572/file/Algotel_2018_final.pdf},
HAL_ID = {hal-01773572},
HAL_VERSION = {v2},

}

@inproceedings{huin:hal-01779589,
TITLE = {{Optimisation pour le Provisionnement de Cha{\^i}nes de Services R{\'e}seau}},
AUTHOR = {Huin, Nicolas and Jaumard, Brigitte and Giroire, Fr{\'e}d{\'e}ric},
URL = {https://hal.archives-ouvertes.fr/hal-01779589},
BOOKTITLE = {{ALGOTEL 2018 - 20{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Roscoff, France},
YEAR = {2018},
MONTH = May,
KEYWORDS = {SFC ; NFV ; column generation},
PDF = {https://hal.archives-ouvertes.fr/hal-01779589/file/algotel_2018.pdf},
HAL_ID = {hal-01779589},
HAL_VERSION = {v1},

}

@inproceedings{jaumard:hal-01883689,
TITLE = {{Make-Before-Break Wavelength Defragmentation}},
AUTHOR = {Jaumard, Brigitte and Pouya, Hamed and Coudert, David},
URL = {https://hal.inria.fr/hal-01883689},
BOOKTITLE = {{20th International Conference on Transparent Optical Networks (ICTON)}},
ADDRESS = {Bucharest, Romania},
PUBLISHER = {{IEEE}},
PAGES = {5},
YEAR = {2018},
MONTH = Jul,
DOI = {10.1109/ICTON.2018.8473893},
KEYWORDS = {Wavelength Defragmentation ; Seamless Defragmentation ; Make Before Break Rerouting ; Routing and Wavelength Assignment ; Fragmented Network ; Network Reconfiguration},
PDF = {https://hal.inria.fr/hal-01883689/file/ICTON_Defrag_2018.pdf},
HAL_ID = {hal-01883689},
HAL_VERSION = {v1},

}

@inproceedings{tomassilli:hal-01921112,
TITLE = {{Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints}},
AUTHOR = {Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Huin, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-01921112},
BOOKTITLE = {{IEEE INFOCOM 2018 - IEEE Conference on Computer Communications}},
ADDRESS = {Honolulu, United States},
PUBLISHER = {{IEEE}},
YEAR = {2018},
MONTH = Apr,
DOI = {10.1109/INFOCOM.2018.8486275},
PDF = {https://hal.inria.fr/hal-01921112/file/2018-INFOCOM-sfc-approximation-algos.pdf},
HAL_ID = {hal-01921112},
HAL_VERSION = {v1},

}

@inproceedings{tomassilli:hal-01774540,
TITLE = {{Algorithmes d'approximation pour le placement de cha{\^i}nes de fonctions de services avec des contraintes d'ordre}},
AUTHOR = {Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Huin, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.archives-ouvertes.fr/hal-01774540},
BOOKTITLE = {{ALGOTEL 2018 - 20{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Roscoff, France},
YEAR = {2018},
MONTH = May,
KEYWORDS = {Virtualisation des fonctions r{\'e}seaux ; cha{\^i}nes de fonctions de service ; R{\'e}seaux logiciels ; Optimisation},
PDF = {https://hal.archives-ouvertes.fr/hal-01774540/file/algotel_2018.pdf},
HAL_ID = {hal-01774540},
HAL_VERSION = {v1},

}

@inproceedings{tomassilli:hal-01921096,
TITLE = {{Resource Requirements for Reliable Service Function Chaining}},
AUTHOR = {Tomassilli, Andrea and Huin, Nicolas and Giroire, Fr{\'e}d{\'e}ric and Jaumard, Brigitte},
URL = {https://hal.inria.fr/hal-01921096},
BOOKTITLE = {{2018 IEEE International Conference on Communications (ICC 2018)}},
ADDRESS = {Kansas City, United States},
PUBLISHER = {{IEEE}},
YEAR = {2018},
MONTH = May,
DOI = {10.1109/ICC.2018.8422774},
PDF = {https://hal.inria.fr/hal-01921096/file/2018-ICC-sfc-protection.pdf},
HAL_ID = {hal-01921096},
HAL_VERSION = {v1},

}

@inproceedings{tomassilli:hal-01921082,
TITLE = {{Path protection in optical flexible networks with distance-adaptive modulation formats}},
AUTHOR = {Tomassilli, Andrea and Jaumard, Brigitte and Giroire, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-01921082},
BOOKTITLE = {{2018 International Conference on Optical Network Design and Modeling (ONDM)}},
ADDRESS = {Dublin, France},
PUBLISHER = {{IEEE}},
YEAR = {2018},
MONTH = May,
DOI = {10.23919/ONDM.2018.8396102},
PDF = {https://hal.inria.fr/hal-01921082/file/2018-ONDM-RSA_Shared_Protection.pdf},
HAL_ID = {hal-01921082},
HAL_VERSION = {v1},

}

@techreport{bensmail:hal-01717629,
TITLE = {{Sequential Metric Dimension}},
AUTHOR = {Bensmail, Julien and Mazauric, Dorian and Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.archives-ouvertes.fr/hal-01717629},
TYPE = {Research Report},
INSTITUTION = {{Inria}},
YEAR = {2018},
KEYWORDS = {complexity ; Metric dimension ; Games in graphs},
PDF = {https://hal.archives-ouvertes.fr/hal-01717629/file/localization.pdf},
HAL_ID = {hal-01717629},
HAL_VERSION = {v2},

}

@techreport{bensmail:hal-01938290,
TITLE = {{Metric Dimension: from Graphs to Oriented Graphs}},
AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01938290},
TYPE = {Research Report},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France}},
YEAR = {2018},
MONTH = Nov,
KEYWORDS = {Strongly-connected orientations ; Metric dimension ; Resolving sets},
PDF = {https://hal.inria.fr/hal-01938290/file/ori_md_journal_version.pdf},
HAL_ID = {hal-01938290},
HAL_VERSION = {v2},

}

@techreport{clementi:hal-01958994,
TITLE = {{Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise}},
AUTHOR = {Clementi, Andrea and Gual{\`a}, Luciano and Natale, Emanuele and Pasquale, Francesco and Scornavacca, Giacomo and Trevisan, Luca},
URL = {https://hal.inria.fr/hal-01958994},
TYPE = {Research Report},
INSTITUTION = {{CNRS}},
YEAR = {2018},
PDF = {https://hal.inria.fr/hal-01958994/file/main.pdf},
HAL_ID = {hal-01958994},
HAL_VERSION = {v1},

}

@techreport{gausseran:hal-01963270,
TITLE = {{Don't Interrupt Me When You Reconfigure my Service Function Chains}},
AUTHOR = {Gausseran, Adrien and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna},
URL = {https://hal.inria.fr/hal-01963270},
TYPE = {Research Report},
NUMBER = {RR-9241},
INSTITUTION = {{UCA, Inria ; Universit{\'e} de Nice Sophia-Antipolis (UNS) ; CNRS ; UCA,I3S}},
YEAR = {2018},
MONTH = Dec,
KEYWORDS = {Software Defined Networking ; Service Function Chains ; Network Function Virtualization ; Reconfiguration ; SDN (r{\'e}seaux logiciels) ; SFC (cha{\^i}nes de service) ; NFV (fonctions r{\'e}seaux virtuelles)},
PDF = {https://hal.inria.fr/hal-01963270/file/RR-9241.pdf},
HAL_ID = {hal-01963270},
HAL_VERSION = {v2},

}

@techreport{havet:hal-01798795,
TITLE = {{Constrained ear decompositions in graphs and digraphs}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01798795},
TYPE = {Research Report},
INSTITUTION = {{Inria - Sophia Antipolis}},
YEAR = {2018},
PDF = {https://hal.inria.fr/hal-01798795/file/oddEarDec.pdf},
HAL_ID = {hal-01798795},
HAL_VERSION = {v2},

}

@techreport{mcinerney:hal-01790322,
TITLE = {{Eternal Domination in Grids}},
AUTHOR = {Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-01790322},
TYPE = {Research Report},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France}},
YEAR = {2018},
MONTH = May,
KEYWORDS = {Eternal Domination ; Combinatorial Games ; Graphs ; Grids},
PDF = {https://hal.inria.fr/hal-01790322/file/eter_dom_grids_journal.pdf},
HAL_ID = {hal-01790322},
HAL_VERSION = {v3},

}

@techreport{nisse:hal-01814161,
TITLE = {{Network Decontamination}},
AUTHOR = {Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-01814161},
TYPE = {Research Report},
PAGES = {1-30},
INSTITUTION = {{Inria \& Universit{\'e} Nice Sophia Antipolis, CNRS, I3S, Sophia Antipolis, France}},
YEAR = {2018},
KEYWORDS = {Graph Searching ; Computational Complexity ; (Distributed) Graph Algorithms},
PDF = {https://hal.archives-ouvertes.fr/hal-01814161/file/NetworkDecontamination.pdf},
HAL_ID = {hal-01814161},
HAL_VERSION = {v2},

}

@techreport{tomassilli:hal-01676501,
TITLE = {{Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints}},
AUTHOR = {Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Huin, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-01676501},
TYPE = {Research Report},
NUMBER = {RR-9141},
INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur, CNRS, I3S, France ; Inria Sophia Antipolis}},
YEAR = {2018},
MONTH = Jan,
KEYWORDS = {network function virtualization ; service function chaining ; placement ; approximation algorithms ; R{\'e}seaux logiciels ; Optimisation ; Virtualisation des fonctions r{\'e}seaux ; Cha{\^i}nes de fonctions de service},
PDF = {https://hal.inria.fr/hal-01676501/file/RR-9141.pdf},
HAL_ID = {hal-01676501},
HAL_VERSION = {v1},

}

@unpublished{baudon:hal-01839537,
TITLE = {{Edge Weights and Vertex Colours: Minimizing Sum Count}},
AUTHOR = {Baudon, Olivier and Bensmail, Julien and Hocquard, Herv{\'e} and Senhaji, Mohammed and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-01839537},
NOTE = {working paper or preprint},
YEAR = {2018},
MONTH = Jul,
PDF = {https://hal.archives-ouvertes.fr/hal-01839537/file/123sums-1307.pdf},
HAL_ID = {hal-01839537},
HAL_VERSION = {v1},

}

@unpublished{bensmail:hal-01915633,
TITLE = {{More Aspects of Arbitrarily Partitionable Graphs}},
AUTHOR = {Bensmail, Julien and Li, Binlong},
URL = {https://hal.archives-ouvertes.fr/hal-01915633},
NOTE = {working paper or preprint},
YEAR = {2018},
MONTH = Nov,
KEYWORDS = {arbitrarily partitionable graphs ; partition into connected subgraphs ; Hamiltonicity},
PDF = {https://hal.archives-ouvertes.fr/hal-01915633/file/moreAP.pdf},
HAL_ID = {hal-01915633},
HAL_VERSION = {v1},

}

@unpublished{bensmail:hal-01919007,
TITLE = {{On homomorphisms of planar signed graphs and absolute cliques}},
AUTHOR = {Bensmail, Julien and Nandi, Soumen and Roy, Mithun and Sen, Sagnik},
URL = {https://hal.archives-ouvertes.fr/hal-01919007},
NOTE = {working paper or preprint},
YEAR = {2018},
MONTH = Nov,
KEYWORDS = {absolute signed cliques ; planar graphs ; graph homomorphisms ; signed graphs},
PDF = {https://hal.archives-ouvertes.fr/hal-01919007/file/NSS_v7.pdf},
HAL_ID = {hal-01919007},
HAL_VERSION = {v1},

}

@phdthesis{huin:tel-01679263,
TITLE = {{Energy efficient software defined networks}},
AUTHOR = {Huin, Nicolas},
URL = {https://tel.archives-ouvertes.fr/tel-01679263},
NUMBER = {2017AZUR4080},
SCHOOL = {{Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2017},
MONTH = Sep,
KEYWORDS = {Energy aware routing ; Software defined networks ; Virtualization ; {\'E}conomie d'{\'e}nergie ; Routage vert ; R{\'e}seaux pilot{\'e}s par logiciel ; Virtualisation},
TYPE = {Theses},
PDF = {https://tel.archives-ouvertes.fr/tel-01679263/file/2017AZUR4080.pdf},
HAL_ID = {tel-01679263},
HAL_VERSION = {v1},

}

@article{aboulker:hal-01570035,
TITLE = {{Colouring graphs with constraints on connectivity}},
AUTHOR = {Aboulker, Pierre and Brettell, Nick and Havet, Fr{\'e}d{\'e}ric and Marx, D{\'a}niel and Trotignon, Nicolas},
URL = {https://hal.inria.fr/hal-01570035},
JOURNAL = {{Journal of Graph Theory}},
PUBLISHER = {{Wiley}},
VOLUME = {85},
NUMBER = {4},
PAGES = {814-838},
YEAR = {2017},
DOI = {10.1002/jgt.22109},
KEYWORDS = {colouring ; local connectivity ; local edge-connectivity ; Brooks' theorem ; minimally k-connected ; vertex degree},
PDF = {https://hal.inria.fr/hal-01570035/file/colourConnectivity.pdf},
HAL_ID = {hal-01570035},
HAL_VERSION = {v1},

}

@article{albers:hal-01668736,
TITLE = {{Scheduling on power-heterogeneous processors}},
AUTHOR = {Albers, Susanne and Bampis, Evripidis and Letsios, Dimitrios and Lucarelli, Giorgio and Stotz, Richard},
URL = {https://hal.inria.fr/hal-01668736},
JOURNAL = {{Information and Computation}},
PUBLISHER = {{Elsevier}},
VOLUME = {257},
PAGES = {22-33},
YEAR = {2017},
MONTH = Dec,
DOI = {10.1016/j.ic.2017.09.013},
PDF = {https://hal.inria.fr/hal-01668736/file/journal.pdf},
HAL_ID = {hal-01668736},
HAL_VERSION = {v1},

}

@article{barme:hal-01175756,
TITLE = {{On a directed variation of the 1-2-3 and 1-2 Conjectures}},
AUTHOR = {Barme, Emma and Bensmail, Julien and Przybylo, Jakub and Wo{\'z}niak, Mariusz},
URL = {https://hal.archives-ouvertes.fr/hal-01175756},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {217},
NUMBER = {2},
PAGES = {123-131},
YEAR = {2017},
MONTH = Jan,
PDF = {https://hal.archives-ouvertes.fr/hal-01175756/file/luczak-v2.pdf},
HAL_ID = {hal-01175756},
HAL_VERSION = {v3},

}

@article{baudon:hal-00672505,
TITLE = {{Structural properties of recursively partitionable graphs with connectivity 2}},
AUTHOR = {Baudon, Olivier and Bensmail, Julien and Foucaud, Florent and Pilsniak, Monika},
URL = {https://hal.archives-ouvertes.fr/hal-00672505},
JOURNAL = {{Discussiones Mathematicae Graph Theory}},
PUBLISHER = {{University of Zielona G{\'o}ra}},
VOLUME = {37},
PAGES = {89-115},
YEAR = {2017},
MONTH = Feb,
DOI = {10.7151/dmgt.1925},
KEYWORDS = {balloon graph ; graph with connectivity 2 ; online arbitrarily partitionable graph ; recursively arbitrarily partitionable graph ; balloon ; structural properties},
PDF = {https://hal.archives-ouvertes.fr/hal-00672505/file/bbfp12-orbit.pdf},
HAL_ID = {hal-00672505},
HAL_VERSION = {v4},

}

@article{bensmail:hal-01078218,
TITLE = {{Analogues of Cliques for (m,n)-colored Mixed Graphs}},
AUTHOR = {Bensmail, Julien and Duffy, Christopher and Sen, Sagnik},
URL = {https://hal.archives-ouvertes.fr/hal-01078218},
JOURNAL = {{Graphs and Combinatorics}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {33},
NUMBER = {4},
PAGES = {735--750},
YEAR = {2017},
MONTH = May,
DOI = {10.1007/s00373-017-1807-2},
KEYWORDS = {graph homomorphisms ; planar graphs ; colored mixed graphs ; signed graphs ; graph homomorphism ; chromatic number ; clique number},
PDF = {https://hal.archives-ouvertes.fr/hal-01078218/file/BDS_May18.pdf},
HAL_ID = {hal-01078218},
HAL_VERSION = {v3},

}

@article{bensmail:hal-01653334,
TITLE = {{Disjoint cycles of different lengths in graphs and digraphs}},
AUTHOR = {Bensmail, Julien and Harutyunyan, Ararat and Le, Ngoc Khang and Li, Binlong and Lichiardopol, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-01653334},
JOURNAL = {{The Electronic Journal of Combinatorics}},
PUBLISHER = {{Open Journal Systems}},
VOLUME = {24},
NUMBER = {4},
YEAR = {2017},
MONTH = Dec,
KEYWORDS = {minimum degree ; vertex-disjoint cycles ; different lengths},
PDF = {https://hal.archives-ouvertes.fr/hal-01653334/file/distinct-lengths.pdf},
HAL_ID = {hal-01653334},
HAL_VERSION = {v1},

}

@article{bensmail:hal-01629942,
TITLE = {{On q-power cycles in cubic graphs}},
AUTHOR = {Bensmail, Julien},
URL = {https://hal.archives-ouvertes.fr/hal-01629942},
JOURNAL = {{Discussiones Mathematicae Graph Theory}},
PUBLISHER = {{University of Zielona G{\'o}ra}},
VOLUME = {37},
NUMBER = {1},
PAGES = {211 - 220},
YEAR = {2017},
DOI = {10.7151/dmgt.1926},
PDF = {https://hal.archives-ouvertes.fr/hal-01629942/file/qpower-orbit.pdf},
HAL_ID = {hal-01629942},
HAL_VERSION = {v1},

}

@article{bensmail:hal-01629943,
TITLE = {{A Proof of the Bar{\'a}t--Thomassen Conjecture}},
AUTHOR = {Bensmail, Julien and Harutyunyan, Ararat and Le, Tien-Nam and Merker, Martin and Thomass{\'e}, St{\'e}phan},
URL = {https://hal.archives-ouvertes.fr/hal-01629943},
JOURNAL = {{Journal of Combinatorial Theory, Series B}},
PUBLISHER = {{Elsevier}},
VOLUME = {124},
PAGES = {39 - 55},
YEAR = {2017},
MONTH = May,
DOI = {10.1016/j.jctb.2016.12.006},
KEYWORDS = {large edge-connectivity ; Bar{\'a}t-Thomassen Conjecture ; tree-decomposition},
PDF = {https://hal.archives-ouvertes.fr/hal-01629943/file/RevisedVersion.pdf},
HAL_ID = {hal-01629943},
HAL_VERSION = {v1},

}

@article{bensmail:hal-01629938,
TITLE = {{Decomposing graphs into a constant number of locally irregular subgraphs}},
AUTHOR = {Bensmail, Julien and Merker, Martin and Thomassen, Carsten},
URL = {https://hal.archives-ouvertes.fr/hal-01629938},
JOURNAL = {{European Journal of Combinatorics}},
PUBLISHER = {{Elsevier}},
VOLUME = {60},
PAGES = {124 - 134},
YEAR = {2017},
MONTH = Feb,
DOI = {10.1016/j.ejc.2016.09.011},
PDF = {https://hal.archives-ouvertes.fr/hal-01629938/file/LocIrr0709.pdf},
HAL_ID = {hal-01629938},
HAL_VERSION = {v1},

}

@article{bensmail:hal-01629946,
TITLE = {{On oriented cliques with respect to push operation}},
AUTHOR = {Bensmail, Julien and Nandi, Soumen and Sen, Sagnik},
URL = {https://hal.archives-ouvertes.fr/hal-01629946},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {232},
PAGES = {50 - 63},
YEAR = {2017},
MONTH = Dec,
DOI = {10.1016/j.dam.2017.07.037},
KEYWORDS = {oriented graphs ; oriented cliques ; push operation ; planar graphs},
PDF = {https://hal.archives-ouvertes.fr/hal-01629946/file/BNS_DAM_v6.pdf},
HAL_ID = {hal-01629946},
HAL_VERSION = {v1},

}

@article{bensmail:hal-01361482,
TITLE = {{On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture}},
AUTHOR = {Bensmail, Julien and Senhaji, Mohammed and Szabo Lyngsie, Kasper},
URL = {https://hal.archives-ouvertes.fr/hal-01361482},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {19},
NUMBER = {1},
YEAR = {2017},
MONTH = Aug,
KEYWORDS = {equitable edge-weightings ; 1-2-3 Conjecture ; Antimagic Labelling Conjecture},
PDF = {https://hal.archives-ouvertes.fr/hal-01361482/file/123-injective.pdf},
HAL_ID = {hal-01361482},
HAL_VERSION = {v3},

}

@article{blin:hal-01266492,
TITLE = {{Exclusive Graph Searching}},
AUTHOR = {Blin, L{\'e}lia and Burman, Janna and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-01266492},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {77},
NUMBER = {3},
PAGES = {942-969},
YEAR = {2017},
DOI = {10.1007/s00453-016-0124-0},
PDF = {https://hal.archives-ouvertes.fr/hal-01266492/file/ExclusiveGraphSearch.pdf},
HAL_ID = {hal-01266492},
HAL_VERSION = {v1},

}

@article{cohen:hal-01540756,
TITLE = {{Applying clique-decomposition for computing Gromov hyperbolicity}},
AUTHOR = {Cohen, Nathann and Coudert, David and Ducoffe, Guillaume and Lancin, Aur{\'e}lien},
URL = {https://hal.inria.fr/hal-01540756},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {690},
PAGES = {114-139},
YEAR = {2017},
DOI = {10.1016/j.tcs.2017.06.001},
KEYWORDS = {clique-decomposition ; graph algorithms ; outerplanar graphs ; Gromov hyperbolicity},
PDF = {https://hal.inria.fr/hal-01540756/file/CCDL-2017.pdf},
HAL_ID = {hal-01540756},
HAL_VERSION = {v1},

}

@article{cohen:hal-01662565,
TITLE = {{Le d{\'e}fi des 1001 graphes}},
AUTHOR = {Cohen, Nathann and Coudert, David},
URL = {https://hal.inria.fr/hal-01662565},
JOURNAL = {{Interstices}},
PUBLISHER = {{INRIA}},
YEAR = {2017},
MONTH = Dec,
KEYWORDS = {th{\'e}orie des graphes ; cycle hamiltonien ; algorithmes},
HAL_ID = {hal-01662565},
HAL_VERSION = {v1},

}

@article{cohen:hal-01634307,
TITLE = {{Bispindle in strongly connected digraphs with large chromatic number}},
AUTHOR = {Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric and Lochet, William and Lopes, Raul},
URL = {https://hal.inria.fr/hal-01634307},
JOURNAL = {{Electronic Notes in Discrete Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {62},
PAGES = {69 - 74},
YEAR = {2017},
MONTH = Nov,
DOI = {10.1016/j.endm.2017.10.013},
KEYWORDS = {subdivision ; Digraph ; chromatic number},
PDF = {https://hal.inria.fr/hal-01634307/file/template.pdf},
HAL_ID = {hal-01634307},
HAL_VERSION = {v1},

}

@article{dangelo:hal-01326473,
TITLE = {{A unified approach for Gathering and Exclusive Searching on rings under weak assumptions}},
AUTHOR = {D 'angelo, Gianlorenzo and Navarra, Alfredo and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-01326473},
JOURNAL = {{Distributed Computing}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {30},
NUMBER = {1},
PAGES = {17-48},
YEAR = {2017},
PDF = {https://hal.archives-ouvertes.fr/hal-01326473/file/DIST-D-15-00013R3.pdf},
HAL_ID = {hal-01326473},
HAL_VERSION = {v1},

}

@article{dantas:hal-01527023,
TITLE = {{Identifying codes for infinite triangular grids with a finite number of rows}},
AUTHOR = {Dantas, Rennan and Havet, Fr{\'e}d{\'e}ric and Sampaio, Rudini M},
URL = {https://hal.inria.fr/hal-01527023},
JOURNAL = {{Discrete Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {340},
PAGES = {1584 - 1597},
YEAR = {2017},
DOI = {10.1016/j.disc.2017.02.015},
PDF = {https://hal.inria.fr/hal-01527023/file/tri-rudini.pdf},
HAL_ID = {hal-01527023},
HAL_VERSION = {v1},

}

@article{dantas:hal-01634305,
TITLE = {{Minimum density of identifying codes of king grids}},
AUTHOR = {Dantas, Rennan and Sampaio, Rudini and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-01634305},
JOURNAL = {{Electronic Notes in Discrete Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {62},
PAGES = {51 - 56},
YEAR = {2017},
MONTH = Nov,
DOI = {10.1016/j.endm.2017.10.010},
KEYWORDS = {Identifying code ; King grid ; Discharging Method},
PDF = {https://hal.inria.fr/hal-01634305/file/LAGOS-king-code%20%281%29.pdf},
HAL_ID = {hal-01634305},
HAL_VERSION = {v1},

}

@article{giroire:hal-01633813,
TITLE = {{Analysis of the Failure Tolerance of Linear Access Networks}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Maureira, Juan-Carlos},
URL = {https://hal.inria.fr/hal-01633813},
JOURNAL = {{IEEE Transactions on Intelligent Transportation Systems}},
PUBLISHER = {{IEEE}},
PAGES = {1 - 10},
YEAR = {2017},
MONTH = Aug,
DOI = {10.1109/TITS.2017.2718737},
KEYWORDS = {maintenance cost ; Access networks ; failure tolerance ; telecommuting ; connectivity analysis},
PDF = {https://hal.inria.fr/hal-01633813/file/FINAL%20VERSION.pdf},
HAL_ID = {hal-01633813},
HAL_VERSION = {v1},

}

@article{giroire:hal-01620358,
TITLE = {{Maintaining Balanced Trees for Structured Distributed Streaming Systems}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Modrzejewski, Remigiusz and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-01620358},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {232},
PAGES = {176 - 188},
YEAR = {2017},
MONTH = Dec,
DOI = {10.1016/j.dam.2017.07.006},
KEYWORDS = {Peer-to-peer ; Distributed Live Streaming System ; Graph Algorithm ; Balanced Trees},
PDF = {https://hal.inria.fr/hal-01620358/file/Streaming_full_version.pdf},
HAL_ID = {hal-01620358},
HAL_VERSION = {v1},

}

@article{giroire:hal-01634448,
TITLE = {{Grid spanners with low forwarding index for energy efficient networks}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and P{\'e}rennes, St{\'e}phane and Tahiri, Issam},
URL = {https://hal.inria.fr/hal-01634448},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
YEAR = {2017},
MONTH = Mar,
DOI = {10.1016/j.dam.2017.02.021},
KEYWORDS = {grid ; routing ; energy saving ; spanning subgraphs ; forwarding index},
PDF = {https://hal.inria.fr/hal-01634448/file/journal-dam.pdf},
HAL_ID = {hal-01634448},
HAL_VERSION = {v1},

}

@article{jaumard:hal-01738156,
TITLE = {{Cost-effective Bandwidth Provisioning in Microwave Wireless Networks under Unreliable Channel Conditions}},
AUTHOR = {Jaumard, Brigitte and Kaddour, Mejdi and Kodjo, Alvinice and Nepomuceno, Napole{\~a}o and Coudert, David},
URL = {https://hal.inria.fr/hal-01738156},
JOURNAL = {{Pesquisa Operacional}},
PUBLISHER = {{Sociedade Brasileira de Pesquisa Operacional}},
VOLUME = {37},
NUMBER = {3},
PAGES = {525 - 544},
YEAR = {2017},
MONTH = Sep,
DOI = {10.1590/0101-7438.2017.037.03.0525},
KEYWORDS = {column generation ; microwave networks ; mixed-integer linear programming},
PDF = {https://hal.inria.fr/hal-01738156/file/Microwave-PO-HAL.pdf},
HAL_ID = {hal-01738156},
HAL_VERSION = {v1},

}

@article{li:hal-01620389,
TITLE = {{Minimum Size Tree-Decompositions}},
AUTHOR = {Li, Bi and Moataz, Fatima Zahra and Nisse, Nicolas and Suchan, Karol},
URL = {https://hal.inria.fr/hal-01620389},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
YEAR = {2017},
MONTH = Feb,
DOI = {10.1016/j.dam.2017.01.030},
PDF = {https://hal.inria.fr/hal-01620389/file/MSTD-DAM-v3.pdf},
HAL_ID = {hal-01620389},
HAL_VERSION = {v1},

}

@article{markou:hal-01534596,
TITLE = {{Exclusive graph searching vs. pathwidth}},
AUTHOR = {Markou, Euripides and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-01534596},
JOURNAL = {{Information and Computation}},
PUBLISHER = {{Elsevier}},
VOLUME = {252},
PAGES = {243 - 260},
YEAR = {2017},
DOI = {10.1016/j.ic.2016.11.007},
KEYWORDS = {graph searching ; pathwidth},
PDF = {https://hal.inria.fr/hal-01534596/file/journal_revised.pdf},
HAL_ID = {hal-01534596},
HAL_VERSION = {v1},

}

@article{reed:hal-01641019,
TITLE = {{Acyclic edge colourings of graphs with large girth}},
AUTHOR = {Reed, Bruce and Cai, X. and Perarnau, G. and Watts, A. B.},
URL = {https://hal.archives-ouvertes.fr/hal-01641019},
JOURNAL = {{Random Structures \& Algorithms}},
VOLUME = {50},
NUMBER = {4},
PAGES = {511 - 533},
YEAR = {2017},
MONTH = Jul,
DOI = {10.1002/rsa.20695},
HAL_ID = {hal-01641019},
HAL_VERSION = {v1},

}

@article{reed:hal-01641473,
TITLE = {{How to determine if a random graph with a fixed degree sequence has a giant component}},
AUTHOR = {Reed, Bruce and Joos, Felix and Perarnau, Guillem and Rautenbach, Dieter},
URL = {https://hal.archives-ouvertes.fr/hal-01641473},
JOURNAL = {{Probability Theory and Related Fields}},
PUBLISHER = {{Springer Verlag}},
YEAR = {2017},
MONTH = Jan,
DOI = {10.1007/s00440-017-0757-1},
HAL_ID = {hal-01641473},
HAL_VERSION = {v1},

}

@article{reed:hal-01641020,
TITLE = {{Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree}},
AUTHOR = {Reed, Bruce and Perarnau, G.},
URL = {https://hal.archives-ouvertes.fr/hal-01641020},
JOURNAL = {{Combinatorics, Probability and Computing}},
PUBLISHER = {{Cambridge University Press (CUP)}},
VOLUME = {26},
NUMBER = {03},
PAGES = {448 - 467},
YEAR = {2017},
MONTH = May,
DOI = {10.1017/S0963548316000328},
HAL_ID = {hal-01641020},
HAL_VERSION = {v1},

}

@article{reed:hal-01641023,
TITLE = {{Polyhedral results on the stable set problem in graphs containing even or odd pairs}},
AUTHOR = {Reed, Bruce and Witt, Jonas and L{\"u}bbecke, Marco E.},
URL = {https://hal.archives-ouvertes.fr/hal-01641023},
JOURNAL = {{Mathematical Programming}},
PUBLISHER = {{Springer Verlag}},
YEAR = {2017},
MONTH = Jun,
DOI = {10.1007/s10107-017-1168-x},
HAL_ID = {hal-01641023},
HAL_VERSION = {v1},

}

@article{rifai:hal-01576133,
TITLE = {{Minnie : An SDN world with few compressed forwarding rules}},
AUTHOR = {Rifai, Myriana and Huin, Nicolas and Caillouet, Christelle and Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna and Lopez Pacheco, Dino and Urvoy-Keller, Guillaume},
URL = {https://hal.inria.fr/hal-01576133},
JOURNAL = {{Computer Networks}},
PUBLISHER = {{Elsevier}},
VOLUME = {121},
PAGES = {185 - 207},
YEAR = {2017},
MONTH = Jul,
DOI = {10.1016/j.comnet.2017.04.026},
KEYWORDS = {Software Defined Networks ; data center networks ; routing tables ; compression ; TCAM},
PDF = {https://hal.inria.fr/hal-01576133/file/COMPNW_COMNET-D-15-1277.pdf},
HAL_ID = {hal-01576133},
HAL_VERSION = {v1},

}

@article{sahhaf:hal-01547511,
TITLE = {{Routing at Large Scale: Advances and Challenges for Complex Networks}},
AUTHOR = {Sahhaf, Sahel and Tavernier, Wouter and Papadimitriou, Dimitri and Careglio, Davide and Kumar, Alok and Glacet, Christian and Coudert, David and Nisse, Nicolas and F{\`a}brega, Lluis and Vil{\`a}, Pere and Camelo, Miguel and Audenaert, Pieter and Colle, Didier and Demeester, Piet},
URL = {https://hal.inria.fr/hal-01547511},
JOURNAL = {{IEEE Network}},
PUBLISHER = {{Institute of Electrical and Electronics Engineers}},
PAGES = {12 - 22},
YEAR = {2017},
DOI = {10.1109/MNET.2017.1600203},
KEYWORDS = {Complex networks ; Geometric routing ; Compact routing ; Algebraic routing ; Path-vector routing},
PDF = {https://hal.inria.fr/hal-01547511/file/network.pdf},
HAL_ID = {hal-01547511},
HAL_VERSION = {v1},

}

@inproceedings{bensmail:hal-01534598,
TITLE = {{Recovery of disrupted airline operations using k-Maximum Matching in graphs}},
AUTHOR = {Bensmail, Julien and Garnero, Valentin and Nisse, Nicolas and Salch, Alexandre and Weber, Valentin},
URL = {https://hal.inria.fr/hal-01534598},
BOOKTITLE = {{IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS)}},
ADDRESS = {Marseille, France},
SERIES = {Electronic Notes in Discrete Mathematics (IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS))},
VOLUME = {62},
PAGES = {3-8},
YEAR = {2017},
MONTH = Sep,
KEYWORDS = {Graph ; Matching ; Augmenting paths ; Complexity ; Trees},
PDF = {https://hal.inria.fr/hal-01534598/file/LAGOS17.pdf},
HAL_ID = {hal-01534598},
HAL_VERSION = {v1},

}

@inproceedings{berge:hal-01995978,
TITLE = {{The Authorization Policy Existence Problem}},
AUTHOR = {Berg{\'e}, Pierre and Crampton, Jason and Gutin, Gregory and Watrigant, R{\'e}mi},
URL = {https://hal.archives-ouvertes.fr/hal-01995978},
BOOKTITLE = {{CODASPY: Conference on Data and Application Security and Privacy}},
ADDRESS = {Scottsdale, United States},
PUBLISHER = {{ACM Press}},
PAGES = {163-165},
YEAR = {2017},
MONTH = Mar,
DOI = {10.1145/3029806.3029844},
HAL_ID = {hal-01995978},
HAL_VERSION = {v1},

}

@inproceedings{bermond:hal-01963492,
TITLE = {{Gossiping with interference in radio ring networks}},
AUTHOR = {Bermond, Jean-Claude and Kodate, Takako and Yu, Joseph},
URL = {https://hal.inria.fr/hal-01963492},
BOOKTITLE = {{20th Anniversary of Japan Conference on Discrete and Computational Geometry, Graphs, and Games}},
ADDRESS = {TOKYO, Japan},
YEAR = {2017},
MONTH = Aug,
KEYWORDS = {gossiping ; radio networks ; ring ; interference},
PDF = {https://hal.inria.fr/hal-01963492/file/abstract-final2017%20.pdf},
HAL_ID = {hal-01963492},
HAL_VERSION = {v1},

}

@inproceedings{caillouet:hal-01575618,
TITLE = {{Efficient Deployment of Connected Unmanned Aerial Vehicles for Optimal Target Coverage}},
AUTHOR = {Caillouet, Christelle and Razafindralambo, Tahiry},
URL = {https://hal.inria.fr/hal-01575618},
BOOKTITLE = {{GIIS 2017 - Global Information Infrastructure and Networking Symposium}},
ADDRESS = {Saint-Pierre, France},
EDITOR = {IEEE},
YEAR = {2017},
MONTH = Oct,
DOI = {10.1109/GIIS.2017.8169803},
PDF = {https://hal.inria.fr/hal-01575618/file/article_static_conf_2.pdf},
HAL_ID = {hal-01575618},
HAL_VERSION = {v1},

}

@inproceedings{cohen:hal-01571229,
TITLE = {{Complexity Dichotomies for the Minimum $F$-Overlay Problem}},
AUTHOR = {Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric and Mazauric, Dorian and Sau, Ignasi and Watrigant, R{\'e}mi},
URL = {https://hal.inria.fr/hal-01571229},
BOOKTITLE = {{IWOCA: International Workshop on Combinatorial Algorithms}},
ADDRESS = {Newcastle, Australia},
PAGES = {12},
YEAR = {2017},
MONTH = Jul,
KEYWORDS = {Fixed-parameter tractability ; Hypergraph ; Minimum F-Overlay Problem ; NP-completeness},
PDF = {https://hal.inria.fr/hal-01571229/file/iwoca2017-SUBMITTED.pdf},
HAL_ID = {hal-01571229},
HAL_VERSION = {v1},

}

@inproceedings{cohen:hal-01510108,
TITLE = {{Enqu{\^e}ter dans les graphes}},
AUTHOR = {Cohen, Nathann and Martins, N{\'i}colas A and Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane and Sampaio, Rudini},
URL = {https://hal.archives-ouvertes.fr/hal-01510108},
BOOKTITLE = {{ALGOTEL 2017 - 19{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Quiberon, France},
YEAR = {2017},
MONTH = May,
KEYWORDS = {Jeu de Gendarmes et Voleur ; Programmation Lin{\'e}aire ; Mots-clefs : Jeux combinatoires {\`a} deux joueurs dans les graphes},
PDF = {https://hal.archives-ouvertes.fr/hal-01510108/file/algotel_2017_V3.pdf},
HAL_ID = {hal-01510108},
HAL_VERSION = {v1},

}

@inproceedings{cohen:hal-01582091,
TITLE = {{Study of a combinatorial game in graphs through Linear Programming}},
AUTHOR = {Cohen, Nathann and Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-01582091},
BOOKTITLE = {{28th International Symposium on Algorithms and Computation (ISAAC 2017)}},
ADDRESS = {Phuket, Thailand},
YEAR = {2017},
DOI = {10.4230/LIPIcs},
KEYWORDS = {Turn-by-turn games in graphs ; Graph algorithms ; Linear Programming},
PDF = {https://hal.inria.fr/hal-01582091/file/ISAAC2017_revised.pdf},
HAL_ID = {hal-01582091},
HAL_VERSION = {v1},

}

@inproceedings{coudert:hal-01573042,
TITLE = {{A simple approach for lower-bounding the distortion in any Hyperbolic embedding}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume},
URL = {https://hal.inria.fr/hal-01573042},
BOOKTITLE = {{EUROCOMB'17 -- The European Conference on Combinatorics, Graph Theory and Applications}},
ADDRESS = {Vienna, Austria},
PUBLISHER = {{Elsevier}},
VOLUME = {61},
PAGES = {293 - 299},
YEAR = {2017},
MONTH = Aug,
DOI = {10.1016/j.endm.2017.06.051},
KEYWORDS = {Gromov hyperbolicity ; Hyperbolic space ; Cop and Robber games},
PDF = {https://hal.inria.fr/hal-01573042/file/CouDuc--EUROCOMB17.pdf},
HAL_ID = {hal-01573042},
HAL_VERSION = {v1},

}

@inproceedings{coudert:hal-01593041,
TITLE = {{Computing and maximizing the exact reliability of wireless backhaul networks}},
AUTHOR = {Coudert, David and Luedtke, James and Moreno, Eduardo and Priftis, Konstantinos},
URL = {https://hal.inria.fr/hal-01593041},
BOOKTITLE = {{International Network Optimization Conference}},
ADDRESS = {Lisbon, Portugal},
PUBLISHER = {{Elsevier}},
SERIES = {Electronic Notes in Discrete Mathematics},
VOLUME = {64},
PAGES = {85-94},
YEAR = {2017},
MONTH = Feb,
DOI = {10.1016/j.endm.2018.01.010},
KEYWORDS = {Network design ; Backhaul network ; Reliability ; Optimization},
PDF = {https://hal.inria.fr/hal-01593041/file/backhaul.pdf},
HAL_ID = {hal-01593041},
HAL_VERSION = {v1},

}

@inproceedings{ducoffe:hal-01625042,
TITLE = {{On the (di)graphs with (directed) proper connection number two}},
AUTHOR = {Ducoffe, Guillaume and Marinescu-Ghemeci, Ruxandra and POPA, ALEXANDRU},
URL = {https://hal.archives-ouvertes.fr/hal-01625042},
BOOKTITLE = {{IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS)}},
ADDRESS = {Marseille, France},
VOLUME = {62},
PAGES = {237 - 242},
YEAR = {2017},
MONTH = Sep,
DOI = {10.1016/j.endm.2017.10.041},
KEYWORDS = {NP-complete ; proper connection ; digraphs ; bipartite ; even dicycles},
PDF = {https://hal.archives-ouvertes.fr/hal-01625042/file/DMP-LAGOS17-finale.pdf},
HAL_ID = {hal-01625042},
HAL_VERSION = {v1},

}

@inproceedings{ducoffe:hal-01627959,
TITLE = {{Finding cut-vertices in the square roots of a graph}},
AUTHOR = {Ducoffe, Guillaume},
URL = {https://hal.archives-ouvertes.fr/hal-01627959},
BOOKTITLE = {{43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017)}},
ADDRESS = {Eindhoven, Netherlands},
SERIES = {Graph-Theoretic Concepts in Computer Science},
VOLUME = {10520},
PAGES = {234--248},
YEAR = {2017},
MONTH = Jun,
DOI = {10.1007/978-3-319-68705-6\_18},
PDF = {https://hal.archives-ouvertes.fr/hal-01627959/file/Ducoffe-WG17.pdf},
HAL_ID = {hal-01627959},
HAL_VERSION = {v1},

}

@inproceedings{huin:hal-01476018,
TITLE = {{Optimization of Network Service Chain Provisioning}},
AUTHOR = {Huin, Nicolas and Jaumard, Brigitte and Giroire, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-01476018},
BOOKTITLE = {{IEEE International Conference on Communications 2017}},
ADDRESS = {Paris, France},
YEAR = {2017},
MONTH = May,
KEYWORDS = {service function chaining ; SFC ; column generation},
PDF = {https://hal.inria.fr/hal-01476018/file/ICC_2Chaining_Final.pdf},
HAL_ID = {hal-01476018},
HAL_VERSION = {v1},

}

@inproceedings{huin:hal-01595989,
TITLE = {{Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks}},
AUTHOR = {Huin, Nicolas and Rifai, Myriana and Giroire, Fr{\'e}d{\'e}ric and Lopez Pacheco, Dino and Urvoy-Keller, Guillaume and Moulierac, Joanna},
URL = {https://hal.inria.fr/hal-01595989},
BOOKTITLE = {{GLOBECOM 2017 - IEEE Global Communications Conference}},
ADDRESS = {Singapore, Singapore},
PAGES = {7},
YEAR = {2017},
MONTH = Dec,
PDF = {https://hal.inria.fr/hal-01595989/file/PID1202840.pdf},
HAL_ID = {hal-01595989},
HAL_VERSION = {v1},

}

@inproceedings{huin:hal-01513747,
TITLE = {{Energy-Efficient Service Function Chain Provisioning}},
AUTHOR = {Huin, Nicolas and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Jaumard, Brigitte},
URL = {https://hal.inria.fr/hal-01513747},
BOOKTITLE = {{International Network Optimization Conference 2017}},
ADDRESS = {Lisbonne, Portugal},
YEAR = {2017},
MONTH = Feb,
KEYWORDS = {Network Function Virtualization ; Service Function Chains ; Software Defined Networks ; Energy Efficiency ; Optimization ; Column Generation},
PDF = {https://hal.inria.fr/hal-01513747/file/INOC_2017_paper_43.pdf},
HAL_ID = {hal-01513747},
HAL_VERSION = {v1},

}

@techreport{bensmail:hal-01555465,
TITLE = {{On improving matchings in trees, via bounded-length augmentations}},
AUTHOR = {Bensmail, Julien and Garnero, Valentin and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-01555465},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2017},
MONTH = Jul,
KEYWORDS = {trees ; bounded-length augmentations ; maximum matchings},
PDF = {https://hal.archives-ouvertes.fr/hal-01555465/file/v7-matchings.pdf},
HAL_ID = {hal-01555465},
HAL_VERSION = {v1},

}

@techreport{bosek:hal-01620365,
TITLE = {{Localization Game on Geometric and Planar Graphs}},
AUTHOR = {Bosek, Bartlomiej and Gordinowicz, Przemyslaw and Grytczuk, Jaroslaw and Nisse, Nicolas and Sokol, Joanna and Sleszynska-Nowak, Malgorzata},
URL = {https://hal.inria.fr/hal-01620365},
TYPE = {Research Report},
INSTITUTION = {{Inria}},
YEAR = {2017},
PDF = {https://hal.inria.fr/hal-01620365/file/Localization%20Game%20171018.pdf},
HAL_ID = {hal-01620365},
HAL_VERSION = {v1},

}

@techreport{cohen:hal-01463297,
TITLE = {{Spy-Game on graphs: complexity and simple topologies}},
AUTHOR = {Cohen, Nathann and Martins, N{\'i}colas A and Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane and Sampaio, Rudini},
URL = {https://hal.archives-ouvertes.fr/hal-01463297},
TYPE = {Research Report},
INSTITUTION = {{Inria Sophia Antipolis}},
YEAR = {2017},
KEYWORDS = {PSPACE-hard ; Cops and Robber games ; graphs},
PDF = {https://hal.archives-ouvertes.fr/hal-01463297/file/Spygames1.pdf},
HAL_ID = {hal-01463297},
HAL_VERSION = {v1},

}

@techreport{cohen:hal-01462890,
TITLE = {{Study of a combinatorial game in graphs through Linear Programming}},
AUTHOR = {Cohen, Nathann and Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.archives-ouvertes.fr/hal-01462890},
TYPE = {Research Report},
INSTITUTION = {{Inria Sophia Antipolis}},
YEAR = {2017},
KEYWORDS = {Linear Programming ; Cops and Robber games ; Graphs},
PDF = {https://hal.archives-ouvertes.fr/hal-01462890/file/GridsTreesafterISAAC2017.pdf},
HAL_ID = {hal-01462890},
HAL_VERSION = {v2},

}

@techreport{coudert:hal-01562413,
TITLE = {{Fully polynomial FPT algorithms for some classes of bounded clique-width graphs }},
AUTHOR = {Coudert, David and Ducoffe, Guillaume and Popa, Alexandru},
URL = {https://hal.archives-ouvertes.fr/hal-01562413},
TYPE = {Research Report},
PAGES = {1-60},
INSTITUTION = {{Inria - Sophia antipolis ; Universite Cote d'Azur ; University of Bucharest, Faculty of Mathematics and Computer Science ; National Institute for Research and Development in Informatics, Romania}},
YEAR = {2017},
MONTH = Jul,
KEYWORDS = { Fully polynomial FPT ; Graph algorithms ; Hardness in P ; Split decomposition ; Neighbourhood diversity ; Primeval decomposition ; Clique-width ; Modular decomposition},
PDF = {https://hal.archives-ouvertes.fr/hal-01562413/file/pfpt.pdf},
HAL_ID = {hal-01562413},
HAL_VERSION = {v2},

}

@techreport{ducoffe:hal-01477981,
TITLE = {{Finding cut-vertices in the square roots of a graph}},
AUTHOR = {Ducoffe, Guillaume},
URL = {https://hal.archives-ouvertes.fr/hal-01477981},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te d’Azur, Inria, CNRS, I3S, France}},
YEAR = {2017},
MONTH = Feb,
KEYWORDS = {square root ; biconnected components ; clique cutset ; cactus-block graph ; Gallai tree ; cycle-power graph ; circular-arc graph},
PDF = {https://hal.archives-ouvertes.fr/hal-01477981/file/square-root.pdf},
HAL_ID = {hal-01477981},
HAL_VERSION = {v2},

}

@techreport{ducoffe:hal-01491146,
TITLE = {{On the (di)graphs with (directed) proper connection number two}},
AUTHOR = {Ducoffe, Guillaume and Marinescu-Ghemeci, Ruxandra and Popa, Alexandru},
URL = {https://hal.archives-ouvertes.fr/hal-01491146},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te d’Azur, Inria, CNRS, I3S, France ; University of Bucharest, Faculty of Mathematics and Computer Science ; National Institute for Research and Development in Informatics, Romania ; The Research Institute of the University of Bucharest ICUB, Romania}},
YEAR = {2017},
MONTH = Mar,
PDF = {https://hal.archives-ouvertes.fr/hal-01491146/file/directed-proper-connectivity.pdf},
HAL_ID = {hal-01491146},
HAL_VERSION = {v1},

}

@techreport{giroire:hal-01538587,
TITLE = {{The Structured Way of Dealing with Heterogeneous Live Streaming Systems}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Huin, Nicolas and Tomassilli, Andrea},
URL = {https://hal.inria.fr/hal-01538587},
TYPE = {Research Report},
NUMBER = {RR-9070},
PAGES = {25},
INSTITUTION = {{Inria Sophia Antipolis ; Cnrs ; Universite Cote d'Azur}},
YEAR = {2017},
MONTH = Jun,
KEYWORDS = { distributed algorithms ; reliability ; diffusion tree ; protocols ; churn ; peer-to-peer ; video streaming ; pair-{\`a}-pair ; diffusion video en direct ; protocoles ; fiabilit{\'e} ; arbre de diffusion ; algorithmes distribu{\'e}s},
PDF = {https://hal.inria.fr/hal-01538587/file/RR-9070.pdf},
HAL_ID = {hal-01538587},
HAL_VERSION = {v1},

}

@techreport{huin:hal-01445893,
TITLE = {{Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks}},
AUTHOR = {Huin, Nicolas and Rifai, Myriana and Giroire, Fr{\'e}d{\'e}ric and Pacheco, Dino Lopez and Urvoy-Keller, Guillaume and Moulierac, Joanna},
URL = {https://hal.inria.fr/hal-01445893},
TYPE = {Research Report},
NUMBER = {RR-9020},
INSTITUTION = {{INRIA Sophia Antipolis - I3S ; I3S}},
YEAR = {2017},
MONTH = Jan,
KEYWORDS = {Software Defined Network ; energy saving ; energy aware routing ; hybrid network ; packet loss},
PDF = {https://hal.inria.fr/hal-01445893/file/RR-9020.pdf},
HAL_ID = {hal-01445893},
HAL_VERSION = {v1},

}

@techreport{knauer:hal-01612515,
TITLE = {{Computing metric hulls in graphs}},
AUTHOR = {Knauer, Kolja and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01612515},
TYPE = {Research Report},
INSTITUTION = {{Inria - Sophia Antipolis}},
YEAR = {2017},
PDF = {https://hal.inria.fr/hal-01612515/file/DMTCS_Hull_revisedVersionbis.pdf},
HAL_ID = {hal-01612515},
HAL_VERSION = {v3},

}

@misc{nisse:hal-01645160,
TITLE = {{Posters de m{\'e}diation scientifique I : Deux Jeux Combinatoires}},
AUTHOR = {Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01645160},
NOTE = {poster de m{\'e}diation scientifique},
YEAR = {2017},
PDF = {https://hal.inria.fr/hal-01645160/file/CombinatorialGames2.pdf},
HAL_ID = {hal-01645160},
HAL_VERSION = {v1},

}

@misc{nisse:hal-01645165,
TITLE = {{Posters de m{\'e}diation scientifique IV : Jeux dans les Graphes}},
AUTHOR = {Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01645165},
NOTE = {posters de m{\'e}diation scientifiques},
YEAR = {2017},
PDF = {https://hal.inria.fr/hal-01645165/file/Graphes2.pdf},
HAL_ID = {hal-01645165},
HAL_VERSION = {v1},

}

@misc{nisse:hal-01645162,
TITLE = {{Posters de m{\'e}diation scientifique II : Tour de Magie et Binaire}},
AUTHOR = {Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01645162},
NOTE = {Posters de m{\'e}diation scientifiques},
YEAR = {2017},
PDF = {https://hal.inria.fr/hal-01645162/file/Binaire2.pdf},
HAL_ID = {hal-01645162},
HAL_VERSION = {v1},

}

@misc{nisse:hal-01645164,
TITLE = {{Posters de m{\'e}diation scientifique III : R{\'e}seaux de Tri}},
AUTHOR = {Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01645164},
NOTE = {posters de m{\'e}diation scientifique},
YEAR = {2017},
PDF = {https://hal.inria.fr/hal-01645164/file/ReseauDeTri2.pdf},
HAL_ID = {hal-01645164},
HAL_VERSION = {v1},

}

@unpublished{bousquet:hal-01568316,
TITLE = {{A proof of the Erdos-Sands-Sauer-Woodrow conjecture}},
AUTHOR = {Bousquet, Nicolas and Lochet, William and Thomass{\'e}, St{\'e}phan},
URL = {https://hal.archives-ouvertes.fr/hal-01568316},
NOTE = {working paper or preprint},
HAL_LOCAL_REFERENCE = {OSP},
YEAR = {2017},
KEYWORDS = {Erdos-Sands-Sauer-Woodrow conjecture ; tournament ; dominating set},
HAL_ID = {hal-01568316},
HAL_VERSION = {v1},

}

@book{fomin:lirmm-01483703,
TITLE = {{Forewords: Special issue on Theory and Applications of Graph Searching Problems}},
AUTHOR = {Fomin, Fedor V. and Fraigniaud, Pierre and Nisse, Nicolas and Thilikos, Dimitrios M.},
URL = {https://hal-lirmm.ccsd.cnrs.fr/lirmm-01483703},
SERIES = {Theoretical Computer Science - Special Issue on Theory and Applications of Graph Searching Problems},
VOLUME = {655:1},
YEAR = {2016},
MONTH = Dec,
DOI = {10.1016/j.tcs.2016.11.001},
HAL_ID = {lirmm-01483703},
HAL_VERSION = {v1},

}

@phdthesis{ducoffe:tel-01485328,
TITLE = {{Metric properties of large graphs}},
AUTHOR = {Ducoffe, Guillaume},
URL = {https://tel.archives-ouvertes.fr/tel-01485328},
NUMBER = {2016AZUR4134},
SCHOOL = {{Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2016},
MONTH = Dec,
KEYWORDS = {Graph ; Algorithms ; Complexity in P ; Gromov Hyperbolicity ; Treelength ; Treebreadth ; Treewidth ; Coloring games ; Nash equilibrium ; Boolean function learning ; Algorithmes ; Complexit{\'e} dans P ; Hyperbolicit{\'e} ; Jeux de coloration ; {\'E}quilibre de Nash ; Apprentissage de fonction bool{\'e}enne ; Graphe},
TYPE = {Theses},
PDF = {https://tel.archives-ouvertes.fr/tel-01485328/file/2016AZUR4134.pdf},
HAL_ID = {tel-01485328},
HAL_VERSION = {v1},

}

@article{araujo:hal-01238051,
TITLE = {{Energy Efficient Content Distribution}},
AUTHOR = {Araujo, J and Giroire, Fr{\'e}d{\'e}ric and Moulierac, J and Liu, Yi and Modrzejewski, R},
URL = {https://hal.inria.fr/hal-01238051},
JOURNAL = {{The Computer Journal}},
PUBLISHER = {{Oxford University Press (UK)}},
VOLUME = {59},
NUMBER = {2},
PAGES = {192-207},
YEAR = {2016},
MONTH = Feb,
DOI = {10.1093/comjnl/bxv095},
KEYWORDS = {Energy Efficiency ; Integer Linear Programming ; Content Deliv-ery Network ; In-network Caching ; Future Internet},
PDF = {https://hal.inria.fr/hal-01238051/file/compj.pdf},
HAL_ID = {hal-01238051},
HAL_VERSION = {v1},

}

@article{araujo:hal-01338646,
TITLE = {{Proper orientation of cacti}},
AUTHOR = {Araujo, Julio and Havet, Fr{\'e}d{\'e}ric and Linhares Sales, Claudia and Silva, Ana},
URL = {https://hal.inria.fr/hal-01338646},
JOURNAL = {{Journal of Theoretical Computer Science (TCS)}},
PUBLISHER = {{Elsevier}},
VOLUME = {639},
PAGES = {14-25},
YEAR = {2016},
DOI = {10.1016/j.tcs.2016.05.016},
KEYWORDS = {proper orientation ; graph coloring ; cactus graph ; claw-free graph ; planar graph ; block graph},
PDF = {https://hal.inria.fr/hal-01338646/file/proper-cacti-TCS-FINAL.pdf},
HAL_ID = {hal-01338646},
HAL_VERSION = {v1},

}

@article{araujo:hal-01568575,
TITLE = {{Hull number: P5-free graphs and reduction rules}},
AUTHOR = {Araujo, Julio and Morel, Gregory and Sampaio, Leonardo and Soares, Ronan and Weber, Valentin},
URL = {https://hal.archives-ouvertes.fr/hal-01568575},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {210},
PAGES = {171 - 175},
YEAR = {2016},
MONTH = Sep,
HAL_ID = {hal-01568575},
HAL_VERSION = {v1},

}

@article{bangjensen:hal-01346079,
TITLE = {{Finding good 2-partitions of digraphs II. Enumerable properties}},
AUTHOR = {Bang-Jensen, Joergen and Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.archives-ouvertes.fr/hal-01346079},
JOURNAL = {{Journal of Theoretical Computer Science (TCS)}},
PUBLISHER = {{Elsevier}},
VOLUME = {640},
PAGES = {1-19},
YEAR = {2016},
MONTH = Aug,
DOI = {10.1016/j.tcs.2016.05.034},
KEYWORDS = {Feedback vertex set ; Out-branching ; Tournament ; Oriented ; NP-complete ; Polynomial ; Partition ; Splitting digraphs ; Acyclic ; Semicomplete digraph ; 2-Partition ; Minimum degree},
PDF = {https://hal.archives-ouvertes.fr/hal-01346079/file/D2partE.pdf},
HAL_ID = {hal-01346079},
HAL_VERSION = {v1},

}

@article{bangjensen:hal-01360910,
TITLE = {{The complexity of finding arc-disjoint branching flows}},
AUTHOR = {Bang-Jensen, J and Havet, Fr{\'e}d{\'e}ric and Yeo, Anders},
URL = {https://hal.inria.fr/hal-01360910},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {209},
PAGES = {16-26},
YEAR = {2016},
DOI = {10.1016/j.dam.2015.10.012},
PDF = {https://hal.inria.fr/hal-01360910/file/bflows4.pdf},
HAL_ID = {hal-01360910},
HAL_VERSION = {v1},

}

@article{bangjensen:hal-01327015,
TITLE = {{Finding good 2-partitions of digraphs I. Hereditary properties}},
AUTHOR = {Bang-Jensen, J and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.archives-ouvertes.fr/hal-01327015},
JOURNAL = {{Journal of Theoretical Computer Science (TCS)}},
PUBLISHER = {{Elsevier}},
VOLUME = {636},
PAGES = {85--94},
YEAR = {2016},
DOI = {10.1016/j.tcs.2016.05.029},
KEYWORDS = {minimum degree ; 2-partition ; tournament ; out-branching ; feedback vertex set ; oriented ; NP-complete ; polynomial ; partition ; splitting digraphs ; acyclic ; semicomplete digraph},
PDF = {https://hal.archives-ouvertes.fr/hal-01327015/file/D2partH.pdf},
HAL_ID = {hal-01327015},
HAL_VERSION = {v1},

}

@article{bermond:hal-01407591,
TITLE = {{Round weighting problem and gathering in radio networks with symmetrical interference}},
AUTHOR = {Bermond, Jean-Claude and Gomes Huiban , Cristiana and Reyes, Patricio},
URL = {https://hal.archives-ouvertes.fr/hal-01407591},
JOURNAL = {{Discrete Mathematics, Algorithms and Applications}},
PUBLISHER = {{World Scientific Publishing}},
VOLUME = {8},
NUMBER = {2},
PAGES = {1650035 57 pages},
YEAR = {2016},
DOI = {10.1142/S179383091650035X},
KEYWORDS = {Radio networks ; wireless networks ; interference ; grids ; gathering ; bounds ; approximation algorithms.},
HAL_ID = {hal-01407591},
HAL_VERSION = {v1},

}

@article{bermond:hal-01223288,
TITLE = {{Well Balanced Designs for Data Placement}},
AUTHOR = {Bermond, Jean-Claude and Jean-Marie, Alain and Mazauric, Dorian and Yu, Joseph},
URL = {https://hal.inria.fr/hal-01223288},
JOURNAL = {{Journal of Combinatorial Designs}},
PUBLISHER = {{Wiley}},
VOLUME = {24},
NUMBER = {2},
PAGES = {55-76},
YEAR = {2016},
MONTH = Feb,
DOI = {10.1002/jcd.21506},
PDF = {https://hal.inria.fr/hal-01223288/file/revfinal.pdf},
HAL_ID = {hal-01223288},
HAL_VERSION = {v1},

}

@article{coudert:hal-01323301,
TITLE = {{Data center interconnection networks are not hyperbolic}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume},
URL = {https://hal.inria.fr/hal-01323301},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {639},
PAGES = {72-90},
YEAR = {2016},
DOI = {10.1016/j.tcs.2016.05.025},
KEYWORDS = {interconnection network ; data center ; Cayley graph ; greedy routing scheme ; metric embedding ; graph endomorphism ; Gromov hy-perbolicity},
PDF = {https://hal.inria.fr/hal-01323301/file/data-centers--and--hyperbolicity.pdf},
HAL_ID = {hal-01323301},
HAL_VERSION = {v1},

}

@article{coudert:hal-01348965,
TITLE = {{To Approximate Treewidth, Use Treelength!}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01348965},
JOURNAL = {{Siam Journal on Discrete Mathematics}},
PUBLISHER = {{Society for Industrial and Applied Mathematics}},
VOLUME = {30},
NUMBER = {3},
PAGES = {13},
YEAR = {2016},
DOI = {10.1137/15M1034039},
KEYWORDS = {Graph ; Treewidth ; Treelength ; Cycle basis ; Genus},
PDF = {https://hal.inria.fr/hal-01348965/file/treewidth-treelength.pdf},
HAL_ID = {hal-01348965},
HAL_VERSION = {v1},

}

@article{coudert:hal-01220132,
TITLE = {{On the hyperbolicity of bipartite graphs and intersection graphs}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume},
URL = {https://hal.inria.fr/hal-01220132},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {214},
PAGES = {187-195},
YEAR = {2016},
DOI = {10.1016/j.dam.2016.06.017},
KEYWORDS = {biclique graph ; line graph ; clique graph ; Gromov hyperbolicity ; bipartite graph ; intersection graph ; graph power},
PDF = {https://hal.inria.fr/hal-01220132/file/bipartite.pdf},
HAL_ID = {hal-01220132},
HAL_VERSION = {v2},

}

@article{coudert:hal-01266496,
TITLE = {{Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth}},
AUTHOR = {Coudert, David and Mazauric, Dorian and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01266496},
JOURNAL = {{ACM Journal of Experimental Algorithmics}},
VOLUME = {21},
NUMBER = {1},
PAGES = {23},
YEAR = {2016},
DOI = {10.1145/2851494},
PDF = {https://hal.inria.fr/hal-01266496/file/babpw-20151120.pdf},
HAL_ID = {hal-01266496},
HAL_VERSION = {v1},

}

@article{coudert:hal-01053859,
TITLE = {{Combinatorial optimization in networks with Shared Risk Link Groups}},
AUTHOR = {Coudert, David and P{\'e}rennes, St{\'e}phane and Rivano, Herv{\'e} and Voge, Marie-Emilie},
URL = {https://hal.inria.fr/hal-01053859},
TYPE = {Research Report},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {Vol. 18, no 3},
PAGES = {25},
INSTITUTION = {{INRIA}},
YEAR = {2016},
MONTH = May,
KEYWORDS = {colored graphs ; Shared Risk Link Group ; complexity ; algorithms ; Multi-layer networks},
PDF = {https://hal.inria.fr/hal-01053859/file/dmtcs-1420.pdf},
HAL_ID = {hal-01053859},
HAL_VERSION = {v4},

}

@article{nisse:hal-01345240,
TITLE = {{On the Monotonicity of Process Number}},
AUTHOR = {Nisse, Nicolas and Pardo Soares, Ronan},
URL = {https://hal.inria.fr/hal-01345240},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
SERIES = {Discrete Applied Mathematics},
VOLUME = {210},
PAGES = {103-111},
YEAR = {2016},
KEYWORDS = {Graph Searching ; Process Number ; Monotonicity},
PDF = {https://hal.inria.fr/hal-01345240/file/LAGOS-Journal.pdf},
HAL_ID = {hal-01345240},
HAL_VERSION = {v1},

}

@inproceedings{bermond:hal-01435614,
TITLE = {{Bin Packing with Colocations}},
AUTHOR = {Bermond, Jean-Claude and Cohen, Nathann and Coudert, David and Letsios, Dimitrios and Milis, Ioannis and P{\'e}rennes, St{\'e}phane and Zissimopoulos, Vassilis},
URL = {https://hal.inria.fr/hal-01435614},
BOOKTITLE = {{14th International Workshop on Approximation and Online Algorithms (WAOA)}},
ADDRESS = {Aarhus, Denmark},
EDITOR = {Klaus Jansen and Monaldo Mastrolilli},
PUBLISHER = {{Springer}},
VOLUME = {10138},
PAGES = {40-51},
YEAR = {2016},
MONTH = Aug,
DOI = {10.1007/978-3-319-51741-4\_4},
PDF = {https://hal.inria.fr/hal-01435614/file/revjcb.pdf},
HAL_ID = {hal-01435614},
HAL_VERSION = {v1},

}

@inproceedings{bouznif:hal-01346750,
TITLE = {{Minimum-Density Identifying Codes in Square Grids}},
AUTHOR = {Bouznif, Marwane and Havet, Fr{\'e}d{\'e}ric and Preissmann, Myriam},
URL = {https://hal.inria.fr/hal-01346750},
BOOKTITLE = {{11th International Conference, AAIM 2016}},
ADDRESS = {Bergamo, Italy},
ORGANIZATION = {{Riccardo Dondi}},
PUBLISHER = {{Springer}},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {9778},
PAGES = {77-88},
YEAR = {2016},
MONTH = Jul,
DOI = {10.1007/978-3-319-41168-2\_7},
KEYWORDS = {identifying code ; square grid ; discharging method},
PDF = {https://hal.inria.fr/hal-01346750/file/AAIM-grid-code.pdf},
HAL_ID = {hal-01346750},
HAL_VERSION = {v1},

}

@inproceedings{cohen:hal-01411115,
TITLE = {{Subdivisions of oriented cycles in digraphs with large chromatic number}},
AUTHOR = {Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric and Lochet, William and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-01411115},
BOOKTITLE = {{Bordeaux Graph Wokshop 2016}},
ADDRESS = {Bordeaux, France},
PAGES = {85-88},
YEAR = {2016},
MONTH = Nov,
PDF = {https://hal.archives-ouvertes.fr/hal-01411115/file/finalversion.pdf},
HAL_ID = {hal-01411115},
HAL_VERSION = {v1},

}

@inproceedings{cohen:hal-01326446,
TITLE = {{Spy-Game on graphs}},
AUTHOR = {Cohen, Nathann and Hilaire, Mathieu and Martins, Nicolas and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.archives-ouvertes.fr/hal-01326446},
BOOKTITLE = {{8th International Conference on Fun with Algorithms, FUN 2016}},
ADDRESS = {La Maddalena, Maddalena Islands, Italy},
EDITOR = {Erik D. Demaine and Fabrizio Grandoni},
PUBLISHER = {{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {49},
YEAR = {2016},
DOI = {10.4230/LIPIcs.FUN.2016.10},
PDF = {https://hal.archives-ouvertes.fr/hal-01326446/file/SpyGame_FUN_revised.pdf},
HAL_ID = {hal-01326446},
HAL_VERSION = {v1},

}

@inproceedings{coudert:hal-01302470,
TITLE = {{Liens entre sym{\'e}tries et {\'e}tirements de routages dans les r{\'e}seaux d'interconnexions de centres de donn{\'e}es}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume},
URL = {https://hal.archives-ouvertes.fr/hal-01302470},
BOOKTITLE = {{ALGOTEL 2016 - 18{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Bayonne, France},
YEAR = {2016},
MONTH = May,
KEYWORDS = {Mots-clefs : Graphe ; Centre de donn{\'e}es ; Routage g{\'e}om{\'e}trique ; Endomorphisme de graphe ; Hyperbolicit{\'e}},
PDF = {https://hal.archives-ouvertes.fr/hal-01302470/file/art-algotel-DChyp-final.pdf},
HAL_ID = {hal-01302470},
HAL_VERSION = {v1},

}

@inproceedings{dantas:hal-01411109,
TITLE = {{Identifying codes for infinite triangular grids with a finite number of rows}},
AUTHOR = {Dantas, Rennan and Havet, Fr{\'e}d{\'e}ric and Sampaio, Rudini M},
URL = {https://hal.archives-ouvertes.fr/hal-01411109},
BOOKTITLE = {{Bordeaux Graph Workshop 2016}},
ADDRESS = {Bordeaux, France},
YEAR = {2016},
MONTH = Nov,
PDF = {https://hal.archives-ouvertes.fr/hal-01411109/file/Triang-code-BGW.pdf},
HAL_ID = {hal-01411109},
HAL_VERSION = {v1},

}

@inproceedings{ducoffe:hal-01361056,
TITLE = {{The Parallel Complexity of Coloring Games}},
AUTHOR = {Ducoffe, Guillaume},
URL = {https://hal.archives-ouvertes.fr/hal-01361056},
BOOKTITLE = {{9th International Symposium, SAGT 2016}},
ADDRESS = {Liverpool, United Kingdom},
EDITOR = {Martin Gairing and Rahul Savani},
PUBLISHER = {{Springer International Publishing}},
SERIES = {Algorithmic Game Theory},
NUMBER = {9928},
PAGES = {27-39},
YEAR = {2016},
MONTH = Sep,
DOI = {10.1007/978-3-662-53354-3\_3},
PDF = {https://hal.archives-ouvertes.fr/hal-01361056/file/Duc-SAGT16-finale.pdf},
HAL_ID = {hal-01361056},
HAL_VERSION = {v1},

}

@inproceedings{ducoffe:hal-01354996,
TITLE = {{On the Complexity of Computing Treebreadth}},
AUTHOR = {Ducoffe, Guillaume and Legay, Sylvain and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01354996},
BOOKTITLE = {{27th International Workshop on Combinatorial Algorithms, IWOCA 2016}},
ADDRESS = {Helsinki, Finland},
EDITOR = {Veli M{\"a}kinen and Simon J. Puglisi and Leena Salmela},
PUBLISHER = {{Springer International Publishing}},
SERIES = {Combinatorial Algorithms},
NUMBER = {9843},
PAGES = {3-15},
YEAR = {2016},
MONTH = Aug,
DOI = {10.1007/978-3-319-44543-4\_1},
PDF = {https://hal.inria.fr/hal-01354996/file/DLN-IWOCA16.pdf},
HAL_ID = {hal-01354996},
HAL_VERSION = {v1},

}

@inproceedings{giroire:hal-01305116,
TITLE = {{{\'E}tude d'un syst{\`e}me distribu{\'e} de diffusion de vid{\'e}o en direct}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Huin, Nicolas},
URL = {https://hal.inria.fr/hal-01305116},
BOOKTITLE = {{ALGOTEL 2016 - 18{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Bayonne, France},
YEAR = {2016},
MONTH = May,
KEYWORDS = {pair-{\`a}-pair},
PDF = {https://hal.inria.fr/hal-01305116/file/algotel22_camera_ready.pdf},
HAL_ID = {hal-01305116},
HAL_VERSION = {v1},

}

@inproceedings{rifai:hal-01304687,
TITLE = {{MINNIE : enfin un monde SDN sans (trop de) r{\`e}gles}},
AUTHOR = {Rifai, Myriana and Huin, Nicolas and Caillouet, Christelle and Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna and Lopez Pacheco, Dino and Urvoy-Keller, Guillaume},
URL = {https://hal.inria.fr/hal-01304687},
BOOKTITLE = {{ALGOTEL 2016 - 18{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Bayonne, France},
YEAR = {2016},
MONTH = May,
PDF = {https://hal.inria.fr/hal-01304687/file/algotel37_camera_ready.pdf},
HAL_ID = {hal-01304687},
HAL_VERSION = {v1},

}

@techreport{araujo:hal-01394201,
TITLE = {{On interval number in cycle convexity}},
AUTHOR = {Araujo, Julio and Ducoffe, Guillaume and Nisse, Nicolas and Suchan, Karol},
URL = {https://hal.inria.fr/hal-01394201},
TYPE = {Research Report},
INSTITUTION = {{Inria Sophia Antipolis ; I3S}},
YEAR = {2016},
KEYWORDS = {graph ; convexity ; complexity ; dominating set},
PDF = {https://hal.inria.fr/hal-01394201/file/cycleConvexity-DMTCS.pdf},
HAL_ID = {hal-01394201},
HAL_VERSION = {v2},

}

@techreport{araujo:hal-00743248,
TITLE = {{Energy Efficient Content Distribution}},
AUTHOR = {Araujo, Julio and Giroire, Fr{\'e}d{\'e}ric and Liu, Yaning Y.L. and Modrzejewski, Remigiusz and Moulierac, Joanna},
URL = {https://hal.inria.fr/hal-00743248},
TYPE = {Research Report},
NUMBER = {RR-8091},
PAGES = {27},
INSTITUTION = {{INRIA}},
YEAR = {2016},
MONTH = Jan,
KEYWORDS = {Energy Efficiency ; Integer Linear Programming ; Content Delivery Network ; Net- work Cache ; Future Internet},
PDF = {https://hal.inria.fr/hal-00743248/file/report.pdf},
HAL_ID = {hal-00743248},
HAL_VERSION = {v3},

}

@techreport{bangjensen:hal-01279338,
TITLE = {{Finding good 2-partitions of digraphs II. Enumerable properties}},
AUTHOR = {Bang-Jensen, J{{\o}}rgen and Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-01279338},
TYPE = {Research Report},
NUMBER = {RR-8868},
INSTITUTION = {{INRIA Sophia Antipolis - I3S}},
YEAR = {2016},
MONTH = Feb,
PDF = {https://hal.inria.fr/hal-01279338/file/RR-8868.pdf},
HAL_ID = {hal-01279338},
HAL_VERSION = {v1},

}

@techreport{bangjensen:hal-01279332,
TITLE = {{Finding good 2-partitions of digraphs I. Hereditary properties}},
AUTHOR = {Bang-Jensen, J{{\o}}rgen and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-01279332},
TYPE = {Research Report},
NUMBER = {RR-8867},
INSTITUTION = {{INRIA Sophia Antipolis - I3S}},
YEAR = {2016},
MONTH = Feb,
PDF = {https://hal.inria.fr/hal-01279332/file/RR-8867.pdf},
HAL_ID = {hal-01279332},
HAL_VERSION = {v1},

}

@techreport{baudon:hal-01398228,
TITLE = {{On locally irregular decompositions of subcubic graphs}},
AUTHOR = {Baudon, Olivier and Bensmail, Julien and Hocquard, Herv{\'e} and Senhaji, Mohammed and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-01398228},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} de bordeaux ; Universit{\'e} de Nice - Sophia Antipolis}},
YEAR = {2016},
PDF = {https://hal.archives-ouvertes.fr/hal-01398228/file/irr-subcub.pdf},
HAL_ID = {hal-01398228},
HAL_VERSION = {v1},

}

@techreport{baudon:hal-01374427,
TITLE = {{On locally irregular decompositions and the 1-2 Conjecture in digraphs}},
AUTHOR = {Baudon, Olivier and Bensmail, Julien and Przybylo, Jakub and Wo{\'z}niak, Mariusz},
URL = {https://hal.archives-ouvertes.fr/hal-01374427},
TYPE = {Research Report},
INSTITUTION = {{Inria, CNRS, Universit{\'e} de Bordeaux, AGH University}},
YEAR = {2016},
MONTH = Sep,
PDF = {https://hal.archives-ouvertes.fr/hal-01374427/file/12oriented.pdf},
HAL_ID = {hal-01374427},
HAL_VERSION = {v1},

}

@techreport{bermond:hal-01381333,
TITLE = {{Bin packing with colocations}},
AUTHOR = {Bermond, Jean-Claude and Cohen, Nathann and Coudert, David and Letsios, Dimitrios and Milis, Ioannis and P{\'e}rennes, St{\'e}phane and Zissimopoulos, Vassilis},
URL = {https://hal.inria.fr/hal-01381333},
TYPE = {Research Report},
INSTITUTION = {{Inria ; I3S}},
YEAR = {2016},
MONTH = Oct,
PDF = {https://hal.inria.fr/hal-01381333/file/bin-packing-rr.pdf},
HAL_ID = {hal-01381333},
HAL_VERSION = {v1},

}

@techreport{bouznif:hal-01259550,
TITLE = {{Minimum-density identifying codes in square grids}},
AUTHOR = {Bouznif, Marwane and Havet, Fr{\'e}d{\'e}ric and Preissmann, Myriam},
URL = {https://hal.inria.fr/hal-01259550},
TYPE = {Research Report},
NUMBER = {RR-8845},
INSTITUTION = {{INRIA Sophia Antipolis - I3S}},
YEAR = {2016},
MONTH = Jan,
PDF = {https://hal.inria.fr/hal-01259550/file/RR-8845.pdf},
HAL_ID = {hal-01259550},
HAL_VERSION = {v1},

}

@techreport{cohen:hal-01277578,
TITLE = {{Subdivisions of oriented cycles in digraphs with large chromatic number}},
AUTHOR = {Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric and Lochet, William and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01277578},
TYPE = {Research Report},
NUMBER = {RR-8865},
PAGES = {25},
INSTITUTION = {{LRI - CNRS, University Paris-Sud ; LIP - ENS Lyon ; INRIA Sophia Antipolis - I3S}},
YEAR = {2016},
MONTH = Feb,
PDF = {https://hal.inria.fr/hal-01277578/file/RR-8865.pdf},
HAL_ID = {hal-01277578},
HAL_VERSION = {v1},

}

@techreport{cohen:hal-01279339,
TITLE = {{Spy-Game on graphs}},
AUTHOR = {Cohen, Nathann and Hilaire, Mathieu and Martins, Nicolas and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-01279339},
TYPE = {Research Report},
NUMBER = {RR-8869},
INSTITUTION = {{Inria}},
YEAR = {2016},
MONTH = Feb,
PDF = {https://hal.inria.fr/hal-01279339/file/RR-8869.pdf},
HAL_ID = {hal-01279339},
HAL_VERSION = {v1},

}

@techreport{coudert:hal-01393523,
TITLE = {{Distance-preserving orderings in graphs}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume and Nisse, Nicolas and Soto, Mauricio},
URL = {https://hal.inria.fr/hal-01393523},
TYPE = {Research Report},
NUMBER = {RR-8973},
INSTITUTION = {{Inria Sophia Antipolis}},
YEAR = {2016},
KEYWORDS = {bounded treewidth ; distance-preserving elimination ordering ; metric graph theory ; NP-complete ; exact expo- nential algorithm ; integer linear programming},
PDF = {https://hal.inria.fr/hal-01393523/file/RR-8973.pdf},
HAL_ID = {hal-01393523},
HAL_VERSION = {v1},

}

@techreport{coudert:hal-01266147,
TITLE = {{Clique-decomposition revisited}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume},
URL = {https://hal.archives-ouvertes.fr/hal-01266147},
TYPE = {Research Report},
INSTITUTION = {{INRIA Sophia Antipolis - I3S}},
YEAR = {2016},
MONTH = Feb,
KEYWORDS = {planar graphs ; treewidth ; clique-decomposition ; minimal triangulation ; clique-number ; bounded-degree graphs},
PDF = {https://hal.archives-ouvertes.fr/hal-01266147/file/clique-decomposition-revisited.pdf},
HAL_ID = {hal-01266147},
HAL_VERSION = {v1},

}

@techreport{coudert:hal-01394593,
TITLE = {{Computing and maximizing the exact reliability of wireless backhaul networks}},
AUTHOR = {Coudert, David and Luedtke, James and Moreno, Eduardo and Priftis, Konstantinos},
URL = {https://hal.inria.fr/hal-01394593},
TYPE = {Research Report},
PAGES = {9},
INSTITUTION = {{Inria Sophia Antipolis ; I3S}},
YEAR = {2016},
MONTH = Nov,
KEYWORDS = {Network design ; Backhaul network ; Reliability ; Optimization},
PDF = {https://hal.inria.fr/hal-01394593/file/backhaul-rr.pdf},
HAL_ID = {hal-01394593},
HAL_VERSION = {v1},

}

@techreport{coudert:hal-01271838,
TITLE = {{A note on Integer Linear Programming formulations for linear ordering problems on graphs}},
AUTHOR = {Coudert, David},
URL = {https://hal.inria.fr/hal-01271838},
TYPE = {Research Report},
PAGES = {33},
INSTITUTION = {{Inria ; I3S ; Universite Nice Sophia Antipolis ; CNRS}},
YEAR = {2016},
MONTH = Feb,
PDF = {https://hal.inria.fr/hal-01271838/file/cwmip.pdf},
HAL_ID = {hal-01271838},
HAL_VERSION = {v1},

}

@techreport{dantas:hal-01358064,
TITLE = {{Identifying codes for infinite triangular grids with a finite number of rows}},
AUTHOR = {Dantas, Rennan and Havet, Fr{\'e}d{\'e}ric and Sampaio, Rudini},
URL = {https://hal.inria.fr/hal-01358064},
TYPE = {Research Report},
NUMBER = {RR-8951},
INSTITUTION = {{INRIA Sophia Antipolis - I3S}},
YEAR = {2016},
MONTH = Aug,
KEYWORDS = {identifying code ; grid ; discharging method ; m{\'e}thode de d{\'e}chargement ; grille ; code identifiant},
PDF = {https://hal.inria.fr/hal-01358064/file/RR-8951.pdf},
HAL_ID = {hal-01358064},
HAL_VERSION = {v1},

}

@techreport{ducoffe:hal-01254917,
TITLE = {{On computing tree and path decompositions with metric constraints on the bags}},
AUTHOR = {Ducoffe, Guillaume and Legay, Sylvain and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01254917},
TYPE = {Research Report},
NUMBER = {RR-8842},
PAGES = {66},
INSTITUTION = {{INRIA Sophia Antipolis - M{\'e}diterran{\'e}e ; LRI - CNRS, University Paris-Sud}},
YEAR = {2016},
MONTH = Jan,
KEYWORDS = {path-breadth ; k-good tree decompositions ; tree-length ; tree-breadth ; path-length},
PDF = {https://hal.inria.fr/hal-01254917/file/RR-8842.pdf},
HAL_ID = {hal-01254917},
HAL_VERSION = {v1},

}

@techreport{giroire:hal-01296992,
TITLE = {{Energy-Aware Routing in Software-Defined Networks with Table Compression (using Wildcard Rules)}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Huin, Nicolas and Moulierac, Joanna and Phan, Khoa},
URL = {https://hal.inria.fr/hal-01296992},
TYPE = {Research Report},
NUMBER = {RR-8897},
INSTITUTION = {{INRIA Sophia Antipolis - I3S}},
YEAR = {2016},
MONTH = Apr,
KEYWORDS = {energy savings ; backbone networks ; Software Defined Networks ; data center networks ; routing tables ; compression ; TCAM memory ; r\'eseaux programmables ; r\'eseaux de centre de donn\'ees ; table de routage ; m\'emoire TCAM ; {\'e}conomie d'{\'e}nergie ; r{\'e}seau backbone},
PDF = {https://hal.inria.fr/hal-01296992/file/RR-8897.pdf},
HAL_ID = {hal-01296992},
HAL_VERSION = {v1},

}

@techreport{giroire:hal-01308241,
TITLE = {{Analysis of the Failure Tolerance of Linear Access Networks}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Maureira, Juan-Carlos},
URL = {https://hal.inria.fr/hal-01308241},
TYPE = {Research Report},
NUMBER = {RR-8903},
INSTITUTION = {{CNRS, University of Nice Sophia Antipolis, I3S, UMR 7271, COATI, Inria, 06900 Sophia Antipolis, France ; Center of Mathematical Modeling, University of Chile, Chile ; Inria Sophia Antipolis}},
YEAR = {2016},
MONTH = Apr,
KEYWORDS = {Access networks ; failure tolerance ; telecommuting ; connectivity analysis ; maintenance cost},
PDF = {https://hal.inria.fr/hal-01308241/file/RR-8903.pdf},
HAL_ID = {hal-01308241},
HAL_VERSION = {v1},

}

@techreport{huin:hal-01403967,
TITLE = {{Energy-Efficient Service Function Chain Provisioning}},
AUTHOR = {Huin, Nicolas and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Jaumard, Brigitte},
URL = {https://hal.inria.fr/hal-01403967},
TYPE = {Research Report},
NUMBER = {RR-8980},
PAGES = {15},
INSTITUTION = {{Inria Sophia Antipolis ; Universit{\'e} C{\^o}te d'Azur ; Cnrs ; Concordia University}},
YEAR = {2016},
MONTH = Nov,
KEYWORDS = { Column Generation ; Network Function Virtualization ; Service Function Chains ; Software Defined Networks ; Energy Efficiency ; Optimization ; Optimisation ; Efficacit{\'e} {\'e}nerg{\'e}tique ; R{\'e}seaux logiciels ; Virtualisation des fonctions r{\'e}seaux ; Cha{\^i}nes de fonctions de service ; G{\'e}n{\'e}ration de Colonnes},
PDF = {https://hal.inria.fr/hal-01403967/file/RR-8980.pdf},
HAL_ID = {hal-01403967},
HAL_VERSION = {v2},

}

@techreport{rifai:hal-01264387,
TITLE = {{MINNIE: an SDN World with Few Compressed Forwarding Rules}},
AUTHOR = {Rifai, Myriana and Huin, Nicolas and Caillouet, Christelle and Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna and Lopez Pacheco, Dino and Urvoy-Keller, Guillaume},
URL = {https://hal.inria.fr/hal-01264387},
TYPE = {Research Report},
NUMBER = {RR-8848},
INSTITUTION = {{INRIA Sophia-Antipolis ; I3S}},
YEAR = {2016},
MONTH = Jan,
KEYWORDS = {Software Defined Networks ; data center networks ; routing tables ; compression ; TCAM memory},
PDF = {https://hal.inria.fr/hal-01264387/file/RR-8848.pdf},
HAL_ID = {hal-01264387},
HAL_VERSION = {v1},

}

@techreport{tomassilli:hal-01403936,
TITLE = {{Energy-Efficient Service Chains with Network Function Virtualization}},
AUTHOR = {Tomassilli, Andrea and Huin, Nicolas and Giroire, Fr{\'e}d{\'e}ric and Jaumard, Brigitte},
URL = {https://hal.inria.fr/hal-01403936},
TYPE = {Research Report},
NUMBER = {RR-8979},
PAGES = {14},
INSTITUTION = {{Inria Sophia Antipolis ; Universit{\'e} C{\^o}te d'Azur ; Cnrs ; Concordia University}},
YEAR = {2016},
MONTH = Oct,
KEYWORDS = {Optimization ; Energy Efficiency ; Network Function Virtualization ; Service Function Chains ; Software Defined Networks ; Cha{\^i}nes de fonctions de service ; Virtualisation des fonctions r{\'e}seaux ; R{\'e}seaux logiciels ; Efficacit{\'e} {\'e}nerg{\'e}tique ; Optimisation},
PDF = {https://hal.inria.fr/hal-01403936/file/RR-8979.pdf},
HAL_ID = {hal-01403936},
HAL_VERSION = {v1},

}

@patent{hogie:hal-01360649,
TITLE = {{BigGraphs: distributed graph computing}},
AUTHOR = {Hogie, Luc and Syska, Michel and Chleq, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-01360649},
NUMBER = {IDDN.FR.001.410005.000.S.P.2015.000.31235},
ADDRESS = {France},
YEAR = {2016},
MONTH = Sep,
HAL_ID = {hal-01360649},
HAL_VERSION = {v1},

}

@unpublished{aboulker:hal-01412667,
TITLE = {{$\chi$-bounded families of oriented graphs}},
AUTHOR = {Aboulker, Pierre and Bang-Jensen, J{{\o}}rgen and Bousquet, Nicolas and Charbit, Pierre and Havet, Fr{\'e}d{\'e}ric and Maffray, Fr{\'e}d{\'e}ric and Zamora, Jose},
URL = {https://hal.inria.fr/hal-01412667},
NOTE = {working paper or preprint},
YEAR = {2016},
PDF = {https://hal.inria.fr/hal-01412667/file/chiboundDMay17.pdf},
HAL_ID = {hal-01412667},
HAL_VERSION = {v1},

}

@unpublished{jeong:hal-01414864,
TITLE = {{Progressive Tree-like Curvilinear Structure Reconstruction with Structured Ranking Learning and Graph Algorithm}},
AUTHOR = {Jeong, Seong-Gyun and Tarabalka, Yuliya and Nisse, Nicolas and Zerubia, Josiane},
URL = {https://hal.inria.fr/hal-01414864},
NOTE = {working paper or preprint},
YEAR = {2016},
MONTH = Dec,
PDF = {https://hal.inria.fr/hal-01414864/file/jeong2016arxiv.pdf},
HAL_ID = {hal-01414864},
HAL_VERSION = {v1},

}

@phdthesis{bergach:tel-01245958,
TITLE = {{Adaptation of the Fast Fourier Transform processing on hybride integrated CPU/GPU architecture}},
AUTHOR = {BERGACH, Mohamed Amine},
URL = {https://hal.inria.fr/tel-01245958},
NUMBER = {2015NICE4060},
SCHOOL = {{Universit{\'e} Nice Sophia Antipolis}},
YEAR = {2015},
MONTH = Oct,
ABSTRACT = {Multicore architectures Intel Core (IvyBridge, Haswell…) contain both general purpose CPU cores (4) and dedicated GPU cores embedded on the same chip (16 and 40 respectively). As part of the activity of Kontron (the company partially funding this CIFRE scholarship), an important objective is to efficiently compute arrays and sequences of fast Fourier transforms (FFT) such as one finds in radar applications, on this architecture. While native (but proprietary) libraries exist for Intel CPU, nothing is currently available for the GPU part.The aim of the thesis was to define the efficient placement of FFT modules, and to study theoretically the optimal form for grouping computing stages of such FFT according to data locality on a single computing core. This choice should allow processing efficiency, by adjusting the memory size available to the required application data size. Then the multiplicity of cores is exploitable to compute several FFT in parallel, without interference (except for possible bus contention between the CPU and the GPU). We have achieved significant results, both in the implementation of an FFT (1024 points) on a SIMD CPU core, expressed in C, and in the implementation of a FFT of the same size on a GPU SIMT core, then expressed in OpenCL. In addition, our results allow to define rules to automatically synthesize such solutions, based solely on the size of the FFT (more specifically its number of stages), and the size of the local memory for a given computing core. The performances obtained are better than the native Intel library for CPU, and demonstrate a significant gain in consumption on GPU. All these points are detailed in the thesis document.},
ABSTRACT = {Les architectures multi-c{\oe}urs Intel Core (IvyBridge, Haswell,...) contiennent {\`a} la fois des c{\oe}urs CPU g{\'e}n{\'e}ralistes (4), mais aussi des c{\oe}urs d{\'e}di{\'e}s GPU embarqu{\'e}s sur cette m{\^e}me puce (16 et 40 respectivement). Dans le cadre de l'activit{\'e} de la soci{\'e}t{\'e} Kontron (qui participe {\`a} ce financement de nature CIFRE) un objectif important est de calculer efficacement sur cette architecture des tableaux et s{\'e}quences de transform{\'e}es de Fourier rapides (FFT), comme par exemple on en trouve dans des applications radar. Alors que des biblioth{\`e}ques natives (mais propri{\'e}taires) existent chez Intel pour les CPU, rien de tel n'est actuellement disponible pour la partie GPU. L'objectif de la th{\`e}se {\'e}tait donc de d{\'e}finir le placement efficace de modules FFT, en {\'e}tudiant au niveau th{\'e}orique la forme optimale permettant de regrouper des {\'e}tages de calcul d'une telle FFT en fonction de la localit{\'e} des donn{\'e}es sur un c{\oe}ur de calcul unique. Ce choix a priori permet d'esp{\'e}rer une efficacit{\'e} des traitements, en ajustant la taille de la m{\'e}moire disponible {\`a} celles des donn{\'e}es n{\'e}cessaires. Ensuite la multiplicit{\'e} des c{\oe}urs reste exploitable pour disposer plusieurs FFT calcul{\'e}es en parall{\`e}le, sans interf{\'e}rence (sauf contention du bus entre CPU et GPU). Nous avons obtenu des r{\'e}sultats significatifs, tant au niveau de l'implantation d'une FFT (1024 points) sur un c{\oe}ur CPU SIMD, exprim{\'e}e en langage C, que pour l'implantation d'une FFT de m{\^e}me taille sur un c{\oe}ur GPU SIMT, exprim{\'e}e alors en OpenCL. De plus nos r{\'e}sultats permettent de d{\'e}finir des r{\`e}gles pour synth{\'e}tiser automatiquement de telles solutions, en fonction uniquement de la taille de la FFT son nombre d'{\'e}tages plus pr{\'e}cis{\'e}ment), et de la taille de},
KEYWORDS = {FFT ; GPGPU ; CPU ; SIMD ; SIMT ; AAA ; OpenCL},
TYPE = {Theses},
PDF = {https://hal.inria.fr/tel-01245958/file/2015NICE4060.pdf},
HAL_ID = {tel-01245958},
HAL_VERSION = {v2},

}

@phdthesis{moataz:tel-01263512,
TITLE = {{Towards efficient and fault-tolerant optical networks : complexity and algorithms}},
AUTHOR = {Moataz, Fatima Zahra},
URL = {https://tel.archives-ouvertes.fr/tel-01263512},
NUMBER = {2015NICE4077},
SCHOOL = {{Universit{\'e} Nice Sophia Antipolis}},
YEAR = {2015},
MONTH = Oct,
ABSTRACT = {We study in this thesis optimization problems with application in optical networks. The problems we consider are related to fault-tolerance and efficient resource allocation and the results we obtain are mainly related to the computational complexity of these problems. The first part of this thesis is devoted to finding paths and disjoint paths. Finding a path is crucial in all types of networks in order to set up connections and finding disjoint paths is a common approach used to provide some degree of protection against failures in networks. We study these problems under different settings. We first focus on finding paths and node or link-disjoint paths in networks with asymmetric nodes, which are nodes with restrictions on their internal connectivity. Afterwards, we consider networks with star Shared Risk Link Groups (SRLGs) which are groups of links that might fail simultaneously due to a localized event. In these networks, we investigate the problem of finding SRLG-disjoint paths. The second part of this thesis focuses on the problem of Routing and Spectrum Assignment (RSA) in Elastic Optical Networks (EONs). EONs are proposed as the new generation of optical networks and they aim at an efficient and flexible use of the optical resources. RSA is the key problem in EONs and it deals with allocating resources to requests under multiple constraints. We first study the static version of RSA in tree networks. Afterwards, we examine a dynamic version of RSA in which a non-disruptive spectrum defragmentation technique is used. Finally, we present in the appendix another problem that has been studied during this thesis.},
ABSTRACT = {Nous {\'e}tudions dans cette th{\`e}se des probl{\`e}mes d’optimisation avec applications dans les r{\'e}seaux optiques. Les probl{\`e}mes {\'e}tudi{\'e}s sont li{\'e}s {\`a} la tol{\'e}rance aux pannes et {\`a} l’utilisation efficace des ressources. Les r{\'e}sultats obtenus portent principalement sur la complexit{\'e} de calcul de ces probl{\`e}mes. La premi{\`e}re partie de cette th{\`e}se est consacr{\'e}e aux probl{\`e}mes de trouver des chemins et des chemins disjoints. La recherche d’un chemin est essentielle dans tout type de r{\'e}seaux afin d’y {\'e}tablir des connexions et la recherche de chemins disjoints est souvent utilis{\'e}e pour garantir un certain niveau de protection contre les pannes dans les r{\'e}seaux. Nous {\'e}tudions ces probl{\`e}mes dans des contextes diff{\'e}rents. Nous traitons d’abord les probl{\`e}mes de trouver un chemin et des chemins lien ou n{\oe}ud- disjoints dans des r{\'e}seaux avec n{\oe}uds asym{\'e}triques, c’est-{\`a}-dire des n{\oe}uds avec restrictions sur leur connectivit{\'e} interne. Ensuite, nous consid{\'e}rons les r{\'e}seaux avec des groupes de liens partageant un risque (SRLG) en {\'e}toile : ensembles de liens qui peuvent tomber en panne en m{\^e}me temps suite {\`a} un {\'e}v{\'e}nement local. Dans ce type de r{\'e}seaux, nous examinons le probl{\`e}me de recherche des chemins SRLG-disjoints. La deuxi{\`e}me partie de cette th{\`e}se est consacr{\'e}e au probl{\`e}me de routage et d’allocation de spectre (RSA) dans les r{\'e}seaux optiques {\'e}lastiques (EONs). Les EONs sont propos{\'e}s comme la nouvelle g{\'e}n{\'e}ration des r{\'e}seaux optiques et ils visent une utilisation plus efficace et flexible des ressources optiques. Le probl{\`e}me RSA est central dans les EONs. Il concerne l’allocation de ressources aux requ{\^e}tes sous plusieurs contraintes.},
KEYWORDS = {Routing and spectrum assignment ; Tree-decomposition ; Complexity ; Asymmetric nodes ; Forbidden transitions ; Shared risk link group ; Noeuds asym{\'e}triques ; Transitions interdites ; Groupe de liens partageant un risque ; Routage et allocation de spectre ; D{\'e}composition arborescente ; Complexit{\'e}},
TYPE = {Theses},
PDF = {https://tel.archives-ouvertes.fr/tel-01263512/file/2015NICE4077.pdf},
HAL_ID = {tel-01263512},
HAL_VERSION = {v1},

}

@article{agarwal:hal-01245401,
TITLE = {{Unveiling Contacts within Macro-molecular assemblies by solving Minimum Weight Connectivity Inference Problems}},
AUTHOR = {Agarwal, Deepesh and Caillouet, Christelle and Coudert, David and Cazals, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-01245401},
JOURNAL = {{Molecular and Cellular Proteomics}},
PUBLISHER = {{American Society for Biochemistry and Molecular Biology}},
VOLUME = {14},
PAGES = {2274-2284},
YEAR = {2015},
MONTH = Apr,
DOI = {10.1074/mcp.M114.047779},
ABSTRACT = {Consider a set of oligomers listing the subunits involved in sub-complexes of a macro-molecular assembly, obtained e.g. using native mass spectrometry or affinity purification. Given these oligomers, connectivity inference (CI) consists of finding the most plausible contacts between these subunits, and minimum connectivity inference (MCI) is the variant consisting of finding a set of contacts of smallest cardinality. MCI problems avoid speculating on the total number of contacts, but yield a subset of all contacts and do not allow exploiting a priori information on the likelihood of individual contacts. In this context, we present two novel algorithms, MILP-W and MILP-WB. The former solves the minimum weight connectivity inference (MWCI), an optimization problem whose criterion mixes the number of contacts and their likelihood. The latter uses the former in a bootstrap fashion, to improve the sensitivity and the specificity of solution sets. Experiments on three systems (yeast exosome, yeast proteasome lid, human eiF3), for which reference contacts are known (crystal structure, cryo electron microscopy, cross-linking), show that our algorithms predict contacts with high specificity and sensitivity, yielding a very significant improvement over previous work, typically a twofold increase in sensitivity. The software accompanying this paper is made available, and should prove of ubiquitous interest whenever connectivity inference from oligomers is faced.},
KEYWORDS = {Biophysics ; Bioinformatics ; Mathematical Modeling ; connectivity inference ; Algorithms ; Mass Spectrometry ; Structural Biology},
PDF = {https://hal.inria.fr/hal-01245401/file/mwci.pdf},
HAL_ID = {hal-01245401},
HAL_VERSION = {v2},

}

@article{amini:hal-01132032,
TITLE = {{Non-deterministic graph searching in trees}},
AUTHOR = {Amini, Omid and Coudert, David and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01132032},
JOURNAL = {{Journal of Theoretical Computer Science (TCS)}},
PUBLISHER = {{Elsevier}},
VOLUME = {580},
PAGES = {101-121},
YEAR = {2015},
MONTH = May,
DOI = {10.1016/j.tcs.2015.02.038},
ABSTRACT = {Non-deterministic graph searching was introduced by Fomin et al. to provide a unified approach for pathwidth, treewidth, and their interpretations in terms of graph searching games. Given q $\ge$ 0, the q-limited search number, s q (G), of a graph G is the smallest number of searchers required to capture an invisible fugitive in G, when the searchers are allowed to know the position of the fugitive at most q times. The search parameter s 0 (G) corresponds to the pathwidth of a graph G, and s $\infty$ (G) to its treewidth. Determining s q (G) is NP-complete for any fixed q $\ge$ 0 in general graphs and s 0 (T) can be computed in linear time in trees, however the complexity of the problem on trees has been unknown for any q \textgreater{} 0. We introduce a new variant of graph searching called restricted non-deterministic. The corresponding parameter is denoted by rs q and is shown to be equal to the non-deterministic graph searching parameter s q for q = 0, 1, and at most twice s q for any q $\ge$ 2 (for any graph G). Our main result is a polynomial time algorithm that computes rs q (T) for any tree T and any q $\ge$ 0. This provides a 2-approximation of s q (T) for any tree T , and shows that the decision problem associated to s 1 is polynomial in the class of trees. Our proofs are based on a new decomposition technique for trees which might be of independent interest.},
KEYWORDS = {Pathwidth ; Trees ; Graph Searching ; Treewidth},
PDF = {https://hal.inria.fr/hal-01132032/file/ACN15.pdf},
HAL_ID = {hal-01132032},
HAL_VERSION = {v1},

}

@article{araujo:hal-01101578,
TITLE = {{On the proper orientation number of bipartite graphs}},
AUTHOR = {Araujo, Julio and Cohen, Nathann and De Rezende, Susanna F. and Havet, Fr{\'e}d{\'e}ric and Moura, Phablo},
URL = {https://hal.archives-ouvertes.fr/hal-01101578},
JOURNAL = {{Journal of Theoretical Computer Science (TCS)}},
PUBLISHER = {{Elsevier}},
VOLUME = {566},
PAGES = {59-75},
YEAR = {2015},
MONTH = Feb,
DOI = {10.1016/j.tcs.2014.11.037},
ABSTRACT = {An {\it orientation} of a graph $G$ is a digraph $D$ obtained from $G$ by replacing each edge by exactly one of the twopossible arcs with the same endvertices.For each $v \in V(G)$, the \emph{indegree} of $v$ in $D$, denoted by $d^-\_D(v)$, is the number of arcs with head $v$ in $D$.An orientation $D$ of $G$ is \emph{proper} if $d^-\_D(u)\neq d^-\_D(v)$, for all $uv\in E(G)$.The \emph{proper orientation number} of a graph $G$, denoted by $po(G)$, is the minimum of the maximumindegree over all its proper orientations. In this paper, we prove that $po(G) \leq \left(\Delta(G) + \sqrt{\Delta(G)}\right)/2 + 1$ if $G$ is a bipartite graph, and $po(G)\leq 4$ if $G$ is a tree.% Moreover, we show that deciding whether the proper orientation number is at most~2 and at most~3 % is an $NP$-complete problem for planar subcubic graphs and planar bipartite graphs, respectively. It is well-known that $po(G)\leq \Delta(G)$, for every graph $G$.However, we prove that deciding whether $po(G)\leq \Delta(G)-1$ is already an $NP$-complete problem on graphs with $\Delta(G) = k$, for every $k \geq 3$.We also show that it is $NP$-complete to decide whether $po(G)\leq 2$, for planar \emph{subcubic} graphs $G$. Moreover, we prove that it is $NP$-complete to decide whether $po(G)\leq 3$, for planar bipartite graphs $G$ with maximum degree 5.},
HAL_ID = {hal-01101578},
HAL_VERSION = {v1},

}

@article{araujo:hal-01246205,
TITLE = {{Steinberg-like theorems for backbone colouring}},
AUTHOR = {Araujo, Julio and Havet, Fr{\'e}d{\'e}ric and Schmitt, Mathieu},
URL = {https://hal.inria.fr/hal-01246205},
JOURNAL = {{Electronic Notes in Discrete Mathematics}},
PUBLISHER = {{Elsevier}},
SERIES = {LAGOS'15 -- VIII Latin-American Algorithms, Graphs and Optimization Symposium},
PAGES = {223-229},
YEAR = {2015},
MONTH = Dec,
ABSTRACT = {A function f:V(G)$\rightarrow${1,…,k}f:V(G)$\rightarrow${1,…,k} is a (proper) k-colouring of G if |f(u)--f(v)|$\ge$1|f(u)--f(v)|$\ge$1, for every edge uv$\in$E(G)uv$\in$E(G). The chromatic number $\chi$(G)$\chi$(G) is the smallest integer k for which there exists a proper k-colouring of G.Given a graph G and a subgraph H of G, a circular q-backbone k-colouring c of (G, H) is a k-colouring of G such that q$\le$|c(u)--c(v)|$\le$k--qq$\le$|c(u)--c(v)|$\le$k--q, for each edge uv$\in$E(H)uv$\in$E(H). The circular q-backbone chromatic number of a graph pair (G, H ), denoted CBCq(G,H)CBCq(G,H), is the minimum k such that (G, H) admits a circular q-backbone k-colouring.In this work, we first show that if G is a planar graph containing no cycle on 4 or 5 vertices and H$\subseteq$GH$\subseteq$G is a forest, then CBC2(G,H)$\le$7CBC2(G,H)$\le$7. Then, we prove that if H$\subseteq$GH$\subseteq$G is a forest whose connected components are paths, then CBC2(G,H)$\le$6CBC2(G,H)$\le$6.},
KEYWORDS = { Graph Colouring ; Planar Graph ; Backbone Colouring ; Steinberg's Conjecture},
PDF = {https://hal.inria.fr/hal-01246205/file/backbone-steinberg-dam.pdf},
HAL_ID = {hal-01246205},
HAL_VERSION = {v1},

}

@article{bangjensen:hal-01111374,
TITLE = {{Finding a subdivision of a digraph}},
AUTHOR = {Bang-Jensen, J{{\o}}rgen and Havet, Fr{\'e}d{\'e}ric and MAIA DE OLIVEIRA, Ana Karolinna},
URL = {https://hal.inria.fr/hal-01111374},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {562},
PAGES = {20},
YEAR = {2015},
ABSTRACT = {We consider the following problem for oriented graphs and digraphs: Given a directed graph D, does it contain a subdivision of a prescribed digraph F? We give a number of examples of polynomial instances, several NP-completeness proofs as well as a number of conjectures and open problems.},
PDF = {https://hal.inria.fr/hal-01111374/file/subdivision.pdf},
HAL_ID = {hal-01111374},
HAL_VERSION = {v1},

}

@article{becker:hal-01163186,
TITLE = {{Allowing each node to communicate only once in a distributed system: shared whiteboard models}},
AUTHOR = {Becker, Florent and Kosowski, Adrian and Matamala, Martin and Nisse, Nicolas and Rapaport, Ivan and Suchan, Karol and Todinca, Ioan},
URL = {https://hal.inria.fr/hal-01163186},
JOURNAL = {{Distributed Computing}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {28},
NUMBER = {3},
PAGES = {189-200},
YEAR = {2015},
DOI = {10.1007/s00446-014-0221-8},
ABSTRACT = {In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and links may indicate telephone calls). Since such graphs are massive they need to be processed in a distributed way. When computing graph-theoretic properties, nodes become natural units for distributed computation. Links do not necessarily represent communication channels between the computing units and therefore do not restrict the communication flow. Our goal is to model and analyze the computational power of such distributed systems where one computing unit is assigned to each node. Communication takes place on a whiteboard where each node is allowed to write at most one message. Every node can read the contents of the whiteboard and, when activated, can write one small message based on its local knowledge. When the protocol terminates its output is computed from the final contents of the whiteboard. We describe four synchronization models for accessing the whiteboard. We show that message size and synchronization power constitute two orthogonal hierarchies for these systems.We exhibit problems that separate these models, i.e., that can be solved in one model but not in a weaker one, even with increased message size. These problems are related to maximal independent set and connectivity. We also exhibit problems that require a given message size independently of the synchronization model.},
PDF = {https://hal.inria.fr/hal-01163186/file/article%20-vHAL.pdf},
HAL_ID = {hal-01163186},
HAL_VERSION = {v1},

}

@article{bermond:hal-01132216,
TITLE = {{Finding disjoint paths in networks with star shared risk link groups}},
AUTHOR = {Bermond, Jean-Claude and Coudert, David and D 'angelo, Gianlorenzo and Zahra Moataz, Fatima},
URL = {https://hal.inria.fr/hal-01132216},
JOURNAL = {{Journal of Theoretical Computer Science (TCS)}},
PUBLISHER = {{Elsevier}},
VOLUME = {579},
PAGES = {74-87},
YEAR = {2015},
MONTH = May,
DOI = {10.1016/j.tcs.2015.02.012},
ABSTRACT = {The notion of Shared Risk Link Groups (SRLG) has been introduced to capture surviv-ability issues where some links of a network fail simultaneously. In this context, the k-diverse routing problem is to find a set of k pairwise SRLG-disjoint paths between a given pair of end nodes of the network. This problem has been proven NP-complete in general and some polynomial instances have been characterized. In this paper, we investigate the k-diverse routing problem in networks where the SRLGs are localized and satisfy the star property. This property states that a link may be subject to several SRLGs, but all links subject to a given SRLG are incident to a common node. We first provide counterexamples to the polynomial time algorithm proposed by X. Luo and B. Wang (DRCN'05) for computing a pair of SRLG-disjoint paths in networks with SRLGs satisfying the star property, and then prove that this problem is in fact NP-complete. We then characterize instances that can be solved in polynomial time or are fixed parameter tractable, in particular when the number of SRLGs is constant, the maximum degree of the vertices is at most 4, and when the network is a directed acyclic graph. Finally we consider the problem of finding the maximum number of SRLG-disjoint paths in networks with SRLGs satisfying the star property. We prove that this problem is NP-hard to approximate within O(|V | 1--$\epsilon$) for any 0 \textless{} $\epsilon$ \textless{} 1, where V is the set of nodes in the network. Then, we provide exact and approximation algorithms for relevant subcases.},
KEYWORDS = {Diverse routing ; Shared Risk Link Group ; Complexity ; Algorithms ; Disjoint paths ; Colored graph},
PDF = {https://hal.inria.fr/hal-01132216/file/BCDM15.pdf},
HAL_ID = {hal-01132216},
HAL_VERSION = {v1},

}

@article{bermond:hal-01084996,
TITLE = {{Data gathering and personalized broadcasting in radio grids with interference}},
AUTHOR = {Bermond, Jean-Claude and Li, Bi and Nisse, Nicolas and Rivano, Herv{\'e} and Yu, Min-Li},
URL = {https://hal.inria.fr/hal-01084996},
JOURNAL = {{Journal of Theoretical Computer Science (TCS)}},
PUBLISHER = {{Elsevier}},
VOLUME = {562},
PAGES = {453-475},
YEAR = {2015},
DOI = {10.1016/j.tcs.2014.10.029},
ABSTRACT = {In the gathering problem, a particular node in a graph, the base station , aims at receiving messages from some nodes in the graph. At each step, a node can send one message to one of its neighbors (such an action is called a call ). However, a node cannot send and receive a message during the same step. Moreover, the communication is subject to interference constraints, more precisely, two calls interfere in a step, if one sender is at distance at most dI from the other receiver. Given a graph with a base station and a set of nodes having some messages, the goal of the gathering problem is to compute a schedule of calls for the base station to receive all messages as fast as possible, i.e., minimizing the number of steps (called makespan). The gathering problem is equivalent to the personalized broadcasting problem where the base station has to send messages to some nodes in the graph, with same transmission constraints.In this paper, we focus on the gathering and personalized broadcasting problem in grids. Moreover, we consider the non-buffering model: when a node receives a message at some step, it must transmit it during the next step. In this setting, though the problem of determining the complexity of computing the optimal makespan in a grid is still open, we present linear (in the number of messages) algorithms that compute schedules for gathering with dI$\in${0,1,2}. In particular, we present an algorithm that achieves the optimal makespan up to an additive constant 2 when dI=0. If no messages are "close" to the axes (the base station being the origin), our algorithms achieve the optimal makespan up to an additive constant 1 when dI=0, 4 when dI=2, and 3 when both dI=1 and the base station is in a corner. Note that, the approximation algorithms that we present also provide approximation up to a ratio 2 for the gathering with buffering. All our results are proved in terms of personalized broadcasting.},
KEYWORDS = {Gathering ; Personalized broadcasting ; Interference ; Grid ; Radio networks},
PDF = {https://hal.inria.fr/hal-01084996/file/tcs_bermond_li_nisse_rivano_yu.pdf},
HAL_ID = {hal-01084996},
HAL_VERSION = {v1},

}

@article{cohen:hal-01182890,
TITLE = {{On computing the Gromov hyperbolicity}},
AUTHOR = {Cohen, Nathann and Coudert, David and Lancin, Aur{\'e}lien},
URL = {https://hal.inria.fr/hal-01182890},
JOURNAL = {{ACM Journal on Experimental Algorithmics}},
PUBLISHER = {{Association for Computing Machinery}},
VOLUME = {20},
NUMBER = {1},
PAGES = {18},
YEAR = {2015},
DOI = {10.1145/2780652},
ABSTRACT = {The Gromov hyperbolicity is an important parameter for analyzing complex networks which expresses how the metric structure of a network looks like a tree. It is for instance used to provide bounds on the expected stretch of greedy-routing algorithms in Internet-like graphs. However, the best known theoretical algorithm computing this parameter runs in O(n^3.69) time, which is prohibitive for large-scale graphs. In this paper, we propose an algorithm for determining the hyperbolicity of graphs with tens of thousands of nodes. Its running time depends on the distribution of distances and on the actual value of the hyperbolicity. Although its worst case runtime is O(n^4), it is in practice much faster than previous proposals as observed in our experimentations. Finally, we propose a heuristic algorithm that can be used on graphs with millions of nodes. Our algorithms are all evaluated on benchmark instances.},
KEYWORDS = {Algorithms ; Gromov Hyperbolicity ; Networks},
PDF = {https://hal.inria.fr/hal-01182890/file/CCL15-no-format.pdf},
HAL_ID = {hal-01182890},
HAL_VERSION = {v1},

}

@article{coudert:hal-01155639,
TITLE = {{Robust Energy-aware Routing with Redundancy Elimination}},
AUTHOR = {Coudert, David and Kodjo, Alvinice and Phan, Truong Khoa},
URL = {https://hal.inria.fr/hal-01155639},
JOURNAL = {{Computers and Operations Research}},
VOLUME = {64},
PAGES = {21},
YEAR = {2015},
MONTH = Dec,
DOI = {10.1016/j.cor.2015.05.008},
ABSTRACT = {Many studies in literature have shown that energy-aware routing (EAR) can significantly reduce energy consumption for backbone networks. Also, as an arising concern in networking research area, the protocol-independent traffic redundancy elimination (RE) technique helps to reduce (a.k.a compress) traffic load on backbone network. Motivation from a formulation perspective, we first present an extended model of the classical multi-commodity flow problem with compressible flows. Moreover, our model is robust with fluctuation of traffic demand and compression rate. In details, we allow any set of a predefined size of traffic flows to deviate simultaneously from their nominal volumes or compression rates. As an applicable example, we use this model to combine redundancy elimination and energy-aware routing to increase energy efficiency for a backbone network. Using this extra knowledge on the dynamics of the traffic pattern, we are able to significantly increase energy efficiency for the network. We formally define the problem and model it as a Mixed Integer Linear Program (MILP). We then propose an efficient heuristic algorithm that is suitable for large networks. Simulation results with real traffic traces on Abilene, Geant and Germany50 networks show that our approach allows for 16-28% extra energy saving with respect to the classical EAR model.},
KEYWORDS = {Robust Network Optimization ; Green Networking ; Energy-aware Routing ; Redundancy Elimination},
PDF = {https://hal.inria.fr/hal-01155639/file/CKP15.pdf},
HAL_ID = {hal-01155639},
HAL_VERSION = {v1},

}

@article{dangelo:hal-01168428,
TITLE = {{Computing on rings by oblivious robots: a unified approach for different tasks}},
AUTHOR = {d'Angelo, Gianlorenzo and Di Stefano, Gabriele and Navarra, Alfredo and Nisse, Nicolas and Suchan, Karol},
URL = {https://hal.inria.fr/hal-01168428},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {72},
NUMBER = {4},
PAGES = {1055-1096},
YEAR = {2015},
ABSTRACT = {A set of autonomous robots have to collaborate in order to accomplish a common task in a ring-topology where neither nodes nor edges are labeled (that is, the ring is anonymous). We present a unified approach to solve three important problems: the exclusive perpetual exploration, the exclusive perpetual clearing, and the gathering problems. In the first problem, each robot aims at visiting each node infinitely often while avoiding that two robots occupy a same node (exclusivity property); in exclusive perpetual clearing (also known as searching), the team of robots aims at clearing the whole ring infinitely often (an edge is cleared if it is traversed by a robot or if both its endpoints are occupied); and in the gathering problem, all robots must eventually occupy the same node. We investigate these tasks in the Look-Compute-Move model where the robots cannot communicate but can perceive the positions of other robots. Each robot is equipped with visibility sensors and motion actuators, and it operates in asynchronous cycles. In each cycle, a robot takes a snapshot of the current global configuration (Look), then, based on the perceived configuration, takes a decision to stay idle or to move to one of its adjacent nodes (Compute), and in the latter case it eventually moves to this neighbor (Move). Moreover, robots are endowed with very weak capabilities. Namely, they are anonymous, asynchronous, oblivious, uniform (execute the same algorithm) and have no common sense of orientation. In this setting, we devise algorithms that, starting from an exclusive and rigid (i.e. aperiodic and asymmetric) configuration, solve the three above problems in anonymous ring-topologies.},
PDF = {https://hal.inria.fr/hal-01168428/file/ring-asym-journal.pdf},
HAL_ID = {hal-01168428},
HAL_VERSION = {v1},

}

@article{delmas:hal-01111370,
TITLE = {{Design of fault-tolerant on-board networks with variable switch sizes}},
AUTHOR = {Delmas, Olivier and Havet, Fr{\'e}d{\'e}ric and Montassier, Micka{\"e}l},
URL = {https://hal.inria.fr/hal-01111370},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {562},
PAGES = {15},
YEAR = {2015},
ABSTRACT = {An \emph{$(n,k,r)$-network} is a triple $N=(G,\inp,\outp)$ where $G=(V,E)$is a graph and $\inp,\outp$ are non-negative integer functions defined on $V$ calledthe \emph{input} and \emph{output} functions, such that for any $v \in V$,$\inp(v)+\outp(v)+ \degree(v)\leq 2r$ where $\degree(v)$ is the degree of $v$ in thegraph $G$. The total number of inputs is $\inp(V)=\sum\_{v\in V}\inp(v)=n$, and the total number of outputs is $\outp(V)=\sum\_{v\in V}\outp(v)=n+k$.An $(n,k,r)$-network is \emph{valid}, if for any \emph{faulty} outputfunction $\outp'$ (that is such that $0\leq \outp'(v) \leq \outp(v)$ for any $v\in V$, and $\outp'(V) = n$), there are $n$ edge-disjoint paths in $G$such that each vertex $v\in V$ is the initial vertex of $\inp(v)$ pathsand the terminal vertex of $\outp'(v)$ paths.We investigate the design problem of determining the minimum number ${\cal N}(n,k,r)$ ofvertices in a valid $(n,k,r)$-network and of constructing minimum$(n,k,r)$-networks, or at least valid $(n,k,r)$-networks with a numberof vertices close to the optimal value.We first give some upper bounds on ${\cal N}(n,k,r)$.We show ${\cal N}(n,k,r)\leq \left\lceil \frac{k+2}{2r-2}\right\rceil \left\lceil\frac{n}{2}\right\rceil$. When $r\geq k/2$, we prove a better upper bound: ${\cal N}(n,k,r) \leq \frac{r-2+k/2}{r^2-2r+k/2} n + O(1)$.Next, we establish some lower bounds. We show that if $k\geq r$, then${\cal N}(n,k,r) \geq \frac{3n+k}{2r}$. We improve this bound when $k\geq 2r$:$\displaystyle {\cal N}(n,k,r) \geq \formule$.Finally, we determine ${\cal N}(n,k,r)$ up to additive constants for $k\leq 6$.},
HAL_ID = {hal-01111370},
HAL_VERSION = {v1},

}

@article{giroire:hal-01163170,
TITLE = {{Connected Surveillance Game}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Lamprou, Ioannis and Mazauric, Dorian and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane and Soares, Ronan},
URL = {https://hal.inria.fr/hal-01163170},
JOURNAL = {{Journal of Theoretical Computer Science (TCS)}},
PUBLISHER = {{Elsevier}},
VOLUME = {584},
PAGES = {131-143},
YEAR = {2015},
MONTH = Jun,
ABSTRACT = {The surveillance game [Fomin et al., 2012] models the problem of web-page prefetching as a pursuit evasion game played on a graph. This two-player game is played turn-by-turn. The first player, called the observer, can mark a fixed amount of vertices at each turn. The second one controls a surfer that stands at vertices of the graph and can slide along edges. The surfer starts at some initially marked vertex of the graph, its objective is to reach an unmarked node before all nodes of the graph are marked. The surveillance number sn(G) of a graph G is the minimum amount of nodes that the observer has to mark at each turn ensuring it wins against any surfer in G. Fomin et al. also defined the connected surveillance game where the observer must ensure that marked nodes always induce a connected subgraph. They ask what is the cost of connectivity, i.e., is there a constant c \textgreater{} 0 such that the ratio between the connected surveillance number csn(G) and sn(G) is at most c for any graph G. It is straightforward to show that csn(G) $\le$ ∆ sn(G) for any graph G with maximum degree ∆. Moreover, it has been shown that there are graphs G for which csn(G) = sn(G) + 1. In this paper, we investigate the question of the cost of the connectivity. We first provide new non-trivial upper and lower bounds for the cost of connectivity in the surveillance game. More precisely, we present a family of graphs G such that csn(G) \textgreater{} sn(G) + 1. Moreover, we prove that csn(G) $\le$ sn(G)n for any n-node graph G. While the gap between these bounds remains huge, it seems difficult to reduce it. We then define the online surveillance game where the observer has no a priori knowledge of the graph topology and discovers it little-by-little. This variant, which fits better the prefetching motivation, is a restriction of the connected variant. Unfortunately, we show that no algorithm for solving the online surveillance game has competitive ratio better than Ω(∆). That is, while interesting, this variant does not help to obtain better upper bounds for the connected variant. We finally answer an open question [Fomin et al., 2012] by proving that deciding if the surveillance number of a digraph with maximum degree 6 is at most 2 is NP-hard.},
KEYWORDS = {Surveillance game ; Cops and robber games ; Prefetching ; Online strategy ; Competitive ratio ; Cost of connectivity},
PDF = {https://hal.inria.fr/hal-01163170/file/Connected-Surveillance-Journal%20-%20vHAL.pdf},
HAL_ID = {hal-01163170},
HAL_VERSION = {v1},

}

@article{giroire:hal-01162715,
TITLE = {{Minimization of network power consumption with redundancy elimination}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna and Phan, Truong Khoa and roudaut, frederic},
URL = {https://hal.inria.fr/hal-01162715},
JOURNAL = {{Computer Communications}},
PUBLISHER = {{Elsevier}},
VOLUME = {59},
PAGES = {98--105},
YEAR = {2015},
MONTH = Mar,
DOI = {10.1016/j.comcom.2014.12.002},
ABSTRACT = {Recently, energy-aware routing (EAR) has gained an increasing popularity in the networking research community. The idea is that traffic demands are redirected over a subset of the network links, allowing other links to sleep to save energy. In this paper, we propose GreenRE -- a new EAR model with the support of data redundancy elimination (RE). This technique, enabled within routers, can virtually increase the capacity of network links. Based on real experiments on Orange Labs platform, we show that performing RE increases the energy consumption for routers. Therefore, it is important to determine which routers should enable RE and which links to put into sleep mode so that the power consumption of the network is minimized. We model the problem as Mixed Integer Linear Program and propose greedy heuristic algorithms for large networks. Simulations on several network topologies show that the GreenRE model can gain further 37% of energy savings compared to the classical EAR model.},
PDF = {https://hal.inria.fr/hal-01162715/file/GreenRE_COMCOM13.pdf},
HAL_ID = {hal-01162715},
HAL_VERSION = {v1},

}

@article{giroire:hal-01218473,
TITLE = {{On the complexity of equal shortest path routing}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and P{\'e}rennes, St{\'e}phane and Tahiri, Issam},
URL = {https://hal.inria.fr/hal-01218473},
JOURNAL = {{Networks}},
PUBLISHER = {{Wiley}},
YEAR = {2015},
DOI = {10.1002/net.21612},
ABSTRACT = {In telecommunication networks packets are carried from a source s to a destination t on a path determined by the underlying routing protocol. Most routing protocols belong to the class of shortest path routing protocols. In such protocols, the network operator assigns a length to each link. A packet going from s to t follows a shortest path according to these lengths. For better protection and efficiency, one wishes to use multiple (shortest) paths between two nodes. Therefore the routing protocol must determine how the traffic from s to t is distributed among the shortest paths. In the protocol called OSPF-ECMP (for Open Shortest Path First-Equal Cost Multiple Path) the traffic incoming at every node is uniformly balanced on all outgoing links that are on shortest paths. In that context, the operator task is to determine the '' best '' link lengths, toward a goal such as maximizing the network throughput for given link capacities. In this work, we show that the problem of maximizing even a single commodity flow for the OSPF-ECMP protocol cannot be approximated within any constant factor ratio. Besides this main theorem, we derive some positive results which include polynomial-time approximations and an exponential-time exact algorithm.},
KEYWORDS = {shortest path ; routing ; OSPF-ECMP protocol ; maximum flow ; NP-hard ; approximation algorithms ; inverse shortest path},
PDF = {https://hal.inria.fr/hal-01218473/file/ospf-journal.pdf},
HAL_ID = {hal-01218473},
HAL_VERSION = {v1},

}

@article{havet:hal-01233312,
TITLE = {{Complexity of greedy edge-colouring}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Karolinna Maia, A and Yu, Min-Li},
URL = {https://hal.inria.fr/hal-01233312},
JOURNAL = {{Journal of the Brazilian Computer Society}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {21},
NUMBER = {18},
YEAR = {2015},
DOI = {10.1186/s13173-015-0036-x},
ABSTRACT = {The Grundy index of a graph G = (V, E) is the greatest number of colours that the greedy edge-colouring algorithm can use on G. We prove that the problem of determining the Grundy index of a graph G = (V, E) is NP-hard for general graphs. We also show that this problem is polynomial-time solvable for caterpillars. More specifically, we prove that the Grundy index of a caterpillar is (G) or (G) + 1 and present a polynomial-time algorithm to determine it exactly.},
PDF = {https://hal.inria.fr/hal-01233312/file/soumis-bresil.pdf},
HAL_ID = {hal-01233312},
HAL_VERSION = {v1},

}

@article{kosowski:hal-01163494,
TITLE = {{k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth}},
AUTHOR = {Kosowski, Adrian and Li, Bi and Nisse, Nicolas and Suchan, Karol},
URL = {https://hal.archives-ouvertes.fr/hal-01163494},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {72},
NUMBER = {3},
PAGES = {758-777},
YEAR = {2015},
ABSTRACT = {Cops and robber games, introduced by Winkler and Nowakowski [41] and independently defined by Quilliot [43], concern a team of cops that must capture a robber moving in a graph. We consider the class of k-chordal graphs, i.e., graphs with no induced (chordless) cycle of length greater than k, k $\ge$ 3. We prove that k -- 1 cops are always sufficient to capture a robber in k-chordal graphs. This leads us to our main result, a new structural decomposition for a graph class including k-chordal graphs. We present a polynomial-time algorithm that, given a graph G and k $\ge$ 3, either returns an induced cycle larger than k in G, or computes a tree-decomposition of G, each bag of which contains a dominating path with at most k -- 1 vertices. This allows us to prove that any k-chordal graph with maximum degree ∆ has treewidth at most (k --1)(∆ --1) +2, improving the O(∆ (∆ --1) k--3) bound of Bodlaender and Thilikos (1997). Moreover, any graph admitting such a tree-decomposition has small hyperbolicity. As an application, for any n-vertex graph admitting such a tree-decomposition, we propose a compact routing scheme using routing tables, addresses and headers of size O(k log ∆ + log n) bits and achieving an additive stretch of O(k log ∆). As far as we know, this is the first routing scheme with O(k log ∆ + log n)-routing tables and small additive stretch for k-chordal graphs.},
PDF = {https://hal.archives-ouvertes.fr/hal-01163494/file/CopsRouting_vHAL.pdf},
HAL_ID = {hal-01163494},
HAL_VERSION = {v1},

}

@article{moulierac:hal-01162700,
TITLE = {{Optimizing IGP link weights for energy-efficiency in multi-period traffic matrices}},
AUTHOR = {Moulierac, Joanna and Phan, Truong Khoa},
URL = {https://hal.inria.fr/hal-01162700},
JOURNAL = {{Computer Communications}},
PUBLISHER = {{Elsevier}},
VOLUME = {61},
PAGES = {11},
YEAR = {2015},
MONTH = May,
DOI = {10.1016/j.comcom.2015.01.004},
ABSTRACT = {Recently, due to the increasing power consumption and worldwide gases emissions in ICT (Information and Communication Technology), energy efficient ways to design and operate backbone networks are becoming a new concern for network operators. Since these networks are usually overprovisioned and since traffic load has a small influence on power consumption of network equipments, the most common approach to save energy is to put unused line cards that drive links between neighboring routers into sleep mode. To guarantee QoS, all traffic demands should be routed without violating capacity constraints and the network should keep its connectivity. From the perspective of traffic engineering, we argue that stability in routing configuration also plays an important role in QoS. In details, frequent changes in network configuration (link weights, slept and activated links) to adapt with traffic fluctuation in daily time cause network oscillations. In this work, we propose a novel optimization method to adjust the link weights of Open Shortest Path First (OSPF) protocol while limiting the changes in network configurations when multi-period traffic matrices are considered. We formally define the problem and model it as Mixed Integer Linear Program (MILP). We then propose an efficient heuristic algorithm that is suitable for large networks. Simulation results with real traffic traces on three different networks show that our approach achieves high energy saving while keeping the networks in stable state (less changes in network configuration).},
PDF = {https://hal.inria.fr/hal-01162700/file/moulierac2014optimizing.pdf},
HAL_ID = {hal-01162700},
HAL_VERSION = {v1},

}

@inproceedings{borassi:hal-01199860,
TITLE = {{On Computing the Hyperbolicity of Real-World Graphs}},
AUTHOR = {Borassi, Michele and Coudert, David and Crescenzi, Pierluigi and Marino, Andrea},
URL = {https://hal.inria.fr/hal-01199860},
BOOKTITLE = {{23rd Annual European Symposium on Algorithms (ESA)}},
ADDRESS = {Patras, Greece},
PUBLISHER = {{Springer}},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {9294},
PAGES = {215-226},
YEAR = {2015},
MONTH = Sep,
DOI = {10.1007/978-3-662-48350-3\_19},
ABSTRACT = {The (Gromov) hyperbolicity is a topological property of a graph, which has been recently applied in several different contexts, such as the design of routing schemes, network security, computational biology, the analysis of graph algorithms, and the classification of complex networks. Computing the hyperbolicity of a graph can be very time consuming: indeed, the best available algorithm has running-time O(n^{3.69}), which is clearly prohibitive for big graphs. In this paper, we provide a new and more efficient algorithm: although its worst-case complexity is O(n^4), in practice it is much faster, allowing, for the first time, the computation of the hyperbolicity of graphs with up to 200,000 nodes. We experimentally show that our new algorithm drastically outperforms the best previously available algorithms, by analyzing a big dataset of real-world networks. Finally, we apply the new algorithm to compute the hyperbolicity of random graphs generated with the Erd{\"o}s-Renyi model, the Chung-Lu model, and the Configuration Model.},
KEYWORDS = {Hyperbolicity ; Graph ; Algorithm},
PDF = {https://hal.inria.fr/hal-01199860/file/BCCM15.pdf},
HAL_ID = {hal-01199860},
HAL_VERSION = {v1},

}

@inproceedings{chaintreau:hal-01144787,
TITLE = {{Vers une plus grande transparence du Web}},
AUTHOR = {Chaintreau, Augustin and Ducoffe, Guillaume and Geambasu, Roxana and L{\'e}cuyer, Mathias},
URL = {https://hal.archives-ouvertes.fr/hal-01144787},
BOOKTITLE = {{ALGOTEL 2015 - 17{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Beaune, France},
YEAR = {2015},
MONTH = Jun,
ABSTRACT = {De plus en plus les g{\'e}ants du Web (Amazon, Google et Twitter en t{\^e}te) recourent a la manne des " Big data " : ils collectent une myriade de donn{\'e}es qu'ils exploitent pour leurs algorithmes de recommandation personnalis{\'e}e et leurs campagnes publicitaires. Pareilles m{\'e}thodes peuvent consid{\'e}rablement am{\'e}liorer les services rendus a leurs utilisateurs, mais leur opacit{\'e} fait d{\'e}bat. En effet, il n'existe pas a ce jour d'outil suffisamment robuste qui puisse tracer sur le Web l'usage des donn{\'e}es et des informations sur un utilisateur par des services en ligne. Motiv{\'e}s par ce manque de transparence, nous avons d{\'e}velopp{\'e} un prototype du nom d'XRay, et qui peut pr{\'e}dire quelle donn{\'e}e parmi toutes celles pr{\'e}sentes dans un compte utilisateur est responsable de la r{\'e}ception d'une publicit{\'e}. Dans cet article, nous pr{\'e}sentons son principe ainsi que les r{\'e}sultats de nos premi{\`e}res exp{\'e}rimentations. Nous introduisons dans le m{\^e}me temps le tout premier mod{\`e}le th{\'e}orique pour le probl{\`e}me de la transparence du Web, et nous interpr{\'e}tons les performances d'Xray a la lumi{\`e}re de nos r{\'e}sultats obtenus dans ce mod{\`e}le. En particulier, nous d{\'e}montrons qu'un nombre $\\theta$(log N) de comptes utilisateurs auxiliaires, remplis selon un proc{\'e}d{\'e} al{\'e}atoire , suffisent a d{\'e}terminer quelle donn{\'e}e parmi les N en pr{\'e}sence a caus{\'e} la r{\'e}ception d'une publicit{\'e}. Nous aborderons bri{\`e}vement les extensions possibles, et quelques probl{\`e}mes ouverts.},
KEYWORDS = {Algorithmes d'apprentissage ; Formes normales disjonctives monotones ; Annonces publicitaires cibl{\'e}es ; S{\'e}curit{\'e} de l'information (Privacy)},
PDF = {https://hal.archives-ouvertes.fr/hal-01144787/file/xRayAlgotel.pdf},
HAL_ID = {hal-01144787},
HAL_VERSION = {v1},

}

@inproceedings{coudert:hal-01144694,
TITLE = {{Structure vs m{\'e}trique dans les graphes}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-01144694},
BOOKTITLE = {{ALGOTEL 2015 - 17{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Beaune, France},
YEAR = {2015},
MONTH = Jun,
ABSTRACT = {L'{\'e}mergence de r{\'e}seaux de tr{\`e}s grande taille oblige {\`a} repenser de nombreux probl{\`e}mes sur les graphes : en apparence simples, mais pour lesquels les algorithmes de r{\'e}solution connus ne passent plus a l'{\'e}chelle. Une approche possible est de mieux comprendre les propri{\'e}t{\'e}s de ces r{\'e}seaux complexes, et d'en d{\'e}duire de nouvelles m{\'e}thodes plus efficaces. C'est dans ce but que nous d{\'e}montrons des relations g{\'e}n{\'e}rales entre les propri{\'e}t{\'e}s structurelles des graphes et leurs propri{\'e}t{\'e}s m{\'e}triques. Nos relations se d{\'e}duisent de nouvelles bornes serr{\'e}es sur le diam{\`e}tre des s{\'e}parateurs minimaux dans un graphe. Plus pr{\'e}cis{\'e}ment , nous prouvons que dans tout graphe G le diam{\`e}tre d'un s{\'e}parateur minimal S dans G est au plus (l(G)/2) · (|S| -- 1), avec l(G) la plus grande taille d'un cycle isom{\'e}trique dans G. Nos preuves reposent sur des propri{\'e}t{\'e}s de connexit{\'e} dans les puissances d'un graphe. Une cons{\'e}quence de nos r{\'e}sultats est que pour tout graphe G, sa longueur arborescente (treelength) est au plus l(G)/2 fois sa largeur arborescente (treewidth). En compl{\'e}ment de cette relation, nous bornons la largeur arborescente par une fonction de la longueur arborescente et du genre du graphe. Cette borne se g{\'e}n{\'e}ralise {\`a} la famille des graphes qui excluent un apex-graph H comme mineur. Par cons{\'e}quent , nous obtenons un algorithme tr{\`e}s simple qui, {\'e}tant donn{\'e} un graphe excluant un apex-graph fix{\'e} comme mineur, calcule sa largeur arborescente en temps O(n${}^2$) et avec facteur d'approximation O(l(G)).},
KEYWORDS = {Genre ; Hyperbolicit{\'e} ; Graphe ; Largeur arborescente (Treewidth) ; Longueur arborescente (Treelength)},
PDF = {https://hal.archives-ouvertes.fr/hal-01144694/file/separatorAlgotel_vFinale.pdf},
HAL_ID = {hal-01144694},
HAL_VERSION = {v1},

}

@inproceedings{giroire:hal-01162724,
TITLE = {{Compressing two-dimensional routing tables with order}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Havet, Fr{\'e}d{\'e}ric and Moulierac, Joanna},
URL = {https://hal.inria.fr/hal-01162724},
BOOKTITLE = {{INOC (International Network Optimization Conference)}},
ADDRESS = {Varsovie, Poland},
YEAR = {2015},
MONTH = May,
ABSTRACT = {A communication in a network is a pair of nodes (s, t). The node s is called the source source and t the destination. A communication set is a set of distinct communications, i.e. two communications might have the same source or the same destination, but they cannot have both same source and same destination. A routing of a communication (s, t) is a path in the network from s to t. A routing of a communication set is a union of routings of its communications. At each node, there is a set X of communications whose routing path goes through this node. The node needs to be able to find for each communication (s,t) in X, the port that the routing path of (s,t) uses to leave it. An easy way of doing it is to store the list of all triples (s,t,k), where (s, t) $\in$ X and k is the port used by the (s, t)-path to leave the node. Such triples are called communication triples. However, such a list might be very large. Motivated by routing in telecommunication network using Software Defined Network Technologies, we consider the problem of compacting this list using aggregation rules. Indeed, SDN routers use specific memory which is expensive and of small capacity. Hence, in addition, we can use some additional triples, called $\star$-triples. As an example, a t-destination triple ($\star$, t, p), means that every communication with destination t leaves on port p. We carry out in this work a study of the problem complexity, providing results of NP-completeness, of Fixed-Parameter Tractability and approximation algorithms.},
PDF = {https://hal.inria.fr/hal-01162724/file/compacting-camera-ready-final.pdf},
HAL_ID = {hal-01162724},
HAL_VERSION = {v1},

}

@inproceedings{giroire:hal-01221319,
TITLE = {{Study of Repair Protocols for Live Video Streaming Distributed Systems}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Huin, Nicolas},
URL = {https://hal.inria.fr/hal-01221319},
BOOKTITLE = {{IEEE GLOBECOM 2015 - Global Communications Conference}},
ADDRESS = {San Diego, United States},
YEAR = {2015},
MONTH = Dec,
ABSTRACT = {-We study distributed systems for live video streaming. These systems can be of two types: structured and un-structured. In an unstructured system, the diffusion is done opportunistically. The advantage is that it handles churn, that is the arrival and departure of users, which is very high in live streaming systems, in a smooth way. On the opposite, in a structured system, the diffusion of the video is done using explicit diffusion trees. The advantage is that the diffusion is very efficient, but the structure is broken by the churn. In this paper, we propose simple distributed repair protocols to maintain, under churn, the diffusion tree of a structured streaming system. We study these protocols using formal analysis and simulation. In particular, we provide an estimation of the system metrics, bandwidth usage, delay, or number of interruptions of the streaming. Our work shows that structured streaming systems can be efficient and resistant to churn.},
PDF = {https://hal.inria.fr/hal-01221319/file/gc15%20camera%20ready.pdf},
HAL_ID = {hal-01221319},
HAL_VERSION = {v1},

}

@inproceedings{giroire:hal-01218411,
TITLE = {{Grid spanners with low forwarding index for energy efficient networks }},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Perennes, Stephane and Tahiri, Issam},
URL = {https://hal.inria.fr/hal-01218411},
BOOKTITLE = {{International Network Optimization Conference (INOC)}},
ADDRESS = {Warsaw, Poland},
SERIES = {Electronic Notes in Discrete Mathematics},
YEAR = {2015},
MONTH = May,
ABSTRACT = {A routing R of a connected graph G is a collection that contains simple paths connecting every ordered pair of vertices in G. The edge-forwarding index with respect to R (or simply the forwarding index with respect to R) $\pi$(G, R) of G is the maximum number of paths in R passing through any edge of G. The forwarding index $\pi$(G) of G is the minimum $\pi$(G, R) over all routings R's of G. This parameter has been studied for different graph classes [12], [1], [5], [4]. Motivated by energy efficiency, we look, for different numbers of edges, at the best spanning graphs of a square grid, namely those with a low forwarding index.},
KEYWORDS = {spanning subgraphs ; forwarding index ; energy saving ; routing ; grid},
PDF = {https://hal.inria.fr/hal-01218411/file/camera-ready-inoc.pdf},
HAL_ID = {hal-01218411},
HAL_VERSION = {v1},

}

@inproceedings{giroire:hal-01221650,
TITLE = {{How to design graphs with low forwarding index and limited number of edges}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and P{\'e}rennes, St{\'e}phane and Tahiri, Issam},
URL = {https://hal.inria.fr/hal-01221650},
BOOKTITLE = {{26th International Workshop on Combinatorial Algorithms (IWOCA 2015)}},
ADDRESS = {Verona, Italy},
YEAR = {2015},
MONTH = Oct,
ABSTRACT = {The (edge) forwarding index of a graph is the minimum, over all possible rout-ings of all the demands, of the maximum load of an edge. This metric is of a great interest since it captures the notion of global congestion in a precise way: the lesser the forwarding-index, the lesser the congestion. In this paper, we study the following design question: Given a number e of edges and a number n of vertices, what is the least congested graph that we can construct? and what forwarding-index can we achieve? Our problem has some distant similarities with the well-known (∆, D) problem, and we sometimes build upon results obtained on it. The goal of this paper is to study how to build graphs with low forwarding indices and to understand how the number of edges impacts the forwarding index. We answer here these questions for different families of graphs: general graphs, graphs with bounded degree, sparse graphs with a small number of edges by providing constructions, most of them asymptotically optimal. For instance, we provide an asymptotically optimal construction for (n, n + k) cubic graphs-its forwarding index is $\sim$ n 2 3k log 2 (k). Our results allow to understand how the forwarding-index drops when edges are added to a graph and also to determine what is the best (i.e least congested) structure with e edges. Doing so, we partially answer the practical problem that initially motivated our work: If an operator wants to power only e links of its network, in order to reduce the energy consumption (or wiring cost) of its networks, what should be those links and what performance can be expected?},
KEYWORDS = {graphs ; forwarding index ; routing ; design problem ; energy efficiency ; extremal graphs},
PDF = {https://hal.inria.fr/hal-01221650/file/iwoca15-camera-ready%20%281%29.pdf},
HAL_ID = {hal-01221650},
HAL_VERSION = {v1},

}

@inproceedings{havet:hal-01148471,
TITLE = {{Routage vert et compression de r{\`e}gles SDN}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Huin, Nicolas and Moulierac, Joanna and Phan, Khoa},
URL = {https://hal.archives-ouvertes.fr/hal-01148471},
BOOKTITLE = {{ALGOTEL 2015 - 17{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Beaune, France},
YEAR = {2015},
MONTH = Jun,
ABSTRACT = {La technologie SDN permet de s{\'e}parer le plan de contr{\^o}le et le plan de donn{\'e}es qui cohabitent actuellement sur les routeurs dans les architectures r{\'e}seaux classiques et de r{\'e}aliser le routage par un ou plusieurs contr{\^o}leur(s) centralis{\'e}(s). Nos travaux portent sur l'utilisation de cette technologie pour minimiser la consommation d'{\'e}nergie dans les r{\'e}seaux, notamment en permettant au contr{\^o}leur d'{\'e}teindre {\`a} distance des liens non utilis{\'e}s. Une des probl{\'e}matiques est que les tables de routage SDN ne peuvent contenir qu'un nombre tr es limit{\'e} de r{\`e}gles. Ceci est d{\^u} au type particulier de m{\'e}moire utilis{\'e} pour permettre l'ajout a distance de r{\`e}gles de routage par le contr{\^o}leur SDN. Dans ce papier, nous {\'e}tudions le probl{\`e}me de compression de tables de routage bidimensionnelles avec priorit{\'e}, en particulier la complexit{\'e} algorithmique et proposons des algorithmes d'approximation. Nous proposons ensuite des algorithmes de routage vert qui effectuent en m{\^e}me temps le choix des routes, la compression des tables de routages et la mise en veille des liens non utilis{\'e}s. Ces algorithmes sont test{\'e}s sur les r{\'e}seaux de la librairie SNDLib.},
PDF = {https://hal.archives-ouvertes.fr/hal-01148471/file/draft.pdf},
HAL_ID = {hal-01148471},
HAL_VERSION = {v1},

}

@inproceedings{kante:hal-01142745,
TITLE = {{On paths in grids with forbidden transitions}},
AUTHOR = {Kant{\'e}, Mamadou Moustapha and Moataz, Fatima Zahra and Mom{\`e}ge, Benjamin and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-01142745},
BOOKTITLE = {{ALGOTEL 2015 - 17{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Beaune, France},
YEAR = {2015},
MONTH = Jun,
ABSTRACT = {Une transition dans un graphe est une paire d'ar{\^e}tes incidentes {\`a} un m{\^e}me sommet. Etant donn{\'e}s un graphe G = (V, E), deux sommets s,t $\in$ V et un ensemble associ{\'e} de transitions interdites F $\subseteq$ E × E, le probl{\`e}me de chemin {\'e}vitant des transitions interdites consiste {\`a} d{\'e}cider s'il existe un chemin {\'e}l{\'e}mentaire de s {\`a} t qui n'utilise aucune des transitions de F. C'est-{\`a}-dire qu'il est interdit d'emprunter cons{\'e}cutivement deux ar{\^e}tes qui soient une paire de F. Ce probl{\`e}me est motiv{\'e} par le routage dans les r{\'e}seaux routiers (o{\`u} une transition interdite repr{\'e}sente une interdiction de tourner) ainsi que dans les r{\'e}seaux optiques avec des noeuds asym{\'e}triques. Nous prouvons que le probl{\`e}me est NP-difficile dans les graphes planaires et plus particuli{\`e}rement dans les grilles. Nous montrons {\'e}galement que leprobl{\`e}me peut {\^e}tre r{\'e}solu en temps polynomial dans la classe des graphes de largeur arborescente born{\'e}e.},
KEYWORDS = {Forbidden transitions ; planar graph ; grid ; asymmetric nodes},
PDF = {https://hal.archives-ouvertes.fr/hal-01142745/file/PAFT_FinalVersion.pdf},
HAL_ID = {hal-01142745},
HAL_VERSION = {v1},

}

@inproceedings{kante:hal-01162796,
TITLE = {{Finding Paths in Grids with Forbidden Transitions}},
AUTHOR = {Kant{\'e}, Mamadou Moustapha and Moataz, Fatima Zahra and Mom{\`e}ge, Benjamin and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01162796},
BOOKTITLE = {{WG 2015, 41st International Workshop on Graph-Theoretic Concepts in Computer Science}},
ADDRESS = {Munich, Germany},
YEAR = {2015},
MONTH = Jun,
ABSTRACT = {A transition in a graph is a pair of adjacent edges. Given a graph G = (V, E), a set of forbidden transitions F $\subseteq$ E × E and two vertices s, t $\in$ V , we study the problem of finding a path from s to t which uses none of the forbidden transitions of F. This means that it is forbidden for the path to consecutively use two edges forming a pair in F. The study of this problem is motivated by routing in road networks in which forbidden transitions are associated to prohibited turns as well as routing in optical networks with asymmetric nodes, which are nodes where a signal on an ingress port can only reach a subset of egress ports. If the path is not required to be elementary, the problem can be solved in polynomial time. On the other side, if the path has to be elementary, the problem is known to be NP-complete in general graphs [Szeider 2003]. In this paper, we study the problem of finding an elementary path avoiding forbidden transitions in planar graphs. We prove that the problem is NP-complete in planar graphs and particularly in grids. In addition, we show that the problem can be solved in polynomial time in graphs with bounded treewidth. More precisely, we show that there is an algorithm which solves the problem in time O((3∆(k + 1)) 2k+4 n)) in n-node graphs with treewidth at most k and maximum degree ∆.},
PDF = {https://hal.inria.fr/hal-01162796/file/PAFT_WGV0.pdf},
HAL_ID = {hal-01162796},
HAL_VERSION = {v1},

}

@inproceedings{kodjo:hal-01198461,
TITLE = {{Dimensioning microwave wireless networks}},
AUTHOR = {Kodjo, Alvinice and Jaumard, Brigitte and Nepomuceno, Napoleão and Kaddour, Mejdi and Coudert, David},
URL = {https://hal.inria.fr/hal-01198461},
BOOKTITLE = {{ICC 2015 : IEEE International Conference on Communications}},
ADDRESS = {London, United Kingdom},
PUBLISHER = {{IEEE}},
PAGES = {2803 - 2809},
YEAR = {2015},
MONTH = Jun,
DOI = {10.1109/ICC.2015.7248751},
ABSTRACT = {We aim at dimensioning fixed broadband microwave wireless networks under unreliable channel conditions. As the transport capacity of microwave links is prone to variations due to, e.g., weather conditions, such a dimensioning requires special attention. It can be formulated as the determination of the minimum cost bandwidth assignment of the links in the network for which traffic requirements can be met with high probability, while taking into account that transport link capacities vary depending on channel conditions. The proposed optimization model represents a major step forward since we consider dynamic routing. Experimental results show that the resulting solutions can save up to 45% of the bandwidth cost compared to the case where a bandwidth over-provisioning policy is uniformly applied to all links in the network planning. Comparisons with previous work also show that we can solve much larger instances in significantly shorter computing times, with a comparable level of reliability.},
PDF = {https://hal.inria.fr/hal-01198461/file/ICC_2015_Microwave_Final.pdf},
HAL_ID = {hal-01198461},
HAL_VERSION = {v1},

}

@inproceedings{li:hal-01162695,
TITLE = {{Minimum Size Tree-decompositions}},
AUTHOR = {Li, Bi and Zahra Moataz, Fatima and Nisse, Nicolas and Suchan, Karol},
URL = {https://hal.inria.fr/hal-01162695},
BOOKTITLE = {{LAGOS 2015 -- VIII Latin-American Algorithms, Graphs and Optimization Symposium}},
ADDRESS = {Beberibe, Cear{\'a}, Brazil},
YEAR = {2015},
MONTH = May,
ABSTRACT = {Tree-decompositions are the cornerstone of many dynamic programming algorithms for solving graph problems. Since the complexity of such algorithms generally depends exponentially on the width (size of the bags) of the decomposition, much work has been devoted to compute tree-decompositions with small width. However, practical algorithms computing tree-decompositions only exist for graphs with treewidth less than 4. In such graphs, the time-complexity of dynamic programming algorithms is dominated by the size (number of bags) of the tree-decompositions. It is then interesting to minimize the size of the tree-decompositions. In this extended abstract, we consider the problem of computing a tree-decomposition of a graph with width at most k and minimum size. We prove that the problem is NP-complete for any fixed k $\ge$ 4 and polynomial for k $\le$ 2; for k = 3, we show that it is polynomial in the class of trees and 2-connected outerplanar graphs.},
KEYWORDS = {Minimum size tree-decomposition ; treewidth ; NP-hard},
PDF = {https://hal.inria.fr/hal-01162695/file/MSTD.pdf},
HAL_ID = {hal-01162695},
HAL_VERSION = {v1},

}

@inproceedings{nisse:hal-01144674,
TITLE = {{Comment appliquer les cha{\^i}nes augmentantes pour atterrir a l'heure ?}},
AUTHOR = {Nisse, Nicolas and Salch, Alexandre and Weber, Valentin},
URL = {https://hal.archives-ouvertes.fr/hal-01144674},
BOOKTITLE = {{ALGOTEL 2015 - 17{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Beaune, France},
YEAR = {2015},
MONTH = Jun,
ABSTRACT = {Lorsqu'un avion approche d'un a{\'e}roport , il dispose d'un intervalle de temps (slot) tr{\`e}s limit{\'e} (une vingtaine de minutes) pour atterrir. Si l'avion a du retard {\`a} cause des conditions m{\'e}t{\'e}orologiques ({\`a} cause du retard d'autres avions, ou si lui-m{\^e}me a eu du retard au d{\'e}collage), il perd son slot et il faut qu'un nouveau slot lui soit attribu{\'e} par les contr{\^o}leurs des op{\'e}rations de la compagnie a{\'e}rienne. Cependant, les slots d'atterrissage sont une denr{\'e}e rare et, pour qu'un avion A puisse atterrir a l'heure, les contr{\^o}leurs doivent r{\'e}gul{\`i}{\`e}rement modifier l'attribution des slots d'autres avions afin d'affecter un slot compatible avec l'heure d'arriv{\'e}e de l'avion A. Ce probl{\`e}me peut ais{\'e}ment etre mod{\'e}lis{\'e} comme un probl{\`e}me de couplage dans un graphe biparti. Malheureusement, d{\^u} au syst{\`e}me mis en place pour permettre ces {\'e}changes, les contr{\^o}leurs a{\'e}riens ne peuvent effectuer leurs modifications qu'en effectuant deux types d'op{\'e}rations : soit attribuer {\`a} l'avion A un slot libre, soit donner {\`a} l'avion A le slot d'un avion B et attribuer un slot libre {\`a} ce dernier. Le probl{\`e}me devient donc le suivant. Soit G un graphe et M un couplage (ensemble d'ar{\^e}tes deux-{\`a}-deux disjointes) de G. Comment calculer un couplage maximum pouvant etre obtenu {\`a} partir de M en utilisant uniquement des chemins augmentants de longueur au plus k ? Ce probl{\`e}me a d{\'e}j{\`a} {\'e}t{\'e} {\'e}tudi{\'e} dans le cadre des r{\'e}seaux sans-fil car il fournit une simple approximation au probl{\`e}me de couplage maximum. Nous prouvons que, pour k = 3, ce probl{\`e}me peut {\^e}tre r{\'e}solu en temps polynomial, fournissant ainsi un algorithme efficace pour les contr{\^o}leurs a{\'e}riens. Nous prouvons ensuite que, pour tout entier impair k $\ge$ 5, le probl{\`e}me est NP-complet dans les graphes bipartis planaires de degr{\'e} au plus 3.},
PDF = {https://hal.archives-ouvertes.fr/hal-01144674/file/amadeusV5_revision.pdf},
HAL_ID = {hal-01144674},
HAL_VERSION = {v1},

}

@inproceedings{rifai:hal-01203020,
TITLE = {{Too many SDN rules? Compress them with MINNIE}},
AUTHOR = {Rifai, Myriana and Huin, Nicolas and Caillouet, Christelle and Giroire, Fr{\'e}d{\'e}ric and Lopez Pacheco, Dino and Moulierac, Joanna and Urvoy-Keller, Guillaume},
URL = {https://hal.inria.fr/hal-01203020},
BOOKTITLE = {{IEEE GLOBECOM}},
ADDRESS = {San diego, United States},
ORGANIZATION = {{IEEE}},
YEAR = {2015},
MONTH = Dec,
ABSTRACT = {Software Defined Networking (SDN) is gaining momentum with the support of major manufacturers. While it brings flexibility in the management of flows within the data center fabric, this flexibility comes at the cost of smaller routing table capacities. In this paper, we investigate compression techniques to reduce the forwarding information base (FIB) of SDN switches. We validate our algorithm, called MINNIE, on a real testbed able to emulate a 20 switches fat tree architecture. We demonstrate that even with a small number of clients, the limit in terms of number of rules is reached if no compression is performed, increasing the delay of all new incoming flows. MINNIE, on the other hand, reduces drastically the number of rules that need to be stored with a limited impact on the packet loss rate. We also evaluate the actual switching and reconfiguration times and the delay introduced by the communications with the controller.},
KEYWORDS = {Software defined networks ; experimentation ; TCAM ; number of rules},
PDF = {https://hal.inria.fr/hal-01203020/file/gc2015%20camera%20ready.pdf},
HAL_ID = {hal-01203020},
HAL_VERSION = {v1},

}

@inproceedings{zahramoataz:hal-01142818,
TITLE = {{On Spectrum Assignment in Elastic Optical Tree-Networks}},
AUTHOR = {Zahra Moataz, Fatima},
URL = {https://hal.archives-ouvertes.fr/hal-01142818},
BOOKTITLE = {{ALGOTEL 2015 - 17{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Beaune, France},
YEAR = {2015},
MONTH = Jun,
ABSTRACT = {Pour r{\'e}pondre {\`a} la demande croissante du trafic d'Internet, une nouvelle g{\'e}n{\'e}ration de r{\'e}seaux optiques est en cours de d{\'e}veloppement ; les r{\'e}seaux optiques {\'e}lastiques (EONs). La technologie EON permet d'utiliser le spectre optique de mani{\`e}re efficace et flexible. Cette flexibilit{\'e} promet de r{\'e}soudre les difficult{\'e}s li{\'e}es {\`a} la croissance et l'h{\'e}t{\'e}rog{\'e}n{\'e}it{\'e} du trafic. Toutefois, elle rend le probl{\`e}me d'allocation de ressources plus complexe. Dans ce papier, nous traitons le probl{\`e}me d'allocation de spectre dans les r{\'e}seaux optiques {\'e}lastiques en arbre. Dans ce type de r{\'e}seau , bien que le routage soit fix{\'e}, l'allocation de spectre est NP-difficile. Nous pr{\'e}sentons des r{\'e}sultats de difficult{\'e} et d'approximation pour des cas sp{\'e}ciaux o{\`u} le r{\'e}seau est une {\'e}toile ou un arbre binaire.},
KEYWORDS = {interval coloring ; routing and spectrum assignment ; optical networks ; Approximation algorithms},
PDF = {https://hal.archives-ouvertes.fr/hal-01142818/file/SA_FinalVersion.pdf},
HAL_ID = {hal-01142818},
HAL_VERSION = {v1},

}

@techreport{araujo:hal-01247014,
TITLE = {{Proper orientation of cacti}},
AUTHOR = {Araujo, Julio and Havet, Fr{\'e}d{\'e}ric and Linhares Sales, Claudia and Silva, Ana},
URL = {https://hal.inria.fr/hal-01247014},
TYPE = {Research Report},
NUMBER = {RR-8833},
PAGES = {17},
INSTITUTION = {{INRIA Sophia Antipolis - M{\'e}diterran{\'e}e}},
YEAR = {2015},
MONTH = Dec,
ABSTRACT = {An orientation of a graph is proper if two adjacent vertices have different indegrees. We prove that every cactus admits a proper orientation with maximum indegree at most 7. We also prove that the bound 7 is tight by showing a cactus having no proper orientation with maximum indegree less than 7. We also prove that any planar claw-free graph has a proper orientation with maximum indegree at most 6 and that this bound can also be attained.},
KEYWORDS = {proper orientation ; graph coloring ; cactus graph ; claw-free graph},
PDF = {https://hal.inria.fr/hal-01247014/file/RR-8833.pdf},
HAL_ID = {hal-01247014},
HAL_VERSION = {v1},

}

@techreport{bermond:hal-01116321,
TITLE = {{On Spectrum Assignment in Elastic Optical Tree-Networks}},
AUTHOR = {Bermond, Jean-Claude and Moataz, Fatima Zahra},
URL = {https://hal.inria.fr/hal-01116321},
TYPE = {Research Report},
INSTITUTION = {{Inria Sophia Antipolis ; Universit{\'e} Nice Sophia Antipolis}},
YEAR = {2015},
MONTH = Feb,
ABSTRACT = {To face the explosion of the Internet traffic, a new generation of optical networks is being developed; the Elastic optical Networks (EONs). The aim with EONs is to use the optical spectrum efficiently and flexibly. The benefit of the flexibility is, however, accompanied by more difficulty in the resource allocation problems. In this report, we study the problem of Spectrum Allocation in Elastic Optical Tree-Networks. In trees, even though the routing is fixed, the spectrum allocation is NP-hard. We survey the complexity and approximability results that have been established for the SA in trees and prove new results for stars and binary trees.},
KEYWORDS = {Approximation algorithms ; routing and spectrum assignment ; optical networks ; interval coloring},
PDF = {https://hal.inria.fr/hal-01116321/file/SAinTrees.pdf},
HAL_ID = {hal-01116321},
HAL_VERSION = {v4},

}

@techreport{coudert:hal-01149203,
TITLE = {{Data center interconnection networks are not hyperbolic}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume},
URL = {https://hal.inria.fr/hal-01149203},
TYPE = {Research Report},
PAGES = {23},
INSTITUTION = {{Inria Sophia Antipolis ; I3S ; Universit{\'e} Nice Sophia Antipolis ; CNRS}},
YEAR = {2015},
MONTH = May,
ABSTRACT = {Topologies for data center networks have been proposed in the literature through various graph classes and operations. A common trait to most existing designs is that they enhance the symmetric properties of the underlying graphs. Indeed, symmetry is a desirable property for interconnection networks because it minimizes congestion problems and it allows each entity to run the same routing protocol. However, despite sharing similarities these topologies all come with their own routing protocol. Recently, generic routing schemes have been introduced which can be implemented for any interconnection networks. The performances of such universal routing schemes are intimately related to the hyperbolicity of the topology. Roughly, graph hyperbolicity is a metric parameter which measures how close is the shortest-path metric of a graph from a tree metric (the smaller gap the better). Motivated by the good performances in practice of these new routing schemes, we propose the first general study of the hyperbolicity of data center interconnection networks. Our findings are disappointingly negative: we prove that the hyperbolicity of most data center topologies scales linearly with their diameter, that it the worst-case possible for hyperbolicity. To obtain these results, we introduce original connection between hyperbolicity and the properties of the endomorphism monoid of a graph. In particular, our results extend to all vertex and edge-transitive graphs. Additional results are obtained for de Bruijn and Kautz graphs, grid-like graphs and networks from the so-called Cayley model.},
PDF = {https://hal.inria.fr/hal-01149203/file/research-report-20150506.pdf},
HAL_ID = {hal-01149203},
HAL_VERSION = {v1},

}

@techreport{giroire:hal-01172725,
TITLE = {{Graphs with optimal forwarding indices: What is the best throughput you can get with a given number of edges?}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and P{\'e}rennes, St{\'e}phane and Tahiri, Issam},
URL = {https://hal.inria.fr/hal-01172725},
TYPE = {Research Report},
NUMBER = {RR-8752},
INSTITUTION = {{INRIA Sophia Antipolis ; INRIA}},
YEAR = {2015},
MONTH = Jun,
ABSTRACT = {The (edge) forwarding index of a graph is the minimum, over all possible routings of all the demands, of the maximum load of an edge. This metric is of a great interest since it captures the notion of global congestion in a precise way: the lesser the forwarding-index, the lesser the congestion. In this paper, we study the following design question: Given a number e of edges and a number n of vertices, what is the least congested graph that we can construct? and what forwarding-index can we achieve? Our problem has some distant similarities with the well-known (∆,D) problem, and we sometimes build upon results obtained on it. The goal of this paper is to study how to build graphs with low forwarding indices and to understand how the number of edges impacts the forwarding index. We answer here these questions for different families of graphs: general graphs, graphs with bounded degree, sparse graphs with a small number of edges by providing constructions, most of them asymptotically optimal. Hence, our results allow to understand how the forwarding-index drops when edges are added to a graph and also to determine what is the best (i.e least congested) structure with e edges. Doing so, we partially answer the practical problem that initially motivated our work: If an operator wants to power only e links of its network, in order to reduce the energy consumption (or wiring cost) of its networks, what should be those links and what performance can be expected?},
KEYWORDS = {graphs ; forwarding index ; routing ; design problem ; energy efficiency ; extremal graphs},
PDF = {https://hal.inria.fr/hal-01172725/file/RR-8752.pdf},
HAL_ID = {hal-01172725},
HAL_VERSION = {v1},

}

@techreport{havet:hal-01202650,
TITLE = {{Finding a subdivision of a prescribed digraph of order 4}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Maia de Oliveira, A. Karolinna and Mohar, Bojan},
URL = {https://hal.inria.fr/hal-01202650},
TYPE = {Research Report},
NUMBER = {RR-8773},
INSTITUTION = {{INRIA}},
YEAR = {2015},
MONTH = Sep,
ABSTRACT = {The problem of when a given digraph contains a subdivision of a fixed digraph F is considered.Bang-Jensen et al. [2] laid out foundations for approaching this problem from the algorithmic pointof view. In this paper we give further support to several open conjectures and speculations about algorithmiccomplexity of finding F-subdivisions. In particular, up to 5 exceptions, we completely classify forwhich 4-vertex digraphs F, the F-subdivision problem is polynomial-time solvable and for which it is NPcomplete.While all NP-hardness proofs are made by reduction from some version of the 2-linkage problemin digraphs, some of the polynomial-time solvable cases involve relatively complicated algorithms.},
PDF = {https://hal.inria.fr/hal-01202650/file/RR-8773.pdf},
HAL_ID = {hal-01202650},
HAL_VERSION = {v1},

}

@techreport{jeong:hal-01214932,
TITLE = {{Inference of Curvilinear Structure based on Learning a Ranking Function and Graph Theory}},
AUTHOR = {Jeong, Seong-Gyun and Tarabalka, Yuliya and Nisse, Nicolas and Zerubia, Josiane},
URL = {https://hal.inria.fr/hal-01214932},
TYPE = {Research Report},
NUMBER = {RR-8789},
INSTITUTION = {{Inria Sophia Antipolis}},
YEAR = {2015},
ABSTRACT = {To detect curvilinear structures in natural images, we propose a novel rankinglearning system and an abstract curvilinear shape inference algorithm based on graph theory. Weanalyze the curvilinear structures as a set of small line segments. In this work, the rankings ofthe line segments are exploited to systematize the topological feature of the curvilinear structures.Structured Support Vector Machine is employed to learn the ranking function that predicts thecorrespondence of the given line segments and the latent curvilinear structures. We first extractcurvilinear features using morphological profiles and steerable filtering responses. Also, we proposean orientation-aware feature descriptor and a feature grouping operator to improve the structuralintegrity during the learning process. To infer the curvilinear structure, we build a graph based onthe output rankings of the line segments. We progressively reconstruct the curvilinear structureby looking for paths between remote vertices in the graph. Experimental results show that theproposed algorithm faithfully detects the curvilinear structures within various datasets.},
PDF = {https://hal.inria.fr/hal-01214932/file/RR-8789.pdf},
HAL_ID = {hal-01214932},
HAL_VERSION = {v1},

}

@techreport{kante:hal-01115395,
TITLE = {{Finding Paths in Grids with Forbidden Transitions}},
AUTHOR = {Kant{\'e}, Mamadou Moustapha and Moataz, Fatima Zahra and Mom{\`e}ge, Benjamin and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01115395},
TYPE = {Research Report},
INSTITUTION = {{Inria Sophia Antipolis ; Univerist{\'e} Nice Sophia Antipolis ; CNRS}},
YEAR = {2015},
MONTH = Feb,
ABSTRACT = {Une transition dans un graphe est une paire d'ar{\^e}tes incidente a un m{\^e}me sommet. Etant donn{\'e}s un graphe G = (V, E), deux sommets s, t $\in$ V et un ensemble associ{\'e} de transitions interdites F $\subseteq$ E × E, le probl{\`e}me de chemin {\'e}vitant des transitions interdites consiste {\`a} d{\'e}cider s’il existe un chemin {\'e}l{\'e}mentaire de s {\`a} t qui n’utilise aucune des transitions de F. C’est-{\`a}-dire qu’il est interdit d’emprunter cons{\'e}cutivement deux ar{\^e}tes qui soient une paire de F. Ce probl{\`e}me est motiv{\'e} par le routage dans les r{\'e}seaux routiers (o{\`u} une transition interdite repr{\'e}sente une interdiction de tourner) ainsi que dans les r{\'e}seaux optiques avec des noeuds asym{\'e}triques. Nous prouvons que le probl{\`e}me est NP-difficile dans les graphes planaires et plus particuli{\`e}rement dans les grilles. Nous montrons {\'e}galement que le probl{\`e}me peut {\^e}tre r{\'e}solu en temps polynomial dans la classe des graphes de largeur arborescente born{\'e}e.},
KEYWORDS = {asymmetric nodes ; grid ; planar graphs ; forbidden transitions},
PDF = {https://hal.inria.fr/hal-01115395/file/PAFT.pdf},
HAL_ID = {hal-01115395},
HAL_VERSION = {v1},

}

@techreport{nisse:hal-01116487,
TITLE = {{Recovery of disrupted airline operations using k-Maximum Matching in Graphs}},
AUTHOR = {Nisse, Nicolas and Salch, Alexandre and Weber, Valentin},
URL = {https://hal.inria.fr/hal-01116487},
TYPE = {Research Report},
NUMBER = {RR-8679},
INSTITUTION = {{Inria Sophia Antipolis ; INRIA}},
YEAR = {2015},
MONTH = Feb,
ABSTRACT = {When an aircraft is approaching an airport, it gets a short time interval (called {\it slot}) that it can use to land. If the landing of the aircraft is delayed (because of bad weather, or if it arrives late, or if other aircrafts have to land first), it looses its slot and Air traffic controllers have to assign it a new slot. However, slots for landing are a scare resource of the airports and, to avoid that an aircraft waits too much time, Air traffic controllers have to regularly modify the assignment of the slots of the aircrafts. Unfortunately, for legal and economical reasons, Air traffic controllers can modify the slot-assignment only using two kind of operations: either assign to aircraft $A$ a slot that was free, or give to $A$ the slot of another aircraft $B$ and assign to $B$ a free slot. The problem is then the following.Let $k\geq 1$ be an odd integer and let $G$ be a graph and $M$ be a matching (set of pairwise disjoint edges) of $G$. What is the maximum size of a matching that can be obtained from $M$ by using only augmenting paths of length at most $k$? Moreover, how to compute such a maximum matching? This problem has already been studied in the context of wireless networks, mainly because it provides a simple approximation for the classical matching problem. We prove that this problem can be solved in polynomial-time when $k\leq 3$. Then, we show that, for any odd integer $k\geq 5$, the problem is NP-complete in planar bipartite graphs with maximum degree at most $3$.},
PDF = {https://hal.inria.fr/hal-01116487/file/RR-8679.pdf},
HAL_ID = {hal-01116487},
HAL_VERSION = {v1},

}

@misc{ducoffe:hal-01163552,
TITLE = {{Web Transparency for Complex Targeting: Algorithms, Limits, and Tradeoffs}},
AUTHOR = {Ducoffe, Guillaume and L{\'e}cuyer, Mathias and Chaintreau, Augustin and Geambasu, Roxana},
URL = {https://hal.archives-ouvertes.fr/hal-01163552},
NOTE = {Poster},
HOWPUBLISHED = {{SIGMETRICS '15 Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems}},
YEAR = {2015},
MONTH = Jun,
DOI = {10.1145/2745844.2745896},
ABSTRACT = {Big Data promises important societal progress but exacerbates the need for due process and accountability. Companies and institutions can now discriminate between users at an individual level using collected data or past behavior. Worse, today they can do so in near perfect opacity. The nascent field of web transparency aims to develop the tools and methods necessary to reveal how information is used, however today it lacks robust tools that let users and investigators identify targeting using multiple inputs. Here, we formalize for the first time the problem of detecting and identifying targeting on combinations of inputs and provide the first algorithm that is asymptotically exact. This algorithm is designed to serve as a theoretical foundational block to build future scalable and robust web transparency tools. It offers three key properties. First, our algorithm is service agnostic and applies to a variety of settings under a broad set of assumptions. Second, our algorithm's analysis delineates a theoretical detection limit that characterizes which forms of targeting can be distinguished from noise and which cannot. Third, our algorithm establishes fundamental tradeoffs that lead the way to new metrics for the science of web transparency. Understanding the tradeoff between effective targeting and targeting concealment lets us determine under which conditions predatory targeting can be made unprofitable by transparency tools.},
PDF = {https://hal.archives-ouvertes.fr/hal-01163552/file/DLLCG.Poster.pdf},
HAL_ID = {hal-01163552},
HAL_VERSION = {v1},

}

@book{fomin:hal-01084230,
TITLE = {{Report on GRASTA 2014}},
AUTHOR = {Fomin, Fedor and Fraigniaud, Pierre and Nisse, Nicolas and Thilikos, Dimitrios M. M.},
URL = {https://hal.archives-ouvertes.fr/hal-01084230},
YEAR = {2014},
PDF = {https://hal.archives-ouvertes.fr/hal-01084230/file/report%20on%20GRASTA%202014.pdf},
HAL_ID = {hal-01084230},
HAL_VERSION = {v1},

}

@phdthesis{kodjo:tel-01165064,
TITLE = {{Design and optimization of wireless backhaul networks}},
AUTHOR = {Kodjo, Alvinice},
URL = {https://tel.archives-ouvertes.fr/tel-01165064},
NUMBER = {2014NICE4140},
SCHOOL = {{Universit{\'e} Nice Sophia Antipolis}},
YEAR = {2014},
MONTH = Dec,
KEYWORDS = {Infrastructure sharing ; Energy saving ; Design ; Robust optimization ; Microwave backhaul ; R{\'e}seaux de collecte ; Optimisation robuste ; Dimensionnement ; Consommation d'{\'e}nergie ; Partage d'infrastructure},
TYPE = {Theses},
PDF = {https://tel.archives-ouvertes.fr/tel-01165064/file/2014NICE4140.pdf},
HAL_ID = {tel-01165064},
HAL_VERSION = {v1},

}

@phdthesis{lancin:tel-01128347,
TITLE = {{Study of complex networks properties for the optimization of routing models}},
AUTHOR = {Lancin, Aur{\'e}lien},
URL = {https://tel.archives-ouvertes.fr/tel-01128347},
NUMBER = {2014NICE4117},
SCHOOL = {{Universit{\'e} Nice Sophia Antipolis}},
YEAR = {2014},
MONTH = Dec,
KEYWORDS = {Routing ; Graph decomposition ; Graph ; Hyperbolicity ; Algorithm ; Parallel distributed simulation ; Internet ; Algorithme ; Graphe ; Hyperbolicit{\'e} ; D{\'e}composition de graphe ; Routage ; BGP ; Simulation ; Simulation parall{\`e}le distribu{\'e}e},
TYPE = {Theses},
PDF = {https://tel.archives-ouvertes.fr/tel-01128347/file/2014NICE4117.pdf},
HAL_ID = {tel-01128347},
HAL_VERSION = {v1},

}

@phdthesis{li:tel-01127108,
TITLE = {{Tree decompositions and routing problems}},
AUTHOR = {Li, Bi},
URL = {https://tel.archives-ouvertes.fr/tel-01127108},
NUMBER = {2014NICE4088},
SCHOOL = {{Universit{\'e} Nice Sophia Antipolis}},
YEAR = {2014},
MONTH = Nov,
KEYWORDS = {Tree decomposition ; Compact routing scheme ; Prize collecting Steiner tree ; Gathering ; D{\'e}composition arborescente ; Sch{\'e}ma de routage compact},
TYPE = {Theses},
PDF = {https://tel.archives-ouvertes.fr/tel-01127108/file/2014NICE4088.pdf},
HAL_ID = {tel-01127108},
HAL_VERSION = {v1},

}

@phdthesis{nisse:tel-00998854,
TITLE = {{Algorithmic complexity: Between Structure and Knowledge How Pursuit-evasion Games help.}},
AUTHOR = {Nisse, Nicolas},
URL = {https://tel.archives-ouvertes.fr/tel-00998854},
SCHOOL = {{Universit{\'e} Nice Sophia Antipolis}},
YEAR = {2014},
MONTH = May,
KEYWORDS = {Algorithm ; Graph Theory ; Pursuit-Evasion Games ; Cops and Robber ; Graph Searching ; Graph decompositions ; Graph Structural Properties ; Mobile Agents Computing ; Telecommunication Networks ; Routing ; Distributed Computing ; Algorithmes ; Th eorie des Graphes ; Jeux de Poursuite- Evasion ; Gendarmes et voleur ; Encerclement dans les graphes ; D ecompositions de graphes ; Propri et es structurelles de graphes ; Agents Mobiles ; R eseaux de t el ecommunication ; Routage ; Calcul distribu {\'e}},
TYPE = {Habilitation {\`a} diriger des recherches},
PDF = {https://tel.archives-ouvertes.fr/tel-00998854/file/hdr_Nisse.pdf},
HAL_ID = {tel-00998854},
HAL_VERSION = {v1},

}

@phdthesis{oliveira:tel-01127012,
TITLE = {{Subdivisions of digraphs}},
AUTHOR = {Oliveira, Ana Karolinna Maia de},
URL = {https://tel.archives-ouvertes.fr/tel-01127012},
NUMBER = {2014NICE4084},
SCHOOL = {{Universit{\'e} Nice Sophia Antipolis}},
YEAR = {2014},
MONTH = Nov,
KEYWORDS = {Digraph ; Subdivision ; Linkage ; Oriented graphs ; Digraphe ; Graphes orient{\'e}s},
TYPE = {Theses},
PDF = {https://tel.archives-ouvertes.fr/tel-01127012/file/2014NICE4084.pdf},
HAL_ID = {tel-01127012},
HAL_VERSION = {v1},

}

@phdthesis{phan:tel-01127256,
TITLE = {{Design and management of networks with low power consumption}},
AUTHOR = {Phan, Truong Khoa},
URL = {https://tel.archives-ouvertes.fr/tel-01127256},
NUMBER = {2014NICE4065},
SCHOOL = {{Universit{\'e} Nice Sophia Antipolis}},
YEAR = {2014},
MONTH = Sep,
KEYWORDS = {Software defined networks ; Open Shortest Path First ; Energy-aware routing ; Redundancy elimination ; Routage conscience-{\'e}nergie ; {\'E}limination de redondance},
TYPE = {Theses},
PDF = {https://tel.archives-ouvertes.fr/tel-01127256/file/2014NICE4065.pdf},
HAL_ID = {tel-01127256},
HAL_VERSION = {v1},

}

@article{araujo:hal-01104634,
TITLE = {{Eulerian and Hamiltonian dicycles in directed hypergraphs}},
AUTHOR = {Araujo, Julio and Bermond, Jean-Claude and Ducoffe, Guillaume},
URL = {https://hal.archives-ouvertes.fr/hal-01104634},
JOURNAL = {{Discrete Mathematics, Algorithms and Applications}},
PUBLISHER = {{World Scientific Publishing}},
VOLUME = {06},
PAGES = {1450012},
YEAR = {2014},
DOI = {10.1142/S1793830914500128},
KEYWORDS = {Eulerian and Hamiltonian dicycles ; 11xxx ; de Bruijn dihyper-graphs Mathematics Subject Classification 2000: 11xxx ; Directed hypergraphs},
PDF = {https://hal.archives-ouvertes.fr/hal-01104634/file/dihypergraphs-article.pdf},
HAL_ID = {hal-01104634},
HAL_VERSION = {v2},

}

@article{araujo:hal-01109194,
TITLE = {{Weighted Coloring in Trees}},
AUTHOR = {Araujo, Julio and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-01109194},
JOURNAL = {{Siam Journal on Discrete Mathematics}},
PUBLISHER = {{Society for Industrial and Applied Mathematics}},
VOLUME = {28},
NUMBER = {4},
PAGES = {2029 - 2041},
YEAR = {2014},
DOI = {10.1137/140954167},
PDF = {https://hal.inria.fr/hal-01109194/file/journal.pdf},
HAL_ID = {hal-01109194},
HAL_VERSION = {v1},

}

@article{campos:hal-00951135,
TITLE = {{Maximization Coloring Problems on graphs with few P4s}},
AUTHOR = {Campos, Victor and Linhares Sales, Claudia and Maia, Ana Karolinna and Sampaio, Rudini},
URL = {https://hal.inria.fr/hal-00951135},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {164},
NUMBER = {2},
PAGES = {539-546},
YEAR = {2014},
MONTH = Feb,
DOI = {10.1016/j.dam.2013.10.031},
PDF = {https://hal.inria.fr/hal-00951135/file/maxcol_revised.pdf},
HAL_ID = {hal-00951135},
HAL_VERSION = {v1},

}

@article{classen:hal-01070780,
TITLE = {{Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks}},
AUTHOR = {Classen, Grit and Coudert, David and Koster, Arie and Nepomuceno, Napoleao},
URL = {https://hal.inria.fr/hal-01070780},
JOURNAL = {{INFORMS Journal on Computing}},
PUBLISHER = {{Institute for Operations Research and the Management Sciences (INFORMS)}},
VOLUME = {26},
NUMBER = {4},
PAGES = {893-909},
YEAR = {2014},
DOI = {10.1287/ijoc.2014.0605},
KEYWORDS = {network reliability ; fixed wireless networks ; capacitated network design ; integer programming ; chance-constrained programming},
PDF = {https://hal.inria.fr/hal-01070780/file/CCKN14.pdf},
HAL_ID = {hal-01070780},
HAL_VERSION = {v1},

}

@article{coudert:hal-01070768,
TITLE = {{Recognition of C4-free and 1/2-hyperbolic graphs}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume},
URL = {https://hal.inria.fr/hal-01070768},
JOURNAL = {{Siam Journal on Discrete Mathematics}},
PUBLISHER = {{Society for Industrial and Applied Mathematics}},
VOLUME = {28},
NUMBER = {3},
PAGES = {1601-1617},
YEAR = {2014},
MONTH = Sep,
DOI = {10.1137/140954787},
KEYWORDS = {rectangular matrix multiplication ; Hyperbolicity ; discrete metric space ; graph algorithms ; C4-free graphs ; rectangular matrix multiplication.},
PDF = {https://hal.inria.fr/hal-01070768/file/CoDu14.pdf},
HAL_ID = {hal-01070768},
HAL_VERSION = {v1},

}

@article{fomin:hal-00966985,
TITLE = {{To satisfy impatient Web surfers is hard}},
AUTHOR = {Fomin, Fedor V. and Giroire, Fr{\'e}d{\'e}ric and Jean-Marie, Alain and Mazauric, Dorian and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-00966985},
JOURNAL = {{Journal of Theoretical Computer Science (TCS)}},
PUBLISHER = {{Elsevier}},
VOLUME = {526},
PAGES = {1-17},
YEAR = {2014},
MONTH = Mar,
DOI = {10.1016/j.tcs.2014.01.009},
PDF = {https://hal.inria.fr/hal-00966985/file/FGJMN.pdf},
HAL_ID = {hal-00966985},
HAL_VERSION = {v1},

}

@article{havet:hal-00957243,
TITLE = {{(Circular) backbone colouring: forest backbones in planar graphs}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and King, Andrew D. and Liedloff, Mathieu and Todinca, Ioan},
URL = {https://hal.inria.fr/hal-00957243},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {169},
PAGES = {119-134},
YEAR = {2014},
DOI = {10.1016/j.dam.2014.01.011},
PDF = {https://hal.inria.fr/hal-00957243/file/complexity-backbone.pdf},
HAL_ID = {hal-00957243},
HAL_VERSION = {v1},

}

@article{havet:hal-01179209,
TITLE = {{List circular backbone colouring}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and King, Andrew},
URL = {https://hal.inria.fr/hal-01179209},
NOTE = {Graph Theory},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{Discrete Mathematics \& Theoretical Computer Science}},
VOLUME = {Vol. 16 no. 1 (in progress)},
NUMBER = {1},
PAGES = {89--104},
YEAR = {2014},
MONTH = Mar,
KEYWORDS = {Discrete Mathematics ; Graph Theory},
PDF = {https://hal.inria.fr/hal-01179209/file/dmtcs-16-1-6.pdf},
HAL_ID = {hal-01179209},
HAL_VERSION = {v1},

}

@article{havet:hal-01110978,
TITLE = {{Detection number of bipartite graphs and cubic graphs}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Paramaguru, Nagarajan and Sampathkumar, Rathinaswamy},
URL = {https://hal.inria.fr/hal-01110978},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {Vol. 16 no. 3 (in progress)},
NUMBER = {3},
PAGES = {333-342},
YEAR = {2014},
MONTH = Dec,
PDF = {https://hal.inria.fr/hal-01110978/file/dmtcs-16-3-20.pdf},
HAL_ID = {hal-01110978},
HAL_VERSION = {v1},

}

@inproceedings{araujo:hal-01076904,
TITLE = {{On the proper orientation number of bipartite graphs}},
AUTHOR = {Araujo, Julio and Cohen, Nathann and de Rezende, Susanna and Havet, Fr{\'e}d{\'e}ric and Moura, Phablo},
URL = {https://hal.archives-ouvertes.fr/hal-01076904},
BOOKTITLE = {{9th International colloquium on graph theory and combinatorics}},
ADDRESS = {Grenoble, France},
YEAR = {2014},
MONTH = Jun,
KEYWORDS = {proper orientation ; graph colouring ; bipartite graph ; hardness},
PDF = {https://hal.archives-ouvertes.fr/hal-01076904/file/proper-orientation-EA-ICGT.pdf},
HAL_ID = {hal-01076904},
HAL_VERSION = {v1},

}

@inproceedings{araujo:hal-00931523,
TITLE = {{Weighted Coloring in Trees}},
AUTHOR = {Ara{\'u}jo, Julio and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-00931523},
BOOKTITLE = {{31st Symposium on Theoretical Aspects of Computer Science (STACS)}},
ADDRESS = {Lyon, France},
PUBLISHER = {{Dagstuhl Publishing}},
PAGES = {75-86},
YEAR = {2014},
MONTH = Mar,
PDF = {https://hal.inria.fr/hal-00931523/file/STACS14.pdf},
HAL_ID = {hal-00931523},
HAL_VERSION = {v1},

}

@inproceedings{coudert:hal-00983492,
TITLE = {{Dynamic Routing and Spectrum Assignment with Non-Disruptive Defragmentation}},
AUTHOR = {Coudert, David and Jaumard, Brigitte and Moataz, Fatima Zahra},
URL = {https://hal.archives-ouvertes.fr/hal-00983492},
BOOKTITLE = {{ALGOTEL 2014 -- 16{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Le Bois-Plage-en-R{\'e}, France},
PAGES = {1-4},
YEAR = {2014},
MONTH = Jun,
PDF = {https://hal.archives-ouvertes.fr/hal-00983492/file/DynamicRSAwithNonDisruptiveDefragentation.pdf},
HAL_ID = {hal-00983492},
HAL_VERSION = {v1},

}

@inproceedings{coudert:hal-00982366,
TITLE = {{Robust Optimization for Energy-aware Routing with Redundancy Elimination}},
AUTHOR = {Coudert, David and Kodjo, Alvinice and Phan, Khoa},
URL = {https://hal.inria.fr/hal-00982366},
BOOKTITLE = {{ALGOTEL 2014 -- 16{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Le-Bois-Plage-en-R{\'e}, France},
PAGES = {1-4},
YEAR = {2014},
MONTH = Jun,
PDF = {https://hal.inria.fr/hal-00982366/file/CKP--final.pdf},
HAL_ID = {hal-00982366},
HAL_VERSION = {v1},

}

@inproceedings{coudert:hal-00966851,
TITLE = {{Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth}},
AUTHOR = {Coudert, David and Mazauric, Dorian and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-00966851},
BOOKTITLE = {{13th International Symposium on Experimental Algorithms}},
ADDRESS = {Copenhagen, Denmark},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8504},
PAGES = {46-58},
YEAR = {2014},
PDF = {https://hal.inria.fr/hal-00966851/file/RR-8470.pdf},
HAL_ID = {hal-00966851},
HAL_VERSION = {v1},

}

@inproceedings{dangelo:hal-01072723,
TITLE = {{Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments}},
AUTHOR = {D'Angelo, Gianlorenzo and D{\'e}fago, Xavier and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01072723},
BOOKTITLE = {{Second International Symposium on Computing and Networking (CANDAR)}},
ADDRESS = {Mt. Fuji, Shizuoka, Japan},
YEAR = {2014},
MONTH = Dec,
PDF = {https://hal.inria.fr/hal-01072723/file/stimergyRobotsRevised_10pages.pdf},
HAL_ID = {hal-01072723},
HAL_VERSION = {v1},

}

@inproceedings{dangelo:hal-00931514,
TITLE = {{Gathering and Exclusive Searching on Rings under Minimal Assumptions}},
AUTHOR = {D'Angelo, Gianlorenzo and Navarra, Alfredo and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-00931514},
BOOKTITLE = {{15th International Conference on Distributed Computing and Networking (ICDCN)}},
ADDRESS = {Coimbatore, India},
EDITOR = {Mainak Chatterjee and Jian-Nong Cao and Kishore Kothapalli and Sergio Rajsbaum},
PUBLISHER = {{Springer}},
VOLUME = {8314},
PAGES = {149-164},
YEAR = {2014},
MONTH = Jan,
DOI = {10.1007/978-3-642-45249-9\_10},
PDF = {https://hal.inria.fr/hal-00931514/file/ICDCN14_cameraReady.pdf},
HAL_ID = {hal-00931514},
HAL_VERSION = {v1},

}

@inproceedings{giroire:hal-01070576,
TITLE = {{Optimizing Rule Placement in Software-Defined Networks for Energy-aware Routing}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna and Khoa Phan, Truong},
URL = {https://hal.inria.fr/hal-01070576},
BOOKTITLE = {{IEEE GLOBECOM}},
ADDRESS = {Austin Texas, United States},
ORGANIZATION = {{IEEE}},
YEAR = {2014},
MONTH = Dec,
KEYWORDS = {networking ; SDN ; Energy Aware routing},
PDF = {https://hal.inria.fr/hal-01070576/file/bare_conf.pdf},
HAL_ID = {hal-01070576},
HAL_VERSION = {v1},

}

@inproceedings{kodjo:hal-00946419,
TITLE = {{Optimisation robuste pour le partage de r{\'e}seaux d'acc{\`e}s micro-ondes entre op{\'e}rateurs}},
AUTHOR = {Kodjo, Alvinice and Coudert, David and Caillouet, Christelle},
URL = {https://hal.archives-ouvertes.fr/hal-00946419},
BOOKTITLE = {{ROADEF - 15{\`e}me congr{\`e}s annuel de la Soci{\'e}t{\'e} fran{\c c}aise de recherche op{\'e}rationnelle et d'aide {\`a} la d{\'e}cision}},
ADDRESS = {Bordeaux, France},
ORGANIZATION = {{Soci{\'e}t{\'e} fran{\c c}aise de recherche op{\'e}rationnelle et d'aide {\`a} la d{\'e}cision}},
HAL_LOCAL_REFERENCE = {Optimisation dans les r{\'e}seaux et applications t{\'e}l{\'e}com},
YEAR = {2014},
MONTH = Feb,
KEYWORDS = {Wireless backhaul network ; robust optimization ; infrastructure sharing},
HAL_ID = {hal-00946419},
HAL_VERSION = {v1},

}

@inproceedings{lecuyer:hal-01100757,
TITLE = {{XRay: Enhancing the Web's Transparency with Differential Correlation}},
AUTHOR = {Lecuyer, Mathias and Ducoffe, Guillaume and Lan, Francis and Papancea, Andrei and Petsios, Theofilos and Spahn, Riley and Chaintreau, Augustin and Geambasu, Roxana},
URL = {https://hal.archives-ouvertes.fr/hal-01100757},
NOTE = {Extended version of a paper presented at the 23rd USENIX Security Symposium (USENIX Security 14)},
BOOKTITLE = {{USENIX Security Symposium}},
ADDRESS = {San Diego, United States},
YEAR = {2014},
MONTH = Aug,
PDF = {https://hal.archives-ouvertes.fr/hal-01100757/file/1407.2323v2.pdf},
HAL_ID = {hal-01100757},
HAL_VERSION = {v1},

}

@inproceedings{li:hal-01023904,
TITLE = {{Minimum Size Tree-Decompositions}},
AUTHOR = {Li, Bi and Moataz, Fatima Zahra and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01023904},
BOOKTITLE = {{9th International colloquium on graph theory and combinatorics (ICGT)}},
ADDRESS = {Grenoble, France},
YEAR = {2014},
PDF = {https://hal.inria.fr/hal-01023904/file/ICGT_V5.pdf},
HAL_ID = {hal-01023904},
HAL_VERSION = {v1},

}

@techreport{agarwal:hal-01078378,
TITLE = {{Unveiling Contacts within Macro-molecular assemblies by solving Minimum Weight Connectivity Inference Problems}},
AUTHOR = {Agarwal, Deepesh and Caillouet, Christelle and Coudert, David and Cazals, Fr{\'e}d{\'e}ric},
URL = {https://hal.archives-ouvertes.fr/hal-01078378},
TYPE = {Research Report},
NUMBER = {RR-8622},
INSTITUTION = {{Inria}},
YEAR = {2014},
MONTH = Oct,
KEYWORDS = {Molecular machines ; Mixed integer linear program ; Biophysics ; Mass spectrometry ; Protein assembly ; Structural biology ; Connectivity Inference Connected induced sub-graphs},
PDF = {https://hal.archives-ouvertes.fr/hal-01078378/file/RR-8622-MWCI-v2.pdf},
HAL_ID = {hal-01078378},
HAL_VERSION = {v2},

}

@techreport{araujo:hal-00957453,
TITLE = {{On the proper orientation number of bipartite graphs}},
AUTHOR = {Araujo, Julio and Cohen, Nathann and De Rezende, Susanna F. and Havet, Fr{\'e}d{\'e}ric and Moura, Phablo},
URL = {https://hal.inria.fr/hal-00957453},
TYPE = {Research Report},
NUMBER = {RR-8492},
PAGES = {23},
INSTITUTION = {{INRIA}},
YEAR = {2014},
MONTH = Mar,
KEYWORDS = {proper orientation ; graph colouring ; bipartite graph},
PDF = {https://hal.inria.fr/hal-00957453/file/RR-8492.pdf},
HAL_ID = {hal-00957453},
HAL_VERSION = {v1},

}

@techreport{araujo:hal-01088698,
TITLE = {{Steinberg-like theorems for backbone colouring}},
AUTHOR = {Araujo, Julio and Havet, Fr{\'e}d{\'e}ric and Schmitt, Mathieu},
URL = {https://hal.inria.fr/hal-01088698},
TYPE = {Research Report},
NUMBER = {RR-8641},
INSTITUTION = {{INRIA Sophia Antipolis ; INRIA}},
YEAR = {2014},
MONTH = Nov,
PDF = {https://hal.inria.fr/hal-01088698/file/RR-8641.pdf},
HAL_ID = {hal-01088698},
HAL_VERSION = {v1},

}

@techreport{bangjensen:hal-01088664,
TITLE = {{The complexity of finding arc-disjoint branching flows}},
AUTHOR = {Bang-Jensen, Joergen and Havet, Fr{\'e}d{\'e}ric and Yeo, Anders},
URL = {https://hal.inria.fr/hal-01088664},
TYPE = {Research Report},
NUMBER = {RR-8640},
INSTITUTION = {{INRIA Sophia Antipolis ; INRIA}},
YEAR = {2014},
MONTH = Nov,
KEYWORDS = {disjoint branchings ; branching flow ; polynomial algorithm ; NP-complete},
PDF = {https://hal.inria.fr/hal-01088664/file/RR-8640.pdf},
HAL_ID = {hal-01088664},
HAL_VERSION = {v1},

}

@techreport{cohen:hal-00989024,
TITLE = {{Applying clique-decomposition for computing Gromov hyperbolicity}},
AUTHOR = {Cohen, Nathann and Coudert, David and Ducoffe, Guillaume and Lancin, Aur{\'e}lien},
URL = {https://hal.inria.fr/hal-00989024},
TYPE = {Research Report},
NUMBER = {RR-8535},
PAGES = {33},
INSTITUTION = {{INRIA}},
YEAR = {2014},
MONTH = Jun,
KEYWORDS = {Hyperbolicity ; Algorithms ; Graphs ; Decomposition},
PDF = {https://hal.inria.fr/hal-00989024/file/RR-8535-v2.pdf},
HAL_ID = {hal-00989024},
HAL_VERSION = {v2},

}

@techreport{coudert:hal-01088423,
TITLE = {{Diameter of Minimal Separators in Graphs}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01088423},
TYPE = {Research Report},
NUMBER = {RR-8639},
PAGES = {16},
INSTITUTION = {{Inria Sophia Antipolis ; I3S ; INRIA}},
YEAR = {2014},
MONTH = Nov,
PDF = {https://hal.inria.fr/hal-01088423/file/RR-8639_dec2014.pdf},
HAL_ID = {hal-01088423},
HAL_VERSION = {v2},

}

@techreport{coudert:hal-00937935,
TITLE = {{On the recognition of $C\_4$-free and $1/2$-hyperbolic graphs}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume},
URL = {https://hal.inria.fr/hal-00937935},
TYPE = {Research Report},
NUMBER = {RR-8458},
PAGES = {20},
INSTITUTION = {{INRIA}},
YEAR = {2014},
MONTH = Jan,
PDF = {https://hal.inria.fr/hal-00937935/file/RR-8458v2.pdf},
HAL_ID = {hal-00937935},
HAL_VERSION = {v2},

}

@techreport{coudert:hal-00936745,
TITLE = {{Robust Energy-aware Routing with Redundancy Elimination}},
AUTHOR = {Coudert, David and Kodjo, Alvinice and Phan, Khoa},
URL = {https://hal.inria.fr/hal-00936745},
TYPE = {Research Report},
NUMBER = {RR-8457},
INSTITUTION = {{INRIA}},
YEAR = {2014},
MONTH = Jan,
KEYWORDS = {Robust Network Optimization ; Green Networking ; Energy-aware Routing ; Redundancy Elimination},
PDF = {https://hal.inria.fr/hal-00936745/file/RR-8457.pdf},
HAL_ID = {hal-00936745},
HAL_VERSION = {v1},

}

@techreport{coudert:hal-00943549,
TITLE = {{Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth}},
AUTHOR = {Coudert, David and Mazauric, Dorian and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-00943549},
TYPE = {Research Report},
NUMBER = {RR-8470},
PAGES = {301},
INSTITUTION = {{INRIA}},
YEAR = {2014},
MONTH = Feb,
KEYWORDS = {Pathwidth ; vertex-separation ; branch-and-bound ; Sage},
PDF = {https://hal.inria.fr/hal-00943549/file/RR-8470.pdf},
HAL_ID = {hal-00943549},
HAL_VERSION = {v1},

}

@techreport{dangelo:hal-01073368,
TITLE = {{Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments}},
AUTHOR = {D'Angelo, Gianlorenzo and D{\'e}fago, Xavier and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01073368},
TYPE = {Research Report},
NUMBER = {RR-8614},
INSTITUTION = {{Inria}},
YEAR = {2014},
PDF = {https://hal.inria.fr/hal-01073368/file/RR-8614.pdf},
HAL_ID = {hal-01073368},
HAL_VERSION = {v1},

}

@techreport{giroire:hal-01097910,
TITLE = {{Compressing Two-dimensional Routing Tables with Order}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Havet, Fr{\'e}d{\'e}ric and Moulierac, Joanna},
URL = {https://hal.inria.fr/hal-01097910},
TYPE = {Research Report},
NUMBER = {RR-8658},
INSTITUTION = {{INRIA Sophia Antipolis ; INRIA}},
YEAR = {2014},
MONTH = Dec,
KEYWORDS = {compact tables. ; FPT ; approximation algorithm ; routing ; routing tables ; software defined networks ; complexity},
PDF = {https://hal.inria.fr/hal-01097910/file/RR-8658.pdf},
HAL_ID = {hal-01097910},
HAL_VERSION = {v1},

}

@techreport{giroire:hal-00996780,
TITLE = {{Optimizing Rule Placement in Software-Defined Networks for Energy-aware Routing}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna and Phan, T. Khoa},
URL = {https://hal.inria.fr/hal-00996780},
TYPE = {Research Report},
NUMBER = {RR-8537},
PAGES = {23},
INSTITUTION = {{INRIA}},
YEAR = {2014},
MONTH = May,
PDF = {https://hal.inria.fr/hal-00996780/file/RR-8537.pdf},
HAL_ID = {hal-00996780},
HAL_VERSION = {v1},

}

@techreport{giroire:hal-01095179,
TITLE = {{Grid spanners with low forwarding index for energy efficient networks}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and P{\'e}rennes, St{\'e}phane and Tahiri, Issam},
URL = {https://hal.inria.fr/hal-01095179},
TYPE = {Research Report},
NUMBER = {RR-8643},
INSTITUTION = {{INRIA Sophia Antipolis ; INRIA}},
YEAR = {2014},
MONTH = Dec,
PDF = {https://hal.inria.fr/hal-01095179/file/report.pdf},
HAL_ID = {hal-01095179},
HAL_VERSION = {v1},

}

@techreport{havet:hal-00943152,
TITLE = {{Splitting a tournament into two subtournaments with given minimum outdegree}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Lidicky, Bernard},
URL = {https://hal.inria.fr/hal-00943152},
TYPE = {Research Report},
NUMBER = {RR-8469},
INSTITUTION = {{INRIA}},
YEAR = {2014},
MONTH = Feb,
PDF = {https://hal.inria.fr/hal-00943152/file/RR-8469.pdf},
HAL_ID = {hal-00943152},
HAL_VERSION = {v1},

}

@techreport{li:hal-01074177,
TITLE = {{Size-Constrained Tree Decompositions}},
AUTHOR = {Li, Bi and Moataz, Fatima Zahra and Nisse, Nicolas and Suchan, Karol},
URL = {https://hal.inria.fr/hal-01074177},
TYPE = {Research Report},
INSTITUTION = {{INRIA Sophia-Antipolis}},
YEAR = {2014},
MONTH = Oct,
PDF = {https://hal.inria.fr/hal-01074177/file/ReportV1.pdf},
HAL_ID = {hal-01074177},
HAL_VERSION = {v1},

}

@techreport{markou:hal-00980877,
TITLE = {{Exclusive Graph Searching vs. Pathwidth}},
AUTHOR = {Markou, Euripides and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-00980877},
TYPE = {Research Report},
NUMBER = {RR-8523},
INSTITUTION = {{INRIA}},
YEAR = {2014},
KEYWORDS = {graph searching ; pathwidth ; computational complexity ; monotone strategies ; exclusivity property},
PDF = {https://hal.inria.fr/hal-00980877/file/RR-8523.pdf},
HAL_ID = {hal-00980877},
HAL_VERSION = {v1},

}

@techreport{moulierac:hal-00996779,
TITLE = {{Optimizing IGP Link Weights for Energy-efficiency in a Changing World}},
AUTHOR = {Moulierac, Joanna and Phan, Khoa},
URL = {https://hal.inria.fr/hal-00996779},
TYPE = {Research Report},
NUMBER = {RR-8534},
PAGES = {21},
INSTITUTION = {{INRIA}},
YEAR = {2014},
MONTH = May,
KEYWORDS = {Robust Network Optimization ; Energy-aware Routing ; Green Networking ; Traffic Engineering},
PDF = {https://hal.inria.fr/hal-00996779/file/RR-8534.pdf},
HAL_ID = {hal-00996779},
HAL_VERSION = {v1},

}

@proceedings{baldoni:hal-00931478,
X-PROCEEDINGS = {yes},
AUTHOR = {Baldoni, R. and Nisse, N. and Van Steen, M.},
TITLE = {Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)},
YEAR = {2013},
MONTH = Dec,
EDITOR = {Roberto Baldoni and N. Nisse and Maarten van Steen},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
PAGES = {280},
VOLUME = {8304},
X-INTERNATIONAL-AUDIENCE = {yes},
URL = {http://hal.inria.fr/hal-00931478},
X-ID-HAL = {hal-00931478},

}

@proceedings{busnel:hal-00931481,
X-PROCEEDINGS = {yes},
AUTHOR = {Busnel, Y. and Nisse, N. and Rousseau, F.},
TITLE = {Actes des 15es Rencontres Francophones sur les aspects Algorithmiques des T�l�communications (AlgoTel)},
YEAR = {2013},
MONTH = May,
EDITOR = {Yann Busnel and N. Nisse and Franck Rousseau},
PUBLISHER = {Univ. Nantes},
PAGES = {130},
X-INTERNATIONAL-AUDIENCE = {no},
URL = {http://hal.inria.fr/hal-00931481},
X-ID-HAL = {hal-00931481},

}

@phdthesis{modrzejewski:tel-00917032,
AUTHOR = {Modrzejewski, R.},
TITLE = {Distribution et stockage dans les r�seaux},
YEAR = {2013},
MONTH = Oct,
SCHOOL = {Universit� Nice Sophia Antipolis},
PDF={http://hal.inria.fr/tel-00917032/PDF/2013NICE4075.pdf},
URL = {http://hal.inria.fr/tel-00917032},
X-ID-HAL = {tel-00917032},

}

@phdthesis{pardosoares:tel-00908227,
AUTHOR = {Pardo Soares, R.},
TITLE = {Jeux de Poursuite-Evasion, D�compositions et Convexit� dans les Graphes},
YEAR = {2013},
MONTH = Nov,
SCHOOL = {Universit� Nice Sophia Antipolis},
PDF={http://hal.inria.fr/tel-00908227/PDF/Thesis-Ronan-22112013.pdf},
URL = {http://hal.inria.fr/tel-00908227},
X-ID-HAL = {tel-00908227},

}

@article{addarioberry:hal-00821609,
AUTHOR = {Addario-Berry, L. and Havet, F. and Linhares Sales, C. and Reed, B. and Thomass�, S.},
TITLE = {Oriented trees in digraphs},
JOURNAL = {Discrete Mathematics},
PUBLISHER = {Elsevier},
VOLUME = {313},
NUMBER = {8},
PAGES = {967-974},
YEAR = {2013},
URL2 = {http://www.sciencedirect.com/science/article/pii/S0012365X13000289},
DOI = {10.1016/j.disc.2013.01.011},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00821609},
X-ID-HAL = {hal-00821609},

}

@article{araujo:hal-00770650,
AUTHOR = {Araujo, J. and Campos, V. and Giroire, F. and Nisse, N. and Sampaio, L. and Soares, R},
TITLE = {On the hull number of some graph classes},
JOURNAL = {Theoretical Computer Science},
PUBLISHER = {Elsevier},
VOLUME = {475},
PAGES = {1-12},
YEAR = {2013},
MONTH = Jan,
DOI = {10.1016/j.tcs.2012.12.035},
PDF={http://hal.inria.fr/hal-00770650/PDF/Hull-TCS-Corrected.pdf},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00770650},
X-ID-HAL = {hal-00770650},

}

@article{araujo:hal-00773410,
AUTHOR = {Araujo, J. and Linhares Sales, C.},
TITLE = {A Haj�s-like theorem for weighted coloring},
JOURNAL = {Journal of the Brazilian Computer Society},
PUBLISHER = {Springer},
VOLUME = {19},
NUMBER = {3},
PAGES = {275-278},
YEAR = {2013},
MONTH = Jan,
DOI = {10.1007/s13173-012-0098-y},
PDF={http://hal.inria.fr/hal-00773410/PDF/hajos\_journalSBC.pdf},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00773410},
X-ID-HAL = {hal-00773410},

}

@article{bermond:hal-00869501,
AUTHOR = {Bermond, J-C. and Cosnard, M. and P�rennes, S.},
TITLE = {Directed acyclic graphs with the unique dipath property},
JOURNAL = {Theoretical Computer Science},
VOLUME = {504},
PAGES = {5-11},
YEAR = {2013},
MONTH = Sep,
DOI = {10.1016/j.tcs.2012.06.015},
PDF={http://hal.inria.fr/hal-00869501/PDF/tcs270412.pdf},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00869501},
X-ID-HAL = {hal-00869501},

}

@article{bermond:hal-00905187,
AUTHOR = {Bermond, J-C. and Gargano, L. and P�rennes, S. and Rescigno, A. A. and Vaccaro, U.},
TITLE = {Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas},
JOURNAL = {Journal of Theoretical Computer Science (TCS)},
PUBLISHER = {Elsevier},
VOLUME = {509},
PAGES = {122-139},
YEAR = {2013},
MONTH = Oct,
DOI = {10.1016/j.tcs.2013.03.017},
PDF={http://hal.inria.fr/hal-00905187/PDF/journal-revised-II-15-1-13.pdf},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00905187},
X-ID-HAL = {hal-00905187},

}

@article{bermond:hal-00907494,
AUTHOR = {Bermond, J-C. and Klasing, R. and Morales, N. and P�rennes, S. and Reyes, P.},
TITLE = {Gathering radio messages in the path},
JOURNAL = {Discrete Mathematics, Algorithms and Applications},
PUBLISHER = {World Scientific},
VOLUME = {5},
NUMBER = {1},
PAGES = {1-28},
YEAR = {2013},
MONTH = Mar,
DOI = {10.1142/S1793830913500043},
PDF={http://hal.inria.fr/hal-00907494/PDF/path301012.pdf},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00907494},
X-ID-HAL = {hal-00907494},

}

@article{bessy:hal-00821598,
AUTHOR = {Bessy, S. and Havet, F.},
TITLE = {Enumerating the edge-colourings and total colourings of a regular graph},
JOURNAL = {Journal of Combinatorial Optimization},
PUBLISHER = {Springer},
VOLUME = {25},
NUMBER = {4},
PAGES = {523-535},
YEAR = {2013},
DOI = {10.1007/s10878-011-9448-5},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00821598},
X-ID-HAL = {hal-00821598},

}

@article{campos:hal-00821608,
AUTHOR = {Campos, V. and Havet, F. and Sampaio, R. and Silva, A.},
TITLE = {Backbone colouring: Tree backbones with small diameter in planar graphs},
JOURNAL = {Theoretical Computer Science},
PUBLISHER = {Elsevier},
VOLUME = {487},
PAGES = {50-64},
YEAR = {2013},
URL2 = {http://www.sciencedirect.com/science/article/pii/S0304397513001941},
DOI = {10.1016/j.tcs.2013.03.003},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00821608},
X-ID-HAL = {hal-00821608},

}

@article{caron:hal-00880902,
AUTHOR = {Caron, S. and Giroire, F. and Mazauric, D. and Monteiro, J. and P�rennes, S.},
TITLE = {P2P Storage Systems: Study of Different Placement Policies},
JOURNAL = {Peer-to-Peer Networking and Applications},
PUBLISHER = {Springer},
YEAR = {2013},
MONTH = Mar,
DOI = {10.1007/s12083-013-0203-9},
PDF={http://hal.inria.fr/hal-00880902/PDF/placement-journal.pdf},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00880902},
X-ID-HAL = {hal-00880902},

}

@article{CDD+12,
title = {{Engineering a new algorithm for distributed shortest paths on dynamic networks}},
author = {Cicerone, S. and D'Angelo, G. and Di Stefano, G. and Frigioni, D. and Maurizio, V.},
journal = {Algorithmica},
year = {2013},
volume = {66},
number = {1},
pages = {51-86},
month = may,
publisher = {Springer},
abstract = {{We study the problem of dynamically updatingall-pairs shortest paths in a distributed network while edge update operations occur to the network. We consider the practical case of a dynamic network in which an edge update can occur while one or more other edge updates are under processing. A node of the network might be affected by a subset of these changes, thus being involved in the concurrent executions related to such changes. In this paper, we provide a new algorithm for this problem, and experimentally compare its performance with respect to those of the most popular solutions in the literature: the classical distributed Bellman-Ford method, which is still used in real network and implemented in the RIP protocol, and DUAL, the Diffuse Update ALgorithm, which is part of CISCO's widely used EIGRP protocol. As input to the algorithms, we used both real-world and artificial instances of the problem. The experiments performed show that the space occupancy per node required by the new algorithm is smaller than that required by both Bellman-Ford and DUAL. In terms of messages, the new algorithm outperforms both Bellman-Ford and DUAL on the real-world topologies, while on artificial instances, the new algorithm sends a number of messages that is more than that of DUAL and much smaller than that of Bellman-Ford.}},
doi = {10.1007/s00453-012-9623-9},
url = {http://hal.inria.fr/hal-00728876},
pdf = {http://hal.inria.fr/hal-00728876/PDF/main.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
x-pays = {IT},
sorte = "rev-int",

}

@article{FLL+12,
author = {Fang, W. and Liang, X. and Li, S. and Chiaraviglio, L. and Xiong, N.},
title = {{VMPlanner: Optimizing Virtual Machine Placement and Traffic Flow Routing to Reduce Network Power Costs in Cloud Data Centers}},
abstract = {{In recent years, the power costs of cloud data centers have become a practical concern and have attracted significant attention from both industry and academia. Most of the early works on data center energy efficiency have focused on the biggest power consumers (i.e., computer servers and cooling systems), yet without taking the networking part into consideration. However, recent studies have revealed that the network elements consume 10-20\% of the total power in the data center, which poses a great challenge to effectively reducing network power cost without adversely affecting overall network performance. Based on the analysis on topology characteristics and traffic patterns of data centers, this paper presents a novel approach, called VMPlanner, for network power reduction in the virtualization-based data centers. The basic idea of VMPlanner is to optimize both virtual machine placement and traffic flow routing so as to turn off as many unneeded network elements as possible for power saving. We formulate the optimization problem, analyze its hardness, and solve it by designing VMPlanner as a stepwise optimization approach with three approximation algorithms. VMPlanner is implemented and evaluated in a simulated environment with traffic traces collected from a data center test-bed, and the experiment results illustrate the efficacy and efficiency of this approach.}},
publisher = {Elsevier},
journal = {Computer Networks},
year = {2013},
volume = {57},
number = {1},
pages = {179-196},
month = jan,
url = {http://dx.doi.org/10.1016/j.comnet.2012.09.008},
pdf={http://www.telematica.polito.it/oldsite/chiaraviglio/papers/VMPlanner.pdf},
x-pays={CN,IT},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "inv-conf" 
}

@article{guillemot:hal-00821612,
AUTHOR = {Guillemot, S. and Havet, F. and Paul, C. and Perez, A.},
TITLE = {On the (non-)existence of polynomial kernels for $P\_l$-free edge modification problems},
JOURNAL = {Algorithmica},
PUBLISHER = {Springer},
VOLUME = {65},
NUMBER = {4},
PAGES = {900-926},
YEAR = {2013},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00821612},
X-ID-HAL = {hal-00821612},

}

@article{havet:hal-00905927,
AUTHOR = {Havet, F. and Sampaio, L.},
TITLE = {On the Grundy and b-chromatic numbers of a graph},
JOURNAL = {Algorithmica},
PUBLISHER = {Springer Verlag (Germany)},
VOLUME = {65},
NUMBER = {4},
PAGES = {885-899},
YEAR = {2013},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00905927},
X-ID-HAL = {hal-00905927},

}

@article{havet:hal-00821597,
AUTHOR = {Havet, F. and Zhu, X.},
TITLE = {The game Grundy number of graphs},
JOURNAL = {Journal of Combinatorial Optimization},
PUBLISHER = {Springer},
VOLUME = {25},
NUMBER = {4},
PAGES = {752-765},
YEAR = {2013},
DOI = {10.1007/s10878-012-9513-8},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00821597},
X-ID-HAL = {hal-00821597},

}

@article{lancin:hal-00924952,
AUTHOR = {Lancin, A. and Papadimitriou, D.},
TITLE = {DRMSim: A Routing-Model Simulator for Large-Scale Networks},
JOURNAL = {ERCIM News},
PUBLISHER = {ERCIM},
VOLUME = {94},
PAGES = {31-32},
YEAR = {2013},
MONTH = Jul,
URL2 = {http://ercim-news.ercim.eu/en94/ri/drmsim-a-routing-model-simulator-for-large-scale-networks},
X-INTERNATIONAL-AUDIENCE = {yes},
X-SCIENTIFIC-POPULARIZATION = {yes},
URL = {http://hal.inria.fr/hal-00924952},
X-ID-HAL = {hal-00924952},

}

@inproceedings{agarwal:hal-00849873,
AUTHOR = {Agarwal, D. and Araujo, J. and Caillouet, C. and Cazals, F. and Coudert, D. and Perennes, S.},
TITLE = {Connectivity Inference in Mass Spectrometry based Structure Determination},
BOOKTITLE = {European Symposium on Algorithms},
YEAR = {2013},
SERIES = {Lecture Notes in Computer Science - LNCS},
URL2 = {http://link.springer.com/chapter/10.1007%2F978-3-642-40450-4\_25},
EDITOR = {Bodlaender, H.L. and Italiano, G.F.},
DOI = {10.1007/978-3-642-40450-4\_25},
PUBLISHER = {Springer},
VOLUME = {8125},
PAGES = {289-300},
ADDRESS = {Sophia-Antipolis, France, France},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00849873},
X-ID-HAL = {hal-00849873},

}

@inproceedings{araujo:hal-00800273,
AUTHOR = {Araujo, J. and Giroire, F. and Liu, Y. and Modrzejewski, R. and Moulierac, J.},
TITLE = {Energy Efficient Content Distribution},
BOOKTITLE = {IEEE International Conference on Communications (ICC)},
YEAR = {2013},
MONTH = Jun,
DOI = {10.1109/ICC.2013.6655228},
PAGES = {4233-4238},
PDF={http://hal.inria.fr/hal-00800273/PDF/1569672533-6.pdf},
ADDRESS = {Budapest, Hungary},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00800273},
X-ID-HAL = {hal-00800273},

}

@inproceedings{araujo:hal-00799868,
AUTHOR = {Araujo, J. and Morel, G. and Sampaio, L. and Soares, R. and Weber, V.},
TITLE = {Hull number: P5-free graphs and reduction rules},
BOOKTITLE = {VII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS)},
YEAR = {2013},
MONTH = Mar,
PDF={http://hal.inria.fr/hal-00799868/PDF/hull2-LAGOS-corrected-ENDM-newfiliation.pdf},
ADDRESS = {Playa del Carmen, Mexico},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00799868},
X-ID-HAL = {hal-00799868},

}

@inproceedings{bermond:hal-00794638,
AUTHOR = {Bermond, J-C. and Coudert, D. and D'Angelo, G. and Moataz, F. Z.},
TITLE = {SRLG-Diverse Routing with the Star Property},
BOOKTITLE = {Design of Reliable Communication Networks, DRCN},
YEAR = {2013},
MONTH = Mar,
PDF={http://hal.inria.fr/hal-00794638/PDF/SRLG-Divrse\_Routing\_with\_the\_Star.pdf},
ADDRESS = {Budapest, Hungary},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00794638},
X-ID-HAL = {hal-00794638},

}

@inproceedings{bermond:hal-00817992,
AUTHOR = {Bermond, J-C. and Coudert, D. and D'Angelo, G. and Moataz, F. Z.},
TITLE = {Diverse Routing with Star SRLGs},
BOOKTITLE = {15�mes Rencontres Francophones sur les Aspects Algorithmiques des T�l�communications (AlgoTel)},
YEAR = {2013},
MONTH = May,
EDITOR = {Nisse, N. and Rousseau, Franck and Busnel, Yann},
PAGES = {1-4},
PDF={http://hal.inria.fr/hal-00817992/PDF/DiverseRoutingStarSRLG.pdf},
ADDRESS = {Pornic, France},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00817992},
X-ID-HAL = {hal-00817992},

}

@inproceedings{blin:hal-00845530,
AUTHOR = {Blin, L. and Burman, J. and Nisse, N.},
TITLE = {Exclusive Graph Searching},
BOOKTITLE = {21st European Symposium on Algorithms (ESA 2013)},
YEAR = {2013},
SERIES = {Lecture Notes in Computer Science / ARCoSS},
PUBLISHER = {Springer},
VOLUME = {LNCS 8125},
PAGES = {181-192},
PDF={http://hal.inria.fr/hal-00845530/PDF/paper\_201.pdf},
ADDRESS = {Sophia Antipolis, France},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00845530},
X-ID-HAL = {hal-00845530},

}

@inproceedings{caillouet:hal-00870931,
AUTHOR = {Caillouet, C. and Coudert, D. and Kodjo, A.},
TITLE = {Robust optimization in multi-operators microwave backhaul networks},
BOOKTITLE = {4th Global Information Infrastructure and Networking Symposium},
YEAR = {2013},
PUBLISHER = {IEEE},
PAGES = {1-6},
PDF={http://hal.inria.fr/hal-00870931/PDF/CCK13--GISS13.pdf},
ADDRESS = {Trento, Italy},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00870931},
X-ID-HAL = {hal-00870931},

}

@inproceedings{caillouet:hal-00840148,
AUTHOR = {Caillouet, C. and Koster, A.M.C.A.},
TITLE = {Robust Round Weighting with Traffic Uncertainty in Wireless Mesh Networks},
YEAR = {2013},
MONTH = Jul,
BOOKTITLE = {26th European Conference on Operational Research (EURO XXVI)},
ADDRESS = {Rome, Italy},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {no},
URL = {http://hal.inria.fr/hal-00840148},
X-ID-HAL = {hal-00840148},

}

@inproceedings{cohen:hal-00818441,
AUTHOR = {Cohen, N. and Coudert, D. and Lancin, A.},
TITLE = {Algorithme exact et approch� pour le calcul de l'hyperbolicit� d'un graphe},
BOOKTITLE = {15�mes Rencontres Francophones sur les Aspects Algorithmiques des T�l�communications (AlgoTel)},
YEAR = {2013},
MONTH = May,
EDITOR = {Nisse, N. and Rousseau, Franck and Busnel, Yann},
PAGES = {1-4},
NOTE = {Page 1-4},
PDF={http://hal.inria.fr/hal-00818441/PDF/algotel2013-rev.pdf},
ADDRESS = {Pornic, France},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00818441},
X-ID-HAL = {hal-00818441},

}

@inproceedings{coudert:hal-00862018,
AUTHOR = {Coudert, D. and Koster, A. and Phan, K. and Tieves, M.},
TITLE = {Robust Redundancy Elimination for Energy-aware Routing},
BOOKTITLE = {The 2013 IEEE International Conference on Green Computing and Communications (GreenCom 2013)},
YEAR = {2013},
MONTH = Aug,
PUBLISHER = {IEEE},
PDF={http://hal.inria.fr/hal-00862018/PDF/greencom-robust-woc.pdf},
ADDRESS = {Beijing, China},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00862018},
X-ID-HAL = {hal-00862018},

}

@inproceedings{dangelo:hal-00845546,
AUTHOR = {D'Angelo, G. and Di Stefano, G. and Navarra, A. and Nisse, N. and Suchan, K.},
TITLE = {A unified approach for different tasks on rings in robot-based computing systems},
BOOKTITLE = {15th Workshop on Advances in Parallel and Distributed Computational Models (IPDPS Workshop)},
YEAR = {2013},
PAGES = {667-676},
PDF={http://hal.inria.fr/hal-00845546/PDF/apdcm2013.pdf},
ADDRESS = {Boston, United States},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00845546},
X-ID-HAL = {hal-00845546},

}

@inproceedings{giroire:hal-00866058,
AUTHOR = {Giroire, F. and Gupta Kumar, S. and Modrzejewski, R. and Monteiro, J. and Perennes, S.},
TITLE = {Repair Time in Distributed Storage Systems},
BOOKTITLE = {6th International Conference on Data Management in Cloud, Grid and P2P Systems (Globe 2013)},
YEAR = {2013},
MONTH = Aug,
DOI = {10.1007/978-3-642-40053-7\_9},
PUBLISHER = {Springer},
VOLUME = {8059},
PAGES = {99-110},
PDF={http://hal.inria.fr/hal-00866058/PDF/globe-preprint.pdf},
ADDRESS = {Prague, Czech Republic},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00866058},
X-ID-HAL = {hal-00866058},

}

@inproceedings{giroire:hal-00845531,
AUTHOR = {Giroire, F. and Mazauric, D. and Nisse, N. and P�rennes, S. and Soares, R.},
TITLE = {Connected Surveillance Game},
BOOKTITLE = {20th Colloquium on Structural Information and Communication Complexity (SIROCCO)},
YEAR = {2013},
SERIES = {Lecture Notes in Computer Science (LNCS)},
PUBLISHER = {Springer},
VOLUME = {LNCS 8179},
PAGES = {pages 68-79},
PDF={http://hal.inria.fr/hal-00845531/PDF/ConnectedSurveillanceFinal.pdf},
ADDRESS = {Ischia, Italy},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00845531},
X-ID-HAL = {hal-00845531},

}

@inproceedings{giroire:hal-00845536,
AUTHOR = {Giroire, F. and Modrzejewski, R. and Nisse, N. and P�rennes, S.},
TITLE = {Maintaining Balanced Trees For Structured Distributed Streaming Systems},
BOOKTITLE = {20th Colloquium on Structural Information and Communication Complexity (SIROCCO)},
YEAR = {2013},
DOI = {10.1007/978-3-319-03578-9\_15},
VOLUME = {LNCS 8179},
PAGES = {pages 177-188},
PDF={http://hal.inria.fr/hal-00845536/PDF/llncs.pdf},
ADDRESS = {Ischia, Italy},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00845536},
X-ID-HAL = {hal-00845536},

}

@inproceedings{giroire:hal-00926348,
AUTHOR = {Giroire, F. and P�rennes, S. and Tahiri, I.},
TITLE = {On the Hardness of Equal Shortest Path Routing},
BOOKTITLE = {International Network Optimization Conference},
YEAR = {2013},
SERIES = {Electronic Notes in Discrete Mathematics},
DOI = {10.1016/j.endm.2013.05.123},
PUBLISHER = {Elsevier},
VOLUME = {41},
PAGES = {439-446},
PDF={http://hal.inria.fr/hal-00926348/PDF/ospfcomplexity\_inoc.pdf},
ADDRESS = {Tenerife, Spain},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00926348},
X-ID-HAL = {hal-00926348},

}

@inproceedings{giroire:hal-00817923,
AUTHOR = {Giroire, F. and P�rennes, S. and Tahiri, I.},
TITLE = {Sur la complexit� du routage OSPF},
BOOKTITLE = {15�mes Rencontres Francophones sur les Aspects Algorithmiques des T�l�communications (AlgoTel)},
YEAR = {2013},
EDITOR = {Nisse, N. and Rousseau, Franck and Busnel, Yann},
PAGES = {1-4},
PDF={http://hal.inria.fr/hal-00817923/PDF/algotel.pdf},
ADDRESS = {Pornic, France},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00817923},
X-ID-HAL = {hal-00817923},

}

@inproceedings{koster:hal-00862016,
AUTHOR = {Koster, A. and Phan, K. and Tieves, M.},
TITLE = {Extended Cutset Inequalities for the Network Power Consumption Problem},
BOOKTITLE = {INOC - International Network Optimization Conference - 2013},
YEAR = {2013},
MONTH = May,
PUBLISHER = {Electronic Notes in Discrete Mathematics, Springer},
VOLUME = {41},
PAGES = {69-76},
PDF={http://hal.inria.fr/hal-00862016/PDF/ExtendedCutsetInequalitiesfortheNetworkPowerConsumptionProblem.pdf},
ADDRESS = {Tenerife, Spain},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00862016},
X-ID-HAL = {hal-00862016},

}

@inproceedings{lerouzic:hal-00880944,
AUTHOR = {Le Rouzic, E. and Bonetto, E. and Chiaraviglio, L. and Giroire, F. and Idzikowski, F. and Jimenez, F. and Lange, C. and Montalvo, J. and Musumeci, F. and Tahiri, I. and Valenti, A. and Van Heddeghem, W. and Ye, Y. and Bianco, A. and Pattavina, A.},
TITLE = {TREND towards more energy-efficient optical networks},
BOOKTITLE = {17th International Conference on Optical Network Design and Modeling (ONDM)},
YEAR = {2013},
PAGES = {211--216},
PDF={http://hal.inria.fr/hal-00880944/PDF/ONDM\_TREND\_joint\_paper\_v9\_22\_02\_2013\_fin.pdf},
ADDRESS = {Brest, France},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00880944},
X-ID-HAL = {hal-00880944},

}

@inproceedings{modrzejewski:hal-00865378,
AUTHOR = {Modrzejewski, R. and Chiaraviglio, L. and Tahiri, I. and Giroire, F. and Le Rouzic, E. and Bonetto, E. and Masumeci, F. and Gonzalez, R. and Guerro, C.},
TITLE = {Energy Efficient Content Distribution in an ISP Network},
BOOKTITLE = {IEEE Global Communications Conference},
YEAR = {2013},
MONTH = Dec,
PDF={http://hal.inria.fr/hal-00865378/PDF/globecom-preprint.pdf},
ADDRESS = {Atlanta, United States},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00865378},
X-ID-HAL = {hal-00865378},

}

@inproceedings{nisse:hal-00845550,
AUTHOR = {Nisse, N.},
TITLE = {Fractional Combinatorial Two-Player Games},
YEAR = {2013},
BOOKTITLE = {26th European Conference on Operational Research (EURO XXVI)},
ADDRESS = {Italy},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {no},
URL = {http://hal.inria.fr/hal-00845550},
X-ID-HAL = {hal-00845550},

}

@inproceedings{nisse:hal-00845539,
AUTHOR = {Nisse, N. and Soares, R.},
TITLE = {On the Monotonicity of Process Number},
BOOKTITLE = {7th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS)},
YEAR = {2013},
PUBLISHER = {Elsevier},
VOLUME = {44},
PAGES = {141-147},
PDF={http://hal.inria.fr/hal-00845539/PDF/MonotoneDecomposition-LAGOS13.pdf},
ADDRESS = {Mexico, Mexico},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00845539},
X-ID-HAL = {hal-00845539},

}

@inproceedings{pardosoares:hal-00813229,
AUTHOR = {Pardo Soares, R.},
TITLE = {Fractional Combinatorial Games on Graphs},
BOOKTITLE = {15�mes Rencontres Francophones sur les Aspects Algorithmiques des T�l�communications (AlgoTel)},
YEAR = {2013},
EDITOR = {Nisse, N. and Rousseau, Franck and Busnel, Yann},
PDF={http://hal.inria.fr/hal-00813229/PDF/FractionalGamesSurveillance-Submited.pdf},
ADDRESS = {Pornic, France},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00813229},
X-ID-HAL = {hal-00813229},

}

@techreport{agarwal:hal-00837496,
AUTHOR = {Agarwal, D. and Araujo, J. and Caillouet, C. and Cazals, F. and Coudert, D. and P�rennes, S.},
TITLE = {Connectivity Inference in Mass Spectrometry based Structure Determination},
TYPE = {Research Report},
PAGES = {23},
YEAR = {2013},
MONTH = Jun,
INSTITUTION = {INRIA},
NUMBER = {RR-8320},
PDF={http://hal.inria.fr/hal-00837496/PDF/RR-8320-MCI.pdf},
URL = {http://hal.inria.fr/hal-00837496},
X-ID-HAL = {hal-00837496},

}

@techreport{amini:inria-00174965,
AUTHOR = {Amini, O. and Coudert, D. and Nisse, N.},
TITLE = {Some Results on Non-deterministic Graph Searching in Trees},
TYPE = {Research Report},
PAGES = {27},
YEAR = {2013},
PDF={http://hal.inria.fr/inria-00174965/PDF/ACN--hal.pdf},
URL = {http://hal.inria.fr/inria-00174965},
X-ID-HAL = {inria-00174965},

}

@techreport{araujo:hal-00743248,
AUTHOR = {Araujo, J. and Giroire, F. and Liu, Y. and Modrzejewski, R. and Moulierac, J.},
TITLE = {Energy Efficient Content Distribution},
TYPE = {Research Report},
PAGES = {27},
YEAR = {2013},
MONTH = May,
INSTITUTION = {INRIA},
NUMBER = {RR-8091},
PDF={http://hal.inria.fr/hal-00743248/PDF/report.pdf},
URL = {http://hal.inria.fr/hal-00743248},
X-ID-HAL = {hal-00743248},

}

@techreport{araujo:hal-00794622,
AUTHOR = {Araujo, J. and Nisse, N. and P�rennes, S.},
TITLE = {Weighted Coloring in Trees},
TYPE = {Research Report},
YEAR = {2013},
INSTITUTION = {INRIA},
NUMBER = {RR-8249},
PDF={http://hal.inria.fr/hal-00794622/PDF/RR-8249.pdf},
URL = {http://hal.inria.fr/hal-00794622},
X-ID-HAL = {hal-00794622},

}

@techreport{bermond:hal-00783198,
AUTHOR = {Bermond, J-C. and Li, B. and Nisse, N. and Rivano, H. and Yu, M-L.},
TITLE = {Data Gathering and Personalized Broadcasting in Radio Grids with Interferences},
TYPE = {Research Report},
YEAR = {2013},
INSTITUTION = {INRIA},
NUMBER = {RR-8218},
PDF={http://hal.inria.fr/hal-00783198/PDF/RR-8218.pdf},
URL = {http://hal.inria.fr/hal-00783198},
X-ID-HAL = {hal-00783198},

}

@techreport{bertome:hal-00865575,
AUTHOR = {Bertom�, P. and Bouvier, T. and Mazoit, F. and Nisse, N. and Pardo Soares, R.},
TITLE = {An Unified FPT Algorithm for Width of Partition Functions},
TYPE = {Research Report},
YEAR = {2013},
MONTH = Sep,
INSTITUTION = {INRIA},
NUMBER = {RR-8372},
PDF={http://hal.inria.fr/hal-00865575/PDF/RR-8372.pdf},
URL = {http://hal.inria.fr/hal-00865575},
X-ID-HAL = {hal-00865575},

}

@techreport{blin:hal-00837543,
AUTHOR = {Blin, L. and Burman, J. and Nisse, N.},
TITLE = {Exclusive Graph Searching},
TYPE = {Report},
YEAR = {2013},
MONTH = Jun,
PDF={http://hal.inria.fr/hal-00837543/PDF/ESA13.pdf},
URL = {http://hal.inria.fr/hal-00837543},
X-ID-HAL = {hal-00837543},

}

@techreport{coudert:hal-00813481,
AUTHOR = {Coudert, D. and Hogie, Luc and Lancin, A. and Papadimitriou, D. and P�rennes, S. and Tahiri, I.},
TITLE = {Feasibility study on distributed simulations of BGP},
TYPE = {Research Report},
PAGES = {24},
YEAR = {2013},
MONTH = Apr,
INSTITUTION = {INRIA},
NUMBER = {RR-8283},
PDF={http://hal.inria.fr/hal-00813481/PDF/RR-8283.pdf},
URL = {http://hal.inria.fr/hal-00813481},
X-ID-HAL = {hal-00813481},

}

@techreport{dangelo:hal-00794921,
AUTHOR = {D'Angelo, G. and Navarra, A. and Nisse, N.},
TITLE = {Robot Searching and Gathering on Rings under Minimal Assumptions},
TYPE = {Research Report},
YEAR = {2013},
INSTITUTION = {INRIA},
NUMBER = {RR-8250},
PDF={http://hal.inria.fr/hal-00794921/PDF/RR-8250.pdf},
URL = {http://hal.inria.fr/hal-00794921},
X-ID-HAL = {hal-00794921},

}

@techreport{giroire:hal-00820271,
AUTHOR = {Giroire, F. and Mazauric, D. and Nisse, N. and P�rennes, S. and Pardo Soares, R.},
TITLE = {Connected Surveillance Game},
TYPE = {Research Report},
PAGES = {22},
YEAR = {2013},
MONTH = May,
INSTITUTION = {INRIA},
NUMBER = {RR-8297},
PDF={http://hal.inria.fr/hal-00820271/PDF/RR-8297.pdf},
URL = {http://hal.inria.fr/hal-00820271},
X-ID-HAL = {hal-00820271},

}

@techreport{giroire:hal-00824269,
AUTHOR = {Giroire, F. and Modrzejewski, R. and Nisse, N. and P�rennes, S.},
TITLE = {Maintaining Balanced Trees For Structured Distributed Streaming Systems},
TYPE = {Research Report},
YEAR = {2013},
MONTH = May,
INSTITUTION = {INRIA},
NUMBER = {RR-8309},
PDF={http://hal.inria.fr/hal-00824269/PDF/report.pdf},
URL = {http://hal.inria.fr/hal-00824269},
X-ID-HAL = {hal-00824269},

}

@techreport{giroire:hal-00865345,
AUTHOR = {Giroire, F. and Nisse, N. and P�rennes, S. and Pardo Soares, R.},
TITLE = {Fractional Combinatorial Two-Player Games},
TYPE = {Research Report},
YEAR = {2013},
MONTH = Sep,
INSTITUTION = {INRIA},
NUMBER = {RR-8371},
PDF={http://hal.inria.fr/hal-00865345/PDF/RR-8371.pdf},
URL = {http://hal.inria.fr/hal-00865345},
X-ID-HAL = {hal-00865345},

}

@techreport{havet:hal-00816135,
AUTHOR = {Havet, F. and Maia, A. K.},
TITLE = {On disjoint directed cycles with prescribed minimum lengths},
TYPE = {Research Report},
YEAR = {2013},
MONTH = Apr,
INSTITUTION = {INRIA},
NUMBER = {RR-8286},
PDF={http://hal.inria.fr/hal-00816135/PDF/RR-8286.pdf},
URL = {http://hal.inria.fr/hal-00816135},
X-ID-HAL = {hal-00816135},

}

@PhdThesis{Ara12,

 title = {Graph Coloring and Graph Convexity},

 author = {Araujo, J.},

 school = {University of Nice-Sophia Antipolis and Federal University of Cear\'a},

 year = {2012},

 month = {September},

 abstract = {In this thesis, we study several problems of Graph Theory concerning Graph Coloring and Graph Convexity. 
 Most of the results contained here are related to the computational complexity of these problems for particular graph classes. 
 In the first and main part of this thesis, we deal with Graph Coloring which is one of the most studied areas of Graph Theory. 
 We first consider three graph coloring problems called Greedy Coloring, Weighted Coloring and Weighted Improper Coloring. 
 Then, we deal with a decision problem, called Good Edge-Labeling, whose definition was motivated by the Wavelength Assignment problem in optical networks.
 The second part of this thesis is devoted to a graph optimization parameter called (geodetic) hull number. 
 The definition of this parameter is motivated by an extension to graphs of the notions of convex sets and convex hulls in the Euclidean space. 
 Finally, we present in the appendix other works developed during this thesis, one about Eulerian and Hamiltonian directed hypergraphs and the other concerning distributed storage systems.},

 pdf = {http://tel.archives-ouvertes.fr/tel-00732919},

 OPTx-editorial-board={no},

 OPTx-proceedings={no},

 OPTx-international-audience={no},

 x-pays = {BR},

 sorte = "these",

 
}

@phdThesis{Sam12,

 title = {Algorithmic aspects of graph colouring heuristics},

 author = {Sampaio, L.},

 school = {University of Nice-Sophia Antipolis},

 year = {2012},

 month = {November},

 abstract = {A proper colouring of a graph is a function that assigns a
 colour to each vertex with the restriction that adjacent
 vertices are assigned with distinct colours.
 Proper colourings are a natural model for many problems, like
 scheduling, frequency assignment and register
 allocation.
 The problem of finding a proper colouring of a graph with the minimum
 number of colours is a well-known NP-hard
 problem.
 In this thesis we study the Grundy number and the b-chromatic number
 of graphs, two parameters that evaluate
 some heuristics for finding proper colourings.
 We start by giving the state of the art of the results about these parameters.
 Then, we show that the problem of determining the Grundy number of
 bipartite or chordal graphs is NP-hard, but it
 is solvable in polynomial time for P5-free bipartite graphs.
 After, we show that the problem of determining the b-chromatic number
 of a chordal distance-hereditary graph is
 NP-hard, and we give polynomial-time algorithms for some subclasses of
 block graphs, complement of bipartite
 graphs and P4-sparse graphs.
 We also consider the fixed-parameter tractability of determining the
 Grundy number and the b-chromatic number,
 and in particular we show that deciding if the Grundy number (or the
 b-chromatic number) of a graph G is at least
 |V(G)| - k admits an FPT algorithm when k is the parameter.
 Finally, we consider the computational complexity of many problems
 related to comparing the b-chromatic number
 and the Grundy number with various other related parameters of a graph.},

 pdf = {http://tel.archives-ouvertes.fr/tel-00759408},

 OPTx-editorial-board={no},

 OPTx-proceedings={no},

 OPTx-international-audience={yes},

 x-pays = {BR},

 sorte = "these",

 
}

@phdThesis{Wor12,

 title = {Outils Algorithmiques pour la D\'etection des Communaut\'es dans les R\'eseaux},

 author = {Worou, B. M. T.},

 school = {University of Nice-Sophia Antipolis},

 year = {2012},

 month = {December},

 abstract = {This thesis concerns the algorithmic aspects of the communities' detection in large graphs. 
 The work can be used by a telecommunications operator whose graphs are associated to telephone calls and SMS or telecommunication networks. 
 In this context, the detection of communities is used for the content recommendation, the analysis of customer data, the classification of Web pages, the detection of Web spamming, marketing activities and others. 
 This thesis is organized around two major parts. 
 In the first part, we introduce the field of detection of communities. 
 Indeed this problem has been studied with different points of view during the last years. 
 The main methods and applications are presented in this descriptive part. 
 In the second part, we present our contribution to the problem. 
 Our contribution consists of two main topics. 
 First, we introduce a new quality function, the fractional arboricity which is more adapted to the problem of detecting communities in social networks. 
 Then, we present a fast and performance guaranteed algorithm to approximate the optimal fractional arboricity and identifies the communities in question. 
 Second, we study the detection of communities by optimizing the modularity, the most used quality function for communities' detection. 
 We rewrite this function, and then, find new interpretations of the modularity and also links between the modularity and others cut functions. 
 Finally, we propose two heuristics to approximate the optimization of the modularity. 
 The first is an algorithm that approximates the modularity by using the Fiedler vector of the Laplacian matrix of the graph. 
 The second algorithm is a fast heuristic based on the representation of physical interaction of nodes in a metric space. 
 With this representation, we define an attraction/ repulsion mechanism between the vertices and then we obtain clusters in communities. 
 Finally, we combine the optimization of the fractional arboricity and the optimization of the modularity into one communities' detection tool.},

 OPTx-editorial-board={no},

 OPTx-proceedings={no},

 OPTx-international-audience={yes},

 x-pays = {},

 sorte = "these",

 
}

@inbook{GMM12,

 author = {Giroire, F. and Mazauric, D. and Moulierac, J.},

 title = {Energy Efficient Routing by Switching-Off Network Interfaces},

 chapter = {10 - Energy-Aware Systems and Networking for Sustainable Initiatives},

 publisher = {IGI Global},

 year = {2012},

 month = {june},

 pages = {207-236},

 editor = {Naima Kaabouch and Wen-Chen Hu},

 abstract = { Several studies exhibit that the traffic load of the routers only has a small influence on their energy consumption. 
 Hence, the power consumption in networks is strongly related to the number of active network elements, such as interfaces, line cards, base chassis,... 
 The goal thus is to find a routing that minimizes the (weighted) number of active network elements used when routing. 
 In this paper, we consider a simplified architecture where a connection between two routers is represented as a link joining two network interfaces. 
 When a connection is not used, both network interfaces can be turned off. 
 Therefore, in order to reduce power consumption, the goal is to find the routing that minimizes the number of used links while satisfying all the demands. 
 We first define formally the problem and we model it as an integer linear program. 
 Then, we prove that this problem is not in APX, that is there is no polynomial-time constant-factor approximation algorithm. 
 We propose a heuristic algorithm for this problem and we also prove some negative results about basic greedy and probabilistic algorithms. 
 Thus we present a study on specific topologies, such as trees, grids and complete graphs, that provide bounds and results useful for real topologies. 
 We then exhibit the gain in terms of number of network interfaces (leading to a global reduction of approximately 33 MWh for a medium-sized backbone network) for a set of existing network topologies: 
 we see that for almost all topologies more than one third of the network interfaces can be spared for usual ranges of operation. 
 Finally, we discuss the impact of energy efficient routing on the stretch factor and on fault tolerance.},

 url = {http://www.igi-global.com/chapter/energy-efficient-routing-switching-off/67312},

 pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/RR-7234.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={yes},

 OPTx-international-audience={yes},

 x-pays={},

 sorte = "livres-chap",

 
}

@article{APP+12,

 author = {Amini, O. and Peleg, D. and P\'erennes, S. and Sau, I. and Saurabh, S.},

 title = {On the approximability of some degree-constrained subgraph problems},

 journal = {Discrete Applied Mathematics},

 year = {2012},

 volume = {160},

 number = {12},

 pages = {1661 - 1679},

 abstract = {In this article we provide hardness results and approximation algorithms for the following three natural degree-constrained subgraph problems, which take as input an undirected graph {$G = (V, E )$}. 
 Let {$d \geq 2$} be a fixed integer. 
 The Maximum {$d$}−degree-bounded Connected Subgraph ( MDBCS d ) problem takes as additional input a weight function {$\omega : E \right R^+$} , and asks for a subset {$E'\subseteq E$} such that the subgraph induced by {$E'$} is connected, has maximum degree at most d , and {$\sum_{e\in E'}\omeage(e)$} is maximized. 
 The Minimum Subgraph of Minimum Degree {$\geq d$} ( MSMD d ) problem involves finding a smallest subgraph of G with minimum degree at least d . 
 Finally, the Dual Degree-dense k -Subgraph ( DDD k S ) problem consists in finding a subgraph H of G such that {$| V ( H ) | \leq k$} and the minimum degree in H is maximized.},

 url = {http://www.sciencedirect.com/science/article/pii/S0166218X12001291},

 pdf = {http://www.lirmm.fr/~sau/Pubs/DA8948R2.pdf},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays={IL,IN},

 sorte = "rev-int",

 
}

@article{ABG+12,

 title = {Weighted improper colouring},

 author = {Araujo, J. and Bermond, J-C. and Giroire, F. and Havet, F. and Mazauric, D. and Modrzejewski, R.},

 journal = {Journal of Discrete Algorithms},

 year = {2012},

 volume = {16},

 pages = {53-66},

 note = {Selected papers from the 22nd International Workshop on Combinatorial Algorithms (IWOCA 2011)},

 abstract = {In this paper, we study a colouring problem motivated by a practical frequency assignment problem and, up to our best knowledge, new. 
 In wireless networks, a node interferes with other nodes, the level of interference depending on numerous parameters: distance between the nodes, geographical topography, obstacles, etc. 
 We model this with a weighted graph $(G,w)$ where the weight function $w$ on the edges of $G$ represents the noise (interference) between the two end-vertices. 
 The total interference in a node is then the sum of all the noises of the nodes emitting on the same frequency. 
 A weighted $t$-improper $k$-colouring of $(G,w)$ is a $k$-colouring of the nodes of $G$ (assignment of $k$ frequencies) such that the interference at each node does not exceed the threshold $t$. 
 We consider here the Weighted Improper Colouring problem which consists in determining the weighted $t$-improper chromatic number defined as the minimum integer $k$ such that $(G,w)$ admits a weighted $t$-improper $k$-colouring. 
 We also consider the dual problem, denoted the Threshold Improper Colouring problem, where, given a number $k$ of colours, we want to determine the minimum real $t$ such that $(G,w)$ admits a weighted $t$-improper $k$-colouring. 
 We show that both problems are NP-hard and first present general upper bounds for both problems; 
 in particular we show a generalisation of Lov\'asz's Theorem for the weighted $t$-improper chromatic number. 
 Motivated by the original application, we then study a special interference model on various grids (square, triangular, hexagonal) where a node produces a noise of intensity 1 for its neighbours and a noise of intensity 1/2 for the nodes at distance two. 
 We derive the weighted $t$-improper chromatic number for all values of $t$.},

 doi = {10.1016/j.jda.2012.07.001},

 url = {http://www.sciencedirect.com/science/article/pii/S1570866712001049},

 pdf = {http://hal.archives-ouvertes.fr/docs/00/74/77/55/PDF/WIC-JDiscreteAlgo-Final.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={no},

 OPTx-international-audience={yes},

 x-pays = {BR},

 sorte = "rev-int",

 
}

@article{ACG+12,

 author = {Araujo, J. and Cohen, N. and Giroire, F. and Havet, F.},

 title = {Good edge-labelling of graphs},

 journal = {Discrete Applied Mathematics},

 year = {2012},

 volume = {160},

 number = {18},

 pages = {2501-2513},

 abstract={A {\it good edge-labelling} of a graph $G$ is a labelling of its edges such that for any two distinct vertices $u$, $v$, there is at most one $(u,v)$-path with non-decreasing labels.
 This notion was introduced in~\cite{BCP09} to solve wavelength assignment problems for specific categories of graphs.
 In this paper, we aim at characterizing the class of graphs that admit a good edge-labelling.
 First, we exhibit infinite families of graphs for which no such edge-labelling can be found. We then show that deciding if a graph admits a good edge-labelling is NP-complete. 
 Finally, we give
 large classes of graphs admitting a good edge-labelling:
 $C_3$-free outerplanar graphs, planar graphs of girth at least 6, subcubic $\{C_3,K_{2,3}\}$-free graphs.}
 doi = {10.1016/j.dam.2011.07.021},

 url = {http://www.sciencedirect.com/science/article/pii/S0166218X11002824},

 pdf = {http://hal.inria.fr/docs/00/38/48/23/PDF/RR-6934.pdf},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays = "BR",

 sorte = "rev-int",

 
}

@article{ArLi12,

 author = "Araujo, J. and Linhares Sales, C.",

 title = "On the Grundy number of graphs with few P4's",

 journal = "Discrete Applied Mathematics",

 year = "2012",

 volume = "160",

 number = "18",

 pages = "2514-2522",

 note = "V Latin American Algorithms, Graphs, and Optimization Symposium -- Gramado, Brazil, 2009",

 abstract = "The Grundy number of a graph $G$ is the largest number of colors used by any execution of the greedy algorithm to color $G$. The problem of determining the Grundy number of $G$ is polynomial if $G$ is a $P_4$-free graph and NP-hard if $G$ is a $P_5$-free graph. In this article, we define a new class of graphs, the fat-extended $P_4$-laden graphs, and we show a polynomial time algorithm to determine the Grundy number of any graph in this class. Our class intersects the class of $P_5$-free graphs and strictly contains the class of $P_4$-free graphs. More precisely, our result implies that the Grundy number can be computed in polynomial time for any graph of the following classes: $P_4$-reducible, extended $P_4$-reducible, $P_4$-sparse, extended $P_4$-sparse, $P_4$-extendible, $P_4$-lite, $P_4$-tidy, $P_4$-laden and extended $P_4$-laden, which are all strictly contained in the fat-extended $P_4$-laden class.",

 doi = "10.1016/j.dam.2011.08.016",

 url = "http://www.sciencedirect.com/science/article/pii/S0166218X11003258",

 pdf = "http://hal.inria.fr/docs/00/63/90/08/PDF/grundy_p4-full-withmodifs.pdf",

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays = {BR},

 sorte = "rev-int",

 
}

@article{BHT12,

 author = {Bang-Jensen, J. and Havet, F. and Trotignon, N.},

 title = {Finding an induced subdivision of a digraph},

 JOURNAL = {Theoretical Computer Science},

 YEAR = {2012},

 VOLUME = {443},

 PAGES = {10-24},

 abstract = {We consider the following problem for oriented graphs and digraphs: Given an oriented graph (digraph) $G$, does it contain an induced subdivision of a prescribed digraph $D$? 
 The complexity of this problem depends on $D$ and on whether $H$ must be an oriented graph or is allowed to contain 2-cycles. 
 We give a number of examples of polynomial instances as well as several NP-completeness proofs.},

 URL = {http://hal.inria.fr/inria-00527518/fr/},

 PDF = {http://hal.inria.fr/docs/00/52/75/18/PDF/RR-7430.pdf},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays={DK},

 sorte = "rev-int",

 
}

@article{BFF+12,

 author = {Barri{\`e}re, L. and Flocchini, P. and Fomin, F. and Fraigniaud, P. and Nisse, N. and Santoro, N. and Thilikos, D.},

 title = {{C}onnected {G}raph {S}earching},

 journal = {Information and Computation},

 year = {2012},

 volume = {219},

 pages = {1-16},

 abstract = {In graph searching game the opponents are a set of searchers and a fugitive in a graph. 
 The searchers try to capture the fugitive by applying some sequence moves that include placement, removal, or sliding of a searcher along an edge. 
 The fugitive tries to avoid capture by moving along unguarded paths. 
 The search number of a graph is the minimum number of searchers required to guarantee the capture of the fugitive. 
 In this paper, we initiate the study of this game under the natural restriction of connectivity where we demand that in each step of the search the locations of the graph that are clean (i.e. non-accessible to the fugitive) remain connected. 
 We give evidence that many of the standard mathematical tools used so far in the classic graph searching fail under the connectivity requirement. 
 We also settle the question on ``the price of connectivity'' that is how many searchers more are required for searching a graph when the connectivity demand is imposed. 
 We make estimations of the price of connectivity on general graphs and we provide tight bounds for the case of trees. 
 In particular, for an $n$-vertex graph the ratio between the connected searching number and the non-connected one is $O(\log n)$ while for trees this ratio is always at most 2. 
 We also conjecture that this constant-ratio upper bound for trees holds also for all graphs. 
 Our combinatorial results imply a complete characterization of connected graph searching on trees. 
 It is based on a forbidden-graph characterization of the connected search number. 
 We prove that the connected search game is monotone for trees, i.e. restricting search strategies to only those where the clean territories increase monotonically does not require more searchers. 
 A consequence of our results is that the connected search number can be computed in polynomial time on trees, moreover, we show how to make this algorithm distributed. 
 Finally, we reveal connections of this parameter to other invariants on trees such as the Horton-Stralher number.},

 url = {http://dx.doi.org/10.1016/j.ic.2012.08.004},

 pdf = {http://hal.inria.fr/docs/00/74/19/48/PDF/journalFinal.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={yes},

 OPTx-international-audience={yes},

 x-pays={ES,CA,NO,GR},

 sorte = "rev-int",

 
}

@article{BBD+12,

 author = {Baruah, S. and Bonifaci, V. and D'Angelo, G. and Li, H. and Marchetti-Spaccamela, A. and Megow, N. and Stougie, L.},

 title = {{Scheduling Real-time Mixed-criticality Jobs}},

 journal = {IEEE Transactions on Computers},

 year = {2012},

 volume = {61},

 number = {8},

 pages = {1140-1152},

 publisher = {IEEE},

 abstract = {{Many safety-critical embedded systems are subject to certification requirements; 
 some systems may be required to meet multiple sets of certification requirements, from different certification authorities. 
 Certification requirements in such "mixed-criticality" systems give rise to interesting scheduling problems, that cannot be satisfactorily addressed using techniques from conventional scheduling theory. 
 In this paper, we study a formal model for representing such mixed-criticality workloads. 
 We demonstrate first the intractability of determining whether a system specified in this model can be scheduled to meet all its certification requirements, even for systems subject to merely two sets of certification requirements. 
 Then we quantify, via the metric of processor speedup factor, the effectiveness of two techniques, reservation-based scheduling and priority-based scheduling, that are widely used in scheduling such mixed-criticality systems, showing that the latter of the two is superior to the former. 
 We also show that the speedup factors we obtain are tight for these two techniques.}},

 doi = {10.1109/TC.2011.142 },

 url = {http://hal.inria.fr/hal-00643942},

 pdf = {http://hal.inria.fr/hal-00643942/PDF/MixedCriticality-journal.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={no},

 OPTx-international-audience={yes},

 x-pays = {IT,IN,CN,DE,NL,US},

 sorte = "rev-int",

 
}

@article{BDD+12,

 author = {Bauer, R. and D'Angelo, G. and Delling, D. and Schumm, A. and Wagner, D.},

 title = {{The Shortcut Problem - Complexity and Algorithms}},

 journal = {Journal of Graph Algorithms and Applications},

 year = {2012},

 volume = {16},

 number = {2},

 pages = {447-481},

 publisher = {Journal of Graph Algorithms and Applications},

 abstract = {{We study a graph-augmentation problem arising from a technique applied in recent approaches for route planning. 
 Many such methods enhance the graph by inserting shortcuts, i.e., additional edges (u,v) such that the length of (u,v) is the distance from u to v. 
 Given a weighted, directed graph G and a number c in Z, the shortcut problem asks how to insert c shortcuts into G such that the expected number of edges that are contained in an edge-minimal shortest path from a random node s to a random node t is minimal. 
 In this work, we study the algorithmic complexity of the problem and give approximation algorithms for a special graph class. 
 Further, we state ILP-based exact approaches and show how to stochastically evaluate a given shortcut assignment on graphs that are too large to do so exactly.}},

 doi = {10.7155/jgaa.00270},

 url = {http://hal.inria.fr/hal-00728877},

 pdf = {http://hal.inria.fr/hal-00728877/PDF/02-IJGAA.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={no},

 OPTx-international-audience={yes},

 x-pays = {IT,DE},

 sorte = "rev-int",

 
}

@article{BCM+11,

 title = { {GMPLS} {L}abel {S}pace {M}inimization through {H}ypergraph {L}ayouts},

 author = {Bermond, J-C. and Coudert, D. and Moulierac, J. and P\'erennes, S. and Sau, I. and Solano Donado, F.},

 journal = {Theoretical Computer Science (TCS)},

 volume = {444},

 pages = {3-16},

 month = jul,

 x-pays = {ES,PL},

 abstract = {{A}ll-{O}ptical {L}abel {S}witching ({AOLS}) is a new technology that performs packet forwarding without any optical-electrical-optical conversions. {I}n this report, we study the problem of routing a set of requests in {AOLS} networks using {GMPLS} technology, with the aim of minimizing the number of labels required to ensure the forwarding. {W}e first formalize the problem by associating to each routing strategy a logical hypergraph, called a hypergraph layout, whose hyperarcs are dipaths of the physical graph, called tunnels in {GMPLS} terminology. {W}e define a cost function for the hypergraph layout, depending on its total length plus its total hop count. {M}inimizing the cost of the design of an {AOLS} network can then be expressed as finding a minimum cost hypergraph layout. {W}e prove hardness results for the problem, namely for general directed networks we prove that it is {NP}-hard to find a {C} log n-approximation, where {C} is a positive constant and n is the number of nodes of the 
 network. {F}or symmetric directed networks, we prove that the problem is {APX}-hard. {T}hese hardness results hold even if the traffic instance is a partial broadcast. {O}n the other hand, we provide approximation algorithms, in particular an {O}(log n)-approximation for symmetric directed networks. {F}inally, we focus on the case where the physical network is a directed path, providing a polynomial-time dynamic programming algorithm for a fixed number k of sources running in {O}(n^{k+2}) time.},

 OPTkeywords = {{GMPLS}; optical networks; label stacking; hypergraph layout; approximation algorithms; dynamic programming.},

 language = {{A}nglais},

 OPTaffiliation = {{MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 - {I}nstitute of {T}elecommunications - {W}arsaw {U}niversity of {T}echnology },

 year = {2012},

 URL = {http://dx.doi.org/10.1016/j.tcs.2012.01.033},

 pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/RR-7071.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={no},

 OPTx-international-audience={yes},

 sorte = "rev-int",

 
}

@article{BeMo12,

 author = {Bermond, J-C. and Moulierac, J.},

 title = {Internet et la th\'eorie des graphes},

 journal = {Revue TDC Textes et documents pour la Classe : la r\'evolution Internet},

 year = {2012},

 volume = {1042},

 pages = {32-33},

 abstract = {{La th{\'e}orie des graphes constitue un domaine des math{\'e}matiques qui s'est d{\'e}velopp{\'e} au sein de disciplines diverses telles que la chimie (mod{\'e}lisation de structures), la biologie (g{\'e}nome), les sciences sociales (mod{\'e}lisation des relations) et le transport (r{\'e}seaux routiers, {\'e}lectriques, etc.). 
 Le cycle eul{\'e}rien et le cycle hamiltonien R{\'e}seaux internet et graphes " petit-monde " Comment calculer un plus court chemin ?}},

 url = {http://hal.archives-ouvertes.fr/hal-00747752},

 pdf = {http://hal.archives-ouvertes.fr/hal-00747752/PDF/TDCfinal.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={no},

 OPTx-international-audience={no},

 x-pays = {},

 sorte = "rev-nat",

 
}

@Article{BePe12,

 author = {Bermond, J-C. and Peters, J.},

 title = {Optimal Gathering in Radio Grids with Interference},

 journal = {Theoretical Computer Science},

 year = {2012},

 month = {October},

 volume = {457},

 pages = {10-26},

 abstract = {We study the problem of gathering information from the nodes
 of a
 radio network into a central node. We model the network
 of possible transmissions by a graph and consider a binary model of
 interference in which two transmissions interfere if the distance in
 the graph from the sender of one transmission to the receiver of the
 other is $d_I$ or less. A {\em round} is a set of non-interfering
 transmissions. In this paper, we determine the exact number of rounds
 required to gather one piece of information from each node of a square
 two-dimensional grid into the central node. If $d_I = 2k-1$ is odd,
 then the number of rounds is $k(N-1)-c_k$ where $N$ is the number of
 nodes and $c_k$ is a constant that depends on $k$. If $d_I = 2k$ is
 even, then the number of rounds is $(k+\frac{1}{4})(N-1)-c'_k$ where
 $c'_k$ is a constant that depends on $k$.
 The even case uses a method based on linear programming duality to
 prove the lower bound, and sophisticated algorithms using the symmetry
 of the grid and non-shortest paths to establish the matching upper
 bound. We then generalize our results to hexagonal grids.},

 url = {http://hal.archives-ouvertes.fr/hal-00747751},

 pdf = {http://hal.archives-ouvertes.fr/docs/00/74/77/51/PDF/bermond-peters-revised.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={no},

 OPTx-international-audience={yes},

 x-pays = {CA},

 sorte = "rev-int",

 
}

@article{BhFe12,

 author = {Bhadra, S. and Ferreira, A.},

 title = {Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs},

 journal = {J. Internet Services and Applications},

 volume = {3},

 number = {3},

 year = {2012},

 pages = {269-275},

 abstract = {New technologies and the deployment of mobile and nomadic services are driving the emergence of complex communications networks, that have a highly dynamic behavior. 
 This naturally engenders new route-discovery problems under changing conditions over these networks. 
 Unfortunately, the temporal variations in the network topology are hard to be effectively captured in a classical graph model. 
 In this paper, we use and extend a recently proposed graph theoretic model, which helps capture the evolving characteristi- c of such networks, in order to compute multicast trees with minimum overall transmission time for a class of wireless mobile dynamic networks. 
 We first show that computing different types of strongly connected components in this model is NP-Complete, and then propose an algorithm to build all rooted directed minimum spanning trees in already identified strongly connected components.},

 doi = {http://dx.doi.org/10.1007/s13174-012-0073-z},

 url = {http://hal.inria.fr/inria-00072057},

 pdf = {http://hal.inria.fr/docs/00/07/20/57/PDF/RR-4531.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={no},

 OPTx-international-audience={yes},

 x-pays = {IN},

 sorte = "rev-int",

 
}

@article{CGH+12,

 author = {Campos, V. and Gy\'arf\'as, A. and Havet, F. and Linhares Sales, C. and Maffray, F.},

 title = {New bounds on the Grundy number of products of graphs},

 journal = {Journal of Graph Theory},

 YEAR = {2012},

 VOLUME = {71},

 NUMBER= {1},

 PAGES = {78-88},

 abstract = {The Grundy number of a graph $G$ is the largest $k$ such that $G$ has a greedy $k$-colouring, that is, a colouring with $k$ colours obtained by applying the greedy algorithm according to some ordering of the vertices of $G$. 
 In this paper, we give new bounds on the Grundy number of the product of two graphs.},

 URL={http://hal.archives-ouvertes.fr/inria-00470158/fr/},

 PDF = {http://hal.archives-ouvertes.fr/docs/00/47/01/58/PDF/RR-7243.pdf },

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays = {BR, HU},

 sorte = "rev-int",

 
}

@article{CLL+11,

 author = {Y. Chen and E. Le Merrer and Z. Li and Y. Liu and G. Simon},

 title = {{OAZE}: A Network-Friendly Distributed Zapping System for Peer-to-Peer {IPTV}},

 journal = {Computer Networks},

 year = {2012},

 volume = {56},

 number = {1},

 pages = {365-377},

 abstract = {IPTV systems attracting millions of users are now commonly deployed on peer-to-peer (P2P) infrastructures. Each channel is associated with a P2P overlay network for\
 med by the users who receive, watch and redistribute this channel. However, zapping from one P2P overlay to another requires a significant amount of time, and therefore the P2P\
 IPTV experience is not as good as for a multicast-based IPTV. In order to speed up the switching process and to reduce the overall cross-domain traffic generated by the IPTV s\
 ystem, we propose a distributed algorithm called OAZE for Overlay Augmentation for Zapping Experience. The main idea is that every peer maintains connections to other peers in \
 a subset of all channels to which it is likely to zap, and collaborates with the other peers in its channel for the remaining channels. We present in this paper the OAZE mechan\
 ism. We focus in particular on the channel assignment problem, which consists in determining the optimal distribution of the responsibility to maintain contact peers in other c\
 hannels in a given overlay. We propose an approximate algorithm having guaranteed performances in comparison to the optimal one, and an algorithm that is simpler and more pract\
 ical. Simulations show that OAZE leads to substantial improvements on the connections between peers, resulting in less switching delay and lower network cost. This approach is \
 overlay independent and is an appealing add-on for existing P2P IPTV systems.},

 pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/CLL+11.pdf},

 url = {http://dx.doi.org/10.1016/j.comnet.2011.09.002},

 OPTx-editorial-board={yes},

 OPTx-proceedings={yes},

 OPTx-international-audience={yes},

 x-pays = {},

 sorte = "rev-int",

 
}

@article{CHM11,

 author = {D. Coudert and F. Huc and D. Mazauric},

 title = {A Distributed Algorithm for Computing the Node Search Number in Trees},

 journal = {Algorithmica},

 year = {2012},

 volume = {63},

 number = {1-2},

 pages = {158-190},

 abstract = { We present a distributed algorithm to compute the node search number
 in trees. This algorithm extends the centralized algorithm proposed
 by Ellis \emph{et al.} [EST94]. It can be executed in an
 asynchronous environment, requires an overall computation time of
 $O(n\log{n})$, and $n$ messages of $\log_3{n}+4$ bits each.
 
 The main contribution of this work lies in the data structure
 proposed to design our algorithm, called \emph{hierarchical
 decomposition}. This simple and flexible data structure is used
 for four operations: updating the node search number after addition
 or deletion of any tree-edges in a distributed fashion; computing it
 in a tree whose edges are added sequentially and in any order;
 computing other graph invariants such as the process number and the
 edge search number, by changing only initialization rules; extending
 our algorithms for trees and forests of unknown size (using messages
 of up to $2\log_3{n}+5$ bits).},

 url = {http://dx.doi.org/10.1007/s00453-011-9524-3},

 pdf = {http://hal.inria.fr/docs/00/58/78/19/PDF/bare_conf-noformat.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={no},

 OPTx-international-audience={yes},

 x-pays={CH},

 sorte = "rev-int",

 
}

@article{DDN12a,

 author = {D'Angelo, G. and Di Stefano, G. and Navarra, A.},

 title = {{Minimize the Maximum Duty in Multi-interface Networks}},

 journal = {Algorithmica},

 year = {2012},

 volume = {63},

 number = {1-2},

 pages = {274-295},

 publisher = {Springer},

 abstract = {{We consider devices equipped with multiple wired or wireless interfaces. 
 By switching of various interfaces, each device might establish several connections. 
 A connection is established when the devices at its endpoints share at least one active interface. 
 Each interface is assumed to require an activation cost. 
 In this paper, we consider two basic networking problems in the field of multi-interface networks. 
 The first one, known as the Coverage problem, requires to establish the connections defined by a network. 
 The second one, known as Connectivity problem, requires to guarantee a connecting path between any pair of nodes of a network. 
 Both are subject to the constraint of keeping as low as possible the maximum cost set of active interfaces at each single node. 
 We study the problems of minimizing the maximum cost set of active interfaces among the nodes of the network in order to cover all the edges in the first case, or to ensure connectivity in the second case. 
 We prove that the Coverage problem is NP-hard for any fixed $\Delta$$\ge$5 and k$\ge$16, with $\Delta$ being the maximum degree, and k being the number of different interfaces among the network. 
 We also show that, unless P=NP, the problem cannot be approximated within a factor of $\eta$$\Delta$, for a certain constant $\eta$. 
 We then provide a general approximation algorithm which guarantees a factor of O((1+b)$\Delta$), with b being a parameter depending on the topology of the input graph. 
 Interestingly, b can be bounded by a constant for many graph classes. Other approximation and exact algorithms for special cases are presented. 
 Concerning the Connectivity problem, we prove that it is NP-hard for any fixed $\Delta$$\ge$3 and k$\ge$10. 
 Also for this problem, the inapproximability result holds, that is, unless P=NP, the problem cannot be approximated within a factor of $\eta$$\Delta$, for a certain constant $\eta$. 
 We then provide approximation and exact algorithms for the general problem and for special cases, respectively.}},

 doi = {10.1007/s00453-011-9531-4},

 url = {http://hal.inria.fr/hal-00643961},

 pdf = {http://hal.inria.fr/hal-00643961/PDF/Min-Max-coverage.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={no},

 OPTx-international-audience={yes},

 x-pays = {IT},

 sorte = "rev-int",

 
}

@article{EKK12,

 author = {Esperet, L. and Kardo{\v{s}}, F. and Kr{\'{a}}l', D. },

 title = {A superlinear bound on the number of perfect matchings in cubic bridgeless graphs},

 journal = {European Journal of Combinatorics},

 volume = {33},

 number = {5},

 year = {2012},

 pages = {767-798},

 abstract = {Lov{\'{a}}sz and Plummer conjectured in the 1970's that cubic bridgeless 
 graphs have exponentially many perfect matchings. This conjecture has 
 been verified for bipartite graphs by Voorhoeve in 1979, and for planar 
 graphs by Chudnovsky and Seymour in 2008, but in general only linear 
 bounds are known. In this paper, we provide the first superlinear bound 
 in the general case.},

 url = {http://dx.doi.org/10.1016/j.ejc.2011.09.027},

 pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/EKK11.pdf},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays = {CZ, SK},

 sorte = "rev-int",

 
}

@article{FJ12,

 author = {Ferreira, A. and Jarry, A.},

 title = {Minimum-Energy Broadcast Routing in Dynamic Wireless Networks},

 journal = {Journal of Green Engineering},

 year = {2012},

 volume = {2},

 number = {2},

 pages = {115-123},

 Abstract = {One of the new challenges facing research in wireless networks is the design of algorithms and protocols that are energy aware. 
 A good example is the minimum-energy broadcast routing problem for a static network in the plane, which attracted a great deal of attention these past years. 
 The problem is NP-hard and its approximation ratio complexity is a solution proved to be within a factor 6 of the optimal, based on finding a Minimum Spanning Tree of the static planar network. 
 In this paper, we use for the first time the evolving graph combinatorial model as a tool to prove an NP-Completeness result, namely that computing a Minimum Spanning Tree of a planar network in the presence of mobility is actually NP-Complete. 
 This result implies that the above approximation solution cannot be used in dynamic wireless networks. 
 On the positive side, we give a polynomial-time algorithm to build a rooted spanning tree of an on/off network, that minimizes the maximum energy used.},

 PDF = {http://riverpublishers.com/journal/journal_articles/RP_Journal_1904-4720_222.pdf},

 OPTx-editorial-board = {yes},

 OPTx-proceedings = {no},

 OPTx-international-audience = {yes},

 x-pays = {CH},

 sorte = "rev-int",

 
}

@ARTICLE{GHP+12,

 AUTHOR={Gon\c{c}alves, D. and Havet, F. and Pinlou, A. and Thomass\'e, S.},

 TITLE={On spanning galaxies in digraphs},

 JOURNAL = {Discrete Applied Mathematics},

 YEAR = {2012},

 VOLUME = {160},

 NUMBER = {6},

 PAGES = {744-754},

 abstract = { In a directed graph, a {\it star} is an arborescence with at least one arc, in which the root dominates all the other vertices. 
 A {\it galaxy} is a vertex-disjoint union of stars. 
 In this paper, we consider the \textsc{Spanning Galaxy} problem of deciding whether a digraph $D$ has a spanning galaxy or not. 
 We show that although this problem is NP-complete (even when restricted to acyclic digraphs), it becomes polynomial-time solvable when restricted to strong digraphs.
 In fact, we prove that restricted to this class, the \pb\ is equivalent to the problem of deciding if a strong digraph has a strong digraph with an even number of vertices. 
 We then show a polynomial-time algorithm to solve this problem.
 We also consider some parameterized version of the \pb.
 Finally, we improve some results concerning the notion of directed star arboricity of a digraph $D$, which is the minimum number of galaxies needed to cover all the arcs of $D$. 
 We show in particular that $dst(D)\leq \Delta(D)+1$ for every digraph $D$ and that $dst(D)\leq \Delta(D)$ for every acyclic digraph $D$.},

 pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/GHP+12b.pdf},

 url = {http://dx.doi.org/10.1016/j.dam.2011.07.013},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays={},

 sorte = "rev-int",

 
}

@article{HLS12,

 author = {Havet, F. and Linhares Sales, C. and Sampaio, L.},

 title = {b-coloring of tight graphs},

 journal = {Discrete Applied Mathematics},

 year = {2012},

 volume = {160},

 number = {18},

 pages = {2709-2715},

 doi = {10.1016/j.dam.2011.10.017},

 url = {http://www.sciencedirect.com/science/article/pii/S0166218X11003921},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays={BR},

 sorte = "rev-int",

 
}

@ARTICLE{HRS12,

 AUTHOR={Havet, F. and Reed, B. and Sereni, J.-S.},

 TITLE={Griggs and Yeh's conjecture and $L(p,1)$-labellings},

 JOURNAL = {SIAM Journal on Discrete Mathematics},

 VOLUME = {26},

 NUMBER = {1},

 YEAR = {2012},

 PAGES = {145-168},

 abstract = {An $L(p,1)$-labeling of a graph is a function $f$ from the vertex set to the positive integers such that $|f(x)-f(y)|\geqslant p$ if dist$(x,y)=1$ and $|f(x)-f(y)|\geqslant 1$ if dist$(x,y)=2$, where dist$(x,y)$ is the distance between the two vertices $x$ and $y$ in the graph. 
 The span of an $L(p,1)$-labeling $f$ is the difference between the largest and the smallest labels used by $f$. In 1992, Griggs and Yeh conjectured that every graph with maximum degree $\Delta\geqslant 2$ has an $L(2,1)$-labeling with span at most $\Delta^2$. 
 We settle this conjecture for $\Delta$ sufficiently large. 
 More generally, we show that for any positive integer $p$ there exists a constant $\Delta_p$ such that every graph with maximum degree $\Delta\geqslant \Delta_p$ has an $L(p,1)$-labeling with span at most $\Delta^2$. 
 This yields that for each positive integer $p$, there is an integer $C_p$ such that every graph with maximum degree $\Delta$ has an $L(p,1)$-labeling with span at most $\Delta^2+C_p$.},

 pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/HRS12.pdf},

 url = {http://dx.doi.org/10.1137/090763998},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays={CA},

 sorte = "rev-int",

 
}

@article{NRS12,

 author = {Nisse, N. and Rapaport, I. and Suchan, K.},

 title = {Distributed computing of efficient routing schemes in generalized chordal graphs},

 journal = {Theoretical Computer Science},

 year = {2012},

 volume = {444},

 number = {27},

 pages = {17-27},

 abstract = {Efficient algorithms for computing routing tables should take advantage of the particular properties arising in large scale networks. 
 There are in fact at least two properties that any routing scheme must consider: low (logarithmic) diameter and high clustering coefficient. 
 High clustering coefficient implies the existence of few large induced cycles. 
 Therefore, we propose a routing scheme that computes short routes in the class of k-chordal graphs, i.e., graphs with no chordless cycles of length more than k. 
 We study the tradeoff between the length of routes and the time complexity for computing them. 
 In the class of k-chordal graphs, our routing scheme achieves an additive stretch of at most k-1, i.e., for all pairs of nodes, the length of the route never exceeds their distance plus k-1. 
 In order to compute the routing tables of any n-node graph with diameter D we propose a distributed algorithm which uses O(log n)-bit messages and takes O(D) time. 
 We then propose a slightly modified version of the algorithm for computing routing tables in time O(min{Delta.D, n}), where Delta is the the maximum degree of the graph. 
 Using these tables, our routing scheme achieves a better additive stretch of 1 in chordal graphs (notice that chordal graphs are 3-chordal graphs). 
 The routing scheme uses addresses of size log n bits and local memory of size 2(d-1) log n bits in a node of degree d.},

 url = {http://www.sciencedirect.com/science/article/pii/S0304397512000333},

 pdf = {http://hal.inria.fr/docs/00/74/19/70/PDF/SiroccoTCSFinal.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={yes},

 OPTx-international-audience={yes},

 x-pays = {CL},

 sorte = "rev-int",

 
 
}

@inproceedings{ABC+12,

 author = {Ajmone-Marsan, M. and Buzzi, S. and Chiaraviglio, L. and Meo, M. and Guerrero, C. and Idzikowski, F. and Ye, Y. and Lopez Vizcaino, J.},

 title = {{TREND: Toward Real Energy-efficient Network Design}},

 abstract = {{This paper briefly describes the objectives of the TREND (Toward Real Energy-efficient Network Design) Network of Excellence of the European Commission 7th Framework Programme, and outlines some of the main results obtained so far within the project, looking at wireless access networks, core networks, and content distribution issues.}},

 booktitle = {{SustainIT 2012 - The Second IFIP Conference on Sustainable Internet and ICT for Sustainability}},

 address = {Pisa, Italy},

 year = {2012},

 pages = {1-6},

 month = Oct,

 pdf={http://www.telematica.polito.it/oldsite/chiaraviglio/papers/SustainIT2012.pdf},

 x-pays={IT,ES,DE},

 OPTx-editorial-board={no},

 OPTx-proceedings={yes},

 OPTx-international-audience={yes},

 sorte = "inv-conf"
 
}

@inproceedings{BBD+12a,

 author = {Baruah, S. and Bonifaci, V. and D'Angelo, G. and Li, H. and Marchetti-Spaccamela, A. and Van Der Ster, S. and Stougie, L.},

 title = {{The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems}},

 url = {http://hal.inria.fr/hal-00728995},

 abstract = {{Systems in many safety-critical application domains are subject to certification requirements. 
 For any given system, however, it may be the case that only a subset of its functionality is safety-critical and hence subject to certification; 
 the rest of the functionality is non safety critical and does not need to be certified, or is certified to a lower level of assurance. 
 An algorithm called EDF-VD (for Earliest Deadline First with Virtual Deadlines) is described for the scheduling of such mixed-criticality task systems. 
 Analyses of EDF-VD significantly superior to previously-known ones are presented, based on metrics such as processor speedup factor (EDF-VD is proved to be optimal with respect to this metric) and utilization bounds.}},

 booktitle = {{24th Euromicro Conference on Real-Time Systems (ECRTS12)}},

 publisher = {IEEE},

 pages = {145-154},

 address = {Pisa, Italy},

 doi = {10.1109/ECRTS.2012.42 },

 year = {2012},

 month = Jul,

 pdf = {http://hal.inria.fr/hal-00728995/PDF/14-ECRTS12.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={yes},

 OPTx-international-audience={yes},

 x-pays = {IT,IN,CN,NL,US},

 sorte = "conf-int",

 
}

@inproceedings{BKN+12,

 author = {Becker, F. and Kosowski, A. and Nisse, N. and Rapaport, I. and Suchan, K.},

 title = {Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power},

 booktitle = {24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},

 year = {2012},

 pages = {11-17},

 publisher = {ACM},

 abstract = {In this work we study the computational power of graph-based models of distributed computing in which each node additionally has access to a global whiteboard. 
 A node can read the contents of the whiteboard and, when activated, can write one message of $O(\log n)$ bits on it. 
 A message is only based on the local knowledge of the node and the current content of the whiteboard. 
 When the protocol terminates, each node computes the output based on the final contents of the whiteboard in order to answer some question on the network's topology. 
 We propose a framework to formally define several scenarios modelling how nodes access the whiteboard, in a synchronous way or not. 
 This extends the work of Becker {\it et al.} [IPDPS 2011] where nodes were imposed to create their messages only based on their local knowledge (i.e., with the whiteboard empty). 
 We prove that the four models studied have increasing power of computation: any problem that can be solved in the weakest one can be solved in the the second, and so on. 
 Moreover, we exhibit problems that {\it separate} models, i.e., that can be solved in one model but not in a weaker one. 
 These problems are related to Maximal Independent Set and detection of cycles. 
 Finally we investigate problems related to connectivity as the construction of spanning- or BFS-tree in our different models.},

 url = {http://hal.inria.fr/inria-00627910/fr/},

 pdf = {http://hal.inria.fr/inria-00627910/PDF/RR-7746.pdf},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays = {CL},

 sorte = "conf-int",

 
}

@InProceedings{BCD+12,

 author = {Bermond, J-C. and Coudert, D. and D'Angelo, G. and Moataz, F. Z.},

 title = {Diverse Routing in networks with star SRLGs},

 booktitle = {ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) Student Workshop},

 year = {2012},

 month = {December},

 pages = {1-2},

 address = {Nice, France},

 abstract={The notion of \emph{Shared Risk Link Group}, SRLG has been
 introduced to capture multiple correlated failures in a network. A
 SRLG is a set of links that fail simultaneously if a given event (risk)
 occurs. In such multiple failures scenario, the problem of Diverse
 Routing consists in finding two SRLG-disjoint paths between a pair
 of nodes. We consider such problem for localized failures, when all
 the links of a SRLG verify the star property i.e. when they are
 incident to the same node. We prove that in this case the problem
 is in general NP-complete and determine some polynomial cases.},

 url = {http://hal.archives-ouvertes.fr/hal-00747757},

 pdf = {http://hal.archives-ouvertes.fr/hal-00747757/PDF/conext26102012.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={yes},

 OPTx-international-audience={yes},

 x-pays = {IT,MA},

 sorte = "rev-int",

 
}

@inproceedings{BBN12c,

 author = {Blin, L. and Burman, J. and Nisse, N.},

 title = {Brief Announcement: Distributed Exclusive and Perpetual Tree Searching},

 booktitle = {26th International Symposium on Distributed Computing (DISC)},

 publisher = {Springer, LNCS},

 year = {2012},

 volume = {7611},

 pages = {403-404},

 abstract = {We tackle a practical version of the well known {\it graph searching} problem, where a team of robots aims at capturing an intruder in a graph. 
 The robots and the intruder move along the edges of the graph. 
 The intruder is invisible, arbitrary fast, and omniscient. 
 It is caught whenever it stands on a node occupied by a robot, and cannot escape to a neighboring node. 
 We study graph searching in the CORDA model of mobile computing: robots are asynchronous, and they perform cycles of {\it Look-Compute-Move} actions. 
 Moreover, motivated by physical constraints, we consider the \emph{exclusive} property, stating that no two or more robots can occupy the same node at the same time. 
 In addition, we assume that the network and the robots are anonymous. 
 Finally, robots are \emph{oblivious}, i.e., each robot performs its move actions based only on its current ''vision'' of the positions of the other robots. 
 Our objective is to characterize, for a graph $G$, the set of integers $k$ such that graph searching can be achieved by a team of $k$ robots starting from \emph{any} $k$ distinct nodes in $G$. 
 Our main result consists in a full characterization of this set, for any asymmetric tree. 
 Towards providing a characterization for all trees, including trees with non-trivial automorphisms, we have also provides a set of positive and negative results, including a full characterization for any line. 
 All our positive results are based on the design of algorithms enabling \emph{perpetual} graph searching to be achieved with the desired number of robots.},

 url = {http://hal.inria.fr/hal-00741982},

 pdf ={http://hal.inria.fr/docs/00/74/19/82/PDF/disc2012-final88-2.pdf},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays = {},

 sorte = "conf-int",

 
}

@inproceedings{BBN12b,

 author = {Blin, L. and Burman, J. and Nisse, N.},

 title = {Nettoyage perp\'etuel de r\'eseaux},

 booktitle = {14es Rencontres Francophones sur les Aspects Algorithmiques de T{\'e}l{\'e}communications (AlgoTel)},

 year = {2012},

 pages = {31-34},

 abstract = {Dans le cadre du {\it nettoyage de graphes contaminés} ({\it graph searching}), des agents mobiles se d\'eplacent successivement le long des ar\^etes du graphe afin de les {\it nettoyer}. 
 Le but g\'en\'eral est le nettoyage en utilisant le moins d'agents possible.
 Nous placons notre étude dans le mod\`ele de calcul distribu\'e {\it CORDA minimaliste}.
 Ce mod\`ele est muni d'hypoth\`eses tr\`es faibles : les n\oe{}uds du r\'eseau et les agents sont anonymes, n'ont pas de m\'emoire du pass\'e ni sens commun de l'orientation et agissent par \emph{cycles} {\it Voir-Calculer-Agir} de mani\`ere \emph{asynchrone}.
 Un int\'er\^et de ce mod\`ele vient du fait que si le nettoyage peut \^etre fait \`a partir de positions arbitraires des agents (par exemple, apr\`es pannes ou recontamination), l'absence de m\'emoire implique un nettoyage perp\'etuel et donc fournit une premi\`ere approche de nettoyage de graphe {\it tol\'erant aux pannes}.
 Les contraintes dues au mod\`ele {\it CORDA minimaliste} nous am\`enent \`a d\'efinir une nouvelle variante de nettoyage de graphes - le {\it nettoyage sans collision}, autrement dit, plusieurs agents ne peuvent occuper simultan\'ement un m\^eme sommet.
 
 Nous montrons que, dans un contexte \emph{centralis\'e}, cette variante ne satisfait pas certaines propri\'et\'es classiques de nettoyage comme par exemple la monotonie. 
 Nous montrons qu'interdire les ``collisions'' peut augmenter le nombre d'agents n\'ecessaires d'un facteur au plus $\Delta$ le degr\'e maximum du graphe et nous illustrons cette borne. 
 De plus, nous caract\'erisons compl\`etement le nettoyage sans collision dans les arbres.
 
 Dans le contexte \emph{distribu\'e}, la question qui se pose est la suivante. 
 Existe-t-il un algorithme qui, \'etant donn\'e un ensemble d'agents mobiles arbitrairement r\'epartis sur des sommets distincts d'un r\'eseau, permet aux agents de nettoyer perp\'etuellement le graphe? 
 Dans le cas des chemins, nous montrons que la r\'eponse est n\'egative si le nombre d'agents est pair dans un chemin d'ordre impair, ou si il y a au plus deux agents dans un chemin d'ordre au moins $3$. 
 Nous proposons un algorithme qui nettoie les chemins dans tous les cas restants, ainsi qu'un algorithme pour nettoyer les arbres lorsqu'un nombre suffisant d'agents est disponible initialement.},

 url = {http://hal.archives-ouvertes.fr/hal-00675233},

 pdf ={http://hal.archives-ouvertes.fr/docs/00/67/52/33/PDF/RR-7897.pdf},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={no},

 x-pays= {},

 sorte = "conf-nat",

 
}

@inproceedings{ChCi12,

 author = {Chiaraviglio, L. and Cianfrani, A.},

 title = {{On the Effectiveness of Sleep Modes in Backbone Networks with Limited Configurations}},

 abstract = {{We study the problem of putting in sleep mode devices of a backbone network, while limiting the number of times each device changes its power state (full power mode or sleep mode). 
 Our aim is to limit the number of network configurations, i.e., the change of the current set of network devices at full power. 
 We develop a model, based on random graph theory, to compute the energy saving given a traffic variation, QoS constraints, and the number of allowed network configurations. 
 Results show that the energy savings with few configurations (two or three per day) are close to the maximum one, in which a new configuration is applied for each traffic matrix. 
 Thus, we can conclude that a practical implementation of sleep mode strategies for network operators is to define, on the basis of typical traffic trend, few configurations to be activated in specific time instants.}},

 booktitle = {{20th International Conference on Software, Telecommunications and Computer Networks (SoftCOM 2012)}},

 address = {Split, Croatia},

 year = {2012},

 pages = {1-6},

 month = Sep,

 pdf={http://www.telematica.polito.it/oldsite/chiaraviglio/papers/SleepModeEffectiveness.pdf},

 x-pays={IT},

 OPTx-editorial-board={no},

 OPTx-proceedings={yes},

 OPTx-international-audience={yes},

 sorte = "conf-int"
 
}

@inproceedings{CHL+12,

 author = {Coudert, D. and Hogie, L. and Lancin, A. and Papadimitriou, D. and P{\'e}rennes, S. and Tahiri, I.},

 title = {{Feasibility study on distributed simulations of BGP}},

 booktitle = {{PADS - 26th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation - 2012}},

 year = {2012},

 month = Apr,

 address = {Zhangjiajie, Chine},

 publisher = {IEEE},

 language = {Anglais},

 affiliation = {MASCOTTE - INRIA Sophia Antipolis / Laboratoire I3S , Alcatel-Lucent Bell - Belgique},

 collaboration = {Alcatel-Lucent-Bell },

 abstract = {{The Autonomous System (AS) topology of the Internet (up to 61k ASs) is growing at a rate of about 10\% per year. 
 The Border Gateway Protocol (BGP) starts to show its limits in terms of the number of routing table entries it can dynamically process and control. 
 Due to the increasing routing information processing and storage, the same trend is observed for routing model simulators such as DRMSim specialized in large-scale simulations of routing models. 
 Therefore, DRMSim needs enhancements to support the current size of the Internet topology and its evolution (up to 100k ASs). 
 To this end, this paper proposes a feasibility study of the extension of DRMSim so as to support the Distributed Parallel Discrete Event paradigm. 
 We first detail the possible distribution models and their associated communication overhead. 
 Then, we analyze this overhead by executing BGP on a partitioned topology according to different scenarios. 
 Finally, we conclude on the feasibility of such a simulator by computing the expected additional time required by a distributed simulation of BGP compared to its sequential simulation.}},

 url = {http://hal.inria.fr/hal-00706415},

 pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/CHL+12.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={yes},

 OPTx-international-audience={yes},

 x-pays = {BE},

 sorte = "conf-int",

 
}

@inproceedings{DDF+12,

 author = {D'Angelo, G. and D'Emidio, M. and Frigioni, D. and Maurizio, V.},

 title = {{Engineering a new loop-free shortest paths routing algorithm}},

 url = {http://hal.inria.fr/hal-00729005},

 abstract = {{We present LFR (Loop Free Routing), a new loop-free distance vector routing algorithm, which is able to update the shortest paths of a distributed network with n nodes in fully dynamic scenarios. 
 If Phi is the total number of nodes affected by a set of updates to the network, and phi is the maximum number of destinations for which a node is affected, then LFR requires O(Phi*Delta) messages and O(n + phi*Delta) space per node, where Delta is the maximum degree of the nodes of the network. 
 We experimentally compare LFR with DUAL, one of the most popular loop-free distance vector algorithms, which is part of CISCO's EIGRP protocol and requires O(Phi*Delta) messages and $\Theta$(n*Delta) space per node. 
 The experiments are based on both real-world and artificial instances and show that LFR is always the best choice in terms of memory require- ments, while in terms of messages LFR outperforms DUAL on real-world instances, whereas DUAL is the best choice on artificial instances.}},

 booktitle = {{11th International Symposium on Experimental Algorithms (SEA2012)}},

 publisher = {Springer},

 pages = {123-134},

 address = {Bordeaux, France},

 volume = {7276},

 series = {Lecture Notes in Computer Science },

 doi = {10.1007/978-3-642-30850-5\_12 },

 year = {2012},

 month = Jun,

 pdf = {http://hal.inria.fr/hal-00729005/PDF/main.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={yes},

 OPTx-international-audience={yes},

 x-pays = {IT},

 sorte = "conf-int",

 
}

@inproceedings{DDF+12b,

 author = {D'Angelo, G. and D'Emidio, M. and Frigioni, D. and Romano, D.},

 title = {{Enhancing the computation of distributed shortest paths on real dynamic networks}},

 booktitle = {{1st Mediterranean Conference on Algorithms}},

 series = {Lecture Notes in Computer Science },

 year = {2012},

 month = Dec,

 address = {Ein-Gedi, Israel},

 volume = {7659},

 pages = {148-158},

 publisher = {Springer},

 abstract = {{The problem of finding and updating shortest paths in distributed networks is considered crucial in today's practical applications. 
 In the recent past, there has been a renewed interest in devising new efficient distance-vector algorithms as an attractive alternative to link-state solutions for large-scale Ethernet networks, in which scalability and reliability are key issues or the nodes can have limited storage capabilities. 
 In this paper we present Distributed Computation Pruning (DCP), a new technique, which can be combined with every distance-vector routing algorithm based on shortest paths, allowing to reduce the total number of messages sent by that algorithm and its space occupancy per node. 
 To check its effectiveness, we combined DCP with DUAL (Diffuse Update ALgorithm), one of the most popular distance-vector algorithm in the literature, which is part of CISCO's widely used EIGRP protocol, and with the recently introduced LFR (Loop Free Routing) which has been shown to have good performances on real networks. 
 We give experimental evidence that these combinations lead to a significant gain both in terms of number of messages sent and memory requirements per node.}},

 url = {http://hal.inria.fr/hal-00755395},

 pdf = {http://hal.inria.fr/hal-00755395/PDF/main.pdf},

 x-pays = {IT},

 OPTx-editorial-board={yes},

 OPTx-proceedings={yes},

 OPTx-international-audience={yes},

 sorte = "conf-int",

 
}

@inproceedings{DDF+12a,

 author = {D'Angelo, G. and D'Emidio, M. and Frigioni, D. and Vitale, C.},

 title = {{Fully Dynamic Maintenance of Arc-Flags in Road Networks}},

 booktitle = {{11th International Symposium on Experimental Algorithms (SEA2012)}},

 year = {2012},

 month = Jun,

 volume = {7276},

 pages = {135-147},

 address = {Bordeaux, France},

 publisher = {Springer},

 series = {Lecture Notes in Computer Science },

 abstract = {{The problem of finding best routes in road networks can be solved by applying Dijkstra's shortest paths algorithm. 
 Unfortunately, road networks deriving from real-world applications are huge yielding unsustainable times to compute shortest paths. 
 For this reason, great research efforts have been done to accelerate Dijkstra's algorithm on road networks. 
 These efforts have led to the development of a number of speed-up techniques, as for example Arc-Flags, whose aim is to compute additional data in a preprocessing phase in order to accelerate the shortest paths queries in an on-line phase. 
 The main drawback of most of these techniques is that they do not work well in dynamic scenarios. 
 In this paper we propose a new algorithm to update the Arc-Flags of a graph subject to edge weight decrease operations. 
 To check the practical performances of the new algorithm we experimentally analyze it, along with a previously known algorithm for edge weight increase operations, on real-world road networks subject to fully dynamic sequences of operations. 
 Our experiments show a significant speed-up in the updating phase of the Arc-Flags, at the cost of a small space and time overhead in the preprocessing phase.}},

 doi = {10.1007/978-3-642-30850-5\_13 },

 url = {http://hal.inria.fr/hal-00729008},

 pdf = {http://hal.inria.fr/hal-00729008/PDF/main.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={yes},

 OPTx-international-audience={yes},

 x-pays = {IT},

 sorte = "conf-int",

 
}

@inproceedings{DDK12,

 author = {D'Angelo, G. and Di Stefano, G. and Klasing, R. and Navarra, A.},

 title = {{Gathering of Robots on Anonymous Grids without multiplicity detection}},

 booktitle = {{19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012)}},

 year = {2012},

 month = Jun,

 volume = {7355},

 pages = {327-338},

 address = {Reykjav{\'\i}k, Iceland},

 publisher = {Springer},

 series = {Lecture Notes in Computer Science},

 abstract = {{The paper studies the gathering problem on grid networks. 
 A team of robots placed at different nodes of a grid, have to meet at some node and remain there. 
 Robots operate in Look-Compute-Move cycles; in one cycle, a robot perceives the current configuration in terms of occupied nodes (Look), decides whether to move towards one of its neighbors (Compute), and in the positive case makes the computed move instantaneously (Move). 
 Cycles are performed asynchronously for each robot. 
 The problem has been deeply studied for the case of ring networks. 
 However, the known techniques used on rings cannot be directly extended to grids. 
 Moreover, on rings, another assumption concerning the so-called multiplicity detection capability was required in order to accomplish the gathering task. 
 That is, a robot is able to detect during its Look operation whether a node is empty, or occupied by one robot, or occupied by an undefined number of robots greater than one. 
 In this paper, we provide a full characterization about gatherable configurations for grids. 
 In particular, we show that in this case, the multiplicity detection is not required. 
 Very interestingly, sometimes the problem appears trivial, as it is for the case of grids with both odd sides, while sometimes the involved techniques require new insights with respect to the well-studied ring case. 
 Moreover, our results reveal the importance of a structure like the grid that allows to overcome the multiplicity detection with respect to the ring case.}},

 doi = {10.1007/978-3-642-31104-8\_28 },

 url = {http://hal.inria.fr/hal-00728988},

 pdf = {http://hal.inria.fr/hal-00728988/PDF/main.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={yes},

 OPTx-international-audience={yes},

 x-pays = {IT,DE},

 sorte = "conf-int",

 
}

@inproceedings{DDN12c,

 author = {D'Angelo, G. and Di Stefano, G. and Navarra, A.},

 title = {{How to gather asynchronous oblivious robots on anonymous rings}},

 url = {http://hal.inria.fr/hal-00728979},

 abstract = {{A set of robots arbitrarily placed on different nodes of an anonymous ring have to meet at one common node and remain in there. 
 This problem is known in the literature as the gathering. 
 Anonymous and oblivious robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), decides whether to stay idle or to move to one of its neighbors (Compute), and in the latter case makes the computed move instantaneously (Move). 
 Cycles are asynchronous among robots. 
 Moreover, each robot is empowered by the so called multiplicity detection capability, that is, it is able to detect during its Look operation whether a node is empty, or occupied by one robot, or occupied by an undefined number of robots greater than one. 
 The described problem has been extensively studied during the last years. 
 However, the known solutions work only for specific initial configurations and leave some open cases. 
 In this paper, we provide an algorithm which solves the general problem, and is able to detect all the ungatherable configurations. 
 It is worth noting that our new algorithm makes use of a unified and general strategy for any initial configuration, even those left open by previous works.}},

 booktitle = {{26th International Symposium on Distributed Computing (DISC 2012)}},

 publisher = {Springer},

 pages = {330-344},

 address = {Salvador, Brazil},

 volume = {7611},

 series = {Lecture Notes in Computer Science },

 year = {2012},

 month = Oct,

 pdf = {http://hal.inria.fr/hal-00728979/PDF/main.pdf},

 OPTx-editorial-board={yes},

 OPTx-proceedings={yes},

 OPTx-international-audience={yes},

 x-pays = {IT},

 sorte = "conf-int",

 
}

@inproceedings{DaMa12,

 author = {Dalle, O. and Mancini, E.},

 title = {Integrated tools for the simulation analysis of peer-to-peer backup systems},

 booktitle = {Proceedings of the 5th International ICST Conference on Simulation Tools and Techniques},

 series = {SIMUTOOLS '12},

 publisher = {ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)},

 year = {2012},

 month = Mar,

 pages = {178-183},

 abstract = {{In order to evaluate the performance and estimate the resource usage of peer-to-peer backup systems, it is important to analyze the time they spend in storing, retrieving and keeping the redundancy of the stored files. 
 The analysis of such systems is difficult due to the random behavior of the peers and the variations of network conditions. 
 Simulations provide a unique means for reproducing such varying conditions in a controlled way. 
 In this paper we describe a general meta-model for peer-to-peer backup systems and a tool-chain, based on SimGrid, to help in their analysis. 
 We validated the meta-model and tool-chain through the analysis of a common scenario, and verified that they can be used, for example, for retrieving the relations between the storage size, the saved data fragment sizes and the induced network workload.}},

 url = {http://dl.acm.org/citation.cfm?id=2263019.2263042},

 pdf = {http://hal.inria.fr/hal-00669241/PDF/paper.pdf},

 OPTx-editorial-board={no},

 OPTx-proceedings={yes},

 OPTx-international-audience={yes},

 sorte = "conf-int",

 
}

@inproceedings{FGJ+12a,

 author = {Fomin, F. V. and Giroire, F. and Jean-Marie, A. and Mazauric, D. and Nisse, N.},

 title = {To Satisfy Impatient Web surfers is Hard},

 booktitle = {6th International Conference on FUN with Algorithms (FUN)},

 year = {2012},

 publisher = {Springer, LNCS},

 volume = {7288},

 pages = {166-176},

 abstract = {Prefetching is a basic mechanism to avoid to waste time when accessing data. 
 However, a tradeoff must be established between the amount of network's resources wasted by the prefetching and the gain of time. 
 For instance, in the Web, browsers may download documents in advance while an Internaut is surfing on the Web. 
 Since the web surfer follows the hyperlinks in an unpredictable way, the choice of the web pages to be prefetched must be computed online. 
 The question is then to determine the minimum amount of resources used by prefetching and that ensures that all documents accessed by the web surfer have previously been loaded in the cache. 
 We model this problem as a game similar to Cops and Robber Games in graphs. 
 A fugitive starts on a marked vertex of a (di)graph G. Turn by turn, an observer marks at most k >= 1 vertices and then the fugitive can move along one edge/arcs of G. 
 The observer wins if he prevents the fugitive to reach an unmarked vertex. 
 The fugitive wins otherwise, i.e., if she enters an unmarked vertex. 
 The surveillance number of a graph is the least k >=1 allowing the observer to win whatever the fugitive does. 
 We also consider the connected variant of this game, i.e., when a vertex can be marked only if it is adjacent to an already marked vertex. 
 All our results hold for both variants, connected or not. 
 We show that deciding whether the surveillance number of a chordal graph equals 2 is NP-hard. 
 Deciding if the surveillance number of a DAG equals 4 is PSPACE-complete. 
 Moreover, computing the surveillance number is NP-hard in split graphs. 
 On the other hand, we provide polynomial time algorithms to compute surveillance number of trees and interval graphs. 
 Moreover, in the case of trees, we establish a combinatorial characterization, related to isoperimetry, of the surveillance number.},

 url = {http://hal.inria.fr/inria-00625703/en/},

 pdf = {http://hal.inria.fr/inria-00625703/PDF/RR-7740.pdf},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays = {NO},

 sorte = "conf-int",

 
}

@inproceedings{FGJ+12b,

 author = {Fomin, F. V. and Giroire, F. and Jean-Marie, A. and Mazauric, D. and Nisse, N.},

 title = {Satisfaire un internaute impatient est difficile},

 booktitle = {{14es Rencontres Francophones sur les Aspects Algorithmiques de T{\'e}l{\'e}communications (AlgoTel)}},

 year = {2012},

 pages = {79-82},

 note = {best paper},

 abstract = {Consid\'erons un internaute qui va d'une page Web \`a une autre en suivant les liens qu'il rencontre. 
 Pour \'eviter que l'internaute ne (s'im)patiente, il est important d'essayer de t\'el\'echarger les documents avant que l'internaute ne les atteigne. 
 Cependant, le co\^ut d'un tel pr\'e-t\'el\'echargement ne doit pas exc\'eder le gain en temps qu'il g\'en\`ere. 
 Ainsi, il faut minimiser la bande passante utilis\'ee pour le pr\'e-t\'el\'echargement tout en s'assurant que l'internaute impatient n'attende jamais. 
 Nous mod\'elisons ce probl\`eme sous forme d'un jeu de type {\it Cops and Robber} dans les graphes.
 En particulier, \'etant donn\'es un graphe $G$ qui repr\'esente le graphe du Web et une page Web de d\'epart $v_0 \in V(G)$, nous d\'efinissons l'{\it indice de contr\^ole} de $G$, $ic(G,v_0) \in \mathbb{N}$, qui mod\'elise la vitesse minimum de t\'el\'echargement suffisante pour que l'internaute partant de $v_0$ n'attende jamais quoi qu'il fasse.
 
 Nous consid\'erons le probl\`eme de d\'ecider si $ic(G,v_0) \leq k$ et d\'emontrons plusieurs r\'esultats de complexit\'e. 
 En particulier, d\'ecider si $ic(G,v_0) \leq 2$ est NP-difficile si $G$ est cordal, et d\'ecider si $ic(G,v_0) \leq 4$ est PSPACE-complet si $G$ est un graphe orient\'e acyclique. 
 Nous donnons un algorithme exponentiel exact qui calcule $ic(G,v_0)$ en temps $O^*(2^n)$ dans un graphe de $n$ sommets quelconque. 
 Puis, nous montrons que le probl\`eme est polynomial dans le cas des arbres et des graphes d'intervalles. 
 Enfin, nous donnons une caract\'erisation combinatoire de l'indice de contr\^ole. 
 Pour tout graphe $G$ et $v_0 \in V(G)$, $ic(G,v_0) \geq \max_{S} \lceil \frac{|N[S]|-1}{|S|} \rceil$ avec $v_0 \in S \subseteq V$, $S$ induit un sous-graphe connexe et $N[S]$ l'ensemble des sommets de $S$ ou voisins d'un sommet de $S$. 
 Il y a de plus \'egalit\'e dans le cas des arbres.},

 url = {http://hal.inria.fr/inria-00625703/en/},

 pdf = {http://hal.inria.fr/inria-00625703/PDF/RR-7740.pdf},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={no},

 x-pays= {NO},

 sorte = "conf-nat",

 
}

@InProceedings{GMP+12,

 author = {Giroire, F. and Moulierac, J. and Phan, T.K. and Roudaut, F.},

 title = {Minimization of Network Power Consumption with Redundancy Elimination},

 booktitle = {IFIP Networking},

 year = {2012},

 pages = {247-258},

 address = {Prague, Czech Republic},

 month = May,

 publisher = {Springer},

 abstract = {Recently, energy-aware routing has gained increasing popularity in the networking research community. 
 The idea is that traffic demands are aggregated over a subset of the network links, allowing other links to be turned off to save energy. 
 In this paper, we propose GreenRE - a new energy-aware routing model with the support of the new technique of data redundancy elimination (RE). 
 This technique, enabled within the routers, can identify and remove repeated content from network transfers. 
 Hence, capacity of network links are virtually increased and more traffic demands can be aggregated. 
 Based on our real experiments on Orange Labs platform, we show that performing RE consumes some energy. 
 Thus, while preserving connectivity and QoS, it is important to identify at which routers to enable RE and which links to turn off so that the power consumption of the network is minimized. 
 We model the problem as an Integer Linear Program and propose a greedy heuristic algorithm. Simulations on several network 
 topologies show that GreenRE can gain further 30% of energy savings in comparison with the traditional energy-aware routing model.},

 URL = {http://hal.inria.fr/hal-00721855},

 PDF = {http://hal.inria.fr/docs/00/72/18/55/PDF/GMP_12.pdf},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays = {},

 sorte = "conf-int",

 
}

@inproceedings{GPF12,

 author = {Goldman, A. and Floriano, P. and Ferreira, A.},

 title = {A tool for obtaining information on DTN traces},

 booktitle = {Proceedings of the 4th Extreme Conference on Communication},

 year = {2012},

 address = {Zurique, CH},

 abstract = {The applications for dynamic networks are growing every day, and thus, so is the number of studies on them. 
 An important part of such studies is the generation of results through simulation and comparison with other works. 
 We implemented a tool to generate information on a given network trace, obtained by building its corresponding evolving graph. 
 This information is useful to help researchers choose the most suitable trace for their work, to interpret the results correctly and to compare data from their work to the optimal results in the network. 
 In this work, we present the implementation of the DTNTES tool which provides the aforementioned services and use the system to evaluate the DieselNet trace.},

 pdf = { extremecom2012.ee.ethz.ch/papers/12-extremecom2012-Floriano.pdf },

 OPTx-editorial-board = {yes},

 OPTx-proceedings = {yes},

 OPTx-international-audience = {yes},

 x-pays = {BR},

 sorte = "conf-int",

 
}

@inproceedings{IDJ+12,

 author = {Idzikowski, F. and Duque, R. and Jimenez, F. and Le Rouzic, E. and Chiaraviglio, L. and Ajmone-Marsan, M.},

 title = {{Energy Saving in Optical Operator Networks: the Challenges, the TREND Vision, and Some Results}},

 abstract = {{We discuss how to save energy in IP-over-WDM networks, presenting the vision of TREND, the FP7 NoE, and the saving that can be obtained with an adaptive routing solution that puts network interfaces of various granularities to sleep in periods of low traffic. 
 Results refer to two operator networks, considering power and traffic forecasts for 2020.}},

 booktitle = {{ECOC 2012 - European Conference and Exhibition on Optical Communication}},

 address = {Amsterdam, Netherlands},

 year = {2012},

 pages = {1-3},

 month = Sep,

 pdf={http://www.telematica.polito.it/oldsite/chiaraviglio/papers/ECOC2012.pdf},

 x-pays={IT,ES,DE,FR},

 OPTx-editorial-board={no},

 OPTx-proceedings={yes},

 OPTx-international-audience={yes},

 sorte = "inv-conf"
 
}

@inproceedings{KLN+12c,

 author = {Kosowski, A. and Li, B. and Nisse, N. and Suchan, K.},

 title = {k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth},

 booktitle = {14es Rencontres Francophones sur les Aspects Algorithmiques de T{\'e}l{\'e}communications (AlgoTel)},

 year = {2012},

 pages = {83-86},

 abstract = {{\it Cops and robber games} concern a team of cops that must capture a robber moving in a graph. 
 We consider the class of $k$-chordal graphs, i.e., graphs with no induced cycle of length greater than $k$, $k\geq 3$. 
 We prove that $k-1$ cops are always sufficient to capture a robber in $k$-chordal graphs. 
 This leads us to our main result, a new structural decomposition for a graph class including $k$-chordal graphs. 
 We present a quadratic algorithm that, given a graph $G$ and $k\geq 3$, either returns an induced cycle larger than $k$ in $G$, or computes a {\it tree-decomposition} of $G$, each {\it bag} of which contains a dominating path with at most $k-1$ vertices. 
 This allows us to prove that any $k$-chordal graph with maximum degree $\Delta$ has treewidth at most $(k-1)(\Delta-1)+2$, improving the $O(\Delta (\Delta-1)^{k-3})$ bound of Bodlaender and Thilikos (1997). 
 Moreover, any graph admitting such a tree-decomposition has hyperbolicity $\leq\lfloor \frac{3}{2}k\rfloor$. 
 As an application, for any $n$-node graph admitting such a tree-decomposition, we propose a {\it compact routing scheme} using routing tables, addresses and headers of size $O(\log n)$ bits and achieving an additive stretch of $O(k\log \Delta)$. 
 As far as we know, this is the first routing scheme with $O(\log n)$-routing tables and small additive stretch for $k$-chordal graphs.},

 url = {http://hal.inria.fr/hal-00671861},

 pdf = {http://hal.archives-ouvertes.fr/docs/00/67/18/97/PDF/RR-7888.pdf},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={no},

 x-pays= {CL},

 sorte = "conf-nat",

 
}

@inproceedings{KLN+12b,

 author = {Kosowski, A. and Li, B. and Nisse, N. and Suchan, K.},

 title = {k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth},

 booktitle = {39th International Colloquium on Automata, Languages and Programming (ICALP, track C)},

 publisher = {Springer, LNCS},

 year = {2012},

 volume = {7392},

 pages = {610-622},

 abstract = {{\it Cops and robber games} concern a team of cops that must capture a robber moving in a graph. 
 We consider the class of $k$-chordal graphs, i.e., graphs with no induced cycle of length greater than $k$, $k\geq 3$. 
 We prove that $k-1$ cops are always sufficient to capture a robber in $k$-chordal graphs. 
 This leads us to our main result, a new structural decomposition for a graph class including $k$-chordal graphs. 
 We present a quadratic algorithm that, given a graph $G$ and $k\geq 3$, either returns an induced cycle larger than $k$ in $G$, or computes a {\it tree-decomposition} of $G$, each {\it bag} of which contains a dominating path with at most $k-1$ vertices. 
 This allows us to prove that any $k$-chordal graph with maximum degree $\Delta$ has treewidth at most $(k-1)(\Delta-1)+2$, improving the $O(\Delta (\Delta-1)^{k-3})$ bound of Bodlaender and Thilikos (1997). 
 Moreover, any graph admitting such a tree-decomposition has hyperbolicity $\leq\lfloor \frac{3}{2}k\rfloor$. 
 As an application, for any $n$-node graph admitting such a tree-decomposition, we propose a {\it compact routing scheme} using routing tables, addresses and headers of size $O(\log n)$ bits and achieving an additive stretch of $O(k\log \Delta)$. 
 As far as we know, this is the first routing scheme with $O(\log n)$-routing tables and small additive stretch for $k$-chordal graphs.},

 url = {http://hal.inria.fr/hal-00671861},

 pdf = {http://hal.archives-ouvertes.fr/docs/00/67/18/97/PDF/RR-7888.pdf},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays = {CL},

 sorte = "conf-int",

 
}

@InProceedings{PMT+12,

 author = {Moulierac, J. and Phan, T.K. and Thoai, N. and Tran, N.C.},

 title = {Xcast6 Treemap Islands - Revisiting Multicast Model},

 booktitle = {ACM CoNEXT Student Workshop},

 pages = {},

 year = {2012},

 OPTeditor = {},

 OPTvolume = {},

 OPTnumber = {},

 OPTseries = {},

 address = {Nice, France},

 month = December,

 OPTorganization = {},

 publisher = {ACM},

 OPTnote = {},

 OPTannote = {},

 URL = {http://hal.inria.fr/hal-00749266},

 PDF = {http://hal.inria.fr/docs/00/74/92/66/PDF/stud16-phan.pdf},

 abstract = {Due to the complexity and poor scalability, IP Multicast has not been used on the Internet. Recently, Xcast6 - a complementary protocol of IP Multicast has been proposed. 
 However, the key limitation of Xcast6 is that it only supports small multicast sessions. 
 To overcome this, we propose Xcast6 Treemap islands (X6Ti) - a hybrid model of Overlay Multicast and Xcast6. 
 In summary, X6Ti has many advantages: support large multicast groups, simple and easy to deploy on the Internet, no router configuration, no restriction on the number of groups, no multicast routing protocol and no group management protocol. 
 Based on simulation, we compare X6Ti with IP Multicast and NICE protocols to show the benefits of our new model.},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays = {VN},

 sorte = "conf-int",

 
}

@InProceedings{PTN+12,

 author = {Nguyen, D.D. and Phan, T.K. and Thoai, N. and Tran, T.T.},

 title = {MaxNet and TCP Reno/RED on Mice Traffic},

 booktitle = {Modeling, Simulation and Optimization of Complex Processes},

 year = {2012},

 pages = {247-255},

 publisher = {Springer Berlin Heidelberg},

 abstract = {Congestion control is a distributed algorithm to share network bandwidth among competing users on the Internet. 
 In the common case, quick response time for mice traffic (HTTP traffic) is desired when mixed with elephant traffic (FTP traffic). 
 The current approach using loss-based with Additive Increase, Multiplicative Decrease (AIMD) is too greedy and eventually, most of the network bandwidth would be consumed by elephant traffic. 
 As a result, it causes longer response time for mice traffic because there is no room left at the routers. 
 MaxNet is a new TCP congestion control architecture using an explicit signal to control transmission rate at the source node. 
 In this paper, we show that MaxNet can control well the queue length at routers and therefore the response time to HTTP traffic is several times faster than with TCP Reno/RED.},

 URL = {http://hal.inria.fr/hal-00721882},

 PDF = {http://hal.inria.fr/docs/00/72/18/82/PDF/PTN_12.pdf},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays = {VN},

 sorte = "conf-int",

 
}

@techreport{AGL+12,

 author = {Araujo, J. and Giroire, F. and Liu, Y. and Modrzejewski, R. and Moulierac, J.},

 title = {{Energy Efficient Content Distribution}},

 year = {2012},

 month = Oct,

 institution = {INRIA},

 affiliation = {MASCOTTE - INRIA Sophia Antipolis / Laboratoire I3S , Parallelism, Graphs and Optimization Research Group - ParGO , JCP-Consult},

 number = {RR-8091},

 abstract = {{To optimize energy efficiency in network, operators try to switch off as many network devices as possible. 
 Recently, there is a trend to introduce content caches as an inherent capacity of network equipment, with the objective of improving the efficiency of content distribution and reducing network congestion. 
 In this work, we study the impact of using in-network caches and CDN cooperation on an energy-efficient routing. 
 We formulate this problem as Energy Efficient Content Distribution. 
 The objective is to find a feasible routing, so that the total energy con- sumption of the network is minimized subject to satisfying all the demands and link capacity. 
 We exhibit the range of parameters (size of caches, popularity of content, demand intensity, etc.) for which caches are useful. 
 Experiment results show that by placing a cache on each backbone router to store the most popular content, along with well choosing the best content provider server for each demand to a CDN, we can save a total up to 23\% of power in the backbone, while 16\% can be gained solely thanks to caches.}},

 url = {http://hal.inria.fr/hal-00743248},

 pdf = {http://hal.inria.fr/hal-00743248/PDF/report.pdf},

 OPTx-editorial-board={no},

 OPTx-proceedings={no},

 OPTx-international-audience={no},

 x-pays={BR},

 sorte = "Rapports",

 
}

@techreport{AMS+12,

 title = {Hull number: $P_5$-free graphs and reduction rules},

 author = {Araujo, J. and Morel, G. and Sampaio, L. and Soares, R. and Weber, V.},

 year = {2012},

 month = Aug,

 language = {Anglais},

 affiliation = {MASCOTTE - INRIA Sophia Antipolis / Laboratoire I3S , Parallelism, Graphs and Optimization Research Group - ParGO , Laboratoire des sciences pour la conception, l'optimisation et la production - G-SCOP},

 pages = {10},

 institution = {INRIA},

 number = {RR-8045},

 abstract = {{In this paper, we study the (geodesic) hull number of graphs. 
 For any two vertices $u,v\in V$ of a connected undirected graph $G=(V,E)$, the closed interval $I[u,v]$ of $u$ and $v$ is the set of vertices that belong to some shortest $(u,v)$-path. 
 For any $S \subseteq V$, let $I[S]= \bigcup\_{u,v\in S} I[u,v]$. 
 A subset $S\subseteq V$ is (geodesically) convex if $I[S] = S$. 
 Given a subset $S\subseteq V$, the convex hull $I\_h[S]$ of $S$ is the smallest convex set that contains $S$. 
 We say that $S$ is a hull set of $G$ if $I\_h[S] = V$. 
 The size of a minimum hull set of $G$ is the hull number of $G$, denoted by $hn(G)$. 
 First, we show a polynomial-time algorithm to compute the hull number of any $P\_5$-free triangle-free graph. 
 Then, we present four reduction rules based on vertices with the same neighborhood. 
 We use these reduction rules to propose a fixed parameter tractable algorithm to compute the hull number of any graph $G$, where the parameter can be the size of a vertex cover of $G$ or, more generally, its neighborhood diversity, and we also use these reductions to characterize the hull number of the lexicographic product of any two graphs.}},

 url = {http://hal.inria.fr/hal-00724120},

 pdf = {http://hal.inria.fr/hal-00724120/PDF/RR-8045.pdf},

 OPTx-editorial-board={no},

 OPTx-proceedings={no},

 OPTx-international-audience={no},

 x-pays = {BR},

 sorte = "Rapports",

 
}

@techreport{BHM12,

 author = {Bang-Jensen, J. and Havet, F. and Maia, A. K.},

 title = {Finding a subdivision of a digraph},

 institution = {INRIA},

 number = {RR-8024},

 year = {2012},

 month = Jul,

 abstract = {We consider the following problem for oriented graphs and digraphs: Given a directed graph D, does it contain a subdivision of a prescribed digraph F? 
 We give a number of examples of polynomial instances, several NP-completeness proofs as well as a number of conjectures and open problems.},

 url = {http://hal.inria.fr/hal-00720500},

 pdf = {http://hal.inria.fr/hal-00720500/PDF/RR-8024.pdf},

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={no},

 x-pays = {DK},

 sorte = "Rapports",

 
}

@techreport{BCD+12b,

 author = {Bermond, J-C. and Coudert, D. and D'Angelo, G. and Moataz, F. Z.},

 title = {{Diverse Routing with the star property}},

 language = {Anglais},

 affiliation = {MASCOTTE - INRIA Sophia Antipolis / Laboratoire I3S},

 institution = {INRIA},

 number = {RR-8071},

 year = {2012},

 month = Sep,

 abstract = {{The notion of Shared Risk Link Groups (SRLG) has been introduced to capture survivability issues where a set of links of a network fail simultaneously. 
 In this context, the \emph{diverse routing} problem is to find a set of SRLG-disjoint paths between a given pair of end nodes of the network. 
 This problem has been proved $NP$-complete in general\~\cite{Hu03} and some polynomial instances have been characterized\~\cite{CDP+07}. 
 In this paper, we investigate the diverse routing problem in networks satisfying the \emph{star property}\~\cite{LW05}. 
 This property states that an edge may be subject to several SRLGs but all edges subject to a given SRLG are incident to a common node. 
 We first provide counter-examples to the polynomial time algorithm proposed in\~\cite{LW05} for computing pairs of SRLG-disjoint paths in networks with the star property, and then prove that this problem is in fact $NP$-hard in the strong sense. 
 More generally, we prove that the diverse routing problem in networks with the star property is $NP$-hard in the strong sense, hard to approximate, and $W[1]$-hard when the parameter is the number of SRLG-disjoint paths. Last, we devise polynomial time algorithms for practically relevant subcases, in particular when the number of SRLG is constant, the maximum degree of the vertices is strictly smaller than 5, and when the network is a directed acyclic graph.}},

 hal_id = {hal-00733869},

 url = {http://hal.inria.fr/hal-00733869},

 pdf = {http://hal.inria.fr/hal-00733869/PDF/RR-8071.pdf},

 x-pays = {IT,MA},

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={yes},

 sorte = "Rapports",

 
}

@techreport{BBN12a,

 author = {L. Blin and J. Burman and N. Nisse},

 title = {Perpetual Graph Searching},

 url = {http://hal.archives-ouvertes.fr/hal-00675233},

 pdf ={http://hal.archives-ouvertes.fr/docs/00/67/52/33/PDF/RR-7897.pdf},

 institution = {INRIA},

 number = {RR-7897},

 year = {2012},

 month = feb,

 abstract = {In {\it graph searching}, a team of mobile agents aims at clearing the edges of a contaminated graph. 
 To clear an edge, an agent has to slide along it, however, an edge can be {\it recontaminated} if there is a path without agents from a contaminated edge to a clear edge. 
 To goal of graph searching is to clear the graph, i.e., all edges are clear simultaneously, using the fewest number of agents. 
 We study this problem in the {\it minimal CORDA} model of distributed computation. 
 This model has very weak hypothesis: network nodes and agents are anonymous, have no memory of the past, and agents have no common sense of orientation. 
 Moreover, all agents execute the same algorithm in the {\it Look-Compute-Move} manner and in an asynchronous environment. 
 One interest of this model is that, if the clearing can be done by the agents starting from arbitrary positions (e.g., after faults or recontamination), the lack of memory implies that the clearing is done perpetually and then provides a first approach of fault-tolerant graph searching. 
 Constraints due to the minimal CORDA model lead us to define a new variant of graph searching, called {\it graph searching without collisions}, where more than one agent cannot occupy the same node.
 
 We show that, in a centralized setting, this variant does not have the same behavior as classical graph searching. 
 For instance, it not monotonous nor close by subgraph. We show that, in a graph with maximum degree $\Delta$, the smallest number of agents required to clear a graph without collisions is at most $\Delta$ times the number of searchers required when collisions are allowed. 
 Moreover, this bound is tight up to a constant ratio. Then, we fully characterize graph searching without collisions in trees.
 
 In a distributed setting, i.e., in the minimal CORDA model, the question we ask is the following. Given a graph $G$, does there exist an algorithm that clears $G$, whatever be the initial positions of the agents on distinct vertices. 
 In the case of a path network, we show that it is not possible is the number of agents is even in a path of odd order, or if there are at most two agents in a path with at least three vertices. We present an algorithm that clears all paths in all remaining cases. 
 Finally, we propose an algorithm that clears any tree using a sufficient number of agents.},

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={no},

 x-pays = {},

 sorte = "Rapports",

 
}

@techreport{CHS+12,

 author = {Campos, V. and Havet, F. and Sampaio, R. and Silva, A.},

 title = {{Backbone colouring: tree backbones with small diameter in planar graphs}},

 year = {2012},

 month = Nov,

 institution = {INRIA},

 affiliation = {Parallelism, Graphs and Optimization Research Group - ParGO , MASCOTTE - INRIA Sophia Antipolis / Laboratoire I3S},

 number = {RR-8151},

 language = {Anglais},

 abstract = {{Given a graph $G$ and a spanning subgraph $T$ of $G$, a {\it backbone $k$-colouring} for $(G,T)$ is a mapping $c:V(G)\to\{1,\ldots,k\}$ such that $|c(u)-c(v)|\geq 2$ for every edge $uv\in E(T)$ and $|c(u)-c(v)|\geq 1$ for every edge $uv\in E(G)\setminus E(T)$. 
 The {\it backbone chromatic number} $BBC(G,T)$ is the smallest integer $k$ such that there exists a backbone $k$-colouring of $(G,T)$. 
 In 2007, Broersma et al. \cite{BFG+07} conjectured that $BBC(G,T)\leq 6$ for every planar graph $G$ and every spanning tree $T$ of $G$. 
 In this paper, we prove this conjecture when $T$ has diameter at most four.}},

 url = {http://hal.inria.fr/hal-00758548},

 pdf = {http://hal.inria.fr/hal-00758548/PDF/RR-8151.pdf},

 OPTx-editorial-board={no},

 OPTx-proceedings={no},

 OPTx-international-audience={no},

 x-pays={BR},

 sorte = "Rapports",

 
}

@techreport{CCL12,

 url = {http://hal.inria.fr/hal-00735481},

 title = {{Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs}},

 author = {Cohen, N. and Coudert, D. and Lancin, A.},

 abstract = {{Let $G$ be a connected graph, and let $\dd(a,b)$ denotes the shortest path distance between vertices $a$ and $b$ of $G$. 
 The graph $G$ is $\delta$-hyperbolic if for any vertices $a, b, c, d$ of $G$, the two largest of the three sums $S\_1=\dd(a,b)+\dd(c,d)$, $S\_2 = \dd(a,c)+\dd(b,d)$, and $S\_3 = \dd(a,d)+\dd(b,c)$ differ by at most $2\delta$. 
 This can be determined in time $O(n^4)$ which could be prohibitive for large graphs. 
 In this document, we propose an exact algorithm for determining the hyperbolicity of a graph that is scalable for large graphs. 
 The time complexity of this algorithm is a function of the size of the largest bi-connected component of the graph, of the shortest path distance distribution in this componenant and of the value of the hyperbolicity. 
 In the worst case, the time complexity remains in $O(n^4)$, but it is much faster in practice. We also propose both a multiplicative factor and an additive constant approximation algorithms. 
 We then analyze further the time complexity of our exact algorithm for several class of graphs, and present some computational results on large-scale graphs.}},

 language = {Anglais},

 affiliation = {Laboratoire de Recherche en Informatique - LRI , MASCOTTE - INRIA Sophia Antipolis / Laboratoire I3S},

 institution = {INRIA},

 number = {RR-8074},

 year = {2012},

 month = Sep,

 pdf = {http://hal.inria.fr/hal-00735481/PDF/RR-8074-v2.pdf},

 x-pays = {},

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={yes},

 sorte = "Rapports",

 
}

@techreport{ADN+12,

 author = {D'Angelo, G. and Di Stefano, G. and Navarra, A. and Nisse, N. and Suchan, K.},

 title = {{A unified approach for different tasks on rings in robot-based computing systems}},

 year = {2012},

 institution = {INRIA},

 number = {RR-8013},

 abstract = {{A set of autonomous robots have to collaborate in order to accomplish a common task in a ring-topology where neither nodes nor edges are labeled. 
 We present a unified approach to solve three important problems in the field: the \emph{exclusive perpetual exploration}, the \emph{exclusive perpetual graph searching} and the \emph{gathering} problems. 
 In the first problem, each robot aims at visiting each node infinitely often; in perpetual graph searching, the team of robots aims at clearing all edges of the network infinitely often; and in the gathering problem, all robots must eventually occupy the same node.
 
 We investigate these tasks in the famous {\it CORDA} distributed computing model where the robots cannot communicate but can perceive the positions of other robots. 
 More precisely, each robot is equipped with visibility sensors and motion actuators, and it operates in {\it Look-Compute-Move} asynchronous cycles. 
 In each cycle, a robot takes a snapshot of the current global configuration (Look), then, based on the perceived configuration, takes a decision to stay idle or to move to one of its adjacent nodes (Compute), and in the latter case it eventually moves to this neighbor (Move). 
 Moreover, robots are endowed with very weak capabilities. 
 Namely, they are {\it anonymous}, {\it oblivious}, {\it uniform} (execute the same algorithm) and have {\it no common sense of orientation}. 
 For the first two problems, the {\it exclusivity constraint} must also be satisfied, i.e., a node can be occupied by at most one robot. 
 Finally, the robots have the {\it local multiplicity detection capability} which is required to solve the gathering problem.
 
 In this setting, we devise algorithms that, starting from any exclusive rigid (i.e. aperiodic and asymmetric) configuration, solve the three above mentioned problems in anonymous ring-topologies. 
 Our main algorithms consist of two phases. 
 The first phase is common to all problems and allows $k>2$ robots to achieve a particular configuration in an $n$-node ring, $k<n-2$. 
 The second phase consists of two distinct sub-procedures: one works for $5\leq k<n-3$ robots, $n\geq 10$ (but for $k=5$ and $n=10$), and solves both the exploration and graph searching problems and the second one solves the gathering problem for any $n$ and $2<k<n-2$. 
 For exploration and graph searching we also give a specific algorithm for the case of $k=n-3$. 
 Besides being a unified approach for three different tasks, the given algorithms solve some open problems. 
 Moreover, we provide some impossibility results for the perpetual graph searching problem, showing that it is impossible to solve it with $k<n$ robots if $n\leq 9$ or $k\in \{1,2,3,n-2,n-1\}$. 
 All together, we obtain an almost full characterization of exclusive perpetual graph searching in rings, leaving only open the cases $(k=4,n>9)$ and $(k=5,n=10)$.}},

 url = {http://hal.inria.fr/hal-00716761},

 pdf = {http://hal.inria.fr/hal-00716761/PDF/RR-8013.pdf},

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={no},

 x-pays = {IT,CL},

 sorte = "Rapports",

 
}

@techreport{DDN12b,

 author = {D'Angelo, G. and Di Stefano, G. and Navarra, A.},

 title = {{How to gather asynchronous oblivious robots on anonymous rings}},

 year = {2012},

 institution = {INRIA},

 number = {RR-7963},

 pages = {24},

 abstract = {{A set of robots arbitrarily placed on the nodes of an anonymous graph have to meet at one common node and remain in there. 
 This problem is known in the literature as the \emph{gathering}. 
 Robots operate in Look-Compute-Move cycles; 
 in one cycle, a robot takes a snapshot of the current configuration (Look), decides whether to stay idle or to move to one of its neighbors (Compute), and in the latter case makes the computed move instantaneously (Move). 
 Cycles are performed asynchronously for each robot. 
 Moreover, each robot is empowered by the so called \emph{multiplicity detection} capability, that is, a robot is able to detect during its Look operation whether a node is empty, or occupied by one robot, or occupied by an undefined number of robots greater than one. 
 The described problem has been extensively studied during the last years. 
 However, the known solutions work only for specific initial configurations and leave some open cases. 
 In this paper, we provide an algorithm which solves the general problem, and is able to detect all the non-gatherable configurations. 
 It is worth noting that our new algorithm makes use of a unified and general strategy for any initial configuration.}},

 url = {http://hal.inria.fr/hal-00697132},

 pdf = {http://hal.inria.fr/hal-00697132/PDF/RR-7963.pdf},

 OPTx-editorial-board={no},

 OPTx-proceedings={no},

 OPTx-international-audience={no},

 x-pays = {IT},

 sorte = "Rapports",

 
}

@techreport{Duc12,

 author = {G. Ducoffe},

 title={{E}ulerian and {H}amiltonian Directed Hypergraphs},

 year={2012},

 institution={INRIA},

 number={RR-7893},

 abstract={Let $H=(\mathcal{V},\mathcal{E})$ be a directed hypergraph, sometimes called a dihypergraph. 
 Each vertex $v\in{\mathcal{V}}$ is incident to some hyperarcs in $\mathcal{E}$. 
 Conversely, each hyperarc $E\in{\mathcal{E}}$ is incident to some vertices in $\mathcal{V}$. 
 $H$ is Eulerian if there is a circuit $C$ such that each hyperarc $E\in{\mathcal{E}}$ appears exactly once in $C$. 
 Similarly, $H$ is Hamiltonian if there is a circuit $C^{'}$ such that every vertex $v\in{\mathcal{V}}$ appears exactly once in $C^{'}$.
 We show that both of the problems are NP-complete. 
 Some necessary conditions for a dihypergraph to be Eulerian are presented. 
 We exhibit some families of hypergraphs for which those are sufficient conditions. 
 We also generalize a part of the properties of the Eulerian digraphs to the uniform and regular directed hypergraphs. 
 Stronger generalizations of \textit{Eulerianicity} to dihypergraphs are also studied. 
 Finally, we show that the de Bruijn and Kautz dihypergraphs are Eulerian and Hamiltonian in most cases. 
 We also study some properties of their bipartite representation digraph.},

 URL={http://hal.inria.fr/hal-00674655},

 pdf = {http://hal.inria.fr/docs/00/67/46/55/PDF/RR-7893.pdf},

 OPTx-editorial-board={no},

 OPTx-proceedings={no},

 OPTx-international-audience={no},

 x-pays={},

 sorte = "Rapports",

 
}

@techreport{HaKi12,

 author = {Havet, F. and King, A. D.},

 title = {{List circular backbone colouring}},

 year = {2012},

 month = Nov,

 institution = {INRIA},

 affiliation = {MASCOTTE - INRIA Sophia Antipolis / Laboratoire I3S , Pacific Institute for the Mathematical Sciences - UMI 3069 , Department of Mathematics , Department of Computer Science},

 number = {RR-8159},

 language = {Anglais},

 abstract = {{A natural generalization of graph colouring involves taking colours from a metric space and insisting that the endpoints of an edge receive colours separated by a minimum distance dictated by properties of the edge. 
 In the $q$-backbone colouring problem, these minimum distances are either $q$ or $1$, depending on whether or not the edge is in the {\em backbone}. 
 In this paper we consider the list version of this problem, with particular focus on colours in $\Z\_p$ -- this problem is closely related to the problem of circular choosability. 
 We first prove that the {\em list circular $q$-backbone chromatic number} of a graph is bounded by a function of the list chromatic number. 
 We then consider the more general problem in which each edge is assigned an individual distance between its endpoints, and provide bounds using the Combinatorial Nullstellensatz. 
 Through this result and through structural approaches, we achieve good bounds when both the graph and the backbone belong to restricted families of graphs.}},

 url = {http://hal.inria.fr/hal-00759527},

 pdf = {http://hal.inria.fr/hal-00759527/PDF/RR-8159.pdf},

 OPTx-editorial-board={no},

 OPTx-proceedings={no},

 OPTx-international-audience={no},

 x-pays={CA},

 sorte = "Rapports",

 
}

@techreport{HKL+12,

 author = {Havet, F. and King, A. D. and Liedloff, M. and Todinca, I.},

 title = {{(Circular) backbone colouring: tree backbones in planar graphs}},

 year = {2012},

 month = Nov,

 institution = {INRIA},

 affiliation = {MASCOTTE - INRIA Sophia Antipolis / Laboratoire I3S , Department of Mathematics , Department of Computer Science , Laboratoire d'Informatique Fondamentale d'Orl{\'e}ans - LIFO},

 number = {RR-8152},

 language = {Anglais},

 abstract = {{Consider an undirected graph G and a subgraph H of G, on the same vertex set. 
 The q-backbone chromatic number BBCq(G,H) is the minimum k such that G can be properly coloured with colours from {1, ..., k}, and moreover for each edge of H, the colours of its ends differ by at least q. 
 In this paper we focus on the case when G is planar and H is a forest. 
 We give a series of NP-hardness results as well as upper bounds for BBCq(G,H), depending on the type of the forest (matching, galaxy, spanning tree). 
 Eventually, we discuss a circular version of the problem.}},

 url = {http://hal.inria.fr/hal-00759044},

 pdf = {http://hal.inria.fr/hal-00759044/PDF/RR-8152.pdf},

 OPTx-editorial-board={no},

 OPTx-proceedings={no},

 OPTx-international-audience={no},

 x-pays={CA},

 sorte = "Rapports",

 
}

@techreport{HMY12,

 author = {Havet, F. and Maia, A. K. and Yu, M-L.},

 title = {{Complexity of greedy edge-colouring}},

 year = {2012},

 month = Dec,

 institution = {INRIA},

 affiliation = {MASCOTTE - INRIA Sophia Antipolis / Laboratoire I3S , Department of Maths and Statistics},

 number = {RR-8171},

 abstract = {{The Grundy index of a graph G = (V,E) is the greatest number of colours that the greedy edge-colouring algorithm can use on G. 
 We prove that the problem of determining the Grundy index of a graph G = (V,E) is NP-hard for general graphs. 
 We also show that this problem is polynomial-time solvable for caterpillars. 
 More specifically, we prove that the Grundy index of a caterpillar is $\Delta(G)$ or $\Delta(G)+1$ and present a polynomial-time algorithm to determine it exactly.}},

 url = {http://hal.inria.fr/hal-00762534},

 pdf = {http://hal.inria.fr/hal-00762534/PDF/RR-8171.pdf},

 OPTx-editorial-board={no},

 OPTx-proceedings={no},

 OPTx-international-audience={no},

 x-pays={CA},

 sorte = "Rapports",

 
}

@techreport{HPS12,

 author = {Havet, F. and Paramaguru, N. and Sampathkumar, R.},

 title = {{Detection number of bipartite graphs and cubic graphs}},

 year = {2012},

 month = Oct,

 institution = {INRIA},

 affiliation = {MASCOTTE - INRIA Sophia Antipolis / Laboratoire I3S , Mathematics Wing, Directorate of Distance Education, Mathematics Section, Faculty of Engineering and Technology},

 number = {RR-8115},

 hal_id = {hal-00744365},

 language = {Anglais},

 abstract = {{For a connected graph $G$ of order $|V(G)|\,\geq\,3$ and a $k$-labelling $c\,:\,E(G)\,\rightarrow\,\{1,2,\ldots,k\}$ of the edges of $G,$ the {\it code} of a vertex $v$ of $G$ is the ordered $k\!$-tuple $(\ell\_1,\ell\_2,\ldots,\ell\_k),$ where $\ell\_i$ is the number of edges incident with $v$ that are labelled $i.$ 
 The $k$-labelling $c$ is {\it detectable} if every two adjacent vertices of $G$ have distinct codes. 
 The minimum positive integer $k$ for which $G$ has a detectable $k$-labelling is the {\it detection number} of $G.$ 
 In this paper, we show that it is NP-complete to decide if the detection number of a cubic graph is $2.$ 
 We also show that the detection number of every bipartite graph of minimum degree at least $3$ is at most $2.$ 
 Finally, we give some sufficient condition for a cubic graph to have detection number $3.$}},

 url = {http://hal.inria.fr/hal-00744365},

 pdf = {http://hal.inria.fr/hal-00744365/PDF/RR-8115.pdf},

 OPTx-editorial-board={no},

 OPTx-proceedings={no},

 OPTx-international-audience={no},

 x-pays={IN},

 sorte = "Rapports",

 
}

@techreport{KLN+12a,

 author = {A. Kosowski and B. Li and N. Nisse and K. Suchan},

 title ={k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth},

 url = {http://hal.inria.fr/hal-00671861},

 pdf ={http://hal.archives-ouvertes.fr/docs/00/67/18/97/PDF/RR-7888.pdf},

 institution = {INRIA},

 number = {RR-7888},

 year = {2012},

 month = feb,

 abstract = {{\it Cops and robber games} concern a team of cops that must capture a robber moving in a graph. 
 We consider the class of $k$-chordal graphs, i.e., graphs with no induced cycle of length greater than $k$, $k\geq 3$. 
 We prove that $k-1$ cops are always sufficient to capture a robber in $k$-chordal graphs. 
 This leads us to our main result, a new structural decomposition for a graph class including $k$-chordal graphs. 
 We present a quadratic algorithm that, given a graph $G$ and $k\geq 3$, either returns an induced cycle larger than $k$ in $G$, or computes a {\it tree-decomposition} of $G$, each {\it bag} of which contains a dominating path with at most $k-1$ vertices. 
 This allows us to prove that any $k$-chordal graph with maximum degree $\Delta$ has treewidth at most $(k-1)(\Delta-1)+2$, improving the $O(\Delta (\Delta-1)^{k-3})$ bound of Bodlaender and Thilikos (1997). 
 Moreover, any graph admitting such a tree-decomposition has hyperbolicity $\leq\lfloor \frac{3}{2}k\rfloor$. As an application, for any $n$-node graph admitting such a tree-decomposition, we propose a {\it compact routing scheme} using routing tables, addresses and headers of size $O(\log n)$ bits and achieving an additive stretch of $O(k\log \Delta)$. 
 As far as we know, this is the first routing scheme with $O(\log n)$-routing tables and small additive stretch for $k$-chordal graphs.},

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={no},

 x-pays = {CL},

 sorte = "Rapports",

 
}

@techreport{NiSo12,

 author = {Nisse, N. and Soares, R.},

 title = {{On The Monotonicity of Process Number}},

 institution = {INRIA},

 affiliation = {MASCOTTE - INRIA Sophia Antipolis / Laboratoire I3S},

 number = {RR-7003},

 year = {2012},

 month = Oct,

 language = {Anglais},

 pages = {17},

 abstract = {{Graph searching games involve a team of searchers that aims at capturing a fugitive in a graph. 
 These games have been widely studied for their relationships with tree- and path-decomposition of graphs. 
 In order to define decompositions for directed graphs, similar games have been proposed in directed graphs. 
 In this paper, we consider such a game that has been defined and studied in the context of routing reconfiguration problems in WDM networks. 
 Namely, in the processing game, the fugitive is invisible, arbitrary fast, it moves in the opposite direction of the arcs of a digraph, but only as long as it has access to a strongly connected component free of searchers. 
 We prove that the processing game is monotone which leads to its equivalence with a new digraph decomposition.}},

 hal_id = {hal-00745587},

 url = {http://hal.inria.fr/hal-00745587},

 pdf = {http://hal.inria.fr/hal-00745587/PDF/RRProcessNumberMonotone.pdf},

 OPTx-editorial-board={no},

 OPTx-proceedings={no},

 OPTx-international-audience={no},

 x-pays = {BR},

 sorte = "Rapports",

 
}

@phdthesis{Coh11,

 author = {N. Cohen},

 title = {Some results in graph theory and its applications},

 school = {Ecole doctorale {STIC}, Universit\'e de Nice-Sophia Antipolis},

 day = {20},

 month = oct,

 year = {2011},

 url = {http://tel.archives-ouvertes.fr/tel-00645151/fr/},

 ftp = {http://tel.archives-ouvertes.fr/docs/00/64/51/51/PDF/Nathann_Cohen_-_Thesis.pdf},

 abstract = {This thesis consists in successive glimpses of different
 problems in discrete mathematics related to graph theory. Its mains
 focus is on graph colouring, i.e. on assignments of integer values to
 the vertices (or edges) of a graph satisfying a set of local
 constraints, most of the time the exclusion of specific patterns in
 the coloured graph. For several different types of colouring (vertex
 and edge choosability, acyclic or linear colouring, ...) a state of
 the art is provided, along with results ensuring the existence of such
 colourings on planar graphs or subclasses of them -- with the aim of
 minimising the number of colours used for a given Maximum Degree, or
 Maximum Average Degree. This thesis also deals with decompositions of
 graphs into induced subgraphs, and asserts that similarly to what
 Wilson's theorem implies for non-induced graph decomposition, there
 exists for any graph $H$ an infinite sequence of dense graph whose
 edge set can be partitioned in induced copies of $H$. The proof
 methodology involves hypergraphs, for which a decomposition result is
 presented, i.e. that the complete 3-uniform hypergraph can be
 partitioned into $\lceil \frac {n(n-1)} 6\rceil$ $\alpha$-acyclic
 hypergraphs as conjectured. In a third part are gathered algorithmic
 questions. Those are problems of optimisation or existence motivated
 by telecommunications in networks, studied with the classical
 framework of computational complexity, or the search of subgraphs
 through parametrised complexity. In a fourth part it, considers
 counting problems belonging to the study of chemical graphs, and
 finally details some Integer LinearPrograms used in the Mathematics
 software Sage.},

 x-pays = {FR},

 OPTx-editorial-board={no},

 OPTx-proceedings={no},

 OPTx-international-audience={yes},

 sorte = "these"
 
}

@phdthesis{Mau11,

 author = {Maureira Bravo, J-C},

 title = {{Internet on Rails}},

 year = {2011},

 month = Jan,

 school = {Ecole doctorale {STIC}, Universit\'e de Nice Sophia-Antipolis},

 keywords = {Train communications; WiFi; horizontal handover; layer 2 routes update; infrastructure network; combined chordal topologies; simulations.},

 type = {THESE},

 url = {http://hal.inria.fr/tel-00594951/en},

 pdf = {http://tel.archives-ouvertes.fr/docs/00/59/49/51/PDF/thesis-JcM-final.pdf},

 abstract = {This thesis proposes a new method for providing network connectivity to vehicles over a predefined trajectory (trains, metros, urban buses, etc.). The communication between the vehicle and the infrastructure network is based only on WiFi technology. The contributions of this work are two-fold: 1) the horizontal handover (between WiFi access points) and 2) the design and analysis of an infrastructure network (backbone network plus WiFi access network) deployed along the trajectory of the vehicle. In the first contribution, we propose a handover scheme, called Spiderman Handover, which describes the horizontal handover for an in-motion network (on-board the vehicle) considering a procedure to update the routing information of a bridged infrastructure network (OSI layer 2). We evaluate our proposal by means of simulation and we validate our results by experimental measurements. In the second contribution, we study theoretically the parameters of several chordal like topologies in order to build a 
 backbone network for a linear access network. By comparing these parameters, we propose a backbone network composed by a combination of two chordal topologies. This backbone network provides a good balance between their deployment cost, number of hops to the gateway of the network and a reasonable resilience. Finally, we evaluate the integration of this infrastructure network and the handover scheme by means of simulations. Results showed that the proposed handover scheme works properly on the proposed infrastructure network, allowing the provision of a continuous network connectivity to passengers on-board trains, metros or urban buses.},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 sorte = "these",

 
}

@phdthesis{Maz11,

 author = {Mazauric, D.},

 title = {Optimisation discr{\`e}te dans les r{\'e}seaux de t{\'e}l{\'e}communication: reconfiguration du routage, routage efficace en {\'e}nergie, ordonnancement de liens et placement de donn{\'e}es},

 year = {2011},

 month = Nov,

 school = {Ecole doctorale {STIC}, Universit\'e de Nice Sophia-Antipolis},

 abstract = {Nous nous intéressons dans cette thèse � différents types de réseaux 
 (optiques, sans-fil, pair-� -pair) ayant chacun leurs spécificités mais 
 partageant des problématiques communes : assurer la meilleure qualité de
 services possible, garantir la stabilité du système, minimiser les 
 ressources et donc le coût de fonctionnement. Tout d'abord, nous 
 étudions le problème de la reconfiguration du routage dans les réseaux 
 optiques consistant � rerouter les requêtes de connexion en minimisant 
 les perturbations pour les utilisateurs. Puis, nous nous intéressons au 
 problème de la détermination de routages efficaces en énergie dans les 
 réseaux coeur. Pour ce faire, nous étudions le problème de trouver des 
 routages minimisant le nombre d'équipements utilisés. Ensuite, nous nous
 intéressons aux algorithmes d'ordonnancement des liens dans les réseaux
 sans-fil en présence d'interférence. Enfin, nous considérons le 
 problème de stockage de données dans les réseaux pair-� -pair. Nous 
 étudions l'impact de différentes politiques de placement sur la durée de
 vie des données et nous déterminons un choix de placement optimal. Pour
 résoudre ces problèmes, nous utilisons les outils théoriques des 
 mathématiques discrètes (graphes, configurations, optimisation 
 combinatoire), d'algorithmique (complexité, algorithmique distribuée) et
 de probabilités.},

 url = {http://tel.archives-ouvertes.fr/tel-00643513/fr/},

 pdf = {http://tel.archives-ouvertes.fr/docs/00/64/35/13/PDF/These-Dorian-Mazauric.pdf},

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={no},

 sorte = "these",

 
}

@phdthesis{Rib11,

 hal_id = {tel-00604014},

 url = {http://tel.archives-ouvertes.fr/tel-00604014/en/},

 title = {{Reuse and Scalability in Modeling and Simulation Software Engineering}},

 author = {Ribault, J.},

 abstract = {{L'{\'e}tude d'un syst{\`e}me {\`a} l'aide de simulations informatiques {\`a} {\'e}v{\'e}nements discrets implique plusieurs activit{\'e}s: sp{\'e}ci cation du mod{\`e}le conceptuel, description de l'architecture logicielle du mod{\`e}le, d{\'e}veloppement des logiciels, sc{\'e}narisation de la simulation, instrumentation, plani cation d'exp{\'e}rimentation, con guration des ressources de calcul, ex{\'e}cution, post-traitement et analyse, validation et de v{\'e}ri cation (V\&V). De nombreux {\'e}l{\'e}ments logiciels sont requis pour remplir toutes ces activit{\'e}s. Toutefois, il est fr{\'e}quent de cr{\'e}er un nouveau simulateur {\`a} partir de rien quand on commence une {\'e}tude {\`a} l'aide de simulation. Dans ce cas il est n{\'e}cessaire de d{\'e}velopper de multiples outils prenant en charge les activit{\'e}s de la simulation. Cette th{\`e}se aborde le d{\'e} de la cr{\'e}ation de nouveaux simulateurs tout en r{\'e}utilisant des mod{\`e}les et des outils provenant d'autres simulateurs. En 
 e et, la r{\'e}utilisation de logiciel augmente la abilit{\'e}, est moins sujette aux erreurs, permet une meilleure utilisation des expertises compl{\'e}mentaires, am{\'e}liore la conformit{\'e} aux normes, et acc{\'e}l{\`e}re le d{\'e}veloppement. La r{\'e}utilisation de logiciels peut {\^e}tre appliqu{\'e}e {\`a} toutes les activit{\'e}s de la simulation. Plusieurs probl{\`e}mes doivent {\^e}tre r{\'e}solus pour tirer pleinement pro t de la r{\'e}utilisation. Dans cette th{\`e}se, nous abordons trois questions principales: Tout d'abord, nous {\'e}tudions les solutions pratiques de r{\'e}utilisation permettant de combiner un ensemble choisi d'{\'e}l{\'e}ments logiciels utiles pour la mod{\'e}lisation et la simulation, en incluant aussi bien les mod{\`e}les, les moteurs de simulation, les algorithmes et les outils; Deuxi{\`e}mement, nous nous concentrons sur les questions li{\'e}es {\`a} l'instrumentation; Troisi{\`e}mement, nous {\'e}tudions le probl{\`e}me de l'int{\'e}gration d'{\'e}l{\'e}ments logiciels 
 provenant d'autres simulateurs dans un nouveau simulateur. Pour atteindre ces objectifs, nous {\'e}tudions des techniques avanc{\'e}es de du g{\'e}nie logiciel, tels que le g{\'e}nie logiciel {\`a} base de composants (CBSE) et la programmation orient{\'e}e aspect, sur lesquels nous construisons une solution originale pour la mod{\'e}lisation et la simulation {\`a} l'aide de multiples couches r{\'e}utilisables. Nous avons d{\'e}velopp{\'e} un prototype d'architecture logicielle qui prouve la faisabilit{\'e} de cette solution.}},

 keywords = {simulation; {\'e}v{\`e}nements discrets; aspects; s{\'e}paration des pr{\'e}occupations; instrumentation; mod{\'e}lisation; composant; simulation distribu{\'e}e; r{\'e}utilisation},

 language = {French},

 affiliation = {MASCOTTE - INRIA Sophia Antipolis / Laboratoire I3S - INRIA - Universit{\'e} de Nice Sophia-Antipolis - CNRS : UMR6070},

 school = {Ecole doctorale {STIC}, Universit{\'e} de Nice Sophia-Antipolis},

 type = {THESE},

 year = {2011},

 month = Jan,

 pdf = {http://tel.archives-ouvertes.fr/tel-00604014/PDF/ThesisJudicaelRibaultV4.pdf},

 x-pays = {FR},

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={yes} 
 
}

@inBook{BES11,

 author= {J-C. Bermond and F. Ergincan and M. Syska},

 chapter = { Line Directed Hypergraphs},

 title={ Quisquater Festschrift},

 publisher= { Springer-Verlag },

 address={Berlin Heidelberg},

 series= {Lecture Notes in Computer Science},

 editor={D. Naccache},

 volume={6805},

 pages={25-34},

 year = {2011},

 PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BES11.pdf},

 abstract={In this article we generalize the concept of line digraphs to line
 dihypergraphs. We give some general properties in particular
 concerning connectivity parameters of dihypergraphs and their line
 dihypergraphs, like the fact that the arc connectivity of a
 line dihypergraph is greater than or equal to that of the original
 dihypergraph. Then we show that the De Bruijn and Kautz dihypergraphs
 (which are among the best known bus networks) are iterated line
 digraphs. Finally we give short proofs that they are
 highly connected.},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 sorte = "book",

 x-pays = {CA},

 
}

@inbook{WAD+11b,

 chapter = {17 - Standardizing DEVS model representation},

 title = {Discrete-Event Modeling and Simulation: Theory and Applications},

 publisher = {Taylor and Francis},

 year = {2011},

 pages = {427-458},

 editor = {Wainer, G. and Mosterman, P.},

 author = {G . Wainer and K. Al-Zoubi and O. Dalle and R. C. Hill and S. Mittal and J. L. R. Mart\`in and H. Sarjoughian and L. Touraille and M. K. Traor\'e and B. P. Zeigler},

 url = {http://cell-devs.sce.carleton.ca/publications/2010/WADHMMSTTZ10},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 sorte = "livres-chap",

 
}

@inbook{WAD+11a,

 chapter = {18 - Standardizing DEVS Simulation Middleware},

 title = {Discrete-Event Modeling and Simulation: Theory and Applications},

 publisher = {Taylor and Francis},

 year = {2011},

 pages = {459-494},

 editor = {G. Wainer and P. Mosterman},

 author = {G. A. Wainer and K. Al-Zoubi and O. Dalle and R.C. Hill and S. Mittal and J. L. R. Mart\`in and H. Sarjoughian and L. Touraille and M. K. Traor\'e and B. P. Zeigler},

 category = {Multi Modeling and Modeling Formalisms},

 url = {http://cell-devs.sce.carleton.ca/publications/2010/WADHMMSTTZ10},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 sorte = "livres-chap",

 
}

@article{ACS11,

 author = {V. Andova and N. Cohen and R. {\v{S}}krekovski},

 title = {Graph Classes (Dis)satisfying the Zagreb Indices Inequality},

 journal = {MATCH Commun. Math. Comput. Chem.},

 year = {2011},

 volume = {65},

 number = {3},

 pages = {647-658},

 abstract = {Recently Hansen and Vuki\^cevi\'c proved that the
 inequality $M_1/n \leq M_2/m$, where $M_1$ and $M_2$ are the first and
 second Zagreb indices, holds for chemical graphs, and Vuki\^cevi\'c
 and Graovac proved that this also holds for trees. In both works is
 given a distinct counterexample for which this inequality is false in
 general. Here, we present some classes of graphs with prescribed
 degrees, that satisfy $M_1/n \leq M_2/m$: Namely every graph $G$ whose
 degrees of vertices are in the interval $[c; c + \sqrt c]$ for some integer $c$ satisies this inequality. In addition, we prove that for
 any $\Delta \geq 5$, there is an infinite family of graphs of maximum
 degree $\Delta$ such that the inequality is false. Moreover, an
 alternative and slightly shorter proof for trees is presented, as
 well as for unicyclic graphs.},

 pdf = {http://www.imfm.si/preprinti/PDF/01108.pdf},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays = {FR, SI, MK},

 sorte = "rev-int",

 
}

@article{BCC+11b,

 author = {M. Basavaraju and L. S. Chandran and N. Cohen and F. Havet and T. M\"uller},

 title = {Acyclic edge-coloring of planar graphs },

 journal = {SIAM Journal of Discrete Mathematics},

 volume = {25},

 number = {2},

 year = {2011},

 pages = {463--478},

 abstract = {A proper edge-coloring with the property that every cycle contains edges of
 at least three distinct colors is called an {\it acyclic
 edge-coloring}. The {\it acyclic chromatic index} of a graph $G$,
 denoted $\chi'_a(G)$ is the minimum $k$ such that $G$ admits an {\it
 acyclic edge-coloring} with $k$ colors.
 We conjecture that if $G$ is planar and $\Delta(G)$ is large enough then $\chi'_a(G)=\Delta(G)$.
 We settle this conjecture for planar graphs with girth at least $5$.
 We also show that $\chi'_a(G)\leq \Delta(G) + 12$ for all planar $G$, which improves a previous result by Fiedorowicz et al.},

 pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/BCC+11.pdf},

 x-editorial-board = {yes},

 x-proceedings = {no},

 x-international-audience = {yes},

 x-pays = {IN},

 
}

@article{BBK11,

 author = {Beauquier, J. and Burman, J. and Kutten, S.},

 title = {A self-stabilizing Transformer for Population Protocols with Covering},

 journal = {Theoretical Computer Science},

 volume = {412},

 number = {33},

 year = {2011},

 pages = {4247-4259},

 abstract = {Developing \emph{self-stabilizing} solutions is considered to be more challenging and complicated than developing classical solutions, where a proper initialization of the variables can be assumed. Hence, to ease the task of the developers, some automatic techniques have been proposed to design self-stabilizing algorithms. In this paper, we propose an \emph{automatic transformer} for algorithms in an extended \emph{population protocol model}. Population protocols is a model that was introduced recently for networks with a large number of resource-limited mobile agents. We use a variant of this model. First, we assume agents having characteristics (e.g., moving speed, communication radius) affecting their intercommunication ``speed'', which is reflected by their \emph{cover times}. Second, we assume the existence of a special agent with an unbounded memory, the \emph{base station}. The automatic transformer takes as an input an algorithm solving a \emph{static problem} (and meeting some additional 
 rather natural requirements) and outputs a self-stabilizing algorithm for the same problem. The transformer is built using a \emph{re-execution approach} (the technique consisting of executing an algorithm repeatedly in order to obtain its self-stabilizing version). We show that in the model we use, a transformer based on such an approach is impossible without the assumption of an unbounded memory agent.},

 url = {http://dx.doi.org/10.1016/j.tcs.2010.09.016},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays = {IL},

 sorte = "rev-int",

 
}

@article{BCC+11a,

 author = {J-C. Bermond and Y. M. Chee and N. Cohen and X. Zhang},

 title = {The $\alpha$-Arboricity of Complete Uniform Hypergraphs},

 journal = {SIAM Journal on Discrete Mathematics},

 year = {2011},

 volume = {25},

 number = {2},

 pages = {600-610},

 PDF={ftp://ftp-sop.inria.fr/mascotte/Publications/BCCZ11.pdf},

 abstract = {The $\alpha$-arboricity of the complete 3-uniform
 hypergraph is determined completely.$\alpha$-Acyclicity is an important notion in database theory. The $\alpha$-arboricity
 of a hypergraph H is the minimum number of $\alpha$-acyclic hypergraphs that
 partition the edge set of H.},

 x-editorial-board={yes},

 x-international-audience={yes},

 x-proceedings={no},

 x-pays = {SG},

 sorte = "rev-int",

 
}

@Article{BMS11,

 author = {J-C. Bermond and X. Mu{\~n}oz and I. Sau},

 title = {{Traffic Grooming in Bidirectional WDM Ring Networks}},

 JOURNAL = {Networks},

 year = {2011},

 volume = {58},

 number = {1},

 pages = {20-35},

 x-pays = {ES},

 sorte = "rev-int",

 url = {http://dx.doi.org/10.1002/net.20410},

 pdf = {http://hal.inria.fr/docs/00/42/91/55/PDF/RR-7080.pdf},

 abstract = {We study the minimization of ADMs (Add-Drop Multiplexers) in optical WDM bidirectional rings considering symmetric shortest path routing and all-to-all unitary requests. We precisely formulate the problem in terms of graph decompositions, and state a general lower bound for all the values of the grooming factor $C$ and $N$, the size of the ring. We first study exhaustively the cases $C=1$, $C = 2$, and $C=3$, providing improved lower bounds, optimal constructions for several infinite families, as well as asymptotically optimal constructions and approximations. We then study the case $C>3$, focusing specifically on the case $C = k(k+1)/2$ for some $k \geq 1$. We give optimal decompositions for several congruence classes of $N$ using the existence of some combinatorial designs. We conclude with a comparison of the cost functions in unidirectional and bidirectional WDM rings.},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 
}

@article{BFM+11,

 author = {Bilo, V. and Flammini, M. and Monaco, G. and Moscardelli, L.},

 title = {On the performances of Nash equilibria in isolation games},

 journal = {Journal of Combinatorial Optimization},

 publisher = {Springer Netherlands},

 issn = {1382-6905},

 pages = {378-391},

 volume = {22},

 issue = {3},

 url = {http://dx.doi.org/10.1007/s10878-010-9300-3},

 note = {Special Issue: Selected Papers from the 15th International Computing and Combinatorics Conference},

 abstract = {We study the performances of Nash equilibria in isolation games, a class of competitive location games recently introduced in Zhao et al. (Proc. of the 19th International Symposium on Algorithms and Computation (ISAAC), pp. 148–159, 2008 ). For all the cases in which the existence of Nash equilibria has been shown, we give tight or asymptotically tight bounds on the prices of anarchy and stability under the two classical social functions mostly investigated in the scientific literature, namely, the minimum utility per player and the sum of the players’ utilities. Moreover, we prove that the convergence to Nash equilibria is not guaranteed in some of the not yet analyzed cases.},

 year = {2011},

 x-pays = {IT},

 sorte = "rev-int",

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 
}

@article{BKK+11,

 author = {Bre{\v{s}}ar, B. and Kardo{\v{s}}, F. and Katreni{\v{c}}, J. and Semani{\v{s}}in, G. },

 title = {Minimum $k$-path vertex cover},

 journal = {Discrete Applied Mathematics},

 year = {2011},

 volume = {159},

 number = {12},

 pages = {1189-1195},

 abstract = {A subset $S$ of vertices of a graph $G$ is called a {\em $k$-path vertex cover} if every path of order $k$ in $G$ contains at least one vertex from $S$. Denote by $\psi_k(G)$ the minimum cardinality of a $k$-path vertex cover in $G$. It is shown that the problem of determining $\psi_k(G)$ is NP-hard for each $k\geq2$, while for trees the problem can be solved in linear time. 
 We investigate upper bounds on the value of $\psi_k(G)$ and provide several estimations and exact values of $\psi_k(G)$. We also prove that $\psi_3(G)\le (2n+m)/6$, for every graph $G$ with $n$ vertices and $m$ edges. },

 pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/BKK+11.pdf},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays = {SI, SK},

 sorte = "rev-int",

 
}

@article{CPR11,

 author = {C. Caillouet and S. P\'erennes and H. Rivano},

 title = {{Framework for Optimizing the Capacity of Wireless Mesh Networks}},

 journal = {{Computer Communications}},

 publisher = {Elsevier},

 year = {2011},

 volume = {34},

 number = {13},

 pages = {1645-1659},

 keywords = {Wireless mesh networks, capacity, routing, scheduling, linear programming, column and cut generation.},

 url = {http://dx.doi.org/10.1016/j.comcom.2011.03.002},

 #url = {http://hal.inria.fr/inria-00572967/en},

 abstract = {In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks (WMNs) dedicated to Internet access. Routing and transmission scheduling have a major impact on the capacity provided to the clients. A cross-layer optimization of these problems allows the routing to take into account contentions due to radio interference. We present a generic Mixed Integer Linear Programing description of the congurations of a given WMN, addressing gateway placement, routing, and scheduling optimizations. We then develop new optimization models that can take into account a large variety of radio interference models, and QoS requirements on the routing. We also provide efficient resolution methods that deal with realistic size instances. It allows to work around the combinatoric of simultaneously achievable transmissions and point out a critical region in the network bounding the network achievable capacity. Based upon strong duality arguments, it is then possible to restrict the 
 computation to a bounded area. It allows for computing solutions very efficiently on large networks.},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 sorte = "rev-int",

 
}

@article{CCN+11,

 author = {Chalopin, J. and Chepoi, V. and Nisse, N. and Vax\`es, Y.},

 title = {Cop and robber games when the robber can hide and ride},

 journal = {SIAM Journal of Discrete Maths.},

 year = {2011},

 volume = {25},

 number = {1},

 pages = {333-359},

 abstract = {In the classical cop and robber game, two players, the cop
 C and the robber R, move alternatively along edges of a finite graph
 G=(V,E). The cop captures the robber if both players are on the same
 vertex at the same moment of time. A graph G is called cop win if the
 cop always captures the robber after a finite number of
 steps. Nowakowski, Winkler (1983) and Quilliot (1983) characterized
 the cop-win graphs as graphs admitting a dismantling scheme. In this
 paper, we characterize in a similar way the cop-win graphs in the game
 in which the cop and the robber move at different speeds s' and s,
 s'<= s. We also investigate several dismantling schemes necessary or
 sufficient for the cop-win graphs in the game in which the robber is
 visible only every k moves for a fixed integer k>1. We characterize
 the graphs which are cop-win for any value of k.},

 url = {http://hal.archives-ouvertes.fr/inria-00448243/fr/},

 pdf = {http://hal.archives-ouvertes.fr/docs/00/44/82/43/PDF/RR-7178.pdf},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 
}

@Article{CCM+11,

 author = {N. Cohen and D. Coudert and D. Mazauric and N. Nepomuceno and N. Nisse},

 title = {Tradeoffs in process strategy games with application in the {WDM} reconfiguration problem},

 journal = {Theoretical Computer Science (TCS)},

 year = {2011},

 volume = {412},

 number = {35},

 pages = {4675-4687},

 month = aug,

 url = {http://dx.doi.org/10.1016/j.tcs.2011.05.002},

 pdf = {http://hal.inria.fr/docs/00/59/25/07/PDF/paper-noformat.pdf},

 abstract = { We consider a variant of the graph searching games that models the
 routing reconfiguration problem in WDM networks. In the digraph
 processing game, a team of agents aims at {\it processing}, or
 clearing, the vertices of a digraph~$D$. We are interested in two
 different measures: 1) the total number of agents used, and 2) the
 total number of vertices occupied by an agent during the processing
 of $D$. These measures respectively correspond to the maximum number
 of simultaneous connections interrupted and to the total number of
 interruptions during a routing reconfiguration
 in a WDM network.
 
 Previous works have studied the problem of independently minimizing
 each of these parameters. In particular, the
 corresponding minimization problems are APX-hard, and the first one
 is known not to be in APX. In this paper, we give several
 complexity results and study tradeoffs between these conflicting
 objectives. In particular, we show that minimizing one of these
 parameters while the other is constrained is NP-complete. Then, we
 prove that there exist some digraphs for which minimizing one of
 these objectives arbitrarily impairs the quality of the solution for
 the other one. We show that such bad tradeoffs may happen even for a
 basic class of digraphs. On the other hand, we exhibit classes of
 graphs for which good tradeoffs can be achieved. We finally detail
 the relationship between this game and the routing reconfiguration
 problem. In particular, we prove that any instance of the processing
 game, i.e. any digraph, corresponds to an instance of the routing
 reconfiguration problem.},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays={DK},

 sorte = "rev-int",

 
 
}

@article{CoHa11,

 author = {N. Cohen and F. Havet},

 title = {Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree},

 journal = {Graphs and Combinatorics},

 volume = {27},

 number = {6},

 year = {2011},

 pages = {831-849},

 abstract = {
 A proper vertex colouring of a graph $G$ is {\it 2-frugal} (resp. {\it linear}) if the graph induced by the vertices of any two colour classes is of maximum degree 2 (resp. is a forest of paths). A graph $G$ is {\it 2-frugally} (resp. {\it linearly}) {\it $L$-colourable} if for a given list assignment $L:V(G)\mapsto 2^{\mathbb N}$, there exists a 2-frugal (resp. linear) colouring $c$ of $G$ such that $c(v)\in L(v)$ for all $v\in V(G)$. If $G$ is 2-frugally (resp. linearly) $L$-list colourable for any list assignment such that $|L(v)|\ge k$ for all $v\inV(G)$, then $G$ is {\it 2-frugally} (resp. {\it linearly}) {\it $k$-choosable}. In this paper, we improve some bounds on the 2-frugal choosability and linear choosability of graphs with small maximum average degree.},

 URL={http://hal.inria.fr/inria-00459692/},

 PDF = {http://hal.inria.fr/docs/00/45/96/92/PDF/RR-7213.pdf},

 sorte = {rev-int},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 
}

@article{CGS11,

 author = {D. Coudert and F. Giroire and I. Sau},

 title = {Circuits in graphs through a prescribed set of ordered vertices},

 journal = {Journal of Interconnection Networks (JOIN)},

 year = {2011},

 volume = {11},

 number = {3-4},

 pages = {121-141},

 abstract = {A \emph{circuit} in a simple undirected graph $G=(V,E)$ is a sequence of vertices $\{v_1,v_2,\ldots,v_{k+1}\}$ such that $v_1=v_{k+1}$ and $\{v_i,v_{i+1}\} \in E$ for $i=1,\ldots,k$. A circuit $C$ is said to be \emph{edge-simple} if no edge of $G$ is used twice in $C$. In this article we study the following problem: which is the largest integer $k$ such that, given any subset of $k$ ordered vertices of a graph $G$, there exists an edge-simple circuit visiting the $k$ vertices in the prescribed order? We first study the case when $G$ has maximum degree at most 3, establishing the value of $k$ for several subcases, such as when $G$ is planar or 3-vertex-connected. Our main result is that $k=10$ in infinite square grids. To prove this, we introduce a methodology based on the notion of core graph, in order to reduce the number of possible vertex configurations, and then we test each one of the resulting configurations with an Integer Linear Program (ILP) solver.},

 url = {http://dx.doi.org/10.1142/S0219265910002763},

 pdf = {http://hal.inria.fr/docs/00/58/55/61/PDF/join-final-noformat.pdf},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 
}

@article{CoSe11,

 author = {D. Coudert and J-S. Sereni},

 title = {Characterization of graphs and digraphs with small process number},

 journal = {Discrete Applied Mathematics (DAM)},

 year = {2011},

 volume = {159},

 number = {11},

 pages = {1094-1109},

 month = {jul},

 abstract = {We introduce the process number of a digraph as a tool to study
 rerouting issues in \wdm networks. This parameter is closely related
 to the vertex separation (or pathwidth). We consider the recognition
 and the characterization of (di)graphs with small process number. In
 particular, we give a linear time algorithm to recognize (and
 process) graphs with process number at most $2$, along with a
 characterization in terms of forbidden minors, and a structural
 description. As for digraphs with process number $2$, we exhibit a
 characterization that allows one to recognize (and process) them in
 polynomial time.},

 url = {http://dx.doi.org/10.1016/j.dam.2011.03.010},

 pdf = {http://hal.inria.fr/docs/00/58/77/17/PDF/dam-noformat.pdf},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays={},

 sorte = "rev-int",

 
}

@article{CJK11,

 author = {Czap, J. and S. Jendrol' and Kardo{\v{s}}, F. },

 title = {Facial parity edge colouring},

 journal = {Ars Mathematica Contemporanea},

 year = {2011},

 volume = {4},

 number = {2},

 pages = {255-269},

 abstract = {A \emph{facial parity edge colouring} of a connected bridgeless plane graph is such an edge colouring in which no two face-adjacent edges (consecutive edges of a facial walk of some face) receive the same colour, in addition, for each face $\alpha$ and each colour $c$, either no edge or an odd number of edges incident with $\alpha$ is coloured with $c$. From Vizing's theorem it follows that every $3$-connected plane graph has a such colouring with at most $\Delta^* +1$ colours, where $\Delta^* $ is the size of the largest face. In this paper we prove that any connected bridgeless plane graph has a facial parity edge colouring with at most $92$ colours. },

 pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/CJK11.pdf},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays = {SK},

 sorte = "rev-int",

 
}

@article{CJKa11,

 author = {Czap, J. and S. Jendrol' and Kardo{\v{s}}, F. },

 title = {On the strong parity chromatic number},

 journal = {Discussiones Mathematicae Graph Theory},

 year = {2011},

 volume = {31},

 number = {},

 pages = {587-600},

 abstract = {A vertex colouring of a 2-connected plane graph $G$ is a strong parity vertex colouring if for every face $f$ and each colour $c$, the number of vertices incident with $f$ coloured by $c$ is either zero or odd. Czap et al. [Discrete Math. 311 (2011) 512–520] proved that every 2-connected plane graph has a proper strong parity vertex colouring with at most 118 colours. In this paper we improve this upper bound for some classes of plane graphs },

 pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/CJKa11.pdf},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays = {SK},

 sorte = "rev-int",

 
}

@article{CJK+11,

 author = {Czap, J. and S. Jendrol' and Kardo{\v{s}}, F. and Mi{\v{s}}kuf, J. },

 title = {Looseness of Plane Graphs},

 journal = {Graphs and Combinatorics},

 year = {2011},

 volume = {27},

 number = {1},

 pages = {73-85},

 abstract = {A face of a vertex coloured plane graph is called {\em loose} if the number of colours used on its vertices is at least three. The {\em looseness} of a plane graph $G$ is the minimum $k$ such that any surjective $k$-colouring involves a loose face.
 In this paper we prove that the looseness of a connected plane graph $G$ equals the maximum number of vertex disjoint cycles in a dual graph $G^*$ increased by 2. We also show upper and lower bounds on the looseness of graphs based on the number of vertices, the edge connectivity, and the girth of the dual graph. These bounds improve the result of Negami for the looseness of plane triangulations.
 We also present infinite classes of graphs where the equalities are attained. },

 pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/CJK+11.pdf},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays = {SK},

 sorte = "rev-int",

 
}

@article{DDN+11,

 hal_id = {hal-00643980},

 url = {http://hal.inria.fr/hal-00643980/en/},

 title = {{Recoverable Robust Timetables: An Algorithmic Approach on Trees}},

 author = {G. D'Angelo and Di Stefano, Gabriele and Navarra, Alfredo and Pinotti, Cristina},

 abstract = {{In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivation behind it is to cope with scheduled activities which might be subject to unavoidable disruptions, such as delays, occurring during the operational phase. The idea is to preventively plan some extra time for the scheduled activities in order to be "prepared" if a delay occurs, and absorb it without the necessity of rescheduling all the activities from scratch. This realizes the concept of designing robust timetables. During the planning phase, one should also consider recovery features that might be applied at runtime if disruptions occur. This leads to the concept of recoverable robust timetables. In this new concept, it is assumed that recovery capabilities are given as input along with the possible disruptions that must be considered. The main objective is the minimization of the overall needed time. The quality 
 of a robust timetable is measured by the price of robustness, i.e., the ratio between the cost of the robust timetable and that of a nonrobust optimal timetable. We show that finding an optimal solution for this problem is NP-hard even though the topology of the network, which models dependencies among activities, is restricted to trees. However, we manage to design a paeudopolynomial time algorithm based on dynamic programming and apply it on both random networks and real case scenarios provided by Italian railways. We evaluate the effect of robustness on the scheduling of the activities and provide the price of robustness with respect to different scenarios. We experimentally show the practical effectiveness and efficiency of the proposed algorithm.}},

 language = {English},

 publisher = {IEEE},

 pages = {433 - 446},

 journal = {IEEE Transactions on Computers},

 volume = {60},

 number = {3 },

 doi = {10.1109/TC.2010.142 },

 year = {2011},

 month = Mar,

 pdf = {http://hal.inria.fr/hal-00643980/PDF/RobustTree.pdf},

 x-pays = {IT},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 sorte = "rev-int",

 
}

@article{Dal11a,

 author = {O. Dalle},

 title = {Should Simulation Products Use Software Engineering Techniques or Should They Reuse Products of Software Engineering? -- Part 1},

 journal = {Modeling \& Simulation Magazine},

 publisher = {Sage Publishers},

 year = {2011},

 volume = {11},

 number = {3},

 month = {07},

 note = {Online publication},

 url = {http://hal.inria.fr/inria-00638553},

 PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Dal11.pdf},

 abstract = {This two-part article addresses the issues concerning the building
 of new simulation software by either reusing existing general purpose software
 products and frameworks or by writing the simulation software from scratch.
 As a means of discussing the use of existing software, this first part
 escribes a selected list of such existing software: the Eclipse IDE as
 graphical user front-end, Maven for the management and building of projects,
 Bonita for supporting simulation workflows, Ruby on Rails and its Hobo
 extension to provide online persistence, and the Fractal Component Model for
 supporting the popular Component-Based Modeling \& Simulation approach. The
 second part, to be published in the next issue of the \emph{M\&S Magazine},
 will further explore some interesting features found in the selected software
 solutions, and discuss their benefits when applied to simulation. },

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={yes},

 sorte = "conf-int",

 
}

@article{Dal11b,

 author = {O. Dalle},

 title = {Should Simulation Products Use Software Engineering Techniques or Should They Reuse Products of Software Engineering? -- Part 2},

 journal = {Modeling \& Simulation Magazine},

 publisher = {Sage Publishers},

 year = {2011},

 volume = {11},

 number = {4},

 month = {10},

 note = {Online publication},

 url = {http://hal.inria.fr/inria-00638555_v1/},

 abstract = {This two-part article addresses the issues concerning the building
 of new simulation software by either reusing existing general purpose software
 products and frameworks or by writing the simulation software from scratch.
 As a means of discussing the use of existing software, this first part
 escribes a selected list of such existing software: the Eclipse IDE as
 graphical user front-end, Maven for the management and building of projects,
 Bonita for supporting simulation workflows, Ruby on Rails and its Hobo
 extension to provide online persistence, and the Fractal Component Model for
 supporting the popular Component-Based Modeling \& Simulation approach. The
 second part, to be published in the next issue of the \emph{M\&S Magazine},
 will further explore some interesting features found in the selected software
 solutions, and discuss their benefits when applied to simulation. },

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={yes},

 sorte = "conf-int",

 
}

@article{EHL+11,

 author = {R. Erman and F. Havet and B. Lidick{\'{y}} and O. Pangr\'ac},

 title = {5-colouring graphs with 4 crossings},

 year = {2011},

 volume = {25},

 number = {1},

 pages = {401-422},

 journal={SIAM Journal on Discrete Mathematics},

 abstract = {We disprove a conjecture of
 Oporowski and Zhao stating that every graph with crossing number at most 5
 and clique number at most 5 is 5-colourable.
 However, we show that every graph with crossing number at most 4 and
 clique number at most 5 is 5-colourable.
 We also show some colourability results on graphs that can
 be made planar by removing few edges.
 In particular, we show that if there exists three edges whose removal
 leaves the graph planar then it is $5$-colourable.},

 pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/EHL+11.pdf},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays={CZ,SI},

 sorte = "rev-int",

 
}

@article{EKK+11,

 author = {Esperet, L. and Kardo{\v{s}}, F. and King, A. D. and Kr{\'{a}}l', D. and Norine, S. },

 title = {Exponentially many perfect matchings in cubic graphs},

 journal = {Advances in Mathematics},

 year = {2011},

 volume = {227},

 number = {4},

 pages = {1646-1664},

 abstract = {We show that every cubic bridgeless graph $G$ has at least $2^{|V(G)|/3656}$ perfect matchings. This confirms an old conjecture of Lov{\'{a}}sz and Plummer. },

 pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/EKK+11.pdf},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays = {CZ, SK, US},

 sorte = "rev-int",

 
}

@article{GiPe10,

 author="P. Giabbanelli and J. G. Peters",

 title="Complex networks and epidemics",

 journal="Technique et Science Informatiques",

 year={2011},

 volume = {20},

 number = {2},
pages = {181-212},

 month = {},

 abstract={The study of spreading processes, such as infectious diseases or 
 computer worms, is well-motivated by its financial impact and 
 humanitarian aspects. A vast amount of research has emerged through the 
 theory of complex networks, that sheds light on the properties found in a
 wide range of "real-world" networks. We review these properties in the 
 context of spreads, with an emphasis on the settings underlying some of 
 the major claims in the literature such as whether or not a scale-free 
 network is particularly prone to spreading phenomena. Stochastic models 
 have been well studied in the literature, and thus we focus on 
 deterministic models, highlighting the connections between the two 
 approaches. Finally, we classify immunization strategies into four 
 categories, which allows comparisons on common features from a computer 
 science perspective. Several topics for future work are suggested. For 
 example, it remains open whether immunization strategies, such as those 
 based on degree, benefit from complex network properties.},

 doi = {http://dx.doi.org/10.3166/tsi.30.181-212},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 sorte = "rev-nat",

 
}

@article{HJS+11,

 author = {F. Havet and S. Jendrol' and R. Sot{\'a}k and E. {\v{S}}krabul'{\'a}kov{\'a}},

 title = {Facial non-repetitive edge-colouring of plane graphs},

 journal = {Journal of Graph Theory},

 volume = {66},

 number = {1},

 year = {2011},

 pages = {38--48},

 abstract = {A sequence $r_1,r_2,\dots,r_{2n}$ such that $r_i=r_{n+i}$ for all $1\leq i \leq n$, is called a {\em repetition}. A sequence $S$ is called {\em non-repetitive} if no {\it block} (i.e. subsequence of consecutive terms of $S$) is a repetition. Let $G$ be a graph whose edges are coloured. A trail is called {\em non-repetitive} if the sequence of colours of its edges is non-repetitive. If $G$ is a plane graph, a {\em facial non-repetitive edge-colouring} of $G$ is an edge-colouring such that any {\it facial trail} (i.e. trail of consecutive edges on the boundary walk of a face) is non-repetitive. We denote $\pi'_f(G)$ the minimum number of colours of a facial non-repetitive edge-colouring of $G$. In this paper, we show that $\pi'_f(G)\leq 8$ for any plane graph $G$. We also get better upper bounds for $\pi'_f(G)$ in the cases when $G$ is a tree, a plane triangulation, a simple $3$-connected plane graph, a hamiltonian plane graph, an outerplanar graph or a Halin graph. The bound $4$ for trees is tight.
 },

 URL={http://hal.inria.fr/inria-00366589/en/},

 PDF = {http://hal.inria.fr/docs/00/36/65/89/PDF/RR-6873.pdf},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 sorte = "rev-int",

 
}

@article{HKK+11,

 author = {F. Havet and M. Klazar and J. Kratochv{\'{i}}l and D. Kratsch and M. Liedloff},

 title = {Exact algorithms for L(2,1)-labelling},

 journal = {Algorithmica},

 volume = {59},

 number = {2},

 year = {2011},

 pages = {169--194},

 abstract = {The notion of distance constrained graph labelings, motivated by the
 Frequency Assignment Problem, reads as follows: A mapping from the
 vertex set of a graph $G=(V,E)$ into an interval of integers
 $\{0, \dots ,k\}$ is an $L(2,1)$-labeling of $G$ of span $k$ if any two
 adjacent vertices are mapped onto integers that are at least 2
 apart, and every two vertices with a common neighbor are mapped onto
 distinct integers. It is known that for any fixed $k\ge 4$, deciding
 the existence of such a labeling is an NP-complete problem. We
 present exact exponential time algorithms that are faster than the
 naive $O((k+1)^n)$ algorithm that would try all possible mappings.
 The improvement is best seen in the first NP-complete case of $k=4$
 -- here the running time of our algorithm is $O(1.3006^n)$. % $O(1.3161^n)$.
 Furthermore we show that dynamic programming can be used to establish
 %an $O(c^n)$ algorithm to compute an optimal $L(2,1)$-labeling, for a constant $c< 4$.
 an $O(3.8730^n)$ algorithm to compute an optimal $L(2,1)$-labeling.},

 pdf = {http://hal.archives-ouvertes.fr/docs/00/30/33/30/PDF/RR-6587.pdf},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays={CZ},

 
}

@article{KKS11,

 author = {Kardo{\v{s}}, F. and Katreni{\v{c}}, J. and Schiermeyer, I. },

 title = {On computing the minimum 3-path vertex cover and dissociation number of graphs},

 journal = {Theoretical Computer Science},

 year = {2011},

 volume = {412},

 number = {50},

 pages = {7009-7017},

 abstract = {The dissociation number of a graph $G$ is the number of vertices in a maximum size induced subgraph of $G$ with vertex degree at most 1. A $k$-path vertex cover of a graph $G$ is a subset $S$ of vertices of $G$ such that every path of order $k$ in $G$ contains at least one vertex from $S$. The minimum $3$-path vertex cover is a dual problem to the dissociation number. For this problem we present an exact algorithm with a running time of $\mathcal{O}^*(1.5171^n)$ on a graph with $n$ vertices.
 We also provide a polynomial time randomized approximation algorithm with an expected approximation ratio of $\frac{23}{11}$ for the minimum $3$-path vertex cover. },

 pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/KKS11.pdf},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays = {GE, SK},

 sorte = "rev-int",

 
}

@article{KKV11,

 author = {Kardo{\v{s}}, F. and Kr{\'{a}}l', D. and Volec, J. },

 title = {Fractional colorings of cubic graphs with large girth},

 journal = {SIAM Journal on Discrete Mathematics},

 year = {2011},

 volume = {25},

 number = {3},

 pages = {1454-1476},

 abstract = {We show that every (sub)cubic $n$-vertex graph with sufficiently large girth has fractional chromatic number at most $2.2978$ which implies that it contains an independent set of size at least $0.4352n$. Our bound on the independence number is valid to random cubic graphs as well as it improves existing lower bounds on the maximum cut in cubic graphs with large girth. },

 pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/KKV11.pdf},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays = {CZ, SK},

 sorte = "rev-int",

 
}

@InProceedings{ABG+11b,

 author = {Araujo, J. and Bermond, J-C. and Giroire, F. and Havet, F. and Mazauric, D. and Modrzejewski, R.},

 title = {Weighted Improper Colouring},

 booktitle = {Combinatorial Algorithms},

 year = {2011},

 address = {Victoria, Canada},

 publisher= { Springer Berlin Heidelberg },

 series= {Lecture Notes in Computer Science},

 editor={Iliopoulos, C. S. and Smyth, W. F.},

 month = {June},

 volume= {7056},

 pages= {1-18},

 abstract = {In this paper, we study a colouring problem motivated by a
 practical frequency assignment problem and up to our best
 knowledge new. In wireless networks, a node interferes with the
 other nodes the level of interference depending on numerous
 parameters: distance between the nodes, geographical topography,
 obstacles, etc. We model this with a weighted graph $G$ where the
 weights on the edges represent the noise (interference) between the
 two end-nodes. The total interference in a node is then the sum of
 all the noises of the nodes emitting on the same frequency. A
 weighted $t$-improper $k$-colouring of $G$ is a $k$-colouring of the
 nodes of $G$ (assignment of $k$ frequencies) such that the
 interference at each node does not exceed some threshold
 $t$. The Weighted Improper Colouring problem, that we consider here
 consists in determining the weighted $t$-improper chromatic number
 defined as the minimum integer $k$ such that $G$ admits a weighted
 $t$-improper $k$-colouring. We also consider the dual problem, denoted the
 Threshold Improper Colouring problem, where given a number $k$ of
 colours (frequencies) we want to determine the minimum real $t$ such
 that $G$ admits a weighted $t$-improper $k$-colouring. We show that
 both problems are NP-hard and first present general upper bounds; in
 particular we show a generalisation of Lov\'asz's Theorem for the
 weighted $t$-improper chromatic number. We then show how to
 transform an instance of the Threshold Improper Colouring problem
 into another equivalent one where the weights are either 1 or $M$,
 for a sufficient big value $M$. Motivated by the original
 application, we study a special interference model on various grids
 (square, triangular, hexagonal) where a node produces a noise of
 intensity 1 for its neighbours and a noise of intensity 1/2 for the
 nodes that are at distance 2. Consequently, the problem consists of
 determining the weighted $t$-improper chromatic number when $G$ is
 the square of a grid and the weights of the edges are 1, if
 their end nodes are adjacent in the grid, and 1/2 otherwise.
 Finally, we model the problem using linear integer programming,
 propose and test heuristic and exact Branch-and-Bound algorithms on
 random cell-like graphs, namely the Poisson-Voronoi tessellations.},

 doi={10.1007/978-3-642-25011-8_1},

 url={http://dx.doi.org/10.1007/978-3-642-25011-8_1},

 pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/ABG+11b.pdf},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 sorte = "conf-int",

 x-pays = {BR},

 
}

@InProceedings{ACGS+11b,

 author = {J. Araujo and V. Campos and F. Giroire and L. Sampaio and R. Soares },

 title = {On the hull number of some graph classes},

 booktitle = {Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb'11)},

 series = {Electronic Notes in Discrete Mathematics},

 pages = {49-55},

 volume = {38},

 year = {2011},

 address = {Budapest, Hungary},

 month = {September},

 abstract = {Given a graph G = (V, E), the closed interval of a pair of vertices u, v \in V ,
 denoted by I[u, v], is the set of vertices that belongs to some shortest (u, v)-path.
 For a given S \subseteq V , let I[S] = u,v \in S I[u, v]. We say that S \subseteq V is a convex set if
 I[S] = S.
 The convex hull Ih [S] of a subset S \subseteq V is the smallest convex set that contains
 S. We say that S is a hull set if Ih [S] = V . The cardinality of a minimum hull set
 of G is the hull number of G, denoted by hn(G).
 We show that deciding if hn(G) \leq k is an NP-complete problem, even if G is
 bipartite. We also prove that hn(G) can be computed in polynomial time for cactus
 and P4 -sparse graphs.
 },

 url={http://www.sciencedirect.com/science/article/pii/S1571065311000783},

 pdf={ftp://ftp-sop.inria.fr/mascotte/Publications/ACGS+11b.pdf},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays = {BR},

 sorte = "conf-int",

 
}

@InProceedings{AGM11,

 author = {J. Araujo and F. Giroire and J. Monteiro },

 title = {Hybrid Approaches for Distributed Storage Systems},

 booktitle = {Proceedings of Fourth International Conference on Data Management in Grid and P2P Systems (Globe'11)},

 year = {2011},

 address = {Toulouse, France},

 month = {September},

 abstract = {Distributed or peer-to-peer storage solutions rely on the in-
 troduction of redundant data to be fault-tolerant and to achieve high
 reliability. One way to introduce redundancy is by simple replication.
 This strategy allows an easy and fast access to data, and a good band-
 width efficiency to repair the missing redundancy when a peer leaves or
 fails in high churn systems.
 However, it is known that erasure codes, like Reed-Solomon, are an effi-
 cient solution in terms of storage space to obtain high durability when
 compared to replication.
 Recently, the Regenerating Codes were proposed as an improvement of
 erasure codes to better use the available bandwidth when reconstructing
 the missing information.
 In this work, we compare these codes with two hybrid approaches. The
 first was already proposed and mixes erasure codes and replication. The
 second one is a new proposal that we call Double Coding. We compare
 these approaches with the traditional Reed-Solomon code and also Re-
 generating Codes from the point of view of availability, durability and
 storage space. This comparison uses Markov Chain Models that take into
 account the reconstruction time of the systems.
 },

 PDF={ftp://ftp-sop.inria.fr/mascotte/Publications/AGM11.pdf},

 url = {http://hal.inria.fr/inria-00635781/fr/},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays = {BR},

 sorte = "conf-int",

 
}

@InProceedings{BHT11,

 author = {J. Bang-Jensen and F. Havet and N. Trotignon},

 title = {Finding an induced subdivision of a digraph},

 year = {2011},

 booktitle = {VI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2011)},

 journal = {Electronic Notes on Discrete Mathematics},

 pages = {09-14},

 volume = {37},

 address = {Bariloche, Argentina},

 month = {04},

 abstract = {We consider the following problem for oriented graphs and digraphs:
 Given an oriented graph (digraph) $G$, does it contain an induced
 subdivision of a prescribed digraph $D$? The complexity of
 this problem depends on $D$ and on whether $H$ must be an oriented
 graph or is allowed to contain 2-cycles. We give a number of examples of polynomial instances as well as several NP-completeness proofs.
 },

 sorte = "conf-int",

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays={DK},

 
}

@inproceedings{BBD+11b,

 hal_id = {hal-00643987},

 url = {http://hal.inria.fr/hal-00643987/en/},

 title = {{Mixed-Criticality Scheduling of Sporadic Task Systems}},

 author = {Baruah, S. K. and Bonifaci, V. and D'Angelo, G. and Marchetti-Spaccamela, A. and Van Der Ster, S. and Stougie, L.},

 abstract = {{We consider the scheduling of mixed-criticality task systems, that is, systems where each task to be scheduled has multiple levels of worst-case execution time estimates. We design a scheduling algorithm, EDF-VD, whose effectiveness we analyze using the processor speedup metric: we show that any 2-level task system that is schedulable on a unit-speed processor is correctly scheduled by EDF-VD using speed $\phi$; here $\phi$ 2 criticality levels.We finally consider 2-level instances on m identical machines. We prove speedup bounds for scheduling an independent collection of jobs and for the partitioned scheduling of a 2-level task system.}},

 language = {English},

 booktitle = {{19th Annual European Symposium on Algorithms (ESA 2011)}},

 publisher = {Springer},

 pages = {555-566},

 address = {Saarbruecken, Germany},

 volume = {6942},

 editor = {Camil Demetrescu and Magn{\'u}s M. Halld{\'o}rsson },

 series = {Lecture Notes in Computer Science },

 doi = {10.1007/978-3-642-23719-5\_47 },

 year = {2011},

 month = Aug,

 pdf = {http://hal.inria.fr/hal-00643987/PDF/MixedTasks.pdf},

 x-pays = {US,IT,NL,IN},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 sorte = "conf-int",

 
}

@inproceedings{BBB+11,

 author = {J. Beauquier and P. Blanchard and J. Burman and S. Delaet},

 title = {Computing Time Complexity of Population Protocols with Cover Times - the ZebraNet Example},

 booktitle = {13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2011},

 publisher = {Springer},

 year = {2011},

 series = {Lecture Notes in Computer Science},

 abstract = {Population protocols are a communication model for large
 sensor networks with resource-limited mobile agents. The agents move
 asynchronously and communicate via pair-wise interactions. The original
 fairness assumption of this model involves a high level of asynchrony
 and prevents an evaluation of the convergence time of a protocol (via
 deterministic means). The introduction of some "partial synchrony" in
 the model, under the form of cover times, is an extension that allows
 evaluating the time complexities.
 In this paper, we take advantage of this extension and study a data
 collection protocol used in the ZebraNet project for the wild-life tracking
 of zebras in a reserve in central Kenya. In ZebraNet, sensors are attached
 to zebras and the sensed data is collected regularly by a mobile base
 station crossing the area. The data collection protocol of ZebraNet has
 been analyzed through simulations, but to our knowledge, this is the rst
 time, that a purely analytical study is presented. Our first result is that,
 in the original protocol, some data may never be delivered to the base
 station. We then propose two slightly modify ed and correct protocols and
 we compute their worst case time complexities. Still, in both cases, the
 result is far from the optimal.},

 pages = {47-61},

 doi = {http://dx.doi.org/10.1007/978-3-642-24550-3_6},

 url = {http://hal.inria.fr/hal-00639583/en/},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 sorte = "conf-int",

 
}

@inproceedings{BBM11,

 author = {Beauquier, J. and Burman, J. and Malykh, V.},

 title = {ZebraNet Analys\'e dans le Mod\'ele des Protocoles de Population},

 booktitle = {13es Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel)},

 year = {2011},

 editor = {Ducourthial et Bertrand et Felber et Pascal},

 address = {Cap Est\'erel, France},

 abstract = {Nous \'etudions le protocole de collecte de donn\'ees du projet ZebraNet, dans le modčle des protocoles de population. Dans ce
 projet des capteurs sont attach\'es \'a une population de z\'ebres, en Afrique Centrale, et fournissent des donn\'ees aux biologistes
 qui \'etudient leurs structures migratoires et comportementales. Nous montrons qu'un protocole voisin de celui utilis\'e dans ce
 projet ne se termine pas. Cela entra\^ine que le protocole originel ne se termine pas non plus. Aussi proposons nous une
 modification qui fournit la terminaison. Nous prouvons la correction de ce protocole modifi\'e et nous analysons sa complexit\'e
 en temps au pire, dans le mod\'ele des protocoles de population avec temps de couverture. La comparaison de cette complexit\'e
 avec celle du protocole optimal est tr\'es d\'efavorable.
 Le protocole de collecte de donn\'ees de ZebraNet a fait l'objet de simulations, mais c'est la premi\'ere fois, \'a notre connaissance,
 qu'est r\'ealis\'ee une \'etude purement analytique.},

 url = {http://hal.inria.fr/inria-00586503/fr/},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={no},

 x-pays = {RU},

 sorte = "conf-nat"
 
}

@inproceedings{BeBu11,

 author = {J. Beauquier and J. Burman},

 title = {Self-stabilizing Mutual Exclusion and Group Mutual Exclusion for Population Protocols with Covering},

 booktitle = {15th International Conference On Principles Of Distributed Systems, OPODIS 2011},

 publisher = {Springer},

 year = {2011},

 series = {Lecture Notes in Computer Science},

 abstract = {This paper presents and proves correct two self-stabilizing deterministic
 algorithms solving the mutual exclusion and the group mutual exclusion problems
 in the model of population protocols with covering. In this variant of the
 population protocol model, a local fairness is used and bounded state anonymous
 mobile agents interact in pairs according to constraints expressed in terms of their
 cover times. The cover time is an indicator of the "time" for an agent to communicate
 with all the other agents. This indicator is expressed in the number of the
 pairwise communications (events) and is unknown to agents. In the model, we
 also assume the existence of a particular agent, the base station. In contrast with
 the other agents, it has a memory size proportional to the number of the agents.
 We prove that without this kind of assumption, the mutual exclusion problem has
 no solution.
 The algorithms in the paper use a phase clock tool. This is a synchronization
 tool that was recently proposed in the model we use. For our needs, we extend
 the functionality of this tool to support also phases with unbounded (but finite)
 duration. This extension seems to be useful also in the future works.},

 url = {http://hal.inria.fr/hal-00639651/en/},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 sorte = "conf-int",

 
}

@inproceedings{BMN+11b,

 author = {Becker, F. and Matamala, M. and Nisse, N. and Rapaport, I. and Suchan, K. and Todinca, I.},

 title = {{Reconstruire un graphe en une ronde}},

 booktitle = {13es Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel)},

 year = {2011},

 editor = {Ducourthial and Bertrand et Felber and Pascal},

 address = {Cap Est\'erel, France},

 url = {http://hal.inria.fr/inria-00587250/en},

 abstract = {Nous étudions quelles propriétés d'un réseau peuvent être calculées � partir d'une petite quantité d'informations locales fournie par ses noeuds. Notre modèle est une restriction de CONGEST, un modèle distribué classique. Il est proche du modèle de complexité de communication avec messages simultanés de Babai et al. Chacun des n noeuds --qui ne connaissent que leur identifiant, ceux de leurs voisins et la taille du graphe-- envoie un message de taille O(log(n)) bits � une entité centrale, le superviseur. Celui-ci doit alors déterminer une certaine propriété du réseau. Nous montrons que des questions telles que: ''Est-ce que le graphe contient un triangle? un carré ? Quel est son diamètre?" ne peuvent pas être résolues dans ce modèle. En revanche, pour de nombreuses classes de graphes : celles de dégénérescence bornée (incluant les graphes planaires, ceux de largeur arborescente bornée... ), les sommets peuvent succinctement donner une description complète du graphe au superviseur. Nous laissons 
 ouverte la question de décider la connexité.},
 x-editorial-board={yes},
 x-proceedings={yes},
 x-international-audience={no},
 x-pays= {CL},
 sorte = "conf-nat",
 
}

@inproceedings{BMN+11,

 author = {Becker, F. and Matamala, M. and Nisse, N. and Rapaport, I. and Suchan, K. and Todinca, I.},

 title = {Adding a referee to an interconnection network: What can(not) be computed in one round},

 booktitle = {25th IEEE International Parallel \& Distributed Processing Symposium (IPDPS)},

 pages = {508-514},

 year = {2011},

 publisher = {IEEE},

 url = {http://arxiv.org/abs/1009.4447},

 pdf = {http://arxiv.org/pdf/1009.4447v2},

 abstract = {In this paper we ask which properties of a distributed network can be computed from a little amount of local information provided by its nodes. The distributed model we consider is a restriction of the classical CONGEST (distributed) model and it is close to the simultaneous messages (communication complexity) model defined by Babai, Kimmel and Lokam. More precisely, each of these n nodes -which only knows its own ID and the IDs of its neighbors- is allowed to send a message of O(log n) bits to some central entity, called the referee. Is it possible for the referee to decide some basic structural properties of the network topology G? We show that simple questions like, "does G contain a square?", "does G contain a triangle?" or "Is the diameter of G at most 3? cannot be solved in general. On the other hand, the referee can decode the messages in order to have full knowledge of G when G belongs to many graph classes such as planar graphs, bounded treewidth graphs and, more generally, bounded 
 degeneracy graphs. We leave open questions related to the connectivity of arbitrary graphs. },
 x-editorial-board={yes},
 x-proceedings={yes},
 x-international-audience={yes},
 x-pays = {CL},
 sorte = "conf-int",
 
}

@inproceedings{BCM+11,

 author = {Belhareth, S. and Coudert, D. and Mazauric, D. and Nisse, N. and Tahiri, I.},

 title = {{Reconfiguration avec contraintes physiques dans les r\'eseaux WDM}},

 booktitle = {13es Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel)},

 year = {2011},

 editor = {Ducourthial et Bertrand et Felber et Pascal},

 address = {Cap Est\'erel, France},

 pdf = {http://hal.inria.fr/docs/00/58/77/09/PDF/reconf-20110406.pdf},

 url = {http://hal.inria.fr/inria-00583829/en},

 abstract = {Dans un réseau WDM, utiliser une nouvelle longueur d'onde dans une fibre demande � recalibrer les autres longueurs d'ondes. Cela génère un coût (e.g., énergétique) qui dépend non linéairement du nombre de longueurs d'ondes utilisant la fibre. Lorsqu'un ensemble de requêtes doivent changer de chemins optiques dans le réseau (lors d'une opération de maintenance sur un lien du réseau), l'ordre dans lequel les requêtes sont déplacées influe sur le coût total de l'opération. Nous initions l'étude du problème d'optimisation correspondant. Nous prouvons que déterminer l'ordre de déplacements optimal est NP-complet pour un réseau de 2 nœuds. Nous donnons des bornes générales et identifions des classes d'instances faciles. Enfin, nous proposons et évaluons par simulations des heuristiques pour ce problème.},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={no},

 x-pays = {TN},

 sorte = "conf-nat",

 
}

@inproceedings{BGP+11,

 author= {J-C. Bermond and L. Gargano and S. P\'erennes and A.A. Rescigno and U. Vaccaro},

 title= {Optimal Time Data Gathering in Wireless Networks
 with Omni-Directional Antennas },

 booktitle= { SIROCCO 2011 },

 publisher= { Springer-Verlag },

 series= {Lecture Notes in Computer Science},

 address= {Gdansk, Poland },

 month=jun,

 volume = {6796},

 pages = {306-317},

 year= {2011},

 PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BGPRV11.pdf},

 abstract={We study algorithmic and complexity issues originating from
 the problem of data gathering 
 in wireless networks.
 We give an algorithm to construct 
 minimum makespan transmission schedules
 for data gathering
 when the communication graph
 $G$ is a tree network, the interference range is \emph{any}
 integer $m\geq 2$, and no buffering is allowed at intermediate nodes.
 In the interesting case in which all nodes in the network have to deliver
 an arbitrary non-zero number of packets,
 we provide a closed formula for the
 makespan of the optimal gathering schedule.
 Additionally, we consider the problem of determining the
 computational complexity of data gathering in general graphs
 and show that the problem is weakly NP-complete. On the positive side,
 we design
 a simple $(1+2/m)$ factor approximation algorithm for general networks.},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 sorte = "conf-int",

 x-pays = {IT},

 
}

@inproceedings{CaKo11,

 author = {C. Caillouet and A. Koster},

 title = {{Routage et Ordonnancement Robustes dans les R{\'e}seaux Radio Maill{\'e}s}},

 booktitle = {{13es Rencontres Francophones sur les Aspects Algorithmiques de T{\'e}l{\'e}communications (AlgoTel)}},

 year = {2011},

 editor = {Ducourthial and Bertrand et Felber and Pascal},

 address = {Cap Est{\'e}rel, France},

 url = {http://hal.inria.fr/inria-00586698/en},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={no},

 sorte = "conf-nat",

 
}

@inproceedings{CLR11,

 author = {C. Caillouet and X. Li and T. Razafindralambo},

 title = {{A Multi-objective Approach for Data Collection in Wireless Sensor Networks}},

 booktitle = {{10th International Conference on Ad Hoc Networks and Wireless (AdHocNow)}},

 year = {2011},

 month = Jul,

 address = {Padderborn, Germany},

 url = {http://hal.inria.fr/inria-00601679/en},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 sorte = "conf-int",

 
}

@inproceedings{CaRa11,

 author = {C. Caillouet and T. Razafindralambo},

 title = {{Compromis {\'e}nergie-d{\'e}lai pour la collecte de donn{\'e}es dans les r{\'e}seaux de capteurs}},

 booktitle = {{13es Rencontres Francophones sur les Aspects Algorithmiques de T{\'e}l{\'e}communications (AlgoTel)}},

 year = {2011},

 editor = {Ducourthial and Bertrand et Felber and Pascal},

 address = {Cap Est{\'e}rel, France},

 url = {http://hal.inria.fr/inria-00586681/en},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={no},

 sorte = "conf-nat",

 
}

@InProceedings{CLM+11,

 author = {Campos, V. and Linhares Sales, C. and Maia, A. K. and Martins, N. and Sampaio, R.},

 title = {Restricted coloring problems on graphs with few $P_4$'s},

 OPTcrossref = {},

 OPTkey = {},

 booktitle = {VI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'11)},

 pages = {57-62},

 year = {2011},

 OPTeditor = {},

 volume = {37},

 OPTnumber = {},

 series = {Electronic Notes in Discrete Mathematics},

 OPTaddress = {},

 OPTmonth = {},

 OPTorganization = {},

 OPTpublisher = {},

 abstract = {In this paper, we obtain polynomial time algorithms to determine the acyclic chromatic number, the star chromatic number and the harmonious 
 chromatic number of $P_4$ -tidy graphs and $(q , q − 4)$-graphs, for every fixed q. These classes include cographs, $P_4$ -sparse and $P_4$ -lite graphs. We also 
 obtain a polynomial time algorithm to determine the Grundy number of $(q , q − 4)$-graphs. All these coloring problems are known to be NP-hard for general 
 graphs.},

 pdf = {http://hal.inria.fr/docs/00/64/31/80/PDF/col-fewP4.pdf},

 doi = "10.1016/j.endm.2011.05.011",

 url = "http://www.sciencedirect.com/science/article/pii/S1571065311000126",

 x-editorial-board = {yes},

 x-proceedings = {yes},

 x-international-audience = {yes},

 x-pays = {BR},

 sorte = "conf-int",

 
}

@InProceedings{CCKN11,

 author = {G. Cla{\ss}en and D. Coudert and A. Koster and N. Nepomuceno},

 title = {Bandwidth assignment for reliable fixed broadband wireless networks},

 booktitle = {12th {IEEE} International Symposium on a World of Wireless Mobile and Multimedia Networks ({WoWMoM})},

 pages = {1-6},

 year = {2011},

 address = {Lucca, Italy},

 month = jun,

 publisher = {IEEE},

 abstract = {In this paper, we investigate on conceiving reliable fixed broadband wireless networks under outage probability constraints. We introduce a joint optimization of data routing and bandwidth assignment that minimizes the total renewal fees of licenses, while handling all the traffic requirements simultaneously. This problem differs from classical capacity planning in the sense that the capacity of microwave radio links are prone to variations due to external factors (e.g., weather). Therefore, we must consider probabilistic constraints to deal with random parameters (viz., modulation schemes) and guarantee a desirable reliability level of the solution. We propose a (joint) chance-constrained programming approach to tackle this problem. This approach remains one of the main challenges of modern stochastic programming and it is still considered as very difficult and widely intractable. We then derive integer linear programming (ILP) counterparts for these chance-constrained programs and propose 
 cutset-based valid inequalities to enhance the performance of ILP solvers. Preliminary computational results illustrate the price of reliability and present a comparative study on the performance of the different formulations.},

 pdf = {http://hal.inria.fr/docs/00/58/76/98/PDF/bare_conf-noformat.pdf},

 DOI = {10.1109/WoWMoM.2011.5986471},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays={DE,DK},

 sorte = "conf-int",

 
}

@InProceedings{CCKN11b,

 author = {G. Cla{\ss}en and D. Coudert and A. Koster and N. Nepomuceno},

 title = {A Chance-Constrained Model \& Cutting Planes for Fixed Broadband Wireless Networks},

 booktitle = {International Network Optimization Conference (INOC)},

 pages = {37-42},

 year = {2011},

 volume = {6701},

 series = {Lecture Notes in Computer Science},

 address = {Hamburg, Germany},

 month = jun,

 abstract = {In this paper, we propose a chance-constrained mathematical program for fixed broadband wireless networks under unreliable channel conditions. The model is reformulated as integer linear program and valid inequalities are derived for the corresponding polytope. Computational results show that by an exact separation approach the optimality gap is closed by~$42$\,\% on average.},

 pdf = {http://hal.inria.fr/docs/00/58/76/69/PDF/ClCoKoNe-noformat.pdf},

 DOI = {10.1007/978-3-642-21527-8\_5},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays={DE,DK},

 sorte = "conf-int",

 
}

@InProceedings{CNT11b,

 author = {Coudert, D. and Nepomuceno, N. and Tahiri, I.},

 title = {Energy saving in fixed wireless broadband networks},

 booktitle = {International Network Optimization Conference (INOC)},

 pages = {484-489},

 year = {2011},

 volume = {6701},

 series = {Lecture Notes in Computer Science},

 address = {Hamburg, Germany},

 month = jun,

 abstract = {In this paper, we present a mathematical formulation for saving energy in fixed broadband wireless networks by selectively turning off idle communication devices in low-demand scenarios. This problem relies on a fixed-charge capacitated network design (FCCND), which is very hard to optimize. We then propose heuristic algorithms to produce feasible solutions in a short time.},

 pdf = {http://hal.inria.fr/docs/00/58/76/85/PDF/CNT11-noformat.pdf},

 DOI = {10.1007/978-3-642-21527-8\_53},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays={DK},

 sorte = "conf-int",

 
 
}

@inproceedings{CNT11,

 HAL_ID = {inria-00588129},

 url = {http://hal.inria.fr/inria-00588129/en/},

 title = { {O}ptimisation de la consommation {\'e}nerg{\'e}tique dans les r{\'e}seaux sans fil fixes},

 author = {Coudert, D. and Nepomuceno, N. and Tahiri, I.},

 abstract = {{N}ous {\'e}tudions le probl{\`e}me d'optimisation {\'e}nerg{\'e}tique dans les r{\'e}seaux sans fil fixes dans le cas d'une faible demande de trafic par rapport {\`a} la capacit{\'e} du r{\'e}seau. {N}ous proposons un programme lin{\'e}aire pour r{\'e}soudre le probl{\`e}me, puis nous pr{\'e}sentons une heuristique permettant de trouver rapidement une bonne solution.},

 language = {{F}ran{\c{c}}ais},

 affiliation = {{MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 },

 booktitle = {13es {R}encontres {F}rancophones sur les {A}spects {A}lgorithmiques de {T}{\'e}l{\'e}communications ({A}lgo{T}el) },

 address = {{C}ap {E}st{\'e}rel {F}rance },

 editor = {{D}ucourthial, {B}ertrand et {F}elber, {P}ascal },

 audience = {internationale },

 year = {2011},

 pdf = {http://hal.inria.fr/inria-00588129/PDF/document.pdf},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={no},

 sorte = "conf-nat",

 
 
}

@inproceedings{DDF+11,

 hal_id = {hal-00644049},

 url = {http://hal.inria.fr/hal-00644049/en/},

 title = {{A Speed-Up Technique for Distributed Shortest Paths Computation}},

 author = {G. D'Angelo and D'Emidio, Mattia and Frigioni, Daniele and Maurizio, Vinicio},

 abstract = {{We propose a simple and practical speed-up technique, which can be combined with every distance vector routing algorithm based on shortest paths, allowing to reduce the total number of messages sent by that algorithm. We combine the new technique with two algorithms known in the literature: DUAL, which is part of CISCO's widely used EIGRP protocol, and the recent DUST, which has been shown to be very effective on networks with power law node degree distribution. We give experimental evidence that these combinations lead to an important gain in terms of the number of messages sent by DUAL and DUST at the price of a little increase in terms of space occupancy per node.}},

 language = {English},

 booktitle = {{11th International Conference on Computational Science and Its Applications (ICCSA 2011)}},

 publisher = {Springer},

 pages = {578-593},

 address = {Santander, Spain},

 volume = {6783},

 editor = {Beniamino Murgante and Osvaldo Gervasi and Andr{\'e}s Iglesias and David Taniar and Bernady O. Apduhan },

 series = {Lecture Notes in Computer Science },

 audience = {international },

 doi = {10.1007/978-3-642-21887-3\_44 },

 year = {2011},

 month = Jun,

 pdf = {http://hal.inria.fr/hal-00644049/PDF/dlp.pdf},

 x-pays = {IT},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 sorte = "conf-int",

 
}

@inproceedings{DDN11f,

 hal_id = {hal-00644084},

 url = {http://hal.inria.fr/hal-00644084/en/},

 title = {{Min-Max Coverage in Multi-interface Networks}},

 author = {G. D'Angelo and Di Stefano, Gabriele and Navarra, Alfredo},

 abstract = {{We consider devices equipped with multiple wired or wireless interfaces. By switching among interfaces or by combining the available interfaces, each device might establish several connections. A connection is established when the devices at its endpoints share at least one active interface. Each interface is assumed to require an activation cost. In this paper, we consider the problem of establishing the connections defined by a network G = (V,E) while keeping as low as possible the maximum cost set of active interfaces at the single nodes. Nodes V represent the devices, edges E represent the connections that must be established. We study the problem of minimizing the maximum cost set of active interfaces among the nodes of the network in order to cover all the edges. We prove that the problem is NP-hard for any fixed $\Delta$ $\ge$ 5 and k $\ge$ 16, with $\Delta$ being the maximum degree, and k being the number of different interfaces among the network. We also show that the problem cannot be 
 approximated within $\Omega$(ln $\Delta$). We then provide a general approximation algorithm which guarantees a factor of O((1 + b)ln ($\Delta$)), with b being a parameter depending on the topology of the input graph. Interestingly, b can be bounded by a constant for many graph classes. Other approximation and exact algorithms for special cases are presented.}},

 language = {English},

 booktitle = {{37th Conference on Current Trends in Theory and Practice of Computer Science}},

 publisher = {Springer},

 pages = {190-201},

 address = {Nov{\'y} Smokovec, Slovakia},

 volume = {6543},

 editor = {Ivana Cern{\'a} and Tibor Gyim{\'o}thy and Juraj Hromkovic and Keith Jefferey and Rastislav Kr{\'a}lovic and Marko Vukolic and Stefan Wolf },

 series = {Lecture Notes in Computer Science },

 audience = {international },

 doi = {10.1007/978-3-642-18381-2\_16 },

 year = {2011},

 month = Jan,

 pdf = {http://hal.inria.fr/hal-00644084/PDF/MultiInterfacesCoverage.pdf},

 x-pays = {IT},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 sorte = "conf-int",

 
}

@inproceedings{DDN11e,

 hal_id = {hal-00644104},

 url = {http://hal.inria.fr/hal-00644104/en/},

 title = {{Bandwidth Constrained Multi-interface Networks}},

 author = {G. D'Angelo and Di Stefano, Gabriele and Navarra, Alfredo},

 abstract = {{In heterogeneous networks, devices can communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available interfaces, each device might establish several connections. A connection is established when the devices at its endpoints share at least one active interface. Each interface is assumed to require an activation cost, and provides a communication bandwidth. In this paper, we consider the problem of activating the cheapest set of interfaces among a network G = (V,E) in order to guarantee a minimum bandwidth B of communication between two specified nodes. Nodes V represent the devices, edges E represent the connections that can be established. In practical cases, a bounded number k of different interfaces among all the devices can be considered. Despite this assumption, the problem turns out to be NP-hard even for small values of k and $\Delta$, where $\Delta$ is the maximum degree of the network. In particular, the problem is NP-hard for 
 any fixed k $\ge$ 2 and $\Delta$ $\ge$ 3, while it is polynomially solvable when k = 1, or $\Delta$ $\le$ 2 and k = O(1). Moreover, we show that the problem is not approximable within $\eta$logB or $\Omega$(loglog|V|) for any fixed k $\ge$ 3, $\Delta$ $\ge$ 3, and for a certain constant $\eta$, unless P=NP. We then provide an approximation algorithm with ratio guarantee of b max , where b max is the maximum communication bandwidth allowed among all the available interfaces. Finally, we focus on particular cases by providing complexity results and polynomial algorithms for $\Delta$ $\le$ 2.}},

 language = {English},

 booktitle = {{37th Conference on Current Trends in Theory and Practice of Computer Science}},

 publisher = {Springer},

 pages = {202-213},

 address = {Nov{\'y} Smokovec, Slovakia},

 volume = {6543},

 editor = {Ivana Cern{\'a} and Tibor Gyim{\'o}thy and Juraj Hromkovic and Keith Jefferey and Rastislav Kr{\'a}lovic and Marko Vukolic and Stefan Wolf },

 series = {Lecture Notes in Computer Science },

 doi = {10.1007/978-3-642-18381-2\_17 },

 year = {2011},

 month = Jan,

 pdf = {http://hal.inria.fr/hal-00644104/PDF/MultiInterfacesFlowTheor.pdf},

 x-pays = {IT},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 sorte = "conf-int",

 
}

@inproceedings{DDN11b,

 hal_id = {hal-00644039},

 url = {http://hal.inria.fr/hal-00644039/en/},

 title = {{Gathering of Six Robots on Anonymous Symmetric Rings}},

 author = {G. D'Angelo and Di Stefano, Gabriele and Navarra, Alfredo},

 abstract = {{The paper deals with a recent model of robot-based computing which makes use of identical, memoryless mobile robots placed on nodes of anonymous graphs. The robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), takes a decision whether to stay idle or to move to one of its adjacent nodes (Compute), and in the latter case makes an instantaneous move to this neighbor (Move). Cycles are performed asynchronously for each robot. In particular, we consider the case of only six robots placed on the nodes of an anonymous ring in such a way they constitute a symmetric placement with respect to one single axis of symmetry, and we ask whether there exists a strategy that allows the robots to gather at one single node. This is in fact the first case left open after a series of papers [1,2,3,4] dealing with the gathering of oblivious robots on anonymous rings. As long as the gathering is feasible, we provide a new distributed approach that 
 guarantees a positive answer to the posed question. Despite the very special case considered, the provided strategy turns out to be very interesting as it neither completely falls into symmetry-breaking nor into symmetry-preserving techniques.}},

 language = {English},

 booktitle = {{Structural Information and Communication Complexity}},

 publisher = {Springer},

 pages = {174-185},

 address = {Gdansk, Poland},

 volume = {6796},

 editor = {Adrian Kosowski and Masafumi Yamashita },

 series = {Lecture Notes in Computer Science },

 doi = {10.1007/978-3-642-22212-2\_16 },

 year = {2011},

 month = Jul,

 pdf = {http://hal.inria.fr/hal-00644039/PDF/GatheringSixRobots.pdf},

 x-pays = {IT},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 sorte = "conf-int",

 
}

@inproceedings{DDN11d,

 hal_id = {hal-00644073},

 url = {http://hal.inria.fr/hal-00644073/en/},

 title = {{Maximum Flow and Minimum-Cost Flow in Multi-Interface Networks}},

 author = {G. D'Angelo and Di Stefano, Gabriele and Navarra, Alfredo},

 abstract = {{In heterogeneous networks, devices can communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available interfaces, each device might establish several connections. A connection is established when the devices at its endpoints share at least one active interface. Each interface is assumed to require an activation cost, and provides a communication bandwidth. In this paper, we consider two fundamental optimization problems. In the first one, we aim to activate a set of interfaces in the network G = (V, E) in order to guarantee the maximal bandwidth between two given nodes. Nodes V represent the devices, edges E represent the connections that can be established according to the availability of the interfaces in the devices. In the second problem, we look for activating the cheapest set of interfaces among a network in order to guarantee a minimum bandwidth B of communication between two specified nodes. We show that the first problem is 
 polynomially solvable while the second one is NP-Hard. However, we experimentally analyzed an algorithm for the second problem, showing that in practical cases it guarantees a low approximation ratio which allows us to use it in real-world networks.}},

 language = {English},

 booktitle = {{5th International Conference on Ubiquitous Information Management and Communication}},

 publisher = {ACM},

 pages = {19},

 address = {Seoul, Korea, Republic Of},

 doi = {10.1145/1968613.1968637 },

 year = {2011},

 month = Feb,

 pdf = {http://hal.inria.fr/hal-00644073/PDF/MultiInterfacesFlowExp.pdf},

 x-pays = {IT},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 sorte = "conf-int",

 
}

@inproceedings{DDV11c,

 hal_id = {hal-00644054},

 url = {http://hal.inria.fr/hal-00644054/en/},

 title = {{Dynamic Arc-Flags in Road Networks}},

 author = {G. D'Angelo and Frigioni, Daniele and Vitale, Camillo},

 abstract = {{In this work we introduce a new data structure, named Road-Signs, which allows us to efficiently update the Arc-Flags of a graph in a dynamic scenario. Road-Signs can be used to compute Arc-Flags, can be efficiently updated and do not require large space consumption for many real-world graphs like, e.g., graphs arising from road networks. In detail, we define an algorithm to preprocess Road-Signs and an algorithm to update them each time that a weight increase operation occurs on an edge of the network. We also experimentally analyze the proposed algorithms in real-world road networks showing that they yields a significant speed-up in the updating phase of Arc-Flags, at the cost of a very small space and time overhead in the preprocessing phase.}},

 language = {English},

 booktitle = {{10th International Symposium, SEA 2011}},

 publisher = {Springer},

 pages = {88-99},

 address = {Kolimpari, Chania, Crete, Greece},

 volume = {6630},

 editor = {Panos M. Pardalos and Steffen Rebennack },

 series = {Lecture Notes in Computer Science },

 doi = {10.1007/978-3-642-20662-7\_8 },

 year = {2011},

 month = Apr,

 pdf = {http://hal.inria.fr/hal-00644054/PDF/RoadSigns.pdf},

 x-pays = {IT},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 sorte = "conf-int",

 
}

@inproceedings{DaMa11,

 hal_id = {inria-00638561},

 url = {http://hal.inria.fr/inria-00638561},

 title = {{Traces Generation To Simulate Large-Scale Distributed Applications}},

 author = {Dalle, O. and Mancini, E.},

 abstract = {{In order to study the performance of scheduling algorithms, simulators of parallel and distributed applications need accurate models of the application's behavior during execution. 
 For this purpose, traces of low-level events collected during the actual execution of real applications are needed. 
 Collecting such traces is a difficult task due to the timing, to the interference of instrumentation code, and to the storage and transfer of the collected data. 
 To address this problem we propose a comprehensive software architecture, which instruments the application's executables, gather hierarchically the traces, and post-process them in order to feed simulation models. 
 We designed it to be scalable, modular and extensible.}},

 booktitle = {{Winter Simulation Conference}},

 pages = {10p.},

 address = {Phoenix, AZ, {\'E}tats-Unis},

 editor = {Jain, S. and Creasey, R. R. and Himmelspach, J. and White, K. P. and Fu, M. },

 year = {2011},

 month = Dec,

 pdf = {http://hal.inria.fr/inria-00638561/PDF/MaDa11.pdf},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 sorte = "conf-int",

 
}

@InProceedings{DaRi11,

 author = {O. Dalle and J. Ribault},

 title = {Some Desired Features for the DEVS Architecture Description Language},

 booktitle = {Proceedings of the Symposium On Theory of Modeling and Simulation -- DEVS Integrative M\&S Symposium (TMS/DEVS 2011)},

 year = {2011},

 pages = {258-263},

 address = {Boston, MA, {\'E}tats-Unis},

 volume = {Book 4 -- Symposium on Theory of Modeling \& Simulation - DEVS Integrative M\&S Symposium (TMS/DEVS)},

 month = {04},

 url = {http://hal.inria.fr/inria-00638565/en/},

 pdf = {http://hal.inria.fr/inria-00638565/PDF/document.pdf},

 abstract = {ADL are particularly well suited for component-based model
 frameworks that support hierarchical composition, such as DEVS with coupled
 models. In this paper we present some features found in the ADL of another
 hierarchical component model, namely the Fractal Component Model (FCM).
 To our best knowledge, these features are not yet available in most of the
 current DEVS implementations. Using a few examples coming from our experience,
 we demonstrate the usefulness of these features for Modeling & Simulation and
 their potential relevance for inclusion in a future DEVS implementation
 standard.},

 x-editorial-board={yes},

 x-proceedings={no},

 x-international-audience={yes},

 sorte = "conf-int",

 
}

@inproceedings{Fe11,

 address = {Saint Petersburg, Russia},

 author = {S. Felix and J. Galtier},

 booktitle = {Proceedings of the 11th International Conference on ITS Telecommunications},

 pages = {56--62},

 month = {August},

 title = {Shortest Paths and Probabilities on Time-Dependent Graphs - Applications to Transport Networks},

 year = 2011,

 isbn = {978-1-60558-945-9},

 url={http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=06060121},

 abstract = {In this paper, we focus on time-dependent graphs
 which seem to be a good way to model transport networks. In
 the first part, we remind some notations and techniques related
 to time-dependent graphs. In the second one, we introduce new
 algorithms to take into account the notion of probability related
 to paths in order to guarantee travelling times with a certain
 accuracy. We also discuss different probabilistic models and show
 the links between them.},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 sorte = "conf-int",

 
}

@inproceedings{GMM11,

 author = {Giroire, F. and Mazauric, D. and Moulierac, J.},

 title = {{Routage efficace en \'energie}},

 booktitle = {13es Rencontres Francophones sur les Aspects
 Algorithmiques de T\'el\'ecommunications (AlgoTel)},

 year = {2011},

 editor = {Ducourthial et Bertrand et Felber et Pascal},

 address = {Cap Est\'erel, France},

 url = {http://hal.inria.fr/inria-00587944/fr},

 abstract = {De récentes études montrent que la charge de trafic des
 routeurs n'a qu'une faible influence sur leur consommation
 énergétique. Par conséquent, la consommation dans les réseaux est
 fortement liée au nombre d'équipements du réseau activés (interfaces,
 chassis, etc). Dans un objectif de minimisation de l'énergie dans les
 réseaux, il est intéressant de minimiser le nombre (pondéré)
 d'équipements utilisés lors du routage. Dans cet article, nous
 considérons une architecture simplifiée où un lien entre deux routeurs
 relie deux interfaces. Quand un lien n'est pas activé, les deux
 interfaces correspondantes peuvent être éteintes. Par conséquent, afin
 de réduire la consommation d'énergie, l'objectif est de trouver un
 routage qui minimise le nombre de liens utilisés et satisfait toutes
 les demandes. Nous montrons des résultats d'inapproximabilité de ce
 problème, même si l'on considère des instances particulières. Nous
 prouvons des bornes en général et pour des topologies particulières
 telles que la grille, l'arbre ou le graphe complet. Nous proposons
 ensuite une heuristique dont nous évaluons les performances � l'aide
 de simulations sur des topologies réelles. Nous étudions ensuite
 l'impact de ces solutions efficaces en énergie sur la tolérance aux
 pannes et sur la longueur moyenne des routes.},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={no},

 x-pays = {MA},

 sorte = "conf-nat",

 
 
}

@InProceedings{LiSi+11,

 author = {Y. Liu and G. Simon},

 title = {Peer-Assisted Time-shifted Streaming Systems: Design and Promises},

 booktitle = {IEEE International Conference on Communications (ICC'2011)},

 year = {2011},

 address = {Kyoto, Japan},

 month = {06},

 publisher = {IEEE},

 abstract = { Time-shifted streaming (or catch-up TV) allows viewers to watch their TV programs within an expanded time window. In this paper, we emphasize the challenging characteristics of time-shifted TV systems that prevent known delivery systems to be used. We model time-shifted TV as multiple-interval graph, then we present a Peer-Assisted Catch-Up Streaming system, namely PACUS, where a set of end users' computers assists the server for the content delivery. We show in particular how the PACUS tracker server can be efficiently implemented for catch-up TV. We demonstrate the benefits of PACUS by simulations. We especially highlight that PACUS reduces the traffic at the server side with the advantages of lightweight and self-adaptive unstructured peer-to-peer systems.},

 pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/LS+11.pdf},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays={},

 sorte = "conf-int",

 
}

@inproceedings{MaMo11b,

 title = {{ Algorithmes linéaires pour les graphes sans $P_5$ 3-colorables}},

 author={Maffray, F. and Morel, G.},

 booktitle={12e congr\`es annuel de la ROADEF},

 year={2011},

 x-editorial-board = {no},

 x-proceedings = {yes},

 x-international-audience = {no},

 sorte = "conf-nat",

 
}

@techreport{AHT11,

 hal_id= {inria-00602079},

 url = {http://hal.inria.fr/inria-00602079/en/},

 title = {{On wheel-free graphs}},

 author = {P. Aboulker and F. Havet and N. Trotignon},

 abstract = {{A wheel is a graph formed by a chordless cycle and a vertex that has at least three neighbors in the cycle. We prove that every 3-connected graph that does not contain a wheel as a subgraph is in fact minimally 3-connected. We prove that every graph that does not contain a wheel as a subgraph is 3-colorable.}},

 language = {Anglais},

 affiliation = {Laboratoire d'informatique Algorithmique : Fondements et Applications - LIAFA - CNRS : UMR7089 - Universit\'e Paris Diderot - Paris 7 - MASCOTTE - INRIA Sophia Antipolis / Laboratoire I3S - INRIA - Universit\'e de Nice Sophia-Antipolis - CNRS : UMR6070},

 type = {Research Report},

 institution = {INRIA},

 number = {RR-7651},

 year = {2011},

 month = Jun,

 pdf = {http://hal.inria.fr/inria-00602079/PDF/RR-7651.pdf},

 x-editorial-board={no},

 x-proceedings={yes},

 x-international-audience={yes},

 
}

@TechReport{AHL+11,

 author = {Addario-Berry, L. and Havet, F. and Linhares Sales, C. and Reed, B. and Thomass\'e, S.},

 title = {Oriented trees in digraphs},

 year = {2011},

 month = {01},

 institution = {INRIA},

 number = {7502},

 type = {Research Report},

 URL = {http://hal.inria.fr/inria-00551133/fr/},

 PDF = {http://hal.inria.fr/docs/00/55/11/33/PDF/RR-7502.pdf},

 abstract = {Let $f(k)$ be the smallest integer such that every $f(k)$-chromatic digraph contains every oriented tree of order $k$.
 Burr proved that $f(k)\leq (k-1)^2$ and conjectured $f(k)=2n-2$.
 In this paper, we give some sufficient conditions for an $n$-chromatic digraphs to contains some oriented tree.
 In particular, we show that every acyclic $n$-chromatic digraph contains every oriented tree of order $n$.
 We also show that $f(k)\leq k^2/2-k/2+1$.
 Finally, we consider the existence of antidirected trees in digraphs.
 We prove that every antidirected tree of order $k$ is contained in every $(5k-9)$-chromatic digraph.
 We conjecture that if $|E(D)| > (k-2) |V(D)|$,
 then the digraph $D$ contains every antidirected tree of order $k$.
 This generalizes Burr's conjecture for antidirected trees and the celebrated Erd\H{o}s-S\'os Conjecture.
 We give some evidences for our conjecture to be true.},

 sorte = {Rapports},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 x-pays={BR,CA},

 
}

@techreport{ABGH+11a,

 url = {http://hal.inria.fr/inria-00583036/en/},

 title = { {W}eighted {I}mproper {C}olouring},

 author = {J. Araujo and J-C. Bermond and F. Giroire and F. Havet and D. Mazauric and R. Modrzejewski},

 abstract = {{I}n this paper, we study a new colouring problem up to our best knowledge inspired by the imperative of practical networks. {I}n real-life wireless networks, nodes interfere with one another with various intensities depending on numerous parameters: distance between them, the geographical topography, obstacles, etc. {W}e model this with a noise matrix. {T}he interference perceived by a node then is the sum of all the noise of the nodes emitting on the same frequency. {T}he problem is then to determine the minimum number of colours (or frequencies) needed to colour the whole graph so that the interference does not exceed a given threshold. {W}e provide several general results, such as bounds on this number of colours (e.g. a {B}rook's like theorem). {W}e then study the practical case of square of infinite grids which corresponds to operators' network and a noise decreasing with the distance. {W}e provide the chromatic number of the square, triangular and hexagonal grids for all possible 
 admissible interference levels. {F}inally, we model the problem using linear programming, propose and test a heuristic and an exact branch\&bound algorithms on random cell-like graphs, namely the {P}oisson {V}oronoi tessellations.},

 keywords = {graph colouring, improper colouring, grids, integer programming, algorithms},

 language = {{A}nglais},

 affiliation = {{MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 - {P}arallelism, {G}raphs and {O}ptimization {R}esearch {G}roup - {P}ar{GO} - {U}niversidade {F}ederal do {C}eara - {MAESTRO} - {INRIA} {S}ophia {A}ntipolis - {INRIA} - {U}niversit{\'e} {M}ontpellier {II} - {S}ciences et {T}echniques du {L}anguedoc },

 pages = {16 },

 type = {Research Report},

 institution = {INRIA},

 number = {{RR}-7590},

 month = {04},

 year = {2011},

 pdf = {http://hal.inria.fr/inria-00583036/PDF/RR-7590.pdf},

 sorte = {Rapports},

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={yes},

 
}

@techreport{ACG+11,

 url = {http://hal.inria.fr/inria-00576581/en/},

 title = {{On the hull number of some graph classes}},

 author = {J. Araujo and V. Campos and F. Giroire and N. Nisse and L. Sampaio and R. Soares},

 abstract = {{In this paper, we study the geodetic convexity of graphs focusing on the problem of the complexity to compute inclusion-minimum hull set of a graph in several graph classes. For any two vertices $u,v\in V$ of a connected graph $G=(V,E)$, the {\em closed interval} $I[u,v]$ of $u$ and $v$ is the the set of vertices that belong to some shortest $(u,v)$-path. For any $S \subseteq V$, let $I[S]= \bigcup\_{u,v\in S} I[u,v]$. A subset $S\subseteq V$ is {\em geodesically convex} if $I[S] = S$. In other words, a subset $S$ is convex if, for any $u,v \in S$ and for any shortest $(u,v)$-path $P$, $V(P) \subseteq S$. Given a subset $S\subseteq V$, the {\em convex hull} $I\_h[S]$ of $S$ is the smallest convex set that contains $S$. We say that $S$ is a {\em hull set} of $G$ if $I\_h[S] = V$. The size of a minimum hull set of $G$ is the {\em hull number} of $G$, denoted by $hn(G)$. The {\sc Hull Number} problem is to decide whether $hn(G)\leq k$, for a given graph $G$ and an integer $k$. Dourado {\it et al.} 
 showed that this problem is NP-complete in general graphs. In this paper, we answer an open question of Dourado et al.\~\cite{Douradoetal09} by showing that the {\sc Hull Number} problem is NP-hard even when restricted to the class of bipartite graphs. Then, we design polynomial time algorithms to solve the {\sc Hull Number} problem in several graph classes. First, we deal with the class of complements of bipartite graphs. Then, we generalize some results in\~\cite{ACGSS11} to the class of $(q,q-4)$-graphs and to the class of cacti. Finally, we prove tight upper bounds on the hull numbers. In particular, we show that the hull number of an $n$-node graph $G$ without simplicial vertices is at most $1+\lceil \frac{3(n-1)}{5}\rceil$ in general, at most $1+\lceil \frac{n-1}{2}\rceil$ if $G$ is regular or has no triangle, and at most $1+\lceil \frac{n-1}{3}\rceil$ if $G$ has girth at least $6$.}},

 pages = {19},

 sorte = {Rapports},

 institution = {INRIA},

 number = {RR-7567},

 year = {2011},

 month = Sep,

 pdf = {http://hal.inria.fr/inria-00576581/PDF/hn-RR\_v2.pdf},

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={no},

 x-pays = {BR},

 
}

@techreport{BKN+11,

 url = {http://hal.inria.fr/inria-00627910/en/},

 title = {{Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power}},

 author = {Becker, F. and Kosowski, A. and Nisse, N. and Rapaport, I. and Suchan, K.},

 abstract = {{In this work we study the computational power of graph-based models of distributed computing in which each node additionally has access to a global whiteboard. A node can read the contents of the whiteboard and, when activated, can write one message of $O(\log n)$ bits on it. A message is only based on the local knowledge of the node and the current content of the whiteboard. When the protocol terminates, each node computes the output based on the final contents of the whiteboard in order to answer some question on the network's topology. We propose a framework to formally define several scenarios modelling how nodes access the whiteboard, in a synchronous way or not. This extends the work of Becker {\it et al.} [IPDPS 2011] where nodes were imposed to create their messages only based on their local knowledge (i.e., with the whiteboard empty). We prove that the four models studied have increasing power of computation: any problem that can be solved in the weakest one can be solved in the the 
 second, and so on. Moreover, we exhibit problems that {\it separate} models, i.e., that can be solved in one model but not in a weaker one. These problems are related to Maximal Independent Set and detection of cycles. Finally we investigate problems related to connectivity as the construction of spanning- or BFS-tree in our different models.}},

 sorte = {Rapports},

 institution = {INRIA},

 number = {RR-7746},

 year = {2011},

 pdf = {http://hal.inria.fr/inria-00627910/PDF/RR-7746.pdf},

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={no},

 x-pays = {CL,PL},

 
}

@techreport{BCM+11c,

 AUTHOR = {Belhareth, S. and Coudert, D. and Mazauric, D. and Nisse, N. and Tahiri, I.},

 TITLE = {{Reconfiguration with physical constraints in WDM networks}},

 TYPE = {Research Report},

 YEAR = {2011},

 KEYWORDS = {Reconfiguration, WDM, NP-complete, Physical Layer Impaiments.},

 INSTITUTION = {INRIA},

 NUMBER = {RR-7850},

 URL = {http://hal.inria.fr/hal-00654111/en},

 PDF = {http://hal.inria.fr/docs/00/65/41/11/PDF/RR-7850.pdf},

 abstract = {In a WDM network, setting up a new wavelength in a fiber requires recalibrating the other wavelengths passing through this fiber. This induces a cost (e.g., time, energy, degradation of QoS) that depends nonlinearly on the number of wavelengths using the fiber. When a set of connection requests must change their optical paths in the network (e.g., during a maintenance operation on a link in the network), the order in which requests are switched affects the total cost of the operation. That is, the reconfiguration of the routing in a WDM network has some cost due to physical layer impairments. We initiate the study of the corresponding optimization problem by modeling the cost of switching a request as a non-linear function depending on the load of the links used by the new lightpath. We prove that determining the optimal rerouting order is NP-complete for a $2$-nodes network. We then give general lower and upper bounds on the minimum cost and we identify classes of instances where the problem 
 can be solved in polynomial time. Finally, we design heuristics for this problem and we analyze and compare them by simulations.},

 
}

@techreport{BJMY11,

 author = {Bermond, J-C. and Jean-Marie, A. and Mazauric, D. and Yu, M-L.},

 title = {Well Balanced Designs for Data Placement},

 year = {2011},

 month = {09},

 institution = {INRIA},

 number = {7725},

 type = {Research Report},

 url= {http://hal.inria.fr/inria-00618656},

 abstract = {The problem we consider in this article is motivated by
 data placement in particular data replication in video on demand
 systems. We are given a set $V$ of $n$ servers and $b$ files (data,
 documents). Each file is replicated on exactly $k$ servers. A
 placement consists in finding a family of $b$ subsets of $V$
 (representing the files) called blocks each of size $k$. Each server
 has some probability to fail and we want to find a placement which
 minimizes the variance of the number of available files. It was
 conjectured that there always exists an optimal placement (with
 variance better than that of any other placement for any value of the
 probability of failure). We show that the conjecture is true, if there
 exists a well balanced design, that is a family of blocks, such that
 each j-element subset of $V$ , $1 \leq j \leq k$, belongs to the same
 or almost the same number of blocks (difference at most one). The
 existence of well balanced designs is a difficult problem as it
 contains as subproblem the existence of Steiner systems. We completely
 solve the case $k=2$ and give bounds and constructions for $k = 3$ and
 some values of $n$ and $b$.},

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays = {MA},

 sorte = "Rapports",

 
}

@techreport{BeHa11,

 hal_id = {inria-00602188},

 url = {http://hal.inria.fr/inria-00602188/en/},

 title = {{Enumerating the edge-colourings and total colourings of a regular graph}},

 author = {S. Bessy and F. Havet},

 abstract = {{In this paper, we are interested in computing the number of edge colourings and total colourings of a graph. We prove that the maximum number of $k$-edge-colourings of a $k$-regular graph on $n$ vertices is $k\cdot(k-1!)^{n/2}$. Our proof is constructible and leads to a branching algorithm enumerating all the $k$-edge-colourings of a $k$-regular graph using a time $O^*((k-1!)^{n/2})$ and polynomial space. In particular, we obtain a algorithm on time $O^*(2^{n/2})=O^*(1.4143^n)$ and polynomial space to enumerate all the $3$-edge colourings of a cubic graph, improving the running time of $O^*(1.5423^n)$ of the algorithm due to Golovach et al.\~\cite{GKC10}. We also show that the number of $4$-total-colourings of a connected cubic graph is at most $3.2^{3n/2}$. Again, our proof yields a branching algorithm to enumerate all the $4$-total-colourings of a connected cubic graph.}},

 language = {Anglais},

 type = {Research Report},

 affiliation = {Laboratoire d'Informatique de Robotique et de Micro\'electronique de Montpellier - LIRMM - CNRS : UMR5506 - Universit\'e Montpellier II - Sciences et Techniques du Languedoc - MASCOTTE - INRIA Sophia Antipolis / Laboratoire I3S - INRIA - Universit\'e de Nice Sophia-Antipolis - CNRS : UMR6070},

 institution = {INRIA},

 number = {RR-7652},

 year = {2011},

 month = Jun,

 pdf = {http://hal.inria.fr/inria-00602188/PDF/RR-7652.pdf},

 x-editorial-board={no},

 x-proceedings={yes},

 x-international-audience={yes},

 
}

@techreport{CaHa11,

 URL = {http://hal.inria.fr/inria-00593426/en/},

 title = { 5-choosability of graphs with 2 crossings},

 author = {V. Campos and F. Havet},

 abstract = {{W}e show that every graph with two crossings is 5-choosable. {W}e also prove that every graph which can be made planar by removing one edge is 5-choosable.},

 language = {{A}nglais},

 affiliation = {{L}aborat{\'o}rios de {P}esqu{I}sa em {C}omput{A}{\c{c}}{\~a}o - {LIA} - {U}niversite {F}ederale du {C}eara - {MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070},

 pages = {22},

 type = {Research Report},

 institution = {INRIA},

 number = {{RR}-7618},

 month = {05},

 year = {2011},

 PDF = {http://hal.inria.fr/inria-00593426/PDF/RR-7618.pdf},

 x-pays={BR},

 
}

@techreport{CHM+11,

 url = {http://hal.inria.fr/inria-00605810/en/},

 title = {{Steinberg's Conjecture and near-colorings}},

 author = {J. G. Chang and F. Havet and M. Montassier and A. Raspaud},

 abstract = {Let ${\cal F}$ be the family of planar graphs without cycles of length
 4 and 5. Steinberg's Conjecture (1976) that says every graph of ${\cal
 F}$ is 3-colorable remains widely open. Motiv\'ees par une relaxation propos\'ee par Erd\H{o}s (1991), plusieurs
 \'etudes ont montr\'e la conjecture pour des sous-classes de ${\cal F}$. Par exemple, Borodin {\it et al.}~ont prouv\'e
 que tout graphe planaire sans cycles de longueur 4 \`a 7 est
 3-colorable. Dans ce rapport, nous relaxons le probl\`eme non pas sur la classe de graphes mais
 sur le type de coloration en consid\'erant des {\em quasi-colorations}.
 Un graphe $G=(V,E)$ est dit $(i,j,k)$-colorable
 si son ensemble de sommet peut \^etre partitionner en trois ensembles $V_1,V_2,V_3$
 tels que les graphes $G[V_1],G[V_2],G[V_3]$ induits par ces ensembles soit de degr\'e maximum au plus $i,j,k$
 respectivement. Avec cette terminologie, la Conjecture de Steinberg dit que
 tout graphe de ${\cal F}$ est $(0,0,0)$-colorable. Un r\'esultat de Xu (2008)
 implique que tout graphe de ${\cal F}$ est $(1,1,1)$-colorable. Nous montrons ici que tout graphe de ${\cal F}$ est $(2,1,0)$-colorable et
 $(4,0,0)$-colorable.},

 language = {Anglais},

 affiliation = {Department of Mathematics - National Taiwan University - Taida Insitute for Mathematical Science - National Taiwan University - National Taiwan University - National Center for Theoretical Science - National Center for Theoretical Science - MASCOTTE - INRIA Sophia Antipolis / Laboratoire I3S - INRIA - Universit{\'e} de Nice Sophia-Antipolis - CNRS : UMR6070 - Laboratoire Bordelais de Recherche en Informatique - LaBRI - CNRS : UMR5800 - Universit{\'e} Sciences et Technologies - Bordeaux I - Ecole Nationale Sup{\'e}rieure d'Electronique, Informatique et Radiocommunications de Bordeaux - Universit{\'e} Victor Segalen - Bordeaux II},

 type = {Rapport de recherche},

 institution = {INRIA},

 number = {RR-7669},

 collaboration = {NSC Taiwan, NSC99-2923-M-002-007-MY3 },

 year = {2011},

 month = {7},

 pdf = {http://hal.inria.fr/inria-00605810/PDF/RR-7669.pdf},

 x-pays={CN},

 x-editorial-board={yes},

 x-proceedings={yes},

 x-international-audience={yes},

 
}

@techreport{FGJ+11,

 url = {http://hal.inria.fr/inria-00625703/en/},

 title = {{To Satisfy Impatient Web surfers is Hard}},

 author = {Fomin, F. and Giroire, F. and Jean-Marie, A. and Mazauric, D. and Nisse, N.},

 abstract = {{Prefetching is a basic mechanism to avoid to waste time when accessing data. However, a tradeoff must be established between the amount of network's resources wasted by the prefetching and the gain of time. For instance, in the Web, browsers may download documents in advance while an Internaut is surfing on the Web. Since the web surfer follows the hyperlinks in an unpredictable way, the choice of the web pages to be prefetched must be computed online. The question is then to determine the minimum amount of resources used by prefetching and that ensures that all documents accessed by the web surfer have previously been loaded in the cache. We model this problem as a game similar to Cops and Robber Games in graphs. A fugitive starts on a marked vertex of a (di)graph G. Turn by turn, an observer marks at most k >= 1 vertices and then the fugitive can move along one edge/arcs of G. The observer wins if he prevents the fugitive to reach an unmarked vertex. The fugitive wins otherwise, i.e., if she 
 enters an unmarked vertex. The surveillance number of a graph is the least k >=1 allowing the observer to win whatever the fugitive does. We also consider the connected variant of this game, i.e., when a vertex can be marked only if it is adjacent to an already marked vertex. All our results hold for both variants, connected or not. We show that deciding whether the surveillance number of a chordal graph equals 2 is NP-hard. Deciding if the surveillance number of a DAG equals 4 is PSPACE-complete. Moreover, computing the surveillance number is NP-hard in split graphs. On the other hand, we provide polynomial time algorithms to compute surveillance number of trees and interval graphs. Moreover, in the case of trees, we establish a combinatorial characterization, related to isoperimetry, of the surveillance number.}},

 pages = {20},

 sorte = {Rapports},

 institution = {INRIA},

 number = {RR-7740},

 year = {2011},

 month = Sep,

 pdf = {http://hal.inria.fr/inria-00625703/PDF/RR-7740.pdf},

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={no},

 x-pays = {NO},

 
}

@techreport{GGM+11,

 url = {http://hal.inria.fr/inria-00565359/en/},

 title = { {A}nalysis of the {R}epair {T}ime in {D}istributed {S}torage {S}ystems},

 author = {Giroire, F. and Gupta, S. K. and Modrzejewski, R. and Monteiro, J. and P{\'e}rennes, S.},

 abstract = {{D}istributed or peer-to-peer storage systems introduce redundancy to preserve the data in case of peer failures or departures. {T}o ensure long-term fault tolerance, the storage system must have a self-repair service that continuously reconstructs lost fragments of redundancy. {T}he speed of this reconstruction process is crucial for the data survival. {T}his speed is mainly determined by available bandwidth, a critical resource of such systems. {W}e propose a new analytical framework that takes into account the correlation of concurrent repairs when estimating the repair time and the probability of data loss. {M}ainly, we intro- duce queuing models in which reconstructions are served by peers at a rate that depends on the available bandwidth. {T}he models and schemes proposed are validated by mathematical analysis, extensive set of simulations, and experimentation using the {G}rid'5000 test-bed platform.},

 keywords = {{P}2{P} storage systems, data lifetime, queuing model, regenerating codes per- formance evaluation},

 language = {{A}nglais},

 affiliation = {{MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 - {I}ndian {I}nstitute of {T}echnology [{D}elhi] - {IIT} {D}elhi - {I}ndian {I}nstitute of {T}echnology {D}elhi },

 pages = {28},

 type = {Research Report},

 institution = {INRIA},

 number = {{RR}-7538},

 month = {02},

 year = {2011},

 pdf = {http://hal.inria.fr/inria-00565359/PDF/RR-7538.pdf},

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays = {BR},

 
}

@techreport{HaZh11,

 url = {http://hal.inria.fr/inria-00600738/en/},

 title = {{The game Grundy number of graphs}},

 author = {F. Havet and X. Zhu},

 abstract = {{Given a graph G = (V;E), two players, Alice and Bob, alternate their turns in choosing uncoloured vertices to be coloured. Whenever an uncoloured vertex is chosen, it is coloured by the least positive integer not used by any of its coloured neighbours. Alice's goal is to minimize the total number of colours used in the game, and Bob's goal is to maximize it. The game Grundy number of G is the number of colours used in the game when both players use optimal strategies. It is proved in this paper that the maximum game Grundy number of forests is 3, and the game Grundy number of any partial 2-tree is at most 7.}},

 keywords = {colouring game, game Grundy number, trees, partial 2-trees},

 language = {Anglais},

 affiliation = {MASCOTTE - INRIA Sophia Antipolis / Laboratoire I3S - INRIA - Universit\'e de Nice Sophia-Antipolis - CNRS : UMR6070 - Department of Mathematics - Zhejiang Normal University},

 type = {Rapport de recherche},

 institution = {INRIA},

 number = {RR-7646},

 year = {2011},

 month = Jun,

 pdf = {http://hal.inria.fr/inria-00600738/PDF/RR-7646.pdf},

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={yes},

 x-pays={CN},

 
}

@techreport{MaMo11a,

 title = {{On 3-colorable $P_5$-free graphs}},

 author={Maffray, F. and Morel, G.},

 number = {191},

 institution={Les Cahiers Leibniz, Laboratoire G-SCOP},

 year={2011},

 pdf={https://consult-cahiersleibniz.g-scop.grenoble-inp.fr/WebObjects/ProjetCahiersLeibniz.woa/Contents/WebServerResources/CahiersLeibniz/cahiers/Cahier191.pdf},

 x-editorial-board = {no},

 x-proceedings = {no},

 x-international-audience = {yes},

 sorte = "Rapports"
 
}

@techreport{Mou11,

 hal_id = {inria-00637656},

 url = {http://hal.inria.fr/inria-00637656/en/},

 title = {{Xcast6 Treemap Islands - A Mixed Model of Application and Network Layer Multicast}},

 author = {J. Moulierac and T. K. Phan and N. Thoai and C. Tran},

 abstract = {{IP multicast is a protocol that deals with group communications with the aim of reducing traffic redundancy in the network. However, due to difficulty in deployment and poor scalability with a large number of multicast groups, IP multicast is still not widely deployed and used on the Internet. Recently, Xcast6 and Xcast6 Treemap, the two network layer multicast protocols, have been proposed with complementary scaling properties to IP multicast: they support a very large number of active multicast sessions. However, the key limitation of these protocols is that they only support small multicast group. In this paper, we propose Xcast6 Treemap island - a hybrid model of Application Layer Multicast (ALM) and Xcast6 that can work for large multicast group. Our model has several key advantages: ease of deployment, efficiency in bandwidth savings, no control message between end-host and router, zero multicast forwarding state at router and no need for a multicast address allocation protocol. In 
 addition, this model is a potential service from which an ISP can get new revenue. Finally, in simulation section, we have made a comparison with IP multicast and NICE protocol to show the feasibility of our new model.}},

 keywords = {IP multicast, Application Layer Multicast, Xcast, media streaming, linear program, algorithms},

 language = {Anglais},

 affiliation = {MASCOTTE - INRIA Sophia Antipolis / Laboratoire I3S - INRIA - Universit{\'e} de Nice Sophia-Antipolis - CNRS : UMR6070 - Faculty of Mechanical Engineering [HCM University] - FME - Ho CHi Minh City University of Technology},

 pages = {27},

 type = {Rapport de recherche},

 institution = {INRIA},

 number = {RR-7784},

 year = {2011},

 month = Dec,

 x-pays = {VN},

 x-editorial-board={no},

 x-proceedings={no},

 x-international-audience={yes},

 sorte = "Rapports",

 pdf = {http://hal.inria.fr/inria-00637656/PDF/RR-7784.pdf},

 
}

@book{DaWa10,
title = {SIMULATION: Transactions of the Society of Modeling and Simulation International. Special Issue on Software Tools, Techniques and Architectures for Computer Simulation},
publisher = {Sage},
year = {2010},
editor = {Dalle, O. and Wainer, G.},
doi = {10.1177/0037549710369877},
volume = {86},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "livres-edit",

}

@book{CoSi10,
editor = {Coudert, D. and Simplot-Ryl, D.},
title = {Ad Hoc \& Sensor Wireless Networks, an International Journal -- Special issue on Ad hoc, Mobile and Wireless Networks},
publisher = {Old City Publishing},
year = {2010},
volume = {9},
number = {1-2},
issn = {1551-9899},
url = {http://www.oldcitypublishing.com/AHSWN/AHSWN.html},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "livres-edit",

}

@proceedings{jdir10,
title = {11es Journ\'ees Doctorales en Informatique et R\'eseaux (JDIR 2010)},
year = {2010},
editor = {F. Giroire and D. Mazauric},
number = {11},
sorte = "livres-edit",
address = {Sophia Antipolis, France},
month = mar,
organization = {Mascotte, INRIA, I3S(CNRS / Univ. of Nice-Sophia)},
opturl = {http://www-sop.inria.fr/teams/mascotte/jdir2010/},
url = {http://hal.inria.fr/JDIR2010/},

}

@phdthesis{Cou10,
author = {D. Coudert},
title = {Algorithmique et optimisation dans les r\'eseaux de t\'el\'ecommunications},
type = {Habilitation \`a Diriger des Recherches},
school = {{Universit\'e de Nice Sophia-Antipolis (UNS)}},
year = {2010},
month = mar,
pdf = {http://www-sop.inria.fr/members/David.Coudert/hdr/HDR-Coudert.pdf},
url = {http://www-sop.inria.fr/members/David.Coudert/hdr/},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "HDR",

}

@phdthesis{Mon10,
author = {Monteiro, Julian},
title = {Modeling and Analysis of Reliable Peer-to-Peer Storage Systems},
school = {Ecole doctorale {STIC}, Universit\'e de Nice-Sophia Antipolis},
day = {16},
month = nov,
year = {2010},
url = {http://tel.archives-ouvertes.fr/tel-00545724/},
ftp = {http://tel.archives-ouvertes.fr/docs/00/54/57/24/PDF/these-jmonteiro.pdf},
abstract = {Large scale peer-to-peer systems are foreseen as a way to provide highly reliable data storage at low cost. To ensure high durability and high resilience over a long period of time the system must add redundancy to the original data. It is well-known that erasure coding is a space efficient solution to obtain a high degree of fault-tolerance by distributing encoded fragments into different peers of the network. Therefore, a repair mechanism needs to cope with the dynamic and unreliable behavior of peers by continuously reconstructing the missing redundancy. Consequently, the system depends on many parameters that need to be well tuned, such as the redundancy factor, the placement policies, and the frequency of data repair. These parameters impact the amount of resources, such as the bandwidth usage and the storage space overhead that are required to achieve a desired level of reliability, i.e., probability of losing data. This thesis aims at providing tools to analyze and predict the performance of general large scale data storage systems. We use these tools to analyze the impact of different choices of system design on different performance metrics. For instance, the bandwidth consumption, the storage space overhead, and the probability of data loss should be as small as possible. Different techniques are studied and applied. First, we describe a simple Markov chain model that harnesses the dynamics of a storage system under the effects of peer failures and of data repair. Then we provide closed-form formulas that give good approximations of the model. These formulas allow us to understand the interactions between the system parameters. Indeed, a lazy repair mechanism is studied and we describe how to tune the system parameters to obtain an efficient utilization of bandwidth. We confirm by comparing to simulations that this model gives correct approximations of the system average behavior, but does not capture its variations over time. We then propose a new stochastic model based on a fluid approximation that indeed captures the deviations around the mean behavior. These variations are most of the time neglected by previous works, despite being very important to correctly allocate the system resources. We additionally study several other aspects of a distributed storage system: we propose queuing models to calculate the repair time distribution under limited bandwidth scenarios; we discuss the trade-offs of a Hybrid coding (mixing erasure codes and replication); and finally we study the impact of different ways to distribute data fragments among peers, i.e., placement strategies.},
x-pays = {FR},
OPTx-editorial-board={no},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "these" 
}

@phdthesis{Nepo10,
author = {N. Nepomuceno},
title = {Network optimization for wireless microwave backhaul},
school = {Ecole doctorale {STIC}, Universit\'e de Nice-Sophia Antipolis},
year = {2010},
month = {dec},
url = {http://tel.archives-ouvertes.fr/tel-00593412/fr/},
pdf = {http://tel.archives-ouvertes.fr/docs/00/59/34/12/PDF/thesis.pdf},
keywords = {Wireless communications, Mathematical programming, Network optimization, Multicommodity flows, Microwave backhaul networks},
abstract = {Technological breakthroughs have transformed the telecommunications industry aiming at providing capacity and efficiency to support the increasing demand for wireless broadband services. With the advances in access technologies, the capacity bottleneck of cellular networks is gradually moving from the radio interface towards the backhaul -- the portion of the network infrastructure that provides interconnectivity between the access and core networks. The ability for microwave to be rapidly and cost-effectively deployed is being a crucial point for successfully tackling the backhaul bottleneck problem. However, backhaul solutions available with this technology have received little attention from the scientific community. Nevertheless, the growth of microwave backhaul networks and their increasing complexity give rise to many interesting optimization problems. In fact, unlike wired networks, the capacity of a microwave radio link is prone to variations, either due to external factors (e.g., weather) or by the action of the network operator. This fundamental difference raises a variety of new issues to be addressed appropriately. Therefore, more refined approaches for dealing with network optimization in wireless microwave backhaul need to be conceived. In this thesis, we investigate network optimization problems related to the design and configuration of wireless microwave backhaul. We are concerned with a general class of problems expressed in terms of minimum cost multicommodity flows with discontinuous step increasing cost functions on the links of the network. These problems are among the most important and challenging problems in network optimization. Generally, they are computationally very difficult and, in practice, can only be solved approximately. We introduce mathematical models for some of these problems and present solution approaches essentially based on general mixed integer programming, chance-constrained programming, relaxation techniques, cutting plane methods, as well as hybrid metaheuristics. This work was done in collaboration with the SME~3Roam, and partially developed within the scope of the joint project RAISOM (R\'eseaux de collecte IP sans fil optimis\'es), among INRIA Sophia},
sorte = {thesis},
OPTx-pays = {FR, BR},
OPTx-editorial-board={no},
OPTx-proceedings={no},
OPTx-international-audience={yes} 
}

@phdthesis{Per10,
author = {S. P\'erennes},
title = {Contribution \`a l'algorithmique des r\'eseaux de t\'el\'ecommunications },
type = {Habilitation \`a Diriger des Recherches},
school = {{Universit\'e de Nice Sophia-Antipolis (UNS)}},
year = {2010},
month = mar,
url = {http://www-sop.inria.fr/members/Stephane.Perennes/ },
sorte = "HDR",

}

@inbook{CCC+10b,
author = {A. Casamayou and N. Cohen and G. Connan and T. Dumont and L. Fousse and F. Maltey and M. Meulien and M. Mezzarobba and C. Pernet and N. M. Thi\'ery and P. Zimmermann},
title = {Calcul math\'ematique avec Sage},
chapter = {Programmation Lin\'eaire},
year = {2010},
sorte = "livres-chap",
url = {http://sagebook.gforge.inria.fr/},
OPTx-editorial-board={no},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@inbook{CCC+10a,
author = {A. Casamayou and N. Cohen and G. Connan and T. Dumont and L. Fousse and F. Maltey and M. Meulien and M. Mezzarobba and C. Pernet and N.M. Thi\'ery and P. Zimmermann},
title = {Calcul math\'ematique avec Sage},
chapter = {Th\'eorie des graphes},
year = {2010},
sorte = "livres-chap",
url = {http://sagebook.gforge.inria.fr/},
OPTx-editorial-board={no},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "livres-chap",

}

@InBook{CCF+09,
AUTHOR = {Cinkler, T. and Coudert, D. and Flammini, M. and Monaco, G. and Moscardelli, L. and Mu{\~n}oz, X. and Sau, I. and Shalom, M. and Zaks, S.},
ALTeditor = {},
title = {Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks},
chapter = {Traffic Grooming: Combinatorial Results and Practical Resolutions},
publisher = {Springer},
year = {2010},
x-pays = {HU,IL,ES,IS},
OPTkey = {},
volume = {XXVII},
OPTnumber = {},
edition = {{A. Koster and X. Mu{\~n}oz}},
X-INTERNATIONAL-AUDIENCE = {yes},
URL-HAL = {http://hal.inria.fr/inria-00530964},
X-ID-HAL = {inria-00530964},
pages = {63-94},
series = {EATCS Texts in Theoretical Computer Science},
ISBN = {978-3-642-02249-4},
url = {http://www.springer.com/computer/foundations/book/978-3-642-02249-4},
abstract = {In an optical network using the wavelength division multiplexing (WDM) technology, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses $1/g$ of the bandwidth of the wavelength, we will say that the grooming factor is $g$. That means that on a given edge of the network we can groom (group) at most $g$ requests on the same wavelength. With this constraint the objective can be either to minimize the number of wavelengths (related to the transmission cost) or minimize the number of Add Drop Multiplexers\index{add drop multiplexer} (shortly ADM) used in the network (related to the cost of the nodes). Here, we first survey the main theoretical results obtained for different grooming factors on various topologies: complexity, (in)approximability, optimal constructions, approximation algorithms, heuristics, etc. Then, we give an ILP formulation for multilayer traffic grooming and present some experimental results.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CCF+09.pdf},
sorte = "livres-chap",

}

@article{AK+09,
author = {L. {Addario-Berry} and W.S. Kennedy and A.D. King and Z. Li and B. Reed},
title = {Finding the maximum-weight induced $k$-partite subgraph of an $i$-triangulated graph},
journal = {Discrete Applied Mathematics},
volume = {158},
number = {7},
pages = {765-770},
year = {2010},
month = apr,
url = {http://dx.doi.org/10.1016/j.dam.2008.08.020},
abstract = {An i-triangulated graph is a graph in which every odd cycle has two non-crossing chords; i-triangulated graphs form a subfamily of perfect graphs. A slightly more general family of perfect graphs are clique-separable graphs. A graph is clique-separable precisely if every induced subgraph either has a clique cutset, or is a complete multipartite graph or a clique joined to an arbitrary bipartite graph. We exhibit a polynomial time algorithm for finding a maximum-weight induced k-partite subgraph of an i-triangulated graph, and show that the problem of finding a maximum-size bipartite induced subgraph in a clique-separable graph is View the MathML source-complete.},
sorte = "rev-int",

}

@article{AGHP10,
author = {O. Amini and F. Giroire and F. Huc and S. P\'erennes },
title = { Minimal selectors and fault tolerant networks },
journal = { Networks },
year = {2010},
volume = {55},
number = {4},
pages = {326-340},
month = jul,
OPTnote = {To appear. Published online 31 July 2009, DOI 10.1002/net.20326},
url = {http://doi.wiley.com/10.1002/net.20326},
pdf = { ftp://ftp-sop.inria.fr/mascotte/Publications/AG+07.pdf },
abstract = { In this paper we study a combinatorial optimization problem issued from on-board networks in satellites. In this kind of networks the entering signals (inputs) should be routed to amplifiers (outputs). The connections are made via expensive switches with four links available. The paths connecting inputs to outputs should be link-disjoint. More formally, we call {it $\plk-$network } an undirected graph with $p+\lambda$ inputs, $p+k$ outputs and internal vertices of degree four. A $\plk-$network is \emph{valid} if it is tolerant to a restricted number of faults in the network, i.e. if for any choice of at most $k$ faulty inputs and $\lambda$ faulty outputs, there exist $p$ edge-disjoint paths from the remaining inputs to the remaining outputs. In the special case $\lambda=0$, a $\plk-$network is already known as a \emph{selector}. Our optimization problem consists of determining $N\plk$, the minimum number of nodes in a valid $\plk-$network. For this, we present validity certificates and a gluing lemma from which derive lower bounds for $N\plk$. We also provide constructions, and hence upper bounds, based on expanders. The problem is very sensitive to the order of $\lambda$ and $k$. For instance, when $\lambda$ and $k$ are small compared to $p$, the question reduces to avoid certain forbidden local configurations. For larger values of $\lambda$ and $k$, the problem is to find graphs with a good expansion property for small sets. This leads us to introduce a new parameter called \emph{$\alpha$-robustness}. We use $\alpha$-robustness to generalize our constructions to higher order values of $k$ and $\lambda$. In many cases, we provide asymptotically tight bounds for $N\plk$. },
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@article{AHH+10,
author={O. Amini and F. Havet and F. Huc and S. Thomass\'e},
title={WDM and directed star arboricity},
journal = {Combinatorics, Probability and Computing},
volume = {19},
year = {2010},
pages = {161--182},
abstract = { A digraph is $m$-labelled if every arc is labelled by an integer in $\{1, \dots ,m\}$. Motivated by wavelength assignment for multicasts in optical networks, we introduce and study $n$-fibre colourings of labelled digraphs. These are colourings of the arcs of $D$ such that at each vertex $v$, and for each colour $\alpha$, $in(v,\alpha)+out(v,\alpha)\leq n$ with $in(v,\alpha)$ the number of arcs coloured $\alpha$ entering $v$ and $out(v,\alpha)$ the number of labels $l$ such that there is at least one arc of label $l$ leaving $v$ and coloured with $\alpha$. The problem is to find the minimum number of colours $\lambda_n(D)$ such that the $m$-labelled digraph $D$ has an $n$-fibre colouring. In the particular case when $D$ is $1$-labelled, $\lambda_1(D)$ is called the directed star arboricity of $D$, and is denoted by $dst(D)$. We first show that $dst(D)\leq 2\Delta^-(D)+1$, and conjecture that if $\Delta^-(D)\geq 2$, then $dst(D)\leq 2\Delta^-(D)$. We also prove that for a subcubic digraph $D$, then $dst(D)\leq 3$, and that if $\Delta^+(D), \Delta^-(D)\leq 2$, then $dst(D)\leq 4$. Finally, we study $\lambda_n(m,k)=\max\{\lambda_n(D) \tq D \mbox{ is $m$-labelled} \et \Delta^-(D)\leq k\}$. We show that if $m\geq n$, then $\ds \left\lceil\frac{m}{n}\left\lceil \frac{k}{n}\right\rceil + \frac{k}{n} \right\rceil\leq \lambda_n(m,k) \leq\left\lceil\frac{m}{n}\left\lceil \frac{k}{n}\right\rceil + \frac{k}{n} \right\rceil + C \frac{m2\log k}{n}$ for some constant $C$. We conjecture that the lower bound should be the right value of $\lambda_n(m,k)$.},
pdf= { ftp://ftp-sop.inria.fr/mascotte/Publications/AHH+10.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@article{AHL10,
author = {Ast\'e, M. and Havet, F. and Linhares Sales, C.},
title = {Grundy number and products of graphs},
journal = {Discrete Mathematics},
year = {2010},
volume = {310},
number = {9},
pages = {1482--1490},
abstract = {The {\em Grundy number} of a graph $G$, denoted by $\Gamma (G)$, is the largest $k$ such that $G$ has a {\em greedy} $k$-colouring, that is a colouring with $k$ colours obtained by applying the greedy algorithm according to some ordering of the vertices of $G$. In this paper, we study the Grundy number of the lexicographic and the cartesian products of two graphs in terms of the Grundy numbers of these graphs. Regarding the lexicographic product, we show that $\Gamma(G)\times \Gamma(H)\leq \Gamma(G[H])\leq 2^{\Gamma(G)-1}(\Gamma(H)-1)+\Gamma(G)$. In addition, we show that if $G$ is a tree or $\Gamma(G)=\Delta(G)+1$, then $\Gamma(G[H])=\Gamma(G)\times\Gamma(H)$. We then deduce that for every fixed $c\geq 1$, given a graph $G$, it is CoNP-Complete to decide if $\Gamma(G)\leq c\times \chi(G)$ and it is CoNP-Complete to decide if $\Gamma(G)\leq c\times \omega(G)$. Regarding the cartesian product, we show that there is no upper bound of $\Gamma(G\square H)$ as a function of $\Gamma(G)$ and $\Gamma(H)$. Nevertheless, we prove that $\Gamma(G\square H) \leq \Delta(G)\cdot 2^{\Gamma(H)-1} + \Gamma(H)$.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/AHL10.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {BR},
sorte = "rev-int",

}

@article{BCG+10,
author = {J-C. Bermond and C. J. Colbourn and L. Gionfriddo and G. Quattrocchi and I. Sau},
title = {{Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4}},
journal = {SIAM Journal on Discrete Mathematics},
year = {2010},
volume = {24},
number = {2},
pages = {400-419},
abstract = { We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-period grooming problem, during the first period of time there is all-to-all uniform traffic among $n$ nodes, each request using $1/C$ of the bandwidth; and during the second period, there is all-to-all uniform traffic only among a subset $V$ of $v$ nodes, each request now being allowed to use $1/C'$ of the bandwidth, where $C' < C$. We determine the minimum drop cost (minimum number of ADMs) for any $n,v$ and $C=4$ and $C' \in \{1,2,3\}$. To do this, we use tools of graph decompositions. Indeed the two-period grooming problem corresponds to minimizing the total number of vertices in a partition of the edges of the complete graph $K_n$ into subgraphs, where each subgraph has at most $C$ edges and where furthermore it contains at most $C'$ edges of the complete graph on $v$ specified vertices. Subject to the condition that the two-period grooming has the least drop cost, the minimum number of wavelengths required is also determined in each case.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/BCG+10.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {ES, IT, US},
sorte = "rev-int",

}

@article{BGR10,
citekey= {BGR10},
author = {Bermond, J-C. and Gargano, L. and Rescigno, A.A.},
title= {Gathering with minimum completion time in sensor tree networks },
journal = {JOIN},
volume= {11},
number= {1-2},
year= {2010},
pages={1-33},
pdf={http://www-sop.inria.fr/members/Jean-Claude.Bermond//PUBLIS/BGR10.pdf},
note = {A preliminary version has been presented at Sirocco08},
abstract ={ Data gathering is a fundamental operation in wireless sensor networks in which data packets generated at sensor nodes are to be collected at a base station. In this paper we suppose that each sensor is equipped with an half–duplex interface; hence, a node cannot receive and transmit at the same time. Moreover, each node is equipped with omnidirectional antennas allowing the transmission over distance R. The network is a multi-hop wireless network and the time is slotted so that one–hop transmission of one data item consumes one time slot. We model the network with a graph where the vertices represent the nodes and two nodes are connected if they are in the transmission range of each other. We suppose that the interference range is the same as the transmission range; therefore due to interferences a collision happens at a node if two or more of its neighbors try to transmit at the same time. Furthermore we suppose that an intermediate node should forward a message as soon as it receives it. We give an optimal collision free gathering schedule for tree networks whenever each node has exactly one data packet to send. },
OPTx-editorial-board={yes},
OPTx-international-audience={yes},
x-pays = {IT},
sorte = "rev-int",

}

@article{BHHL10,
title = {{I}mproper colouring of weighted grid and hexagonal graphs},
author = {Bermond, J-C. and Havet, F. and Huc, F. and Linhares Sales, C.},
journal = {Discrete Mathematics, Algorithms and Applications},
year = {2010},
volume = {2},
number = {3},
pages = {395-411},
abstract = {{W}e study a weighted improper colouring problem motivated by a frequency allocation problem. {I}t consists of associating to each vertex a set of $p(v)$ (weight) distinct colours (frequencies), such that the set of vertices having a given colour induces a graph of degree at most $k$ (the case $k=0$ corresponds to proper colouring). {T}he objective is to minimize the number of colours. We propose approximation algorithms to compute such a colouring for general graphs. {W}e apply these to obtain good approximation ratio for grid and hexagonal graphs. {F}urthermore we give exact results for the 2-dimensional grid and the triangular lattice when the weights are all the same.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/BHHL10.pdf},
x-editorial-board={yes},
x-proceedings={yes},
x-international-audience={yes},
x-pays={BR},
sorte = "rev-int",

}

@article{BeYu10,
citekey= {BeYu10},
author= {J-C. Bermond and M-L. Yu},
title= {Optimal gathering algorithms in multi-hop radio tree networks with interferences},
journal = { Ad Hoc and Sensor Wireless Networks},
volume= {9},
number= {1-2},
year= {2010},
pages={109-128},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond//PUBLIS/BeYu10.pdf},
abstract={We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network, a message can only be properly received if there is no interference from another message being simultaneously transmitted. The network is modeled as a graph, where the vertices represent the nodes and the edges, the possible com- munications. The interference constraint is modeled by a fixed integer dI ? 1, which implies that nodes within distance d I in the graph from one sender cannot receive messages from another node. In this paper, we suppose that it takes one unit of time (slot) to transmit a unit-length message. A step (or round) consists of a set of non interfering (compat- ible) calls and uses one slot. We present optimal algorithms that give minimum number of steps (delay) for the gathering problem with buffer- ing possibility, when the network is a tree, the root is the destination and dI = 1. In fact we study the equivalent personalized broadcasting problem instead. },
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {CA},
sorte = "rev-int",

}

@ARTICLE{CFK+09,
sorte = "rev-int",
author = {I. Caragiannis and A. Ferreira and C. Kaklamanis and S. P\'erennes and H. Rivano},
title = {Fractional Path Coloring in Bounded Degree Trees with Applications},
journal = {Algorithmica},
volume = {58},
number = {2},
pages = {516-540},
year = {2010},
abstract = {This paper studies the natural linear programming relaxation of the path coloring problem. We prove constructively that finding an optimal fractional path coloring is Fixed Parameter Tractable (FPT), with the degree of the tree as parameter: the fractional coloring of paths in a bounded degree trees can be done in a time which is linear in the size of the tree, quadratic in the load of the set of paths, while exponential in the degree of the tree. We give an algorithm based on the generation of an efficient polynomial size linear program. Our algorithm is able to explore in polynomial time the exponential number of different fractional colorings, thanks to the notion of trace of a coloring that we introduce. We further give an upper bound on the cost of such a coloring in binary trees and extend this algorithm to bounded degree graphs with bounded treewidth. Finally, we also show some relationships between the integral and fractional problems, and derive a (1 + 5/3e) ~= 1.61 approximation algorithm for the path coloring problem in bounded degree trees, improving on existing results. This classic combinatorial problem finds applications in the minimization of the number of wavelengths in wavelength division multiplexing (WDM) optical networks.},
OPTciteulike-article-id = {4062435},
url = {http://dx.doi.org/10.1007/s00453-009-9278-3},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/Herve.Rivano/Biblio/cfkpr09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays={GR},

}

@article{CDK+10,
title = "On Wiener Index of Graphs and Their Line Graphs",
journal = "MATCH Commun. Math. Comput. Chem.",
volume = "64",
number = "3",
pages = "683-698",
year = "2010",
author = "N. Cohen and D. Dimitrov and R. Krakovski and R. Skrekovski and V. Vukasinovic",
abstract = {The Wiener index of a graph $G$, denoted by $W(G)$, is the sum of distances between all pairs of vertices in $G$. In this paper, we consider the relation between the Wiener index of a graph, $G$, and its line graph, $L(G)$. We show that if $G$ is of minimum de\ gree at least two, then $W(G) ≤ W(L(G))$. We prove that for every non-negative integer g0, there exists $g > g_0$, such that there are infinitely many graphs $G$ of girth $g$, satisfying $W(G) = W(L(G))$. This partially answers a question raised by Dobrynin and Mel’nikov \ [8] and encourages us to conjecture that the answer to a stronger form of their question is affirmative.},
pdf = {http://www.imfm.si/preprinti/PDF/01113.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
x-pays = {FR, SI, DE},
sorte = "rev-int",

}

@article{CFG+10,
title = "Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem",
journal = "Journal of Computer and System Sciences",
volume = "76",
number = "7",
pages = "650 - 662",
year = "2010",
url = "http://www.sciencedirect.com/science/article/B6WJ0-4Y7P4VB-1/2/82e1f60c51c64592592c857c9c99062b",
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/k-out-tree.pdf},
author = "N. Cohen and F. V. Fomin and G. Gutin and E. Jung Kim and S. Saurabh and A. Yeo",
abstract = " An out-tree T is an oriented tree with only one vertex of in-degree zero. A vertex x of T is internal if its out-degree is positive. We design randomized and deterministic algorithms for deciding whether an input digraph contains a given out-tree with k vertices. The algorithms are of running time O*(5.704k) and O*(6.14k), respectively. We apply the deterministic algorithm to obtain a deterministic algorithm of runtime O*(ck), where c is a constant, for deciding whether an input digraph contains a spanning out-tree with at least k internal vertices. This answers in affirmative a question of Gutin, Razgon and Kim (Proc. AAIM'08).",
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@article{CoHa10,
title = { {P}lanar graphs with maximum degree $\Delta\geq 9$ are ($\Delta+1$)-edge-choosable -- short proof},
author = {N. Cohen and F. Havet},
journal = {Discrete Mathematics},
year = {2010},
volume = {310},
number = {21},
pages = {3049--3051},
abstract = {{W}e give a short proof of the following theorem due to {B}orodin~\cite{{B}or90}. {E}very planar graph with maximum degree $\{D}elta\geq 9$ is $(\{D}elta+1)$-edge-choosable.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/CoHa10.pdf},
keywords = {edge-colouring, list colouring, {L}ist {C}olouring {C}onjecture, planar graphs},
x-editorial-board={yes},
x-proceedings={yes},
x-international-audience={yes},
x-pays={},
sorte = "rev-int",

}

@article{CNR10,
author = {D. Coudert and N. Nepomuceno and H. Rivano},
title = {Power-Efficient Radio Configuration in Fixed Broadband Wireless Networks},
journal = {Computer Communications, Special Section on Hot Topics in Mesh Networking},
publisher = {Elsevier},
year = {2010},
volume = {33},
number = {8},
pages = {898-906},
month = may,
OPTnote = {available online since January 18 2010.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CNR10.pdf},
OPTpdf = {http://dx.doi.org/10.1016/j.comcom.2010.01.006},
url = {http://dx.doi.org/10.1016/j.comcom.2010.01.006},
abstract = {In this work, we investigate on determining feasible radio configurations in fixed broadband wireless networks, focusing on power efficiency. Under this scenario, a power-efficient configuration can be characterized by a modulation constellation size and a transmission power level. Every link holds a set of power-efficient configurations, each of them associating a capacity with its energy cost. We introduce a joint optimization of data routing and radio configuration that minimizes the total energy consumption while handling all the traffic requirements simultaneously. An exact mathematical formulation of the problem is presented. It relies on a minimum cost multicommodity flow with step increasing cost functions, which is very hard to optimize. We then propose a piecewise linear convex function, obtained by linear interpolation of power-efficient points, that provides a good approximation of the energy consumption on the links, and present a relaxation of the previous formulation that exploits the convexity of the cost functions. This yields lower bounds on the total energy expenditure, and finally heuristic algorithms based on the fractional optimum are employed to produce feasible configuration solutions. Our models are validated through extensive experiments that are reported and discussed. The results testify the potentialities behind this novel approach.},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
x-pays = {BR},
sorte = "rev-int",

}

@article {WQD+10,
author = {O. Dalle and Q. Liu and G. Wainer and B. P. Zeigler},
title = { Applying Cellular Automata and DEVS Methodologies to Digital Games: A Survey },
pages = {796-823},
journal = {Simulation \& Gaming},
publisher = {Sage Publications},
volume = {41},
number = {6},
year = {2010},
month = Dec,
doi = {doi:10.1177/1046878110378708},
url = {http://hal.inria.fr/inria-00530927},
abstract = {Cellular automata were designed by John von Neumann in the 1940s, as a mathematical abstraction for modeling self-replicating algorithms. Since then, cellular automata have been widely studied theoretically and evolved into multiple variants. In the 1970s, Bernard P. Zeigler proposed a formalism rooted on systems theory principles, named DEVS (discrete-event systems specifications), which paved the way for component-based modeling and simulation and related methodologies. The purpose of this article is to survey how cellular automata and its variant, called cell-DEVS, may be used to implement computer simulations that can be used as digital serious games. The authors illustrate that implementation through some of the practical applications of such cellular automata. They show various serious game applications using real case studies: first, a simple bouncing ball and pinball game, a particle collision model, another on gossip propagation, and an application on human behavior at a metro station. Then, they show an application to social simulation using a voters game, a theoretical application (a model called Daisy World, which is derived from Gaia theory), and applications to physical phenomena such as a sandpile formation model or, finally, a three-dimensional model of a "virtual clay" that changes its shape when it is subject to pressure effects.},
note = {EA DISSIMINET (Associated Team) },
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},

}

@article{EHN10,
author = {N. Eggemann and F. Havet and S. Noble},
title = {k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$},
year = {2010},
journal = {Discrete Applied Mathematics},
volume = {158},
number = {16},
pages = {1777--1788},
abstract = {A mapping from the vertex set of a graph $G=(V,E)$ into an interval of integers $\{0, \dots ,k\}$ is an $L(2,1)$-labelling of $G$ of span $k$ if any two adjacent vertices are mapped onto integers that are at least 2 apart, and every two vertices with a common neighbour are mapped onto distinct integers. It is known that for any fixed $k\ge 4$, deciding the existence of such a labelling is an NP-complete problem while it is polynomial for $k\leq 3$. For even $k\geq 8$, it remains NP-complete when restricted to planar graphs. In this paper, we show that it remains NP-complete for any $k \ge 4$ by reduction from Planar Cubic Two-Colourable Perfect Matching. Schaefer stated without proof that Planar Cubic Two-Colourable Perfect Matching is NP-complete. In this paper we give a proof of this. },
url = {http://hal.inria.fr/inria-00360505/fr/},
pdf = {http://hal.inria.fr/docs/00/36/05/05/PDF/RR-6840.pdf} OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays={UK},
sorte = "rev-int",

}

@article{EPS+10,
author = {C. Eslahchi and H. Pezeshk and M. Sadeghi and P. Giabbanelli and F. Movahedi and V. Dabbaghian},
title = {A Probabilistic Model for the Spread of {HIV} Infection among Injection Drug Users},
journal = {World Journal of Modelling and Simulation (WJMS)},
year = {2010},
OPTkey = {},
volume = {6},
number = {4},
pages = {267-273},
month = nov,
OPTnote = {},
OPTannote = {},
abstract = {By sharing contaminated needles, injecting drug users contribute in a significant manner to the spread of the human immunodeficiency virus (HIV) in Asia and in some European countries. Furthermore, injecting drug users may also be sex workers, and risky sexual activities allow the virus to spread to other parts of the population. Mathematical models of needle sharing have been used to evaluate the success of needle exchange programs, and have led to advances such as new legislations. We use epidemiological classes to model how injecting drug users may start or cease sharing needles under social influences, and may become infected with HIV when sharing. Numerous models based on epidemiological classes were proposed regarding several aspects of HIV, and were commonly studied by differential equations. We instead show how to analyze the theoretical behaviour of the model using the technique of discrete Markov chains. Using simulations, we observed that the prevalence of HIV depended very little on the probability of transmission of HIV when sharing a needle, but almost only on the encouragement and discouragement regarding needle sharing in the community. By measuring the cost of resources required to decrease factors encouraging needle sharing and to increase discouraging ones, our model could be refined to provide an estimate of the expected prevalence of HIV among injecting drug users.},
pdf= {http://www.worldacademicunion.com/journal/1746-7233WJMS/wjmsvol06no04paper03.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@article{Fer10,
author = {Ferreira, A.},
title = {Uma estrat{\'e}gia face {\`a} Revolu{\c{c}}{\~a}o Digital},
journal = {Teoria e Debate},
year = {2010},
OPTkey = {},
volume = {87},
OPTnumber = {},
pages = {20-23},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
publisher = {Editora Funda{\c{c}}{\~a}o Perseu Abramo},
abstract = {A revolu{\c{c}}{\~a}o digital {\'e} o principal motor do atual ritmo acelerado do progresso cient{\'\i}fico e da inova{\c{c}}{\~a}o. O poder criativo e a produtividade tecnol{\'o}gica dos indiv{\'\i}duos est{\~a}o sendo ativados em propor{\c{c}}{\~o}es antes desconhecidas, produzindo ininterruptamente novos produtos e processos, em quase todas as {\'a}reas do conhecimento humano. O Information Economy Report 2007-2008 da CNUCED detalha como a ind{\'u}stria das Tecnologias da Informa{\c{c}}{\~a}o e da Comunica{\c{c}}{\~a}o (TIC) cresce mais rapidamente do que muitas ind{\'u}strias a n{\'\i}vel mundial. Atualmente, o setor das TIC representa cerca de 7\% do PIB mundial e emprega mais de 15 milh{\~o}es de pessoas nos pa{\'\i}ses da OECD. Em dados de 2007, as receitas mundiais das 250 maiores empresas em TIC atingiram 3,8 trilh{\~o}es de d{\'o}lares. Como afirmado por Kofi Annan, antigo Secret{\'a}rio-Geral das Na{\c{c}}{\~o}es Unidas: \"Se o mundo pretende seriamente alcan{\c{c}}ar o Objectivo de Desenvolvimento do Mil{\^e}nio de reduzir em metade o n{\'u}mero de pessoas vivendo em extrema pobreza at{\'e} o ano de 2015, as TIC devem figurar proeminentemente neste esfor{\c{c}}o. Todos – governos, sociedade civil e as empresas do setor privado – devem ajudar a fomentar oportunidades na era digital e colocar as TIC ao servi{\c{c}}o do desenvolvimento.\" Surpreendentemente, por{\'e}m, mesmo se tal contribui{\c{c}}{\~a}o enorme do setor econ{\^o}mico das TIC ao PIB mundial {\'e} bem compreendida e reconhecida, o impacto real de todas as Ci{\^e}ncias e Tecnologias da Computa{\c{c}}{\~a}o e da Comunica{\c{c}}{\~a}o como facilitadoras e catalisadoras da inova{\c{c}}{\~a}o e do progresso em outros setores econ{\^o}micos e outras disciplinas cient{\'\i}ficas, como a gen{\^o}mica por exemplo, que tamb{\'e}m impactam a sociedade, {\'e} largamente ignorado. Neste artigo proponho-me a mostrar a import{\^a}ncia de um posicionamento estrat{\'e}gico em rela{\c{c}}{\~a}o {\`a} revolu{\c{c}}{\~a}o digital, informado por atividades multidisciplinares de prospectiva.},

}

@article{FGM09,
author = {Ferreira, A. and Goldman, A. and Monteiro, J.},
OPTauthor = {Ferreira, Afonso and Goldman, Alfredo and Monteiro, Julian},
title = {Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs},
journal = {Wireless Networks},
volume = {16},
number = {3},
year = {2010},
issn = {1022-0038},
pages = {627--640},
doi = {http://dx.doi.org/10.1007/s11276-008-0158-6},
abstract = { The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks’ dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model—the evolving graphs—was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad hoc routing protocols (AODV, DSR, OLSR and DSDV). Interestingly, our experiments show that evolving graphs have the potential to be an effective and powerful tool in the development and analysis of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive algorithms. We also discuss such issues in this paper, as a result of our experience.},
url = {http://www.springerlink.com/content/c82014477847t646},
OPTx-editorial-board={yes},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/FGM09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte="rev-int" 
}

@article{FMM+10,
sorte = "rev-int",
author = {M. Flammini and G. Monaco and L. Moscardelli and H. Shachnai and M. Shalom and T. Tamir and S. Zaks},
title = {Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks},
year = {2010},
journal = {Theoretical Computer Science},
volume = {411},
number = {40-42},
pages = {3553-3562},
month = sep,
abstract = {We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of $n$ jobs $\mathcal{J}= \{J_1, \ldots , J_n \}$. Each job, $J_j$, is associated with an interval $[s_j, c_j]$ along which it should be processed. Also given is the parallelism parameter $g \ge 1$, which is the maximal number of jobs that can be processed simultaneously by a single machine. Each machine operates along a contiguous time interval, called its {\em busy interval}, which contains all the intervals corresponding to the jobs it processes. The goal is to assign the jobs to machines such that the total busy time of the machines is minimized. The problem is known to be NP-hard already for $g=2$. We present a $4$-approximation algorithm for general instances, and approximation algorithms with improved ratios for instances with bounded lengths, for instances where any two intervals intersect, and for instances where no interval is properly contained in another. Our study has important application in optimizing the switching costs of optical networks.},
doi = {http://dx.doi.org/10.1016/j.tcs.2010.05.011},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@article{FGK+10,
author = {F. V. Fomin and P. A. Golovach and J. Kratochvil and N. Nisse and K. Suchan},
title = {Pursuing a fast robber on a graph},
journal = {Theoretical Computer Science},
volume = {411},
number = {7-9},
year = {2010},
pages = {1167-1181},
abstract = {The Cops and Robbers game as originally defined independently by Quillot and by Nowakowski and Winkler in the 1980â??s has been much studied, but very few results pertain to algorithmic and complexity aspects of it. In this paper we prove that computing the minimum number of cops that are guaranteed too catch a robber on a given graph is NP-hard and that the parametrized version of the problem is W[2]-hard; the proof extends to the case where the robber moves s time faster than the cops. We show that on split graphs, the problem is polynomially solvable if s=1 but is NP-hard if s=2. We further prove that on graphs of bounded cliquewidth the problem is polynomially solvable for s<=2. Finally, we show that for planar graphs the minimum number of cops is unbounded if the robber is faster than the cops.},
url = {http://dx.doi.org/10.1016/j.tcs.2009.12.010},
pdf = {http://dx.doi.org/10.1016/j.tcs.2009.12.010},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
x-pays ={NO,CZ,CL},
sorte = "rev-int",

}

@article{HKS+10,
author = {F. Havet and D. Kr\'al and J.-S. Sereni and R. {\v{S}}krekovski},
title = {Facial coloring using {H}all's theorems},
journal = {European Journal of Combinatorics},
volume = {31},
pages={1001--1019},
year = {2010},
url = {http://dx.doi.org/10.1137/060664124},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/HKS+10.pdf},
abstract = {A vertex coloring of a plane graph is $\ell$-facial if every two distinct vertices joined by a facial walk of length at most $\ell$ receive distinct colors. It has been conjectured that every plane graph has an $\ell$-facial coloring with at most $3\ell+1$ colors. We improve the currently best known bound and show that every plane graph has an $\ell$-facial coloring with at most $\lfloor 7\ell/2\rfloor+6$ colors. Our proof uses the standard discharging technique, however, in the reduction part we have successfully applied Hall's Theorem, which seems to be quite an innovative approach in this area.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {SI,CZ},
sorte = "rev-int",

}

@article{molle:2010:inria-00629556:1,
AUTHOR = {Molle, C.},
TITLE = {{Optimization of the Capacity of Wireless Mesh Networks}},
JOURNAL = {{4OR: A Quarterly Journal of Operations Research}},
PUBLISHER = {Springer Berlin / Heidelberg},
VOLUME = {8},
NUMBER = {4},
PAGES = {425-428},
YEAR = {2010},
MONTH = Dec,
DOI = {10.1007/s10288-010-0132-x},
URL = {http://hal.inria.fr/inria-00629556/en} 
}

@article{molle:2010:inria-00629560:1,
AUTHOR = {Molle, C. and Voge, M-E.},
TITLE = {{A quantitative analysis of the capacity of wireless mesh networks}},
JOURNAL = {{IEEE Communications Letters}},
PUBLISHER = {IEEE},
VOLUME = {14},
NUMBER = {5},
PAGES = {438-440},
YEAR = {2010},
MONTH = May,
DOI = {10.1109/LCOMM.2010.05.100028},
URL = {http://hal.inria.fr/inria-00629560/en} 
}

@article{RTV10,
author = {H. Rivano and F. Theoleyre and F. Valois},
title = {A Framework for the Capacity Evaluation of Multihop Wireless Networks},
journal = {Ad Hoc and Sensor Wireless networks (AHSWN)},
volume = {9},
number = {3-4},
pages = {139-162},
year = {2010},
abstract = {The specific challenges of multihop wireles networks lead to a strong research effort on efficient protocols design where the offered capacity is a key objective. More specifically, routing strategy largely impacts the network capacity, i.e. the throughput offered to each flow. In this work, we propose a complete framework to compute the upper and the lower bounds of the network capacity according to a physical topology and a given routing protocol. The radio resource sharing principles of CSMA-CA is modeled as a set of linear constraints with two models of fairness. The first one assumes that nodes have a fair access to the channel, while the second one assumes that on the radio links. We then develop a pessimistic and an optimistic scenarios for radio resource sharing, yielding a lower bound and an upper bound on the network capacity for each fairness case. Our approach is independent of the network topology and the routing protocols, and provides therefore a relevant framework for their comparison. We apply our models to a comparative analysis of a well-known flat routing protocol OLSR against two main self-organized structure approaches, VSR and localized CDS.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/Herve.Rivano/Biblio/rtv09.pdf},
OPTnote = {Accepted for publications : march 19th 2009. To be published},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@ARTICLE{SaTh10,
sorte = "rev-int",
AUTHOR = {I. Sau and D. M. Thilikos},
TITLE = {Subexponential Parameterized Algorithms for Degree-constrained Subgraph Problems on Planar Graphs},
JOURNAL = {Journal of Discrete Algorithms},
volume = {8},
number = {3},
pages = {330-338},
YEAR = {2010},
month = sep,
ABSTRACT = {We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounded maximum degree and with maximum number of edges (or vertices). These problems are natural generalisations of the \textsc{Longest Path} problem. Our approach uses bidimensionality theory combined with novel dynamic programming techniques over branch decompositions of the input graph. These techniques can be applied to a more general family of problems that deal with finding connected subgraphs under certain degree constraints.},
url = {http://dx.doi.org/10.1016/j.jda.2010.02.002},
PDF = {http://www.cs.technion.ac.il/~ignasi/Pubs/SaTh10.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {GR,ES},

}

@inproceedings{ACC+10,
author = {Alvarez-Miranda, E. and Candia, A. and Chen, X. and Hu, X. and Li, B. },
title = {Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data},
booktitle = {Proceedings of the 6th International Conference on Algorithmic Aspects in Information and Management (AAIM)},
address ={Weihai, China},
month =jul,
year = {2010},
volume = {6124},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
pages = {13-24},
x-editorial-board={yes},
x-proceedings={yes},
x-international-audience={yes},
x-pays = {CL,CN},
URL-HAL = {},
X-ID-HAL = {},
abstract = {Given a graph $G=(V,E)$ with a cost on each edge in $E$ and a prize at each vertex in $V$, and a target set $V'\subseteq V$, the Prize Collecting Steiner Tree (PCST) problem is to find a tree $T$ interconnecting vertices in $V'$ that has minimum total costs on edges and maximum total prizes at vertices in $T$. This problem is NP-hard in general, and it is polynomial-time solvable when graphs $G$ are restricted to 2-trees. In this paper, we study how to deal with PCST problem with uncertain costs and prizes. We assume that edge $e$ could be included in $T$ by paying cost $x_e\in[c_e^-,c_e^+]$ while taking risk $\frac{ c_e^+-x_e}{ c_e^+-c_e^-}$ of losing $e$, and vertex $v$ could be awarded prize $p_v\in [p_v^-,p_v^+]$ while taking risk $\frac{ y_v-p_v^-}{p_v^+-p_v^-}$ of losing the prize. We establish two risk models for the PCST problem, one minimizing the maximum risk over edges and vertices in $T$ and the other minimizing the sum of risks. Both models are subject to upper bounds on the budget for constructing a tree. We propose two polynomial-time algorithms for these problems on 2-trees, respectively. Our study shows that the risk models have advantages over the tradional robust optimization model, which yields NP-hard problems even if the original optimization problems are polynomial-time solvable. },
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/ACC+10.pdf},
url = {http://dx.doi.org/10.1007/978-3-642-14355-7_3},
sorte = "conf-int",

}

@inproceedings{ASL10,
author = {Araujo, J. and Linhares Sales, C. and Sau, I.},
title = {Weighted Coloring on $P_4$-sparse Graphs},
booktitle = {11es Journ\'{e}es Doctorales en Informatique et R\'{e}seaux (JDIR 2010)},
pages = {33--38},
year = {2010},
address = {Sophia Antipolis, France},
month = mar,
abstract = {Given an undirected graph G = (V, E) and a weight function w : V → R+, a vertex coloring of G is a partition of V into independent sets, or color classes. The weight of a vertex coloring of G is defined as the sum of the weights of its color classes, where the weight of a color class is the weight of a heaviest vertex belonging to it. In the WEIGHTED COLORING problem, we want to determine the minimum weight among all vertex colorings of G [1]. This problem is NP-hard on general graphs, as it reduces to determining the chromatic number when all the weights are equal. In this article we study the WEIGHTED COLORING problem on P4-sparse graphs, which are defined as graphs in which every subset of five vertices induces at most one path on four vertices [2]. This class of graphs has been extensively studied in the literature during the last decade, and many hard optimization problems are known to be in P when restricted to this class. Note that cographs (that is, P4-free graphs) are P4-sparse, and that P4-sparse graphs are P5-free. The WEIGHTED COLORING problem is in P on cographs [3] and NP-hard on P5-free graphs [4]. We show that WEIGHTED COLORING can be solved in polynomial time on a subclass of P4-sparse graphs that strictly contains cographs, and we present a 2-approximation algorithm on general P4-sparse graphs. The complexity of WEIGHTED COLORING on P4- sparse graphs remains open.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/ASL10.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays={FR},
sorte = "conf-nat",

}

@inproceedings{BeBu10,
author = {Beauquier, J. and Burman, J.},
title = {Self-stabilizing Synchronization in Mobile Sensor Networks with Covering},
booktitle = {Distributed Computing in Sensor Systems, 6th IEEE International Conference, DCOSS 2010},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {6131},
year = {2010},
pages = {362-378},
abstract = {Synchronization is widely considered as an important service in distributed systems which may simplify protocol design. \emph{Phase clock} is a general synchronization tool that provides a form of a logical time. This paper presents a \emph{self-stabilizing} (a tolerating state-corrupting transient faults) phase clock algorithm suited to the model of \emph{population protocols with covering}. This model has been proposed recently for sensor networks with a very large, possibly \emph{unknown} number of \emph{anonymous} mobile agents having \emph{small memory}. Agents interact in pairs in an \emph{asynchronous} way subject to the constraints expressed in terms of the \emph{cover times} of agents. The cover time expresses the ``frequency'' of an agent to communicate with all the others and abstracts agent's communication characteristics (e.g. moving speed/patterns, transmitting/receiving capabilities). We show that a phase clock is impossible in the model with only constant-state agents. Hence, we assume an existence of resource-unlimited agent - the base station. The clock size and duration of each phase of the proposed phase clock tool are adjustable by the user. We provide application examples of this tool and demonstrate how it can simplify the design of protocols. In particular, it yields a solution to Group Mutual Exclusion problem.},
pdf = {http://dx.doi.org/10.1007/978-3-642-13651-1_26},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int" 
}

@inproceedings{BBC+10,
author = {Beauquier, J. and Burman, J. and Clement, J. and Kutten, S.},
title = {On Utilizing Speed in Networks of Mobile Agents},
booktitle = {Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010},
publisher = {ACM},
year = {2010},
pages = {305-314},
abstract = {Population protocols are a model presented recently for networks with a very large, possibly unknown number of mobile agents having small memory. This model has certain advantages over alternative models (such as DTN) for such networks. However, it was shown that the computational power of this model is limited to semi-linear predicates only. Hence, various extensions were suggested. We present a model that enhances the original model of population protocols by introducing a (weak) notion of speed of the agents. This enhancement allows us to design fast converging protocols with only weak requirements (for example, suppose that there are different types of agents, say agents attached to sick animals and to healthy animals, two meeting agents just need to be able to estimate which of them is faster, e.g., using their types, but not to actually know the speeds of their types). Then, using the new model, we study the gathering problem, in which there is an unknown number of anonymous agents that have values they should deliver to a base station (without replications). We develop efficient protocols step by step searching for an optimal solution and adapting to the size of the available memory. The protocols are simple, though their analysis is somewhat involved. We also present a more involved result - a lower bound on the length of the worst execution for any protocol. Our proofs introduce several techniques that may prove useful also in future studies of time in population protocols.},
pdf = {http://doi.acm.org/10.1145/1835698.1835775},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {IL},
sorte = "conf-int" 
}

@inproceedings{BMM+10,
author = {J-C. Bermond and D. Mazauric and V. Misra and P. Nain},
title = {A Distributed Scheduling Algorithm for Wireless Networks with Constant Overhead and Arbitrary Binary Interference},
booktitle = {SIGMETRICS 2010},
year = {2010},
publisher = {ACM},
pages = {2p},
url={},
pdf = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BMMN10.pdf},
abstract = {This work investigates distributed transmission scheduling in wireless networks. Due to interference constraints, "neighboring links" cannot be simultaneously activated, otherwise transmissions will fail. Here, we consider any binary model of interference. We follow the model described by Bui, Sanghavi, and Srikant in SBS07,SBS09. We suppose that time is slotted and during each slot we have two phases: one control phase which determines what links will be activated and send data during the second phase. We assume random arrivals on each link during each slot, therefore a queue is associated to each link. Since nodes do not have a global knowledge of the network, our aim (like in SBS07,SBS09) is to design for the control phase, a distributed algorithm which determines a set of non interfering links. To be efficient the control phase should be as short as possible; this is done by exchanging control messages during a constant number of mini-slots (constant overhead). In this article we design the first fully distributed local algorithm with the following properties: it works for any arbitrary binary interference model; it has a constant overhead (independent of the size of the network and the values of the queues); and it needs no knowledge. Indeed contrary to other existing algorithms, we do not need to know the values of the queues of the "neighboring links", which are difficult to obtain in a wireless network with interference. We prove that this algorithm gives a maximal set of active links (in each interference set, there is at least one active edge). We also give sufficient conditions for stability under Markovian assumptions. Finally the performance of our algorithm (throughput, stability) is investigated and compared via simulations to that of previously proposed schemes.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{HCN+10,
author = {C. Caillouet and F. Huc and N. Nisse and S. P\'erennes and H. Rivano},
title = {Stability of a localized and greedy routing algorithm},
booktitle = {12th Workshop on Advances in Parallel and Distributed Computational Models},
OPTcrossref = {},
OPTkey = {},
pages = {8p},
year = {2010},
publisher = {IEEE},
OPTnote = {to appear},
OPTannote = {},
url = {http://hal.inria.fr/inria-00331807},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/HCN+10.pdf},
abstract = {In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local algorithm that transmits packets hop by hop in the network and study its behavior. At each step, a node transmits its queued packets to its neighbors in order to optimize a local gradient. This protocol is greedy since it does not require to record the history about the past actions, and localized since nodes only need information about their neighborhood. A transmission protocol is \emph{stable} if the number of packets in the network does not diverge. To prove the stability, it is sufficient to prove that the number of packets stored in the network remains bounded as soon as the sources inject a flow that another method could have exhausted. The localized and greedy protocol considered has been shown to be stable in some specific cases related to the arrival rate of the packets. We investigate its stability in a more general context and therefore reinforce results from the literature that worked for differentiated suboptimal flows. We show that, to prove the stability of this protocol, it is sufficient to prove the intuitive following conjecture: roughly, if the protocol is stable when all sources inject the maximum number of packets at each turn and no packets are lost, then the protocol is stable whatever be the behavior of the network (i.e., when less packets are injected and some of them may be lost).},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{CPR10,
author = {C. Caillouet and S. Perennes and H. Rivano},
title = {Cross line and column generation for the cut covering problem in wireless networks},
booktitle = {International Symposium on Combinatorial Optimization (ISCO)},
year = {2010},
pages = {8p},
month = mar,
note = {To appear},
url = {http://www.lamsade.dauphine.fr/~isco/},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/CPR10.pdf},
abstract = {In this paper, we address the problem of bandwidth allocation and routing in wire- less networks. A first model of this problem is known as the Round Weighting Problem (RWP) in which a weight is assigned to the set of rounds, i.e. a set of pairwise non-interfering links. We present a new formulation that forgets about the routing and concentrate on the capacity available on the network cuts. We use the maximum flow/minimum cut theorem known in graph theory to develop the Cut Covering Problem (CCP) and prove that it computes equivalent optimal round weights than RWP. We develop a primal/dual algorithm combining line and column generation to deal with the exponential number of variables and constraints of CCP.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{CGM+10c,
author = {S. Caron and F. Giroire and D. Mazauric and J. Monteiro and S. P\'erennes},
title = { Data Life Time for Different Placement Policies in P2P Storage Systems},
booktitle = {Proceedings of the 3rd Intl. Conference on Data Management in Grid and P2P Systems (Globe)},
abstract = {Peer-to-peer systems are foreseen as an efficient solution to achieve reliable data storage at low cost. To deal with common P2P problems such as peer failures or churn, such systems encode the user data into redundant fragments and distribute them among peers. The way they distribute it, known as placement policy, has a significant impact on their behavior and reliability. In this paper, we study the impact of different placement policies on the data life time. More precisely, we describe methods to compute and approximate the mean time before the system loses data (Mean Time to Data Loss). We compare this metric for three placement policies: two of them local, in which the data is stored in logical peer neighborhoods, and one of them global in which fragments are parted uniformly at random among the different peers.},
year = {2010},
pages = {75--88},
address = {Bilbao, Spain},
volume = {6265},
series = {Lecture Notes in Computer Science},
month = sep,
audience = {internationale },
keywords = {{P2P} storage system;data placement;performance;data durability;{M}arkov chain model},
language = {{A}nglais},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/CGM+10c.pdf},
OPTx-editorial-board = {yes},
OPTx-international-audience = {yes},
OPTx-proceedings = {yes},
sorte = {conf-int},

}

@inproceedings{CGM+10b,
title = { {P}2{P} {S}torage {S}ystems: {D}ata {L}ife {T}ime for {D}ifferent {P}lacement {P}olicies},
author = {Caron, S. and Giroire, F. and Mazauric, D. and Monteiro, J. and P\'erennes, S.},
abstract = {{L}es syst{\`e}mes pair-{\`a}-pair {\`a} grande {\'e}chelle repr{\'e}sentent un moyen fiable pour stocker des donn{\'e}es {\`a} faible co{\^u}t. {A}fin d'assurer la p{\'e}rennit{\'e} des donn{\'e}es des utilisateurs, il est n{\'e}cessaire d'ajouter de la redondance. {A}insi {\`a} partir de s fragments initiaux composant un bloc de donn{\'e}es, s+r fragments sont g{\'e}n{\'e}r{\'e}s et r{\'e}partis entre les pairs du r{\'e}seau. {N}ous {\'e}tudions dans ce papier l'impact des diff{\'e}rentes politiques de placement sur la dur{\'e}e de vie des donn{\'e}es. {P}lus particuli{\`e}rement nous d{\'e}crivons des m{\'e}thodes pour calculer et approximer le temps moyen avant que le syst{\`e}me perde une donn{\'e}e ({M}ean {T}ime to {D}ata {L}oss). {N}ous comparons cette m{\'e}trique pour trois politiques de placement: deux sont locales, distribuant les fragments sur des voisins logiques, et la troisi{\`e}me est globale.},
keywords = {{P}2{P} storage system;data placement;performance;data durability;{M}arkov chain model},
language = {{A}nglais},
affiliation = {{MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 - {MAESTRO} - {INRIA} {S}ophia {A}ntipolis - {INRIA} - {U}niversit{\'e} {M}ontpellier {II} - {S}ciences et {T}echniques du {L}anguedoc },
booktitle = {12{\`e}mes {R}encontres {F}rancophones sur les {A}spects {A}lgorithmiques de {T}{\'e}l{\'e}communications ({A}lgo{T}el)},
pages = {4p},
address = {{B}elle {D}une {F}rance },
editor = {{M}aria {G}radinariu {P}otop-{B}utucaru et {H}erv{\'e} {R}ivano },
audience = {internationale },
year = {2010},
url = {http://hal.inria.fr/inria-00479537/en/},
pdf = {http://hal.inria.fr/inria-00479537/PDF/placement-algotel2010-finale.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-nat",

}

@inproceedings{CCN+10b,
author = {J. Chalopin and V. Chepoi and N. Nisse and Y. Vaxes},
title = {Cop and robber games when the robber can hide and ride},
booktitle = {8th French Combinatorial Conference},
year = {2010},
address = {Orsay},
month = jun,
note = {selection on abstract},
abstract = {In the classical cop and robber game, two players, the cop C and the robber R, move alternatively along edges of a finite graph G = (V , E). The cop captures the robber if both players are on the same vertex at the same moment of time. A graph G is called cop win if the cop always captures the robber after a finite number of steps. Nowakowski, Winkler (1983) and Quilliot (1983) characterized the cop-win graphs as dismantlable graphs. In this talk, we will characterize in a similar way the class CWFR(s, s') of cop-win graphs in the game in which the cop and the robber move at different speeds s' and s, s' ? s. We also establish some connections between cop-win graphs for this game with s'< s and Gromov’s hyperbolicity. In the particular case s' = 1 and s = 2, we prove that the class of cop-win graphs is exactly the well-known class of dually chordal graphs. We show that all classes CWFR(s,1), s ? 3, coincide and we provide a structural characterization of these graphs. We also investigate several dismantling schemes necessary or sufficient for the cop-win graphs (which we call k-winnable and denote by CWW(k)) in the game in which the robber is visible only every k moves for a fixed integer k > 1. We characterize the graphs which are k-winnable for any value of k.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-sa",

}

@inproceedings{CCM+10b,
title = { {T}radeoffs in routing reconfiguration problems},
OPTauthor = {{C}ohen, {N}athann and {C}oudert, {D}avid and {M}azauric, {D}orian and {N}epomuceno, {N}apole{\~a}o and {N}isse, {N}icolas},
author = {Cohen, N. and Coudert, D. and Mazauric, D. and Nepomuceno, N. and Nisse, N.},
abstract = {{N}ous {\'e}tudions le probl{\`e}me du reroutage d'un ensemble de connexion dans un r{\'e}seau. {I}l consiste {\`a} passer d'un routage initial (ensemble de chemins reliant des paires de noeuds) {\`a} un autre, en traitant s{\'e}quentiellement chaque connexion. {I}l est parfois indispensable d'en interrompre temporairement certaines au cours du processus de reconfiguration, ce qui nous am{\`e}ne {\`a} {\'e}tudier les compromis possibles entre deux mesures d'efficacit{\'e} : le nombre total de connexions interrompues et le nombre maximum de connexions interrompues simultan{\'e}ment. {N}ous prouvons qu'{\'e}tablir de tels compromis m{\`e}ne {\`a} des probl{\`e}mes {NP}-complets et difficiles {\`a} approcher ({APX}-difficiles voir non {APX}). {N}ous montrons ensuite que de bons compromis sont impossibles en g{\'e}n{\'e}ral. {E}nfin, nous exhibons une classe d'instances de reroutage pour laquelle il est possible de minimiser le nombre de requ{\^e}tes interrompues simultan{\'e}ment sans "trop" augmenter le nombre total de connexions interrompues. {C}es r{\'e}sultats sont obtenus en mod{\'e}lisant ce probl{\`e}me par un jeu {\`a} l'aide d'agents mobiles.},
language = {{A}nglais},
booktitle = {12{\`e}mes {R}encontres {F}rancophones sur les {A}spects {A}lgorithmiques de {T}{\'e}l{\'e}communications ({A}lgo{T}el)},
pages = {4p},
address = {{B}elle {D}une {F}rance },
editor = {{M}aria {G}radinariu {P}otop-{B}utucaru et {H}erv{\'e} {R}ivano },
audience = {internationale },
year = {2010},
URL = {http://hal.inria.fr/inria-00477413/en/},
PDF = {http://hal.inria.fr/inria-00477413/PDF/algotel.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-nat",

}

@inproceedings{CCM+10,
author = {N. Cohen and D. Coudert and D. Mazauric and N. Nepomuceno and N. Nisse},
title = {Tradeoffs in process strategy games with application in the {WDM} reconfiguration problem},
booktitle = {Fifth International conference on Fun with Algorithms (FUN 2010)},
year = {2010},
pages = {121-132},
publisher = {Springer},
editor = {P. Boldi and L. Gargano},
volume = {6099},
series = {Lecture Notes in Computer Science},
address = {Ischia Island, Italy},
month = jun,
note = {http://hal.inria.fr/inria-00495443},
url = {http://dx.doi.org/10.1007/978-3-642-13122-6_14},
ee = {http://dx.doi.org/10.1007/978-3-642-13122-6_14},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CCM+10.pdf},
ABSTRACT = {We consider a variant of the graph searching games that is closely related to the routing reconfiguration problem in WDM networks. In the digraph processing game, a team of agents is aiming at clearing, or processing, the vertices of a digraph D. In this game, two important measures arise: 1) the total number of agents used, and 2) the total number of vertices occupied by an agent during the processing of D. Previous works have studied the problem of minimizing each of these parameters independently. In particular, both of these optimization problems are not in APX. In this paper, we study the tradeoff between both these conflicting objectives. More precisely, we prove that there exist some instances for which minimizing one of these objectives arbitrarily impairs the quality of the solution for the other one. We show that such bad tradeoffs may happen even in the case of basic network topologies. On the other hand, we exhibit classes of instances where good tradeoffs can be achieved. We also show that minimizing one of these parameters while the other is constrained is not in APX.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {BR},
sorte = "conf-int",

}

@inproceedings{Cou10b,
author = {D. Coudert},
title = {Graph searching games for the {WDM} reconfiguration problem},
OPTcrossref = {},
OPTkey = {},
booktitle = {24th European Conference on Operational Research (EURO)},
pages = {1p},
year = {2010},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
address = {Lisbon, Portugal},
month = jul,
OPTorganization = {},
OPTpublisher = {},
note = {Invited talk},
OPTannote = {},
url = {http://hal.inria.fr/inria-00482113},
abstract = {The routing reconfiguration problem in WDM networks is to schedule the switching's of a set of lightpaths from one routing to a new predetermined one. This problem is modeled as a digraph processing game, closely related to graph searching games, in which a team of agents is aiming at clearing, or processing, the vertices of a digraph. In this talk, we will survey the main results on digraph processing games, and in particular the complexity and hardness of optimizing tradeoffs between the total number of agents used and the total number of vertices occupied by an agent during the strategy},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "inv-conf",

}

@inproceedings{GAD+10,
author = {P. Giabbanelli and A. Alimadad and V. Dabbaghian and D. T. Finegood},
title = {Modeling the influence of social networks and environment on energy balance and obesity},
booktitle = {XI International Conference on Obesity (ICO)},
month = jul,
year = {2010},
note = {Acceptance rate 8.6%},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{GMB10,
author={P. Giabbanelli and D. Mazauric and J-C. Bermond},
title="Average path length of deterministic and stochastics recursive networks",
year={2010},
booktitle={Proceedings of the 2nd Workshop on Complex Networks (CompleNet)},
publisher={Springer-Verlag},
series={Communications in Computer and Information Science (CCIS)},
volume = {116},
pages={1--12},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
PDF={ftp://ftp-sop.inria.fr/mascotte/Publications/GMB10.pdf},
sorte = "conf-int",
abstract = {The average shortest path distance between all pairs of nodes in real-world networks tends to be small compared to the number of nodes. Providing a closed-form formula for remains challenging in several network models, as shown by recent papers dedicated to this sole topic. For example, Zhang et al. proposed the deterministic model ZRG and studied an upper bound on . In this paper, we use graph-theoretic techniques to establish a closed-form formula for in ZRG. Our proof is of particular interests for other network models relying on similar re- cursive structures, as found in fractal models. We extend our approach to a stochastic version of ZRG in which layers of triangles are added with probability p. We find a first-order phase transition at the critical probability pc = 0.5, from which the expected number of nodes becomes infinite whereas expected distances remain finite. We show that if tri- angles are added independently instead of being constrained in a layer, the first-order phase transition holds for the very same critical probabil- ity. Thus, we provide an insight showing that models can be equivalent, regardless of whether edges are added with grouping constraints. Our detailed computations also provide thorough practical cases for readers unfamiliar with graph-theoretic and probabilistic techniques.},

}

@inproceedings{GMP10,
title = { {C}omputing the average path length and a label-based routing in a small-world graph},
author = {Giabbanelli, P. and Mazauric, D. and P\'erennes, S.},
abstract = {{W}e study two characteristics of a small-world graph proposed by {Z}hang et al. to model complex networks. {O}ur study relies on the recursive structure of the graph. {F}irstly, we use it to design a labelling scheme in order to create an implicit routing (i.e., a routing scheme based on the label of vertices). {S}econdly, proving the average distance in this graph was arduous, thus {Z}hang et al. chose to study the diameter: we establish a closed-form formula of the average distance, proved using the recursive structure. {T}hus, we characterize that the graph is small-world and not ultra small-world as was still possible. {O}ur proof is of particular interest for other graphs based on similar recursive structures.},
keywords = {{R}ecursive graph; {L}abeling scheme; {D}ecentralized routing},
language = {{A}nglais},
affiliation = {{MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 - {MAESTRO} - {INRIA} {S}ophia {A}ntipolis - {INRIA} - {U}niversit{\'e} {M}ontpellier {II} - {S}ciences et {T}echniques du {L}anguedoc },
booktitle = {12{\`e}mes {R}encontres {F}rancophones sur les {A}spects {A}lgorithmiques de {T}{\'e}l{\'e}communications (AlgoTel'10)},
pages = {4p },
address = {{B}elle {D}une {F}rance },
year = {2010},
url = {http://hal.archives-ouvertes.fr/inria-00472215/en/},
pdf = {http://hal.archives-ouvertes.fr/inria-00472215/PDF/algotel.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "conf-nat",

}

@inproceedings{Gia10b,
author = "P. Giabbanelli",
title="Impact of complex network properties on routing in backbone networks",
year={2010},
booktitle={Proceedings of the IEEE Globecom 2010 Workshop on Complex and Communication Networks (CCNet 2010)},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/gia10b.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",
abstract= { The properties found in complex networks (e.g., small-world, scale-free) have been used to characterize the behaviour of several processes such as epidemics or oscillators. We analyze the impact of such properties on the quality of a routing process. Using a Mixed Integer/Linear Program, the routing minimizes the number of ports installed in the network. Ports are network components which we use as a simplification of the capital cost in communication networks. Using data mining techniques, we are able to predict the minimal number of ports of a network with small error rate given the network’s properties and under the assumption of a realistic traffic distribution. We find that the average betweenness and the average path length are good indicators of the number of ports. We then present exploratory work on the dynamic aspects by considering that nodes join the network, which corresponds to the deployment of communication equipment. We consider several approaches to deploy the equipment, and report on the number of ports for each approach. By comparing approaches, having less edges can still yield better performances which motivates investigations on the design. Furthermore, this dynamic case confirms the static one since a tradeoff between the average betweenness and the average path length seems to be a key element in efficient designs. },

}

@inproceedings{GMM10b,
title = {Minimizing Routing Energy Consumption: from Theoretical to Practical Results},
author = {Giroire, F. and Mazauric, D. and Moulierac, J. and Onfroy, B.},
language = {Anglais},
booktitle = {IEEE/ACM International Conference on Green Computing and Communications (GreenCom'10)},
pages = {8},
address = {Hangzhou, China},
year = {2010},
abstract = {Several studies exhibit that the traffic load of the routers only has a small influence on their energy consumption. Hence, the power consumption in networks is strongly related to the number of active network elements, such as interfaces, line cards, base chassis,... The goal thus is to find a routing that minimizes the (weighted) number of active network elements used when routing. In this paper, we consider a simplified architecture where a connection between two routers is represented as a link joining two network interfaces. When a connection is not used, both network interfaces can be turned off. Therefore, in order to reduce power consumption, the goal is to find the routing that minimizes the number of used links while satisfying all the demands. We first define formally the problem and we model it as an integer linear program. Then, we prove that this problem is not in APX, that is there is no polynomial-time constant-factor approximation algorithm. We propose a heuristic algorithm for this problem and we also prove some negative results about basic greedy and probabilistic algorithms. Thus we present a study on specific topologies, such as trees, grids and complete graphs, that provide bounds and results useful for real topologies. We then exhibit the gain in terms of number of network interfaces (leading to a global reduction of approximately 33 MWh for a medium-sized backbone network) for a set of existing network topologies: we see that for almost all topologies more than one third of the network interfaces can be spared for usual ranges of operation. Finally, we discuss the impact of energy efficient routing on the stretch factor and on fault tolerance.},
pdf = {http://hal.archives-ouvertes.fr/inria-00464318/PDF/RR-7234.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{GMP10b,
title = {Peer-to-Peer Storage Systems: a Practical Guideline to be Lazy},
author = {F. Giroire and J. Monteiro and S. P\'erennes},
language = {{A}nglais},
booktitle = {Proceedings of the IEEE Global Communications Conference (GLOBECOM)},
abstract = {Distributed and peer-to-peer storage systems are foreseen as an alternative to the traditional data centers and in-house backup solutions. In the past few years many peer-to- peer storage systems have been proposed. Most of them rely on the use of erasure codes to introduce redundancy to the data. This kind of system depends on many parameters that need to be well tuned, such as the factor of redundancy, the frequency of data repair and the size of a data block. In this paper we give closed-form mathematical expressions that estimate the system average behavior. These expressions are derived from a Markov chain. Our contribution is a guideline to system designers and administrators to choose the best set of parameters. That is, how to tune the system parameters to obtain a desired level of reliability under a given constraint of bandwidth consumption. We confirm that a lazy repair strategy can be employed to amortize the repairing cost. Moreover, we propose a formula to calculate the optimal threshold value that minimizes the bandwidth consumption. Finally, we additionally discuss the impact of different system characteristics on the performance metrics, such as the number of peers, the amount of stored data, and the disk failure rate. To the best of our knowledge this is the first work to give close-form formulas to estimate the bandwidth consumption for a lazy repair, and the loss rate taking into account the repair time.},
pages={1-6},
address = {Miami, EUA},
year = {2010},
month = {12},
x-pays={FR},
url = {http://dx.doi.org/10.1109/GLOCOM.2010.5683761},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/GMP10.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{HIK+10c,
author = {N. Hanusse and D. Ilcinkas and A. Kosowski and N. Nisse},
title = {Comment battre la marche al\'eatoire en comptant ?},
booktitle = {12\`eme Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel'10)},
pages = {4p},
year = {2010},
OPTnote = {to appear},
url = {http://hal.archives-ouvertes.fr/inria-00475863/fr/},
pdf = {http://hal.archives-ouvertes.fr/docs/00/47/58/63/PDF/Menteurs-algotel2010.pdf},
abstract = {Nous \'etudions le probl\`eme consistant \`a trouver une destination t dans un r\'eseau, non fiable, gr\^ace \`a un agent mobile. Chaque noeud du r\'eseau peut donner un conseil quant au prochain sommet \`a visiter pour se rapprocher de t. Malheureusement, k noeuds, appel\'es menteurs, donnent de mauvais conseils. Il est connu que pour un graphe G de n sommets et de degr\'e maximum Delta >= 3, atteindre une cible \`a distance d de la position initiale peut demander un temps moyen de 2^{Omega(min{d,k})}, pour tout d,k=O(log n), même lorsque G est un arbre. Ce papier \'etudie une strat\'egie, appel\'ee R/A, utilisant un compteur (d'\'etapes) pour alterner entre les phases al\'eatoires (R) où l'agent choisit al\'eatoirement une arête incidente, et celles (A) où l'agent suit le conseil local. Aucune connaissance des param\`etres n, d, ou k n'est requise, et l'agent n'a pas besoin de se rappeler par quel lien il est entr\'e dans le sommet qu'il occupe. Nous \'etudions les performances de cette strat\'egie pour deux classes de graphes, extrêmes pour ce qui est de l'expansion: les anneaux et les graphes r\'eguliers al\'eatoires (une importante classe d' expanders). Pour l'anneau, l'algorithme R/A requiert un temps moyen de 2d+k^{Theta(1)} (polynomial en d et k) pour une distribution des menteurs la plus d\'efavorable. A l'oppos\'e, nous montrons que dans un anneau, une marche al\'eatoire biais\'ee requiert un temps moyen exponentiel en d et k. Pour les graphes al\'eatoires r\'eguliers, le temps de recherche moyen de l'algorithme R/A est O(k3 log3 n) a.a.s.\ Le terme polylogarithmique de cette borne ne peut pas être am\'elior\'e, puisque nous montrons une borne inf\'erieure de Omega(log n) pour d,k=Omega(log log n) dans les graphes al\'eatoires r\'eguliers a.a.s. qui s'applique même lorsque l'agent a le sens de l'orientation.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-nat",

}

@inproceedings{HIK+10b,
title = {Locating a target with an agent guided by unreliable local advice},
author = {Hanusse, {N}. and Ilcinkas, {D}. and Kosowski, {A}. and Nisse, {N}.},
booktitle = {29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'10)},
year = {2010},
publisher = {ACM},
volume = {XXXX},
pages = {10p},
note = {to appear},
url={},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/podc2010.pdf},
abstract = {{W}e study the problem of finding a destination node $t$ by a mobile agent in an unreliable network having the structure of an unweighted graph, in a model first proposed by {H}anusse {\it et al.}~\cite{{HKK}00,{HKKK}08}. {E}ach node of the network is able to give advice concerning the next node to visit so as to go closer to the target $t$. {U}nfortunately, exactly $k$ of the nodes, called \emph{liars}, give advice which is incorrect. {I}t is known that for an $n$-node graph ${G}$ of maximum degree $\{D}elta \geq 3$, reaching a target at a distance of $d$ from the initial location may require an expected time of $2^{\{O}mega(\min\{d,k\})}$, for any $d,k={O}(\log n)$, even when ${G}$ is a tree. {T}his paper focuses on strategies which efficiently solve the search problem in scenarios in which, at each node, the agent may only choose between following the local advice, or randomly selecting an incident edge. {T}he strategy which we put forward, called \algo{{R}/{A}}, makes use of a timer (step counter) to alternate between phases of ignoring advice (\algo{{R}}) and following advice (\algo{{A}}) for a certain number of steps. {N}o knowledge of parameters $n$, $d$, or $k$ is required, and the agent need not know by which edge it entered the node of its current location. {T}he performance of this strategy is studied for two classes of regular graphs with extremal values of expansion, namely, for rings and for random $\maxdeg$-regular graphs (an important class of expanders). {F}or the ring, \algo{{R}/{A}} is shown to achieve an expected searching time of $2d+k^{\{T}heta(1)}$ for a worst-case distribution of liars, which is polynomial in both $d$ and $k$. {F}or random $\maxdeg$-regular graphs, the expected searching time of the \algo{{R}/{A}} strategy is ${O}(k3 \log3 n)$ a.a.s. {T}he polylogarithmic factor with respect to $n$ cannot be dropped from this bound; in fact, we show that a lower time bound of $\{O}mega (\log n)$ steps holds for all $d,k=\{O}mega(\log\log n)$ in random $\maxdeg$-regular graphs a.a.s.\ and applies even to strategies which make use of some knowledge of the environment. {F}inally, we study oblivious strategies which do not use any memory (in particular, with no timer). {S}uch strategies are essentially a form of a random walk, possibly biased by local advice. {W}e show that such biased random walks sometimes achieve drastically worse performance than the \algo{{R}/{A}} strategy. {I}n particular, on the ring, no biased random walk can have a searching time which is polynomial in $d$ and $k$},
language = {{A}nglais},
affiliation = {{L}aboratoire {B}ordelais de {R}echerche en {I}nformatique - {L}a{BRI} - {CNRS} : {UMR}5800 - {U}niversit{\'e} {S}ciences et {T}echnologies - {B}ordeaux {I} - {E}cole {N}ationale {S}up{\'e}rieure d'{E}lectronique, {I}nformatique et {R}adiocommunications de {B}ordeaux - {U}niversit{\'e} {V}ictor {S}egalen - {B}ordeaux {II} - {CEPAGE} - {INRIA} {B}ordeaux - {S}ud-{O}uest - {INRIA} - {CNRS} : {UMR}5800 - {U}niversit{\'e} {S}ciences et {T}echnologies - {B}ordeaux {I} - {ENSEIRB} - {D}epartment of {A}lgorithms and {S}ystem {M}odeling - {G}dansk {U}niversity of {T}echnology - {MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 },
x-pays = {PL},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{HaSa10,
author = {F. Havet and L. Sampaio},
title = {On the Grundy number of a graph},
booktitle = {Proceedings of the International Symposium on Parameterized and Exact Computation(IPEC)},
number = {6478},
series = {Lecture Notes on Computer science},
pages = {170-179},
year = {2010},
month = dec,
abstract = {The Grundy number of a graph $G$, denoted by $\Gamma (G)$, is the largest $k$ such that $G$ has a greedy $k$-colouring, that is a colouring with $k$ colours obtained by applying the greedy algorithm according to some ordering of the vertices of $G$. Trivially $\Gamma(G)\leq \Delta(G)+1$. In this paper, we show that deciding if $\Gamma(G)\leq \Delta(G)$ is NP-complete. We then show that deciding if $\Gamma(G)\geq |V(G)|-k$ is fixed parameter tractable with respect to the parameter $k$.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/HaSa10.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {BR},
sorte = "conf-int",

}

@inproceedings{HPT+10,
author = {L. Hogie and D. Papadimitriou and I. Tahiri and F. Majorczyk},
title = {Simulating routing schemes on large-scale topologies},
booktitle = {24th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation (PADS)},
pages = {8p},
year = {2010},
address = {Atlanta},
month = {May},
abstract = {The expansion of the Internet routing system results in a number of research challenges, in particular, the Border Gateway Protocol (BGP) starts to show its limits a.o. in terms of the number of routing table entries it can dynamically process and control. Dynamic routing protocols showing better scaling properties are thus under investigation. However, because deploying under-development routing protocols on the Internet is not practicable at a large-scale (due to the size of the Internet topology), simulation is an unavoidable step to validate the properties of a newly proposed routing scheme. Unfortunately, the simulation of inter-domain routing protocols over large networks (order of tens of thousands of nodes) poses real challenges due to the limited memory and computational power that computers impose. This paper presents the Dynamic Routing Model simulator \drmsim which addresses the specific problem of large-scale simulations of (inter-domain) routing models on large networks. The motivation for developing a new simulator lies in the limitation of existing simulation tools in terms of the number of nodes they can handle and in the models they propose.},
pdf={http://hal.inria.fr/docs/00/44/01/14/PDF/simulating_routing_schemes_on_large-scale_topologies.pdf},
url={http://dx.doi.org/10.1109/PADS.2010.5471662},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{JBS+10a,
author = {B. Jaumard and N.N. Bhuiyan and S. Sebbah and F. Huc and D. Coudert},
title = {A New Framework for Efficient Shared Segment Protection Scheme for {WDM} Networks},
booktitle = {IEEE High Performance Switching and Routing (HPSR)},
pages = {8p},
year = {2010},
address = {Richardson, TX, USA},
month = jun,
publisher = {IEEE},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/JBS+10a.pdf},
url = {http://dx.doi.org/10.1109/HPSR.2010.5580274},
abstract = { This work introduces a new shared segment protection scheme that ensures both node and link protection in an efficient manner in terms of cost and bandwidth, while taking full advantage of the optical hop endpoints of the primary logical hops (induced by the routing) without adding extra ones for protection. As opposed to the link or path protection schemes, the segment protection scheme has been less studied although it offers an interesting compromise between those two protection schemes, attempting to encompass all their advantages. We investigate two different Shared Segment Protection (SSP) schemes: Basic Shared Segment Protection (BSSP) and Shared Segment Protection with segment Overlap (SSPO), and propose a design of 100\% single segment protections. In SSPO, we study the extra protection capabilities, node failure and dual link failure survivability, offered by the single 100\% single segment protection. For both BSSP and SSPO schemes, we propose two novel efficient ILP formulations, based on a column generation mathematical modeling. While (SSPO) offers the advantage over (BSSP) to ensure both node and link protection, it is not necessarily much more costly. Indeed, depending on the network topology and the traffic instances, it can be shown that none of the two SSP schemes dominates the other one. Therefore, the SSPO protection scheme should be favored as it offers more protection, i.e., it adds the node protection to the link protection at the expense of a minor additional cost. },
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{JBS+10b,
author = {B. Jaumard and N.N. Bhuiyan and S. Sebbah and F. Huc and D. Coudert},
title = {A New Framework for Efficient Shared Segment Protection Scheme for {WDM} Networks},
booktitle = {10th INFORMS Telecommunications Conference},
pages = {2p},
year = {2010},
address = {Montr\'eal, Canada},
month = may,
organization = {Informs},
url = {https://symposia.cirrelt.ca/Informs-Telecom2010/},
pdf = {},
abstract = { This work introduces a new shared segment protection scheme that ensures both node and link protection in an efficient manner in terms of cost and bandwidth, while taking full advantage of the optical hop endpoints of the primary logical hops (induced by the routing) without adding extra ones for protection. As opposed to the link or path protection schemes, the segment protection scheme has been less studied although it offers an interesting compromise between those two protection schemes, attempting to encompass all their advantages. We investigate two different Shared Segment Protection (SSP) schemes: Basic Shared Segment Protection (BSSP) and Shared Segment Protection with segment Overlap (SSPO), and propose a design of 100\% single segment protections. In SSPO, we study the extra protection capabilities, node failure and dual link failure survivability, offered by the single 100\% single segment protection. For both BSSP and SSPO schemes, we propose two novel efficient ILP formulations, based on a column generation mathematical modeling. While (SSPO) offers the advantage over (BSSP) to ensure both node and link protection, it is not necessarily much more costly. Indeed, depending on the network topology and the traffic instances, it can be shown that none of the two SSP schemes dominates the other one. Therefore, the SSPO protection scheme should be favored as it offers more protection, i.e., it adds the node protection to the link protection at the expense of a minor additional cost. },
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{MSZ10b,
author = {G. B. Mertzios and I. Sau and S. Zaks},
title = {{The Recognition of Tolerance and Bounded Tolerance Graphs}},
abstract = {Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has been extensively studied, due to both its interesting structure and its numerous applications. Several efficient algorithms for optimization problems that are NP-hard on general graphs have been designed for tolerance graphs. In spite of this, the recognition of tolerance graphs --~namely, the problem of deciding whether a given graph is a tolerance graph~-- as well as the recognition of their main subclass of bounded tolerance graphs, have been the most fundamental open problems on this class of graphs (cf.~the book on tolerance graphs~\cite{GolTol04}) since their introduction in 1982~\cite{GoMo82}. In this article we prove that both recognition problems are NP-complete, even in the case where the input graph is a trapezoid graph. The presented results are surprising because, on the one hand, most subclasses of perfect graphs admit polynomial recognition algorithms and, on the other hand, bounded tolerance graphs were believed to be efficiently recognizable as they are a natural special case of trapezoid graphs (which can be recognized in polynomial time) and share a very similar structure with them. For our reduction we extend the notion of an \emph{acyclic orientation} of permutation and trapezoid graphs. Our main tool is a new algorithm that uses \emph{vertex splitting} to transform a given trapezoid graph into a permutation graph, while preserving this new acyclic orientation property. This method of vertex splitting is of independent interest; very recently, it has been proved a powerful tool also in the design of efficient recognition algorithms for other classes of graphs~\cite{MC-Trapezoid}.},
BOOKTITLE = {Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS)},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
series = {LIPIcs},
volume = {5},
pages = {585-596},
year = {2010},
isbn = {978-3-939897-16-3},
url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2487},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/MSZ10b.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{MoPe10,
title = { {S}yst{\`e}mes de stockage {P}2{P} : un guide pratique},
author = {Monteiro, J. and P\'erennes, S.},
abstract = {{L}es syst{\`e}mes pair-{\`a}-pair {\`a} grande {\'e}chelle ont {\'e}t{\'e} propos{\'e} comme un moyen fiable d'assurer un stockage de donn{\'e}e {\`a} faible c{\^o}ut. {P}our assurer la p{\'e}rennit{\'e} des donn{\'e}es, ces syst{\`e}mes codent les fichiers des utilisateurs en un ensemble de fragments redondants qui sont répartis entre les pairs. {N}ous étudions dans ce rapport l'impact des différents param{\`e}tres de configuration du syst{\`e}me, comme par exemple, le facteur de redondance et la fr{\'e}quence de r{\'e}paration des donn{\'e}es. {P}lus particulièrement, dans ce papier nous derivons des formules approch{\'e}es {\`a} partir d'une chaine de {M}arkov. {C}es formules nous donnent une estimation de la bande passante n{\'e}cessaire pour maintenir la redondance et de la probabilit{\'e} de perdre un bloc de donn{\'e}e.},
language = {{A}nglais},
affiliation = {{MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 },
booktitle = {11es Journ\'{e}es Doctorales en Informatique et R\'{e}seaux (JDIR 2010)},
address = {{S}ophia {A}ntipolis {F}rance },
URL = {http://hal.inria.fr/inria-00483214/en/},
year = {2010},
pages={15--20},
x-pays={FR},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-nat",

}

@inproceedings{Nis10,
author = {N. Nisse},
title = {Graph Searching and Graph Decompositions},
OPTcrossref = {},
OPTkey = {},
booktitle = {24th European Conference on Operational Research (EURO)},
pages = {1p},
year = {2010},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
address = {Lisbon, Portugal},
month = jul,
OPTorganization = {},
OPTpublisher = {},
note = {Invited talk},
OPTannote = {},
url = {http://hal.inria.fr/inria-00482115},
abstract = {Graph searching is a game where a team of mobile agents must catch a fugitive hidden in a network (modelled by a graph). Equivalently, graph search- ing may be defined in terms of clearing a contaminated network. Besides of its practical interests, graph searching has been widely studied for its relationship with important graph parameters, in particular pathwidth and treewidth. Many versions of graph searching problems have been considered. They all look for a strategy that allows to catch the fugitive using the minimum number of agents. Variants of graph searching differ on various parameters. We first give a brief survey of the numerous research directions in this field. Then, we focus on the relationship between search games and graph decompositions (path- and tree- decompositions). Namely, search games provide a very interesting algorithmic interpretation of the pathwidth and the treewidth of graphs. we explain the equivalence between theses games and graph decompositions through an impor- tant property of these two search games: the monotonicity. This point of view allowed us to obtain new duality results generalyzing those obtained by Robert- son and Seymour in the Graph Minors Theory},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "inv-conf",

}

@inproceedings{RDD+10,
title = { {OSIF}: {A} {F}ramework {T}o {I}nstrument, {V}alidate, and {A}nalyze {S}imulations},
author = {J. Ribault and O. Dalle and D. Conan and S. Leriche},
abstract = {{I}n most existing simulators, the outputs of a simulation run consist either in a simulat ion report generated at the end of the run and summarizing the statistics of interest, or in a (set of) trace file(s) containing raw data samples produced and saved regularly during the run, for later post-processing. {I}n this paper, we address issues related to the management of these data and their on-line processing, such as: (i)~the instrumentation code is mixed in the modeling code; (ii)~the amount of data to be stored may be enormous, and often, a significant part of these data are useless while their collect may consume a significant amount of the computing resources; and (iii)~it is difficult to have confidence in the treatment applied to the data and then make comparisons between studies since each user (model developer) builds its own ad-hoc instrumentation and data processing. {I}n this paper, we propose {OSIF}, a new component-based instrumentation framework designed to solve the above mentioned issues. {OSIF} is based on several mature software engineering techniques and frameworks, such as {COSMOS}, {F}ractal and its {ADL}, and {AOP}.},
language = {English},
booktitle = {In Proc. of 3rd Intl. ICST Conference on Simulation Tools and Techniques (SIMUTools'2010)},
address = {Torremolinos, Spain},
audience = {internationale },
month = {15-19 March},
year = {2010},
URL = {http://hal.inria.fr/inria-00465141/en/},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{UMD10a,
author = {P. Uribe and J-C. {Maureira Bravo} and O. Dalle},
title = {Extending INET Framework for Directional and Asymmetrical Wireless Communications},
booktitle = {Proc. of the 2010 Intl. ICST Workshop on {OMNeT}++ ({OMNeT}++ 2010)},
year = {2010},
pages = {1--8},
month = {15-19 March},
address = {Torremolinos, Spain},
isbn = {78-963-9799-87-5},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@techReport{BHT10,
author = {J. Bang-Jensen and F. Havet and N. Trotignon},
title = {Finding an induced subdivision of a digraph},
year = {2010},
month = {10},
institution = {INRIA},
number = {7430},
type = {Research Report},
URL={http://hal.inria.fr/inria-00527518/fr/},
PDF = {http://hal.inria.fr/docs/00/52/75/18/PDF/RR-7430.pdf},
abstract = {We consider the following problem for oriented graphs and digraphs: Given an oriented graph (digraph) $G$, does it contain an induced subdivision of a prescribed digraph $D$? The complexity of this problem depends on $D$ and on whether $H$ must be an oriented graph or is allowed to contain 2-cycles. We give a number of examples of polynomial instances as well as several NP-completeness proofs.},
x-editorial-board={yes},
x-proceedings={yes},
x-international-audience={yes},
x-pays={DK},

}

@techreport{BFF+10,
author = {{B}arri{\`e}re, L. and {F}locchini, P. and {F}omin, F. {V}. and {F}raigniaud, P. and {N}isse, N. and {S}antoro, N. and {T}hilikos, D.},
title = {{C}onnected {G}raph {S}earching},
institution = {INRIA},
type = {Research Report},
number = {7363},
year = {2010},
month = aug,
x-pays={ES,CA,NO,GR},
url = {http://hal.inria.fr/inria-00508888},
pdf = {http://hal.inria.fr/docs/00/50/88/88/PDF/RR-7363.pdf},
abstract = {In graph searching game the opponents are a set of searchers and a fugitive in a graph. The searchers try to capture the fugitive by applying some sequence moves that include placement, removal, or sliding of a searcher along an edge. The fugitive tries to avoid capture by moving along unguarded paths. The search number of a graph is the minimum number of searchers required to guarantee the capture of the fugitive. In this paper, we initiate the study of this game under the natural restriction of connectivity where we demand that in each step of the search the locations of the graph that are clean (i.e. non-accessible to the fugitive) remain connected. We give evidence that many of the standard mathematical tools used so far in the classic graph searching fail under the connectivity requirement. We also settle the question on ``the price of connectivity'' that is how many searchers more are required for searching a graph when the connectivity demand is imposed. We make estimations of the price of connectivity on general graphs and we provide tight bounds for the case of trees. In particular, for an $n$-vertex graph the ratio between the connected searching number and the non-connected one is $O(\log n)$ while for trees this ratio is always at most 2. We also conjecture that this constant-ratio upper bound for trees holds also for all graphs. Our combinatorial results imply a complete characterization of connected graph searching on trees. It is based on a forbidden-graph characterization of the connected search number. We prove that the connected search game is monotone for trees, i.e. restricting search strategies to only those where the clean territories increase monotonically does not require more searchers. A consequence of our results is that the connected search number can be computed in polynomial time on trees, moreover, we show how to make this algorithm distributed. Finally, we reveal connections of this parameter to other invariants on trees such as the Horton-Stralher number.},

}

@techreport{BMN+10,
author = {F. Becker and M. Matamala and N. Nisse and I. Rapaport and K. Suchan and I. Todinca},
title = {Adding a referee to an interconnection network: What can(not) be computed in one round},
institution = {arXiv},
type = {Research Report},
number = {arXiv:1009.4447},
year = {2010},
month = sep,
x-pays={CL},
url = {http://arxiv.org/abs/1009.4447},
pdf = {http://arxiv.org/pdf/1009.4447v2},
abstract = {In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we consider is a restriction of the classical CONGEST (distributed) model and it is close to the simultaneous messages (communication complexity) model defined by Babai, Kimmel and Lokam. More precisely, each of these n nodes -which only knows its own ID and the IDs of its neighbors is allowed to send a message of O(log n) bits to some central entity, called the referee. Is it possible for the referee to decide some basic structural properties of the network topology G? We show that simple questions like, "does G contain a square?", "does G contain a triangle?" or "Is the diameter of G at most 3?” cannot be solved in general. On the other hand, the referee can decode the messages in order to have full knowledge of $G$ when $G$ belongs to many graph classes such as planar graphs, bounded treewidth graphs and, more generally, bounded degeneracy graphs. We leave open questions related to the connectivity of arbitrary graphs. }, OPTx-editorial-board={yes}, OPTx-proceedings={no}, OPTx-international-audience={yes}, sorte = "Rapports", 
}

@techreport{BHH+10,
title = { {I}mproper colouring of weighted grid and hexagonal graphs},
author = {Bermond, J-C. and Havet, F. and Huc, F. and Linhares Sales, C.},
abstract = {{W}e study a weighted improper colouring problem on graph, and in particular of triangular and hexagonal grid graphs. {T}his problem is motivated by a frequency allocation problem. {W}e propose approximation algorithms to compute such colouring.},
keywords = {{I}mproper colouring, {W}eighted colouring, {A}pproximation algorithms},
language = {{A}nglais},
affiliation = {{MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 - {C}entre {U}niversitaire d'{I}nformatique - {U}niversit{\'e} de {G}en{\`e}ve - {L}aborat{\'o}rios de {P}esqu{I}sa em {C}omputao - {LIA} - {U}niversite {F}ederale du {C}eara },
pages = {19 },
type = {Research Report},
institution = {INRIA},
number = {{RR}-7250},
collaboration = {{U}niversite de {G}eneve, {TCS} {S}ensor{L}ab },
day = {13},
month = {apr},
year = {2010},
URL = {http://hal.inria.fr/inria-00472819/en/},
PDF = {http://hal.inria.fr/inria-00472819/PDF/RR-7250.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
x-pays = {BR},
sorte = "Rapports",

}

@techreport{CGH+10,
author = {Campos, V. and Gy\'arf\'as, A. and Havet, F. and Linhares Sales, C. and Maffray, F.},
title = {New bounds on the Grundy number of products of graphs},
year = {2010},
month = apr,
institution = {INRIA},
number = {7243},
type = {Research Report},
url = {http://hal.archives-ouvertes.fr/inria-00470158/fr/},
pdf = {http://hal.archives-ouvertes.fr/docs/00/47/01/58/PDF/RR-7243.pdf },
abstract = { The Grundy number of a graph $G$ is the largest $k$ such that $G$ has a greedy $k$-colouring, that is, a colouring with $k$ colours obtained by applying the greedy algorithm according to some ordering of the vertices of $G$. In this paper, we give new bounds on the Grundy number of the product of two graphs.},
x-editorial-board={yes},
x-proceedings={yes},
x-international-audience={yes},
x-pays={BR, HU},
sorte = "Rapports",

}

@techreport{CGM+10a,
title = {{P}2{P} {S}torage {S}ystems: {D}ata {L}ife {T}ime for {D}ifferent {P}lacement {P}olicies},
author = {Caron, S. and Giroire, F. and Mazauric, D. and Monteiro, J. and P\'erennes, S.},
abstract = {{P}eer-to-peer systems are foreseen as an efficient solution to achieve reliable data storage at low cost. {T}o deal with common {P}2{P} problems such as peer failures or churn, such systems encode the user data into redundant fragments and distribute them among peers. {T}he way they distribute it, known as placement policy, has a significant impact on their behavior and reliability. {I}n this report, after a brief state-of-the-art of the technology used in {P}2{P} storage systems, we compare three different placement policies: two of them local, in which the data is stored in logical peer neighborhoods, and on of them global in which fragments are parted at random among the different peers. {F}or each policy, we give either {M}arkov {C}hain {M}odels to efficiently compute the {M}ean {T}ime {T}o {D}ata {L}oss (which is closely related to the probability to lose data) or approximations of this quantity under certain assumptions. {W}e also attempt to give lower bounds on {P}2{P} storage systems introducing the {BIG} system, in which we consider information globally. {W}e propose various ways to compute a bound on the probability to lose data, in relation with parameters such as the peer failure rate of the peer bandwidth.},
keywords = {{P}2{P} storage system; data placement; data life time; mean time to data loss; performance evaluation;{M}arkov chains},
language = {{A}nglais},
affiliation = {{MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 - {MAESTRO} - {INRIA} {S}ophia {A}ntipolis - {INRIA} - {U}niversit{\'e} {M}ontpellier {II} - {S}ciences et {T}echniques du {L}anguedoc },
type = {Research Report},
institution = {INRIA},
number = {{RR}-7209},
day = {19},
month = feb,
year = {2010},
URL = {http://hal.inria.fr/inria-00458190/en/},
PDF = {http://hal.inria.fr/inria-00458190/PDF/RR-7209.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@techreport{CCN+10a,
author = {J. Chalopin and V. Chepoi and N. Nisse and Y. Vax\`es},
title = {Cop and robber games when the robber can hide and ride.},
institution = {INRIA},
number = {INRIA-RR7178},
year = {2010},
month = jan,
url = {http://hal.archives-ouvertes.fr/inria-00448243/fr/},
pdf = {http://hal.archives-ouvertes.fr/docs/00/44/82/43/PDF/RR-7178.pdf},
abstract = {In the classical cop and robber game, two players, the cop C and the robber R, move alternatively along edges of a finite graph G=(V,E). The cop captures the robber if both players are on the same vertex at the same moment of time. A graph G is called cop win if the cop always captures the robber after a finite number of steps. Nowakowski, Winkler (1983) and Quilliot (1983) characterized the cop-win graphs as graphs admitting a dismantling scheme. In this paper, we characterize in a similar way the cop-win graphs in the game in which the cop and the robber move at different speeds s' and s, s'<= s. We also investigate several dismantling schemes necessary or sufficient for the cop-win graphs in the game in which the robber is visible only every k moves for a fixed integer k>1. We characterize the graphs which are cop-win for any value of k.},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@techreport{CoHa10b,
url = {http://hal.inria.fr/inria-00459692/en/},
title = { {L}inear and 2-frugal choosability of graphs of small maximum average degree},
author = {N. Cohen and F. Havet},
abstract = {{A} proper vertex colouring of a graph ${G}$ is {\it 2-frugal} (resp. {\it linear}) if the graph induced by the vertices of any two colour classes is of maximum degree 2 (resp. is a forest of paths). {A} graph ${G}$ is {\it 2-frugally} (resp. {\it linearly}) {\it ${L}$-colourable} if for a given list assignment ${L}:{V}({G})\mapsto 2^{\mathbb {N}}$, there exists a 2-frugal (resp. linear) colouring $c$ of ${G}$ such that $c(v)\in {L}(v)$ for all $v\in {V}({G})$. {I}f ${G}$ is 2-frugally (resp. linearly) ${L}$-list colourable for any list assignment such that $|{L}(v)|\ge k$ for all $v\in{V}({G})$, then ${G}$ is {\it 2-frugally} (resp. {\it linearly}) {\it $k$-choosable}. {I}n this paper, we improve some bounds on the 2-frugal choosability and linear choosability of graphs with small maximum average degree.},
language = {{E}nglish},
affiliation = {{MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 },
type = {{R}esearch {R}eport},
institution = {INRIA},
number = {{RR}-7213},
day = {24},
month = {02},
year = {2010},
URL = {http://hal.inria.fr/inria-00459692/PDF/RR-7213.pdf},
OPTx-editorial-board={no},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@techreport{GMM+10a,
URL = {http://hal.archives-ouvertes.fr/inria-00464318/en/},
title = { {M}inimizing {R}outing {E}nergy {C}onsumption: from Theoretical to Practical Results},
OPTauthor = {Giroire, Frédéric and Mazauric, Dorian and Moulierac, Joanna and Onfroy, Brice},
author = {Giroire, F. and Mazauric, D. and Moulierac, J. and Onfroy, B.},
month = may,
year = {2010},
type = {Research Report},
number = {inria-00464318},
abstract = {{S}everal studies exhibit that the traffic load of the routers only has a small influence on their energy consumption. {H}ence, the power consumption in networks is strongly related to the number of active network elements, such as interfaces, line cards, base chassis,... {T}he goal thus is to find a routing that minimizes the (weighted) number of active network elements used when routing. {I}n this paper, we consider a simplified architecture where a connection between two routers is represented as a link joining two network equipments. {W}hen a connection is not used, both network equipments can be turned off. {T}herefore, in order to reduce power consumption, the goal is to find the routing that minimizes the number of used links while satisfying all the demands. {W}e first present a study on specific topologies, such as trees and complete graphs, that provide bounds and results useful for real topologies. {W}e model the problem as a linear program and propose a heuristic to solve large instances. {W}e exhibit the gain in terms of number of network equipments (leading to a global reduction of the power consumption) for a set of network topologies: we see that for almost all topologies more than one third of the network equipments can be spared for usual ranges of operation. {F}inally, we discuss the impact of energy efficient routing on the stretch factor and on fault tolerance.},
keywords = {power consumption ; energy-efficient routing ; graphs ; linear programming},
language = {Anglais},
affiliation = {{MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversité de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 },
pdf = {http://hal.archives-ouvertes.fr/inria-00464318/PDF/RR-7234.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@techreport{HIK+10a,
title = { {H}ow to beat the random walk when you have a clock?},
author = {Hanusse, {N}. and Ilcinkas, {D}. and Kosowski, {A}. and Nisse, N.},
abstract = {{W}e study the problem of finding a destination node $t$ by a mobile agent in an unreliable network having the structure of an unweighted graph, in a model first proposed by {H}anusse {\it et al.}~\cite{{HKK}00,{HKKK}08}. {E}ach node of the network is able to give advice concerning the next node to visit so as to go closer to the target $t$. {U}nfortunately, exactly $k$ of the nodes, called \emph{liars}, give advice which is incorrect. {I}t is known that for an $n$-node graph ${G}$ of maximum degree $\{D}elta \geq 3$, reaching a target at a distance of $d$ from the initial location may require an expected time of $2^{\{O}mega(\min\{d,k\})}$, for any $d,k={O}(\log n)$, even when ${G}$ is a tree. {T}his paper focuses on strategies which efficiently solve the search problem in scenarios in which, at each node, the agent may only choose between following the local advice, or randomly selecting an incident edge. {T}he strategy which we put forward, called \algo{{R}/{A}}, makes use of a timer (step counter) to alternate between phases of ignoring advice (\algo{{R}}) and following advice (\algo{{A}}) for a certain number of steps. {N}o knowledge of parameters $n$, $d$, or $k$ is required, and the agent need not know by which edge it entered the node of its current location. {T}he performance of this strategy is studied for two classes of regular graphs with extremal values of expansion, namely, for rings and for random $\maxdeg$-regular graphs (an important class of expanders). {F}or the ring, \algo{{R}/{A}} is shown to achieve an expected searching time of $2d+k^{\{T}heta(1)}$ for a worst-case distribution of liars, which is polynomial in both $d$ and $k$. {F}or random $\maxdeg$-regular graphs, the expected searching time of the \algo{{R}/{A}} strategy is ${O}(k3 \log3 n)$ a.a.s. {T}he polylogarithmic factor with respect to $n$ cannot be dropped from this bound; in fact, we show that a lower time bound of $\{O}mega (\log n)$ steps holds for all $d,k=\{O}mega(\log\log n)$ in random $\maxdeg$-regular graphs a.a.s.\ and applies even to strategies which make use of some knowledge of the environment. {F}inally, we study oblivious strategies which do not use any memory (in particular, with no timer). {S}uch strategies are essentially a form of a random walk, possibly biased by local advice. {W}e show that such biased random walks sometimes achieve drastically worse performance than the \algo{{R}/{A}} strategy. {I}n particular, on the ring, no biased random walk can have a searching time which is polynomial in $d$ and $k$},
OPTkeywords = {{D}istributed {C}omputing; {M}obile {A}gent; {R}andom {W}alks; {E}xpanders; {F}aulty {N}etworks},
language = {{A}nglais},
affiliation = {{L}aboratoire {B}ordelais de {R}echerche en {I}nformatique - {L}a{BRI} - {CNRS} : {UMR}5800 - {U}niversit{\'e} {S}ciences et {T}echnologies - {B}ordeaux {I} - {E}cole {N}ationale {S}up{\'e}rieure d'{E}lectronique, {I}nformatique et {R}adiocommunications de {B}ordeaux - {U}niversit{\'e} {V}ictor {S}egalen - {B}ordeaux {II} - {CEPAGE} - {INRIA} {B}ordeaux - {S}ud-{O}uest - {INRIA} - {CNRS} : {UMR}5800 - {U}niversit{\'e} {S}ciences et {T}echnologies - {B}ordeaux {I} - {ENSEIRB} - {D}epartment of {A}lgorithms and {S}ystem {M}odeling - {G}dansk {U}niversity of {T}echnology - {MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 },
pages = {19},
type = {Research Report},
institution = {INRIA},
number = {{RR}-7210},
month = feb,
year = {2010},
URL = {http://hal.inria.fr/inria-00458808/en/},
pdf = {http://hal.inria.fr/inria-00458808/PDF/RR-7210.pdf},
x-pays = {PL},
sorte = "Rapports",

}

@techReport{HLS10,
author = {Havet, F. and Linhares Sales, C. and Sampaio, L.},
title = {b-coloring of tight graphs},
year = {2010},
month = mar,
institution = {INRIA},
number = {7241},
type = {Research Report},
url = {http://hal.archives-ouvertes.fr/inria-00468734/fr/},
pdf = {http://hal.archives-ouvertes.fr/docs/00/46/87/34/PDF/RR-7241.pdf },
abstract = {A coloring $c$ of a graph $G = (V, E)$ is a \emph{$b$-coloring} if in every color class there is a vertex whose neighborhood intersects every other color classes. The \emph{$b$-chromatic number} of $G$, denoted $\chi_b(G)$, is the greatest integer $k$ such that $G$ admits a $b$-coloring with $k$ colors. A graph $G$ is \emph{tight} if it has exactly $m(G)$ vertices of degree $m(G) - 1$, where $m(G)$ is the largest integer $m$ such that $G$ has at least $m$ vertices of degree at least $m-1$. Determining the $b$-chromatic number of a tight graph $G$ is NP-hard even for a connected bipartite graph \cite{KTV02}. In this paper we show that it is also NP-hard for a tight chordal graph. We also show that the $b$-chromatic number of a split graph can be computed is polynomial. Then we define the $b$-closure and the partial $b$-closure of a tight graph, and use these concepts to give a characterization of tight graphs whose $b$-chromatic number is equal to $m(G)$. This characterization is used to develop polynomial time algorithms for deciding whether $\chi_b(G) = m(G)$, for tight graphs that are complement of bipartite graphs, $P_4$-sparse and block graphs. We generalize the concept of pivoted tree introduced by Irving and Manlove \cite{IM99} and show its relation with the $b$-chromatic number of tight graphs. Finally, we give an alternative formulation of the Erd\"os-Faber-Lov\'asz conjecture in terms of $b$-colorings of tight graphs.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays={BR},
sorte = "Rapports",

}

@techreport{UMD10b,
url = {http://hal.inria.fr/inria-00448033/en/},
title = { {E}xtending {INET} {F}ramework for {D}irectional and {A}symmetrical {W}ireless {C}ommunications},
author = {Uribe, P. and {Maureira Bravo}, J-C. and Dalle, O.},
abstract = {{T}his paper reports our work on extending the {O}mnet {INET} {F}ramework with a directional radio model, putting a special emphasis on the implementation of asymmetrical communications. {W}e first analyze the original {INET} radio model, focusing on its design and components. {T}hen we discuss the modifications that have been done to support directional communications. {O}ur preliminary results show that the new model is flexible enough to allow the user to provide any antenna pattern shape, with only an additional reasonable computational cost.},
keywords = {{OMN}e{T}++, {INET} {F}ramework, {D}irectional {R}adios, {A}symmetrical communication},
language = {{E}nglish},
affiliation = {{C}enter for {M}athematical {M}odeling - {CMM} - {CNRS} : {UMR}2071 - {MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 },
type = {{R}esearch {R}eport},
institution = {INRIA},
number = {{RR}-7120},
day = {31},
month = {03},
year = {2010},
pdf = {http://hal.inria.fr/inria-00448033/PDF/RR-7120.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@Misc{Coh10,
author = {N. Cohen},
title = {Several Graph Problems and their LP formulation},
year = {2010},
ABSTRACT = {In this document are given Linear Program formulations of several graph problems involving acyclicity constraints without the use of constraint generations.},
PDF = {http://hal.archives-ouvertes.fr/docs/00/50/49/14/PDF/LP_formulations.pdf},
sorte = "Rapports",

}

@book{Dal09,
title = {Mobile Networks and Applications (MONET) : Special Issue on Development Tools and Techniques for Mobile Telecommunications},
publisher = {Springer Netherlands},
year = {2009},
editor = {O. Dalle and J. R. Heath and G. A. Wayne},
month = dec,
note = {Online publication},
doi = {10.1007/s11036-009-0218-x},
OPTjournal = {Mobile Networks and Applications (MONET)},
url = {http://springerlink.com/content/t51p44g148q080w5/?p=c735ba186ace4beea3b22eb5ac5a0744&pi=14},
sorte = "livres-edit",

}

@Proceedings{DPSW09,
title = {{2nd International Conference on Simulation Tools and Techniques (SIMUTools 2009)}},
year = {2009},
OPTkey = {},
editor = {O. Dalle and L.-F. Perrone and G. Stea and G. A. Wainer},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
address = {Rome, Italy},
month = {mar},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {},
sorte = "livres-edit",

}

@phdthesis{Gom09,
author = {C. Gomes},
month = {December 1st},
title = {Radio Mesh Networks and the Round Weighting Problem},
year = {2009},
school = {Universit\'e de Nice-Sophia Antipolis (UNS)},
url = {http://tel.archives-ouvertes.fr/tel-00449856},
pdf = {http://tel.archives-ouvertes.fr/docs/00/44/98/56/PDF/theseCGomes.pdf},
keywords = {Radio Mesh Networks, Multi-objective Optimization, Bandwidth allocation problem, Flow problem, Coloring Problem, Fairness, Column Generation method,Convex Problems},
abstract = {In this thesis, we address the joint routing and slot assignment problem between the routers and the gateways in radio mesh access networks. We model the problem as a Round Weighting Problem (RWP) in which the objective is to minimize the overall period of slot activations providing enough capacity to satisfy the bandwidth requirements of the routers. Solving the full problem means generating an exponential set of simultaneous transmission rounds which is intractable even for small networks. To cope with this issue, we implement a mathematical multi-objective model to solve the problem using a column generation method. We observe that the bottleneck is usually located in a limited region around a gateway. We propose a method to obtain lower bounds (considering only a limited probable bottleneck region) and upper bounds for general graphs. Our methods are applied to grid graphs providing closed formulae for the case of uniform demands, and also optimal routing strategies considering non-uniform demands. Motivated by the results of the existence of a limited (bottleneck) region capable of representing the whole network, we consider a variant of the RWP dealing also with bandwidth allocation, but considering SINR conditions in a CDMA network. We give sufficient conditions for the whole network to be reduced to a single-hop around the gateway. It is due to the fact that the problem is convex under some conditions that are often met. },
x-pays = {FR},
x-editorial-board={no},
x-proceedings={no},
x-international-audience={no},
sorte = "these",

}

@phdthesis{Mol09,
sorte = "these",
author = {C. Molle},
month = oct,
title = {Optimisation de la capacit\'e des r\'eseaux radio maill\'es},
year = {2009},
school = {Ecole doctorale {STIC}, Universit\'e de Nice-Sophia Antipolis},
url = {http://tel.archives-ouvertes.fr/tel-00428940/fr/},
pdf = {http://tel.archives-ouvertes.fr/docs/00/42/89/40/PDF/CMthese.pdf},
keywords = {Optimisation, programmation lin\'eaire, r\'eseaux radio maill\'es, capacit\'e, g\'en\'eration de colonnes},
abstract = {Dans cette th\`ese, nous nous int\'eressons aux probl\'ematiques d'optimisation de la capacit\'e des r\'eseaux radio maill\'es. Cette architecture de r\'eseau d'acc\`es est particuli\`erement pertinente en milieu urbain ou en situation op\'erationnelle militaire. Nous d\'efinissons la capacit\'e d'un r\'eseau comme la quantit\'e de flot que peut r\'epartir \'equitablement une topologie aux utilisateurs qu'elle sert. Afin d'obtenir des bornes th\'eoriques sur les performances du r\'eseau, nous d\'eveloppons des mod\`eles d'optimisation int\'egrant les caract\'eristiques inter-couche des communications radio. Nous \'etudions plus pr\'ecis\'ement le probl\`eme joint du routage et de l'ordonnancement. Nous d\'eveloppons, pour la relaxation lin\'eaire de ce probl\`eme, une m\'ethode de r\'esolution efficace utilisant la g\'en\'eration de colonnes. Nous d\'erivons ensuite une formulation qui \'elimine le routage pour se concentrer sur la capacit\'e de transport disponible sur les coupes du r\'eseau. L'\ 'equivalence des solutions optimales est d\'emontr\'ee, et le processus de r\'esolution est adapt\'e en une g\'en\'eration crois\'ee de lignes et de colonnes. Ces \'etudes mettent en \'evidence la pr\'esence d'une zone de contention autour de chaque point d'acc\`es qui contraint la capacit\'e du r\'eseau. Ces r\'esultats permettent une \'etude quantitative des effets du trafic d'acquittement sur la capacit\'e. Nous pr\'esentons enfin une \'etude de la stabilit\'e d'un protocole routant du trafic inject\'e de mani\`ere arbitraire au cours du temps. Nous am\'eliorons les r\'esultats existants en d\'emontrant la stabilit\'e quand le trafic inject\'e est un flot maximum. L'ensemble de ces travaux a \'et\'e impl\'ement\'e dans la biblioth\`eque open source MASCOPT (Mascotte Optimisation) d\'edi\'ee aux probl\`emes d'optimisation des r\'eseaux.},
OPTx-pays = {FR},
OPTx-editorial-board={no},
OPTx-proceedings={no},
OPTx-international-audience={no} 
}

@phdthesis{Mon09,
sorte = "these",
author = {G. Monaco},
month = oct,
title = {Optimization and Non-Cooperative Issues in Communication Networks},
year = {2009},
school = {University of l'Aquila},
url = {http://www.gianpieromonaco.com},
pdf = {http://www.gianpieromonaco.com/Thesis%20Gianpiero_Monaco.pdf},
keywords = {},
abstract = {Communication networks and more in general distributed systems are undergoing rapid advancements. The last few years have experienced a steep growth in research on different related aspects. However, although the great promise for our future communication capabilities, several challenges need still to be addressed. A crucial ingredient for the successful development end employment of the corresponding arising technologies is the design of networks better suited for the management of large bandwidth and high quality services, as required by the emerging tasks, such as on-demand-video, multimedia and data integrated networks, seamless and ubiquitous access to system resources in mobile environments, secure on-demand data, and so forth. In this thesis we focus on the analysis of the performance and complexity of distributed systems such as optical networks (representing the main contribution of the thesis) and wireless networks. More specifically, we consider classical combinatorial optimization problems arising in communication networks from two different perspectives. In the first part we consider the design of classical centralized polynomial time (approximation or exact) algorithms. Such an investigation is conducted under a traditional computational complexity setting in which time constraints must be taking into account for tractability and efficiency matters. The above perspective implicitly or explicitly assumes that the resources of the system are directly accessible and controllable by a centralized authority, but this assumption in highly distributed systems might be too strong or unrealistic. Therefore, in the second part of the thesis we consider communication problems arising in networks with autonomous or non-cooperative users. In such a scenario users pursue an own often selfish strategy and the system evolves as a consequence of the interactions among them. The interesting arising scenario is thus characterized by the conflicting needs of the users aiming to maximize their personal profit and of the system wishing to compute a socially efficient solution. Algorithmic Game theory is considered the most powerful tool dealing with such non-cooperative environments in which the lack of coordination yields inefficiencies. In such a scenario we consider the pure Nash equilibrium as the outcome of the game and in turn as the concept capturing the notion of stable solution of the system. Under the above perspectives, the thesis makes different progresses on the understanding of a variety of problems in communication networks. Our results include: polynomial time algorithms, NP-complete results, approximation algorithms and inapproximability results; analysis of performances, convergence and existence of Nash equilibria in selfish scenarios.},
OPTx-pays = {IT},
OPTx-editorial-board={no},
OPTx-proceedings={no},
OPTx-international-audience={no} 
}

@phdthesis{Per09,
sorte = "these",
author = {J.-P. {Perez Seva}},
month = aug,
title = {Les optimisations d'algorithmes de traitement du signal sur les architectures modernes parall\`eles et embarqu\'ees},
year = {2009},
school = {Ecole doctorale {STIC}, Universit\'e de Nice-Sophia Antipolis},

}

@phdthesis{Rey09,
sorte = "these",
author = {P. Reyes},
month = aug,
title = {Data Gathering in Radio Networks},
year = {2009},
school = {Ecole doctorale {STIC}, Universit\'e de Nice-Sophia Antipolis},
keywords = {combinatorial optimization, algorithms, graph coloring, data gathering, wireless networks, sensor networks},
url = {http://tel.archives-ouvertes.fr/tel-00418297/en/},
abstract = {This thesis concerns the study of the algorithmic and the complexity of the communications in radio networks. In particular, we were interested in the problem of gathering information from the nodes of a radio network in a central node. This problem is motivated by a question of France Telecom (Orange Labs): How to bring Internet in villages. Nodes represent the houses of the villages which communicate between them by radio, the goal being to reach a gateway connected to Internet by a satellite link. The same problem can be found in sensor networks where the question is to collect data from sensors to a base station. A peculiarity of radio networks is that the transmission distance is limited and that the transmissions interfere between them (interference phenomena). We model these constraints by saying that two nodes (radio devices) can communicate if they are at distance at most dT and a node interferes with another one if their distance is at most dI. The distances are considered in a graph representing the network. Thus, a communication step will consist in a compatible (non interfering) set of transmissions. Our goal is to find the minimum number of steps needed to achieve such a gathering and design algorithms achieving this minimum. For special topologies such as the path and the grid, we have proposed optimal or near optimal solutions. We also considered the systolic (or continuous) case where we want to maximize the throughput (bandwidth) offered to each node.},

}

@PHDTHESIS{Sau09,
sorte = "these",
AUTHOR = {I. Sau},
TITLE = {Optimization in Graphs under Degree Constraints. Application to Telecommunication Networks},
SCHOOL = {Universit\'e de Nice-Sophia Antipolis (UNS) and Universitat Polit\`ecnica de Catalunya (UPC)},
YEAR = {2009},
month = oct,
abstract = {The first part of this thesis is devoted to traffic grooming, which is a central problem in optical networks. It refers to packing low-rate signals into higher-speed streams, in order to improve bandwidth utilization and reduce the network cost. The objective is to minimize the number of Add-Drop Multiplexers (ADMs), which are devices that insert/extract low-rate traffic to/from a high-speed stream. In graph-theoretical terms, the problem can be translated into finding a partition of the edges of a request graph into subgraphs with bounded number of edges, the objective being to minimize the total number of vertices of the partition. We first focus in Chapter~1 on a general request graph when the topology is a ring or a path. We provide the first inapproximability result for traffic grooming for fixed values of the \emph{grooming factor} $C$, answering affirmatively to a conjecture in the literature. We also provide a polynomial-time approximation algorithm for traffic grooming in rings and paths, with an approximation ratio independent of C. We introduce in Chapter~2 a new model of traffic grooming in unidirectional rings, in order to design networks being able to support \emph{any} request graph with bounded maximum degree. We show that the problem is essentially equivalent to finding the least integer $M(C,\Delta)$ such that the edges of any graph with maximum degree at most $\Delta$ can be partitioned into subgraphs with at most $C$ edges and each vertex appears in at most $M(C,\Delta)$ subgraphs, and we establish the value of $M(C,\Delta)$ for almost all values of $C$ and $\Delta$. In Chapter~3 we focus on traffic grooming in bidirectional rings with symmetric shortest path routing and all-to-all unitary requests, providing general lower bounds and infinite families of optimal solutions for $C=1,2,3$ and $C$ of the form $k(k+1)/2$. In Chapter~4 we study traffic grooming for two-period optical networks, a variation of the traffic grooming problem for WDM unidirectional ring networks with two grooming factors $C$ and $C'$ that allows some dynamism on the traffic. Using tools of graph decompositions, we determine the minimum number of ADMs for $C=4$, and $C'=1,2,3$. The study of the traffic grooming problem leads naturally to the study of a family of graph-theoretical problems dealing with general constraints on the degree. This is the topic of the second part of this thesis. We begin in Chapter~5 by studying the computational complexity of several families of degree-constrained problems, giving hardness results and polynomial-time approximation algorithms. We then study in Chapter~6 the parameterized complexity of finding degree-constrained subgraphs, when the parameter is the size of the subgraphs. We prove hardness results in general graphs and provide explicit fixed-parameter tractable algorithms for minor-free graphs. We obtain in Chapter~7 subexponential parameterized and exact algorithms for several families of degree-constrained subgraph problems on planar graphs, using bidimensionality theory combined with novel dynamic programming techniques. Finally, we provide in Chapter~8 a framework for the design of dynamic programming algorithms for surface-embedded graphs with single exponential dependence on branchwidth. Our approach is based on a new type of branch decomposition called \emph{surface cut decomposition}, which generalizes sphere cut decompositions for planar graphs. The existence of such algorithms is proved using diverse techniques from topological graph theory and analytic combinatorics.},
keywords = {Graph theory, traffic grooming, optical networks, graph partitioning, computational complexity, approximation algorithms, parameterized complexity, branchwidth, dynamic programming, graphs on surfaces},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/PhD_Ignasi.pdf},

}

@InBook{BCF+09,
sorte = "livres-chap",
author = {V. Bil{\`o} and I. Caragiannis and A. Fanelli and M. Flammini and C. Kaklamanis and G. Monaco and L. Moscardelli},
ALTeditor = {},
title = {Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks},
chapter = {Game-Theoretic Approaches to Optimization Problems in Communication Networks},
publisher = {Springer},
year = {2009},
x-pays = {IT,GR},
OPTkey = {},
volume = {XXVII},
OPTnumber = {},
series = {EATCS Texts in Theoretical Computer Science},
OPTtype = {},
OPTaddress = {},
edition = {{A. Koster and X. Mu{\~n}oz}},
month = nov,
pages = {241-264},
OPTnote = {to appear},
OPTannote = {},
ISBN = {978-3-642-02249-4},
url = {http://www.springer.com/computer/foundations/book/978-3-642-02249-4},
abstract = {In this chapter we consider fundamental communication problems arising in networks with non-cooperative users. The uncoordinated users’ behavior, addressing communication primitives in an individualistic and selfish manner, poses several intriguing questions ranging from the definition of reasonable and practical models, to the quantification of the efficiency loss due to the lack of users' cooperation. We present several results lately achievied in this research area and propose interesting future research directions. },
pdf = {http://www.gianpieromonaco.com/293chap-selfish.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@InBook{SaZe09,
sorte = "livres-chap",
author = {I. Sau and J. Zerovnik},
ALTeditor = {},
title = {Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks},
chapter = {Permutation Routing and $(\ell,k)$-Routing on Plane Grids},
publisher = {Springer},
year = {2009},
OPTkey = {},
volume = {XXVII},
OPTnumber = {},
series = {EATCS Texts in Theoretical Computer Science},
OPTtype = {},
OPTaddress = {},
edition = {{A. Koster and X. Mu{\~n}oz}},
month = nov,
pages = {265-279},
OPTnote = {to appear},
OPTannote = {},
ISBN = {978-3-642-02249-4},
url = {http://www.springer.com/computer/foundations/book/978-3-642-02249-4},
abstract = {The packet routing problem plays an essential role in communication networks. It involves how to transfer data from some origins to some destinations within a reasonable amount of time. In the $(\ell,k)$-routing problem, each node can send at most $\ell$ packets and receive at most $k$ packets. Permutation routing is the particular case $\ell=k=1$. In the $r$-centralrouting problem, all nodes at distance at most $r$ from a fixed node $v$ want to send a packet to $v$.Here we survey the results on permutation routing, the $r$-central routing and the general $(\ell,k)$-routing problems on plane grids, that is square grids, triangular grids and hexagonal grids. We assume the \emph{store-and-forward} $\Delta$-port model, and we consider both full and half-duplex networks.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/SaZe09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {SI},

}

@ARTICLE{ABR09,
sorte = "rev-int",
AUTHOR={L. Addario-Berry and N. Broutin and B. Reed},
TITLE={Critical random graphs and the structure of a minimum spanning tree},
JOURNAL = {Random Structures and Algorithms},
VOLUME = {35},
NUMBER = {},
YEAR = {2009},
PAGES = {323--347},
x-pays ={CA},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
abstract = {We consider the complete graph on n vertices whose edges are weighted by independent and identically distributed edge weights and build the associated minimum weight spanning tree. We show that if the random weights are all distinct, then the expected diameter of such a tree is Θ(n1-3). This settles a question of Frieze and Mc-Diarmid (Random Struct Algorithm 10 (1997), 5–42). The proofs are based on a precise analysis of the behavior of random graphs around the critical point. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2009},
pdf = {algo.inria.fr/broutin/pub/AdBrRe2009a.pdf},
url ={http://portal.acm.org/citation.cfm?id=1598965} 
}

@ARTICLE{AdRe09,
sorte = "rev-int",
AUTHOR={L. Addario-Berry and B. Reed},
TITLE={Minima in branching random walks},
JOURNAL = {Annals of Probability},
VOLUME = {37},
NUMBER = {},
YEAR = {2009},
PAGES = {1044--1079},
x-pays ={CA},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
abstract = {Given a branching random walk, let $M_n$ be the minimum position of any member of the $n$th generation. We calculate $\mathbf{E}M_n$ to within O(1) and prove exponential tail bounds for $\mathbf{P}\{|M_n-\mathbf{E}M_n|>x\}$, under quite general conditions on the branching random walk. In particular, together with work by Bramson [Z. Wahrsch. Verw. Gebiete 45 (1978) 89--108], our results fully characterize the possible behavior of $\mathbf {E}M_n$ when the branching random walk has bounded branching and step size.},
pdf = {http://arxiv.org/pdf/0712.2582v3},
url ={http://arxiv.org/abs/0712.2582} 
}

@article{AHP09,
sorte = "rev-int",
author= { O. Amini and F. Huc and S. P\'erennes },
title= { On the pathwidth of planar graphs },
journal= { SIAM Journal of Discrete Mathematics },
volume = {23},
number = {3},
pages = {1311-1316},
year = {2009},
month = aug,
pdf= { ftp://ftp-sop.inria.fr/mascotte/Publications/AHP07.pdf },
url = {http://dx.doi.org/10.1137/060670146},
abstract= { In this paper, we present a result concerning the relation between the path-with of a planar graph and the path-width of its dual. More precisely, we prove that for a 3-connected planar graph $G$, $pw(G) \leq 3pw(G^*)+2$. For $4$-connected planar graphs, and more generally for Hamiltonian planar graphs, we prove a stronger bound $\pw(G^*) \leq 2 \ \pw(G)+c$. The best previously known bound was obtained by Fomin and Thilikos who proved that $\pw(G^*) \leq 6 \ \pw(G)+cte$. The proof is based on an algorithm which, given a fixed spanning tree of $G$, transforms any given decomposition of $G$ into one of $G^*$. The ratio of the corresponding parameters is bounded by the maximum degree of the spanning tree. },
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@article{AMN+09,
sorte = "rev-int",
author = {O. Amini and F. Mazoit and N. Nisse and S. Thomass\'e},
title = {Submodular partition functions},
journal = {Discrete Mathematics},
volume = {309},
number = {20},
pages = {6000-6008},
year = {2009},
abstract = {Adapting the method introduced in Graph Minors X, we propose a new proof of the duality between the bramble-number of a graph and its tree-width. Our approach is based on a new definition of submodularity on partition functions which naturally extends the usual one on set functions. The proof does not rely on Menger's theorem, and thus greatly generalises the original one. It thus provides a dual for matroid tree-width. One can also derive all known dual notions of other classical width-parameters from it.},
url = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/},
pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@ARTICLE{APS09,
sorte = "rev-int",
AUTHOR = {O. Amini and S. P\'erennes and I. Sau},
TITLE = {{Hardness and Approximation of Traffic Grooming}},
JOURNAL = {Theoretical Computer Science},
YEAR = {2009},
volume = {410},
number = {38-40},
pages = {3751-3760},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/APS09.pdf},
abstract = {Traffic grooming is a central problem in optical networks. It refers to packing low rate signals into higher speed streams, in order to improve bandwidth utilization and reduce network cost. In WDM networks, the most accepted criterion is to minimize the number of electronic terminations, namely the number of SONET Add-Drop Multiplexers (ADMs). In this article we focus on ring and path topologies. On the one hand, we provide an inapproximability result for Traffic Grooming for fixed values of the grooming factor g, answering authorrmatively the conjecture of Chow and Lin (Networks, 44:194-202, 2004 ). More precisely, we prove that Ring Traffic Grooming for fixed $g\leq 1$ and Path Traffic Grooming for fixed $g \leq 2$ are Apx-complete. That is, they do not accept a PTAS unless P = NP. Both results rely on the fact that finding the maximum number of edge-disjoint triangles in a tripartite graph (and more generally cycles of length $2g + 1$ in a $(2g + 1)$-partite graph of girth $2g + 1$) is Apx-complete. On the other hand, we provide a polynomial-time approximation algorithm for Ring and Path Traffic Grooming, based on a greedy cover algorithm, with an approximation ratio independent of $g$. Namely, the approximation guarantee is ${\mathcal O} (n^{1/3}\log^2(n))$ for any $g\leq 1$, $n$ being the size of the network. This is useful in practical applications, since in backbone networks the grooming factor is usually greater than the network size. Finally, we improve this approximation ratio under some extra assumptions about the request graph.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@Article{BCY09,
author = {J-C. Bermond and R. Correa and M-L. Yu},
title = {Optimal Gathering Protocols on Paths under Interference Constraints},
journal = {Discrete Mathematics},
year= {2009},
OPTkey = {},
volume = {309},
number = {18},
pages = {5574-5587},
month = sep,
URL={http://dx.doi.org/10.1016/j.disc.2008.04.037},
note = {A preliminary version has been presented at CIAC06},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BCY08.pdf},
abstract = {We study the problem of gathering information from the nodes of a multi-hop radio network into a predefined destination node under reachability and interference constraints. In such a network, a node is able to send messages to other nodes within reception distance, but doing so it might create interference with other communications. Thus, a message can only be properly received if the receiver is reachable from the sender and there is no interference from another message being transmitted simultaneously. The network is modeled as a graph, where the vertices represent the nodes of the network and the edges, the possible communications. The interference constraint is modeled by a fixed integer d?1, which implies that nodes within distance d in the graph from one sender cannot receive messages from another node. In this paper, we suppose that each node has one unit-length message to transmit and, furthermore, we suppose that it takes one unit of time (slot) to transmit a unit-length message and during such a slot we can have only calls which do not interfere (called compatible calls). A set of compatible calls is referred to as a round. We give protocols and lower bounds on the minimum number of rounds for the gathering problem when the network is a path and the destination node is either at one end or at the center of the path. These protocols are shown to be optimal for any d in the first case, and for 1?d?4, in the second case.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays={BR, CA},
sorte = "rev-int",

}

@ARTICLE{BBR09,
sorte = "rev-int",
AUTHOR={E. Birmel\'e and J. A. Bondy and B. Reed},
TITLE={Tree-width of graphs without a 3 by 3 grid minor},
JOURNAL = {Discrete Applied Mathematics},
VOLUME = {157},
NUMBER = {},
YEAR = {2009},
PAGES = {2577--2598},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
abstract = {We show that graphs with no minor isomorphic to the 3x3 grid have tree-width at most 7.},
pdf = {http://stat.genopole.cnrs.fr/Members/ebirmele/page-web/publications-1/BBRGrid.pdf},
url ={http://portal.acm.org/citation.cfm?id=1553060} 
}

@article{CHS09,
sorte = "rev-int",
author = {R. Correa and F. Havet and J-S. Sereni},
title = {About a {B}rooks-type theorem for improper colouring},
JOURNAL = {Australasian Journal of Combinatorics},
VOLUME = {43},
YEAR = {2009},
PAGES = {219--230},
abstract={A graph is $k$-improperly \l-colourable if its vertices can be partitioned into \l parts such that each part induces a subgraph of maximum degree at most $k$. A result of Lov\'asz states that for any graph $G$, such a partition exists if $\l\ge\left\lceil\frac{\Delta(G)+1}{k+1}\right\rceil$. When $k=0$, this bound can be reduced by Brooks' Theorem, unless $G$ is complete or an odd cycle. We study the following question, which can be seen as a generalisation of the celebrated Brooks' Theorem to improper colouring: does there exist a polynomial-time algorithm that decides whether a graph $G$ of maximum degree $\Delta$ has $k$-improper chromatic number at most $\lceil \frac{\Delta + 1}{k + 1} \rceil - 1$? We show that the answer is no, unless $\mathcal P = \mathcal NP$, when $\Delta = \ell(k + 1)$, $k \geq 1$ and $\ell + \sqrt{\ell} \leq 2k + 3$. We also show that, if $G$ is planar, $k=1$ or $k=2$, $\Delta = 2k + 2$, and $\ell = 2$, then the answer is still no, unless $\mathcal P = \mathcal NP$. These results answer some questions of Cowen et al. [Journal of Graph Theory 24(3):205-219, 1997].},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/CHS09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {BR},

}

@article{FFN09,
sorte = "rev-int",
author = {F. V. Fomin and P. Fraigniaud and N. Nisse},
title = {Nondeterministic Graph Searching: From Pathwidth to Treewidth},
journal = {Algorithmica},
volume = {53},
number = {3},
pages = {358-373},
year = {2009},
x-pays = {NO},
abstract = {We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial analysis applying to both pathwidth and treewidth. We prove equivalence between this game-theoretic approach and graph decompositions called q -branched tree decompositions, which can be interpreted as a parameterized version of tree decompositions. Path decomposition and (standard) tree decomposition are two extreme cases of q-branched tree decompositions. The equivalence between nondeterministic graph searching and q-branched tree decomposition enables us to design an exact (exponential time) algorithm computing q-branched treewidth for all q, which is thus valid for both treewidth and pathwidth. This algorithm performs as fast as the best known exact algorithm for pathwidth. Conversely, this equivalence also enables us to design a lower bound on the amount of nondeterminism required to search a graph with the minimum number of searchers.},
url = {http://www.springerlink.com/content/42g5tp1588w89186/},
pdf={http://www.springerlink.com/content/42g5tp1588w89186/fulltext.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@Article{Gal09,
author={J. Galtier},
title={Real-time resource allocation for {LEO} satellite constellations},
journal={Wireless Networks},
volume = {15},
number = {6},
pages = {791-803},
year = {2009},
month = aug,
publisher = {Springer},
url = {http://dx.doi.org/10.1007/s11276-007-0075-0},
abstract = {The paper addresses the need of controling the access of terminals with guaranteed ressources on the high dynamic systems offered by LEO satellite constellations. A call-access-control scheme that guarantees the reservation of permanent resources of satellite constellations in $O(\sqrt{n}\log(n))$ time, where n is the number of user present in the system, is described. A tradeoff between computational time of call-access-control and optimization of the use of the spectrum is identified. Some experimental results are presented. },
sorte = "rev-int",

}

@ARTICLE{GGR+09,
sorte = "rev-int",
AUTHOR={J. Geelen and B. Gerards and B. Reed and P. Seymour and A. Vetta},
TITLE={On the odd-minor variant of Hadwiger's conjecture},
JOURNAL = {Journal of Combinatorial Theory Ser. B},
VOLUME = {99},
NUMBER = {},
YEAR = {2009},
PAGES = {20--29},
x-pays = {CA,NL,US},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
abstract = {A Kl-expansion consists of l vertex-disjoint trees, every two of which are joined by an edge. We call such an expansion odd if its vertices can be two-coloured so that the edges of the trees are bichromatic but the edges between trees are monochromatic. We show that, for every l, if a graph contains no odd Kl-expansion then its chromatic number is View the MathML source. In doing so, we obtain a characterization of graphs which contain no odd Kl-expansion which is of independent interest. We also prove that given a graph and a subset S of its vertex set, either there are k vertex-disjoint odd paths with endpoints in S, or there is a set X of at most 2k−2 vertices such that every odd path with both ends in S contains a vertex in X. Finally, we discuss the algorithmic implications of these results.},
pdf = {http://www.math.princeton.edu/~pds/papers/oddhadwiger/paper.ps},
url ={http://portal.acm.org/citation.cfm?id=1465824} 
}

@article{Gir09,
author = {F. Giroire},
title = {Order statistics and estimating cardinalities of massive data sets},
year = {2009},
volume = {157},
number = {2},
pages = {406-427},
journal = {Discrete Applied Mathematics},
url = {http://dx.doi.org/10.1016/j.dam.2008.06.020},
pdf = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/Gir08.pdf},
abstract = {A new class of algorithms to estimate the cardinality of very large multisets using constant memory and doing only one pass on the data is introduced here. It is based on order statistics rather than on bit patterns in binary representations of numbers. Three families of estimators are analyzed. They attain a standard error of using M units of storage, which places them in the same class as the best known algorithms so far. The algorithms have a very simple internal loop, which gives them an advantage in terms of processing speed. For instance, a memory of only 12 kB and only few seconds are sufficient to process a multiset with several million elements and to build an estimate with accuracy of order 2 percent. The algorithms are validated both by mathematical analysis and by experimentations on real internet traffic.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@ARTICLE{HKM+09,
sorte = "rev-int",
AUTHOR={F. Havet and R. Kang and T. M\"uller and J.-S. Sereni},
TITLE={Circular choosability},
JOURNAL = {Journal of Graph Theory},
VOLUME = {61},
NUMBER = {4},
YEAR = {2009},
PAGES = {241--334},
abstract={We study circular choosability, a notion recently introduced by Mohar and by Zhu. First, we provide a negative answer to a question of Zhu about circular cliques. We next prove that $\cch(G) = O\left( \ch(G) + \ln |V(G)| \right)$ for every graph $G$. We investigate a generalisation of circular choosability, the circular $f$-choosability, where $f$ is a function of the degrees. We also consider the circular choice number of planar graphs. Mohar asked for the value of $\tau := \sup {\cch(G) : G\text{ is planar}}$, and we prove that $6\le\tau\le8$, thereby providing a negative answer to another question of Mohar. We also study the circular choice number of planar and outerplanar graphs with prescribed girth, and graphs with bounded density.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/HKM+09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {CA, CZ} 
}

@ARTICLE{Hav09,
sorte = "rev-int",
AUTHOR={F. Havet},
TITLE={Choosability of the square of planar subcubic graphs with large girth},
JOURNAL = {Discrete Mathematics},
VOLUME = {309},
NUMBER = {},
YEAR = {2009},
PAGES = {3553--3563},
abstract={ We show that the choice number of the square of a subcubic graph with maximum average degree less than $18/7$ is at most $6$. As a corollary, we get that the choice number of the square of a subcubic planar graph with girth at least $9$ is at most $6$. We then show that the choice number of the square of a subcubic planar graph with girth at least $13$ is at most $5$.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/Hav07.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@Article{HKS09,
sorte = "rev-int",
AUTHOR={F. Havet and R. Kang and J.-S. Sereni},
TITLE={Improper Colouring of Unit Disk Graphs},
JOURNAL = {Networks},
VOLUME = {54},
NUMBER = {3},
YEAR = {2009},
PAGES = {150--164},
abstract={Motivated by a satellite communications problem, we consider a generalised colouring problem on unit disk graphs. A colouring is \emph{$k$-improper} if no more than $k$ neighbours of every vertex have the same colour as that assigned to the vertex. The \emph{$k$-improper chromatic number $\chi^k(G)$} is the least number of colours needed in a $k$-improper colouring of a graph $G$. The main subject of this work is analysing the complexity of computing $\chi^k$ for the class of unit disk graphs and some related classes, e.g.~hexagonal graphs and interval graphs. We show NP-completeness in many restricted cases and also provide both positive and negative approximability results. Due to the challenging nature of this topic, many seemingly simple questions remain: for example, it remains open to determine the complexity of computing $\chi^k$ for unit interval graphs.} 
}

@ARTICLE{HaTh09,
sorte = "rev-int",
AUTHOR={F. Havet and S. Thomass\'e},
TITLE={Complexity of $(p,1)$-total labelling},
JOURNAL = {Dicrete Applied Mathematics},
VOLUME = {157},
NUMBER = {},
YEAR = {2009},
PAGES = {2859--2870},
abstract={ A {\it $(p,1)$-total labelling} of a graph $G=(V,E)$ is a total coloring $L$ from $V\cup E$ into ${0,\dots ,l}$ such that $|L(v)-L(e)|\geq p$ whenever an edge $e$ is incident to a vertex $v$. The minimum $l$ for which $G$ admits a $(p,1)$-total labelling is denoted by $\lambda_p(G)$. The case $p=1$ corresponds to the usual notion of total colouring, which is NP-hard to compute even for cubic bipartite graphs~\cite{MDSA94}. In this paper we assume $p\geq 2$. It is easy to show that $\lambda_p(G)\geq \Delta +p-1$, where $\Delta$ is the maximum degree of $G$. Moreover, when $G$ is bipartite, $\Delta +p$ is an upper bound for $\lambda_p(G)$, leaving only two possible values. In this paper, we completely settle the computational complexity of deciding whether $\lambda_p(G)$ is equal to $\Delta +p-1$ or to $\Delta +p$ when $G$ is bipartite. This is trivial when $\Delta \leq p$, polynomial when $\Delta =3$ and $p=2$, and NP-complete in the remaining cases.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/HaTh09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@ARTICLE{HSZ09,
sorte = "rev-int",
AUTHOR = {F. Huc and I. Sau and J. \v{Z}erovnik},
TITLE = {{$(\ell,k)$-Routing on Plane Grids}},
JOURNAL = {Journal of Interconnection Networks},
volume = {10},
number = {1-2},
pages = {27-57},
year = {2009},
abstract = {The packet routing problem plays an essential role in communication networks. It involves how to transfer data from some origins to some destinations within a reasonable amount of time. In the $(\ell,k)$-routing problem, each node can send at most $\ell$ packets and receive at most $k$ packets. Permutation routing is the particular case $\ell=k=1$. In the $r$-central routing problem, all nodes at distance at most $r$ from a fixed node $v$ want to send a packet to $v$. In this article we study the permutation routing, the $r$-central routing and the general $(\ell,k)$-routing problems on plane grids, that is square grids, triangular grids and hexagonal grids. We use the \emph{store-and-forward} $\Delta$-port model, and we consider both full and half-duplex networks. The main contributions are the following: \begin{itemize} \item[1.] Tight permutation routing algorithms on full-duplex hexagonal grids, and half duplex triangular and hexagonal grids. \item[2.] Tight $r$-central routing algorithms on triangular and hexagonal grids. \item[3.] Tight $(k,k)$-routing algorithms on square, triangular and hexagonal grids. \item[4.] Good approximation algorithms (in terms of running time) for $(\ell,k)$-routing on square, triangular and hexagonal grids, together with new lower bounds on the running time of any algorithm using shortest path routing. \end{itemize} \noindent All these algorithms are completely distributed, i.e. can be implemented independently at each node. Finally, we also formulate the $(\ell,k)$-routing problem as a \textsc{Weighted Edge Coloring} problem on bipartite graphs.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/HSZ09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@article{INS09,
sorte = "rev-int",
author = {D. Ilcinkas and N. Nisse and D. Soguet},
title = {The Cost of Monotonicity in Distributed Graph Searching},
journal = {Distributed Computing},
volume = {22},
number = {2},
year = {2009},
pages = {117-127},
abstract = {Blin et al. (TCS 2008) proposed a dis- tributed protocol enabling the smallest possible num- ber of searchers to clear any unknown graph in a de- centralized manner. However, the strategy that is actu- ally performed lacks of an important property, namely the monotonicity. This paper deals with the smallest number of searchers that are necessary and sufficient to monotonously clear any unknown graph in a decen- tralized manner. The clearing of the graph is required to be connected, i.e., the clear part of the graph must remain permanently connected, and monotone, i.e., the clear part of the graph only grows. We prove that a dis- tributed protocol clearing any unknown n-node graph in a monotone connected way, in a decentralized set- ting, can achieve but cannot beat competitive ratio of Theta(log n /n), compared with the centralized minimum number of searchers. Moreover, our lower bound holds even in a synchronous setting, while our constructive upper bound holds even in an asynchronous setting.},
url = {http://www.springerlink.com/content/l8371258177lv2j0/},
pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/IlcinkasNisseSoguet.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@article{JP09,
sorte = "rev-int",
author={A. Jarry and S. P\'erennes},
title={Disjoint Path in symmetric Graphs},
journal={Discrete Applied Mathematics},
volume={157},
number = {1},
pages={90-97},
year={2009},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@ARTICLE{KLR09,
sorte = "rev-int",
AUTHOR={K. Kawarabayashi and O. Lee and B. Reed},
TITLE={Removable cycles in non-bipartite graphs},
JOURNAL = {Journal of Combinatorial Theory Ser. B},
VOLUME = {99},
NUMBER = {},
YEAR = {2009},
PAGES = {30--38},
x-pays = {JP,BR},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
abstract = {In this paper we prove the following result. Suppose that s and t are vertices of a 3-connected graph G such that G-s-t is not bipartite and there is no cutset X of size three in G for which some component U of G-X is disjoint from {s,t}. Then either (1) G contains an induced path P from s to t such that G-V(P) is not bipartite or (2) G can be embedded in the plane so that every odd face contains one of s or t. Furthermore, if (1) holds then we can insist that G-V(P) is connected, while if G is 5-connected then (1) must hold and P can be chosen so that G-V(P) is 2-connected.},
pdf = {},
url ={http://portal.acm.org/citation.cfm?id=1465820} 
}

@ARTICLE{KaRe09,
sorte = "rev-int",
AUTHOR={K. Kawarabayashi and B. Reed},
TITLE={Highly parity linked graphs},
JOURNAL = {Combinatorica},
VOLUME = {29},
NUMBER = {},
YEAR = {2009},
PAGES = {215--225},
x-pays = {JP},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
abstract = {A graph G is k-linked if G has at least 2k vertices, and for any 2k vertices x 1,x 2, …, x k ,y 1,y 2, …, y k , G contains k pairwise disjoint paths P 1, …, P k such that P i joins x i and y i for i = 1,2, …, k. We say that G is parity-k-linked if G is k-linked and, in addition, the paths P 1, …, P k can be chosen such that the parities of their length are prescribed. Thomassen [22] was the first to prove the existence of a function f(k) such that every f(k)-connected graph is parity-k-linked if the deletion of any 4k-3 vertices leaves a nonbipartite graph. In this paper, we will show that the above statement is still valid for 50k-connected graphs. This is the first result that connectivity which is a linear function of k guarantees the Erdős-Pósa type result for parity-k-linked graphs.},
pdf = {},
url ={http://portal.acm.org/citation.cfm?id=1569773} 
}

@article{KLN+09,
sorte = "rev-int",
author = {R. Klasing and Z. Lotker and A. Navarra and S. P\'erennes},
title = {From Balls and Bins to Points and Vertices},
journal = {Algorithmic Operations Research (AlgOR)},
volume = {4},
number = {2},
pages = {133-143},
year = {2009},
abstract = {Given a graph $G = (V, E)$ with $|V| = n$, we consider the following problem. Place $m = n$ points on the vertices of G independently and uniformly at random. Once the points are placed, relocate them using a bijection from the points to the vertices that minimizes the maximum distance between the random place of the points and their target vertices. We look for an upper bound on this maximum relocation distance that holds with high probability (over the initial placements of the points). For general graphs and in the case $m \leq n$, we prove the $\#P$-hardness of the problem and that the maximum relocation distance is ${\cal O}(\sqrt{n})$ with high probability. We present a Fully Polynomial Randomized Approximation Scheme when the input graph admits a polynomial-size family of witness cuts while for trees we provide a 2-approximation algorithm. Many applications concern the variation in which $m = (1 − q)n for some 0 < q < 1$. We provide several bounds for the maximum relocation distance according to different graph topologies.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@ARTICLE{LMRT09,
sorte = "rev-int",
AUTHOR={B. L\'ev\^eque and F. Maffray and B. Reed and N. Trotignon},
TITLE={Coloring Artemis graphs},
JOURNAL = {Theoretical Computer Science},
VOLUME = {410},
NUMBER = {},
YEAR = {2009},
PAGES = {2234--2240},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
abstract = {We consider the class of graphs that contain no odd hole, no antihole, and no ''prism'' (a graph consisting of two disjoint triangles with three disjoint paths between them). We give an algorithm that can optimally color the vertices of these graphs in time O(n^2m).},
pdf = {www.lirmm.fr/~leveque/Publications/ColArtemis-TCS.pdf},
url ={http://portal.acm.org/citation.cfm?id=1530984} 
}

@article{MSZ09b,
sorte = "rev-int",
AUTHOR = {G. B. Mertzios and I. Sau and S. Zaks},
TITLE = {{A New Intersection Model and Improved Algorithms for Tolerance Graphs}},
JOURNAL = {SIAM Journal on Discrete Mathematics},
year = {2009},
volume = {23},
issue = {4},
pages = {1800-1813},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/MSZ09b.pdf},
url = {http://dx.doi.org/10.1137/09075994X},
abstract = {Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This class of graphs, which generalizes in a natural way both interval and permutation graphs, has attracted many research efforts since their introduction in [10], as it finds many important applications in constraint-based temporal reasoning, resource allocation, and scheduling problems, among others. In this article we propose the first non-trivial intersection model for general tolerance graphs, given by three-dimensional parallelepipeds, which extends the widely known intersection model of parallelograms in the plane that characterizes the class of bounded tolerance graphs. Apart from being important on its own, this new representation also enables us to improve the time complexity of three problems on tolerance graphs. Namely, we present optimal $O(n log n)$ algorithms for computing a minimum coloring and a maximum clique, and an $O(n^2)$ algorithm for computing a maximum weight independent set in a tolerance graph with $n$ vertices, thus improving the best known running times $O(n^2)$ and $O(n^3)$ for these problems, respectively},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {ES,IS,DE},

}

@article{NiSo09,
sorte = "rev-int",
author = {N. Nisse and D. Soguet},
title = {Graph Searching with Advice},
journal = {Theoretical Computer Science},
year = {2009},
volume = {410},
number = {14},
pages = {1307-1318},
abstract = {Fraigniaud et al. [L. Blin, P. Fraigniaud, N. Nisse, S. Vial, Distributing chasing of network intruders, in: 13th Colloquium on Structural Information and Communication Complexity, SIROCCO, in: LNCS, vol. 4056, Springer-Verlag, 2006, pp. 70--84] introduced a new measure of difficulty for a distributed task in a network. The smallest number of bits of advice of a distributed problem is the smallest number of bits of information that has to be available to nodes in order to accomplish the task efficiently. Our paper deals with the number of bits of advice required to perform efficiently the graph searching problem in a distributed setting. In this variant of the problem, all searchers are initially placed at a particular node of the network. The aim of the team of searchers is to clear a contaminated graph in a monotone connected way, i.e., the cleared part of the graph is permanently connected, and never decreases while the search strategy is executed. Moreover, the clearing of the graph must be performed using the optimal number of searchers, i.e. the minimum number of searchers sufficient to clear the graph in a monotone connected way in a centralized setting. We show that the minimum number of bits of advice permitting the monotone connected and optimal clearing of a network in a distributed setting is $\Theta(nlogn)$, where n is the number of nodes of the network. More precisely, we first provide a labelling of the vertices of any graph G, using a total of O(nlogn) bits, and a protocol using this labelling that enables the optimal number of searchers to clear G in a monotone connected distributed way. Then, we show that this number of bits of advice is optimal: any distributed protocol requires $\Omega(nlogn)$ bits of advice to clear a network in a monotone connected way, using an optimal number of searchers.},
url = {http://www.springerlink.com/content/10t1l145m1182477/},
pdf={http://www.springerlink.com/content/10t1l145m1182477/fulltext.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@article{Nis09,
sorte = "rev-int",
author = {N. Nisse},
title = {Connected graph searching in chordal graphs},
journal = {Discrete Applied Mathematics},
volume = {157},
number = {12},
pages = {2603-2610},
year = {2009},
abstract = {Graph searching was introduced by Parson [T. Parson, Pursuit-evasion in a graph, in: Theory and Applications of Graphs, in: Lecture Notes in Mathematics, Springer-Verlag, 1976, pp. 426--441]: given a contaminated graph G (e.g., a network containing a hostile intruder), the search number s(G) of the graph G is the minimum number of searchers needed to clear the graph (or to capture the intruder). A search strategy is connected if, at every step of the strategy, the set of cleared edges induces a connected subgraph. The connected search number cs(G) of a graph G is the minimum k such that there exists a connected search strategy for the graph G using at most k searchers. This paper is concerned with the ratio between the connected search number and the search number. We prove that, for any chordal graph G of treewidth tw(G), cs(G)/s(G)=O(tw(G)). More precisely, we propose a polynomial-time algorithm that, given any chordal graph G, computes a connected search strategy for G using at most (tw(G)+2)(2s(G)-1) searchers. Our main tool is the notion of connected tree-decomposition. We show that, for any connected graph G of chordality k, there exists a connected search strategy using at most (tw(G)^{k/2}+2)(2s(T)-1) searchers where T is an optimal tree-decomposition of G.},
url = {http://portal.acm.org/citation.cfm?id=1553062},
pdf = {http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6TYW-4TC2RT8-1-5&_cdi=5629&_user=10&_orig=search&_coverDate=09%2F03%2F2008&_sk=999999999&view=c&wchp=dGLbVtb-zSkzV&md5=7b91cf0e2d0c8e82bebf037c73af4ad1&ie=/sdarticle.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@inproceedings{ANB09,
author = {E. Altman and P. Nain and J-C. Bermond},
title = {Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks},
booktitle= {INFOCOM 2009},
year= {2009},
month = apr,
pages = {1431 - 1439},
address = {Rio De Janeiro, Brazil },
OPTnote = {},
OPTannote = {},
url = {http://dx.doi.org/10.1109/INFCOM.2009.5062059},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond//PUBLIS/ABN08.pdf},
abstract = {This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes forms a delay tolerant (ad hoc) network (DTN). The goal of the paper is to study efficient ways for distributing evolving files within DTNs and for managing dynamically their content. We specify to dynamic files where not only the latest version is useful but also previous ones; we restrict however to files where a file has no use if another more recent version is available. There are $N+1$ mobile nodes including a {\em single} source which at some points in time makes available a new version of a {\em single} file $F$. We consider both the cases when (a) nodes do not cooperate and (b) nodes cooperate. In case (a) only the source may transmit a copy of the latest version of $F$ to a node that it meets, while in case (b) any node may transmit a copy of $F$ to a node that it meets. A file management policy is a set of rules specifying when a node may send a copy of $F$ to a node that it meets. The objective is to find file management policies which maximize some system utility functions under a constraint on the resource consumption. Both myopic ({\em static}) and state-dependent ({\em dynamic}) policies are considered, where the state of a node is the age of the copy of $F$ it carries. Scenario (a) is studied under the assumption that the source updates $F$ at discrete times $t=0,1,\ldots$. During a slot $[t,t+1)$ the source meets any node with a fixed probability. We find the optimal static (resp. dynamic) policy which maximizes a general utility function under a constraint on the number of transmissions within a slot. In particular, we show the existence of a threshold dynamic policy. In scenario (b) $F$ is updated at random points in time, with the consequence that between two meetings with the source a node does not know the age evolution of the version of $F$ it holds. Under Markovian assumptions regarding nodes mobility and update frequency of $F$, we study the stability of the system (aging of the nodes) and derive an (approximate) optimal static policy. We then revisit scenario (a) when the source does not know parameter $N$ (node population) and $q$ (node meeting probability) and derive a stochastic approximation algorithm which we show to converge to the optimal static policy found in the complete information setting. Numerical results illustrate the respective performance of optimal static and dynamic policies as well as the benefit of node cooperation.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@InProceedings{ACGH09a,
author = {J. Araujo and N. Cohen and F. Giroire and F. Havet},
title = {Good edge-labelling of graphs},
booktitle = {proceedings of the Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'09)},
OPTcrossref = {},
OPTkey = {},
pages = {275--280},
year = {2009},
OPTeditor = {},
volume = {35},
series = {Electronic Notes in Discrete Mathematics},
address = {Gramado, Brazil},
month = dec,
OPTorganization = {},
publisher = {Springer},
OPTannote = {},
abstract = {A good edge-labelling of a graph G is a labelling of its edges such that for any two distinct vertices u, v, there is at most one (u,v)-path with non-decreasing labels. This notion was introduced in [J-C. Bermond, M. Cosnard, and S. Pérennes. Directed acyclic graphs with unique path property. Technical Report RR-6932, INRIA, May 2009] to solve wavelength assignment problems for specific categories of graphs. In this paper, we aim at characterizing the class of graphs that admit a good edge-labelling. First, we exhibit infinite families of graphs for which no such edge-labelling can be found. We then show that deciding if a graph admits a good edge-labelling is NP-complete. Finally, we give large classes of graphs admitting a good edge-labelling: C3-free outerplanar graphs, planar graphs of girth at least 6, subcubic {C3,K2,3}-free graphs.},
OPTurl = {},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/ACGH09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays={BR},
sorte = "conf-int",

}

@InProceedings{ArLi09,
author = {Araujo, J. and Linhares Sales, C.},
title = {Grundy number on {$P_4$}-classes},
booktitle = {proceedings of the Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'09)},
OPTcrossref = {},
OPTkey = {},
pages = {21--27},
year = {2009},
OPTeditor = {},
volume = {35},
series = {Electronic Notes in Discrete Mathematics},
address = {Gramado, Brazil},
month = dec,
OPTorganization = {},
publisher = {Springer},
OPTannote = {},
abstract = {In this article, we define a new class of graphs, the fat-extended P4-laden graphs, and we show a polynomial time algorithm to determine the Grundy number of the graphs in this class. This result implies that the Grundy number can be found in polynomial time for any graph of the following classes: P4-reducible, extended P4-reducible, P4-sparse, extended P4-sparse, P4-extendible, P4-lite, P4-tidy, P4-laden and extended P4-laden, which are all strictly contained in the fat-extended P4-laden class.},
OPTurl = {},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/ArLi09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays={BR},
sorte = "conf-int",

}

@InProceedings{AMC09,
author = {J. Araujo and P. Moura and M. Camp\^{e}lo},
title = {Sobre a complexidade de Colora\c c\~ao Mista},
booktitle = {Encontro Regional de Pesquisa Operacional do Nordeste},
OPTcrossref = {},
OPTkey = {},
pages = {1--10},
year = {2009},
OPTeditor = {},
series = {},
address = {Fortaleza, Brazil},
month = dec,
OPTorganization = {},
publisher = {},
OPTannote = {},
abstract = {Grafos mistos s˜ao estruturas matem´aticas que mesclam caracter´ısticas de grafos direcionados e n˜ao-direcionados. Formalmente, um grafo misto pode ser definido por uma tripla GM = (V; A;E), onde V , A e E representam, respectivamente, um conjunto de v´ertices, de arcos e de arestas. Uma k-colorac¸ ˜ao mista de GM = (V; A;E) ´e func¸ ˜ao c : V ! f0; : : : ; k ¡ 1g tal que c(u) < c(v), se (u; v) 2 A, e c(u) 6= c(v), se [u; v] 2 E. O problema de Colorac¸ ˜ao Mista consiste em determinar o n´umero crom´atico misto de GM, denotado por ÂM(GM), que ´e menor inteiro k tal que GM admite uma k-colorac¸ ˜ao mista. Esse problema modela variac¸ ˜oes de problemas de escalonamento que consideram simultaneamente restric¸ ˜oes de precedˆencia e de compartilhamento de recursos. Neste trabalho, mostramos que Colorac¸ ˜ao Mista ´e NP-dif´ıcil para as classes dos grafos cordais, dos grafos linha de grafos bipartidos e dos grafos linha de grafos periplanares. },
OPTurl = {},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/AMC10.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},
x-pays={BR},
sorte = "conf-nat",

}

@InProceedings{BJF+09,
author = {D. Barman and J. {C}handrashekar and N. Taft and M. Faloutsos and L. Huang and F. Giroire},
title = {Impact of IT Monoculture on Behavioral End Host Intrusion Detection},
OPTtitle = {Debating IT Monoculture for End Host Intrusion Detection},
booktitle = {ACM SIGCOMM Workshop on Research on Enterprise Networking -- WREN},
OPTcrossref = {},
OPTkey = {},
pages = {27--36},
year = {2009},
editor = {},
OPTvolume = {XXXX},
OPTnumber = {XXXX},
OPTseries = {},
OPTaddress = {},
month = aug,
address = {Barcelona, Spain},
organization = {ACM},
OPTpublisher = {},
OPTannote = {},
abstract = {In this paper, we study the impact of today's IT policies, defined based upon a monoculture approach, on the performance of endhost anomaly detectors. This approach leads to the uniform configuration of Host intrusion detection systems (HIDS) across all hosts in an enterprise networks. We assess the performance impact this policy has from the individual's point of view by analyzing network traces collected from 350 enterprise users. We uncover a great deal of diversity in the user population in terms of the “tail†behavior, i.e., the component which matters for anomaly detection systems. We demonstrate that the monoculture approach to HIDS configuration results in users that experience wildly different false positive and false negatives rates. We then introduce new policies, based upon leveraging this diversity and show that not only do they dramatically improve performance for the vast majority of users, but they also reduce the number of false positives arriving in centralized IT operation centers, and can reduce attack strength.},
pdf = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/BCF09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {US},
sorte = "conf-int",

}

@InProceedings{BCM+09b,
author = {J-C. Bermond and D. Coudert and J. Moulierac and S. Perennes and H. Rivano and I. Sau and F. {Solano Donado}},
x-pays = {ES,PL},
title = {{MPLS} label stacking on the line network},
OPTcrossref = {},
OPTkey = {},
booktitle = {IFIP Networking},
pages = {809-820},
year = {2009},
editor = {L. Fratta et al.},
volume = {5550},
OPTnumber = {},
series = {Lecture Notes in Computer Science},
address = {Aachen, Germany},
month = may,
OPTorganization = {},
publisher = {Springer},
OPTnote = {},
OPTannote = {},
url = {http://hal.inria.fr/inria-00354267/},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/bermond09mpls.pdf},
abstract = {All-Optical Label Switching (AOLS) is a new technology that performs forwarding without any Optical-Electrical-Optical (OEO) conversions. In this report, we study the problem of routing a set of requests in AOLS networks with the aim of minimizing the number of labels required to ensure the forwarding. In order to spare the label space, we consider label stacking, allowing the configuration of tunnels. We study particularly this network design problem when the network is a line. We provide an exact algorithm for the case in which all the requests have a common source and present some approximation algorithms and heuristics when an arbitrary number of sources are distributed over the line. We contrast the performance of our proposed algorithms by simulations.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@InProceedings{BCM+09d,
author = {J-C. Bermond and D. Coudert and J. Moulierac and S. Perennes and I. Sau and F. {Solano Donado}},
x-pays = {ES,PL},
title = {Designing Hypergraph Layouts to {GMPLS} Routing Strategies},
OPTcrossref = {},
OPTkey = {},
booktitle = {16th International Colloquium on Structural Information and Communication Complexity (SIROCCO)},
pages = {57--71},
year = {2009},
OPTeditor = {},
volume = {5869},
OPTpages = {YYYY},
OPTnumber = {},
series = {Lecture Notes in Computer Science},
address = {Piran, Slovenia},
month = may,
OPTorganization = {},
publisher = {Springer},
OPTnote = {},
OPTannote = {},
url = {http://hal.inria.fr/inria-00428685/fr/},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/bermond09designing.pdf},
abstract = { All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any Optical-Electrical-Optical (OEO) conversions. In this paper, we study the problem of routing a set of requests in AOLS networks using GMPLS technology, with the aim of minimizing the number of labels required to ensure the forwarding. We first formalize the problem by associating to each routing strategy a logical hypergraph whose hyperedges are dipaths of the physical graph, called \emph{tunnels} in GMPLS terminology. Such a hypergraph is called a \emph{hypergraph layout}, to which we assign a cost function given by its physical length plus the total number of hops traveled by the traffic. Minimizing the cost of the design of an AOLS network can then be expressed as finding a minimum cost hypergraph layout. We prove hardness results for the problem, namely $C \log n$ hardness for directed networks and non-existence of \textsc{PTAS} for undirected networks, where $C $ is a a positive constant and $n$ is the number of nodes of the network. These hardness results hold even is the traffic instance is a partial broadcast. On the other hand, we provide an $\mathcal{O}(\log n)$-approximation algorithm to the problem for a general network. Finally, we focus on the case where the physical network is a path, providing a polynomial-time dynamic programming algorithm for a bounded number of sources, thus extending the algorithm of~\cite{BCM+09b} for a single source. },
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@InProceedings{BMN09,
author = {J-C. Bermond and D. Mazauric and P. Nain},
title = {Algorithmes distribu\'es d'ordonnancement dans les r\'eseaux sans-fil},
booktitle = {10\`emes Journ\'ees Doctorales en Informatique et R\'eseaux (JDIR)},
OPTcrossref = {},
OPTkey = {},
pages = {},
year = {2009},
editor = {},
volume = {},
OPTnumber = {},
series = {},
address = {Belfort, France},
month = feb,
OPTorganization = {},
publisher = {},
OPTannote = {},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/BMN09.pdf},
abstract = {Nous consid\'erons dans cet article le probl\`eme d'ordonnancement distribu\'e dans les r\'eseaux sans-fil. En raison des interf\'erences dans ce type de r\'eseau, ne peuvent \^etre activ\'es simultan\'ement que des liens n'interf\'erant pas entre eux. Par exemple dans un mod\`ele primaire, on ne peut activer que des liens deux \`a deux non adjacents. Nous nous pla\c cons dans un contexte d'arriv\'ee al\'eatoire de messages et l'objectif est d'assurer un bon comportement du r\'eseau en particulier d'assurer la stabilit\'e des files d'attente, en limitant le nombre moyen de messages en attente. Des algorithmes centralis\'es permettant de d\'ecider quels liens sont activ\'es \`a chaque \'etape existent mais ils supposent une connaissance globale du r\'eseau et sont peu adapt\'es aux applications. Il est donc n\'ecessaire de concevoir des algorithmes distribu\'es qui utilisent une connaissance tr\`es locale du r\'eseau. Nous proposons dans cet article deux algorithmes distribu\'es, valides quelque soit le mod\`ele d'interf\'erence binaire et avec une phase de contr\^ole de dur\'ee constante, am\'eliorant les algorithmes existants v\'erifiant uniquement l'un ou l'autre de ces deux crit\`eres.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},
sorte = "conf-nat",

}

@inProceedings{BNRR09c,
author = {J-C. Bermond and N. Nisse and P. Reyes and H. Rivano},
title = {Minimum delay Data Gathering in Radio Networks},
booktitle = {Proceedings of the 8th international conference on Ad Hoc Networks and Wireless (AdHoc-Now)},
year = {2009},
pages = {69-82},
volume = {5793},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
url = {http://hal.inria.fr/inria-00363908/fr/},
pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/adHocNow09.pdf},
abstract = {The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the time is slotted and that during one time slot (step) each node can transmit to one of its neighbours at most one data item. Each device is equipped with a half duplex interface; so a node cannot both receive and transmit simultaneously. During a step only non interfering transmissions can be done. In other words, the non interfering calls done during a step will form a matching. The aim is to minimize the number of steps needed to send to the base station a set of messages generated by the nodes, this completion time is also denoted makespan of the call scheduling. The best known algorithm for open-grids was a multiplicative 1.5-approximation algorithm [Revah, Segal 07]. In such topologies, we give a very simple +2 approximation algorithm and then a more involved +1 approximation algorithm. Moreover, our algorithms work when no buffering is allowed in intermediary nodes, i.e., when a node receives a message at some step, it must transmit it during the next step.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@InProceedings{BNRR09,
author = {J-C. Bermond and N. Nisse and P. Reyes and H. Rivano},
title = {Fast Data Gathering in Radio Grid Networks},
booktitle = {11\`emes Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel'09)},
pages = {4p},
year = {2009},
month = jun,
url = {http://www.lif.univ-mrs.fr/algotel09},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/BNRR09.pdf},
abstract = {Nous présentons des algorithmes efficaces pour la collecte d'informations par une station de base au sein d'un réseau sans-fil multi sauts en présence d'interférences. Nous nous focalisons sur les réseaux en grille car ils sont un bon modèle des réseaux d'accès comme des réseaux aléatoires de capteurs. Le temps est divisé en étapes élémentaires. Au cours d'une étape, un nœud peut transmettre au plus un message � l'un de ces voisins. Chaque appareil est équipé d'un interface half duplex et ne peut donc émettre et recevoir � la même étape. Ainsi, au cours d'une étape, l'ensemble des transmissions valides induit un couplage de la grille. Le problème consiste � minimiser le nombre d'étapes nécessaires � la collecte de tous les messages par la station de base. Le meilleur algorithme connu était une 3/2 approximation. Nous donnons un algorithme très simple qui approche l'optimum � 2 près, puis nous présentons un algorithme plus évolué qui est une +1 approximation. Nos résultats sont valides lorsque les appareils ne disposent d'aucune mémoire tampon et doivent retransmettre un message � l'étape suivant sa réception.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},
sorte = "conf-nat",

}

@inproceedings{BFM+09,
sorte = "conf-int",
author = {V. Bil{\`o} and M. Flammini and G. Monaco and L. Moscardelli},
title = {On the performances of Nash Equilibria in Isolation Games},
booktitle= {Proceedings of the 15th International Computing and Combinatorics Conference (COCOON 2009)},
address= {Niagara Falls, New York, U.S.A.},
year= {2009},
month = jul,
volume = {5609},
pages = {17-26},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
OPTnote = {},
OPTannote = {},
url = {http://www.springerlink.com/content/t02154u9h640t1xx/},
PDF={http://www.springerlink.com/content/t02154u9h640t1xx/},
abstract = {We study the performances of Nash equilibria in isolation games, a class of competitive location games recently introduced by Zhao et all. For all the cases in which the existence of Nash equilibria has been shown, we give tight or asymptotically tight bounds on the prices of anarchy and stability under the two classical social functions mostly investigated in the scienti¯c literature, namely, the minimum utility per player and the sum of the players' utilities. Moreover, we prove that the convergence to Nash equilibria is not guaranteed in some of the not yet analyzed cases.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},

}

@InProceedings{CCF09,
author = {A. Casteigts and S. Chaumette and A. Ferreira},
title = {Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks},
booktitle = {Proc. of 16th Intl. Conference on Structural Information and Communication Complexity (SIROCCO'09)},
year = 2009,
month = may,
address = {Piran, Slovenia},
series = {Lecture Notes in Computer Science},
volume = {5869},
pages = {126-140},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/CCF09.pdf},
publisher = {Springer-Verlag},
abstract = {Besides the complexity in time or in number of messages, a common approach for analyzing distributed algorithms is to look at their assumptions on the underlying network. This paper focuses on the study of such assumptions in dynamic networks, where the connectivity is expected to change, predictably or not, during the execution. Our main contribution is a theoretical framework dedicated to such analysis. By combining several existing components (local computations, graph relabellings, and evolving graphs), this framework allows to express detailed properties on the network dynamics and to prove that a given property is necessary, or sufficient, for the success of an algorithm. Consequences of this work include (i)~the possibility to compare distributed algorithms on the basis of their topological requirements, (ii)~the elaboration of a formal classification of dynamic networks with respect to these properties, and (iii)~the possibility to check automatically whether a network trace belongs to one of the classes, and consequently to know which algorithm should run on it.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{CF+09,
author = {N. Cohen and F. V. Fomin and G. Gutin and E. J. Kim and S. {S}aurabh and A. Yeo},
title = {Algorithm for Finding {\it }-Vertex Out-trees and Its Application to {\it }-Internal Out-branching Problem},
booktitle = {15th Annual International Conference on Computing and Combinatorics (COCOON)},
year = {2009},
pages = {37-46},
volume = {5609},
series = {Lecture Notes in Computer Science},
url = {http://dx.doi.org/10.1007/978-3-642-02882-3_5},
abstract = {An out-tree T is an oriented tree with exactly one vertex of in-degree zero and a vertex x of T is called internal if its out-degree is positive. We design randomized and deterministic algorithms for deciding whether an input digraph contains a subgraph isomorphic to a given out-tree with k vertices. Both algorithms run in O∗(5.704^k) time. We apply the deterministic algorithm to obtain an algorithm of runtime O∗(c^k), where c is a constant, for deciding whether an input digraph contains a spanning out-tree with at least k internal vertices. This answers in affirmative a question of Gutin, Razgon and Kim (Proc. AAIM'08).},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/CF+09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {NO, UK},
sorte = "conf-int",

}

@InProceedings{CHM09b,
AUTHOR={N. Cohen and F. Havet and T. M{\"u}ller},
TITLE="Acyclic edge-colouring of planar graphs",
booktitle ="European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009)",
series = "Electronic Notes on Discrete Mathematics",
PAGES = "417-421",
VOLUME = "34",
year = "2009",
address = "Bordeaux, France",
month = sep,
abstract={A proper edge-colouring with the property that every cycle contains edges of at least three distinct colours is called an {\it acyclic edge-colouring}. The {\it acyclic chromatic index} of a graph $G$, denoted $\chi'_a(G)$ is the minimum $k$ such that $G$ admits an {\it acyclic edge-colouring} with $k$ colours. We conjecture that if $G$ is planar and $\Delta(G)$ is large enough then $\chi'_a(G)=\Delta(G)$. We settle this conjecture for planar graphs with girth at least $5$ and outerplanar graphs. We also show that if $G$ is planar then $\chi'_a(G)\leq \Delta(G) + 25$.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/CHM09b.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {IL},
sorte = "conf-int",

}

@InProceedings{CGS09b,
author = {D. Coudert and F. Giroire and I. Sau},
title = {Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids},
booktitle = {20th International Workshop on Combinatorial Algorithms -- IWOCA},
OPTcrossref = {},
OPTkey = {},
pages = {134-145},
year = {2009},
editor = {J. Kratochv{\'\i}l and M. Miller},
volume = {5874},
OPTnumber = {XXXX},
series = {Lecture Notes in Computer Science},
address = {Hradec nad Moravic{\'\i}, Czech Republic},
month = jun,
OPTorganization = {},
publisher = {Springer},
OPTnote = {to appear},
OPTannote = {},
abstract = { A \emph{circuit} in a simple undirected graph $G=(V,E)$ is a sequence of vertices $\{v_1,v_2,\ldots,v_{k+1}\}$ such that $v_1=v_{k+1}$ and $\{v_i,v_{i+i}\} \in E$ for $i=1,\ldots,k$. A circuit $C$ is said to be \emph{edge-simple} if no edge of $G$ is used twice in $C$. In this article we study the following problem: which is the largest integer $k$ such that, given any subset of $k$ ordered vertices of an infinite square grid, there exists an edge-simple circuit visiting the $k$ vertices in the prescribed order? We prove that $k=10$. To this end, we first provide a counterexample implying that $k<11$. To show that $k\geq 10$, we introduce a methodology, based on the notion of core graph, to reduce drastically the number of possible vertex configurations, and then we test each one of the resulting configurations with an \textsc{ILP} solver.},
url = {http://hal.inria.fr/inria-00429146},
pdf = {http://hal.inria.fr/docs/00/42/91/46/PDF/CGS09_IWOCA_nostyle.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@InProceedings{CHM+09,
author = {D. Coudert and F. Huc and D. Mazauric and N. Nisse and J-S. Sereni},
title = {Reconfiguration of the Routing in {WDM} Networks with Two Classes of Services},
booktitle = {13th Conference on Optical Network Design and Modeling (ONDM)},
OPTcrossref = {},
OPTkey = {},
pages = {6p},
year = {2009},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
address = {Braunschweig, Germany},
month = feb,
OPTorganization = {},
publisher = {IEEE},
OPTnote = {},
OPTannote = {},
url = {http://hal.inria.fr/inria-00331807},
abstract = { In WDM backbone networks, the traffic pattern evolves constantly due to the nature of the demand itself or because of equipment failures leading to reroute affected connections. In this context, requests are routed greedily using available resources without changing the routing of pre-established connections. However, such a policy leads to a poor usage of resources and so higher blocking probability: new connection requests might be rejected while network resources are sufficient to serve all the traffic. Therefore, it is important to regularly reconfigure the network by rerouting established connections in order to optimize the usage of network resources. In this paper, we consider the network reconfiguration problem that consists in switching existing connections one after the other from the current routing to a new pre-computed routing. Due to cyclic dependencies between connections, some requests may have to be temporarily interrupted during this process. Clearly, the number of requests simultaneously interrupted has to be minimized. Furthermore, it might be impossible for the network operator to interrupt some connections because of the contract signed with the corresponding clients. In this setting, the network reconfiguration problem consists in going from a routing to another one given that some priority connections cannot be interrupted. The network reconfiguration problem without priority connections has previously been modeled as a cops-and-robber game in [CPPS05,CoSe07]. Here, we first extend this model to handle priority connections. Then we identify cases where no solution exists. Using a simple transformation, we prove that the reconfiguration problem with priority connections can be reduced to the problem without this constraint. Finally, we propose a new heuristic algorithm that improves upon previous proposals. },
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@InProceedings{CHM+09b,
author = {D. Coudert and F. Huc and D. Mazauric and N. Nisse and J-S. Sereni},
title = {Reconfiguration dans les r\'eseaux optiques},
booktitle = {11\`eme Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel'09)},
OPTcrossref = {},
OPTkey = {},
pages = {4p},
year = {2009},
editor = {A. Chaintreau and C. Magnien},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
address = {Carry le Rouet},
month = jun,
OPTorganization = {},
OPTpublisher = {},
OPTannote = {},
url = {http://hal.inria.fr/inria-00331807},
pdf = {http://hal.inria.fr/docs/00/38/32/06/PDF/CHMNS09b.pdf},
abstract = { L'\'evolution permanente du trafic, les op\'erations de maintenance et l'existence de pannes dans les r\'eseaux WDM, obligent \`a rerouter r\'eguli\`erement des connexions. Les nouvelles demandes de connexions sont rout\'ees en utilisant les ressources disponibles et, si possible, sans modifier le routage des connexions existantes. Ceci peut engendrer une mauvaise utilisation des ressources disponibles. Il est donc pr\'ef\'erable de reconfigurer r\'eguli\`erement l'ensemble des routes des diff\'erentes connexions. Un objectif particuli\`erement important est alors de minimiser le nombre de requ\^etes simultan\'ement interrompues lors de la reconfiguration. Nous proposons une heuristique pour r\'esoudre ce probl\`eme dans les r\'eseaux WDM. Les simulations montrent que cette heuristique r\'ealise de meilleures performances que celle propos\'ee par Jose et Somani (2003). Nous proposons \'egalement un mod\`ele permettant de prendre en compte diff\'erentes classes de clients, avec notamment la contrainte que des requ\^etes, dites prioritaires, ne peuvent pas \^etre interrompues. Une simple transformation permet de r\'eduire le probl\`eme avec requ\^etes prioritaires au probl\`eme initial. De ce fait, notre heuristique s'applique \'egalement au cas autorisant des requ\^etes prioritaires.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},
sorte = "conf-nat",

}

@InProceedings{CMN09b,
author = {D. Coudert and D. Mazauric and N. Nisse},
title = {On Rerouting Connection Requests in Networks with Shared Bandwidth},
OPTcrossref = {},
OPTkey = {},
booktitle = {DIMAP workshop on Algorithmic Graph Theory (AGT09)},
pages = {109-116},
year = {2009},
OPTeditor = {},
volume = {32},
OPTnumber = {},
series = {Electronic Notes in Discrete Mathematics},
address = {Warwick, UK},
month = mar,
OPTorganization = {},
publisher = {Elsevier},
OPTannote = {},
url = {http://dx.doi.org/10.1016/j.endm.2009.02.015},
abstract = { In this paper, we address the problem of scheduling the switching of a set of connection requests one after the other from current routing to another pre-determined routing. We propose a model that handles requests using only a constant fraction of the bandwidth of a link, thus generalizing the model proposed in [CoSe07,JoSo03] for WDM networks. Our main result is the proof that the problem of deciding whether it exists a scheduling of the rerouting of connection requests without traffic interruption is NP-complete even if requests use the third of the bandwidth of a link. Note that the problem is polynomial when the bandwidth of a link cannot be shared [CoSe07]. },
pdf = {http://hal.inria.fr/docs/00/35/00/25/PDF/RR-6790.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@INPROCEEDINGS{CNR09,
AUTHOR="D. Coudert and N. Nepomuceno and H. Rivano",
TITLE="Minimizing Energy Consumption by {Power-Efficient} Radio Configuration in Fixed Broadband Wireless Networks",
BOOKTITLE="First IEEE WoWMoM Workshop on Hot Topics in Mesh Networking (HotMESH)",
pages = {6p},
publisher = {IEEE},
ADDRESS="Kos, Greece",
OPTDAYS=15,
MONTH=jun,
YEAR=2009,
ABSTRACT="In this paper, we investigate on minimizing the energy consumption of a fixed broadband wireless network through a joint optimization of data routing and radio configuration. The network is modeled by a digraph in which the nodes represent radio base stations and the arcs denote radio links. Under this scenario, a power-efficient configuration can be characterized by a modulation constellation size and a transmission power level. Every link holds a set of power-efficient configurations, each of them associating a capacity with its energy cost. The optimization problem involves deciding the network's configuration and flows that minimize the total energy consumption, while handling all the traffic requirements simultaneously. An exact mathematical formulation of the problem is presented. It relies on a minimum cost multicommodity flow with step increasing cost functions, which is very hard to optimize. We then propose a piecewise linear convex function, obtained by linear interpolation of powerefficient configuration points, that provides a good approximation of the energy consumption on the links, and present a relaxation of the previous formulation that exploits the convexity of the energy cost functions. This yields lower bounds on the energy consumption, and finally a heuristic algorithm based on the fractional optimum is employed to produce feasible solutions. Our models are validated through extensive experiments that are reported and discussed. The results verify the potentialities behind this novel approach. In particular, our algorithm induces a satisfactory integrality gap in practice.",
url = {http://dx.doi.org/10.1109/WOWMOM.2009.5282434},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/CNR09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {BR},
sorte = "conf-int",

}

@InProceedings{CNR09b,
author = {D. Coudert and N. Nepomuceno and H. Rivano},
title = {Joint Optimization of Routing and Radio Configuration in Fixed Wireless Networks},
booktitle = {11\`eme Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel'09)},
pages = {4p},
year = {2009},
editor = {A. Chaintreau and C. Magnien},
address = {Carry le Rouet},
month = jun,
abstract = {Nous étudions la minimisation de la consommation d'énergie des réseaux sans-fil fixes � transmission par liens micro-ondes, par l'optimisation jointe du routage des flux de données et la sélection de la configuration des liens. Nous présentons une formulation mathématique exacte basée sur un multiflot entier de coût minimum avec des fonctions de coût en escalier, rendant le problème très difficile � résoudre. Nous proposons ensuite une fonction linéaire par morceaux convexe, obtenue par interpolation linéaire des points de configuration efficaces en énergie, qui fournit une bonne approximation de la consommation d'énergie sur les liens, et présentons une relaxation qui exploite la convexité des fonctions de coût. Ceci rapporte des limites inférieures sur la consommation d'énergie, et finalement un algorithme heuristique basé sur l'optimum fractionnaire est utilisé pour produire des solutions réalisables. Les résultats attestent du potentiel de notre nouvelle approche.},
url = {http://hal.inria.fr/inria-00384968/fr/},
pdf = {http://hal.inria.fr/docs/00/38/49/68/PDF/AlgoTel.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},
x-pays = {BR},
sorte = "conf-nat",

}

@CONFERENCE{DGMP09a,
author = {O. Dalle and F. Giroire and J. Monteiro and S. P\'erennes},
title = {Analyse des Corr{\'e}lations entre Pannes dans les Syst{\`e}mes de Stockage Pair-{\`a}-Pair},
booktitle = {11\`eme rencontres francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (Algotel'2009)},
pages = {4p},
year = {2009},
editor = {Augustin Chaintreau and Clemence Magnien},
address = {{C}arry-{L}e-{R}ouet {F}rance },
note = {Best Student Paper Award},
abstract = {{D}ans cet article, nous pr{\'e}sentons et {\'e}tudions des mod{\`e}les analytiques de syst{\`e}mes de stockage pair-{\`a}-pair fiables {\`a} long terme. {L}es pairs sont sujets {\`a} des pannes d{\'e}finitives (d{\'e}faillance du disque, d{\'e}part du pair) induisant la perte de toutes les donn{\'e}es stock{\'e}es par le pair. {C}es pannes ont lieu en continu. {A}fin de p{\'e}renniser les donn{\'e}es il est indispensable d'user de redondance et de maintenir celle-ci au moyen d'un processus permanent de reconstruction. {D}ans un premier temps nous consid{\'e}rons une approche classiquement utilis{\'e}e dans la litt{\'e}rature, consistant {\`a} mod{\'e}liser chaque bloc par une cha{\^i}ne de {M}arkov et {\`a} n{\'e}gliger les interd{\'e}pendances entre blocs. {S}i celle-ci permet le calcul du comportement moyen du syst{\`e}me (par exemple la demande moyenne en bande passante), elle est insuffisante pour en {\'e}valuer les fluctuations. {N}os simulations d{\'e}montrent que ces fluctuations sont tr{\`e}s importantes m{\^e}me pour des grands syst{\`e}mes comportant des milliers de pairs. {N}ous proposons alors un nouveau mod{\`e}le stochastique prenant en compte l'interd{\'e}pendance des pannes de blocs, et nous en donnons une approximation fluide. {C}eci nous permet de caract{\'e}riser le comportement du syst{\`e}me (calcul de tous les moments) mais aussi de le simuler efficacement, car il est ind{\'e}pendant de la taille du syst{\`e}me. {L}a pertinence de notre mod{\`e}le est valid{\'e}e en comparant les r{\'e}sultats obtenus par des simulations utilisant d'un c{\^o}t{\'e} notre mod{\`e}le fluide et de l'autre un mod{\`e}le {\`a} {\'e}v{\'e}nements discrets reproduisant fid{\`e}lement le comportement du syst{\`e}me.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/DGMP09a.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},
x-pays = {},
url = {http://hal.inria.fr/inria-00485847/en/},
sorte = "conf-nat",

}

@INPROCEEDINGS{DGMP09b,
author = {O. Dalle and F. Giroire and J. Monteiro and S. P{\'e}rennes},
title = {Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems},
booktitle = {Proceedings of the 9th IEEE International Conference on Peer-to-Peer Computing (P2P)},
year = {2009},
month = {sep},
pages = {184--193},
url={http://dx.doi.org/10.1109/P2P.2009.5284518},
abstract = {Peer-to-peer storage systems aim to provide a reliable long-term storage at low cost. In such systems, peers fail continuously, hence, the necessity of self-repairing mechanisms to achieve high durability. In this paper, we propose and study analytical models that assess the bandwidth consumption and the probability to lose data of storage systems that use erasure coded redundancy. We show by simulations that the classical stochastic approach found in the literature, that models each block independently, gives a correct approximation of the system average behavior, but fails to capture its variations over time. These variations are caused by the simultaneous loss of multiple data blocks that results from a peer failing (or leaving the system). We then propose a new stochastic model based on a fluid approximation that better captures the system behavior. In addition to its expectation, it gives a correct estimation of its standard deviation. This new model is validated by simulations.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/DGMP09b.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {},
sorte = "conf-int",

}

@InProceedings{Fer09,
author = {Ferreira, A.},
title = {Road-mapping the Digital Revolution: Visions from COST Foresight 2030 (An exercise in multi-disciplinarity)},
booktitle = {Proceedings of IEEE Wireless VITAE'09},
year = 2009,
pages = {5p},
month = {May},
address = {Aalborg, Denmark},
publisher = {IEEE Press},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/Fer09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
abstract = {From innovation triggered by user virtual communities to remote surgery and new financial instruments, the creative power of individuals is being fostered at proportions previously unseen. The main driver enabling such a pace of innovation, scientific progress, and user adoption is the Digital Revolution. One consequence is that interrelationships between science, technology and society are increasing in complexity and harder to understand. COST Foresight 2030 is an initiative encompassing a set of events designed to explore a multi-disciplinary vision for a future permeated and shaped by the digital revolution. This paper describes the vision behind COST Foresight 2030 and highlights several issues that are likely to become central in the next decades.},
sorte = "conf-int",

}

@inproceedings{FMM+09b,
sorte = "conf-int",
author = {M. Flammini and A. Marchetti-Spaccamela and G. Monaco and L. Moscardelli and S. Zaks},
title = {On the complexity of the regenerator placement problem in optical networks},
booktitle= {Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2009)},
address= {Calgary, Canada},
year= {2009},
month = aug,
volume = {},
pages = {154-162},
publisher = {ACM},
series = {},
OPTnote = {},
OPTannote = {},
url = {http://portal.acm.org/citation.cfm?doid=1583991.1584035},
PDF={http://portal.acm.org/citation.cfm?doid=1583991.1584035},
abstract = {Placement of regenerators in optical networks has attracted the attention of recent research works in optical networks. In this problem we are given a network, with an underlying topology of a graph G, and with a set of requests that correspond to paths in G. There is a need to put a regenerator every certain distance, because of a decrease in the power of the signal. In this work we investigate the problem of minimizing the number of locations to place the regenerators. We present analytical results regarding the complexity of this problem, in four cases, depending on whether or not there is a bound on the number of regenerators at each node, and depending on whether or not the routing is given or only the requests are given (and part of the solution is also to determine the actual routing). These results include polynomial time algorithms, NP-complete results, approximation algorithms, and inapproximability results.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},

}

@inproceedings{FMM+09a,
sorte = "conf-int",
author = {M. Flammini and G. Monaco and L. Moscardelli and H. Shachnai and M. Shalom and T. Tamir and S. Zaks},
title = {Minimizing total busy time in parallel scheduling with application to optical networks},
booktitle= {Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS 2009)},
address= {Rome, Italy},
year= {2009},
month = may,
volume = {},
pages = {1-12},
publisher = {IEEE},
series = {},
OPTnote = {},
OPTannote = {},
url = {http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=5161017},
PDF={http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=5161017},
abstract = {We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1,..., Jn}. Each job, Jj, is associated with an interval [sj, cj] along which it should be processed. Also given is the parallelism parameter g ges 1, which is the maximal number of jobs that can be processed simultaneously by a single machine. Each machine operates along a contiguous time interval, called its busy interval, which contains all the intervals corresponding to the jobs it processes. The goal is to assign the jobs to machines such that the total busy time of the machines is minimized. The problem is known to be NP-hard already for g = 2. We present a 4-approximation algorithm for general instances, and approximation algorithms with improved ratios for instances with bounded lengths, for instances where any two intervals intersect, and for instances where no interval is properly contained in another. Our study has important application in optimizing the switching costs of optical networks.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},

}

@InProceedings{FoRe09,
sorte = "conf-int",
AUTHOR={N. Fountoulakis and B. Reed},
TITLE="A general critical condition for the emergence of a giant component in random graphs with given degrees",
booktitle ="European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009)",
series = "Electronic Notes on Discrete Mathematics",
PAGES = "639--645",
VOLUME = "34",
year = "2009",
address = "Bordeaux, France",
month = sep,
x-pays={DE},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
abstract = {},
pdf = {},
url ={} 
}

@inproceedings{Gia10a,
title = "Why having in-person lectures when e-learning and podcasts are available?",
author = "P. Giabbanelli",
booktitle = "Proceedings of the 14th Western Canadian Conference on Computing Education (ACM SIGCSE)",
pages = {42-44},
year = "2009",
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@InProceedings{GCT+09,
author = {F. Giroire and J. {C}handrashekar and N. Taft and E. Schooler and K. Papagiannaki},
title = {Exploiting Temporal Persistence to Detect Covert Botnet Channels},
booktitle = {12th International Symposium on Recent Advances in Intrusion Detection (RAID'09)},
OPTcrossref = {},
OPTkey = {},
pages = {326--345},
year = {2009},
editor = {Springer},
volume = {5758},
OPTnumber = {XXXX},
series = {Lecture Notes in Computer Science},
month = sep,
address = {Saint Malo, France},
OPTorganization = {},
OPTpublisher = {},
OPTannote = {},
abstract = {We describe a method to detect botnet command and control traffic and individual end-hosts. We introduce the notion of †destination traffic atoms†which aggregate the destinations and services that are communicated with. We then compute the †persistence†, which is a measure of temporal regularity and that we propose in this paper, for individual destination atoms. Very persistent destination atoms are added to a host's whitelist during a training period. Subsequently, we track the persistence of new destination atoms not already whitelisted, to identify suspicious C&C destinations. A particularly novel aspect is that we track persistence at multiple timescales concurrently. Importantly, our method does not require any a-priori information about destinations, ports, or protocols used in the C&C, nor do we require payload inspection. We evaluate our system using extensive user traffic traces collected from an enterprise network, along with collected botnet traces. We demonstrate that our method correctly identifies a botnet's C&C traffic, even when it is very stealthy. We also show that filtering outgoing traffic with the constructed whitelists dramatically improves the performance of traditional anomaly detectors. Finally, we show that the C&C detection can be achieved with a very low false positive rate.},
pdf = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/GCT09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {US},
sorte = "conf-int",

}

@INPROCEEDINGS{GMP09b,
author = {F. Giroire and J. Monteiro and S. P\'erennes},
title = {{P2P} Storage Systems: How Much Locality Can They Tolerate?},
booktitle = {Proceedings of the 34th IEEE Conference on Local Computer Networks (LCN)},
year = {2009},
pages = {320--323},
month = {Oct},
abstract = {Large scale peer-to-peer systems are foreseen as a way to provide highly reliable data storage at low cost. To achieve high durability, such P2P systems encode the user data in a set of redundant fragments and distribute them among the peers. In this paper, we study the impact of different data placement strategies on the system performance when using erasure codes redundancy schemes. We compare three policies: two of them local, in which the data are stored in logical neighbors, and the other one global, in which the data are spread randomly in the whole system. We focus on the study of the probability to lose a data block and the bandwidth consumption to maintain enough redundancy. We use simulations to show that, without resource constraints, the average values are the same no matter which placement policy is used. However, the variations in the use of bandwidth are much more bursty under the local policies. When the bandwidth is limited, these bursty variations induce longer maintenance time and henceforth a higher risk of data loss. Finally, we propose a new external reconstruction strategy and a suitable degree of locality that could be introduced in order to combine the efficiency of the global policy with the practical advantages of a local placement.},
keywords = {P2P storage system, data placement, performance evaluation, data durability},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/GMP09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {},
sorte = "conf-int",

}

@InProceedings{GG09,
sorte = "conf-int",
author ={C. Gomes and J. Galtier},
title = {Optimal and Fair Transmission Rate Allocation Problem in Multi-hop Cellular Networks},
booktitle ={8th International Conference on AD-HOC Networks \& Wireless (ADHOC NOW)},
month = sep,
year ={2009},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {5793},
pages = {327-340},
address = {Murcia, Spain},
abstract = {We deal with the rate allocation problem for downlink in a Multi-hop Cellular Network. A mathematical model is provided to assign transmission rates in order to reach an optimal and fair solution. We prove that under some conditions that are often met, the problem can be reduced to a single-hop cellular network problem. The validity of our proof is confirmed experimentally.},
PDF = {sftp://cgomes@mascotte.inria.fr/net/serveurs/www-sop/members/Cristiana.Gomes/id085_GomesGaltier.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@InProceedings{GHPT09,
sorte = "conf-int",
AUTHOR="D. Gon\c{c}alves and F. Havet and A. Pinlou and S. Thomass\'e",
TITLE="Spanning galaxies in digraphs",
booktitle ="European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009)",
series = "Electronic Notes on Discrete Mathematics",
PAGES = "139--143",
VOLUME = "34",
year = "2009",
address = "Bordeaux, France",
month = sep,
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/GHPT09.pdf},
abstract={A \emph{star} is an arborescence in which the root dominates all the other vertices. A \emph{galaxy} is a vertex-disjoint union of stars. The \emph{directed star arboricity} of a digraph $D$,denoted by $dst(D)$, is the minimum number of galaxies needed to cover $A(D)$. In this paper, we show that $dst(D)\leq \Delta(D)+1$ and that if $D$ is ascyclic then $dst(D)\leq \Delta(D)$. These results are proving by considering the existence of spanning galaxy in digraphs. Thus, we study the problem of deciding whether a digraph $D$ has a spanning galaxy or not. We show that it is NP-complete (even when restricted to acyclic digraphs) but that it becomes polynomial-time solvable when restricted to strongly connected digraphs. },
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {} 
}

@InProceedings{GuOn09a,
sorte = "conf-nat",
OPTKEY = { },
AUTHOR = { Guinand, F. and Onfroy, B. },
TITLE = { {MANET} : \'etude de l'impact de la mobilit\'e sur la connexit\'e du r\'eseau },
booktitle = {11\`emes Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel'09) },
pages = {2p},
MONTH = jun,
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Brice.Onfroy/publi/2009/pdf/2009_algotel_[guinand-onfroy]_mobility_impact_on_connectivity__poster.pdf},
YEAR = { 2009 },
NOTE = { Poster },
OPTANNOTE = {},
KEYWORDS = {r\'eseau mobile ad-hoc, graphe dynamique, MANET, connexit\'e, algorithme},
ABSTRACT = {Avec la multiplication des terminaux communiquant, les r\'eseaux ad-hoc dynamiques ont maintenant la capacit\'e de se d\'evelopper. Ces r\'eseaux ne poss\`edent pas d'infrastructure fixe, et les d\'eplacements rapides des terminaux rendent instables les voisins de ces noeuds mobiles. Dans l'objectif de concevoir des m\'ethodes d\'ecentralis\'ees efficaces, nos travaux actuels tentent d'\'evaluer l'impact des diff\'erents param\`etres de mobilit\'e sur la connexit\'e du graphe repr\'esentatif du r\'eseau form\'e par ces terminaux mobiles. Le mod\`ele de mobilit\'e \'etudi\'e est le Random Waypoint. L'objectif est donc de d\'eterminer quels param\`etres de mobilit\'e (vitesse de d\'eplacement, temps de pause, ...) ont un impact significatif sur la connexit\'e du r\'eseau.},
OPTx-editorial-board = {yes},
OPTx-proceedings = {yes},
OPTx-international-audience = {yes} 
}

@InProceedings{HaLi09,
sorte = "conf-int",
AUTHOR="Havet, F. and Linhares Sales, C.",
TITLE="Combinat\'{o}ria e Problemas em Redes de Telecomunica\c{c}\~{o}es",
booktitle ="Colloque d'Informatique: Br\'esil / INRIA, Coop\'erations, Avanc\'ees et D\'efis",
year = "2009",
pages = {4p},
address = "Bento Gon\c{c}alves, Brazil",
month = jul,
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/HaLi09.pdf},
abstract={In this paper, we summarize some problems arising in telecommunication networks which have been studied in the scope of the cooperation between our teams ParGO (UFC) and Mascotte (INRIA). We also present their modeling by graph coloring problems and some partial results we have ob- tained.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {BR},

}

@InProceedings{HDR09,
author = {J. Himmelspach and O. Dalle and J. Ribault},
title = {Design considerations for {M}\&{S} software},
x-pays = {DE},
OPTcrossref = {},
OPTkey = {},
booktitle = {Proceedings of the Winter Simulation Conference (WSC'09)},
pages = {12p},
year = {2009},
editor = {D. Rossetti and R. R. Hill and B. Johansson and A. Dunkin and R. G. Ingalls},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
address = {Austin, TX},
month = dec,
OPTorganization = {},
OPTpublisher = {},
note = {Invited Paper},
OPTannote = {},
ABSTRACT = {The development of M&S products often seems to be driven by need: people start coding because they are interested in either a concrete simulation study, or they are interested in a (single) research subject of M&S methodology. We claim that discussing, designing, developing, and comparing M&S products should be based on software engineering concepts. We shortly introduce some of these engineering concepts and discuss how these relate to the M&S domain. By describing two examples, OSA and JAMES II, we illustrate that reuse might play an important role in the development of high quality M&S products as the examples allow reuse on the level of models and scenarios, on the level of "simulation studies", of algorithms (e.g., reuse of event queues, random number generators), across hardware architectures / operating systems, and of analysis tools.},
URL = {http://wwwmosi.informatik.uni-rostock.de/mosi/veroeffentlichungen/inproceedingsreference.2009-06-01.2218174380},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/HiDaRi09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "inv-conf",

}

@InProceedings{KaRe09c,
sorte = "conf-int",
author={K. Kawarabayashi and B. Reed},
booktitle = {41th ACM Symposium on Theory of Computing (STOC 2009)},
title={Hadwiger's Conjecture is decidable},
year={2009},
PAGES ={445--454},
x-pays = {JP},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
abstract = {The famous Hadwiger's conjecture asserts that every graph with no Kt-minor is (t-1)-colorable. The case t=5 is known to be equivalent to the Four Color Theorem by Wagner, and the case t=6 is settled by Robertson, Seymour and Thomas. So far the cases t \geq 7 are wide open. In this paper, we prove the following two theorems: There is an O(n2) algorithm to decide whether or not a given graph G satisfies Hadwiger's conjecture for the case t. Every minimal counterexample to Hadwiger's conjecture for the case t has at most f(t) vertices for some explicit bound f(t). The bound f(t) is at most pppt, where p=101010t. Our proofs for both results use the well-known result by Thomassen [46] for 5-list-coloring planar graphs, together with some results (but not the decomposition theorem) of Graph Minors in [36]. Concerning the first result, we prove the following stronger theorem: For a given graph G and any fixed t, there is an O(n2) algorithm to output one of the following: a (t-1)-coloring of G, or a Kt- minor of G, or a minor H of G of order at most f(t) such that H does not have a Kt-minor nor is (t-1)-colorable. The last conclusion implies that H is a counterexample to Hadwiger's conjecture with at most f(t) vertices for the case t. The time complexity of the algorithm matches the best known algorithms for 4-coloring planar graphs (the Four Color Theorem), due to Appel and Hakken, and Robertson, Sanders, Seymour and Thomas, respectively. Let us observe that when t=5, the algorithm gives rise to an algorithm for the Four Color Theorem. The second theorem follows from our structure theorem, which has the following corollary: Every minimal counterexample G to Hadwiger's conjecture for the case t either has at most f(t) vertices, or has a vertex set Z of order at most t-5 such that G-Z is planar. It follows from the Four Color Theorem that the second assertion does not happen to any minimal counterexample to Hadwiger's conjecture for the case t. Thus in constant time, we can decide Hadwiger's conjecture for the case t.},
pdf = {http://portal.acm.org/ft_gateway.cfm?id=1536476&type=pdf&coll=GUIDE&dl=GUIDE&CFID=60373272&CFTOKEN=66048899},
url ={http://portal.acm.org/citation.cfm?id=1536414.1536476} 
}

@InProceedings{KaRe09b,
sorte = "conf-int",
author={K. Kawarabayashi and B. Reed},
booktitle={Proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA 2009)},
month={jan},
title={A nearly linear time algorithm for the half integral parity disjoint paths packing problem},
year={2009},
PAGES ={1183--1192},
x-pays = {JP},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
abstract = {We consider the following problem, which is called the half integral parity disjoint paths packing problem. Input: A graph G, k pair of vertices (s1, t1), (s2, t2), ...,(sk, tk) in G (which are sometimes called terminals), and a parity li for each i with $1 \leq i \leq k$, where li = 0 or 1. Output: Paths P1, ..., Pk in G such that Pi joins si and ti for i = 1, 2, ..., k and parity of length of the path Pi is li, i.e, if li = 0, then length of Pi is even, and if li = 1, then length of Pi is odd for i = 1, 2, ..., k. In addition, each vertex is on at most two of these paths. We present an O(m \alpha(m, n) log n) algorithm for fixed k, where n, m are the number of vertices and the number of edges, respectively, and the function \alpha(m, n) is the inverse of the Ackermann function (see by Tarjan [43]). This is the first polynomial time algorithm for this problem, and generalizes polynomial time algorithms by Kleinberg [23] and Kawarabayashi and Reed [20], respectively, for the half integral disjoint paths packing problem, i.e., without the parity requirement. As with the Robertson-Seymour algorithm to solve the k disjoint paths problem, in each iteration, we would like to either use a huge clique minor as a "crossbar", or exploit the structure of graphs in which we cannot find such a minor. Here, however, we must maintain the parity of the paths and can only use an "odd clique minor". We must also describe the structure of those graphs in which we cannot find such a minor and discuss how to exploit it. We also have algorithms running in O(m(1 + \epsilon)) time for any \epsilon > 0 for this problem, if k is up to o(log log log n) for general graphs, up to o(log log n) for planar graphs, and up to o(log log n/g) for graphs on the surface, where g is Euler genus. Furthermore, if k is fixed, then we have linear time algorithms for the planar case and for the bounded genus case.},
pdf = {http://www.siam.org/proceedings/soda/2009/SODA09_128_kawarabayashik.pdf},
url ={http://portal.acm.org/citation.cfm?id=1496770.1496898} 
}

@InProceedings{KMR09,
sorte = "conf-int",
AUTHOR={S. Kennedy and C. Meagher and B. Reed},
TITLE="Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time",
booktitle ="European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009)",
series = "Electronic Notes on Discrete Mathematics",
PAGES = "47--51",
VOLUME = "34",
year = "2009",
address = "Bordeaux, France",
month = sep,
x-pays = {CA},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
abstract = {For any c>1, we describe a linear time algorithm for fractionally edge colouring simple graphs with maximum degree at least |V|/c.},
pdf = {},
url ={} 
}

@INPROCEEDINGS{LiSa09a,
sorte = "conf-int",
title = {Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph},
author = {Z. Li and I. Sau},
booktitle = {35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009)},
year = {2009},
month = jun,
series= {Lecture Notes in Computer Science},
volume= {5911},
pages = {250-261,},
location = {Montpellier, France},
note = {Best student paper award},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/LiSa09.pdf},
abstract = {We study a graph partitioning problem which arises from traffic grooming in optical networks. We wish to minimize the equipment cost in a SONET WDM ring network by minimizing the number of Add-Drop Multiplexers (ADMs) used. We consider the version introduced by Mu{\~n}oz and Sau~[Mu{\~n}oz and Sau, WG 08] where the ring is unidirectional with a grooming factor $C$, and we must design the network (namely, place the ADMs at the nodes) so that it can support \emph{any} request graph with maximum degree at most $\Delta$. This problem is essentially equivalent to finding the least integer $M(C,\Delta)$ such that the edges of any graph with maximum degree at most $\Delta$ can be partitioned into subgraphs with at most $C$ edges and each vertex appears in at most $M(C,\Delta)$ subgraphs~[Mu{\~n}oz and Sau, WG 08] . The cases where $\Delta=2$ and $\Delta=3,C\neq 4$ were solved by Mu{\~n}oz and Sau~[Mu{\~n}oz and Sau, WG 08] . In this article we establish the value of $M(C,\Delta)$ for many more cases, leaving open only the case where $\Delta \geq 5$ is odd, $\Delta \pmod{2C}$ is between $3$ and $C-1$, $C\geq 4$, and the request graph does not contain a perfect matching. In particular, we answer a conjecture of~[Mu{\~n}oz and Sau, WG 08] .},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@InProceedings{LiSa09b,
sorte = "conf-int",
author = {Linhares Sales, C. and Sampaio, L.},
title = {b-coloring of m-tight graphs},
OPTcrossref = {},
OPTkey = {},
booktitle = {LAGOS'09 - V Latin-American Algorithms, Graphs and Optimization Symposium},
year = {2009},
editor = {T. Liebling and J. Szwarcfiter},
volume = {35},
OPTnumber = {},
pages = {209 - 214},
series = {Electronic Notes in Discrete Mathematics},
issn = "1571-0653",
address = {Gramado, Brazil},
month = mar,
OPTorganization = {},
publisher = {Elsevier},
OPTannote = {},
doi = "DOI: 10.1016/j.endm.2009.11.035",
url = {http://dx.doi.org/10.1016/j.endm.2009.11.035},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/LiSab.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {BR},

}

@InProceedings{DDM09,
author = {J-C. {Maureira Bravo} and D. Dujovne and O. Dalle},
title = {Generation of Realistic 802.11 Interferences in the {OMNeT}++ {INET} Framework Based on Real Traffic Measurements},
OPTcrossref = {},
OPTkey = {},
booktitle = {Second International Workshop on {OMNeT}++},
pages = {8p},
year = {2009},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
address = {Rome, Italy},
month = mar,
OPTorganization = {},
OPTpublisher = {},
OPTannote = {},
ABSTRACT = {Realistic simulation of 802.11 traffic subject to high interference, for example in dense urban areas, is still an open issue. Many studies do not address the interference problem properly. In this paper, we present our preliminary work on a method to recreate interference traffic from real measurements. The method consists in capturing real traffic traces and generating interference patterns based on the recorded information. Furthermore, we assume that the coordinates of the sources of interference in the real scene are not known a priori. We introduce an extension to Omnet++ INET-Framework to replay the recreated interference in a transparent way into a simulation. We validate our proposed method by comparing it against the real measurements taken from the scene. Furthermore we present an evaluation of how the injected interference affects the simulated results on three arbitrary simulated scenarios.},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/DDM09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {CL},
sorte = "conf-int",

}

@InProceedings{AA+09,
author = {J-C. {Maureira Bravo} and P. Uribe and O. Dalle and T. Asahi and J. Amaya},
title = {Component based approach using {OMNeT++} for Train Communication Modeling},
OPTcrossref = {},
OPTkey = {},
booktitle = {Proceedings of 9th International Conference on ITS Telecommunication},
pages = {6p},
year = {2009},
editor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
address = {Lille, France},
month = oct,
OPTorganization = {INRETS},
OPTpublisher = {},
OPTannote = {},
ABSTRACT = {This paper reports on our experience in using OMNeT++ to develop a network simulator focused on railway environments. Common design problems are analyzed, making emphasis on radio communication models. Scalability issues are raised when modeling the large topologies that are associated with railway communications. Our conclusions point out that model reusability must be reinforced and that a component-based design must be adopted in order to build a tool for generating valuable performance results.},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AADMU09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-lisa09pays = {CL},
sorte = "conf-int",

}

@INPROCEEDINGS{MSZ09a,
sorte = "conf-int",
title = {A New Intersection Model and Improved Algorithms for Tolerance Graphs},
author = {G. Mertzios and I. Sau and S. Zaks},
booktitle = {35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009)},
year = {2009},
month = 06,
series= {Lecture Notes in Computer Science},
volume= {5911},
pages = {285-295},
location = {Montpellier, France},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/MSZ09.pdf},
abstract = {Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in con ict. This class of graphs, which generalizes in a natural way both interval and permutation graphs, has attracted many research efforts since their introduction in [10], as it finds many important applications in constraint-based temporal reasoning, resource allocation and scheduling problems, among others. In this article we propose the first non-trivial intersection model for general tolerance graphs, given by three-dimensional parallelepipeds, which extends the widely known intersection model of parallelograms in the plane that characterizes the class of bounded tolerance graphs. Apart from being important on its own, this new representation also enables us to improve the time complexity of three problems on tolerance graphs. Namely, we present optimal ${\cal O}(n \log n)$ algorithms for computing a minimum coloring and a maximum clique, and an ${\cal O}(n2)$ algorithm for computing a maximum weight independent set in a tolerance graph with n vertices, thus improving the best known running times ${\cal O}(n2)$ and ${\cal O}(n3)$ for these problems, respectively.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@inproceedings{MoVo09,
sorte = "conf-int",
author = {C. Molle and M-E. Voge},
title = {Effects of the Acknowledgment Traffic on the Capacity of Wireless Mesh Networks},
booktitle= {69th IEEE Vehicular Technology Conference (VTC2009-Spring)},
pages = {5p},
address= {Barcelona, Spain},
year= {2009},
month = apr,
OPTnote = {},
OPTannote = {},
PDF={ftp://ftp-sop.inria.fr/mascotte/Publications/MoVo09.pdf},
abstract = {Since the emergence of ubiquitous computing, evaluating wireless network performances has become one of the major economic issues. Among the existing performance indicators, the network {\em capacity}, defined as the maximal amount of flow carried by a topology during a fixed time period, is essential. Some cross-layer characteristics have to be taken into account in order to optimally allocate the common resources. In this article, a comparative study is done between interference consequences in the two following models: (i) usual IEEE 802.11 MAC layer with acknowledgments at each hop, and (ii) block acknowledgments reported at the transport layer that can be included in the IEEE 802.16 standard. Cross-layer properties are modeled in a linear programming formulation that is solved using the column generation process. We quantify the gain in capacity induced by the move of the MAC acknowledgments into the transport layer, and show the better load distribution obtained in the network with the second model.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@inproceedings{MoRe09,
sorte = "conf-int",
author = {M. Molloy and B. A. Reed},
title = {Asymptotically optimal frugal colouring},
booktitle = {Proceedings of Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
year = {2009},
pages = {106-114},
x-pays = {CA},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
abstract = {We prove that every graph with maximum degree \Delta can be properly (\Delta + 1)-coloured so that no colour appears more than O(log \Delta / log log \Delta) times in the neighbourhood of any vertex. This is best possible up to the constant factor in the O(−) term. We also provide an efficient algorithm to produce such a colouring.},
pdf = {http://www.siam.org/proceedings/soda/2009/SODA09_012_molloym.pdf},
url ={http://portal.acm.org/citation.cfm?id=1496782} 
}

@inproceedings{NRS09,
sorte = "conf-int",
author = {N. Nisse and I. Rapaport and K. Suchan},
title = {Distributed computing of efficient routing schemes in generalized chordal graphs},
booktitle = {Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO)},
publisher= { Springer-Verlag },
series= {Lecture Notes in Computer Science},
address= {Piran, Slovenia},
volume= {5869},
pages = {252-265},
year= {2009},
x-pays = {CL},
PDF={http://www-sop.inria.fr/members/Nicolas.Nisse/publications/distribRouting.pdf},
abstract={Efficient algorithms for computing routing tables should take advantage of the particular properties arising in large scale networks. There are in fact at least two properties that any routing scheme must consider: low (logarithmic) diameter and high clustering coefficient. High clustering coefficient implies the existence of few large induced cycles. Therefore, we propose a routing scheme that computes short routes in the class of k-chordal graphs, i.e., graphs with no chordless cycles of length more than k. We study the tradeoff between the length of routes and the time complexity for computing them. In the class of k-chordal graphs, our routing scheme achieves an additive stretch of at most k − 1, i.e., for all pairs of nodes, the length of the route never exceeds their distance plus k − 1. In order to compute the routing tables of any n-node graph with diameter D we propose a distributed algorithm which uses O(log n)-bit messages and takes O(D) time. We then propose a slightly modified version of the algorithm for computing routing tables in time O(min{∆D, n}), where ∆ is the the maximum degree of the graph. Using these tables, our routing scheme achieves a better additive stretch of 1 in chordal graphs (notice that chordal graphs are 3-chordal graphs). The routing scheme uses addresses of size log n bits and local memory of size 2(d − 1) log n bits in a node of degree d.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@inproceedings{RiDa09,
title = { {OSA} : {A} {F}ederative {S}imulation {P}latform},
author = {Ribault, J. and Dalle, O.},
abstract = {{OSA} ({O}pen {S}imulation {A}rchitecture) is a collaborative platform for component-based discrete-event simulation. {I}t has been created to support both {M}\&{S} studies and research on {M}\&{S} techniques and methodology. {T}he {OSA} project started from the observation that despite no single simulation software seems to be perfect, most of the elements required to make a perfect simulator already exist as part of existing simulators. {H}ence, the particular area of research that motivated the {OSA} project is to investigate practical means of reusing and combining any valuable piece of {M}\&{S} software at large, including models, simulation engines and algorithms, and supporting tools for the {M}\&{S} methodology. {T}o achieve this goal, the {OSA} project investigates in advanced software engineering techniques such as component-based framework, layered patterns and aspect-oriented programming. {I}n cases studies, the {OSA} project is among others involved in a large-scale simulation, and a distributed simulation over the {REST}ful protocol.},
language = {{A}nglais},
affiliation = {{MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 },
booktitle = {{P}roceedings of the {W}inter {S}imulation {C}onference ({WSC}'09) },
address = {{A}ustin, TX, USA },
note = {{P}h.{D}. {C}olloquium },
audience = {internationale },
year = {2009},
URL = {http://hal.inria.fr/inria-00449642/en/},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {},
sorte = "conf-int",

}

@inproceedings{SaTh09b,
sorte = "conf-int",
author = {I. Sau and D. M. Thilikos},
title = {{On Self-Duality of Branchwidth in Graphs of Bounded Genus}},
booktitle = {8th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW)},
year = {2009},
month = jun,
pages = {19-22},
address = {Paris, France},
abstract = {A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph more than a constant factor. Self-duality has been examined for several width-parameters, such as branchwidth in graphs in some surface. In this direction, we prove that ${\mathbf bw}(G^*) \leq 6\times {\mathbf bw}(G) +2g-4$ for any graph $G$ embedded in a surface of Euler genus $g$.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/SaTh09b.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@InProceedings{SaTh09,
sorte = "conf-int",
author = {I. Sau and D. M. Thilikos},
title = {Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs},
booktitle = {DIMAP workshop on Algorithmic Graph Theory (AGT09)},
year = {2009},
volume = {32},
pages = {59-66},
series = {Electronic Notes in Discrete Mathematics},
address = {Warwick, UK},
month = mar,
publisher = {Elsevier},
abstract = {We present subexponential parameterized algorithms on planar graphs for a family of problems that consist in, given a graph $G$, finding a connected subgraph $H$ with bounded maximum degree, while maximising the number of edges (or vertices) of $H$. These problems are natural generalisations of the \textsc{Longest Path} problem. Our approach uses bidimensionality theory to obtain combinatorial bounds, combined with dynamic programming techniques over a branch decomposition of the input graph. These techniques need to be able to keep track of the connected components of the partial solutions over the branch decomposition, and can be seen as an \emph{algorithmic tensor} that can be applied to a wide family of problems that deal with finding connected subgraphs under certain constraints.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/SaTh09.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@INPROCEEDINGS{SRD09b,
sorte = "conf-int",
AUTHOR={A. Silva and P. Reyes and M. Debbah},
TITLE={Congestion in Randomly Deployed Wireless {Ad-Hoc} and Sensor Networks},
BOOKTITLE={International Conference on Ultra Modern Telecommunications},
ADDRESS={St. Petersburg, Russia},
pages = {10p},
MONTH=oct,
YEAR={2009},
KEYWORDS={Random Matrix Theory, Random Graph Theory, Wireless Ad-Hoc Networks, Wireless Sensor Networks},
url = {http://hal.inria.fr/inria-00417774/en},
pdf = {http://hal.inria.fr/docs/00/36/43/70/PDF/RR-6854.pdf},
ABSTRACT={Congestion in wireless ad-hoc sensor networks not only causes packet loss and increases queueing delay, but also leads to unnecessary energy consumption. In these networks, two types of congestion can occur: node-level congestion, which is caused by buffer overflow in the node, or link-level congestion, when wireless channels are shared by several nodes arising in collisions. We study a measure of link-level congestion in static wireless ad-hoc and sensor networks randomly deployed over an area. The measure of congestion considered is the inverse of the greatest eigenvalue of the adjacency matrix of the random graph. This measure gives an approximation of the average quantity of wireless links of a certain length on the network. We review the results to find this measure in Bernoulli random graphs. We use tools from random graph and random matrix theory to extend this measure on Geometric random graphs.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@InProceedings{SoMo09,
sorte = "conf-int",
author = {F. {Solano Donado} and J. Moulierac},
title = {Routing in All-Optical Label Switched-based Networks with Small Label Spaces},
booktitle = {13th Conference on Optical Network Design and Modeling (ONDM)},
pages = {6p},
year = {2009},
x-pays = {PL,ES},
address = {Braunschweig, Germany},
month = feb,
publisher = {IFIP/IEEE},
url = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/solano09routing.pdf},
abstract = { With the development of All-Optical Label Switching (AOLS) network, nodes are capable of forwarding labeled packets without performing Optical-Electrical-Optical (OEO) conversions, speeding up the forwarding. However, this new technology also brings new constraints and, consequently, new problems have to be adressed. We study in this paper the problem of routing a set of demands in such a network, considering that routers have limited label space, preventing from the usage of label swapping techniques. Label stripping is a solution that ensures forwarding, concerning these constraints, of all the paths at expenses of increasing the stack size and wasting bandwith. We propose an intermediate feasible solution that keeps the GMPLS stack size smaller than label stripping, in order to gain bandwidth resources. After proposing an heuristic for this problem, we present simulations that show the performance of our solution.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@techreport{ACGH09b,
title={{G}ood edge-labelling of graphs},
author = {J. Araujo and N. Cohen and F. Giroire and F. Havet},
abstract={A {\em good edge-labelling} of a graph ${G}$ is a labelling of its edges such that, for any ordered pair of vertices $(x,y)$, there do not exist two paths from $x$ to $y$ with increasing labels. {T}his notion was introduced in~\cite{{BCP}} to solve wavelength assignment problems for specific categories of graphs. {I}n this paper, we aim at characterizing the class of graphs that admit a good edge-labelling. {F}irst, we exhibit infinite families of graphs for which no such edge-labelling can be found. {W}e then show that deciding if a graph admits a good edge-labelling is {NP}-complete. {F}inally, we give large classes of graphs admitting a good edge-labelling: forests, ${C}_3$-free outerplanar graphs, planar graphs of girth at least 6, subcubic ${{C}_3,{K}_{2,3}}$-free graphs.},
keywords={graph theory; complexity; edge-labelling; planar graphs; matching-cut; channel assignment},
type={Research Report},
institution={INRIA},
number={6934},
year={2009},
URL={http://hal.inria.fr/inria-00383343/en/},
pdf = {http://hal.inria.fr/docs/00/38/41/18/PDF/RR-6934.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays={BR},
sorte = "Rapports",

}

@TechReport{BCG+09,
author = {J-C. Bermond and C.J. Colbourn and L. Gionfriddo and G. Quattrocchi and I. Sau},
title = {Drop cost and wavelength optimal two-period grooming with ratio 4},
institution = {INRIA},
year = {2009},
x-pays = {US,ES,IT},
number = {RR-7101},
month = nov,
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/BCG+09.pdf},
abstract = {We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-period grooming problem, during the first period of time, there is all-to-all uniform traffic among $n$ nodes, each request using $1/C$ of the bandwidth; and during the second period, there is all-to-all uniform traffic only among a subset $V$ of $v$ nodes, each request now being allowed to use $1/C'$ of the bandwidth, where $C' < C$. We determine the minimum drop cost (minimum number of ADMs) for any $n,v$ and $C=4$ and $C' \in \{1,2,3\}$. To do this, we use tools of graph decompositions. Indeed the two-period grooming problem corresponds to minimizing the total number of vertices in a partition of the edges of the complete graph $K_n$ into subgraphs, where each subgraph has at most $C$ edges and where furthermore it contains at most $C'$ edges of the complete graph on $v$ specified vertices. Subject to the condition that the two-period grooming has the least drop cost, the minimum number of wavelengths required is also determined in each case.},
sorte = "Rapports",

}

@TechReport{BCP09a,
author = {J-C. Bermond and M. Cosnard and S. P\'erennes},
title = {Directed acyclic graphs with unique path property},
institution = {INRIA},
year = {2009},
OPTkey = {},
OPTtype = {},
number = {6932},
month = may,
abstract = { Let P be a family of dipaths of a DAG (Directed Acyclic Graph) G. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minimum number of wavelengths (colors) needed to color the family of dipaths P in such a way that two dipaths with the same wavelength are arc-disjoint. There exist DAGs such that the ratio between w(G, P) and π(G, P) cannot be bounded. An internal cycle is an oriented cycle such that all the vertices have at least one prede- cessor and one successor in G (said otherwise every cycle contain neither a source nor a sink of G). We prove that, for any family of dipaths P, w(G, P) = π(G, P) if and only if G is without internal cycle. We also consider a new class of DAGs, which is of interest in itself, those for which there is at most one dipath from a vertex to another. We call these digraphs UPP-DAGs. For these UPP-DAGs we show that the load is equal to the maximum size of a clique of the conflict graph. We prove that the ratio between w(G, P) and π(G, P) cannot be bounded (a result conjectured in an other article). For that we introduce “good labelings” of the conflict graph associated to G and P, namely labelings of the edges such that for any ordered pair of vertices (x, y) there do not exist two paths from x to y with increasing labels.},
url = {http://hal.inria.fr/index.php?halsid=m0tbsqjvcd9gauk3gfbnp872g3&view_this_doc=inria-00387085&version=1},
pdf = {http://hal.inria.fr/docs/00/38/70/85/PDF/upp0509.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{BCM+09,
author = {J-C. Bermond and D. Coudert and J. Moulierac and S. Perennes and H. Rivano and I. Sau and F. {Solano Donado}},
title = {{MPLS} label stacking on the line network},
institution = {INRIA},
year = {2009},
x-pays = {PL,ES},
OPTkey = {},
OPTtype = {},
number = {RR-6803},
OPTaddress = {},
month = jan,
OPTnote = {},
OPTannote = {},
url = {http://hal.inria.fr/inria-00354267/},
pdf = {http://hal.inria.fr/docs/00/35/42/67/PDF/RR-6803.pdf},
abstract = {All-Optical Label Switching (AOLS) is a new technology that performs forwarding without any Optical-Electrical-Optical (OEO) conversions. In this report, we study the problem of routing a set of requests in AOLS networks with the aim of minimizing the number of labels required to ensure the forwarding. In order to spare the label space, we consider label stacking, allowing the configuration of tunnels. We study particularly this network design problem when the network is a line. We provide an exact algorithm for the case in which all the requests have a common source and present some approximation algorithms and heuristics when an arbitrary number of sources are distributed over the line. We contrast the performance of our proposed algorithms by simulations.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{BCM+09c,
author = {J-C. Bermond and D. Coudert and J. Moulierac and S. Perennes and I. Sau and F. {Solano Donado}},
title = {{GMPLS} Routing Strategies based on the Design of Hypergraph Layouts},
institution = {INRIA},
year = {2009},
OPTkey = {},
OPTtype = {},
number = {RR-6842},
OPTaddress = {},
month = feb,
OPTnote = {},
OPTannote = {},
url = {http://hal.inria.fr/inria-00360576/},
pdf = {http://hal.inria.fr/docs/00/36/05/76/PDF/RR-6842.pdf},
abstract = { All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any Optical-Electrical-Optical (OEO) conversions. In this paper, we study the problem of routing a set of requests in AOLS networks using GMPLS technology, with the aim of minimizing the number of labels required to ensure the forwarding. We first formalize the problem by associating to each routing strategy a logical hypergraph whose hyperedges are dipaths of the physical graph, called \emph{tunnels} in GMPLS terminology. Such a hypergraph is called a \emph{hypergraph layout}, to which we assign a cost function given by its physical length plus the total number of hops traveled by the traffic. Minimizing the cost of the design of an AOLS network can then be expressed as finding a minimum cost hypergraph layout. We prove hardness results for the problem, namely $C \log n$ hardness for directed networks and non-existence of \textsc{PTAS} for undirected networks, where $C$ is a a positive constant and $n$ is the number of nodes of the network. These hardness results hold even is the traffic instance is a partial broadcast. On the other hand, we provide an $\mathcal{O}(\log n)$-approximation algorithm to the problem for a general network. Finally, we focus on the case where the physical network is a path, providing a polynomial-time dynamic programming algorithm for a bounded number of sources, thus extending the algorithm of~\cite{BCM+09b} for a single source. },
x-pays = {PL,ES},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@techreport{BCM+09e,
title = { {GMPLS} {L}abel {S}pace {M}inimization through {H}ypergraph {L}ayouts},
author = {J-C. Bermond and D. Coudert and J. Moulierac and S. Perennes and I. Sau and F. {Solano Donado}},
x-pays = {PL,ES},
abstract = {{A}ll-{O}ptical {L}abel {S}witching ({AOLS}) is a new technology that performs packet forwarding without any optical-electrical-optical conversions. {I}n this report, we study the problem of routing a set of requests in {AOLS} networks using {GMPLS} technology, with the aim of minimizing the number of labels required to ensure the forwarding. {W}e first formalize the problem by associating to each routing strategy a logical hypergraph, called a hypergraph layout, whose hyperarcs are dipaths of the physical graph, called tunnels in {GMPLS} terminology. {W}e define a cost function for the hypergraph layout, depending on its total length plus its total hop count. {M}inimizing the cost of the design of an {AOLS} network can then be expressed as finding a minimum cost hypergraph layout. {W}e prove hardness results for the problem, namely for general directed networks we prove that it is {NP}-hard to find a {C} log n-approximation, where {C} is a positive constant and n is the number of nodes of the network. {F}or symmetric directed networks, we prove that the problem is {APX}-hard. {T}hese hardness results hold even if the traffic instance is a partial broadcast. {O}n the other hand, we provide approximation algorithms, in particular an {O}(log n)-approximation for symmetric directed networks. {F}inally, we focus on the case where the physical network is a directed path, providing a polynomial-time dynamic programming algorithm for a fixed number k of sources running in {O}(n^{k+2}) time.},
keywords = {{GMPLS}; optical networks; label stacking; hypergraph layout; approximation algorithms; dynamic programming.},
language = {{A}nglais},
affiliation = {{MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 - {I}nstitute of {T}elecommunications - {W}arsaw {U}niversity of {T}echnology },
type = {Research Report},
institution = {INRIA},
month = {oct},
year = {2009},
number = {RR-7071},
URL = {http://hal.archives-ouvertes.fr/inria-00426681/en/},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/RR-7071.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{BCP09b,
author = {J-C. Bermond and D. Coudert and J. Peters},
title = {Online Distributed Traffic Grooming on Path Networks},
institution = {INRIA},
year = {2009},
OPTkey = {},
OPTtype = {},
number = {RR-6833},
OPTaddress = {},
month = feb,
OPTnote = {},
OPTannote = {},
url = {http://hal.inria.fr/inria-00359810/},
pdf = {http://hal.inria.fr/docs/00/35/98/10/PDF/RR-6833.pdf},
abstract = {The {\em grooming factor} $C$ of a WDM optical network is the number of connections that can share the bandwidth of each wavelength and the process of grouping the requests that will share each wavelength is called {\em traffic grooming}. The goal of traffic grooming is either to reduce the transmission cost by reducing the number of wavelengths or to reduce the hardware cost by reducing the number of Add-Drop Multiplexors (ADM). In this paper, we investigate traffic grooming for directed path networks with online connection requests and distributed routing algorithms. When connection requests are online, the {\em virtual topology} that results from the assignment of ADMs to wavelengths cannot be changed with each request. The design of efficient virtual topologies that minimize either the number of ADMs needed to satisfy any set of connection requests or the blocking of connection requests depends strongly on the routing algorithm. We show how to design the best possible virtual topologies, independently of the routing algorithm, when each node is equipped with the same number of ADMs, and we analyze the performance of distributed greedy routing algorithms.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},
x-pays = {CA},
sorte = "Rapports",

}

@TechReport{BMS09,
sorte = "Rapports",
author = {J-C. Bermond and X. Mu{\~n}oz and I. Sau},
title = {{Traffic Grooming in Bidirectional WDM Ring Networks}},
institution = {INRIA},
year = {2009},
x-pays = {PL,ES},
OPTkey = {},
OPTtype = {},
number = {RR-7080},
OPTaddress = {},
month = oct,
OPTnote = {},
OPTannote = {},
url = {http://hal.inria.fr/inria-00429155/},
pdf = {http://hal.inria.fr/docs/00/42/91/55/PDF/RR-7080.pdf},
abstract = {We study the minimization of ADMs (Add-Drop Multiplexers) in optical WDM bidirectional rings considering symmetric shortest path routing and all-to-all unitary requests. We precisely formulate the problem in terms of graph decompositions, and state a general lower bound for all the values of the grooming factor $C$ and $N$, the size of the ring. We first study exhaustively the cases $C=1$, $C = 2$, and $C=3$, providing improved lower bounds, optimal constructions for several infinite families, as well as asymptotically optimal constructions and approximations. We then study the case $C>3$, focusing specifically on the case $C = k(k+1)/2$ for some $k \geq 1$. We give optimal decompositions for several congruence classes of $N$ using the existence of some combinatorial designs. We conclude with a comparison of the cost functions in unidirectional and bidirectional WDM rings.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@TechReport{BNRR09b,
author = {J-C. Bermond and N. Nisse and P. Reyes and H. Rivano},
title = {Fast Data Gathering in Radio Grid Networks},
institution = {INRIA},
type = {Research Report},
number = {RR-6851},
year = {2009},
month = mar,
url = {http://hal.inria.fr/inria-00363908},
pdf = {http://hal.inria.fr/docs/00/37/11/50/PDF/RR-6851.pdf},
abstract = {The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the time is slotted and that during one time slot (step) each node can transmit to one of its neighbor at most one data item. Each device is equipped with a half duplex interface; so a node cannot both receive and transmit simultaneously. During a step only non interfering transmissions can be done. In other words, the non interfering calls done during a step will form a matching. The aim is to minimize the number of steps needed to send all messages to the base station, a.k.a. makespan or completion time. The best known algorithm for grids was a multiplicative 1.5-approximation algorithm. In such topologies, we give a very simple +2 approximation algorithm and then a more involved +1 approximation algorithm. Moreover, our algorithms work when no buffering is allowed in intermediary nodes, i.e., when a node receives a message at some step, it must transmit it during the next step.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{CCM+09,
author = {N. Cohen and D. Coudert and D. Mazauric and N. Nepomuceno and N. Nisse},
title = {Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks.},
institution = {INRIA},
year = {2009},
number = {RR-7047},
month = sep,
url = {http://hal.archives-ouvertes.fr/inria-00421140/fr/},
abstract = {In this report, we study the problem of rerouting a set of lightpaths in WDM networks. The reconfiguration issue arises for instance when it is necessary to improve the usage of resources or when a maintenance operation is planned on a particular link of the network. In order to avoid service interruptions, old lightpaths should not be torn down before the new ones are set up. However, this may not be possible since establishing the new routes of lightpaths may require the release of resources previously seized by old routes. Then it could be important for the operator to minimize 1) the total number of temporarily disrupted lightpaths, and/or 2) the number of concurrent disrupted lightpaths. In this paper, we study the tradeoff between both these conflicting objectives. More precisely, we prove that there exist some instances for which minimizing one of these objectives arbitrarily impairs the quality of the solution for the other one. We show that such bad tradeoffs may happen even in the case of basic network topologies. On the other hand, we exhibit classes of instances where good tradeoffs can be achieved. Finally, we investigate instances from various networks through simulations.},
pdf = {http://hal.archives-ouvertes.fr/docs/00/42/11/40/PDF/RR-7047.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {BR},
sorte = "Rapports",

}

@techreport{CoHa09,
title = { {P}lanar graphs with maximum degree $\Delta\geq 9$ are ($\Delta+1$)-edge-choosable -- short proof},
author = {N. Cohen and F. Havet},
abstract = {{W}e give a short proof of the following theorem due to {B}orodin~\cite{{B}or90}. {E}very planar graph with maximum degree $\{D}elta\geq 9$ is $(\{D}elta+1)$-edge-choosable.},
keywords = {edge-colouring, list colouring, {L}ist {C}olouring {C}onjecture, planar graphs},
language = {{E}nglish},
affiliation = {{MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 },
type = {Research Report},
URL = {http://hal.archives-ouvertes.fr/inria-00432389/en/},
month = {nov},
year = {2009},
number = {RR-7098},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{CHM09,
author = {N. Cohen and F. Havet and T. M{\"u}ller},
title = {Acyclic edge-colouring of planar graphs },
year = {2009},
month = mar,
institution = {INRIA},
number = {6876},
type = {Research Report},
abstract = {A proper edge-colouring with the property that every cycle contains edges of at least three distinct colours is called an {\it acyclic edge-colouring}. The {\it acyclic chromatic index} of a graph $G$, denoted $\chi'_a(G)$ is the minimum $k$ such that $G$ admits an {\it acyclic edge-colouring} with $k$ colours. We conjecture that if $G$ is planar and $\Delta(G)$ is large enough then $\chi'_a(G)=\Delta(G)$. We settle this conjecture for planar graphs with girth at least $5$ and outerplanar graphs. We also show that $\chi'_a(G)\leq \Delta(G) + 25$ for all planar graph $G$, which improves a previous result by Muthu et al.},
URL={http://hal.inria.fr/inria-00367394/fr/},
PDF = {http://hal.inria.fr/docs/00/36/73/94/PDF/RR-6876.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {IL},
sorte = "Rapports",

}

@TechReport{CGS09,
author = {D. Coudert and F. Giroire and I. Sau},
title = {Circuit visiting 10 ordered vertices in infinite grids},
institution = {INRIA},
year = {2009},
OPTkey = {},
OPTtype = {},
number = {RR-6910},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
url = {http://hal.inria.fr/inria-00378586},
pdf = {http://hal.inria.fr/docs/00/37/85/86/PDF/RR-6910.pdf},
abstract = { A \emph{circuit} in a simple undirected graph $G=(V,E)$ is a sequence of vertices ${v_1,v_2,\ldots,v_{k+1}}$ such that $v_1=v_{k+1}$ and ${v_i,v_{i+i}} \in E$ for $i=1,\ldots,k$. A circuit $C$ is said to be \emph{edge-simple} if no edge of $G$ is used twice in $C$. In this article we study the following problem: which is the largest integer $k$ such that, given any subset of $k$ ordered vertices of an infinite square grid, there exists an edge-simple circuit visiting the $k$ vertices in the prescribed order? We prove that $k=10$. To this end, we first provide a counterexample implying that $k<11$. To show that $k\geq 10$, we introduce a methodology, based on the notion of core graph, to reduce drastically the number of possible vertex configurations, and then we test each one of the resulting configurations with an \textsc{ILP} solver. },
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{CMN09,
author = {D. Coudert and D. Mazauric and N. Nisse},
title = {Routing Reconfiguration/Process Number: Networks with Shared Bandwidth.},
institution = {INRIA},
year = {2009},
OPTkey = {},
OPTtype = {},
number = {RR-6790},
OPTaddress = {},
month = jan,
OPTnote = {},
OPTannote = {},
url = {http://hal.inria.fr/inria-00350025/},
abstract = {In this paper, we address the problem of scheduling the switching of a set of connection requests one after the other from current routing to another pre-determined routing. We propose a model that handles requests using only a constant fraction of the bandwidth of a link, thus generalizing the model proposed in~\cite{CoSe07,JoSo03} for WDM networks. Our main result is the proof that the problem of deciding whether it exists a scheduling of the rerouting of connection requests without traffic interruption is NP-complete even if requests use the third of the bandwidth of a link. Note that the problem is polynomial when the bandwidth of a link cannot be shared~\cite{CoSe07}},
pdf = {http://hal.inria.fr/docs/00/35/00/25/PDF/RR-6790.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{EHN09,
sorte = "Rapports",
author = {N. Eggemann and F. Havet and S. Noble},
title = {$k$-$L(2,1)$-Labelling for Planar Graphs is {NP}-Complete for $k\geq 4$},
year = {2009},
month = feb,
institution = {INRIA},
number = {6840},
type = {Research Report},
abstract = {A mapping from the vertex set of a graph $G=(V,E)$ into an interval of integers $0, \dots ,k$ is an $L(2,1)$-labelling of $G$ of span $k$ if any two adjacent vertices are mapped onto integers that are at least 2 apart, and every two vertices with a common neighbour are mapped onto distinct integers. It is known that for any fixed $k\ge 4$, deciding the existence of such a labelling is an NP-complete problem while it is polynomial for $k\leq 3$. For even $k\geq 8$, it remains NP-complete when restricted to planar graphs. In this paper, we show that it remains NP-complete for any $k \ge 4$ by reduction from Planar Cubic Two-Colourable Perfect Matching. Schaefer stated without proof that Planar Cubic Two-Colourable Perfect Matching is NP-complete. In this paper we give a proof of this. },
URL={http://hal.inria.fr/inria-00360505/fr/},
PDF = {http://hal.inria.fr/docs/00/36/05/05/PDF/RR-6840.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {UK} 
}

@TechReport{EHL+09,
sorte = "Rapports",
author = {R. Erman and F. Havet and B. Lidicky and O. Pangr\'ac},
title = {5-colouring graphs with 4 crossings},
year = {2009},
month = {nov},
institution = {INRIA},
number = {7110},
type = {Research Report},
abstract = {We disprove a conjecture of Oporowski and Zhao stating that every graph with crossing number at most 5 and clique number at most 5 is 5-colourable. However, we show that every graph with crossing number at most 4 and clique number at most 5 is 5-colourable. We also show some colourability results on graphs that can be made planar by removing few edges. In particular, we show that if there exists three edges whose removal leaves the graph planar then it is $5$-colourable.},
x-editorial-board={yes},
x-proceedings={yes},
x-international-audience={yes},
x-pays={CZ,SI},

}

@TECHREPORT{GMP09,
author = {F. Giroire and J. Monteiro and S. P\'erennes},
title = {{P2P} Storage Systems: How Much Locality Can They Tolerate?},
institution = {INRIA},
year = {2009},
type = {Research Report},
number = {{RR}-7006},
month = jul,
abstract = {{L}arge scale peer-to-peer systems are foreseen as a way to provide highly reliable data storage at low cost. {T}o achieve high durability, such {P}2{P} systems encode the user data in a set of redundant fragments and distribute them among the peers. {W}e study here the impact of different data placement strategies on the system performance when using erasure codes redundancy schemes. {S}everal practical factors (easier control, software reuse, latency) tend to favor data placement strategies that preserve some degree of locality. {I}n this paper, we compare three policies: two of them local, in which the data are stored in logical neighbors, and the other one global, in which the data are spread randomly in the whole system. {W}e focus on the study of the probability to lose a data block and the bandwidth consumption to maintain such redundancy. {W}e use simulations to show that, without resource constraints, the average values are the same no matter which placement policy is used. {H}owever, the variations in the use of bandwidth are much more bursty under the local policies. {W}hen the bandwidth is limited, these bursty variations induce longer maintenance time and henceforth a higher risk of data loss. {W}e then show that a suitable degree of locality could be introduced in order to combine the efficiency of the global policy with the practical advantages of a local placement. {F}inally, we propose a new external reconstruction strategy that greatly improves the performance of local placement strategies.},
keywords = {P2P storage system, data placement, performance evaluation, data durability},
pages = {20 },
url = {http://hal.inria.fr/inria-00408078/en/},
pdf = {http://hal.inria.fr/docs/00/40/80/78/PDF/RR-7006.pdf},
x-pays = {},
sorte = "Rapports",

}

@TechReport{HJS+09,
sorte = "Rapports",
author = {F. Havet and S. Jendrol' and R. Sot\'ak and E. \v{S}krabul'akov\'a},
title = {Facial non-repetitive edge-colouring of plane graphs},
year = {2009},
month = {feb},
institution = {INRIA},
number = {6873},
type = {Research Report},
abstract = {A sequence $r_1,r_2,\dots,r_{2n}$ such that $r_i=r_{n+i}$ for all $1\leq i \leq n$, is called a {\em repetition}. A sequence $S$ is called {\em non-repetitive} if no {\it block} (i.e. subsequence of consecutive terms of $S$) is a repetition. Let $G$ be a graph whose edges are coloured. A trail is called {\em non-repetitive} if the sequence of colours of its edges is non-repetitive. If $G$ is a plane graph, a {\em facial non-repetitive edge-colouring} of $G$ is an edge-colouring such that any {\it facial trail} (i.e. trail of consecutive edges on the boundary walk of a face) is non-repetitive. We denote $\pi'_f(G)$ the minimum number of colours of a facial non-repetitive edge-colouring of $G$. In this paper, we show that $\pi'_f(G)\leq 8$ for any plane graph $G$. We also get better upper bounds for $\pi'_f(G)$ in the cases when $G$ is a tree, a plane triangulation, a simple $3$-connected plane graph, a hamiltonian plane graph, an outerplanar graph or a Halin graph. The bound $4$ for trees is tight.},
URL={http://hal.inria.fr/inria-00366589/en/},
PDF = {http://hal.inria.fr/docs/00/36/65/89/PDF/RR-6873.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {SK},

}

@TECHREPORT{Hog09,
sorte = "Rapports",
author = {L. Hogie and D. Papadimitriou and I. Tahiri and F. Majorczyk},
title = {Simulating routing schemes on large-scale topologies},
abstract = {The expansion of the Internet routing system results in a number of research challenges, in particular, the Border Gateway Protocol (BGP) starts to show its limits a.o. in terms of the number of routing table entries it can dynamically process and control. Dynamic routing protocols showing better scaling properties are thus under investigation. However, because deploying under-development routing protocols on the Internet is not practicable at a large-scale (due to the size of the Internet topology), simulation is an unavoidable step to validate the properties of a newly proposed routing scheme. Unfortunately, the simulation of inter-domain routing protocols over large networks (order of tens of thousands of nodes) poses real challenges due to the limited memory and computational power that computers impose. This paper presents the Dynamic Routing Model simulator \drmsim which addresses the specific problem of large-scale simulations of (inter-domain) routing models on large networks. The motivation for developing a new simulator lies in the limitation of existing simulation tools in terms of the number of nodes they can handle and in the models they propose. },
url = {http://hal.inria.fr/inria-00440114/},
pdf = {http://hal.inria.fr/docs/00/44/01/14/PDF/simulating_routing_schemes_on_large-scale_topologies.pdf},
institution = {INRIA},
year = {2009},
number = {RT-0371},
month = {nov},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {BE} 
}

@TechReport{HMN+09,
sorte = "Rapports",
author = {F. Huc and C. Molle and N. Nisse and S. Perennes and H. Rivano},
title = {Stability of a local greedy distributed routing algorithm},
institution = {INRIA},
year = {2009},
OPTkey = {},
OPTtype = {},
number = {RR-6871},
OPTaddress = {},
month = mar,
OPTnote = {},
OPTannote = {},
url = {http://hal.inria.fr/inria-00366441/},
pdf = {http://hal.inria.fr/docs/00/36/64/41/PDF/RR-6871.pdf},
abstract = {In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We provide a distributed and local algorithm that transmits packets hop by hop in the network and study its behaviour. At each step, a node transmits its queued packets to its neighbours in order to optimize a local gradient. This protocol is thus greedy since it does not require to record the history about the past actions, and lazy since it only needs informations of the neighborhood. We prove that this protocol is however optimal in the sense that the number of packets stored in the network stays bounded as soon as the sources injects a flow that another method could have exhausted. We therefore reinforce a result from the literature that worked for differentiated suboptimal flows.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@techreport{MDD09,
sorte = "Rapports",
title = { {N}etwork {P}rovisioning for {H}igh {S}peed {V}ehicles {M}oving along {P}redictable {R}outes - {P}art 1: {S}piderman {H}andover},
author = {J-C. {Maureira Bravo} and D. Dujovne and O. Dalle},
abstract = {{T}his report presents our on-going work on a new system designed to provide a continuous network connectivity to communicating devices located on-board a vehicle moving at ”high speed” with a predictable trajectory such as trains, subways or buses. {T}he devices on-board the vehicle form a sub-network called the ”in-motion network”. {T}his system we propose is composed of two parts. {T}he mobile part, called {S}piderman {D}evice ({SD}), installed on the roof of the vehicle, and the fixed part is composed of multiples access points, called {W}ireless {S}witch {A}ccess {P}oints ({WS} {AP}s), installed along the predictable route of the vehicle. {T}o provide a continuous connectivity, we designed a new handover algorithm that relies on a two {IEEE}802.11 radio hardware placed in the {SD} device. {T}his dual-radio architecture allows to minimize or even hide the handover effects, achieving a seamless continuous data-link connection at high speeds, up-to 150 {K}m/h and possibly more. {T}he link between the {SD} and the {WS} {AP} forms a {L}ayer 2 {E}thernet {B}ridge, supporting any {L}ayer 3 protocol between the infrastructure network and the in-motion network. {T}his concept has been validated by simulations and is currently tested using a real prototype in order to assess the performances and practical feasibility of the system.},
language = {{A}nglais},
affiliation = {{MASCOTTE} - {INRIA} {S}ophia {A}ntipolis / {L}aboratoire {I}3{S} - {INRIA} - {U}niversit{\'e} de {N}ice {S}ophia-{A}ntipolis - {CNRS} : {UMR}6070 - {PLANETE} - {INRIA} {S}ophia {A}ntipolis / {INRIA} {R}h{\^o}ne-{A}lpes - {INRIA} },
type = {Research Report},
institution = {INRIA},
number = {{RR}-6850},
year = {2009},
URL = {http://hal.inria.fr/inria-00369419/en/},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {CL},

}

@TechReport{RST09,
sorte = "Rapports",
author = {J. Ru\'e and I. Sau and D. M. Thilikos},
title = {{Dynamic Programming for Graphs on Surfaces}},
institution = {INRIA},
year = {2009},
number = {RR-7166},
month = dec,
abstract = {We provide a framework for the design of $2^{\mathcal{O}(k)}\cdot n$ step dynamic programming algorithms for surface-embedded graphs on $n$ vertices of branchwidth at most $k$. Our technique applies to graph problems for which dynamic programming uses tables encoding set partitions. For general graphs, the best known algorithms for such problems run in $2^{\mathcal{O}(k\cdot \log k)}\cdot n$ steps. That way, we considerably extend the class of problems that can be solved by algorithms whose running times have a {\em single exponential dependence} on branchwidth, and improve the running time of several existing algorithms. Our approach is based on a new type of branch decomposition called {\em surface cut decomposition}, which generalizes sphere cut decompositions for planar graphs, and where dynamic programming should be applied for each particular problem. The construction of such a decomposition uses a new graph-topological tool called {\em polyhedral decomposition}. The main result is that if dynamic programming is applied on surface cut decompositions, then the time dependence on branchwidth is {\sl single exponential}. This fact is proved by a detailed analysis of how non-crossing partitions are arranged on surfaces with boundary and uses diverse techniques from topological graph theory and analytic combinatorics.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/RR-7166.pdf},

}

@TechReport{SRD09a,
sorte = "Rapports",
author = {A. Silva and P. Reyes and M. Debbah},
title = {Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks},
institution = {INRIA},
type = {Research Report},
number = {RR-6854},
year = {2009},
month = mar,
url = {http://hal.inria.fr/inria-00364370},
pdf = {http://hal.inria.fr/docs/00/36/43/70/PDF/RR-6854.pdf},
abstract = {Congestion in wireless ad-hoc and sensor networks not only causes packet loss, and increases queueing delay, but also leads to unnecessary energy consumption. In a wireless ad-hoc and sensor network, two types of congestion can occur: node-level congestion, which is caused by buffer overflow in the node, or link-level congestion, when wireless channels are shared by several nodes and collisions occur when multiple active nodes try to seize the channel at the same time. We study a measure of link-level congestion in a static wireless ad-hoc and sensor network randomly deployed over an area. The measure considered on this paper is the inverse of the greatest eigenvalue of the adjacency matrix of the random graph. This measure of congestion gives an approximation of the average quantity of wireless links of a certain length that a node have on the wireless ad-hoc and sensor network. We review the results to find this measure of congestion in a Bernoulli random graph and we use tools from random graph theory and random matrix theory to extend this measure of congestion on a Geometric random graph.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@MISC {GuOn09b,
sorte = "conf-sa",
OPTKEY = { },
AUTHOR = { Guinand, F. and Onfroy, B. },
TITLE = { MANET : mod\`ele de mobilit\'e planifi\'e },
HOWPUBLISHED = { Ubimob'09 },
MONTH = jul,
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Brice.Onfroy/publi/2009/pdf/2009_ubimob_[guinand-onfroy]_scheduled_mobility.pdf},
YEAR = { 2009 },
NOTE = { Demonstration },
OPTANNOTE = { },
KEYWORDS = {r\'eseau mobile ad-hoc, MANET, graphe dynamique, mod\`ele de mobilit\'e, mobilit\'e planifi\'ee, environnement urbain},
ABSTRACT = {Avec la multiplication des terminaux communicants, les r\'eseaux mobiles ad-hoc ont maintenant la capacit\'e de se d\'evelopper. Ces r\'eseaux ne poss\`edent pas d'infrastructure fixe, et le d\'eplacement des terminaux rend leur voisinage instable. Il est tr\`es difficile d'effectuer des mesures r\'eelles sur ce type de r\'eseau afin d'en \'etudier la dynamique. Dans l'objectif de concevoir des m\'ethodes d\'ecentralis\'ees efficaces, il est donc important de pouvoir simuler une mobilit\'e pertinente en fonction de l'environnement et du support des mouvements (hommes, v\'ehicules, ...) afin de recr\'eer de facon globale un r\'eseau dynamique proche du r\'eel. De nombreux mod\`eles de mobilit\'e ont d\'ej\`a \'et\'e propos\'es afin d'\'etudier et d'analyser les protocoles de routage et de communication, ainsi que certains algorithmes (diffusion en particulier). Le but de cette d\'emonstration est de pr\'esenter une plate-forme de simulation de mod\`eles de mobilit\'e en environnements urbains. La mise en oeuvre d'un nouveau type de mobilit\'e ax\'ee sur la planification de d\'eplacements illustrera l'utilisation et le fonctionnement de cette plate-forme.},
OPTx-editorial-board = {yes},
OPTx-proceedings = {yes},
OPTx-international-audience = {yes} 
}

@Misc{DMPR09,
author = {J. Ribault and F. Peix and J. Monteiro and O. Dalle},
title = {OSA: an Integration Platform for Component-Based Simulation},
howpublished = {Second Intl. Conf. on Simulation Tools and Techniques (SIMUTools09)},
year = {2009},
address = {Rome, Italy},
month = {mar},
note = {Poster abstract.},
ABSTRACT = {Many discrete-event simulators are developed concurrently, but with identical or similar purpose. This poster presents the Open Simulation Architecture (OSA), a discrete-event component-based simulation platform whose goal is to favor the reuse and integration of simulation software components and models. To favor reuse, OSA uses a layered approach to combine the modeling, simulation, and related concerns, such as instrumentation or deployment. OSA is both a testbed for experimenting new simulation techniques and a tool for real case studies. The ability of OSA to support challenging studies is illustrated by a Peer-to-peer system case study involving millions of components.},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/DMPR09.pdf},
sorte = "conf-sa",

}

@PROCEEDINGS{DaWa08,
TITLE = { {1st International Conference on Simulation and Techniques for Communications, Networks and Systems (SIMU Tools 2008)} },
YEAR = { 2008 },
OPTKEY = { },
EDITOR = { O. Dalle and G.A. Wainer },
OPTVOLUME = { },
OPTNUMBER = { },
OPTSERIES = { },
ADDRESS = { Marseille, France },
MONTH = mar,
OPTORGANIZATION = { },
OPTPUBLISHER = { },
OPTNOTE = { },
OPTANNOTE = { },
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "livres-edit",

}

@Proceedings{phdnow08,
title = {PhD workshop (PhD-NOW)},
year = {2008},
editor = {D. Coudert and S. Krco and K. Wrona},
address = {Sophia Antipolis, France},
month = sep,
organization = {I3S, CNRS, Universit\'e de Nice Sophia, INRIA},
url = {http://hal.inria.fr/PHDNOW08},
OPTnote = {\url{http://hal.inria.fr/PHDNOW08}},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "livres-edit",

}

@Proceedings{adhocamc08,
title = {1st International Workshop on Ad-hoc Ambient Computing (AdhocAmC)},
year = {2008},
editor = {D. Coudert and V. Issarny and N. Georgantas},
address = {Sophia Antipolis, France},
month = sep,
organization = {I3S, CNRS, Universit\'e de Nice Sophia, INRIA},
url = {http://hal.inria.fr/ADHOCAMC08},
OPTnote = {\url{http://hal.inria.fr/ADHOCAMC08}},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "livres-edit",

}

@Proceedings{CSS08,
title = {7th International Conference on AD-HOC Networks \& Wireless (AdHoc-NOW)},
year = {2008},
OPTkey = {},
editor = {D. Coudert and D. Simplot-Ryl and I. Stojmenovic},
volume = {5198},
OPTnumber = {},
series = {Lecture Notes in Computer Science},
OPTaddress = {},
month = sep,
OPTorganization = {},
publisher = {Springer},
url = {http://dx.doi.org/10.1007/978-3-540-85209-4},
OPTnote = {},
OPTannote = {},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "livres-edit",

}

@PhdThesis{Gal08a,
author = {J. Galtier},
title = {L'adaptativit\'e dans les t\'el\'ecommunications},
school = {Universit\'e de Nice-Sophia Antipolis},
year = {2008},
month = {February},
OPTkey = {},
type = {Habilitation \`a Diriger des Recherches},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
POSTSCRIPT = {},
sorte = "HDR",

}

@PhdThesis{Huc08,
author = {F. Huc},
title = {Conception de R\'eseaux Dynamiques Tol\'erants aux Pannes},
school = {\'Ecole doctorale STIC, Universit\'e de Nice-Sophia Antipolis},
year = {2008},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
month = nov,
OPTnote = {},
OPTannote = {},
OPTPOSTSCRIPT = {},
abstract = { Cette thèse aborde différents aspects de la conception d'un réseau de télécommunications. Un tel réseau utilise des technologies hétérogènes: liens antennes-satellites, radio, fibres optiques ou bien encore réseaux embarqués dans un satellite. Les problématiques varient en fonction de la partie du réseau considérée, du type de requêtes et de l'objectif. Le cas des requêtes de type paquets est abordé dans le cadre des réseaux en forme de grille, mais le thème principal est le routage de requêtes de type connections (unicast et multicast). Les objectifs considérés sont : la conception d'un réseau embarqué dans un satellite de télécommunication, de taille minimum et tolérant des pannes de composants; le dimensionnement des liens d'un réseau afin qu'il supporte des pannes corrélées ou qu'il offre une bonne qualité de service, ou s'il autorise des connections multicast; le dimensionnement de la taille des buffers d'un réseau d'accés radio; et l'optimisation de l'utilisation des ressources d'un réseau dynamique orienté connections. Dans tous ces cas la problématique du routage de connections est centrale. Mon approche consiste � utiliser la complémentarité de techniques algorithmique et d'optimisation combinatoire ainsi que d'outils issus de la théorie des graphes tels la pathwidth et des notions reliées -process number, jeux de captures et treewidth-, différents types de coloration -impropre et pondérée, proportionnelle, directed star colouring-, les graphes d'expansion et des techniques de partitions telle la quasi partition.},
pdf = {http://www-sop.inria.fr/sloop/personnel/Florian.Huc/Publications/TheseComplete.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "these",

}

@InBook{AdRe08,
author = {L. {Addario-Berry} and B. Reed},
ALTeditor = {},
title = {Horizons of Combinatorics},
chapter = {Ballot Theorems, Old and New},
publisher = {Springer},
year = {2008},
OPTkey = {},
volume = {17},
OPTnumber = {},
series = {Bolyai Society Mathematical Studies},
OPTtype = {},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
pages = {9-35},
OPTnote = {},
OPTannote = {},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "livres-chap",

}

@incollection{NPC08,
author = {N. Nepomuceno and P.R. Pinheiro and A.L.V. Coelho},
title = {A Hybrid Optimization Framework for Cutting and Packing Problems: Case Study on Constrained {2D} Non-guillotine Cutting},
booktitle = {Recent Advances in Evolutionary Computation for Combinatorial Optimization},
series = {Studies in Computational Intelligence},
volume = {153},
year = {2008},
pages = {87-99},
publisher = {Springer},
chapter = {6},
abstract = {This work presents a hybrid optimization framework for tackling cutting and packing problems, which is based upon a particular combination scheme between heuristic and exact methods. A metaheuristic engine works as a generator of reduced instances for the original optimization problem, which are formulated as mathematical programming models. These instances, in turn, are solved by an exact optimization technique (solver), and the performance measures accomplished by the respective models are interpreted as score (fitness) values by the metaheuristic, thus guiding its search process. As a means to assess the potentialities behind the novel approach, we provide an instantiation of the framework for dealing specifically with the constrained two-dimensional non-guillotine cutting problem. Computational experiments performed over standard benchmark problems are reported and discussed here, evidencing the effectiveness of the novel approach.},
url = {http://dx.doi.org/10.1007/978-3-540-70807-0_6},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/NPC08.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {BR},
sorte = "livres-chap",

}

@ARTICLE{ACH+08,
AUTHOR={L. Addario-Berry and M. Chudnovsky and F. Havet and B. Reed and P. Seymour},
TITLE={Bisimplicial vertices in even-hole-free graphs},
JOURNAL = {Journal of Combinatorial Theory Ser. B},
VOLUME = {98},
NUMBER = {6},
YEAR = {2008},
PAGES = {1119--1164},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/ACH+08.pdf},
abstract = {A hole in a graph is an induced subgraph which is a cycle of length at least four. A hole is called even if it has an even number of vertices. An even-hole-free graph is a graph with no even holes. A vertex of a graph is bisimplicial if the set of its neighbours is the union of two cliques. In this paper we prove that every even-hole-free graph has a bisimplicial vertex, which was originally conjectured by Reed.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@article{ADR08,
author = {L. {Addario-Berry} and K. Dalal and B. Reed},
title = {Degree-Constrained Subgraphs},
journal = {Discrete Applied Mathematics},
volume = {156},
year = {2008},
pages = {1168-1174},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@Article{BBMM08,
author = {N. {Ben Ali} and B. Belghith and J. Moulierac and M. Moln\'ar},
title = {{QoS multicast aggregation under multiple additive constraints}},
journal = {Computer Communications},
year = {2008},
volume = {31},
number = {15},
pages = {3564-3578},
series= {Elsevier},
month = sep,
PDF={ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/benali08qos.pdf},
ABSTRACT={IP Multicast has been proposed in order to manage group communications over the Internet in a bandwidth efficient manner. Although such a proposition has been well studied, there are still some inherent problems for its widespread deployment. In this paper, we propose a new algorithm coined mQMA that deals with the two main problems of traditional IP multicast, i.e., multicast forwarding state scalability and multi-constrained QoS routing. The algorithm mQMA is a QoS multicast aggregation algorithm which handles multiple additive QoS constraints. It builds few trees and maintains few forwarding states for the groups thanks to the technique of multicast tree aggregation, which allows several groups to share the same delivery tree. Moreover, the algorithm mQMA builds trees satisfying multiple additive QoS constraints. We show via extensive simulations that mQMA reduces dramatically the number of trees to be maintained and reduces the utilization of the network resources, yet it leverages the same overall QoS performances as Mamcra which is the main known multi-constrained multicast routing algorithm.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@Article{BCL08,
author = {J-C. Bermond and D. Coudert and B. L\'ev\^eque},
title = {Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring},
journal = {Journal of Interconnection Networks (JOIN)},
year = {2008},
OPTkey = {},
volume = {9},
number = {4},
pages = {471-486},
month = dec,
OPTnote = {},
OPTannote = {},
abstract = {Traffic grooming in a WDM network consists of assigning to each request (lightpath) a wavelength with the constraint that a given wavelength can carry at most C requests or equivalently a request uses at most 1/C of the bandwidth. C is known as the grooming ratio. A request (lightpath) need two SONET add-drop multiplexers (ADMs) at each end node~; using grooming different requests can share the same ADM. The so called traffic grooming problem consists of minimizing the total number of ADMs to be used (in order to reduce the overall cost of the network). Here we consider the traffic grooming problem in WDM unidirectional rings with all-to-all uniform unitary traffic. This problem has been optimally solved for specific values of the grooming ratio, namely C=2,3,4,5,6. In this paper we present various simple constructions for the grooming problem providing good approximation of the total number of ADMs. For that we use the fact that the problem corresponds to a partition of the edges of the complete graph into subgraphs, where each subgraph has at most C edges and where the total number of vertices has to be minimized.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCL-JOIN08.pdf},
url = {http://dx.doi.org/10.1142/S0219265908002394},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@article{BFNV08,
author = {L. Blin and P. Fraigniaud and N. Nisse and S. Vial},
title = {Distributed chasing of network intruders},
journal = {Theoretical Computer Science},
volume = {399},
number = {1-2},
year = {2008},
pages = {12-37},
abstract = {Graph searching is one of the most popular tools for analyzing the chase for a powerful and hostile software agent (called the "intruder"), by a set of software agents (called the "searchers") in a network. The existing solutions for the graph searching problem suffer however from a serious drawback: they are mostly centralized and assume a global synchronization mechanism for the searchers. In particular: (1) the search strategy for every network is computed based on the knowledge of the entire topology of the network, and (2) the moves of the searchers are controlled by a centralized mechanism that decides at every step which searcher has to move, and what movement it has to perform. This paper addresses the graph searching problem in a distributed setting. We describe a distributed protocol that enables searchers with logarithmic size memory to clear any network, in a fully decentralized manner. The search strategy for the network in which the searchers are launched is computed online by the searchers themselves without knowing the topology of the network in advance. It performs in an asynchronous environment, i.e., it implements the necessary synchronization mechanism in a decentralized manner. In every network, our protocol performs a connected strategy using at most k+1 searchers, where k is the minimum number of searchers required to clear the network in a monotone connected way using a strategy computed in the centralized and synchronous setting.},
url = {http://dx.doi.org/10.1016/j.tcs.2008.02.004},
pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Sirocco06VJ.ps},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@article{CF+08,
author = {M. Cerioli and L. Faria and T. Ferreira and C. Martinhon and F. Protti and B. Reed},
title = {Partition into cliques for cubic graphs: Planar case, complexity and approximation},
journal = {Discrete Applied Mathematics},
volume = {156},
pages = {2270-2278},
year = {2008},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@Article{CCL07a,
author = {R. Chand and M. Cosnard and L. Liquori},
title = {{Powerful resource discovery for Arigatoni overlay network}},
journal = {Future Generation Computer Systems},
publisher = {Elsevier},
year = {2008},
volume = {24},
OPTnumero = {1},
pages = {31--38},
url={http://dx.doi.org/10.1016/j.future.2007.02.009e },
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/fgcs-07.pdf},
sorte = "rev-int",

}

@article{FHRV08,
author = {S. Fiorini and N. Hardy and B. Reed and A. Vetta},
title = {Planar graph bipartization in linear time},
journal = {Discrete Applied Mathematics},
volume = {156},
year = {2008},
pages = {1175-1180},
abstract = {For each constant k, we present a linear time algorithm that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is no transversal of size at most k.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@article{FKNP07b,
author={M. Flammini and R. Klasing and A. Navarra and S. P\'erennes},
title={Tightening the Upper Bound for the Minimum Energy Broadcasting problem},
year={2008},
month={October},
volume={14},
number={5},
pages={659--669},
journal={Wireless Networks},
note={Special Issue associated to the 3rd International Symposium on Modelling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt 2005)},
url = {http://www.springerlink.com/content/l4262574u4802253/},
sorte = "rev-int",

}

@article{FMNP08,
author = "M. Flammini and L. Moscardelli and A. Navarra and S. P\'erennes",
title = {Asymptotically Optimal Solutions for Small World Graphs},
journal = "Theory of Computing Systems",
volume = {42},
number = {4},
pages = {632-650},
month = may,
year = {2008},
url = {http://www.springerlink.com/content/h42450h68063628g/},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/FNMP08.pdf},
abstract = {We consider the problem of determining constructions with an asymptotically optimal oblivious diameter in small world graphs under the Kleinberg’s model. In particular, we give the first general lower bound holding for any monotone distance distribution, that is induced by a monotone generating function. Namely, we prove that the expected oblivious diameter is Ω(log 2 n) even on a path of n nodes. We then focus on deterministic constructions and after showing that the problem of minimizing the oblivious diameter is generally intractable, we give asymptotically optimal solutions, that is with a logarithmic oblivious diameter, for paths, trees and Cartesian products of graphs, including d-dimensional grids for any fixed value of d.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@article{FoRe08,
author = {N. Fountoulakis and B. Reed},
title = {The evolution of the mixing rate of a simple random walk on the giant component of a random graph},
journal = {Random Structures and Algorithms},
volume = {33},
year = {2008},
pages = {68-86},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@article{FrNi08,
author = {P. Fraigniaud and N. Nisse},
title = {Monotony Properties of Connected Visible Graph Searching},
journal = {Information and Computation},
volume = {206},
number = {12},
year = {2008},
pages = {1383-1393},
abstract = {Search games are attractive for their correspondence with classical width parameters. For instance, the \emph{invisible} search number (a.k.a. \emph{node} search number) of a graph is equal to its pathwidth plus~1, and the \emph{visible} search number of a graph is equal to its treewidth plus~1. The \emph{connected} variants of these games ask for search strategies that are connected, i.e., at every step of the strategy, the searched part of the graph induces a connected subgraph. We focus on \emph{monotone} search strategies, i.e., strategies for which every node is searched exactly once. The monotone connected visible search number of an $n$-node graph is at most $O(\log n)$ times its visible search number. First, we prove that this logarithmic bound is tight. Precisely, we prove that there is an infinite family of graphs for which the ratio monotone connected visible search number over visible search number is $\Omega(\log n)$. Second, we prove that, as opposed to the non-connected variant of visible graph searching, ``recontamination helps" for connected visible search. Precisely, we prove that, for any $k \geq 4$, there exists a graph with connected visible search number at most $k$, and monotone connected visible search number $>k$.}, url = {http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2006.html}, pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/WG06_nisse.ps}, OPTx-editorial-board={yes}, OPTx-proceedings={yes}, OPTx-international-audience={yes}, sorte = "rev-int", 
}

@article{HSS08,
author = {F. Havet and J.-S. Sereni and R. Skrekovski},
title = {3-facial colouring of plane graphs},
journal = {SIAM Journal on Discrete Mathematics},
volume={22},
number={1},
pages={231--247},
year = {2008},
URL={http://dx.doi.org/10.1137/060664124},
PDF = {http://kam.mff.cuni.cz/~sereni/Articles/HSS08.pdf},
abstract={A plane graph is \l-facially $k$-colourable if its vertices can be coloured with $k$ colours such that any two distinct vertices on a facial walk of length at most \l are coloured differently. We prove that every plane graph is $3$-facially $11$-colourable. As a consequence, we derive that every $2$-connected plane graph with maximum face-size at most $7$ is cyclically $11$-colourable. These two bounds are for one off from those that are proposed by the $(3\l+1)$-Conjecture and the Cyclic Conjecture.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@ARTICLE{HTY08,
AUTHOR={F. Havet and S. Thomass\'e and A. Yeo},
TITLE={{H}oang-{R}eed conjecture for tournaments},
JOURNAL = {Discrete Mathematics},
VOLUME = {308},
NUMBER = {15},
MONTH = aug,
YEAR = {2008},
PAGES = {3412--3415},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/HTY08.pdf},
abstract={Ho\`ang-Reed conjecture asserts that every digraph $D$ has a collection $\cal C$ of circuits $C_1,\dots,C_{\delta ^+}$, where $\delta ^+$ is the minimum outdegree of $D$, such that the circuits of $\cal C$ have a forest-like structure. Formally, $|V(C_i)\cap (V(C_1)\cup \dots \cup V(C_{i-1}))|\leq 1$, for all $i=2,\dots ,\delta^+$. We verify this conjecture for the class of tournaments.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@ARTICLE{HaYu08,
AUTHOR = "F. Havet and M-L. Yu",
TITLE = "$(p,1)$-total labelling of graphs",
JOURNAL = "Discrete Mathematics",
VOLUME = "308",
NUMBER = "4",
MONTH = feb,
YEAR = "2008",
PAGES = "496--513",
PDF = "ftp://ftp-sop.inria.fr/mascotte/Publications/HaYu08.pdf",
abstract={A $(p,1)$-total labelling of a graph $G$ is an assignment of integers to $V(G)\cup E(G)$ such that: (i) any two adjacent vertices of $G$ receive distinct integers, (ii) any two adjacent edges of $G$ receive distinct integers, and (iii) a vertex and its incident edge receive integers that differ by at least $p$ in absolute value. The {\it span} of a $(p,1)$-total labelling is the maximum difference between two labels. The minimum span of a $(p,1)$-total labelling of $G$ is called the {\it $(p,1)$-total number} and denoted by $\lambda_p^T(G)$. We provide lower and upper bounds for the $(p,1)$-total number. In particular, generalizing the Total Colouring Conjecture, we conjecture that $\lambda_p^T\leq \Delta+ 2p - 1$ and give some evidences to support it. Finally, we determine the exact value of $\lambda^T_p(K_n)$, except for even $n$ in the interval $[p+5, 6p2-10p+4]$ for which we show that $\lambda_p^T(K_n) \in n+2p-3, n+2p-2$.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@Article{KMS07,
author = {R. J. Kang and T. M\"uller and J.-S. Sereni},
title = {Improper colouring of (random) unit disk graphs},
year = {2008},
journal = {Discrete Mathematics},
volume={308},
OPTnumero= {8},
month = {April},
pages={1438--1454},
note={The {S}pecial {I}ssue devoted to {E}uro{C}omb 2005},
PDF={http://kam.mff.cuni.cz/~sereni/Articles/KMS07.pdf},
sorte = "rev-int",

}

@article{KLRW08,
author = {K. Kawarabayashi and O. Lee and B. Reed and P. Wollan},
title = {A weaker version of {L}ovasz' path removable conjecture},
journal = {Journal of Combinatorial Theory (Series B)},
volume = {98},
year = {2008},
pages = {972-979},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@article{KaRe08a,
author = {K. Kawarabayashi and B. Reed},
title = {Fractional coloring and the odd {H}adwiger's conjecture},
journal = {European Journal of Combinatorics},
volume = {29},
number = {2},
year = {2008},
pages = {411-417},
abstract ={Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, then it is (p-1)-colorable. This is an analogue of the well known conjecture of Hadwiger, and in fact, this would immediately imply Hadwiger's conjecture. The current best known bound for the chromatic number of graphs without an odd complete minor of order p is O(plogp) by the recent result by Geelen et al. [J. Geelen, B. Gerards, B. Reed, P. Seymour, A. Vetta, On the odd variant of Hadwiger's conjecture (submitted for publication)], and by Kawarabayashi [K. Kawarabayashi, Note on coloring graphs without odd K"k-minors (submitted for publication)] (but later). But, it seems very hard to improve this bound since this would also improve the current best known bound for the chromatic number of graphs without a complete minor of order p. Motivated by this problem, we prove that the ''fractional chromatic number'' of a graph G without odd K"p-minor is at most 2p; that is, it is possible to assign a rational q(S)>=0 to every stable set SV(G) so that "S"vq(S)=1 for every vertex v, and "Sq(S)2p. This generalizes the result of Reed and Seymour [B. Reed, P.D. Seymour, Fractional chromatic number and Hadwiger's conjecture, J. Combin. Theory Ser. B 74 (1998) 147-152] who proved that the fractional chromatic number of a graph with no K"p"+"1-minor is at most 2p.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@Article{KMP08,
author = "R. Klasing and N. Morales and S. P\'erennes",
title = "On the Complexity of Bandwidth Allocation in Radio Networks",
journal = "Theoretical Computer Science",
url = "http://dx.doi.org/10.1016/j.tcs.2008.06.048",
year = "2008",
month = oct,
pages = "225-239",
volume = "406",
number = "3",
abstract = "We define and study an optimization problem that is motivated by bandwidth allocation in radio networks. Because radio transmissions are subject to interference constraints in radio networks, physical space is a common resource that the nodes have to share in such a way, that concurrent transmissions do not interfere. The bandwidth allocation problem we study under these constraints is the following. Given bandwidth (traffic) demands between the nodes of the network, the objective is to schedule the radio transmissions in such a way that the traffic demands are satisfied. The problem is similar to a multicommodity flow problem, where the capacity constraints are replaced by the more complex notion of non-interfering transmissions. We provide a formal specification of the problem that we call round weighting. By modeling non-interfering radio transmissions as independent sets, we relate the complexity of round weighting to the complexity of various independent set problems (e.g. maximum weight independent set, vertex coloring, fractional coloring). From this relation, we deduce that in general, round weighting is hard to approximate within n1−ε (n being the size of the radio network). We also provide polynomial (exact or approximation) algorithms e.g. in the following two cases: (a) when the interference constraints are specific (for instance for a network whose vertices belong to the Euclidean space), or (b) when the traffic demands are directed towards a unique node in the network (also called gathering, analogous to single commodity flow).",
pdf = "ftp://ftp-sop.inria.fr/mascotte/Publications/KMP08.pdf",
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@article{LMR08,
author = {C. {Linhares-Sales} and F. Maffray and B. Reed},
title = {On Planar Quasi-Parity Graphs},
journal = {SIAM Journal of Discrete Mathematics},
volume = {22},
year = {2008},
pages = {329-347},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@article{MaNi08,
author = {F. Mazoit and N. Nisse},
title = {Monotonicity of non-deterministic graph searching},
journal = {Theoretical Computer Science},
volume = {399},
number = {3},
year = {2008},
pages = {169-178},
abstract = {In graph searching, a team of searchers are aiming at capturing a fugitive moving in a graph. In the initial variant, called invisible graph searching, the searchers do not know the position of the fugitive until they catch it. In another variant, the searchers permanently know the position of the fugitive, i.e. the fugitive is visible. This latter variant is called visible graph searching. A search strategy that catches any fugitive in such a way that the part of the graph reachable by the fugitive never grows is called monotone. A priori, monotone strategies may require more searchers than general strategies to catch any fugitive. This is however not the case for visible and invisible graph searching. Two important consequences of the monotonicity of visible and invisible graph searching are: (1) the decision problem corresponding to the computation of the smallest number of searchers required to clear a graph is in NP, and (2) computing optimal search strate gies is simplified by taking into account that there exist some that never backtrack. Fomin et al. [F.V. Fomin, P. Fraigniaud, N. Nisse, Nondeterministic graph searching: From pathwidth to treewidth, in: Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, MFCS 2005, pp. 364--375] introduced an important graph searching variant, called non-deterministic graph searching, that unifies visible and invisible graph searching. In this variant, the fugitive is invisible, and the searchers can query an oracle that permanently knows the current position of the fugitive. The question of the monotonicity of non-deterministic graph searching was however left open. In this paper, we prove that non-deterministic graph searching is monotone. In particular, this result is a unified proof of monotonicity for visible and invisible graph searching. As a consequence, the decision problem corresponding to non-deterministic graph searching belongs to NP. Moreover, the exact algorithms designed by Fomin et al. do compute optimal non-deterministic search strategies.},
url = {http://dx.doi.org/10.1016/j.tcs.2008.02.036},
pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Grasta06.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@article{McRe08,
author = {C. McDiarmid and B. Reed},
title = {On the maximum degree of a random planar graph},
journal = {Combinatorics, Probability and Computing},
volume = {17},
year = {2008},
pages = {591-601},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@article{MeRe08,
author = {C. Meagher and B. Reed},
title = {Fractionally total colouring ${G}_{n,p}$},
journal = {Discrete Applied Mathematics},
volume = {156},
year = {2008},
pages = {1112-1124 },
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@article{Ree08,
author = {B. Reed},
title = {Skew Partitions in Perfect Graphs},
journal = {Discrete Applied Mathematics},
volume = {156},
year = {2008},
pages = {1150-1156},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@ARTICLE{SaZe08,
AUTHOR = {I. Sau and J. {\v Z}erovnik},
TITLE = {An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks},
JOURNAL = {Discrete Mathematics and Theoretical Computer Science},
YEAR = {2008},
volume = {10},
number = {3},
pages = {49-62},
abstract = {In the permutation routing problem, each processor is the origin of at most one packet and the destination of no more than one packet. The goal is to minimize the number of time steps required to route all packets to their respective destinations, under the constraint that each link can be crossed simultaneously by no more than one packet. We study this problem in a hexagonal network, i.e. a finite subgraph of a triangular grid, which is a widely used network in practical applications. We present an optimal distributed permutation routing algorithm for full-duplex hexagonal networks, using the addressing scheme described by F.G. Nocetti, I. Stojmenovi\'{c} and J. Zhang (IEEE TPDS 13(9): 962-971, 2002). Furthermore, we prove that this algorithm is oblivious and translation invariant.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/SZ08.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@inProceedings{AAST08,
author = {L. {Addario-Berry} and O. Amini and J.-S. Sereni and S. Thomass\'e},
title = {Guarding art galleries: the extra cost for sculptures is linear},
booktitle = {Proceedings of the Scandinavian Workshop on Algorithm Theory (SWAT 2008)},
year = {2008},
pages = {41-52},
series = {Lecture Notes in Computer Science},
volume = {5124},
publisher = {Springer},
month = jul,
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{APC+08,
author = {A. Aguiar and P.R. Pinheiro and A.L.V Coelho and N. Nepomuceno and A. Neto and R. Cunha},
title = {Scalability Analysis of a Novel Integer Programming Model to Deal with Energy Consumption in Heterogeneous Wireless Sensor Networks},
booktitle = {Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO'08)},
series = {Communications in Computer and Information Science},
volume = {14},
year = {2008},
pages = {11-20},
publisher = {Springer},
abstract = {This paper presents a scalability analysis over a novel integer programming model devoted to optimize power consumption efficiency in heterogeneous wireless sensor networks. This model is based upon a schedule of sensor allocation plans in multiple time intervals subject to coverage and connectivity constraints. By turning off a specific set of redundant sensors in each time interval, it is possible to reduce the total energy consumption in the network and, at the same time, avoid partitioning the whole network by losing some strategic sensors too prematurely. Since the network is heterogeneous, sensors can sense different phenomena from different demand points, with different sample rates. As the problem instances grows the time spent to the execution turns impracticable.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/APCNNC08.pdf},
url = {http://dx.doi.org/10.1007/978-3-540-87477-5_2},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {BR},
sorte = "conf-int",

}

@InProceedings{AGH08,
author = {O. Amini and S. Griffiths and F. Huc},
title = {4-cycles in mixing digraphs},
booktitle = {Electronic Notes in Discrete MathematicsVolume 30, The IV Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS 07)},
year = {2008},
address = {Puerto Varas, Chile},
month = feb,
pages={63--68},
volume = {30},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/AGH07.pdf},
abstract= {It is known that every simple graph with $n^{3/2}$ edges contains a 4-cycle. A similar statement for digraphs is not possible since no condition on the number of edges can guarantee an (oriented) 4-cycle. We find a condition which does guarantee the presence of a 4-cycle and our result is tight. Our condition, which we call $f$-mixing, can be seen as a quasirandomness condition on the orientation of the graph. We also investigate the notion of mixing in the case of regular and almost regular digraphs. In particular we determine how mixing a random orientation of a random graph is.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{APP+08a,
author = {O. Amini and D. Peleg and S. P\'erennes and I. Sau and S. {S}aurabh},
title = {Degree-Constrained Subgraph Problems : Hardness and Approximation Results},
booktitle = {6th International Workshop on Approximation and Online Algorithms (ALGO-WAOA 2008)},
year = {2008},
series = {Lecture Notes in Computer Science},
volume = {5426},
pages = {29-42},
month = sep,
address = {Karlsruhe, Germany},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/APP+08.pdf},
abstract = {A general instance of a \sc Degree-Constrained Subgraph problem consists of an edge-weighted or vertex-weighted graph $G$ and the objective is to find an optimal weighted subgraph, subject to certain degree constraints on the vertices of the subgraph. This class of combinatorial problems has been extensively studied due to its numerous applications in network design. If the input graph is bipartite, these problems are equivalent to classical transportation and assignment problems in operations research. This paper considers three natural \sc Degree-Constrained Subgraph problems and studies their behavior in terms of approximation algorithms. These problems take as input an undirected graph $G=(V,E)$, with $|V|=n$ and $|E|=m$. Our results, together with the definition of the three problems, are listed below. The Maximum Degree-Bounded Connected Subgraph (MDBCS$_d$) problem takes as input a weight function $\omega : E \rightarrow \mathbb R^+$ and an integer $d \geq 2$, and asks for a subset $E' \subseteq E$ such that the subgraph $G'=(V,E')$ is connected, has maximum degree at most $d$, and $\sum_e\in E' \omega(e)$ is maximized. This problem is one of the classical NP-hard problems listed by Garey and Johnson in (Computers and Intractability, W.H. Freeman, 1979), but there were no results in the literature except for $d=2$. We prove that MDBCS$_d$ is not in Apx for any $d\geq 2$ (this was known only for $d=2$) and we provide a $(\min m/ \log n,\ nd/(2 \log n))$-approximation algorithm for unweighted graphs, and a $(\min n/2,\ m/d)$-approximation algorithm for weighted graphs. We also prove that when $G$ accepts a low-degree spanning tree, in terms of $d$, then MDBCS$_d$ can be approximated within a small constant factor in unweighted graphs. The \sc Minimum Subgraph of Minimum Degree$_\geq d$ (MSMD$_d$) problem consists in finding a smallest subgraph of $G$ (in terms of number of vertices) with minimum degree at least $d$. We prove that MSMD$_d$ is not in Apx for any $d\geq 3$ and we provide an $\mathcal O(n/\log n)$-approximation algorithm for the classes of graphs excluding a fixed graph as a minor, using dynamic programming techniques and a known structural result on graph minors. In particular, this approximation algorithm applies to planar graphs and graphs of bounded genus. The \sc Dual Degree-Dense $k$-Subgraph (DDD$k$S) problem consists in finding a subgraph $H$ of $G$ such that $|V(H)| \leq k$ and $\delta_H$ is maximized, where $\delta_H$ is the minimum degree in $H$. We present a deterministic $\mathcal O(n^\delta)$-approximation algorithm in general graphs, for some universal constant $\delta < 1/3$.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@InProceedings{ASS08,
AUTHOR = {O. Amini and I. Sau and S. {S}aurabh},
TITLE = {{Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem}},
booktitle = {The International Workshop on Parameterized and Exact Computation (IWPEC 2008)},
YEAR = {2008},
pages = {13-29},
series = {Lecture Notes in Computer Science},
volume = {5008},
month= may,
address = {Victoria, Canada},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/ASS08.pdf},
abstract = {In this paper we study the problem of finding an induced subgraph of size at most $k$ with minimum degree at least $d$ for a given graph $G$, from the parameterized complexity perspective. We call this problem {\sc Minimum Subgraph of Minimum Degree $_{\geq d}$ ({\sc MSMD}$_d$)}. For $d=2$ it corresponds to finding a shortest cycle of the graph. Our main motivation to study this problem is its strong relation to \textsc{Dense $k$-Subgraph} and \textsc{Traffic Grooming} problems. First, we show that {\sc MSMS}$_d$ is fixed-parameter intractable (provided $FPT\neq W[1]$) for $d\geq 3$ in general graphs, by showing it to be $W[1]$-hard using a reduction from {\sc Multi-Color Clique}. In the second part of the paper we provide {\em explicit} fixed-parameter tractable (FPT) algorithms for the problem in graphs with bounded local tree-width and graphs with excluded minors, {\em faster} than those coming from the meta-theorem of Frick and Grohe [FrickG01] about problems definable in first order logic over ``locally tree-decomposable structures". In particular, this implies faster fixed-parameter tractable algorithms in planar graphs, graphs of bounded genus, and graphs with bounded maximum degree.}, OPTx-editorial-board={yes}, OPTx-proceedings={yes}, OPTx-international-audience={yes}, sorte = "conf-int", 
}

@InProceedings{AHL08a,
author={M. Ast\'e and F. Havet and C. {Linhares-Sales}},
booktitle={Proceedings of International Conference on Relations, Orders and Graphs and their Interaction with Computer Science (ROGICS 2008)},
month=may,
title={Grundy number and lexicographic product of graphs},
pages = {9p},
year={2008},
URL={http://www.rogics.com/},
abstract={The {\em Grundy number} of a graph $G$, denoted by $\Gamma (G)$, is the largest $k$ such that $G$ has a {\em greedy} $k$-colouring, that is a colouring with $k$ colours obtained by applying the greedy algorithm according to some ordering of the vertices of $G$. In this paper, we study the Grundy number of the lexicographic product of two graphs in terms of the Grundy numbers of these graphs. We show that $\Gamma(G)\times\Gamma(H)\leq \Gamma(G[H])\leq 2^{\Gamma(G)-1}(\Gamma(H)-1)+\Gamma(G)-1$. In addition, we show that if $G$ is a tree or $\Gamma(G)=\Delta(G)+1$, then $\Gamma(G[H])=\Gamma(G)\times\Gamma(H)$. We then deduce that for every fixed $c\leq 1$, given a graph $G$, it is CoNP-Complete to decide if $\Gamma(G)\leq c\times \chi(G)$ and it is CoNP-Complete to decide if $\Gamma(G)\leq c\times \omega(G)$.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/AHL08.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{BGR08,
author= { J-C. Bermond and L. Gargano and A.A. Rescigno },
title= {Gathering with minimum delay in tree sensor networks },
booktitle= { SIROCCO 2008 },
publisher= { Springer-Verlag },
series= {Lecture Notes in Computer Science},
address= {Villars-sur-Ollon, Switzerland },
volume= { 5058 },
pages = {262-276},
month=jun,
year= {2008},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BGR08.pdf},
abstract={Data gathering is a fundamental operation in wireless sensor networks in which data packets generated at sensor nodes are to be collected at a base station. In this paper we suppose that each sensor is equipped with an half--duplex interface; hence, a node cannot receive and transmit at the same time. Moreover, each node is equipped with omnidirectional antennas allowing the transmission over distance R. The network is a multi-hop wireless network and the time is slotted so that one--hop transmission of one data item consumes one time slot. We model the network with a graph where the vertices represent the nodes and two nodes are connected if they are in the transmission/interference range of each other. Due to interferences a collision happens at a node if two or more of its neighbors try to transmit at the same time. Furthermore we suppose that an intermediate node should forward a message as soon as it receives it. We give an optimal collision free gathering schedule for tree networks whenever each node has at least one data packet to send.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{BeYu08,
author= { J-C. Bermond and M-L. Yu },
title= {Optimal gathering algorithms in multi-hop radio tree networks with interferences },
booktitle= {Proceedings of the 7th international conference on Ad Hoc Networks and Wireless (AdHoc-Now) },
publisher= { Springer},
series= {Lecture Notes in Computer Science},
volume= { 5198 },
pages = {204-217},
year= {2008},
month=sep,
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BeYu08.pdf},
abstract={We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network, a message can only be properly received if there is no interference from another message being simultaneously transmitted. The network is modeled as a graph, where the vertices represent the nodes and the edges, the possible communications. The interference constraint is modeled by a fixed integer $d_I \geq 1$, which implies that nodes within distance $d_I$ in the graph from one sender cannot receive messages from another node. In this paper, we suppose that it takes one unit of time (slot) to transmit a unit-length message. A step (or round) consists of a set of non interfering (compatible) calls and uses one slot. We present optimal algorithms that give minimum number of steps (delay) for the gathering problem with buffering possibility, when the network is a tree, the root is the destination and $d_I =1$. In fact we study the equivalent personalized broadcasting problem instead.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@InProceedings{CHM08c,
author = {D. Coudert and F. Huc and D. Mazauric},
title = {A distributed algorithm for computing and updating the process number of a forest (brief announcement)},
booktitle = {22nd International Symposium on Distributed Computing (DISC)},
OPTcrossref = {},
OPTkey = {},
pages = {500-501},
year = {2008},
editor = {G. Taubenfeld},
volume = {5218},
OPTnumber = {},
series = {Lecture Notes in Computer Science},
address = {Arcachon, France},
month = sep,
OPTorganization = {},
publisher = {Springer},
OPTannote = {},
abstract = {In this paper, we present a distributed algorithm to compute various parameters of a tree such as the process number, the edge search number or the node search number and so the pathwidth. This algorithm requires n steps, an overall computation time of O(n log(n)), and n messages of size log_3(n)+3. We then propose a distributed algorithm to update the process number (or the node search number, or the edge search number) of each component of a forest after adding or deleting an edge. This second algorithm requires O(D) steps, an overall computation time of O(D log(n)), and O(D) messages of size log_3(n)+3, where D is the diameter of the modified connected component. Finally, we show how to extend our algorithms to trees and forests of unknown size using messages of less than 2a+4+e bits, where a is the parameter to be determined and e=1 for updates algorithms.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CHM-DISC08.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inProceedings{CHM08a,
author = {D. Coudert and F. Huc and D. Mazauric},
title = {Algorithme g\'en\'erique pour les jeux de capture dans les arbres},
booktitle = {10\`emes Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel'08)},
pages = {37--40},
year = {2008},
month = may,
address = {Saint-Malo},
abstract = {Nous pr\'esentons un algorithme distribu\'e simple calculant le process number des arbres en O(n.log(n)) \'etapes. De plus cet algorithme est facilement adaptable pour calculer d'autre param\`etres sur l'arbre, dont la pathwidth. Nous pr\'esentons \'egalement une condition n\'ecessaire et suffisante pour que la pathwidth d'un arbre soit \'egale \`a son process number.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CHM-AlgoTel08.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},
sorte = "conf-nat",

}

@InProceedings{CHM08d,
author = {D. Coudert and F. Huc and D. Mazauric},
title = {Computing and updating the process number in trees (short paper)},
booktitle = {12th International Conference On Principles Of DIstributed Systems (OPODIS)},
OPTcrossref = {},
OPTkey = {},
pages = {546-550},
year = {2008},
editor = {T. Baker and S. Tixeuil},
volume = {5401},
OPTnumber = {},
series = {Lecture Notes in Computer Science},
address = {Luxor, Egypt},
month = dec,
OPTorganization = {},
publisher = {Springer},
OPTnote = {},
OPTannote = {},
abstract = {The process number is the number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph theory point of view, it is similar to the node search number, and thus to the pathwidth. However they are not always equal in general graphs. Determining these parameters is in general NP-complete. In this paper, we characterize the cases in which the process number and the node search number are equal in trees. We also present a distributed algorithm to compute these parameters as well as the edge search number. This algorithm can be executed in an asynchronous environment, requires $n$ steps, an overall computation time of $O(n\log{n})$, and $n$ messages of size $\log_3{n}+2$. We then propose a distributed algorithm to update the process number (or the node search number, or the edge search number) of each component of a forest after addition or deletion of any edge. This second algorithm requires $O(D)$ steps, an overall computation time of $O(D\log{n})$, and $O(D)$ messages of size $\log_3{n}+3$, where $D$ is the diameter of the modified connected component. Finally, we show how to extend our algorithms to trees and forests of unknown size using messages of less than $2\alpha+5$ bits, where $\alpha\leq\log_3{n}$ is the parameter to be determined.},
url= {https://hal.inria.fr/inria-00288304},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/CHM08d.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{CHPV08,
author = {D. Coudert and F. Huc and F. Peix and M.-E. Voge},
title = {Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints},
booktitle = {IEEE ICC},
number = {ON01-6},
pages = {5170 - 5174},
year = {2008},
month = may,
address = {Beijing, China},
abstract = { The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Division Multiplexing Network (WDM), it expresses that some links and nodes may fail simultaneously. The reliability of a connection therefore depends on the number of SRRGs through which it is routed. Consequently, this number has to be minimized. This problem has been proved NP-complete and hard to approximate in general, even when routing a single request. Some heuristics using shortest paths have already been designed, however the cost (the usual routing cost, not in term of SRRG) was not part of the objective. In this paper we study the problem of minimizing a linear combination of the average number of SRRG per paths and the cost of the routing. The main result of our work is a column generation formulation that allows to solve efficiently the problem of maximizing the reliability of a set of connection requests in MPLS/WDM mesh networks with SRRGs while keeping the cost of the routing low. },
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CHPV07-inria-00175813.pdf},
url = {http://hal.inria.fr/inria-00175813/en/},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@INPROCEEDINGS{DZW08,
AUTHOR = { O. Dalle and B.P. Zeigler and G.A. Wainer },
TITLE = { Extending {DEVS} to support multiple occurrence in component-based simulation },
BOOKTITLE = { Proceedings of the 2008 Winter Simulation Conference },
OPTCROSSREF = { },
OPTKEY = { },
PAGES = {10p },
YEAR = { 2008 },
EDITOR = { S. J. Mason and R. R. Hill and L. Moench and O. Rose },
OPTVOLUME = { },
OPTNUMBER = { },
OPTSERIES = { },
OPTADDRESS = { },
MONTH = dec,
OPTORGANIZATION = { },
OPTPUBLISHER = { },
NOTE = { },
OPTANNOTE = { },
PDF = { ftp://ftp-sop.inria.fr/mascotte/Publications/DZW08.pdf },
ABSTRACT = { This paper presents a new extension of the DEVS formalism that allowsmultiple occurrences of a given instance of a DEV Scomponent?. This paper is a follow-up to a previous short paper in which the issue of supporting a new construction called ashared component was raised, in the case of a DEVS model. In thispaper, we first demonstrate, formally, that the multi-occurrence extended definition,that includes the case of shared components, is valid because anymodel that is built using this extended definition accepts an equivalent modelbuilt using standard DEVS. Then we recall the benefits of sharingcomponents for modeling, and further extend this analysis to the simulation area, byinvestigating how shared components can help to design bettersimulation engines. Finally, we describe an existing implementation ofa simulation software that fully supports this shared componentfeature, both at the modeling and simulation levels. },
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{GCI+08,
title = {The Cubicle vs. The Coffee Shop: Behavioral Modes in Enterprise End-Users},
author = {F. Giroire and J. {C}handrashekar and G. Iannaccone and D. Papagiannaki and E. Schooler and N. Taft},
booktitle = {Proceeding of the Passive and Active Monitoring conference (PAM08)},
series={Lecture Notes in Computer Science},
volume={4979},
year={2008},
publisher={Springer},
pages = {202-211},
pdf = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/GCI08.pdf},
abstract = {Traditionally, user traffic profiling is performed by analyzing traffic traces collected on behalf of the user at aggregation points located in the middle of the network. However, the modern enterprise network has a highly mobile population that frequently moves in and out of its physical perimeter. Thus an in-the-network monitor is unlikely to capture full user activity traces when users move outside the enterprise perimeter. The distinct environments, such as the cubicle and the coffee shop (among others), that users visit, may each pose different constraints and lead to varied behavioral modes. It is thus important to ask: is the profile of a user constructed in one environment representative of the same user in another environment? In this paper, we answer in the negative for the mobile population of an enterprise. Using real corporate traces collected at nearly 400 end-hosts for approximately 5 weeks, we study how end-host usage differs across three environments: inside the enterprise, outside the enterprise but using a VPN, and entirely outside the enterprise network. Within these environments, we examine three types of features: (i) environment lifetimes, (ii) relative usage statistics of network services, and (iii) outlier detection thresholds as used for anomaly detection. We find significant diversity in end-host behavior across environments for many features, thus indicating that profiles computed for a user in one environment yield inaccurate representations of the same user in a different environment.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@INPROCEEDINGS{GHR08,
author = {C. Gomes and G. Huiban and H. Rivano},
title = {A Branch-and-Price Approach to the Bandwidth Allocation Problem in Wireless Networks},
BOOKTITLE = {International Symposium on Combinatorial Optimization (CO)},
SCHOOL = {University of Warwick, Coventry, UK},
note = {Abstract},
MONTH = mar,
YEAR = {2008},
PAGES = {1p},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GHR08.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-sa",

}

@InProceedings{GMR08,
author = {C. Gomes and C. Molle and P. Reyes},
title = {Optimal Design of Wireless Mesh Networks},
booktitle = {9\`emes Journ\'ees Doctorales en Informatique et R\'eseaux (JDIR 2008)},
pages = {10p},
year = {2008},
month = jan,
address = {Villeneuve d'Ascq, France},
abstract = {Wireless Mesh Networks (WMNs) are cost-effective and provide an appealing answer to connectivity issues of ubiquitous computing. Unfortunately, wireless networks are known for strong waste of capacity when their size in- creases. Thus, a key challenge for network operators is to provide guaranteed quality of service. Maximizing network capacity requires to optimize jointly the gateways placement, the routing and the link scheduling taking interferences into account. We present MILP models for computing an optimal 802.11a or 802.16 WMN design providing max-min bandwidth guarantee.},
url = {http://www2.lifl.fr/JDIR2008/},
pdf={ftp://ftp-sop.inria.fr/mascotte/Publications/GMR08.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},
sorte = "conf-nat",

}

@InProceedings{GPRR08,
author = {C. Gomes and S. P\'erennes and P. Reyes and H. Rivano},
title = {Bandwidth Allocation in Radio Grid Networks},
booktitle = {10\`emes Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel'08)},
year = {2008},
pages = {4p},
month = may,
url = {http://algotel2008.irisa.fr/index.php},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/GPRR08.pdf},
abstract = {In this paper we give exact or almost exact bounds for the continuous gathering problem on grids. Under very general hypothesis on the traffic demand, we mainly prove that the throughput is determined by the bottleneck around the base station. We deal with two cases: the base station located in the center and in the corner. We use dual lower bounds and describe a protocol which is optimal when the traffic is uniform.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},
sorte = "conf-nat",

}

@INPROCEEDINGS{GPR08b,
author ={C. Gomes and S. P\'erennes and H. Rivano},
title = {Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks},
booktitle ={4th IEEE Workshop on Broadband Wireless Access (BWA)},
month = dec,
pages = {6p},
year ={2008},
address = {New-Orleans, US},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/GPR08b.pdf},
abstract = {In this paper, we address the routing and call scheduling problem in which one has to find a minimum-length schedule of selected links in a TDMA (Time Division Multiple Access) based wireless network. As we deal with multi-hop networks, these selected links represent a routing solution (paths) providing enough capacity to achieve the routers requirements of bandwidth. We present a cross-layer formulation of the problem that computes joint routing and scheduling. We use a branch-and-price algorithm to solve optimally the problem. A column generation algorithm is used to cope with the exponential set of rounds. The branch-and-bound algorithm provides mono-routing. We run experiments on networks from the literature, with different number of gateways. Experimental results as well as theoretical insights let us conjecture that the bottleneck region analysis is enough to find the optimal solution. The Integer Round-Up Property (IRUP) seems to hold for our problem.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@InProceedings{HRS08a,
author={F. Havet and B. Reed and J.-S. Sereni},
booktitle={Proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA 2008)},
month=jan,
title={L(2,1)-labelling of graphs},
pages = {621-630},
year={2008},
URL={http://www.siam.org/meetings/da08/},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/HRS08.pdf},
abstract={An $L(2,1)$-labelling of a graph is a function $f$ from the vertex set to the positive integers such that $|f(x)-f(y)|\geq 2$ if $\dist(x,y)=1$ and $|f(x)-f(y)|\geq 1$ if $\dist(x,y)=2$, where $\dist(u,v)$ is the distance between the two vertices~$u$ and~$v$ in the graph $G$. The \emph{span} of an $L(2,1)$-labelling $f$ is the difference between the largest and the smallest labels used by $f$ plus $1$. In 1992, Griggs and Yeh conjectured that every graph with maximum degree $\Delta\geq 2$ has an $L(2,1)$-labelling with span at most $\D2+1$. We settle this conjecture for $\D$ sufficiently large.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@INPROCEEDINGS{HDBG08,
OPTauthor = {L. Hogie and Gr{\'e}goire Danoy and Pascal Bouvry and and Fr{\'e}d{\'e}ric Guinand},
author = {L. Hogie and G. Danoy and P. Bouvry and F. Guinand},
title = {A Context-Aware Broadcast Protocol for {DTN}s},
booktitle = {Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO'08)},
volume = {14},
series = {Communications in Computer and Information Science},
publisher = {Springer},
pages = {507-519},
year = {2008},
month = sep,
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/HDBG08.pdf},
abstract = {Delay Tolerant Networks (DTNs) are a sub-class of mobile ad hoc networks (MANETs). They are mobile wireless networks that feature inherent connection disruption. In particular such net- works are generally non-connected. In this paper we focus on defining a broadcast service which operate on DTNs. A number of protocols solving the problem of broadcasting across DTNs have been proposed in the past, but all of them exhibit a static behavior, i.e. they provide no control parameter. However, at the application level, flexible broadcasting schemes are desirable. In particular, it is important that the user (the source of the broadcast message) can control the way the message gets spread across the network. This paper introduces a new broadcasting protocol dedicated to DTNs, called Context-Aware Broadcasting Protocol (CABP), which adapts its greediness according to the "urgency" (priority) of the broadcast message. A formal presentation of its strategy is proposed and through preliminary experi- ments, the cost-effectiveness of CABP is enlightened.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@InProceedings{HKMN08,
author = {C.-C. Huang and T. Kavitha and D. Michail and M. Nasre},
title = {Bounded Unpopularity Matchings},
booktitle = {11th Scandinavian Workshop on Algorithm Theory (SWAT).},
pages = {127-137},
volume = {5124},
series = {Lecture Notes in Computer Science},
month = jul,
year = {2008},
optpdf = {},
opturl = {},
abstract = {We investigate the following problem: given a set of jobs and a set of people with preferences over the jobs, what is the optimal way of matching people to jobs? Here we consider the notion of popularity. A matching M is popular if there is no matching M' such that more people prefer M' to M than the other way around. Determining whether a given instance admits a popular matching and, if so, finding one, was studied in Abraham et al. . If there is no popular matching, a reasonable substitute is a matching whose unpopularity is bounded. We consider two measures of unpopularity - unpopularity factor denoted by u(M) and unpopularity margin denoted by g(M). McCutchen recently showed that computing a matching M with the minimum value of u(M) or g(M) is NP-hard, and that if G does not admit a popular matching, then we have Your browser may not support display of this image. for all matchings M in G. Here we show that a matching M that achieves u(M) = 2 can be computed in Your browser may not support display of this image.time (where m is the number of edges in G and n is the number of nodes) provided a certain graph H admits a matching that matches all people. We also describe a sequence of graphs: H = H2, H3,...,Hk such that if Hk admits a matching that matches all people, then we can compute in Your browser may not support display of this image.time a matching M such that Your browser may not support display of this image.and Your browser may not support display of this image.. Simulation results suggest that our algorithm finds a matching with low unpopularity. },
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@InProceedings{HLR08,
author = {F. Huc and C. {Linhares-Sales} and H. Rivano},
title = {The Proportional Colouring Problem: Optimizing Buffers in Radio Mesh Networks},
OPTcrossref = {},
OPTkey = {},
booktitle = {IV Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS 07)},
pages = {141--146},
year = {2008},
OPTeditor = {},
volume = {30},
OPTnumber = {},
series = {Electronic Notes in Discrete Mathematics},
address = {Puerto Varas, Chile},
month = feb,
OPTorganization = {},
publisher = {Elsevier},
OPTnote = {},
OPTannote = {},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/HLR07.pdf},
abstract= {In this paper, we consider a new edge colouring problem: the proportional edge-colouring. Given a graph $G$ with positive weights associated to its edges, we want to find a colouring which preserves the proportion given by the weights associated to each edge. If such colouring exists, we want to find one using a minimum number of colours. We proved that deciding if a weighted graph admits a proportional colouring is polynomial while determining its proportional chromatic index is NP-hard. In addition, we give a lower bound and an upper bound for this parameter that can be computed in polynomial time. We finally show a class of graphs and a class of weighted graphs for which we can exactly determine the proportional chromatic index.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@InProceedings{INS08,
author = {D. Ilcinkas and N. Nisse and D. Soguet},
title = {Le cout de la monotonie dans les strat\'egies d'encerclement r\'eparti},
booktitle = {10\`emes Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel'08)},
year = {2008},
pages = {4p},
url = {http://algotel2008.irisa.fr/index.php},
pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Algotel08.pdf},
abstract = {L'encerclement dans les r\'eseaux vise \`a r\'ealiser le nettoyage, par une \'equipe d'agents mobiles, d'un r\'eseau contamin\'e. La strat\'egie d'encerclement est calcul\'ee en temps r\'eel, par les agents eux mêmes, et doit v\'erifier les trois propri\'et\'es suivantes: (1)~{\it connexit\'e} : la zone nettoy\'ee doit toujours être connexe de fa\c{c}on \`a assurer des communications s\'ecuris\'ees entre les agents, (2)~{\it monotonie} : la zone nettoy\'ee ne doit jamais être recontamin\'ee, ce qui permet un temps de nettoyage polynomial en la taille du r\'eseau, et (3)~{\it optimalit\'e} : le nombre d'agents utilis\'es doit être le plus petit possible afin de minimiser la taille des ressources utilis\'ees. Etant donn\'e un graphe $G$, le plus petit nombre d'agents n\'ecessaire pour nettoyer $G$ de façon monotone connexe dans un contexte centralis\'e est not\'e $\mcs(G)$. Plusieurs protocoles r\'epartis ont \'et\'e propos\'e pour r\'esoudre le probl\`eme de l'encerclement dans les r\'eseaux. Blin {\it et al.} ont propos\'e un algorithme distribu\'e permettant \`a $\mcs(G)$ agents de d\'eterminer et de r\'ealiser une strat\'egie d'encerclement dans tout graphe inconnu $G$ (inconnu signifie que les agents n'ont aucune connaissance {\it a priori} concernant le graphe) [AlgoTel'06]. Cependant, la strat\'egie r\'ealis\'ee n'est pas monotone et peut prendre un temps exponentiel. Nisse et Soguet ont prouv\'e que, pour r\'esoudre le probl\`eme de l'encerclement dans les r\'eseaux, il est n\'ecessaire et suffisant de fournir $\Theta(n \log n)$ bits d'information aux agents par le biais d'un \'etiquetage des sommets du graphe [AlgoTel'07]. Ainsi, pour nettoyer un graphe inconnu de fa\c{c}on monotone et connexe, il est necessaire d'utiliser plus d'agents que l'optimal. Dans cet article, nous \'etudions la proportion d'agents suppl\'ementaires qui sont n\'ecessaires et suffisants pour nettoyer de façon monotone connexe r\'eparti tout graphe inconnu. Nous montrons que la contrainte de monotonie implique une augmentation drastique de ce nombre d'agents. Nous prouvons que tout protocole distribu\'e ayant pour but de nettoyer tout graphe inconnu de $n$ sommets de façon monotone connexe r\'eparti a un ratio comp\'etitif de $\Theta(\frac{n}{\log n})$. Plus pr\'ecis\'ement, nous prouvons que pour tout protocole distribu\'e $\cal P$, il existe une constante $c$ tel que pour tout $n$ suffisamment grand, il existe un graphe $G$ de $n$ sommets tel que $\cal P$ requiert au moins $c\frac{n}{\log n}\, \mcs(G)$ agents pour nettoyer $G$. De plus, nous proposons un protocole distribu\'e qui permet \`a $O(\frac{n}{\log n})\, \mcs(G)$ agents de nettoyer tout graphe inconnu $G$ de $n$ sommets, de façon monotone connexe r\'eparti.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},
sorte = "conf-nat",

}

@inproceedings{KaRe08b,
author = {K. Kawarabayashi and B. Reed},
title = {A nearly linear time algorithm for the half integral disjoint paths packing},
booktitle = {Proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA 2008)},
year = {2008},
pages = {446-454},
abstract ={We consider the following problem, which is called the half integral k disjoint paths packing. Input: A graph G, k pair of vertices (s1, t1), (s2, t2),\cdots, (sk, tk) in G (which are sometimes called terminals). Output: Paths P1, \cdots, Pk in G such that Pi joins si and ti for i = 1,2,\cdots, k, and in addition, each vertex is on at most two of these paths. We present an O(n log n) time algorithm for this problem for fixed k. This improves a result by Kleinberg who gave an O(n3) algorithm for this problem. In fact, we also have algorithms running in O(n(1+\varepsilon)) time for any \varepsilon > 0 for these problems, if k is up to o((log log n)2/5) for general graphs, up to o((log n/(log log n))1/4) for planar graphs, and up to o((log n/g/(log log n/g))1/4) for graphs on the surface, where g is the Euler genus. Furthermore, if k is fixed, then we have linear time algorithms for the planar case and for the bounded genus case. We also obtain O(n log n) algorithms for several optimization problems related to the bounded unsplittable flow problem when the number of terminal pairs is bounded. These results can all carry over to problems involving edge capacities.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/KaRe08b.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{LiRe08,
author = {Z. Li and B. Reed},
title = {Optimization and Recognition for ${K}_5$-minor Free Graphs in Linear Time},
booktitle = {Proceedings of LATIN},
year = {2008},
pages = {206-215},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inProceedings{MPPR08b,
author = {C. Molle and F. Peix and S. P\'erennes and H. Rivano},
title = {Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Information},
booktitle = {the fourth Symposium on Trustworthy Global Computing (TGC 2008)},
year = {2008},
month = nov,
pages = {171-185},
editor = {C. Kaklamanis and F. Nielson},
volume = {5474},
series = {Lecture Notes in Computer Science},
address = {Barcelona, Spain},
url = {http://albcom.lsi.upc.edu/tgc2008/},
abstract = {Wireless mesh network performance issues have been modeled by the Joint Routing and Scheduling Problem (JRSP) in which a maximum per-flow throughput is computed. A classical relaxation of JRSP, denoted as the Round Weighting Problem (RWP), consists in assigning enough weight to sets of compatible simultaneous transmissions (rounds), while minimizing the sum of them, thus maximizing the relative weight of each round, which model the throughput. In this work, we present a new linear formulation of RWP focused on the transport capacity over the network cuts, thus eliminating the routing. We prove its equivalence with existing formulations with flows and formalize a primal-dual algorithm that quickly solves this problem using a cross line and column generations process. An asset of this formulation is to point out a bounded region, a "bottleneck" of the network, that is enough to optimize in order to get the optimal RWP of the whole network. The size and location of this area is experimentally made through simulations, highlighting a few hop distant neighborhood of the mesh gateways. One would then apply approximated methods outside this zone to route the traffic without degrading the achieved capacity.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/MPPR08b.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@InProceedings{MPPR08a,
author = {C. Molle and F. Peix and S. P\'erennes and H. Rivano},
title = {Formulation en Coupe/Rounds pour le Routage dans les r\'eseaux radio maill\'es},
booktitle = {10\`emes Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel'08)},
year = {2008},
pages = {4p},
month = may,
url = {http://algotel2008.irisa.fr/index.php},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/MPPR08.pdf},
abstract = {Un des probl\`emes au c\oe ur de l'optimisation des r\'eseaux radio maill\'es est le routage et l'ordonnancement d'appels. Dans cet article, nous \'etudions une relaxation classique de ce probl\`eme qui consiste \`a r\'epartir la capacit\'e entre les ensembles d'appels simultan\'es de mani\`ere \`a garantir un d\'ebit suffisant \`a chaque routeur du r\'eseau. Nous introduisons une nouvelle formulation s'affranchissant du routage pour se concentrer sur la capacit\'e de transport disponible sur les coupes du r\'eseau. Nous prouvons son \'equivalence avec les formulations existantes et pr\'esentons un processus efficace de r\'esolution par g\'en\'eration crois\'ee de lignes et de colonnes.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},
sorte = "conf-nat",

}

@INPROCEEDINGS{MPR08b,
author = {C. Molle and F. Peix and H. Rivano},
TITLE = {An optimization framework for the joint routing and scheduling in wireless mesh networks},
BOOKTITLE = { Proc. 19th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC'08) },
MONTH = sep,
YEAR = { 2008 },
ADDRESS = { Cannes, France },
URL = { http://www.pimrc2008.org },
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/MPR08b.pdf},
abstract = {In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a major impact on the capacity provided to the clients. A cross- layer optimization of these problems allows the routing to take into account contentions due to radio interferences. We develop exact linear programs and provide an efficient column generation process computing a relaxation of the problem. It allows to work around the combinatoric of simultaneously achievable transmissions, hence computing solutions on large networks. Our approach is validated through extensive simulations. Evolution of the capacity of a mesh network with its parameters, as well as the algorithmic complexity are then discussed. We conjecture that the problem can be solved in polynomial time and that the gateway placement problem is only subject to localized constraints.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@InProceedings{MPR08a,
author = {C. Molle and F. Peix and H. Rivano},
title = {G\'en\'eration de colonnes pour le routage et l'ordonnancement dans les r\'eseaux radio maill\'es},
booktitle = {Colloque francophone sur l'ing\'enierie des protocoles ({CFIP} 2008)},
pages = {12p},
month = mar,
year = {2008},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/MPR08.pdf},
url = {http://cfip2008.imag.fr/wp/},
note = {Best student paper award},
abstract = {Dans cet article, nous \'etudions la capacit\'e des r\'eseaux radio maill\'es d\'edi\'es � l'acc\`es � Internet. Nous nous pla\c ons dans l'hypoth\`ese d'un r\'eseau synchrone fonctionnant en r\'egime permanent o\`u les transmissions partagent un m\^eme canal radio. Le routage et l'ordonnancement des transmissions ont un impact majeur sur la capacit\'e fournie aux clients. Une optimisation jointe de ces deux probl\`emes permet de prendre en compte dans le routage les contentions dues aux interf\'erences radio. Nous en d\'eveloppons des formulations exactes en programmation lin\'eaire. Nous pr\'esentons ensuite un processus de g\'en\'eration de colonnes r\'esolvant une relaxation du probl\`eme. Ainsi, nous contournons l'\'ecueil de la combinatoire des transmissions r\'ealisables simultan\'ement pour permettre de calculer des solutions sur des r\'eseaux de grande taille. Des simulations sont effectu\'ees sur des topologies al\'eatoires. L'\'evolution de la capacit\'e d'un r\'eseau maill\'e avec ses param\`etres, ainsi que la complexit\'e algorithmique du probl\`eme sont discut\'ees.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},
sorte = "conf-nat",

}

@InProceedings{MoVo08,
author = {C. Molle and M.-E. Voge},
title = {Influence des acquittements sur la capacit\'e des r\'eseaux radio maill\'es},
booktitle = {10\`emes Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel'08)},
year = {2008},
pages = {4p},
month = may,
url = {http://algotel2008.irisa.fr/index.php},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/MoVo08.pdf},
abstract = {A la veille du d\'eploiement de l'informatique ubiquitaire, la performance des r\'eseaux radio est un enjeu \'economique majeur. Parmi les indicateurs de performance, la {\it capacit\'e}, ou volume maximal de trafic que peut \'ecouler le r\'eseau en un temps fix\'e, est essentielle. Dans cet article nous \'evaluons le gain en capacit\'e induit par la suppression des acquittements au niveau MAC en r\'esolvant un mod\`ele lin\'eaire par g\'en\'eration de colonnes.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},
sorte = "conf-nat",

}

@inproceedings{Mon08,
Author = {J. Monteiro},
title = {The use of Evolving Graph Combinatorial Model in Routing Protocols for Dynamic Networks},
booktitle = {Proceedings of the XV Concurso Latinoamericano de Tesis de Maestr\'ia ({CLEI}'08)},
month = sep,
year = {2008},
pages = {41--57},
address = {Santa Fe, Argentina},
note = {Third prize in the CLEI'08 Master's Thesis Contests},
abstract = { The assessment of routing protocols for ad hoc networks is a difficult task, due to the networks’ highly dynamic behavior and the absence of benchmarks. Recently, a graph theoretic model – the evolving graphs – was proposed to help capture the network topology changes during time, with predictable dynamics at least. The algorithms and insights obtained through this model are theoretically very effcient and intriguing. However, there is no study about the use of such theoretical results into practical situations. We used the NS2 network simulator to first implement an evolving graph based routing protocol, and then used it as a benchmark when comparing four ma jor ad-hoc routing pro- tocols. Interestingly, our experiments showed that evolving graphs have the potential to be an effective and powerful tool. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/Mon08.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@INPROCEEDINGS{MuSa08b,
title = {Traffic Grooming in Unidirectional {WDM} Rings with Bounded-Degree Request Graph},
author = {X. Mu{\~n}oz and I. Sau},
booktitle = {34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008)},
year = {2008},
series = {Lecture Notes in Computer Science},
volume = {5344},
pages = {300-311},
month = jun,
location = {Durham University, U.K.},
abstract = {Traffic grooming is a major issue in optical networks. It refers to grouping low rate signals into higher speed streams, in order to reduce the equipment cost. In SONET WDM networks, this cost is mostly given by the number of electronic terminations, namely ADMs. We consider the case when the topology is a unidirectional ring. In graph-theoretical terms, the traffic grooming problem in this case consists in partitioning the edges of a request graph into subgraphs with a maximum number of edges, while minimizing the total number of vertices of the decomposition. We consider the case when the request graph has bounded maximum degree $\Delta$, and our aim is to design a network being able to support any request graph satisfying the degree constraints. The existing theoretical models in the literature are much more rigid, and do not allow such adaptability. We formalize the problem, and solve the cases $\Delta=2$ (for all values of $C$) and $\Delta = 3$ (except the case $C=4$). We also provide lower and upper bounds for the general case.},
pdf = {http://www-sop.inria.fr/members/Ignasi.Sauvalls/Pubs/MuSa08.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{NiSu08a,
author = {N. Nisse and K. Suchan},
title = {Fast Robber in Planar Graphs},
booktitle = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG)},
year = {2008},
pages = {33-44},
series = {Lecture Notes in Computer Science},
volume = {5344},
abstract = {In the {\it cops and robber game}, two players play alternately by moving their tokens along the edges of a graph. The first one plays with the {\it cops} and the second one with one {\it robber}. The cops aim at capturing the robber, while the robber tries to infinitely evade the cops. The main problem consists in minimizing the number of cops used to capture the robber in a graph. This minimum number is called the {\it cop-number} of the graph. If the cops and the robber have the same velocity, $3+\frac{3}{2}g$ cops are sufficient to capture one robber in any graph with genus $g$ (Schr\"oder, 2001). In the particular case of a grid, $2$ cops are sufficient. We investigate the game in which the robber is slightly faster than the cops. In this setting, we prove that the cop-number of planar graphs becomes unbounded. More precisely, we prove that $\Omega(\sqrt{\log n})$ cops are necessary to capture a fast robber in the $n \times n$ square-grid. This proof consists in designing an elegant evasion-strategy for the robber. Then, it is interesting to ask whether a high value of the cop-number of a planar graph $H$ is related to a large grid $G$ somehow contained in $H$. We prove that it is not the case when the notion of containment is related to the classical transformations of edge removal, vertex removal, and edge contraction. For instance, we prove that there are graphs with cop-number at most $2$ and that are subdivisions of arbitrary large grid. On the positive side, we prove that, if $H$ planar contains a large grid as an induced subgraph, then $H$ has large cop-number. Note that, generally, the cop-number of a graph $H$ is not closed by taking induced subgraphs $G$, even if $H$ is planar and $G$ is an distance-hereditary induced-subgraph.},
url = {http://www.dur.ac.uk/wg.2008/},
pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/wg08.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@InProceedings{NiSu08b,
author = {N. Nisse and K. Suchan},
title = {Voleur v\'eloce dans un r\'eseau planaire},
booktitle = {10\`emes Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel'08)},
year = {2008},
pages = {4p},
url = {http://algotel2008.irisa.fr/index.php},
pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Algotel08a.pdf},
abstract = {D\'efini par Nowakowski et Winkler et, ind\'ependament, par Quilliot (1983), le jeu des gendarmes et du voleur impliquent deux joueurs qui jouent \`a tour de r\^ole dans un graphe. Le premier d\'eplace les gendarmes le long des ar\^etes du graphe, puis c'est au tour du second qui d\'eplace le voleur. Le but des gendarmes est d'attraper le voleur, tandis que ce dernier essaie d'\'eviter la capture ind\'efiniment. Le probl\`eme dans ce contexte est de minimiser le nombre de gendarmes n\'ecessaires pour capturer le voleur. Ce nombre s'appelle {\it l'indice d'\'evasion} du graphe ({\it cop-number} en anglais). Si les gendarmes et le voleur ont la m\^eme vitesse, Schr\"oder (2001) a prouv\'e que $3+\frac{3}{2}g$ gendarmes suffisent \`a capturer tout voleur dans un graphe de {\it genre} born\'e $g$. En particulier, cela signifie que la capture d'un voleur dans un graphe {\it planaire} est facile puisque $3$ gendarmes suffisent (en fait deux gendarmes sont suffisants dans toute grille). Dans ce travail, nous aidons le voleur en lui permettant de ce d\'eplacer plus vite que les gendarmes. Nous montrons que cela conduit \`a une augmentation drastique du nombre de gendarmes. Plus pr\'ecisement, nous prouvons que $\Omega(\sqrt{\log n})$ gendarmes sont n\'ecessaires pour capturer un voleur v\'eloce dans une grille carr\'ee de c\^ot\'e $n$. La preuve que nous proposons consiste en une \'el\'egante et simple strat\'egie d'\'evasion pour le voleur. Il est alors int\'eressant de savoir si le fait qu'un graphe planaire $H$ ait un indice d'\'evasion \'elev\'e est li\'e au fait que $H$ ``contient'' une large grille $G$. Nous montrons que ce n'est pas la cas lorsque la notion de contenance correspond \`a la notion de minoration topologique (c'est \`a dire si $G$ peut \^etre obtenu de $H$ en rempla\c{c}ant des chemins dont les sommets internes sont de degr\'e deux, par des ar\^etes). Cependant, nous prouvons que si $H$ planaire contient une large grille comme sous-graphe induit, alors son indice d'\'evasion est \'elev\'e. Notons que ce dernier r\'esultat n'est pas vrai dans le cas d'un graphe $H$ non planaire.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},
sorte = "conf-nat",

}

@INPROCEEDINGS{RiDa08,
AUTHOR = { J. Ribault and O. Dalle},
TITLE = { Enabling advanced simulation scenarios with new software engineering techniques },
BOOKTITLE = { 20th European Modeling and Simulation Symposium (EMSS 2008) },
OPTCROSSREF = { },
OPTKEY = { },
PAGES = {6p},
YEAR = { 2008 },
OPTEDITOR = { },
OPTVOLUME = { },
OPTNUMBER = { },
OPTSERIES = { },
ADDRESS = { Briatico, Italy },
OPTMONTH = { },
OPTORGANIZATION = { },
OPTPUBLISHER = { },
OPTANNOTE = { },
PDF = { ftp://ftp-sop.inria.fr/mascotte/Publications/RiDa08.pdf },
ABSTRACT = { In this paper, we introduce new techniques in the field of simulationto help in the process of building advanced simulation scenarios usingpreexisting simulation components. The first technique consists in using the Aspect Oriented Programming? paradigm to capture some of the private data of anexisting model component. The second one is an Architecture Description Language (ADL) designed for the Fractal component model, that offers definition overloading and extension mechanisms similar to those found in traditional Object Oriented languages.The benefits of using both techniques are illustrated by simple usecases of network security studies. },
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@TechReport{ANB08,
author = {E. Altman and P. Nain and J-C. Bermond},
title = {Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks},
institution = {INRIA},
type = {Research Report},
number = {RR-6645},
year = {2008},
month = sep,
url = {http://hal.inria.fr/inria-00321641/fr/},
pdf = {http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/32/16/41/PDF/RR-6645.pdf&docid=321641},
abstract = {This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes forms a delay tolerant (ad hoc) network (DTN). The goal of the paper is to study efficient ways for distributing evolving files within DTNs and for managing dynamically their content. We specify to dynamic files where not only the latest version is useful but also previous ones; we restrict however to files where a file has no use if another more recent version is available. There are N+1 mobile nodes including a single source which at some points in time makes available a new version of a single file F. We consider both the cases when (a) nodes do not cooperate and (b) nodes cooperate. In case (a) only the source may transmit a copy of the latest version of F to a node that it meets, while in case (b) any node may transmit a copy of F to a node that it meets. A file management policy is a set of rules specifying when a node may send a copy of F to a node that it meets. The objective is to find file management policies which maximize some system utility functions under a constraint on the resource consumption. Both myopic (static) and state-dependent (dynamic) policies are considered, where the state of a node is the age of the copy of F it carries. Scenario (a) is studied under the assumption that the source updates F at discrete times t=0,1,\ldots. During a slot [t,t+1) the source meets any node with a fixed probability q. We find the optimal static (resp. dynamic) policy which maximizes a general utility function under a constraint on the number of transmissions within a slot. In particular, we show the existence of a threshold dynamic policy. In scenario (b) F is updated at random points in time, with the consequence that between two meetings with the source a node does not know the age evolution of the version of F it holds. Under Markovian assumptions regarding nodes mobility and update frequency of F, we study the stability of the system (aging of the nodes) and derive an (approximate) optimal static policy. We then revisit scenario (a) when the source does not know parameter N (node population) and q (node meeting probability) and derive a stochastic approximation algorithm which we show to converge to the optimal static policy found in the complete information setting. Numerical results illustrate the respective performance of optimal static and dynamic policies as well as the benefit of node cooperation.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{AHSZ08,
author = {O. Amini and F. Huc and I. Sau and J. Zerovnik},
title = {$(\ell,k)$-Routing on Plane Grids},
year = {2008},
month = mar,
institution = {INRIA},
number = {6480},
type = {Research Report},
url= {https://hal.inria.fr/inria-00265297},
pdf = {https://hal.inria.fr/docs/00/26/52/97/PDF/RR_AHSZ08_JOIN.pdf},
abstract = {The packet routing problem plays an essential role in communication networks. It involves how to transfer data from some origins to some destinations within a reasonable amount of time. In the $(\ell,k)$-routing problem, each node can send at most $\ell$ packets and receive at most $k$ packets. Permutation routing is the particular case $\ell=k=1$. In the $r$-central routing problem, all nodes at distance at most $r$ from a fixed node $v$ want to send a packet to $v$. In this article we study the permutation routing, the $r$-central routing and the general $(\ell,k)$-routing problems on plane grids, that is square grids, triangular grids and hexagonal grids. We use the \emph{store-and-forward} $\Delta$-port model, and we consider both full and half-duplex networks. The main contributions are the following: \begin{itemize} \item[1.] Tight permutation routing algorithms on full-duplex hexagonal grids, and half duplex triangular and hexagonal grids. \item[2.] Tight $r$-central routing algorithms on triangular and hexagonal grids. \item[3.] Tight $(k,k)$-routing algorithms on square, triangular and hexagonal grids. \item[4.] Good approximation algorithms (in terms of running time) for $(\ell,k)$-routing on square, triangular and hexagonal grids, together with new lower bounds on the running time of any algorithm using shortest path routing. \end{itemize} \noindent All these algorithms are completely distributed, i.e. can be implemented independently at each node. Finally, we also formulate the $(\ell,k)$-routing problem as a \textsc{Weighted Edge Coloring} problem on bipartite graphs.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{APP+08b,
author = {O. Amini and D. Peleg and S. P\'erennes and I. Sau and S. {S}aurabh},
title = {{Degree-Constrained Subgraph Problems: Hardness and Approximation Results}},
year = {2008},
month = oct,
institution = {INRIA},
number = {RR-6690},
type = {Research Report},
url= {http://hal.inria.fr/inria-00331747},
pdf = {http://www-sop.inria.fr/members/Ignasi.Sauvalls/Pubs/RR_APP+08.pdf},
abstract = {A general instance of a Degree-Constrained Subgraph problem consists of an edge-weighted or vertex-weighted graph G and the objective is to find an optimal weighted subgraph, subject to certain degree constraints on the vertices of the subgraph. This paper considers three natural Degree-Constrained Subgraph problems and studies their behavior in terms of approximation algorithms. These problems take as input an undirected graph G=(V,E), with |V|=n and |E|=m. Our results, together with the definition of the three problems, are listed below. 1- The Maximum Degree-Bounded Connected Subgraph (MDBCS_d) problem takes as input a weight function w: E -> R+ and an integer d>1, and asks for a subset of edges E' such that the subgraph G'=(V,E') is connected, has maximum degree at most d, and the total edge-weight is maximized. We prove that MDBCS_d is not in APX for any d>1 (this was known only for d=2) and we provide a min{m/log n, nd/2log n}-approximation algorithm for unweighted graphs, and a min{n/2,m/d}-approximation algorithm for weighted graphs. 2- The Minimum Subgraph of Minimum Degree d (MSMD_d) problem consists in finding a smallest subgraph of G (in terms of number of vertices) with minimum degree at least d. For d=2 it corresponds to finding a shortest cycle of the graph. We prove that MSMD_d is not in APX for any d>2 and we provide an n/logn-approximation algorithm for the classes of graphs excluding a fixed graph as a minor, using dynamic programming techniques and a known structural result on graph minors. 3- The Dual Degree-Dense k-Subgraph (DDDkS) problem consists in finding a subgraph H of G such that |V(H)|<k+1 and delta(H) is maximized, where delta(H) is the minimum degree in H. We present a deterministic n^delta-approximation algorithm in general graphs, for some universal constant delta < 1/3, and a randomized (sqrtn log n)-approximation algorithm for general graphs.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{AHL08b,
author = {M. Ast\'e and F. Havet and C. Linhares-Sales},
title = {Grundy number and products of graphs},
year = {2008},
month = oct,
institution = {INRIA},
number = {RR-6672},
type = {Research Report},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/AHL08b.pdf},
abstract = {The {\em Grundy number} of a graph $G$, denoted by $\Gamma (G)$, is the largest $k$ such that $G$ has a {\em greedy} $k$-colouring, that is a colouring with $k$ colours obtained by applying the greedy algorithm according to some ordering of the vertices of $G$. In this paper, we study the Grundy number of the lexicographic, cartesian and direct products of two graphs in terms of the Grundy numbers of these graphs. Regarding the lexicographic product, we show that $\Gamma(G)\times\Gamma(H)\leq \Gamma(G[H])\leq 2^{\Gamma(G)-1}(\Gamma(H)-1)+\Gamma(G)-1$. In addition, we show that if $G$ is a tree or $\Gamma(G)=\Delta(G)+1$, then $\Gamma(G[H])=\Gamma(G)\times\Gamma(H)$. We then deduce that for every fixed $c\leq 1$, given a graph $G$, it is CoNP-Complete to decide if $\Gamma(G)\leq c\times \chi(G)$ and it is CoNP-Complete to decide if $\Gamma(G)\leq c\times \omega(G)$. Regarding the cartesian product, we show that there is no upper bound of $\Gamma(G\square H)$ as a function of $\Gamma(G)$ and $\Gamma(H)$. Nevertheless, we prove that for any fixed graph $G$, there is a function $h_G$ such that, for any graph $H$, $\Gamma(G\square H)\leq h_G(\Gamma(H))$. Regarding the direct product, we show that $\Gamma(G\times H)\geq \Gamma(G) +\Gamma(H)-2$ and construct for any $k$ some graph $G_k$ such that $\Gamma(G_k)=2k+1$ and $\Gamma(G_k\times K_2)=3k+1$.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{BCC+08,
author = {J-C. Bermond and I. Caragiannis and D. Coudert and F. Diedrich and L. Hogie and F. Huc and C. Molle and J. Monteiro and P. Leone and H. Rivano and I. Sau},
title = {Algorithmic solutions for critical resource sharing: third year},
institution = {IST FET AEOLUS, Integrated Project IST-015964},
year = {2008},
number = {Deliverable 2.2.3},
pdf = {http://aeolus.ceid.upatras.gr/sub-projects/deliverables/D223.pdf},
sorte = "Rapports",

}

@TechReport{BCY08a,
author = {J-C. Bermond and R. Correa and M-L. Yu},
title = {Optimal Gathering Protocols on Paths under Interference Constraints},
institution = {HAL},
year = {2008},
OPTkey = {},
OPTtype = {},
number = {inria-00168162},
OPTaddress = {},
month = aug,
OPTnote = {},
OPTannote = {},
abstract = {We study the problem of gathering information from the nodes of a multi-hop radio network into a predefined destination node under reachability and interference constraints. In such a network, a node is able to send messages to other nodes within reception distance, but doing so it might create interference with other communications. Thus, a message can only be properly received if the receiver is reachable from the sender and there is no interference from another message being simultaneously transmitted. The network is modeled as a graph, where the vertices represent the nodes of the network and the edges, the possible communications. The interference constraint is modeled by a fixed integer $d \geq 1$, which implies that nodes within distance $ d$ in the graph from one sender cannot receive messages from another node. In this paper, we suppose that each node has one unit-length message to transmit and, furthermore, we suppose that it takes one unit of time (slot) to transmit a unit-length message and during such a slot we can have only calls which do not interfere (called compatible calls). A set of compatible calls is referred to as a round. We give protocols and lower bounds on the minimum number of rounds for the gathering problem when the network is a path and the destination node is either at one end or at the center of the path. The protocols are shown to be optimal for any $d$ in the first case, and for $1 \leq d \leq 4$, in the second case.},
url = {http://hal.inria.fr/inria-00168162/},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BCY08.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{BMMN08,
author = {J-C. Bermond and D. Mazauric and V. Misra and P. Nain},
title = {Distributed Call Scheduling in Wireless Networks},
institution = {INRIA},
year = {2008},
OPTkey = {},
OPTtype = {},
number = {RR-6763},
OPTaddress = {},
month = dec,
OPTnote = {},
OPTannote = {},
abstract = {This work investigates distributed transmission scheduling in wireless networks. Due to interference constraints, "neighboring links" cannot be simultaneously activated, otherwise transmissions will fail. Here, we consider any binary model of interference. We follow the model described by Bui, Sanghavi, and Srikant in SBS07,SBS09. We suppose that time is slotted and during each slot we have two phases: one control phase which determines what links will be activated and send data during the second phase. We assume random arrivals on each link during each slot, therefore a queue is associated to each link. Since nodes do not have a global knowledge of the network, our aim (like in SBS07,SBS09) is to design for the control phase, a distributed algorithm which determines a set of non interfering links. To be efficient the control phase should be as short as possible; this is done by exchanging control messages during a constant number of mini-slots (constant overhead). In this article we design the first fully distributed local algorithm with the following properties: it works for any arbitrary binary interference model; it has a constant overhead (independent of the size of the network and the values of the queues); and it needs no knowledge. Indeed contrary to other existing algorithms, we do not need to know the values of the queues of the "neighboring links", which are difficult to obtain in a wireless network with interference. We prove that this algorithm gives a maximal set of active links (in each interference set, there is at least one active edge). We also give sufficient conditions for stability under Markovian assumptions. Finally the performance of our algorithm (throughput, stability) is investigated and compared via simulations to that of previously proposed schemes.},
url = {http://hal.inria.fr/inria-00345669},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/RR-6763.pdf},
sorte = "Rapports",

}

@TechReport{BPP08,
author = {J-C. Bermond and V. Papadopoulou and E. Pitoura},
title = {Subproject2: Resource Management Report on the activities of the third year},
institution = {IST FET AEOLUS, Integrated Project IST-015964},
year = {2008},
number = {Deliverable 2.O.3},
pdf = {http://aeolus.ceid.upatras.gr/sub-projects/deliverables/D203.pdf},
sorte = "Rapports",

}

@TechReport{BeNi08,
author = {P. Berthom\'e and N. Nisse},
title = {A unified {FPT} Algorithm for Width of Partition Functions},
institution = {INRIA},
number = {RR-6646},
year = {2008},
type = {Research Report},
month = sep,
url = {https://hal.inria.fr/},
pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/RR-6646.pdf},
abstract = {During the last decades, several polynomial-time algorithms have been designed that decide if a graph has treewidth (resp., pathwidth, branchwidth, etc.) at most $k$, where $k$ is a fixed parameter. Amini {\it et al.} (to appear in SIAM J. Discrete Maths.) use the notions of partitioning-trees and partition functions as a generalized view of classical decompositions of graphs, namely tree-decomposition, path-decomposition, branch-decomposition, etc. In this paper, we propose a set of simple sufficient conditions on a partition function $\Phi$, that ensures the existence of a linear-time explicit algorithm deciding if a set $A$ has $\Phi$-width at most $k$ ($k$ fixed). In particular, the algorithm we propose unifies the existing algorithms for treewidth, pathwidth, linearwidth, branchwidth, carvingwidth and cutwidth. It also provides the first Fixed Parameter Tractable linear-time algorithm deciding if the $q$-branched treewidth, defined by Fomin {\it et al.} (Algo rithmica 2007), of a graph is at most $k$ ($k$ and $q$ are fixed). Our decision algorithm can be turned into a constructive one by following the ideas of Bodlaender and Kloks (J. of Alg. 1996).},
sorte = "Rapports",

}

@TechReport{CHS08,
author = {R. Correa and F. Havet and J.-S. Sereni},
title = {About a Brooks-type theorem for improper colouring},
year = {2008},
month = jan,
institution = {INRIA},
number = {RR-6432},
type = {Research Report},
url= {https://hal.inria.fr/inria-00223009},
pdf = {https://hal.inria.fr/action/open_file.php?url=https://hal.inria.fr/docs/00/26/53/83/PDF/RR-6432.pdf&docid=265383},
abstract = {A graph is k-improperly -colourable if its vertices can be partitioned into parts such that each part induces a subgraph of maximum degree at most k. A result of Lovasz a states that for any graph G, such a partition exists if l is at least (Delta(G)+1)/(k+1) . When k = 0, this bound can be reduced by Brooks' Theorem, unless G is complete or an odd cycle. We study the following question, which can be seen as a generalisation of the celebrated Brooks' Theorem to improper colouring: does there exist a polynomial-time algorithm that decides whether a graph G of maximum degree has k-improper chromatic number at most (Delta+1)/(k+1) - 1? We show that the answer is no, unless P = N P , when Delta= (k + 1)l, k>0 and l+sqrt(l) < 2k + 4. We also show that, if G is planar, k = 1 or k = 2, Delta = 2k + 2, and l= 2, then the answer is still no, unless P = N P . These results answer some questions of Cowen et al. [Journal of Graph Theory 24(3):205-219, 1997].},
sorte = "Rapports",

}

@TechReport{CHM08b,
author = {D. Coudert and F. Huc and D. Mazauric},
title = {A distributed algorithm for computing and updating the process number of a forest},
year = {2008},
month = jun,
institution = {INRIA},
number = {RR-6560},
type = {Research Report},
url= {https://hal.inria.fr/inria-00288304},
abstract = {In this paper, we present a distributed algorithm to compute various parameters of a tree such as the process number, the edge search number or the node search number and so the pathwidth. This algorithm requires n steps, an overall computation time of O(n log(n)), and n messages of size log_3(n)+3. We then propose a distributed algorithm to update the process number (or the node search number, or the edge search number) of each component of a forest after adding or deleting an edge. This second algorithm requires O(D) steps, an overall computation time of O(D log(n)), and O(D) messages of size log_3(n)+3, where D is the diameter of the modified connected component. Finally, we show how to extend our algorithms to trees and forests of unknown size using messages of less than 2a+4+e bits, where a is the parameter to be determined and e=1 for updates algorithms.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{CHM+08,
author = {D. Coudert and F. Huc and D. Mazauric and N. Nisse and J-S. Sereni},
title = {Routing Reconfiguration/Process Number: Coping wih Two Classes of Services},
institution = {INRIA},
year = {2008},
number = {RR-6698},
type = {Research Report},
month = oct,
url = {http://hal.inria.fr/inria-00331807},
abstract = { In WDM backbone networks, the traffic pattern evolves constantly due to the nature of the demand itself or because of equipment failures leading to reroute affected connections. In this context, requests are routed greedily using available resources without changing the routing of pre-established connections. However, such a policy leads to a poor usage of resources and so higher blocking probability: new connection requests might be rejected while network resources are sufficient to serve all the traffic. Therefore, it is important to regularly reconfigure the network by rerouting established connections in order to optimize the usage of network resources. In this paper, we consider the network reconfiguration problem that consists in switching existing connections one after the other from the current routing to a new pre-computed routing. Due to cyclic dependencies between connections, some requests may have to be temporarily interrupted during this process. Clearly, the number of requests simultaneously interrupted has to be minimized. Furthermore, it might be impossible for the network operator to interrupt some connections because of the contract signed with the corresponding clients. In this setting, the network reconfiguration problem consists in going from a routing to another one given that some priority connections cannot be interrupted. The network reconfiguration problem without priority connections has previously been modeled as a cops-and-robber game in CPPS05,CoSe07. Here, we first extend this model to handle priority connections. Then we identify cases where no solution exists. Using a simple transformation, we prove that the reconfiguration problem with priority connections can be reduced to the problem without this constraint. Finally, we propose a new heuristic algorithm that improves upon previous proposals.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{CoMa08,
author = {D. Coudert and D. Mazauric},
title = {Network Reconfiguration using Cops-and-Robber Games},
institution = {INRIA},
year = {2008},
type = {Research Report},
OPTkey = {},
OPTtype = {},
number = {RR-6694},
OPTaddress = {},
month = aug,
OPTnote = {},
OPTannote = {},
abstract = {The process number is the number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph theory point of view, it is similar to the pathwidth. However they are not always equal in general graphs. Determining these parameters is in general NP-complete. In this paper, we propose a polynomial algorithm to compute an approximation of the process number of digraphs, improving the efficiency of the previous exponential algorithm.},
url = {http://hal.inria.fr/inria-00315568/},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{CNR08,
author = {D. Coudert and N. Nepomuceno and H. Rivano},
title = {Wireless Backhaul Networks: Minimizing Energy Consumption by Power Efficient Radio Links Configuration},
institution = {INRIA},
year = {2008},
OPTkey = {},
OPTtype = {},
number = {RR-6752},
OPTaddress = {},
month = dec,
OPTnote = {},
OPTannote = {},
url = {http://hal.inria.fr/inria-00344344/},
abstract = {In this work, we investigate on minimizing the energy consumption of a wireless backhaul communication network through a joint optimization problem of data routing and radio configuration. The backhaul network is modeled by a digraph in which the nodes represent radio base stations and the arcs denote radio links. According to the scenario under consideration, a power efficient configuration can be characterized by a modulation constellation size and a transmission power level. Every link holds a set of power efficient configurations, each of them associating a capacity with its energy cost. The optimization problem involves deciding the network's configuration and flows which minimize the total energy expenditure, while handling all the traffic requirements simultaneously. An exact mathematical formulation of the problem is presented. It relies on a minimum cost multicommodity flow with stepwise cost functions which is very hard to optimize. We then introduce a linear relaxation of the problem, which exploits the convexity of the energy cost as a function of the throughput on a radio link. This yields lower bounds on the energy consumption, and eventually a heuristic algorithm based on the fractional optimum is presented. Our models are validated through extensive experiments which are reported and discussed. The results of the simulations testify the potentialities behind this novel approach. In particular, our algorithm takes a good advantage of the convexity of the cost function, inducing a quite small integrity gap in practice.},
pdf = {http://hal.inria.fr/docs/00/34/43/44/PDF/RR-6752.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TECHREPORT{DGMP08,
author = {O. Dalle and F. Giroire and J. Monteiro and S. P\'erennes},
title = {Analysis of Failure Correlation in Peer-to-Peer Storage Systems},
institution = {INRIA},
year = {2008},
number = {RR-6761},
month = dec,
abstract = {In this paper, we propose and study analytical models of self-repairing peer-to-peer storage systems subject to failures. The failures correspond to the simultaneous loss of multiple data blocks due to the definitive loss of a peer (or following a disk crash). In the system we consider that such failures happen continuously, hence the necessity of a self-repairing mechanism (data are written once for ever). We show that, whereas stochastic models of independent failures similar to those found in the literature give a correct approximation of the average behavior of real systems, they fail to capture their variations (e.g. in bandwidth needs). We propose to solve this problem using a new stochastic model based on a fluid approximation and we give a characterization of the behavior of the system according to this model (expectation and standard deviation). This new model is validated using comparisons between its theoretical behavior and computer simulations.},
optx-editorial-board = {yes},
optx-international-audience = {yes},
optx-proceedings = {yes},
pdf = {http://hal.inria.fr/docs/00/34/68/57/PDF/RR-6671.pdf},
url = {http://hal.inria.fr/inria-00346857/},
sorte = "Rapports",

}

@TechReport{Gal08b,
author = {J. Galtier},
title = {New algorithms to compute the strength of a graph},
institution = {INRIA},
year = {2008},
type = {Research Report},
number = {RR-6592},
month = {jul},
OPTabstract = {We investigate the problem of computing the strength of a graph. We describe in this article the first polyhedral formulation for the weighted strength in polynomial size of the problem, that is O(mn), where n is the number of vertices and m the number of edges. Moreover, we describe a surprisingly simple FPTAS that gives the strength within 1+epsilon in time $O(m log^2(n) log(m/n)/epsilon^2)$ and space O(m), outperforming by a factor of roughly $\min(n\sqrt{m},n^5/3)$ the best known exact algorithm of Trubin associated with the Goldberg and Rao maxflow algorithm for that problem, and of roughly sigma(G) the FPTAS of Plotkin, Shmoys, and Tardos.},
OPTpdf = {http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/30/79/91/PDF/RR-6592.pdf&docid=307991},
OPTurl = {http://hal.inria.fr/index.php?halsid=kdg5el2lb2ukptftsk547uego4&view_this_doc=inria-00305560&version=1},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{GPR08a,
author = {C. Gomes and S. P\'erennes and H. Rivano},
title = {Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks},
institution = {INRIA},
number = {inria-00282200},
url= {http://hal.inria.fr/inria-00282200/fr/},
pdf = {http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/28/22/00/PDF/INRIA_Report3.pdf&docid=282200},
month = may,
YEAR = {2008},
abstract = {In this paper, we address the routing and call scheduling problem in which one has to find a minimum-length schedule of selected links in a TDMA (Time Division Multiple Access) based wireless network. As we deal with a multi-hop networks, these selected links represent a routing solution (paths) providing enough capacity to achieve the routers requirements of bandwidth. We present a cross-layer formulation of the problem that computes joint routing and scheduling. We use a branch-and-price algorithm to solve optimally the problem. A column generation algorithm is used to cope with the exponential set of rounds. The branch-and-bound algorithm provides mono-routing. We run experiments on networks from the literature, with different number of gateways. Experimental results as well as theoretical insights let us conjecture that the bottleneck region analysis is enough to find the optimal solution. The bottleneck is usually the gateway considering almost uniform traffic. The integer round-up property (IRUP) seems to hold for our problem.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{HKK+08,
author = {F. Havet and M. Klazar and J. Kratochvil and D. Kratsch and M. Liedloff},
title = {Exact algorithms for $L(2,1)$-labelling},
year = {2008},
month = {07},
institution = {INRIA},
number = {RR-6587},
type = {Research Report},
opturl = {http://hal.inria.fr/index.php?halsid=1hng08barus89qc4e98egl8fp0&view_this_doc=inria-00303330&version=1},
optpdf = {http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/30/33/30/PDF/RR-6587.pdf&docid=303330},
abstract = {The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph $G=(V,E)$ into an interval of integers $0, \dots ,k$ is an $L(2,1)$-labeling of $G$ of span $k$ if any two adjacent vertices are mapped onto integers that are at least 2 apart, and every two vertices with a common neighbor are mapped onto distinct integers. It is known that for any fixed $k\ge 4$, deciding the existence of such a labeling is an NP-complete problem. We present exact exponential time algorithms that are faster than the naive $O((k+1)^n)$ algorithm that would try all possible mappings. The improvement is best seen in the first NP-complete case of $k=4$ -- here the running time of our algorithm is $O(1.3006^n)$. $O(1.3161^n)$. Furthermore we show that dynamic programming can be used to establish an $O(3.8730^n)$ algorithm to compute an optimal $L(2,1)$-labeling.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{HKSS08,
author = {F. Havet and D. Kr\'al and J.-S. Sereni and R. {\v S}krekovski},
title = {Facial coloring using Hall's Theorem},
year = {2008},
institution = {ITI-series},
number = {383},
type = {Research Report},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/HKSS08.pdf},
abstract={A vertex coloring of a plane graph is $\ell$-facial if every two distinct vertices joined by a facial walk of length at most $\ell$ receive distinct colors. It has been conjectured that every plane graph has an $\ell$-facial coloring with at most $3\ell+1$ colors. We improve the currently best known bound and show that every plane graph has an $\ell$-facial coloring with at most $\lfloor 7\ell/2\rfloor+6$ colors. Our proof uses the standard discharging technique, however, in the reduction part we have successfully applied Hall's Theorem, which seems to be quite an innovative approach in this area.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{HRS08b,
author = {F. Havet and B. Reed and J.-S. Sereni},
title = {$L(p,1)$-labelling of graphs},
year = {2008},
month = oct,
institution = {INRIA},
number = {RR-6673},
type = {Research Report},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/HRS08b.pdf},
abstract = {An $L(p,1)$-labelling of a graph is a function $f$ from the vertex set to the positive integers such that $|f(x)-f(y)|\geq p$ if $\dist(x,y)=1$ and $|f(x)-f(y)|\geq p$ if $\dist(x,y)=2$, where $\dist(x,y)$ is the distance between the two vertices~$x$ and~$y$ in the graph. The \emph{span} of an $L(p,1)$-labelling $f$ is the difference between the largest and the smallest labels used by $f$ plus $1$. In 1992, Griggs and Yeh conjectured that every graph with maximum degree $\Delta\geq 2$ has an $L(2,1)$-labelling with span at most $\D2+1$. We settle this conjecture for $\D$ sufficiently large. More generally, we show that for any positive integer $p$ there exists a constant $\Delta_p$ such that every graph with maximum degree $\Delta\geq \Delta_p$ has an $L(p,1)$-labelling with span at most $\D2+1$. This yields that, for each positive integer $p$, there is an integer $C_p$ such that every graph with maximum degree $\Delta$ has an $L(p,1)$-labelling with span at most $\Delta2+C_p$.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{HHMR08,
author = {F. Havet and J. van den Heuvel and C. McDiarmid and B. Reed},
title = {List Colouring Squares of Planar Graphs},
year = {2008},
month = jul,
institution = {INRIA},
number = {RR-6586},
type = {Research Report},
opturl = {http://hal.inria.fr/index.php?halsid=1hng08barus89qc4e98egl8fp0&view_this_doc=inria-00303303&version=1},
optpdf = {http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/30/33/03/PDF/RR-6586.pdf&docid=303303},
abstract = {In 1977, Wegner conjectured that the chromatic number of the square of every planar graph~$G$ with maximum degree $\Delta\ge8$ is at most $\bigl\lfloor\frac32\,\Delta\bigr\rfloor+1$. We show that it is at most $\frac32\,\Delta\,(1+o(1))$, and indeed this is true for the list chromatic number and for more general classes of graphs. },
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{MuSa08a,
author = {X. Mu{\~n}oz and I. Sau},
title = {{Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph}},
year = {2008},
month = mar,
institution = {INRIA},
number = {RR-6481},
type = {Research Report},
url= {https://hal.inria.fr/inria-00265565},
pdf = {https://hal.inria.fr/action/open_file.php?url=https://hal.inria.fr/docs/00/26/57/49/PDF/RR-6481.pdf&docid=265749},
abstract = {Traffic grooming is a major issue in optical networks. It refers to grouping low rate signals into higher speed streams, in order to reduce the equipment cost. In SONET WDM networks, this cost is mostly given by the number of electronic terminations, namely ADMs. We consider the case when the topology is a unidirectional ring. In graph-theoretical terms, the traffic grooming problem in this case consists in partitioning the edges of a request graph into subgraphs with a maximum number of edges, while minimizing the total number of vertices of the decomposition. We consider the case when the request graph has bounded maximum degree $\Delta$, and our aim is to design a network being able to support any request graph satisfying the degree constraints. The existing theoretical models in the literature are much more rigid, and do not allow such adaptability. We formalize the problem, and solve the cases $\Delta=2$ (for all values of $C$) and $\Delta = 3$ (except the case $C=4$). We also provide lower and upper bounds for the general case.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@TechReport{NSR08,
author = {N. Nisse and K. Suchan and I. Rapaport},
title = {Distributed computing of efficient routing schemes in generalized chordal graphs},
institution = {CMM},
number = {CMM-B-08/10-220},
year = {2008},
month = {oct},
opturl = {http://www.dim.uchile.cl/index.php?option=articles&Itemid=7&topid=9},
pdf = {http://ftp-sop.inria.fr/mascotte/Publications/NSR08.pdf},
abstract = {We propose a simple interval routing scheme for a graph $G$, based on a Maximal Neighborhood BFS-tree $T$ of $G$. In our scheme a message simply follows the source-destination path in $T$ but, in at most one step, it may take a shortcut. This shortcut is taken when the current node has a neighbor in $G$ which is an ancestor in $T$ of the destination. In the class of $k$-chordal graphs, this gives an additive stretch of at most $k-1$, and at most $1$ in the class of chordal graphs. Our routing tables use $O(\Delta\log n)$ bits per node, where $\Delta$ is the maximum degree. We propose a simple distributed algorithm to compute such tables in time $O(D)$ in any $n$-node graph with diameter $D$.},
sorte = "Rapports",

}

@TechReport{PeSa08,
author = {S. P\'erennes and I. Sau},
title = {{Sur la Conjecture des Jeux Uniques}},
year = {2008},
month = oct,
institution = {INRIA},
number = {RR-6691},
type = {Research Report},
url= {http://hal.inria.fr/inria-00331248},
pdf = {http://www-sop.inria.fr/members/Ignasi.Sauvalls/Pubs/RR_PeSa08.pdf},
abstract = {La plupart des problèmes d'optimisation combinatoire sont NP-difficiles, c'est-� -dire qu'ils ne peuvent être résolus en temps polynomial que si les classes P et NP sont identiques. Pour ces problèmes on peut espérer soit trouver des algorithmes d'approximation, soit prouver qu'ils ne peuvent pas être approximés de manière efficace. En 2002 S. Khot formula la Conjecture des Jeux Uniques (UGC), qui géneralise le théorème PCP et impliquerait d'importants résultats d'innaproximabilité pour plusieurs problèmes d'optimisation combinatoire (par exemple Max Cut ou Vertex Cover). Intuitivement, la UGC dit que, pour une certaine classe de jeux, appelés uniques, il est NP-dur de décider si l'on peut trouver une solution proche de l'optimale, ou si toutes les solutions sont loin de l'optimale. Cette conjecture est devenue un problème ouvert des plus importants dans la théorie de la complexité et de l'approximation. Dans cet article nous étudions un problème très relié � la UGC: Max-E$2$-Lin2 dans les graphes bipartis. Dans Max-E$2$-Lin2 on a un graphe $G$ ayant deux type d'arêtes, requérant soit la même soit différente couleur pour ses extrémités. Le but est de 2-colorer les sommets de $G$ en maximisant le nombre d'arêtes satisfaites. Nous prouvons que ce problème est APX-complet dans les graphes bipartis et, en utilisant le Théorème de Répétition Paralèlle, nous discutons les conséquences de ce résultat dans le cadre des jeux uniques et la UGC.},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "Rapports",

}

@MISC{Coh08,
OPTKEY = { },
AUTHOR = {N. Cohen},
TITLE = {Coloration des graphes planaires},
institution = {Master 2 en Statistiques, Informatique et Techniques Num\'eriques de l'Universit\'e Lyon-1, France},
MONTH = jul,
YEAR = { 2008 },
NOTE = {Internship report},
OPTANNOTE = { },
PDF = {http://www-sop.inria.fr/mascotte/rapports_stages/rapport.pdf},
sorte = "Rapports",

}

@MISC{Had08,
OPTKEY = { },
AUTHOR = {M. Hadj Djilani},
TITLE = {Interface MASCOPT pour {CLP}/{CBC}},
institution = {Licence Professionnelle SIL 3, Unsa, France},
MONTH = sep,
YEAR = { 2008 },
NOTE = {Internship report},
OPTANNOTE = { },
PDF = {http://www-sop.inria.fr/mascotte/rapports_stages/2008_Mohamed_Hadj_Djilani.pdf},
sorte = "Rapports",

}

@Misc{GCT+08,
author = {F. Giroire and J. Chandrashekar and N. Taft and E. Schooler and K. Papagiannaki},
title = {Method and System for Detecting and Reducing Botnet Activity},
year = {2008},
month = dec,
note = {Docket Number P28858 / 45631-207291},
institution = {Intel},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "brevets",

}

@Misc{GNTD08a,
author = {F. Giroire and A. Nucci and N. Taft and C. Diot},
title = {Method and Systems for Correlating Practical Constraints in a Network},
year = {2008},
month = jul,
OPTnote = {Sprint Docket Number #2315/SPRI.104359},
note = {Patent number {US 7,394,760 B1}. Filled in July 2003},
institution = {Sprint},
sorte = "brevets",

}

@Misc{_C_/M/GNTD08b,
author = {F. Giroire and A. Nucci and N. Taft and C. Diot},
title = {Method and Systems for Identifying Optimal Mapping in a Network},
year = {2008},
month = nov,
OPTnote = {Sprint Docket Number #2315/SPRI.104359},
note = {Patent number {US 7,453,824 B1}. Filled in July 2003},
institution = {Sprint},
sorte = "brevets",

}

@MISC{JWMD08,
AUTHOR = { S. Jafer and G. Wainer and J-C. {Maureira Bravo} and O. Dalle },
TITLE = { Event Behavior of Discrete Event Simulations in {CD}++ Vs. NS-2 },
YEAR = { 2008 },
MONTH = apr,
HOWPUBLISHED = { 2008 Spring Simulation Multiconference (Spring Sim'08)- Poster Sessions (SCS-Poster sessions 2008) },
ADDRESS = { Ottawa, Canada },
ABSTRACT = { The study of events behavior through real simulations could contribute to develop or improve Future Event Set (FES) data structures in order to achieve better performance on large scale simulations. In this paper we have analyzed FES data structures of two discrete event simulators: CD++ and NS-2. We have run variety of simulations on each simulator to describe a real event behavior by observing event timestamps, life times into the FES and firing time (event execution time). The goal of this research is to present new ideas on how the FES data structures could be improved exploiting event behaviors. },
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-sa",

}

@MISC{Maz08,
OPTKEY = { },
AUTHOR = { D. Mazauric},
TITLE = {Conception et analyse d'algorithmes distribu\'es d'ordonnancement des transmissions dans les r\'eseaux sans-fil},
institution = {Master 2 RSD, Polytech'Nice, France},
MONTH = sep,
YEAR = { 2008 },
NOTE = {Internship report},
OPTANNOTE = { },
PDF = {http://www-sop.inria.fr/members/Dorian.Mazauric/Bibliographie/mazauricEPU.pdf},
sorte = "Rapports",

}

@MISC{MoDa08,
OPTKEY = { },
AUTHOR = { J. Monteiro and O. Dalle },
TITLE = { {CORRAL}: {S}tackable {C}opy-on-{W}rite {V}ersioning {D}evice using {L}inux {D}evice-{M}apper },
HOWPUBLISHED = { {USENIX} Annual Technical Conference (USENIX'08) },
MONTH = jun,
YEAR = { 2008 },
NOTE = { Poster },
OPTANNOTE = { },
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-sa",

}

@PROCEEDINGS{algotel07,
title = {Neuvi\`emes Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel'07)},
year = {2007},
editor = {G. Chelius and D. Coudert},
volume = {9},
pages = {136p},
address = {Ile d'Ol\'eron, France},
month = may,
organization = {CNRS, LaBRI, Universit\'e Bordeaux I},
opturl = {http://algotel2007.labri.fr/},
url = {http://hal.inria.fr/ALGOTEL2007},
sorte = "conf-nat" 
}

@PhdThesis{Ami07,
author = {O. Amini},
title = {Algorithmique des d\'ecompositions de graphes Applications aux r\'eseaux de t\'el\'ecommunications},
school = {\'Ecole doctorale STIC, Universit\'e de Nice-Sophia Antipolis},
year = {2007},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
month = {November 28},
OPTnote = {},
OPTannote = {},
POSTSCRIPT = {},
abstract = {La th\`ese comprend trois parties relativement ind\'ependantes. Le th\`eme central reliant ces parties est la d\'ecomposition de graphes: la premi\`ere partie traite de la d\'ecomposition arborescente; la deuxi\`eme, plus appliqu\'ee, se fonde sur les applications des d\'ecompositions d'ar\^etes ou de noeuds aux r\'eseaux de t\'el\'ecommunications, et la derni\`ere, plus th\'eorique, concerne la coloration de graphes. Les chapitres de la premi\`ere partie \'etudient la d\'ecomposition arborescente de graphes et ses applications � la conception d'algorithmes dits param\'etr\'es. La partie II regroupe des travaux sur les probl\`emes issus des r\'eseaux de t\'el\'ecommunications. Deux types de r\'eseaux sont \'etudi\'es: les r\'eseaux embarqu\'es dans les satellites et les r\'eseaux optiques WDM. La troisi\`eme partie, plus probabiliste, est essentiellement bas\'ee sur la coloration de graphes et l'existence des cycles orient\'es dans les digraphes.},
sorte = "these" 
}

@PhdThesis{Hav07,
author = {F. Havet},
title = {Graph colouring and applications},
school = {Universit\'e de Nice-Sophia Antipolis},
year = {2007},
OPTkey = {},
type = {Habilitation \`a Diriger des Recherches},
OPTaddress = {},
month = {December 12},
OPTnote = {},
OPTannote = {},
POSTSCRIPT = {},
URL = {http://www-sop.inria.fr/mascotte/personnel/Frederic.Havet/habilitation/},
sorte = "HDR",

}

@PHDTHESIS{Hog07,
author = {L. Hogie},
title = {Mobile Ad Hoc Networks: Modelling, Simulation and Broadcast-based Applications},
school = {University of Le Havre, University of Luxembourg},
year = {2007},
month = {April},
abstract = {Over the last few years, personal communication devices have invaded most developed countries and today, the majority of the population owns a mobile phone and most of them use personal digital assistants, mobile computers, etc. This tendency is reinforced and occurs at the same time with a new trend: most of these devices get equipped with one or several wireless networking interfaces. Practically, Wi-Fi or/ and Bluetooth-enabled devices become of frequent use. More than allowing the connection to some access point (as they can be found in airport, train stations, city-centers, restaurants, etc), these interfaces permit also to interconnect directly with one another in a decentralized way and to hence self-organize into ad hoc networks. A mobile ad hoc network (MANET) is a set of mobile nodes able to communicate with other nodes in their surroundings. These wireless communications happen in a peer-topeer manner, without relying on any predefined infrastructure. Today, MANETs are mainly used for sensing, gaming and military purposes. But the steadily wider adoption of wireless technologies in daily life let one foresee the next generation of MANETs applications: environmental and medical monitoring, groupware, customer-to-customer applications, risk management, entertainment, advertising, etc. In order to enable the development and spreading of these applications, a number of issues have to be solved. First, in such network, end-to-end connectivity cannot be guaranteed. Indeed MANETs may be partitioned and nodes may be sporadically present in the network. As such, MANETs can be considered as Delay Tolerant Networks (DTN). Second, the topology of the network changes over time because of the mobility of the stations. Then, the way the communication primitives were implemented in the context of wired networks is no longer applicable. It is hence necessary to propose new algorithms to enable those primitives, like broadcasting that serves as a basic pattern for the design of many MANETs applications. The design and implementation of such communication schemes, and more generally of MANETs application, can be achieved using two different ways: either by building a real network, or by resorting to modelling and simulation. In the context of this work, where city-scale environment were considered, simulation was hence unavoidable. The development of such a simulator took place at the crossroad of some projects in relation to complex system modelling, optimization and middleware design for MANETs, and conducted in several European countries. This diversity led to the design of a custom simulator called Madhoc. Madhoc captures the major characteristics of DTNs, by providing an extendable set of mobility models as well as a framework for the de_nition of new applications. Madhoc was primarily used for the investigation of the broadcasting issue. In this specific context, networks composed of thousands devices using a variety of wireless technologies were considered. These networks are partitioned and exhibit heterogeneous densities. This led to the design of a bandwidth-efficient broadcasting protocol called DFCN.},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "these",

}

@PhdThesis{Liq07,
author = {L. Liquori},
title = {Peter, le langage qui n'existe pas... ({P}eter, the language that does not exists...)},
school = {{I}nstitut {N}ational {P}olytechnique de {L}orraine ({INPL})},
year = {2007},
OPTkey = {},
type = {Habilitation \`a Diriger des Recherches},
OPTaddress = {},
month = {6 Juillet},
OPTnote = {},
OPTannote = {},
POSTSCRIPT = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HDR-Liquori.pdf},
URL = {},
sorte = "HDR",

}

@PhdThesis{Mor07,
author = {N. Morales},
title = {Algorithmique des r\'eseaux de communication radio mod\'elis\'es par des graphes},
school = {\'Ecole doctorale STIC, Universit\'e de Nice-Sophia Antipolis},
year = {2007},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
month = {26 Janvier},
OPTnote = {},
OPTannote = {},
POSTSCRIPT = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Mor07.pdf},
URL = {},
sorte = "these",

}

@Article{ADM+07,
author = {L. Addario-Berry and K. Dalal and C. McDiarmid and B. Reed and A. Thomason},
title = {Vertex Colouring Edge Weightings},
journal = {Combinatorica},
year = {2007},
OPTkey = {},
volume = {27},
OPTnumber = {},
pages = {1-12},
OPTmonth = {},
OPTannote = {},
sorte = "rev-int",

}

@ARTICLE{AHT07,
AUTHOR={L. Addario-Berry and F. Havet and S. Thomass\'e},
TITLE={Paths with two blocks in $n$-chromatic digraphs},
JOURNAL = "Journal of Combinatorial Theory Ser. B",
VOLUME = "97",
YEAR = "2007",
PAGES = "620--626",
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AHT07.pdf},
sorte = "rev-int",

}

@ARTICLE{ADL+07,
OPTauthor = {Enrique Alba and Bernab{\'e} Dorronsoro and Francisco Luna and Antonio J. Nebro and Pascal Bouvry and L. Hogie},
author = {E. Alba and B. Dorronsoro and F. Luna and A.J. Nebro and P. Bouvry and L. Hogie},
title = {A cellular multi-objective genetic algorithm for optimal broadcasting strategy in metropolitan MANETs},
journal = {Computer Communications},
year = {2007},
volume = {30},
pages = {685--697},
number = {4},
month = {August},
abstract = {Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenario, broadcasting becomes an operation of capital importance for the own existence and operation of the network. Optimizing a broadcast strategy in MANETs is a multi-objective problem accounting for three goals: reaching as many stations as possible, minimizing the network utilization, and reducing the makespan. In this paper, we study the fine-tuning of broadcast strategies by using a cellular multi-objective genetic algorithm (cMOGA) that computes a Pareto front of the solutions to empower a human designer with the ability of choosing the preferred configuration for the network. We define two formulations of the problem, one with three objectives and another one with two objectives plus a constraint. Our experiments using a complex and realistic MANET simulator reveal that using cMOGA is a promising approach to solve the optimum broadcast problem.},
address = {Newton, MA, USA},
doi = {10.1109/IPDPS.2005.4},
issn = {0140-3664},
publisher = {Butterworth-Heinemann},
url = {http://www.springerlink.com/content/qk6747wq32478r42/fulltext.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
sorte = "rev-int",

}

@Article{BLS07a,
author = {R. Bayon and N. Lygeros and J.-S. Sereni},
title = {Orders with ten elements are circle orders},
journal = {Applied Mathematics E-Notes},
year = {2007},
volume = {7},
pages = {16--22},
URL={http://www.math.nthu.edu.tw/~amen/},
PDF={http://kam.mff.cuni.cz/~sereni/Articles/BLS07a.pdf},
sorte = "rev-int",

}

@ARTICLE{BBC07,
author = {J-C. Bermond and L. Braud and D. Coudert},
title = {Traffic Grooming on the Path},
journal = {Theoretical Computer Science},
year = {2007},
month = oct,
volume = {384},
pages = {139-151},
number = {2-3},
abstract = {In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we will say that the grooming factor is C. That means that on a given edge of the network we can groom (group) at most C requests on the same wavelength. With this constraint the objective can be either to minimize the number of wavelengths (related to the transmission cost) or minimize the number of Add Drop Multiplexers (shortly ADM) used in the network (related to the cost of the nodes). We consider here the case where the network is a path on N nodes, P_N. Thus the routing is unique. For a given grooming factor C minimizing the number of wavelengths is an easy problem, well known and related to the load problem. But minimizing the number of ADM's is NP-complete for a general set of requests and no results are known. Here we show how to model the problem as a graph partition problem and using tools of design theory we completely solve the case where C=2 and where we have a static uniform all-to-all traffic (one request for each pair of vertices).},
optnote = {A preliminary version has been presented at SIROCCO'05.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BBC-to-tcsa.pdf},
url = {http://dx.doi.org/10.1016/j.tcs.2007.04.028},
sorte = "rev-int" 
}

@Article{BFPP07,
AUTHOR={J-C. Bermond and A. Ferreira and S. P\'erennes and J. Peters},
TITLE={Neighbourhood Broadcasting in Hypercubes},
journal = {SIAM Journal on Discrete Mathematics},
year = {2007},
Volume= {21},
Number={4},
Pages={823-843},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BFPP07.pdf},
abstract={In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbor at a time, broadcasting takes at least $\lceil \log_2 N \rceil$ rounds in a network of $N$ nodes. In the neighborhood broadcasting problem, the node that is broadcasting needs to inform only its neighbors. In a binary hypercube with $N$ nodes, each node has $\log_2 N$ neighbors, so neighborhood broadcasting takes at least $\lceil \log_2 \log_2 (N+1) \rceil$ rounds. In this paper, we present asymptotically optimal neighborhood broadcast protocols for binary hypercubes.},
sorte = "rev-int" 
}

@Article{BeYu07,
author = {J-C. Bermond and M-L. Yu},
title = {Vertex disjoint routings of cycles over tori},
journal = {Networks},
year = {2007},
Volume = {49},
Number = {3},
Pages = {217-225},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BeYu07.pdf},
sorte = "rev-int" 
}

@Article{BBR07b,
author = {E. Birmel\'e and J. A. Bondy and B. Reed},
title = {The {Erdos-Posa} property for long circuits},
journal = {Combinatorica},
year = {2007},
OPTkey = {},
volume = {27},
OPTnumber = {},
pages = {135-145},
OPTmonth = {},
OPTannote = {},
sorte = "rev-int",

}

@article{CTY07,
author={P. Charbit and S. Thomass\'e and A. Yeo},
title={The minimum feedback arc set problem is {NP}-hard for tournament},
year={2007},
journal={Combinatorics, Probability and Computing},
volume={16},
number={},
pages = {1--4},
sorte = "rev-int",

}

@article{CLM07,
author = {A. Ciaffaglione and L. Liquori and M. Miculan},
title = {Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts},
year = {2007},
volume = {39},
pages = {1--47},
JOURNAL = {JAR, Journal of Automated Reasoning},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/jar-07.pdf},
sorte = "rev-int",

}

@ARTICLE{CDP+07,
author = {D. Coudert and P. Datta and S. Perennes and H. Rivano and M-E. Voge},
title = {Shared Risk Resource Group: Complexity and Approximability issues},
journal = {Parallel Processing Letters},
year = {2007},
volume = {17},
pages = {169-184},
number = {2},
month = jun,
abstract = {This article investigates complexity and approximability properties of combinatorial optimization problems yielded by the notion of Shared Risk Resource Group (SRRG). SRRG has been introduced in order to capture network survivability issues where a failure may break a whole set of resources, and has been formalized as colored graphs, where a set of resources is represented by a set of edges with same color. We consider here the analogous of classical problems such as determining paths or cuts with the minimum numbers of colors or color disjoint paths. These optimization problems are much more difficult than their counterparts in classical graph theory. In particular standard relationship such as the Max Flow - Min Cut equality do not hold any longer. In this article we identify cases where these problems are polynomial, for example when the edges of a given color form a connected subgraph, and otherwise give hardness and non approximability results for these problems.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CDP+-PPL06.pdf},
sorte = "rev-int" 
}

@ARTICLE{CHS07,
author = {D. Coudert and F. Huc and J.-S. Sereni},
title = {Pathwidth of outerplanar graphs},
journal = {Journal of Graph Theory},
year = {2007},
volume = {55},
pages = {27-41},
number = {1},
month = may,
abstract = {We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin, after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geometric) dual plus two, conjectured that there exists a constant c such that the pathwidth of every biconnected outerplanar graph is at most c plus the pathwidth of its dual. They also conjectured that this was actually true with c being one for every biconnected planar graph. Fomin proved that the second conjecture is true for all planar triangulations. First, we construct for each p>=1 a biconnected outerplanar graph of pathwidth 2p 1 whose (geometric) dual has pathwidth p 1, thereby disproving both conjectures. Next, we also disprove two other conjectures (one of Bodlaender and Fomin, implied by one of Fomin). Finally we prove, in an algorithmic way, that the pathwidth of every biconnected outerplanar graph is at most twice the pathwidth of its (geometric) dual minus one. A tight interval for the studied relation is therefore obtained, and we show that all cases in the interval happen.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CHS-JGT06.pdf},
sorte = "rev-int" 
}

@article{FHRV07,
AUTHOR = {S. Fiorini and N. Hardy and B. Reed and A. Vetta},
TITLE = {Approximate min-max relations for odd cycles in planar graphs},
JOURNAL = {Mathematical Programming Ser. B},
SERIES = {B},
VOLUME = {110},
NUMBER = {1},
PAGES = {71--91},
YEAR = {2007},
sorte = "rev-int",

}

@Article{FKNP07a,
title = { Improved approximation results for the Minimum Energy Broadcasting problem },
author = { M. Flammini and R. Klasing and A. Navarra and S. P\'erennes },
year = { 2007 },
journal = { Algorithmica },
pages = {318-336},
volume = {49},
number = {4},
OPTnote = { Published online on October 13th 2007},
abstract = {In this paper we present new results on the performance of the Minimum Spanning Tree heuristic for the Minimum Energy Broadcast Routing (MEBR) problem. We first prove that, for any number of dimensions d≥2, the approximation ratio of the heuristic does not increase when the power attenuation coefficient α, that is the exponent to which the coverage distance must be raised to give the emission power, grows. Moreover, we show that, for any fixed instance, as a limit for α going to infinity, the ratio tends to the lower bound of Clementi et al., Wan et al. given by the d-dimensional kissing number, thus closing the existing gap between the upper and the lower bound. We then introduce a new analysis allowing to establish a 7.45-approximation ratio for the 2-dimensional case, thus significantly decreasing the previously known 12 upper bound (actually corrected to 12.15 in Klasing et al.). Finally, we extend our analysis to any number of dimensions d≥2 and any α≥d, obtaining a general approximation ratio of 3 d −1, again independent of α. The improvements of the approximation ratios are specifically significant in comparison with the lower bounds given by the kissing numbers, as these grow at least exponentially with respect to d.},
url = {http://dx.doi.org/10.1007/s00453-007-9077-7},
sorte = "rev-int",

}

@ARTICLE{FoRe07,
author = "N. Fountoulakis and B. Reed",
title = "Faster Mixing and Small Bottlenecks",
pages = "475-486",
journal = "Probability Theory and Related Fields",
volume = "137",
year = 2007,
sorte = "rev-int",

}

@article{GaLa07,
author = {J. Galtier and A. Laugier},
title = {Flow on data network and a positive semidefinite representable delay function},
journal = {Journal of Interconnection Networks},
volume = {8},
number = {1},
year = {2007},
pages = {29--43},
month = mar,
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GaLa07.pdf},
abstract = {Data networks are subject to congestion, thereby the delay to go across the network may be large enough in order to dishearten customers to keep on using such a network. In this paper we address the problem of determining in a given network a routing which minimizes the delay or keeps it under a certain bound. This problem was already shown as complete. Our main contribution is to study it in the special context of the positive semidefinite programming and we present a column generation approach to solve the underlying problem.},
sorte = "rev-int" 
}

@article{GCN07,
author = {L. Grigori and M. Cosnard and E. G. Ng},
title = {On the row merge for sparse {LU} factorization with partial pivoting},
journal = {{BIT} Numerical Mathematics},
year = {2007},
volume = {47},
pages = {45--76},
number = {1},
month = mar,
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/GCN07.pdf},
abstract = {We consider the problem of structure prediction for sparse LU factorization with partial pivoting. In this context, it is well known that the column elimination tree plays an important role for matrices satisfying an irreducibility condition, called the strong Hall property. Our primary goal in this paper is to address the structure prediction problem for matrices satisfying a weaker assumption, which is the Hall property. For this we consider the row merge matrix, an upper bound that contains the nonzeros in L and U for all possible row permutations that can be performed during the numerical factorization with partial pivoting. We discuss the row merge tree, a structure that represents information obtained from the row merge matrix; that is, information on the dependencies among the columns in Gaussian elimination with partial pivoting and on structural upper bounds of the factors L and U. We present new theoretical results that show that the nonzero structure of the row merge matrix can be described in terms of branches and subtrees of the row merge tree. These results lead to an efficient algorithm for the computation of the row merge tree, that uses as input the structure of A, and has a time complexity almost linear in the number of nonzeros in A. We also investigate experimentally the usage of the row merge tree for structure prediction purposes on a set of matrices that satisfy only the Hall property. We analyze in particular the size of upper bounds of the structure of L and U, the reordering of the matrix based on a postorder traversal and its impact on the factorization runtime. We show experimentally that for some matrices, the row merge tree is a preferred alternative to the column elimination tree.},
sorte = "rev-int" 
}

@article{HLL07,
author = {F. Honsell and M. Lenisa and L. Liquori},
title = "A Framework for Defining Logical Frameworks",
journal = "Electronic Notes in Theoretical Computer Science",
volume = "172",
number = "",
pages = "399 - 436",
year = "2007",
note = "Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin",
issn = "1571-0661",
doi = "DOI: 10.1016/j.entcs.2007.02.014",
url = "http://www.sciencedirect.com/science/article/B75H1-4N7RX2N-G/2/7c4694b4f44f7479705fd7df4e5a6ba0",
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/plotkin-feist-07.pdf},
abstract = " In this paper, we introduce a General Logical Framework, called GLF, for defining Logical Frameworks, based on dependent types, in the style of the well known Edinburgh Logical Framework LF. The framework GLF features a generalized form of lambda abstraction where [beta]-reductions fire provided the argument satisfies a logical predicate and may produce an n-ary substitution. The type system keeps track of when reductions have yet to fire. The framework GLF subsumes, by simple instantiation, LF as well as a large class of generalized constrained-based lambda calculi, ranging from well known restricted lambda calculi, such as Plotkin's call-by-value lambda calculus, to lambda calculi with patterns. But it suggests also a wide spectrum of new calculi which have intriguing potential as Logical Frameworks. We investigate the metatheoretical properties of the calculus underpinning GLF and illustrate its expressive power. In particular, we focus on two interesting instantiations of GLF. The first is the Pattern Logical Framework (PLF), where applications fire via pattern-matching in the style of Cirstea, Kirchner, and Liquori. The second is the Closed Logical Framework (CLF) which features, besides standard [beta]-reduction, also a reduction which fires only if the argument is a closed term. For both these instantiations of GLF we discuss standard metaproperties, such as subject reduction, confluence and strong normalization. The GLF framework is particularly suitable, as a metalanguage, for encoding rewriting logics and logical systems, where rules require proof terms to have special syntactic constraints, e.g. logics with rules of proof, in addition to rules of derivations, such as, e.g., modal logic, and call-by-value lambda calculus.",
sorte = "rev-int",

}

@ARTICLE{LiRo07,
author = {L. Liquori and S. {Ronchi Della Rocca}},
title = {Intersection Typed System {\it \`a la} {C}hurch},
journal = {IC, Journal of Information and Computation},
year = {2007},
volume = {205},
pages = {1371--1386},
number = {9},
month = sep,
pdf = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/ic-07.pdf},
url = {http://dx.doi.org/10.1016/j.ic.2007.03.005},
sorte = "rev-int",

}

@inproceedings{APS07a,
author = {O. Amini and S. P\'erennes and I. Sau},
title = {Hardness of Approximating the Traffic Grooming},
booktitle={Neuvi\`emes Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel'07)},
pages = {45-48},
address={Ile d'Ol\'eron, France},
month=may,
year={2007},
URL={http://algotel2007.labri.fr/},
pdf={http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/17/69/60/PDF/59-APS-Algotel.pdf&docid=176960},
abstract={Le groupage est un problème central dans l'étude des réseaux optiques. Dans cet article, on propose le premier résultat d'inapproximabilité pour le problème du groupage, en affirmant la conjecture de Chow et Lin (2004, Networks, 44, 194-202), selon laquelle le groupage est APX-complet. On étudie aussi une version amortie du problème de sous-graphe le plus dense dans un graphe donné: trouver le sous-graphe de taille minimum ayant le degré minimum au moins d, d>=3. On démontre que ce dernier n'a pas d'approximation � un facteur constant.},
sorte = "conf-nat" 
}

@InProceedings{APS07c,
author = {O. Amini and S. P\'erennes and I. Sau},
title = {Hardness and Approximation of Traffic Grooming},
booktitle = {The 18th International Symposium on Algorithms and Computation (ISAAC 2007)},
year = {2007},
address = {Sendai, Japan},
month= dec,
publisher= { Springer-Verlag },
series= {Lecture Notes in Computer Science},
volume= { 4835 },
pages = {561-573},
url={http://www.nishizeki.ecei.tohoku.ac.jp/isaac07/},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/APS07b.pdf},
abstract = {Traffic grooming is a central problem in optical networks. It refers to pack low rate signals into higher speed streams, in order to improve bandwidth utilization and reduce network cost. In WDM networks, the most accepted criterion is to minimize the number of electronic terminations, namely the number of SONET Add-Drop Multiplexers (ADMs). In this article we focus on ring and path topologies. On the one hand, we provide the first inapproximability result for \textsc{Traffic Grooming} for fixed values of the grooming factor $g$, answering affirmatively the conjecture of Chow and Lin (\emph{Networks, 44:194-202, 2004}). More precisely, we prove that \textsc{Ring Traffic Grooming} for fixed $g\geq 1$ and \textsc{Path Traffic Grooming} for fixed $g\geq 2$ are \textsc{APX}-complete. That is, they do not accept a PTAS unless $\textsc{P}=\textsc{NP}$. Both results rely on the fact that finding the maximum number of edge-disjoint triangles in a graph (and more generally cycles of length $2g+1$ in a graph of girth $2g+1$) is \textsc{APX}-complete. On the other hand, we provide a polynomial-time approximation algorithm for \textsc{Ring} and \textsc{Path Traffic Grooming}, based on a greedy cover algorithm, with an approximation ratio independent of $g$. Namely, the approximation guarantee is $\mathcal{O}(n^{1/3} \log2 n)$ for any $g \geq 1$, $n$ being the size of the network. This is useful in practical applications, since in backbone networks the grooming factor is usually greater than the network size. As far as we know, this is the first approximation algorithm with this property. Finally, we improve this approximation ratio under some extra assumptions about the request graph.},
sorte = "conf-int" 
}

@InProceedings{AmRe07,
author = {O. Amini and B. Reed},
title = {List Colouring Constants of Triangle Free Graphs},
booktitle = {IV Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 07)},
pages = {6p},
year = {2007},
address = {Puerto Varas, Chile},
month = nov,
url={http://www.dii.uchile.cl/~lagos07/},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/AmRe07.pdf},
abstract = {In this paper we prove a result about vertex list colourings which in particular shows that a conjecture of the second author (1999, Journal of Graph Theory 31, 149-153) is true for triangle free graphs of large maximum degree. There exists a constant K such that the following holds: Given a graph G and a list assignment L to vertices of G, assigning a list of available colours L(v) to each vertex $v\in V(G)$, such that $|L(v)| = K\Delta/\log(\Delta)$ , then there exists a proper list colouring of vertices of G provided that for each colour c, the graph induced by all vertices v with c ∈ L(v) is triangle free and has maximum degree at most \Delta.},
sorte = "conf-int" 
}

@InProceedings{ArLi07,
author = {J. Araujo and C. {Linhares Sales}},
title = {Teorema de Haj\'os para Colora\c c\~ao Ponderada},
booktitle = {XXXIX Simp\'osio Brasileiro de Pesquisa Operacional},
OPTcrossref = {},
OPTkey = {},
pages = {5p},
year = {2007},
OPTeditor = {},
OPTvolume = {XXXX},
OPTnumber = {XXXX},
series = {},
address = {Fortaleza, Brazil},
month = {August},
OPTorganization = {},
publisher = {},
OPTannote = {},
abstract = {The vertex coloring problem is one of the most investigated problems in graph theory because of it models several important practical problems and because of its inherent difficulty: it is NP-hard to determine the chromatic number of a graph. The Theorem of Haj´os [Haj´os, 1961] shows a necessary and sufficient condition to a graph have chromatic number at least k: the graph must contain a k-constructible subgraph. A graph is k-constructible if it can be obtained from a complete graph by successively applying a set of well-defined operations. In this article, we prove that the weighted coloring problem [Guan and Zhu, 1997] admits a version of the Haj´os’ Theorem and so we show a necessary and sufficient condition to a weighted graph G have weighted chromatic number at least k, for any integer k. },
OPTurl = {},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/AL07.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays={BR},
sorte = "conf-nat" 
}

@inproceedings{BMBM07,
author = {N. {Ben Ali} and J. Moulierac and B. Belghith and M. Moln\'ar},
title = {{mQMA: multi-constrained QoS Multicast Aggregation}},
booktitle = {IEEE Global Telecommunications Conference (IEEE GLOBECOM 2007)},
pages = {5p},
year = {2007},
address = {Washington DC, USA},
month = nov,
PDF={ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/benali07mqma.pdf},
ABSTRACT = {Traditional IP Multicast has been proposed in order to manage group communications over the Internet in a bandwidth efficient manner. Although this proposition has been well studied, there are still some problems for its deployment. In this paper, we propose a new algorithm mQMA that deals with two important problems of traditional IP multicast, i.e., multicast forwarding state scalability and multi-constrained QoS routing. The algorithm mQMA builds few trees and maintains few forwarding states for the groups thanks to the technique of multicast tree aggregation, which allows several groups to share the same delivery tree. Moreover, the algorithm mQMA builds trees satisfying multiple QoS constraints. We show, trough extensive simulations, that mQMA leverages the same QoS performances as Mamcra which is the main multi-constrained multicast routing algorithm. Moreover, mQMA reduces dramatically the number of trees to be maintained.},
sorte = "conf-int",

}

@inproceedings{BeCo07,
author = {J-C. Bermond and M. Cosnard },
title = { Minimum number of wavelengths equals load in a DAG without internal cycle},
booktitle = {Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International},
pages = {1-10},
year = {2007},
month = mar,
address = {Long Beach, CA, U.S.A.},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BC07.pdf},
sorte = "conf-int" 
}

@InProceedings{BGP07,
author = {J-C. Bermond and F. Giroire and S. P\'erennes },
title = {Design of Minimal Fault Tolerant On-Board Networks : Practical constructions},
booktitle = {14th International Colloquium on Structural Information and Communication Complexity (SIROCCO 07)},
OPTcrossref = {},
OPTkey = {},
pages = {261-273},
year = {2007},
OPTeditor = {},
volume = {4474},
OPTnumber = {},
series = {Lecture Notes in Computer Sciences},
address = {Castiglioncello, Italy},
month = jun,
OPTorganization = {},
publisher = {},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BGP07.pdf},
sorte = "conf-int" 
}

@inproceedings{BHHL07,
author = {J-C. Bermond and F. Havet and F. Huc and C. {Linhares-Sales}},
title = {Allocation de fr\'equences et coloration impropre des graphes hexagonaux pond\'er\'es},
booktitle={Neuvi\`emes Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel'07)},
address={Ile d'Ol\'eron, France},
month=may,
pages = {53-56},
year={2007},
URL={http://algotel2007.labri.fr/},
PDF={ftp://ftp-sop.inria.fr/mascotte/Publications/BHH+07.pdf},
abstract = {Motiv\'es par un probl\`eme d'allocation de fr\'equences, nous \'etudions la coloration impropre des graphes pond\'er\'es et plus particuli\`erement des graphes hexagonaux pond\'er\'es. Nous donnons des algorithmes d'approximation pour trouver de telles colorations.},
sorte = "conf-nat" 
}

@InProceedings{BLS07b,
author = {S. Bessy and N. Lichiardopol and J.-S. Sereni},
title = {Two proofs of {B}ermond-{T}homassen conjecture for regular tournaments},
booktitle = {Proceedings of the sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications},
publisher={Elsevier},
series={Electronic Notes in Discrete Mathematics},
volume={28},
pages = {47--53},
year = {2007},
URL = {http://kam.mff.cuni.cz/~cs06/},
PDF={http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B75GV-4N5M9FJ-8-1&_cdi=13104&_user=4895301&_orig=browse&_coverDate=030.000000010.0000002007&_sk=999719999&view=c&wchp=dGLbVtz-zSkzk&md5=e44f5e8def6ba8f2a790b29f6bb262e6&ie=/sdarticle.pdf},
sorte = "conf-int",

}

@INPROCEEDINGS{BBR07a,
author = "E. Birmele and J. A. Bondy and B. Reed",
title = "Brambles, Prisms and Grids",
booktitle = "Proceedings of a Conference in Memory of Claude Berge, Graph Theory in Paris",
pages = "37-44",
address = "Basel",
publisher = "Birkhauser",
year = 2007,
sorte = "conf-int",

}

@inproceedings{CLC07,
author = {R. Chand and L. Liquori and M. Cosnard},
title = {Improving Resource Discovery in the Arigatoni Overlay Network},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
booktitle = {20th International Conference on Architecture of Computing Systems (ARCS 2007)},
volume = {4415},
year = {2007},
pages = {98--111},
address = {Zurich, Switzerland},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/arcs-07.pdf},
sorte = "conf-int",

}

@inproceedings{ChRe07,
author = {A. Chattopadhyay and B. Reed},
title = {Properly 2-Colouring Linear Hypergraphs},
booktitle = {11th Intl. Workshop on Randomization and Computation (RANDOM 2007)},
address = {Princeton University, NJ, USA},
year = {2007},
pages = {395-408},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {4627},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/ChRe07.pdf},
sorte = "conf-int",

}

@INPROCEEDINGS{CLC07b,
author = {M. Cosnard and L. Liquori and R. Chand},
title = {Virtual Organizations in Arigatoni},
booktitle = {DCM, International Workshop on Developpment in Computational Models},
year = {2007},
volume = {171},
OPTnumber = {3},
series = {Electronique Notes in Theoretical Computer Science},
pages = {55--75},
url = {http://dx.doi.org/10.1016/j.entcs.2006.11.035},
pdf = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/dcm-06.pdf},
sorte = "conf-int",

}

@inproceedings{SSL07,
author = {A. {da Silva} and A. {da Silva} and C. {Linhares-Sales}},
title = {Largura em \'Arvore de Grafos Planares Livres de Ciclos Pares Induzidos},
booktitle={XXXIX Congresso da Sociedade Brasileira de Pesquisa Operacional (SBPO 2007)},
address={Fortaleza, Brazil},
month=aug,
year={2007},
URL={http://www.sobrapo.org.br/simposios/XXXIX/indexxxxix.htm},
sorte = "conf-nat",

}

@InProceedings{Dal07a,
author = {O. Dalle},
title = {Component-based Discrete Event Simulation Using the Fractal Component Model},
booktitle = {{AI}, Simulation and Planning in High Autonomy Systems (AIS)-Conceptual Modeling and Simulation (CMS) Joint Conference },
OPTcrossref = {},
OPTkey = {},
pages = {213--218},
year = {2007},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
address = {Buenos Aires, AR},
month = feb,
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Dal07a.pdf},
sorte = "conf-int" 
}

@InProceedings{DaMr07,
author = {O. Dalle and C. Mrabet},
title = {An {I}nstrumentation {F}ramework for component-based simulations based on the {S}eparation of {C}oncerns paradigm},
booktitle = {Proc. of 6th EUROSIM Congress (EUROSIM'2007)},
OPTcrossref = {},
OPTkey = {},
pages = {10p},
year = {2007},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
address = {Ljubljana, Slovenia},
month = sep,
OPTorganization = {},
OPTpublisher = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/DaMr07.pdf},
OPTannote = {},
sorte = "conf-int" 
}

@InProceedings{DaWa07,
author = {O. Dalle and G. Wainer},
title = {An Open Issue on Applying Sharing Modeling Patterns in DEVS},
booktitle = {Proc. of the DEVS Workshop of the Summer Computer Simulation Conference (SCSC'07)},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
year = {2007},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
address = {San Diego, CA},
month = jul,
OPTorganization = {},
OPTpublisher = {},
note = {Short paper},
OPTannote = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/DaWa07.pdf},
sorte = "conf-int" 
}

@InProceedings{Dal07b,
OPTkey = {},
author = {O. Dalle},
title = {The {OSA} {P}roject: an {E}xample of {C}omponent {B}ased {S}oftware {E}ngineering {T}echniques {A}pplied to {S}imulation},
booktitle = {Proc. of the Summer Computer Simulation Conference (SCSC'07)},
pages = {1155--1162},
address = {San Diego, CA, USA},
month = jul,
year = {2007},
note = {Invited paper},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Dal07b.pdf},
OPTannote = {},
sorte = "conf-int" 
}

@INPROCEEDINGS{DBH07,
OPTauthor = {Gr{\'e}goire Danoy and Pascal Bouvry and L. Hogie},
author = {G. Danoy and P. Bouvry and L. Hogie},
title = {Coevolutionary Genetic Algorithms for Ad Hoc Injection Networks Design Optimization},
booktitle = {Proceedings of the IEEE Congress on Evolutionary Computation - CEC},
pages = {8p},
year = {2007},
publisher = {IEEE},
address = {Singapore},
month = sep,
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/DBH07.pdf},
abstract = {When considering realistic mobility patterns, nodes in mobile ad hoc networks move in such a way that the networks most often get divided in a set of disjoint partitions. This presence of partitions is an obstacle to communication within these networks. Ad hoc networks are generally based on technologies allowing nodes in a geographical neighborhood to communicate for free, in a P2P manner. These technologies include IEEE802.11 (Wi-Fi), Bluetooth, etc. In most cases a communication infrastructure is available. It can be a set of access point as well as GMS/UMTS network. The use of such an infrastructure is billed, but it permits distant nodes to get in communication, through what we call "bypass links". The objective of our work is to improve the network connectivity by defining a set of long distance connections. To do this we consider the number of bypass links, as well as the two properties that build on the "small-world" graph theory: the clustering coefficient, and the characteristic path length. A fitness function, used for genetic optimization, is processed out of these three metrics. In this paper we investigate the use of two Coevolutionary Genetic Algorithms (LCGA and CCGA) and compare their performance to a generational and a steadystate genetic algorithm (genGA and ssGA) for optimizing one instance of this topology control problem and present evidence of their capacity to solve it.},
url = {http://www.google.fr/url?sa=t&source=web&ct=res&cd=1&ved=0CBcQFjAA&url=ftp%3A%2F%2Fftp-sop.inria.fr%2Fmascotte%2FPublications%2FDBH07.pdf&ei=kR3oS56bE9D8_AaxkqDNBA&usg=AFQjCNEbq-NiZZVsEBA_5YSlnrlB_RbRAg},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@inproceedings{AGM07a,
author = { A. Ferreira and A. Goldman and J. Monteiro},
title = {On the evaluation of shortest journeys in dynamic networks},
booktitle = {Proceedings of the 6th {IEEE} International Symposium on Network Computing and Applications},
pages = {3--10},
month = jul,
year = {2007},
address = {Cambridge, MA, USA},
note = {Invited Paper},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/AGM07a.pdf},
abstract = {The assessment of routing protocols for wireless networks is a difficult task, because of the networks’ highly dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and low earth orbit (LEO) satellites systems, have more predictable dynamics, as the temporal variations in the network topology are somehow deterministic, which may make them easier to study. The graph theoretic model – the evolving graphs – was proposed to help capture the dynamic behavior of these networks, in view of the construction of least cost routing and other algorithms. Our recent experiments showed that evolving graphs have all the potentials to be an effective and powerful tool in the development of routing protocols for dynamic networks. In this paper, we evaluated the shortest journey evolving graph algorithm when used in a routing protocol for MANETs. We use the NS2 network simulator to compare this first implementation to the four well known protocols, namely AODV, DSR, DSDV, and OLSR. In this paper we present simulation results on the energy consumption of the nodes. We also included other EG protocol, namely EGForemost , in the experiments.},
sorte = "inv-conf" 
}

@inproceedings{AGM07b,
author = {A. Ferreira and A. Goldman and J. Monteiro},
title = { Using Evolving Graphs Foremost Journey to Evaluate Ad-Hoc Routing Protocols},
booktitle = {Proceedings of 25th Brazilian Symposium on Computer Networks ({SBRC}'07)},
month = jun,
year = {2007},
pages = {17--30},
address = {Belem, Brazil},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/AGM07b.pdf},
abstract = {The performance evaluation of routing protocols for ad hoc networks is a difficult task. However, a graph theoretic model – the evolving graphs – was recently proposed to help capture the behavior of dynamic networks with fixed-schedule behavior. Our recent experiments showed that evolving graphs have all the potentials to be an effective and powerful tool in the development of routing protocols for dynamic networks. In this paper, we design a new con- gestion avoidance mechanism and a modified end-to-end delay metric in order to improve the evolving graph based routing protocol proposed previously. We use the NS2 network simulator to compare this new version to the three proto- cols provided by NS2, namely AODV, DSR and DSDV, and to OLSR, which is included in the experiments for the first time.},
sorte = "conf-nat" 
}

@inproceedings{FuGi07,
author = {E. Fusy and F. Giroire},
title = {Estimating the number of active flows in a data stream over a sliding window},
booktitle = {Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics},
year = {2007},
editor = {Appelgate, David},
publisher = {SIAM Press},
pages = {223-231},
note = {Proceedings of the New Orleans Conference},
pdf = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/FuGi07.pdf},
abstract = {A new algorithm is introduced to estimate the number of distinct flows (or connections) in a data stream. The algorithm maintains an accurate estimate of the number of distinct flows over a sliding window. It is simple to implement, parallelizes optimally, and has a very good trade-off between auxiliary memory and accuracy of the estimate: a relative accuracy of order $1/\sqrt{m}$ requires essentially a memory of order $m\ln(n/m)$ words, where $n$ is an upper bound on the number of flows to be seen over the sliding window. For instance, a memory of only $64 kB$ is sufficient to maintain an estimate with accuracy of order $4$ percents for a stream with several million flows. The algorithm has been validated both by simulations and experimentations on real traffic. It proves very efficient to monitor traffic and detect attacks.},

}

@inproceedings{Gal07a,
title = {Analysis and optimization of {MAC} with constant size congestion window for {WLAN}},
author = {J. Galtier},
booktitle = {The Second International Conference on Systems and Networks Communications (ICSNC'07)},
pages = {6p},
address = {Cap Esterel, French Riviera, France},
year = {2007},
month = aug,
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Gal07.pdf},
sorte = "conf-int" 
}

@InProceedings{GoHu07a,
author = {C. Gomes and G. Huiban},
title = {Multiobjective Analysis in Wireless Mesh Networks},
booktitle = {International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)},
pages = {103--108},
year = {2007},
month = oct,
organization = {Bogazici University, Istanbul, Turkey},
publisher = {IEEE},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/GoHu07a.pdf},
url = {http://www.cmpe.boun.edu.tr/mascots07/},
abstract = {Wireless Mesh Networks is a scalable and cost-effective solution for next-generation wireless networking. In the present work, we consider the Round Weighting Problem (RWP). It solves a joint routing and scheduling problem to attend a given demand subjected to the multiaccess interferences. We proposed a multiobjective approach that deal with two objective functions. The first one is to minimize the load over the routers, it increases the security in case of failure and minimizes the cost with memory in each node. The second objective is to minimize the time of the communication. We aim to identify the Pareto frontier of the problem. The Column generation method was used to solve efficiently the test instances. We make experiments with some networks with different number of sinks. Our approach captures the trade-off generated by using these two conflicting objective functions. This relationship corresponds to a convex piecewise linear function.},
sorte = "conf-int" 
}

@INPROCEEDINGS{GMRR07a,
author = {C. Gomes and C. Molle and P. Reyes and H. Rivano},
title = {Placement Optimal de points d'acc\`es dans les r\'eseaux radio maill\'es},
booktitle = {Neuvi\`emes Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel'07)},
pages = {117-120},
year = {2007},
address = {Ile d'Ol\'eron, France},
month = may,
abstract = {Cet article pr\'esente un mod\`ele lin\'eaire permettant de placer un nombre minimum de points d'acc\`es dans un r\'eseau radio maill\'e ({\em Wireless Mesh Network}). Connaissant la topologie du r\'eseau, le probl\`eme est de d\'eterminer le nombre minimum de points d'acc\`es reli\'es \`a Internet n\'ecessaires pour que la demande de chaque routeur soit satisfaite. Afin de prendre en compte les interf\'erences spatiales d\^ues \`a la technologie radio, le temps est d\'ecoup\'e en intervalles r\'eguliers au cours desquels un ensemble de liens n'interf\'erant pas deux \`a deux est d\'etermin\'e, ce qui engendre une limitation de la capacit\'e des liens en fonction de leur activation dans le temps. Le placement se fait ensuite de mani\`ere \`a assurer \`a chaque n\oe{}ud le d\'ebit d\'esir\'e en r\'egime permanent.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/GMRR07.pdf},
url = {http://algotel2007.labri.fr/},
sorte = "conf-nat" 
}

@INPROCEEDINGS{GMRR07b,
author = {C. Gomes and C. Molle and P. Reyes and H. Rivano},
title = {Models for Optimal Wireless Mesh Network Design},
booktitle = {The 22nd European Conference on Operational Research (EURO XXII)},
pages = {1p},
year = {2007},
address = {Prague},
month = jul,
abstract = {Wireless Mesh Networks (WMNs) are cost-effective and provide an appealing answer to connectivity issues of ubiquituous computing. Unfortunately, wireless networks are known for strong waste of capacity when their size increase. Thus, a key challenges for network operators is to provide guaranteed quality of service. Maximizing network capacity requires to optimize jointly the Access Points (AP) placement, the routing and the link scheduling taking interferences into account. We present MILP models for computing an optimal 802.11a or 802.16 WMN design providing max-min bandwidth guaranty.},
sorte = "conf-sa" 
}

@InProceedings{HHMR07,
AUTHOR="F. Havet and J. {van den Heuvel} and C. McDiarmid and B. Reed",
TITLE="List colouring squares of planar graphs",
booktitle ="European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2007)",
PAGES = "515-519",
volume = {29},
series = {Electronic Notes in Discrete Mathematics},
year = "2007",
address = "Sevilla, Spain",
month = sep,
pdf={ftp://ftp-sop.inria.fr/mascotte/Publications/HH+07.pdf},
sorte = "conf-int",

}

@InProceedings{HuDa07,
author = {G. Huiban and P. Datta},
title = {Multi-Metrics Reconfiguration in Core WDM Networks},
booktitle = {International Workshop on the Design of Reliable Communication Networks (DRCN)},
year = {2007},
pages = {8p},
month = oct,
publisher = {SEE},
address = {La Rochelle, France},
url = {http://www.drcn.org/drcn07/},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/HuDa07.pdf},
abstract = {We consider the reconfiguration problem in multifiber WDM optical networks. In a network with evolving traffic, the virtual topology may not remain optimal, leading to degradation of network performance. However, adapting the virtual topology to the changing traffic may lead to service disruption. This optimization problem hence captures the trade-off between network performance and number of reconfigurations applied to the virtual topology. This trade-off is considered via a multi-metrics approach. The above problem is solved through a Mixed Integer Linear Programming (MILP) formulation with a multivariate objective function. However the problem is NP-hard and such an approach is unable to solve large problem instances in a reasonable time. Therefore we propose a simulated annealing (SA) based heuristic approach for solving problems of higher complexity. We compare the performance and the computation time of solving the MILP model and the heuristic approach considering different test instances. We can find near optimal solutions for instances of medium complexity using the MILP model. The SA scheme can be used as a heuristic to arrive at near optimal solutions when the run-time of the MILP becomes practically infeasible. It also appears that the trade-off's involved in the reconfiguration problem cannot be left aside, as a little flexibility with respect to one metric allows to drastically improve the quality of the solution with respect to other metrics.},
sorte = "conf-int",

}

@inproceedings{INS07,
sorte = "conf-int",
author = {D. Ilcinkas and N. Nisse and D. Soguet},
title = {The Cost of Monotonicity in Distributed Graph Searching},
booktitle = {Proceedings of the 11th International Conference on Principles of Distributed Systems (OPODIS)},
year = {2007},
month = dec,
pages = {415-428},
booktitle = {OPODIS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {4878},
address = {Guadeloupe, France},
abstract = {Blin {\it et al.} (2006) proposed a distributed protocol that ena\-bles the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. {\it Unknown} means that the searchers are provided no {\it a priori} information about the graph. However, the strategy that is actually performed lacks of an important property, namely the monotonicity. That is, the clear part of the graph can decrease at some steps of the execution of the protocol. As a consequence, the protocol of Blin {\it et al.} is executed in exponential time. Nisse and Soguet (2007) proved that, in order to ensure the smallest number of searchers to clear any $n$-node graph in a monotone way, it is necessary and sufficient to provide $\Theta(n \log n)$ bits of information to the searchers. This paper deals with the smallest number of searchers that are necessary and sufficient to monotoneously clear any unknown graph in a decentralized manner. The distributed graph searching problem considers a team of searchers that is aiming at clearing any connected contaminated graph. The clearing of the graph is required to be {\it connected}, i.e., the clear part of the graph must remain permanently connected, and {\it monotone}, i.e., the clear part of the graph only grows. The {\it search number} $\mcs(G)$ of a graph $G$ is the smallest number of searchers necessary to clear $G$ in a monotone connected way in centralized settings. We prove that $\Theta(\frac{n}{\log n}\, \mcs(G))$ searchers are necessary and sufficient to clear any unknown $n$-node graph $G$ in a monotone connected way, in decentralized settings. More precisely, we prove that, no distributed protocol using less than $\Omega(\frac{n}{\log n}\, \mcs(G))$ searchers can clear any unknown synchronous $n$-node graph $G$ in a monotone connected way. Moreover, we propose a distributed protocol that allows $O(\frac{n}{\log n}\, \mcs(G))$ searchers to clear any unknown asynchronous $n$-node graph $G$ in a monotone connected way.},
url = {http://www.informatik.uni-trier.de/~ley/db/conf/opodis/opodis2007.html},
pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Opodis07.ps} 
}

@inproceedings{KaRe07,
author = {K. Kawarabayashi and B. Reed},
title = {Computing crossing number in linear time.},
booktitle = {39th ACM Symposium on Theory of Computing (STOC 2007)},
address = {San Diego, CA, USA},
month = jun,
year = {2007},
pages = {382-390},
sorte = "conf-int",

}

@InProceedings{KiRe07,
AUTHOR="A. King and B. Reed",
TITLE="Asymptotics of the chromatic number for quasi-line graphs",
booktitle ="European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2007)",
volume = {29},
pages = {327-331},
series = {Electronic Notes in Discrete Mathematics},
year = "2007",
address = "Sevilla, Spain",
month = sep,
sorte = "conf-int",

}

@inproceedings{LiCo07b,
author = {L. Liquori and M. Cosnard},
title = {{Logical Networks: Towards Foundations for Programmable Overlay Networks and Overlay Computing Systems}},
publisher = {Springer},
volume = {4912},
pages = {90-107},
series = {Lecture Notes in Computer Science},
booktitle = {3rd Symposium on Trustworthy Global Computing (TGC 2007)},
year = {2007},
month = nov,
address = {Sophia Antipolis, France},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/tgc-07.pdf},
sorte = "conf-int" 
}

@inproceedings{LiCo07a,
author = {L. Liquori and M. Cosnard},
title = {Weaving Arigatoni with a Graph Topology},
booktitle = {International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2007)},
publisher = {IEEE Computer Society Press},
address = {Papeete, French Polynesia},
year = {2007},
pages = {8p},
month = nov,
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/advcomp-07.pdf},
sorte = "conf-int" 
}

@inproceedings{MaNi07,
sorte = "conf-int",
author = {F. Mazoit and N. Nisse},
title = {Monotonicity of Non-deterministic Graph Searching},
booktitle = {Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG)},
year = {2007},
month = jun,
pages = {33-44},
volume = {4769},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
address = {Dornburg, Germany},
abstract = {In graph searching, a team of searchers is aiming at capturing a fugitive moving in a graph. In the initial variant, called \emph{invisible graph searching}, the searchers do not know the position of the fugitive until they catch it. In another variant, the searchers permanently know the position of the fugitive, i.e. the fugitive is visible. This latter variant is called \emph{visible graph searching}. A search strategy that catches any fugitive in such a way that, the part of the graph reachable by the fugitive never grows is called \emph{monotone}. {\it A priori}, monotone strategies may require more searchers than general strategies to catch any fugitive. This is however not the case for visible and invisible graph searching. Two important consequences of the monotonicity of visible and invisible graph searching are: (1) the decision problem corresponding to the computation of the smallest number of searchers required to clear a graph is in NP, and (2) computing optimal search strategies is simplified by taking into account that there exist some that never backtrack. Fomin \emph{et al.} (2005) introduced an important graph searching variant, called \emph{non-determi\-nistic graph searching}, that unifies visible and invisible graph searching. In this variant, the fugitive is invisible, and the searchers can query an oracle that permanently knows the current position of the fugitive. The question of the monotonicity of non-deterministic graph searching is however left open. In this paper, we prove that non-deterministic graph searching is monotone. In particular, this result is a unified proof of monotonicity for visible and invisible graph searching. As a consequence, the decision problem corresponding to non-determinisitic graph searching belongs to NP. Moreover, the exact algorithms designed by Fomin \emph{et al.} do compute optimal non-deterministic search strategies.},
url = {http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2007.html},
pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/WG07.ps} 
}

@inproceedings{NPC07a,
author = {N. Nepomuceno and P. R. Pinheiro and A. L. V. Coelho},
OPTauthor = {Napole{\~a}o Nepomuceno and Pl{\'a}cido Rog{\'e}rio Pinheiro and Andr{\'e} L. V. Coelho},
title = {Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms},
booktitle = {7th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP)},
address= {Valencia, Spain},
year = {2007},
pages = {154-165},
url = {http://dx.doi.org/10.1007/978-3-540-71615-0_14},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/NPC07.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {BR},
sorte = "conf-int",

}

@inproceedings{NPC07b,
author = {N. Nepomuceno and P. R. Pinheiro and A. L. V. Coelho},
OPTauthor = {Napole{\~a}o Nepomuceno and Pl{\'a}cido Rog{\'e}rio Pinheiro and Andr{\'e} L. V. Coelho},
title = {Combining Metaheuristics and Integer Linear Programming: A Hybrid Methodology Applied to the Container Loading Problem},
booktitle = {XX Concurso de Teses e Disserta\c{c}\~oes (CTD)},
address= {Rio de Janeiro, Brazil},
year = {2007},
pages = {2028-2032},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/NPC07b.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},
x-pays = {BR},
sorte = "conf-nat",

}

@InProceedings{NiSo07,
sorte = "conf-nat",
author = {N. Nisse and D. Soguet},
title = {Strat\'egies d'encerclement avec information},
booktitle = {9\`emes Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel)},
year = {2007},
pages ={49-52},
url = {http://algotel2007.labri.fr/},
pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Algotel07.pdf},
abstract = {Dans le cadre de l'algorithmique r\'eparti dans les r\'eseaux, l'efficacit\'e d'un algorithme d\'epend tr\`es fortement de la connaissance du r\'eseau, disponible {\it a priori}. Tr\`es souvent, cette connaissance {\it a priori} est de nature qualitative (taille du r\'eseau, son diam\`etre, etc.). Fraigniaud {\it et al.} (2006) ont introduit une mesure quantitative de la complexit\'e d'une t�che r\'epartie dans un r\'eseau. Etant donn\'e un probl\`eme r\'eparti, cette mesure, {\it la taille d'oracle}, consiste en le plus petit nombre de bits d'information dont doit disposer l'algorithme pour r\'esoudre le probl\`eme efficacement. Nous nous int\'eressons \`a la taille d'oracle permettant de r\'esoudre efficacement {\it l'encerclement} dans les graphes. L'encerclement dans les r\'eseaux vise \`a r\'ealiser la capture d'un fugitif invisible, arbitrairement rapide et omniscient, par une \'equipe d'agents mobiles, dans un r\'eseau. La strat\'egie d'encerclement est calcul\'ee en temps r\'eel, par les agents eux m�mes, et doit v\'erifier les trois propri\'et\'es suivantes: (1)~{\it connexit\'e} : la zone nettoy\'ee doit toujours �tre connexe, (2)~{\it monotonie} : la zone nettoy\'ee ne doit jamais �tre recontamin\'ee, et (3)~{\it optimalit\'e} : le nombre d'agents utilis\'es doit �tre le plus petit possible. Les deux premi\`eres contraintes assurent des communications s\'ecuris\'ees entre les agents, ainsi qu'un temps de nettoyage polynomial en la taille du r\'eseau. La troisi\`eme propri\'et\'e assure une taille minimum des ressources utilis\'ees. La seule connaissance, concernant le r\'eseau, dont les agents disposent {\it a priori}, est mod\'elis\'ee par un {\it oracle} qui r\'epartit sur les n{\oe}uds du r\'eseau une cha�ne de bits d'information. Nous prouvons que la taille d'oracle pour r\'esoudre l'encerclement est $O(n \log n)$ bits, avec $n$ la taille du r\'eseau, et que cette borne est optimale. Plus pr\'ecis\'ement, nous proposons un \'etiquetage des sommets, de taille $O(n \log n)$ bits, et un protocole r\'eparti utilisant cet \'etiquetage. Ce protocole permet \`a une \'equipe d'agents, dont la m\'emoire est de taille $O(\log n)$ bits, de nettoyer le r\'eseau de fa�on optimale monotone et connexe. Ce protocole am\'eliore le protocole propos\'e par Blin {\it et al.} (2006) qui ne dispose d'aucune information {\it a priori} et, de ce fait, n\'ecessite un temps de nettoyage exponentiel. De plus, nous prouvons qu'il n'existe pas de protocole r\'eparti utilisant un oracle de taille $o(n \log n)$ bits qui permette de nettoyer tous les r\'eseaux de fa�on optimale monotone et connexe.},

}

@inproceedings{NiSo07,
sorte = "conf-int",
author = {N. Nisse and D. Soguet},
title = {Graph Searching with Advice},
booktitle = {Proceedings of the 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO)},
year = {2007},
month = jun,
pages = {51-65},
volume = {4474},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
address = {Castiglioncello, Italy},
abstract = {Fraigniaud {\it et al.} (2006) introduced a new measure of difficulty for a distributed task in a network. The smallest {\it number of bits of advice} of a distributed problem is the smallest number of bits of information that has to be available to nodes in order to accomplish the task efficiently. Our paper deals with the number of bits of advice required to perform efficiently the graph searching problem in a distributed setting. In this variant of the problem, all searchers are initially placed at a particular node of the network. The aim of the team of searchers is to capture an invisible and arbitrarily fast fugitive in a monotone connected way, i.e., the cleared part of the graph is permanently connected, and never decreases while the search strategy is executed. We show that the minimum number of bits of advice permitting the monotone connected clearing of a network in a distributed setting is $O (n \log n)$, where $n$ is the number of nodes of the network, and this bound is tight. More precisely, we first provide a labelling of the vertices of any graph $G$, using a total of $O(n \log n)$ bits, and a protocol using this labelling that enables clearing $G$ in a monotone connected distributed way. Then, we show that this number of bits of advice is almost optimal: no protocol using an oracle providing $o(n \log n)$ bits of advice permits the monotone connected clearing of a network using the smallest number of searchers.},
url = {http://www.informatik.uni-trier.de/~ley/db/conf/sirocco/sirocco2007.html},
pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Sirocco07.ps} 
}

@INPROCEEDINGS{SaZe07,
AUTHOR = {I. Sau and J. Zerovnik},
TITLE = {Optimal Permutation Routing on Mesh Networks},
BOOKTITLE = {Proc. of International Network Optimization Conference (INOC 2007)},
YEAR = {2007},
pages = {6p},
address = {Spa, Belgium},
month = apr,
PDF={ftp://ftp-sop.inria.fr/mascotte/Publications/SZ07.pdf},
abstract = {Permutation routing is used as one of the standard tests of routing algorithms. In the permutation routing problem, each processor is the origin of at most one packet and the destination of no more than one packet. The goal is to minimize the number of time steps required to route all packets to their respective destinations. Wireless mesh networks are based on plane tessellations that divide the area into cells and give rise to triangular, square, and hexagonal grids. In this paper we study permutation routing algorithms that work on finite convex subgraphs of basic grids, under the store-and-forward $\Delta$-port model. We consider algorithms implemented independently at each node, without assuming any global knowledge about the network. I.e., distributed algorithms. We describe optimal distributed permutation routing algorithms for subgraphs of triangular and square grids that need $\ell_{max}$ (the maximum over the length of the shortest path of all packets) routing steps, and show that there is no such algorithm on the hexagonal grids. Furthermore, we show that these algorithms are oblivious and translation invariant.},
sorte = "conf-int",

}

@TechReport{ACN07,
author = {O. Amini and D. Coudert and N. Nisse},
title = {Some Results on Non-deterministic Graph Searching in Trees},
institution = {INRIA},
type = {Research Report},
number = {INRIA-00174965},
year = {2007},
month = sep,
sorte = "Rapport",
url = {http://hal.inria.fr/inria-00174965/},
pdf = {http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/17/50/12/PDF/AminiCoudertNisse-RR.pdf&docid=175012},
abstract = {Pathwidth and treewidth of graphs have been extensively studied for their important structural and algorithmic aspects. Determining these parameters is NP-complete in general, however it becomes linear time solvable when restricted to some special classes of graphs. In particular, many algorithms have been proposed to compute efficiently the pathwidth of trees. Skodinis (2000) proposes a linear time algorithm for this task. Pathwidth and treewidth have also been studied for their nice game-theoretical interpretation, namely graph searching games. Roughly speaking, graph searching problems look for the smallest number of searchers that are sufficient to capture a fugitive in a graph. Fomin et al. (2005) define the non-deterministic graph searching that provides an unified approach for the pathwidth and the treewidth of a graph. Given q>=0, the q-limited search number, denotes by s_q(G), of a graph G is the smallest number of searchers required to capture an invisib le fugitive in G, such that the searchers are allowed to know the position of the fugitive at most q times. Roughly, s_0(G) corresponds to the pathwidth of a graph G, and s_\infty(G) corresponds to its treewidth. Fomin et al. proved that computing s_q(G) is NP-complete in general, and left open the complexity of the problem restricted to the class of trees. This paper studies this latter problem. On one hand, we give tight upper bounds on the number of queries required to search a tree when the number of searchers is fixed. We also prove that this number can be computed in linear time when two searchers are used. On the other hand, our main result consists in the design of a simple polynomial time algorithm that computes a 2-approximation of s_q(T), for any tree T and any q>=0. This algorithm becomes exact if q=0 or 1, which proves that the decision problem associated to s_1 is polynomial in the class of trees.},

}

@TechReport{AEH07,
author = {O. Amini and L. Esperet and J. {van den Heuvel}},
title = {Frugal Colouring of Graphs},
year = {2007},
month = may,
institution = {INRIA},
number = {6178},
type = {Research Report},
pdf = {http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/14/43/61/PDF/RR-6178.pdf&docid=144361},
url = {http://hal.inria.fr/inria-00144318/fr/},
abstract = {A $k$-frugal colouring of a graph~$G$ is a proper colouring of the vertices of~$G$ such that no colour appears more than~$k$ times in the neighbourhood of a vertex. This type of colouring was introduced by Hind, Molloy and Reed in 1997. In this paper, we study the frugal chromatic number of planar graphs, planar graphs with large girth, and outerplanar graphs, and relate this parameter with several well-studied colourings, such as colouring of the square, cyclic colouring, and $L(p,q)$-labelling. We also study frugal edge-colourings of multigraphs.},
sorte = "Rapports" 
}

@TechReport{AHHT07,
author = {O. Amini and F. Havet and F. Huc and S. Thomass\'e},
title = {{WDM} and Directed Star Arboricity},
year = {2007},
month = jan,
institution = {INRIA},
number = {6179},
type = {Research Report},
url = {http://hal.inria.fr/inria-00132396/},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/AHHT07.pdf},
abstract = {Motivated by wavelength assignment for multicast in star networks, introduced by Brandt and Gonzalez [BrGo05], we study the directed star arboricity (dst) of digraphs in terms of their degree. Among other results we prove that every digraph $D$ with maximum indegree $k$ satisfies $dst(D)\leq 2k+1$, which is one short of the lower bound $2k$. Significant improvements of the bounds proposed in~\cite{BrGo05} are given.},
sorte = "Rapports" 
}

@TechReport{AMNT07,
author = {O. Amini and F. Mazoit and N. Nisse and S. Thomass\'e},
title = {Submodular partition functions},
institution = {LABRI, Univ. Bordeaux},
number = {RR-1427-07},
note = {Submitted in SIAM J. discrete Maths.},
year = {2007},
month = apr,
url = {},
pdf = {http://www.labri.fr/perso/lepine/Rapports_internes/RR-142707.pdf.gz},
abstract = { we propose a new proof of the duality between the bramble-number of a graph and its tree-width. This proof is based on a new definition of submodularity on partition functions which naturally extends the usual one on set functions. The technique simplifies the proof of bramble/tree-width duality. The proof does not rely on Menger's theorem, and thus simplifies the proof of the bramble/tree-width duality. It provides a dual for matroid tree-width and one can also derive all known dual notions of other classical width-parameters from it.} 
}

@TechReport{APS07b,
author = {O. Amini and S. P\'erennes and I. Sau},
title = {Hardness and Approximation of Traffic Grooming},
year = {2007},
month = jun,
institution = {INRIA},
number = {6236},
type = {Research Report},
url = {http://hal.inria.fr/inria-00158341/fr/},
pdf = {http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/15/98/87/PDF/RR-groupage.pdf&docid=159887},
abstract = {Traffic grooming is a central problem in optical networks. It refers to pack low rate signals into higher speed streams, in order to improve bandwidth utilization and reduce network cost. In WDM networks, the most accepted criterion is to minimize the number of electronic terminations, namely the number of SONET Add-Drop Multiplexers (ADMs). In this article we focus on ring and path topologies. On the one hand, we provide the first inapproximability result for \textsc{Traffic Grooming} for fixed values of the grooming factor $g$, answering affirmatively the conjecture of Chow and Lin (\emph{Networks, 44:194-202, 2004}). More precisely, we prove that \textsc{Ring Traffic Grooming} for fixed $g\geq 1$ and \textsc{Path Traffic Grooming} for fixed $g\geq 2$ are \textsc{APX}-complete. That is, they do not accept a PTAS unless $\textsc{P}=\textsc{NP}$. Both results rely on the fact that finding the maximum number of edge-disjoint triangles in a graph (and more generally cycles of length $2g+1$ in a graph of girth $2g+1$) is \textsc{APX}-complete. On the other hand, we provide a polynomial-time approximation algorithm for \textsc{Ring} and \textsc{Path Traffic Grooming}, based on a greedy cover algorithm, with an approximation ratio independent of $g$. Namely, the approximation guarantee is $\mathcal{O}(n^{1/3} \log^2 n)$ for any $g \geq 1$, $n$ being the size of the network. This is useful in practical applications, since in backbone networks the grooming factor is usually greater than the network size. As far as we know, this is the first approximation algorithm with this property. Finally, we improve this approximation ratio under some extra assumptions about the request graph.},
sorte = "Rapports" 
}

@TechReport{ASS07,
author = {O. Amini and I. Sau and S. Saurabh},
title = {Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem},
year = {2007},
month = jun,
institution = {INRIA},
number = {6237},
type = {Research Report},
url = {http://hal.inria.fr/inria-00157970/en/},
pdf = {http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/15/96/85/PDF/RR-6237.pdf&docid=159685},
abstract = {In this paper we initiate the study of finding an induced subgraph of size at most $k$ with minimum degree at least $d$. We call this problem \sc Minimum Subgraph of Minimum Degree $_{\geq d}$ (MSMD$_d$). For $d=2$, it corresponds to finding a shortest cycle of the graph. The problem is strongly related to the \textsc{Dense $k$-Subgraph} problem and is of interest in practical applications. We show that the {\sc MSMS}$_d$ is fixed parameter intractable for $d\geq 3$ in general graphs by showing it to be W[1]-hard by a reduction from {\sc Multi-Color Clique}. On the algorithmic side, we show that the problem is fixed parameter tractable in graphs which excluded minors and graphs with bounded local tree-width. In particular, this implies that the problem is fixed parameter tractable in planar graphs, graphs of bounded genus and graphs with bounded maximum degree.},
sorte = "Rapports" 
}

@TechReport{BCC+07,
author = {J-C. Bermond and I. Caragiannis and D. Coudert and C. Gomes and I. {Guerin-Lassous} and G. Huiban and C. Molle and I. Sau},
title = {Algorithmic solutions for critical resource sharing: second year},
institution = {IST FET AEOLUS, Integrated Project IST-015964},
year = {2007},
number = {Deliverable 2.2.2},
pdf = {http://aeolus.ceid.upatras.gr/sub-projects/deliverables/D222.pdf},
sorte = "Rapports" 
}

@TechReport{BCL07,
author = {J-C. Bermond and D. Coudert and B. Leveque},
title = {Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring},
institution = {hal},
year = {2007},
OPTkey = {},
OPTtype = {},
number = {inria-00175795},
OPTaddress = {},
month = oct,
OPTnote = {},
OPTannote = {},
url = {http://hal.inria.fr/inria-00175795/en/},
abstract = {Traffic grooming in a WDM network consists of assigning to each request (lightpath) a wavelength with the constraint that a given wavelength can carry at most C requests or equivalently a request uses at most 1/C of the bandwidth. C is known as the grooming ratio. A request (lightpath) need two SONET add-drop multiplexers (ADMs) at each end node~; using grooming different requests can share the same ADM. The so called traffic grooming problem consists of minimizing the total number of ADMs to be used (in order to reduce the overall cost of the network). Here we consider the traffic grooming problem in WDM unidirectional rings with all-to-all uniform unitary traffic. This problem has been optimally solved for specific values of the grooming ratio, namely C=2,3,4,5,6. In this paper we present various simple constructions for the grooming problem providing good approximation of the total number of ADMs. For that we use the fact that the problem corresponds to a partition of the edges of the complete graph into subgraphs, where each subgraph has at most C edges and where the total number of vertices has to be minimized.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCL07-inria-00175795.pdf},
sorte = "Rapports" 
}

@TechReport{BPP07,
author = {J-C. Bermond and V. Papadopoulou and E. Pitoura},
title = {Subproject2: Resource Management Report on the activities of the second year},
institution = {IST FET AEOLUS, Integrated Project IST-015964},
year = {2007},
number = {Deliverable 2.O.2},
pdf = {http://aeolus.ceid.upatras.gr/sub-projects/deliverables/D202.pdf},
sorte = "Rapports" 
}

@TechReport{CHPV07,
author = {D. Coudert and F. Huc and F. Peix and M-E. Voge},
title = {On Minimizing the Average Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints},
institution = {hal},
year = {2007},
OPTkey = {},
OPTtype = {},
number = {inria-00175813},
OPTaddress = {},
month = oct,
OPTnote = {},
OPTannote = {},
url = {http://hal.inria.fr/inria-00175813/en/},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CHPV07-inria-00175813.pdf},
abstract = {The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Division Multiplexing Network (WDM), it expresses that some links and nodes may fail simultaneously. The reliability of a connection therefore depends on the number of SRRGs through which it is routed. Consequently, this number has to be minimized. This problem has been proved NP-complete and hard to approximate in general, even when routing a single request. Some heuristics using shortest paths have already been designed, however the cost (the usual routing cost, not in term of SRRG) was not part of the objective. In this paper we study the problem of minimizing a linear combination of the average number of SRRG per paths and the cost of the routing. The main result of our work is a column generation formulation that allows to solve the problem of maximizing the reliability of a set of connection requests in MPLS/WDM mesh networks with SRRGs while keeping the cost of the routing low.},
sorte = "Rapports" 
}

@TechReport{CPRV07,
author = {D. Coudert and S. Perennes and H. Rivano and M-E. Voge},
title = {Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues},
institution = {HAL},
year = {2007},
OPTkey = {},
OPTtype = {},
number = {inria-00175143},
OPTaddress = {},
month = sep,
OPTnote = {},
OPTannote = {},
abstract = {In this paper, we characterize polynomial cases for several combinatorial optimization problems in the context of multilayer networks with shared risk resource groups. },
url = {http://hal.inria.fr/inria-00175143/fr/},
pdf = {http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/17/51/43/PDF/sir07.pdf&docid=175143},
sorte = "Rapports" 
}

@TechReport{CoSe07,
author = {D. Coudert and J-S. Sereni},
title = {Characterization of graphs and digraphs with small process number},
institution = {INRIA},
year = {2007},
OPTkey = {},
type = {Research Report},
number = {6285},
OPTaddress = {},
month = sep,
OPTnote = {http\string://hal.inria.fr/inria-00171083/fr/},
OPTannote = {},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/RR-6285.pdf},
url = {http://hal.inria.fr/inria-00171083/fr/},
abstract = {The process number of a digraph has been introduced as a tool to study rerouting issues in WDM networks. We consider the recognition and the characterization of (di)graphs with process number at most two.},
sorte = "Rapports" 
}

@TechReport{Gal07b,
author = {J. Galtier},
title = {Tournament {MAC} with constant size congestion window for {WLAN}},
institution = {INRIA},
year = 2007,
number = {RR-6396},
month = dec,
abstract = {In the context of radio distributed networks, we present a generalized approach for the Medium Access Control (MAC) with fixed congestion window. Our protocol is quite simple to analyze and can be used in a lot of different situations. We give mathematical evidence showing that our performance is tight, in the sense that no protocol with fixed congestion window can do better. We also place ourselves in the WiFi/WiMAX framework, and show experimental results enlightening collision reduction of 14{\%} to 21{\%} compared to the best known other methods. We show channel capacity improvement, and fairness considerations.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/Gal07b.pdf},
url = {http://hal.inria.fr/inria-00195965},
sorte = "Rapports" 
}

@techreport{GCI+07,
author = {F. Giroire and J. Chendrashekar and G. Iannaccone and T. Karagiannis and K. Papagiannaki and E. Schooler and N. Taft},
title = {Inside the Forbidden City: A look at End-Host Traffic inside a Modern Enterprise},
institution = {Intel Research},
type = {Technical Report},
year = {2007},
%pdf = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/GCI+07.pdf},
abstract = {},

}

@techreport{GCT+07,
author = {F. Giroire and J. Chendrashekar and N. Taft and G. Iannaccone and T. Karagiannis and K. Papagiannaki and E. Schooler},
title = {The Case For Personalizing End-Host Detectors.},
institution = {Intel Research},
type = {Technical Report},
year = {2007},
%pdf = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/GCT+07.pdf},
abstract = {},

}

@TECHREPORT{GoRi07,
author = {C. Gomes and H. Rivano},
title = {Fair Joint Routing and Scheduling Problem in Wireless Mesh Networks},
institution = {INRIA},
year = {2007},
type = {Research Report},
number = {6198},
month = may,
abstract = {There is an increasing interest in using Wireless Mesh Networks (WMNs) as broadband backbone for next-generation wireless networking. WMNs is a scalable and cost-effective solution. Industrial standards groups are revisiting the existing protocols and they work enhanced specifications for WMNs. Wireless Mesh Networks (WMNs) are cost-effective and provide an appealing answer to connectivity issues of ubiquituous computing. One of the key challenges of WMNs is to provide guaranteed quality of service that network operator could claim. In this paper, we address the Fair Round Weighting Problem (F_RWP) and present mixed integer linear programming models for computing an optimal routing and link scheduling. We have considered two kind of transmissions scenarios, burst transmission and permanent regime, and their specific settings.},
url = {https://hal.inria.fr/inria-00148957},
pdf = {http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/14/90/25/PDF/RR-6198.pdf&docid=149025},
sorte = "Rapports" 
}

@TechReport{HKS07,
author = {F. Havet and R. Kang and J.-S. Sereni},
title = {Improper colouring of unit disk graphs},
year = {2007},
month = may,
institution = {INRIA},
number = {6206},
type = {Research Report},
pages = {38 p.},
url= {https://hal.inria.fr/inria-00150464},
pdf = {https://hal.inria.fr/action/open_file.php?url=https://hal.inria.fr/docs/00/15/06/27/PDF/RR-6206.pdf&docid=150627},
abstract = {Motivated by a satellite communications problem, we consider a generalised colouring problem on unit disk graphs. A colouring is k -improper if no vertex receives the same colour as k +1 of its neighbours. The k -improper chromatic number chi_k (G) is the least number of colours needed in a k -improper colouring of a graph G. The main sub ject of this work is analysing the complexity of computing chi_k for the class of unit disk graph and some related classes, e.g. hexagonal graphs and interval graphs. We show NP-completeness in many restricted cases and also provide both positive and negative approximability results. Due to the challenging nature of this topic, many seemingly simple questions remain: for example, it remains open to determine the complexity of computing k for unit interval graphs.},
sorte = "Rapports",

}

@TechReport{HaTh07,
author = {F. Havet and S. Thomasse},
title = {Complexity of $(p,1)$-total labelling},
year = {2007},
month = sep,
institution = {INRIA},
number = {6305},
type = {Research Report},
url= {https://hal.inria.fr/inria-00173438},
pdf = {https://hal.inria.fr/action/open_file.php?url=https://hal.inria.fr/docs/00/17/52/95/PDF/RR-6305.pdf&docid=175295},
abstract = {A \it $(p,1)$-total labelling of a graph $G=(V,E)$ is a total coloring $L$ from $V\cup E$ into $0,\dots ,l$ such that $|L(v)-L(e)|\geq p$ whenever an edge $e$ is incident to a vertex $v$. The minimum $l$ for which $G$ admits a $(p,1)$-total labelling is denoted by $\lambda_p(G)$. The case $p=1$ corresponds to the usual notion of total colouring, which is NP-hard to calculate even for cubic bipartite graphs [MDSA94]. We assume $p\geq 2$ in this paper. It is easy to show that $\lambda_p(G)\geq \Delta +p-1$, where $\Delta$ is the maximum degree of $G$. Moreover, when $G$ is bipartite, $\Delta +p$ is an upper bound for $\lambda_p(G)$, leaving only two possible values. In this paper, we completely settle the computational complexity of deciding whether $\lambda_p(G)$ is equal to $\Delta +p-1$ or to $\Delta +p$ when $G$ is bipartite. This is trivial when $\Delta \leq p$, polynomial when $\Delta =3$ and $p=2$, and NP-complete in the remaining cases.},
sorte = "Rapports",

}

@TechReport{KLNP07,
author = "R. Klasing and Z. Lotker and A. Navarra and S. P\'erennes",
title = "From Balls and Bins to Points and Vertices",
institution = "LaBRI",
number = "RR-1437-07",
month = oct,
year = "2007",
type = "Technical Report",
sorte = "Rapports",

}

@TechReport{LBCC07,
author = {L. Liquori and D. Borsetti and C. Casetti and C. Chiasserini},
title = {{Overlay Networks for Vehicular Networks}},
institution = {Politecnico di Torino},
OPTnumber = {to be given},
type = {Research Report},
year = {2007},
sorte = "Rapports" 
}

@TechReport{MPR07,
author = {C. Molle and F. Peix and H. Rivano},
title = {Cross-Layer Design for Wireless Mesh Networks Using Column Generation},
institution = {INRIA},
year = {2007},
number = {6448},
month = dec,
url = {http://hal.inria.fr/inria-00193420/en/},
pdf = {http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/19/34/20/PDF/Rapport.pdf&docid=193420},
abstract = {Wireless Mesh Networks (WMNs) have become an interesting answer for broadband wireless networking. Cross-layer optimization problems for WMNs deployment and management are necessary and challenging. In this paper we focus on jointly optimizing routing and link scheduling in a single-channel wireless mesh network, in order to maximize fair network throughput or equivalently minimize time period. Our approach is based on a path/configuration linear formulation of the joint routing and scheduling problem, which is solved by column generation with two auxiliary programs to generate new paths and configurations. The method is validated on small topologies from an optimal node/arc formulation, and simulations are then done on random and grid topologies.},
sorte = "Rapports",

}

@TechReport{CLN07,
author = {P. Nain and C. Casetti and L. Liquori},
title = {{A Stochastic Model of an Arigatoni Overlay Computer }},
institution = {Politecnico di Torino},
number = {to be given},
type = {Research Report},
year = {2007},
sorte = "Rapports" 
}

@TechReport{Tei07a,
author = {S. Teigen},
title = {Distributing {OSA} Simulations using {FractalRMI}},
institution = {INRIA},
year = {2007},
OPTkey = {},
type = {Technical Report},
OPTnumber = {},
OPTaddress = {},
OPTmonth = {},
note = {Unpublished, internal document.},
OPTannote = {},
sorte = "Rapports",

}

@Misc{GoHu07b,
author = {C. Gomes and G. Huiban},
title = {Multiobjective Analysis in Wireless Mesh Networks using a Column Generation Approach},
howpublished = {Ecole ResCom 2007 Reseaux Autonomes et Internet du Futur},
year = {2007},
note = {Poster},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/GoHu07b.pdf},
sorte = "conf-sa" 
}

@Book{Dic06,
author = {{\"O}ren, T. and Torres, L. and Amblard, F. and Belaud, J.-P. and Caussanel, J. and Dalle, O. and Duboz, R. and Ferrarini, A. and Frydman, C. and Hamri, E.-A. M. and Hill, D. and Naamane, A. and Siron, P. and Tranvouez, E. and Zacharewicz, G.},
title = {{M}odeling and {S}imulation {D}ictionary: {E}nglish-{F}rench-{T}urkish},
publisher = {Prof. Tuncer \"Oren},
year = {2006},
pages = {298p},
ISBN = {2-95247470-2},
sorte = "livres-chap",

}

@phdthesis{Gir06b,
author = {F. Giroire},
title = {R\'eseaux, algorithmique et analyse combinatoire de grands ensembles},
year = {2006},
month = {November},
school = {Universit\'e Paris VI},
url = {http://algo.inria.fr/papers/pdf/Giroire06b.pdf},
pdf = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/Gir06b.pdf},
abstract = {Two classes of algorithmic problems motivated by network thematics are studied in this thesis. The first problem is to estimate the number of distinct elements or cardinality of very large multisets while using a very small amount of auxiliary memory. The number of applications of this very simple question is surprisingly important. In particular, we may mention the detection of some kinds of attack against networks. We proposed new families of algorithms to answer this problem. They are validated by mathematical analysis as well as by simulations with real traffic. The second problem is the design of efficient on-board networks in satellites. On one hand these networks must be able to tolerate a given number of mechanical failures of their components. On the other hand they should be of small sizes because of their extremely high cost. We introduced a new class of networks and proposed minimal constructions in lots of cases.},

}

@PhdThesis{Hui06,
author = {G. Huiban},
title = {The reconfiguration problem in multifiber WDM networks},
school = {University of Nice Sophia Antipolis \& Federal University of Minas Gerais},
year = {2006},
month = {July},
sorte = "these",
pdf = {http://tel.archives-ouvertes.fr/docs/00/12/36/64/PDF/these_g_huiban.pdf},
url = {http://tel.archives-ouvertes.fr/tel-00123437/fr/},
abstract = {An optical telecommunication network is configured to transmit a given traffic in order to meet a given objective. However the demand changes with time and infrastructure development. The reconfiguration problem stands in this context. It consists in being able to alter the configuration of the network to adjust it to the new traffic. It is generally necessary to interrupt partially or totally the traffic to reconfigure a network. Considering the amount of data flowing on it, it may not be possible to regularly stop the network, even for a short amount of time. Many parameters have to be taken into account to find out a good solution, and many metrics can be used in order to measure the quality of a solution. In a first part, we focus on the reconfiguration problem as a mono-objective optimization problem. We propose a mathematical model representing the reconfiguration problem. However solving exactly the proposed model may require a high computational time. We also propose a greedy and a simulated annealing heuristics. Depending on the metric optimized, the solutions have different characteristics. The greedy algorithm is fast and provides decent solutions whereas the simulated annealing algorithm provides solutions competing with the optimal ones. In a second part, we focus on the multiobjective aspect of the reconfiguration problem. We consider at the same time different metrics and search for a set of solutions representing different interesting trade-offs instead of a unique solution. We propose an algorithm based on our mathematical formulation. We also adapt an evolutionary algorithm. The proposed methods succeed in finding different interesting trade-offs. Giving a little flexibility with respect to a metric generally allows to significantly improve the solutions with respect to the other metrics.} 
}

@phdthesis{Ser06,
sorte = "these",
author = {J.-S. Sereni},
title = {Colorations de graphes et applications},
year = {2006},
month = {Juillet},
school = {\'Ecole doctorale STIC, Universit\'e de Nice-Sophia Antipolis},

}

@PhdThesis{Vog06c,
sorte = "these",
author = {M-E. Voge},
title = {Optimisation des r\'eseaux de t\'el\'ecommunications: r\'eseaux multicouches, tol\'erance aux pannes et surveillance de trafic},
school = {\'Ecole doctorale STIC, Universit\'e de Nice-Sophia Antipolis},
year = {2006},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
month = {November 17},
OPTnote = {},
OPTannote = {},
POSTSCRIPT = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/these_mevoge.pdf},
URL = {} 
}

@InBook{BRS+06,
sorte = "livres-chap",
author = {J. Bang-Jensen and B. Reed and M. Schacht and R. \v{S}\'amal and B. Toft and U. Wagner},
OPTALTeditor = {},
title = {Topics in Discrete Mathematics, Dedicated to Jarik Ne\v{s}et\v{r}il on the Occasion of his 60th birthday},
chapter = {On six problems posed by Jarik Ne\v{s}et\v{r}il},
publisher = {Springer},
year = {2006},
OPTkey = {},
volume = {26},
OPTnumber = {},
series = {Algorithms and Combinatorics},
OPTtype = {},
address = {Berlin},
edition = {{M. Klazar, J. Kratochvil, M. Loebl, J. Matousek, R. Thomas and P. Valtr}},
OPTmonth = {},
pages = {613--627},
OPTnote = {},
OPTannote = {} 
}

@INBOOK{BeCo06,
chapter = {VI.27, Grooming},
pages = {494-496},
title = { Handbook of Combinatorial Designs (2nd edition)},
publisher = {Chapman \& Hall- CRC Press, editors C.J. Colbourn and J.H. Dinitz},
year = {2006},
editor = { },
author = {J-C. Bermond and D. Coudert},
volume = {42},
series = {Discrete mathematics and Applications},
month = nov,
abstract = {State-of-the-art on traffic grooming with a design theory approach},
isbn = {1584885068},
sorte = "livres-chap",
pdf = {http://www-sop.inria.fr/members/Jean-Claude.Bermond//PUBLIS/BeCo06.pdf},
url = {http://www.cems.uvm.edu/~dinitz/hcd.html} 
}

@InCollection{AAG+06,
author = {S. Alouf and E. Altman and J. Galtier and J.-F. Lalande and C. Touati},
title = {Quasi-Optimal Resource Allocation in Multi-Spot {MFTDMA} Satellite Networks},
booktitle = {Combinatorial Optimization in Communication Networks},
pages = {325-366},
publisher = {Kluwer Academic Publishers},
year = {2006},
editor = {M. Cheng and Y. Li and D.-Z. Du},
chapter = {12},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/AAG+06.pdf},
sorte = "livres-chap",

}

@Article{BBDF06,
author = {D. Bartha and P. Berthom\'e and M. Diallo and A. Ferreira},
title = {Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations},
journal = {Discrete Optimization},
year = {2006},
OPTkey = {},
volume = {3},
number = {3},
pages = {195--205},
month = {September},
sorte = "rev-int",
OPTnote = {},
OPTannote = {} 
}

@article{BCG+06,
author = {J. Becker and Z. Csizmadia and J. Galtier and A. Laugier and J. Szab\'o and L. Szeg\H{o}},
title = {An integer programming approach to routing in Daisy networks},
journal = {Networks},
year = {2006},
volume = {47},
number = {2},
pages={116--121},
sorte = "rev-int",
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/BCG+06.pdf},

}

@article{BGKM+06a,
author= { J-C. Bermond and J. Galtier and R. Klasing and N. Morales and S. P\'erennes },
title= { Hardness and approximation of Gathering in static radio networks },
journal= { Parallel Processing Letters },
year= { 2006 },
volume= { 16 },
number= { 2 },
pages= { 165--183 },
sorte = "rev-int",
pdf= { http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BGK+06c.pdf },
abstract={In this paper, we address the problem of gathering information in a specific node (or \emph{sink}) of a radio network, where interference constraints are present. We take into account the fact that, when a node transmits, it produces interference in an area bigger than the area in which its message can actually be received. The network is modeled by a graph; a node is able to transmit one unit of information to the set of vertices at distance at most $\dt$ in the graph, but when doing so it generates interference that does not allow nodes at distance up to $\di$ ($\di \ge \dt$) to listen to other transmissions. Time is synchronous and divided into time-steps in each of which a round (set of non-interfering radio transmissions) is performed. We give general lower bounds on the number of rounds required to gather into a sink of a general graph, and present an algorithm working on any graph, with an approximation factor of 4. We also show that the problem of finding an optimal strategy for gathering is \textsc{NP-hard}, for any values of $\di$ and $\dt$. If $\di>\dt$, we show that the problem remains hard when restricted to the uniform case where each vertex in the network has exactly one piece of information to communicate to the sink. },

}

@article{BHT06,
author={J-C. Bermond and F. Havet and D. T\'oth},
title={Fault tolerant on board networks with priorities},
journal={Networks},
year={2006},
pages={9--25},
volume={47},
number={1},
sorte = "rev-int",
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BHT06.pdf},
abstract={We consider on-board networks in satellites interconnecting entering signals (inputs) to amplifiers (outputs). The connections are made via expensive switches, each of which has four available links. The paths connecting inputs to outputs should be link-disjoint. Some of the input signals, called priorities, must be connected to the amplifiers which provide the best quality of service (that is to some specific outputs). In practice, amplifiers are prone to fail and the faults cannot be repaired. Therefore, extra outputs have to be built into the network to ensure that every input can be routed to operational outputs. Given three integers, $n$, $p$, and $f$, we would like to design a low cost network (where the network cost is proportional to the total number of switches) such that it is possible to route all $n$ inputs to $n$ operational amplifiers, and to route the $p$ priorities to the $p$ best quality amplifiers for any set of $f$ faulty and $p$ best-quality amplifiers. Let $R(n,p,f)$ be the minimum number of switches of such a network. We prove here that $R(n,p,f)\leq \frac{n+f}{2} \lceil \log_2 p \rceil +\frac{5}{2}(n-p) +g(f)$ with $g$ a function depending only on $f$. We then compute $R(n,p,f)$ exactly for a few small values of $p$ and $f$. },

}

@article{BBH06,
author={Bessy, S. and Birmel\'e, E. and F. Havet},
title={Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree},
journal = {Journal of Graph Theory},
year = {2006},
number = {4},
volume = {53},
pages = {315--332},
sorte = "rev-int",
PDF = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5364.pdf},
URL = {http://www.inria.fr/rrrt/rr-5364.html},

}

@article{MR2223630,
sorte = "rev-int",
AUTHOR = {Bondy, A. and Shen, J. and Thomass\'e, S. and {T}homassen, C.},
TITLE = {Density conditions for triangles in multipartite graphs},
JOURNAL = {Combinatorica},
VOLUME = {26},
YEAR = {2006},
NUMBER = {2},
PAGES = {121--131},

}

@article{DLL06,
sorte = "rev-int",
author = {D. J. Dougherty and P. Lescanne and L. Liquori},
title = {Addressed Term Rewriting Systems: Application to a Typed Object Calculus},
JOURNAL = {Journal of Mathematical Structures in Computer Science},
year = {2006},
volume = {16},
number = {4},
pages = {667--709},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/mscs-06.pdf} 
}

@article{FNP06,
sorte = "rev-int",
author= { M. Flammini and A. Navarra and S. P\'erennes },
title= { The Real Approximation Factor of the {MST} heuristic for the Minimum Energy Broadcasting },
journal= { ACM Journal of Experimental Algorithmics },
note= { (Special Issue associated to the 4th International Workshop on Efficient and Experimental Algorithms (WEA 2005)) },
year= { 2006 },
volume= { 11 },
OPTnumber = {une seule issue dans l'annee},
pages= { 1--13 },

}

@Article{Hav06a,
author = {F. Havet},
title = {Repartitors, selectors and superselectors},
journal = {Journal of Interconnection Networks},
year = {2006},
pages = {391--415},
volume ={7},
number={3},
sorte = "rev-int",
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/Hav06a.pdf},

}

@Article{HaSe06,
author={F. Havet and J.-S. Sereni},
title={Improper choosability of graphs and maximum average degree},
journal={Journal of Graph Theory},
volume={52},
number={3},
pages={181--199},
year={2006},
sorte = "rev-int",
PDF={http://kam.mff.cuni.cz/~sereni/Articles/HaSe06.pdf},

}

@Article{McRe06,
sorte = "rev-int",
author = {C. McDiarmid and B. Reed},
title = {Concentration for self-bounding functions and an inequality of talagrand},
journal = {Random Structures and Algorithms},
year = {2006},
OPTkey = {},
volume = {29},
OPTnumber = {},
pages = {549--557},
OPTmonth = {},
OPTannote = {} 
}

@Article{MGM06a,
sorte = "rev-int",
author = {J. Moulierac and A. Guitton and M. Moln\'ar},
title = {{Hierarchical Aggregation of Multicast Trees in Large Domains}},
journal = {Journal of Communications (JCM)},
year = {2006},
volume = {6},
number = {1},
pages = {33--44},
series= {Academy Publisher},
month = {September},
PDF={ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/moulierac06hierarchical.pdf},
ABSTRACT={Multicast tree aggregation is a technique that reduces the control overhead and the number of states induced by multicast. The main idea of this protocol is to route several groups to the same distribution tree in order to reduce the total number of multicast forwarding states. In this article, we show that this technique cannot be applied to large domains. Indeed, when the number of border routers is large, actual tree aggregation protocols are unable to find similar groups to aggregate to the same tree. However, by dividing the domain into several smaller sub-domains, we prove that it is possible to achieve important savings. A hierarchical protocol is designed to interconnect the trees of the sub-domains together. While previous protocols cannot cope with more than 25 border routers, our protocol still shows significant benefits for domains with 200 border routers.} 
}

@Article{TAG06,
author = {C. Touati and E. Altman and J. Galtier},
title = {Generalized {Nash} Bargaining Solution for bandwidth allocation},
journal = {Computer Networks},
year = {2006},
volume = {50},
pages = {3242--3263},
sorte = "rev-int",
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/TAG06.pdf},

}

@InProceedings{AGT06,
author = {E. Altman and J. Galtier and C. Touati},
title = {Fair power and transmission rate control in wireless networks},
booktitle = {The Third Annual Conference on Wireless On demand Network Systems and Services},
pages = {134--143},
year = {2006},
sorte = "conf-int",
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/AGT06.pdf},

}

@inproceedings{ABG+06,
author={O. Amini and J-C. Bermond and F. Giroire and F. Huc and S. P\'erennes},
title={Design of Minimal Fault Tolerant Networks: Asymptotic Bounds},
booktitle={Huiti\`emes Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel'06)},
address={Tr\'egastel, France},
month={May},
year={2006},
pages={37--40},
sorte = "conf-nat",
URL={http://algotel2006.lip6.fr/},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond//PUBLIS/ABG+06.pdf},
abstract = {This paper deals with the design of on board networks in satellites (also called Traveling wave tube Amplifiers (TWTA)). These networks should connect signals arriving on some ports of the satellite to amplifiers, even in case of failures of some amplifiers. They are made of links and expensive switches each with 4 links. So, the aim is to design networks having as few switches as possible and satisfying the following property: \emph{there exist $p$ edge-disjoint paths from the $p$ signals arriving on $p + \lambda$ ports (inputs) to any set of $p$ amplifiers (outputs) chosen from the $p+k$ total number of outputs}. We call such networks \emph{valid $(p,\lambda,k)$-networks} and want to determine the minimum number of switches $\mathcal{N}(p, \lambda,k)$ of such networks. By symmetry we suppose $\lambda \leq k$. We give tight results for small values of $k$ and asymptotic results when $k = O(\log p)$ which are tight when $k=\Theta(\lambda)$ and when $\lambda=0$.},

}

@inproceedings{ACD+06,
sorte = "conf-int",
author = {M. Ancona and W. Cazzola and S. Drago and G. Quercini},
title = {Visualizing and Managing Network Topologies via Rectangular Dualization},
booktitle = {ISCC '06: Proceedings of the 11th IEEE Symposium on Computers and Communications},
year = {2006},
pages = {1000-1005},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
abstract = {Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks the condition that objects and their interoccurring relations are represented by means of a planar graph. However, only 4-connected triangulated planar graphs admit a rectangular dual. In this paper we present a linear time algorithm to optimally construct a rectangular layout for a general class of graphs and we discuss a variety of application fields where this approach represents an helpful support for visualization tools.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/ACD+06.pdf},

}

@InProceedings{BLS06b,
sorte = "conf-sa",
author = {R. Bayon and N. Lygeros and J.-S. Sereni},
title = {Orders with ten elements are circle orders},
booktitle = {Book of abstracts of the nineteenth Panhellenic Conference/Summer School on nonlinear science and complexity},
year = {2006},
pages = {1p},
address={Thessaloniki},
month={July},
URL={http://web.auth.gr/nonlinear/home_page_en.php},
PDF={http://www.math.upatras.gr/~crans/Book of Abstracts-4.pdf},

}

@inproceedings{BCLV06,
author = {D. Benza and M. Cosnard and L. Liquori and M. Vesin},
title = {Arigatoni: Overlaying Internet via Low Level Network Protocols},
booktitle = {JVA: John Vincent Atanasoff International Symposium on Modern Computing},
publisher = {IEEE},
year = {2006},
pages = {82--91},
sorte = "conf-int",
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/jva-06.pdf} 
}

@inproceedings{BCY06,
title={Gathering algorithms on paths under interference constraints},
author={J-C. Bermond and R. Corr\^ea and M-L. Yu},
year={2006},
booktitle={6th Conference on Algorithms and Complexity},
address={Roma, Italy},
series={Lecture Notes in Computer Science},
volume={3998},
pages={115--126},
month={May},
sorte = "conf-int",
URL={http://www.dsi.uniroma1.it/~ciac/},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond//PUBLIS/BCY06.pdf},

}

@INPROCEEDINGS{BCCP06,
author = {J-C. Bermond and M. Cosnard and D. Coudert and S. P\'erennes},
title = {Optimal Solution of the Maximum All Request Path Grooming Problem},
booktitle = {Advanced International Conference on Telecommunications (AICT)},
year = {2006},
pages = {6p},
publisher = {IEEE},
sorte = "conf-int",
abstract = {We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the maximum number of connections which can be established in a path of size $N$, where each arc has a capacity or bandwidth $C$ (grooming factor). We present a greedy algorithm to solve the problem and an explicit formula for the maximum number of requests that can be groomed. In particular, if $C = s(s 1)/2$ and $N > s(s-1)$, an optimal solution is obtained by taking all the requests of smallest length, that is of length 1 to $s$. However this is not true in general since anomalies can exist. We give a complete analysis and the exact number of such anomalies.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCCP-AICT06.pdf} 
}

@INPROCEEDINGS{BCMS06,
author = {J-C. Bermond and D. Coudert and X. Mu{\~n}oz and I. Sau},
title = {Traffic Grooming in Bidirectional {WDM} ring networks},
booktitle = {IEEE-LEOS ICTON / COST 293 GRAAL},
year = {2006},
volume = {3},
pages = {19-22},
month = jun,
abstract = {We study the minimization of ADMs (Add-Drop Multiplexers) in Optical WDM Networks with Bidirectional Ring topology considering symmetric shortest path routing and all-to-all unitary requests. We insist on the statement of the problem, which had not been clearly stated before in the bidirectional case. Optimal solutions had not been found up to date. In particular, we study the case $C = 2$ and $C = 3$ (giving either optimal constructions or near-optimal solutions) and the case $C = k(k 1)/2$ (giving optimal decompositions for specific congruence classes of $N$). We state a general Lower Bound for all the values of $C$ and $N$, and we improve this Lower Bound for $C=2$ and $C=3$ (when $N=4t 3)$. We also include some comments about the simulation of the problem using Linear Programming.},
sorte = "conf-int",
optbooktitle = {IEEE/COST 293 annual conference on GRAphs and ALgorithms in communication networks},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCMS-ICTON-GRAAL06.pdf} 
}

@inproceedings{BGK+06b,
author={J-C. Bermond and J. Galtier and R. Klasing and N. Morales and S. P\'erennes},
title={Gathering in specific radio networks},
booktitle={Huiti\`emes Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel'06)},
address={Tr\'egastel, France},
month={May},
year={2006},
pages={85--88},
sorte = "conf-nat",
URL={http://algotel2006.lip6.fr/},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond//PUBLIS/BGK+06b.pdf},

}

@InProceedings{BGK+06a,
author = {J-C. Bermond and J. Galtier and R. Klasing and N. Morales and S. P\'erennes},
title = {Hardness and approximation of Gathering in static radio networks},
booktitle = { FAWN06 },
year = {2006},
Pages={75--79},
address = {Pisa, Italy},
month = {March},
sorte = "conf-int",
URL={http://ares.insa-lyon.fr/fawn2006/},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond//PUBLIS/BGK+06.pdf},

}

@inproceedings{BFNV06b,
sorte = "conf-int",
author = {L. Blin and P. Fraigniaud and N. Nisse and S. Vial},
title = {Distributed Chasing of Network Intruders},
booktitle = {Proceeding of the 13th International Colloquium on Structural Information and Communication Complexity (SIROCCO)},
year = {2006},
month = jul,
pages = {70-84},
volume = {4056},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
address = {Chester, UK},
abstract = {This paper addresses the graph searching problem in a distributed setting. We describe a distributed protocol that enables searchers with logarithmic size memory to clear any network, in a fully decentralized manner. The search strategy for the network in which the searchers are launched is computed online by the searchers themselves \emph{without knowing the topology of the network in advance}. It performs in an asynchronous environment, i.e., it implements the necessary synchronization mechanism in a decentralized manner. In every network, our protocol performs a connected strategy using at most $k+1$ searchers, where $k$ is the minimum number of searchers required to clear the network in a monotone connected way, computed in the centralized and synchronous setting.},
url = {http://www.informatik.uni-trier.de/~ley/db/conf/sirocco/sirocco2006.html},
pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/sirocco06.pdf} 
}

@InProceedings{BFNV06a,
sorte = "conf-nat",
author = {L. Blin and P. Fraigniaud and N. Nisse and S. Vial},
title = {Encerclement r\'eparti d'un fugitif dans un r\'eseau par des agents mobiles.},
booktitle = {8\`emes Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel)},
year = {2006},
pages ={89-92},
url = {http://algotel2006.lip6.fr/},
pdf = {},
abstract = {\emph{L'encerclement} dans les graphes est l'un des outils les plus populaires pour analyser la recherche, par une \'equipe d'agents, d'un fugitif omniscient, arbitrairement rapide et invisible dans un r\'eseau. Les solutions existantes au probl\`eme de l'encerclement dans les graphes souffrent cependant d'un s\'erieux inconv\'enient : elles sont toutes centralis\'ees et supposent que les agents \'evoluent dans un environnement synchrone. En particulier : (1) la strat\'egie d'encerclement dans un r\'eseau est calcul\'ee partant d'une connaissance compl\`ete du r\'eseau, et (2) les mouvements des agents sont control\'es par un m\'ecanisme centralis\'e qui d\'ecide \`a chaque \'etape quel agent doit se d\'eplacer et quel mouvement il doit r\'ealiser. Cet article traite de l'encerclement dans les graphes r\'ealis\'e de mani\`ere r\'epartie. Nous pr\'esentons un protocole r\'eparti qui permet \`a des agents, dont la m\'emoire est de taille logarithmique en la taille du r\'eseau, de nettoyer le r\'eseau de facon d\'ecentralis\'ee. La mani\`ere dont les agents se d\'eplacent pour r\'ealiser la strat\'egie d'encerclement est calcul\'ee en temps r\'eel par les agents eux-m\^eme, {\emph sans qu'ils ne connaissent la topologie du r\'eseau \`a l'avance}. Tout cela est r\'ealis\'e dans un environnement asynchrone, c'est-\`a-dire que notre protocole impl\'emente le m\'ecanisme de synchronisation n\'ecessaire de mani\`ere d\'ecentralis\'ee. La performance de la strat\'egie d'encerclement est mesur\'ee par le nombre d'agents utilis\'es pour capturer l'intrus. Selon cette mesure, nous prouvons que notre protocole a un rapport de comp\'etitivit\'e de $3/2$ et que c'est le meilleur ratio atteignable par n'importe quel protocole r\'eparti. En fait, pour tout r\'eseau, notre protocole calcule une strat\'egie dont nous prouvons qu'elle utilise au plus $OPT+1$ agents, o\`u $OPT$ est le nombre minimum d'agents n\'ecessaire pour nettoyer un r\'eseau de facon centralis\'ee et synchrone.},

}

@inproceedings{CCL06,
author = {R. Chand and M. Cosnard and L. Liquori},
title = {Resource Discovery in the {A}rigatoni Overlay Network},
booktitle = {Proceedings of the International Workshop on Innovative Internet Community Systems (I2CS)},
OPTseries={Lecture Notes in Informatics},
OPTPUBLISHER = {},
pages = {13p},
year = {2006},
sorte = "conf-int",
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/i2cs-06.pdf} 
}

@InProceedings{CLN+06,
sorte = "conf-int",
author = {R. Cilibrasi and Z. Lotker and A. Navarra and S. P\'erennes and P. Vitanyi},
title = {About the {L}ifespan of {P}eer to {P}eer {N}etworks},
booktitle = {Proceedings of the 10th International Conference On Principles Of Distributed Systems (OPODIS)},
OPTcrossref = {},
OPTkey = {},
pages = {290--304},
year = {2006},
OPTeditor = {},
volume = {4305},
OPTnumber = {},
series = {Lecture Notes in Computer Science},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Springer-Verlag},
month = {December},
address={Bordeaux},
URL={http://www.opodis.net/},
PDF={ftp://ftp-sop.inria.fr/mascotte/Publications/CLN+06.pdf},

}

@INPROCEEDINGS{CLKW06,
sorte = "conf-nat",
AUTHOR = {H. Cirstea and K. Claude and L. Liquori and B. Wack},
TITLE = {Polymorphic Type Inference for the Rewriting Calculus},
YEAR = {2006},
BOOKTITLE = {JFLA: Journ\'ees Francophones des Langages Applicatifs},
PUBLISHER = {INRIA},
pages = {57--69},

}

@INPROCEEDINGS{CPRV06,
author = {D. Coudert and S. P\'erennes and H. Rivano and M-E. Voge},
title = {Shared Risk Resource Groups and Survivability in Multilayer Networks},
booktitle = {IEEE-LEOS ICTON / COST 293 GRAAL},
year = {2006},
volume = {3},
pages = {235-238},
month = jun,
note = {Invited Paper},
sorte = "inv-conf",
abstract = {We study the minimization of ADMs (Add-Drop Multiplexers) in Optical WDM Networks with Bidirectional Ring topology considering symmetric shortest path routing and all-to-all unitary requests. We insist on the statement of the problem, which had not been clearly stated before in the bidirectional case. Optimal solutions had not been found up to date. In particular, we study the case C = 2 and C = 3 (giving either optimal constructions or near-optimal solutions) and the case C = k(k 1)/2 (giving optimal decompositions for specific congruence classes of N). We state a general Lower Bound for all the values of C and N, and we improve this Lower Bound for C=2 and C=3 (when N=4t 3). We also include some comments about the simulation of the problem using Linear Programming.},
optbooktitle = {IEEE/COST 293 annual conference on GRAphs and ALgorithms in communication networks},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CPRV-ICTON-GRAAL06.pdf} 
}

@InProceedings{Dal06b,
author = {O. Dalle},
title = {{OSA}: an {O}pen {C}omponent-based {A}rchitecture for {D}iscrete-{E}vent Simulation},
booktitle = {20th European Conference on Modeling and Simulation (ECMS)},
OPTcrossref = {},
OPTkey = {},
pages = {253--259},
year = {2006},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
address = {Bonn, Germany},
month = {May},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
sorte = "conf-int",
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Dal06b.pdf},
OPTannote = {} 
}

@inproceedings{FGM06,
author={A. Ferreira and A. Goldman and J. Monteiro},
title={Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model},
booktitle={Proceedings of the 2nd {IEEE} International Conference on Wireless and Mobile Computing, Networking and Communications {(WiMob 2006)}},
URL={http://www.congresbcu.com/wimob2006/},
pages={173--180},
month = {June},
year = {2006},
address = {Montreal, CA},
note = {Best Student Paper Award},
sorte = "conf-int" 
}

@InProceedings{FFN06,
sorte = "conf-nat",
author = {F. V. Fomin and P. Fraigniaud and N. Nisse},
title = {Strategies d'encerclement non deterministes},
booktitle = {8\`emes Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel)},
year = {2006},
pages = {81-84},
url = {http://algotel2006.lip6.fr/},
pdf = {},
abstract = {Nous d\'efinissons l'encerclement non-d\'eterministe dans les graphes. Nous montrons comment ce nouvel outil peut \^etre utilis\'e pour la conception d'algorithmes et pour l'analyse combinatoire de la largeur lin\'eaire (pathwidth) comme de la largeur arborescente (treewidth) des graphes. Nous prouvons l'\'equivalence entre cette approche sous forme de ``jeu'' (graph searching) et la d\'ecomposition arborescente $q$-branch\'ee d'un graphe. Cette d\'ecomposition peut \^etre interpr\'et\'ee comme une version param\'etr\'ee des d\'ecompositions arborescente et lin\'eaire qui sont deux cas extr\^emes de la d\'ecomposition arborescente $q$-branch\'ee. L'\'equivalence entre l'encerclement non-d\'eterministe et la d\'ecomposition arborescente $q$-branch\'ee nous permet de proposer un algorithme exact (en temps exponentiel) pour calculer la largeur arborescente $q$-branch\'ee pour tout $q \geq 0$. Cet algorithme est donc valide \`a la fois pour la largeur lin\'eaire et po ur la largeur arborescente. Notre algorithme est aussi rapide que le meilleur algorithme connu pour la largeur lin\'eaire.},

}

@inproceedings{FrNi06a,
sorte = "conf-int",
author = {P. Fraigniaud and N. Nisse},
title = {Monotony Properties of Connected Visible Graph Searching},
booktitle = {Proceedings of 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG)},
year = {2006},
month = jun,
pages = {229-240},
volume = {5911},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
address = {Montpellier, France},
abstract = {Search games are attractive for their correspondence with classical width parameters. For instance, the \emph{invisible} search number (a.k.a. \emph{node} search number) of a graph is equal to its pathwidth plus~1, and the \emph{visible} search number of a graph is equal to its treewidth plus~1. The \emph{connected} variants of these games ask for search strategies that are connected, i.e., at every step of the strategy, the searched part of the graph induces a connected subgraph. We focus on \emph{monotone} search strategies, i.e., strategies for which every node is searched exactly once. The monotone connected visible search number of an $n$-node graph is at most $O(\log n)$ times its visible search number. First, we prove that this logarithmic bound is tight. Precisely, we prove that there is an infinite family of graphs for which the ratio monotone connected visible search number over visible search number is $\Omega(\log n)$. Second, we prove that, as opposed to the non-connected variant of visible graph searching, ``recontamination helps" for connected visible search. Precisely, we prove that, for any $k \geq 4$, there exists a graph with connected visible search number at most $k$, and monotone connected visible search number $>k$.}, url = {http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2006.html}, pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/WG06_nisse.ps} 
}

@inproceedings{FrNi06b,
sorte = "conf-int",
author = {P. Fraigniaud and N. Nisse},
title = {Connected Treewidth and Connected Graph Searching},
booktitle = {Proceeding of the 7th Latin American Symposium on Theoretical Informatics (LATIN)},
year = {2006},
pages = {479-490},
abstract = {We give a constructive proof of the equality between \emph{treewidth} and \emph{connected treewidth}. More precisely, we describe an $O(nk^3)$-time algorithm that, given any $n$-node width-$k$ tree-decomposition of a connected graph $G$, returns a connected tree-decomposition of $G$ of width $\leq k$. The equality between treewidth and connected treewidth finds applications in \emph{graph searching} problems. First, using equality between treewidth and connected treewidth, we prove that the \emph{connected} search number $\cs(G)$ of a connected graph $G$ is at most $\log{n}+1$ times larger than its search number. Second, using our constructive proof of equality between treewidth and connected treewidth, we design an \\$O(\log n\sqrt{\log OPT})$-approximation algorithm for connected search, running in time $O(t(n)+nk^3\log^{3/2}k+m\log n)$ for $n$-node $m$-edge connected graphs of treewidth at most $k$, where $t(n)$ is the time-complexity of the fastest algorith m for approximating the treewidth, up to a factor $O(\sqrt{\log OPT})$. },
url = {http://www.informatik.uni-trier.de/~ley/db/conf/latin/latin2006.html},
pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Latin06.ps} 
}

@InProceedings{Gal06b,
author = {J. Galtier},
title = {Adaptive power and transmission rate control in cellular {CDMA} networks},
booktitle = {IEEE GLOBECOM},
pages = {6p},
year = {2006},
sorte = "conf-int",
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/Gal06b.pdf},

}

@InProceedings{Gal06a,
author = {J. Galtier},
title = {Analysis of the slotted non-persistent {CSMA} protocol with poissonian packet size using a semi-Markov graph representation},
booktitle = {8th International Conference on Transparent Optical Networks},
pages = {258--262},
year = {2006},
volume = {3},
month = {June},
organization = {IEEE},
sorte = "conf-int",
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/Gal06a.pdf},

}

@inproceedings{Gir06a,
author = {F. Giroire},
title = {Directions to use Probabilistic Algorithms for Cardinality for {DNA} Analysis},
booktitle = {Journ\'ees Ouvertes Biologie Informatique Math\'ematiques (JOBIM 2006)},
year = {2006},
month = {July},
pages = {3-5},
pdf = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/Gir06.pdf},
abstract = {Probabilistic algorithms for cardinality allow to estimate the number of distinct words of very large multisets. Best of them are very fast (only few tens of CPU operations per element) and use constant memory (standard error of $c \sqrt M$ attained using $M$ units of memory) to be compared with the linear memory used by exact algorithms. Hence they allow to do multiple experiments in few minutes with few KiloBytes on files of several GigaBytes that would be unfeasible with exact counting algorithms. Such algorithms are used here to analyze base correlation in human genome.},

}

@INPROCEEDINGS{HBG+06a,
OPTauthor = {L. Hogie and Pascal Bouvry and Fr{\'e}d{\'e}ric Guinand and Gr{\'e}goire Danoy and Enrique Alba},
author = {L. Hogie and P. Bouvry and F. Guinand and G. Danoy and E. Alba},
title = {Simulating Realistic Mobility Models for Large Heterogeneous {MANET}s},
booktitle = {Demo proceeding of the 9th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM'06)},
year = {2006},
pages = {1p},
month = {October},
publisher = {IEEE},
abstract = {Mobile ad hoc networks (MANETs) are composed of communicat- ing mobile devices capable of spontaneously interconnecting without any pre-existing infrastructure. The wide spread of mobile devices(i.e. phones, PDAs, laptops) enables the deployment of metropolitan ad hoc networks, referred to as MobileMANs. Until recently, MobileMAN simu- lation suffered from a lack of appropriate tools. Therefore a new class of simulators dedicated to MobileMANs is appearing. This paper presents Mad hoc, a MANETs simulator which belongs to this class. In addi- tion to providing particular models for the simulation of numerous nodes evolving in a metropolitan environment, Mad hoc comes with appropri- ate tools for the development and the monitoring of ad hoc applications. Mad hocÕs applications are presented.},
url = {http://www.google.fr/url?sa=t&source=web&ct=res&cd=1&ved=0CBoQFjAA&url=http%3A%2F%2Fwww-valoria.univ-ubs.fr%2FSARAH%2Fpdf%2FHogie_mswim06.pdf&ei=MRjoS-GFN4-C_QbZ9MW7BA&usg=AFQjCNG_0DVrdUMl_h00MOvH2fgUX6osDQ},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@INPROCEEDINGS{HBG+b,
OPTauthor = {L. Hogie and Pascal Bouvry and Fr{\'e}d{\'e}ric Guinand and Gr{\'e}goire Danoy and Enrique Alba},
author = {L. Hogie and P. Bouvry and F. Guinand and G. Danoy and E. Alba},
title = {A Bandwidth-Efficient Broadcasting Protocol for Mobile Multi-hop Ad hoc Networks},
booktitle = {ICN/ICONS/MCL '06: Proceedings of the International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies},
year = {2006},
pages = {71-71},
month = {October},
publisher = {IEEE Computer Society},
abstract = {This paper presents a new broadcasting protocol called Delayed Flooding with Cumulative Neighborhood (DFCN) designed for wireless ad hoc networks. DFCN enables bandwidth-efficient broadcasting in wide area network composed of large number of mobile devices. The protocol was validated trough simulation which proved its efficiency and cost-effectiveness. Comparison with other well known protocols has shown that the proposed protocol outperforms them in such terms as a number of emissions and redundant receptions.},
doi = {10.1109/ICNICONSMCL.2006.1},
timestamp = {2006.09.19},
url = {http://pascal.bouvry.org/ftp/icn2006.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "conf-int",

}

@INPROCEEDINGS{HBG05,
author = {L. Hogie and Pascal Bouvry and Fr{\'e}d{\'e}ric Guinand},
title = {An Overview of MANETs Simulation},
booktitle = {Electronic Notes in Theoretical Computer Science, in the proceedings of MTCoord'05},
year = {2006},
editor = {L. Brim and I. Linden},
volume = {150},
series = {LNCS},
pages = {81--101},
address = {Namur, Belgium},
month = {March},
publisher = {Elsevier},
abstract = {Mobile Ad hoc NETworks (MANETs) are dynamic networks populated by mobile stations. Stations in MANETs are usually laptops, PDAs or mobile phones. These devices feature Bluetooth and/or IEEE 802.11 (WiFi) network interfaces and communicate in a decentralized manner. Mobility is a key feature of MANETs. Because of their high cost and their lack of flexibility of such networks, experimentation is mostly achievable through simulation. Numerous tools exist for MANETs simulation, including ns-2 and GloMoSim which are the two most popular ones. This paper provides a State of the Art of MANETs simulators and associated simulation techniques. First it gives an overview of the domain. Then it provides a map of the main characteristics that MANETs simulation tools should feature and the current support of these. Finally, a description for each simulator is provided, including an explanation of what make them appealing solutions.},
doi = {10.1016/j.entcs.2005.12.025},
url = {http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B75H1-4JCCCYV-7-1&_cdi=13109&_user=6068170&_pii=S1571066106001010&_orig=search&_coverDate=03%2F09%2F2006&_sk=998499998&view=c&wchp=dGLzVlb-zSkzk&md5=e28496e51e1f2587eb45bf5557c533fd&ie=/sdarticle.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},

}

@InProceedings{LHR06,
sorte = "conf-int",
author = {L. Liquori and F. Honsell and R. Redamalla},
title = {A Language for Verification and Manipulation of Web Documents},
booktitle = {Proceedings of the International Workshop on Automated Specification and Verification of Web Sites (WWV 2005)},
OPTcrossref = {},
OPTkey = {},
pages = {67--78},
year = {2006},
OPTeditor = {},
volume = {157},
number = {2},
series = {Electronic Notes in Theoretical Computer Science},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Elsevier},
OPTnote = {},
OPTannote = {},
doi = "DOI: j.entcs.2005.12.046",

}

@InProceedings{Liq06,
sorte = "conf-int",
author = {L. Liquori},
title = {i{R}ho: the Software: [System Description]},
booktitle = {Proceedings of the First International Workshop on Developments in Computational Models (DCM 2005) },
OPTcrossref = {},
OPTkey = {},
pages = {85--94},
year = {2006},
OPTeditor = {},
volume = {135},
number = {3},
series = {Electronic Notes in Theoretical Computer Science},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Elsevier},
OPTnote = {},
OPTannote = {},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/dcm-06.pdf},
issn = "1571-0661",
doi = "DOI: 10.1016/j.entcs.2005.09.023",

}

@INPROCEEDINGS{LND+06,
OPTauthor = {Francisco Luna and Antonio J. Nebro and Bernab{\'e} Dorronsoro and Enrique Alba and Pascal Bouvry and L. Hogie},
author = {F. Luna and A. J. Nebro and B. Dorronsoro and E. Alba and P. Bouvry and L. Hogie},
title = {Optimal Broadcasting in Metropolitan {MANET}s Using Multiobjective Scatter Search},
booktitle = {Applications of Evolutionary Computing},
year = {2006},
volume = {3907},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
pages = {255-266},
month = mar,
sorte = "conf-int",
abstract = {Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenario, broadcasting becomes an operation of capital importance for the own existence and operation of the network. Optimizing a broadcasting strategy in MANETs is a multiobjective problem accounting for three goals: reaching as many stations as possible, minimizing the network utilization, and reducing the makespan. In this paper, we face this multiobjective problem with a state-of-the-art multiobjective scatter search algorithm called AbSS (Archive-based Scatter Search) that computes a Pareto front of solutions to empower a human designer with the ability of choosing the preferred configuration for the network. Results are compared against those obtained with the previous proposal used for solving the problem, a cellular multiobjective genetic algorithm (cMOGA). We conclude that AbSS outperforms cMOGA with respect to three different metrics.},
bibsource = {DBLP, http://dblp.uni-trier.de},
doi = {10.1007/11732242},
url = {http://www.springerlink.com/content/qk6747wq32478r42/fulltext.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},

}

@inproceedings{MGM06b,
sorte = "conf-int",
author = {J. Moulierac and A. Guitton and M. Moln\'ar},
title = {{On the number of MPLS LSP using Multicast Tree Aggregation}},
booktitle = {IEEE Globecom},
year = {2006},
pages = {5p},
month = {November},
PDF={ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/moulierac06number.pdf},
ABSTRACT={Multicast tree aggregation is an efficient proposition that can solve the multicast forwarding state scalability problem. Existing works on tree aggregation have focused on developing and simulating protocols that build trees dynamically. However, the underlying problem of the impact of the tree construction algorithm on the performance of the protocols remains untouched. In this paper, we propose a study on the number of trees that need to be configured in a domain depending on the tree construction algorithm. We ran extensive simulations on several real domains and with different tree construction algorithms. Our results show that for a given set of multicast groups, even when this set includes all the possible groups, the number of trees that need to be configured is small. This allows a network administrator to configure off-line all these trees in order to maintain a stable set of trees and to have knowledge of the routes used by the multicast packets. Knowing the set of all the possible trees is also useful to determine the best subset to configure and to give an upper bound of the number of different trees.} 
}

@inproceedings{MGM06c,
sorte = "conf-int",
author = {J. Moulierac and A. Guitton and M. Moln\'ar},
title = {{Multicast Tree Aggregation in Large Domains}},
booktitle = {IFIP Networking},
number = {3976},
pages= {691--702},
year = {2006},
PDF={ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/moulierac06tree.pdf},
ABSTRACT={Tree aggregation is an ecient proposition that can solve the problem of multicast forwarding state scalability. The main idea of tree aggregation is to force several groups to share the same delivery tree: in this way, the number of multicast forwarding states per router is reduced. Unfortunately, when achieving tree aggregation in large do- mains, few groups share the same tree and the aggregation ratio is small. In this paper, we propose a new algorithm called TALD (Tree Aggrega- tion in Large Domains) that achieves tree aggregation in domains with a large number of nodes. The principle of TALD is to divide the domain into several sub-domains and to achieve the aggregation in each of the sub-domain separately. In this way, there is possible aggregation in each of the sub-domain and the number of forwarding states is signicantly reduced. We show the performance of our algorithm by simulations on a Rocketfuel network of 200 routers.} 
}

@inproceedings{Mou06,
sorte = "conf-int",
author = {J. Moulierac},
title = {On the number of multicast aggregated trees in a domain},
booktitle = {2nd Student Workshop of {IEEE} {I}nfocom},
pages = {2p},
year = {2006},
month = {April},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/moulierac06number.pdf},
ABSTRACT={Multicast tree aggregation is an efficient proposition that can solve the multicast forwarding state scalability problem. Existing works on tree aggregation have focused on developing and simulating protocols that build trees dynamically. However, the underlying problem of the impact of the tree construction algorithm on the performance of the protocols remains untouched. In this paper, we propose a study on the number of trees that need to be configured in a domain depending on the tree construction algorithm. We ran extensive simulations on several real domains and with different tree construction algorithms. Our results show that for a given set of multicast groups, even when this set includes all the possible groups, the number of trees that need to be configured is small. This allows a network administrator to configure off-line all these trees in order to maintain a stable set of trees and to have knowledge of the routes used by the multicast packets. Knowing the set of all the possible trees is also useful to determine the best subset to configure and to give an upper bound of the number of different trees.} 
}

@inproceedings{MM06,
sorte = "conf-int",
author = {J. Moulierac and M. Moln\`ar},
title = {Active Monitoring of Link Delays in Case of Asymmetric Routes},
booktitle = {IEEE International Conference on Networking (ICN)},
year = {2006},
pages = {6p},
month = {April},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/moulierac06active.pdf},
ABSTRACT={Network monitoring receives signicant interest recently. Indeed, knowledge of link availability and link characteristics is of signicant importance in order to provide efcient routing. In this paper, we consider active network monitoring of link delays in a Service Provider or Enterprise IP network using round trip delays. Our proposition guarantees that all links are monitored contrary to previous propositions. Indeed, previous propositions assume symmetric routing in networks when placing the monitoring stations. With this assumption, round trips may be different when routes are asymmetric and link delays are not signi cant. We say that links are not monitored in this case. Previous propositions do not monitor 5.76\% of links in average and 10\% in worst cases during our simulations while we monitor always 100\% of links. Moreover, in our proposition, the amount of trafc is reduced and the measures are more precise since the distance from a monitoring station (beacon) to the edges is limited by a given bound. Finally, we show during the simulations that the set of beacons is rather stable in case of link failures.} 
}

@inproceedings{NPC06a,
sorte = "conf-int",
OPTauthor = {Napole{\~a}o Nepomuceno and Pl{\'a}cido Rog{\'e}rio Pinheiro and Andr{\'e} L. V. Coelho},
author = {Nepomuceno, N. and Rog{\'e}rio Pinheiro, P. and Coelho, A. L. V.},
title = {Metaheur{\'i}stica e Programa\c{c}\~ao Linear Inteira: Um Algoritmo H{\'i}brido para o Problema de Carregamento de Cont\^eineres},
booktitle = {XIII Congreso Latino-Iberoamericano de Investigaci\'on Operativa (CLAIO) },
address= {Montevideo, Uruguay},
pages = {6p},
year = {2006},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/NPC06.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
x-pays = {BR} 
}

@inproceedings{NPC06b,
sorte = "conf-nat",
OPTauthor = {Napole{\~a}o Nepomuceno and Pl{\'a}cido Rog{\'e}rio Pinheiro and Andr{\'e} L. V. Coelho},
author = {Nepomuceno, N. and Rog{\'e}rio Pinheiro, P. and Coelho, A. L. V. },
title = {Aplica\c{c}\~ao de uma Metodologia H{\'i}brida ao Problema de Carregamento de Cont\^eineres},
booktitle = {XXXVIII Simp\'osio Brasileiro de Pesquisa Operacional (SBPO)},
address= {Goiania, Brazil},
year = {2006},
pages = {1596-1603},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/NPC06b.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={no},
x-pays = {BR} 
}

@INPROCEEDINGS{RTV06a,
sorte = "conf-int",
author = {Rivano, H. and Theoleyre, F. and Valois, F.},
title = {Capacity Evaluation Framework and Validation of Self-Organized Routing Schemes},
booktitle = {Workshop on Wireless Ad-hoc and Sensor Networks (IWWAN 2006)},
publisher = {IEEE},
year = {2006},
volume = {3},
pages = {779--785},
month = {28-28 Sept.},
abstract = {Assuming a given network topology and a routing protocol, this work is focused on the capacity evaluation of routing protocols based on either a self-organization scheme or a flat approach. To reach this goal, we propose to use linear-programming formulation to model radio resource sharing as linear constraints. Four models are detailed to evaluate the capacity of any routing scheme in wireless multihops networks. First, two models of fairness are proposed: either each node has a fair access to the channel, or the fairness is among the radio links. Besides, a pessimistic and an optimistic scenarios of spatial re-utilization of the medium are proposed, yielding a lower bound and an upper bound on the network capacity for each fairness case. Finally, using this model, we provide a comparative analysis of some flat and self-organized routing protocols},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/rtv06.pdf},
url = {http://www.ctr.kcl.ac.uk/IWWAN2006/} 
}

@InProceedings{Vog06b,
sorte = "conf-int",
author = {M.-E. Voge},
title = {How to transform a multilayer network into a colored graph},
booktitle = {IEEE-LEOS ICTON/COST 293 GRAAL},
OPTbooktitle = {IEEE/COST 293 annual conference on GRAphs and ALgorithms in communication networks},
pages = {116--119},
volume = {3},
year = {2006},
month = {June},

}

@inproceedings{Vog06a,
sorte = "conf-nat",
author={M.-E. Voge},
title={Graphes Color\'es - Arbre Couvrant Color\'e},
booktitle={Huiti\`emes Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel'06)},
address={Tr\'egastel},
month={May},
year={2006},
pages={41--44},
URL={http://algotel2006.lip6.fr/},

}

@TechReport{AGHP06,
author = {O. Amini and F. Giroire and F. Huc and S. P\'erennes},
title = {Minimal selectors and fault tolerant networks},
institution = {INRIA Research Report HAL-00082015},
year = {2006},
month = {July},
type={Research report},
sorte = "Rapports",
url = {http://hal.inria.fr/inria-00082015},
POSTSCRIPT={http://hal.inria.fr/docs/00/08/20/15/PS/RRAGHP06.ps},
PDF={http://hal.inria.fr/docs/00/08/20/15/PDF/RRAGHP06.pdf},
abstract = {Un r\'eseau $\plk$ est un graphe non orient\'e avec $p + \lambda$ entr\'ees, $p + k$ sorties et des noeuds internes de degr\'e $4$. Un r\'eseau $\plk$ est valide si pour n'importe quel choix de $p$ entr\'ees et de $p$ sorties il existe $p$ chemins ar\^etes disjoints reliant les entr\'ees aux sorties. Dans le cas particulier $\lambda = 0$, un r\'eseau $\plk$ est un \emph{s\'electeur}. Notre objectif est de d\'eterminer $N\plk$ : le nombre minimum de noeuds d'un r\'eseau $\plk$ valide. Pour cela, on utilise une condition suffisante de validit\'e qui nous permet d'obtenir les bornes inf\'erieures pour $N\plk$. D'autre part on propose des constructions de r\'eseaux valides utlisant des \emph{expandeurs}, ce qui donne les bornes supp\'erieures. Le probl\`me d\'epend tr\`es fortement des ordres de $\lambda$ et $k$, par exemple lorsque $\lambda $ et $k$ sont petits par rapport \`a $p$, certains patterns sont interdits. Pour les valeurs plus grandes de $\lambda$ et $k$, on peut construire un r\'eseau $\plk$ valide \`a partir d'un graphe ayant de bonne propri\'et\'e d'expension concernant les petits ensembles de sommets. Cela nous emm\`ene \`a introduire un nouveau param\`etre : la \emph{robustness}. On obtient dans de nombreux cas des bornes assymptotiques exactes.},

}

@TechReport{AHP06,
author = {O. Amini and F. Huc and S. P\'erennes},
title = {On the pathwidth of planar graphs},
institution = {INRIA Research Report HAL-00082035 },
year = {2006},
month = {July},
type={Research report},
sorte = "Rapports",
url={http://hal.inria.fr/inria-00082035},
POSTSCRIPT={http://hal.inria.fr/docs/00/08/20/35/PS/RRAHP06.ps},
PDF={http://hal.inria.fr/docs/00/08/20/35/PDF/RRAHP06.pdf},
abstract = {Fomin and Thilikos in \cite{FoTh06} conjectured that there is a constant $c$ such that, for every $2$-connected planar graph $G$, $\text{pw}(G^*) \leq 2\text{pw}(G)+c$ (the same question was asked simutaneously by Coudert, Huc and Sereni in \cite{CHS06}). By the results of Boedlander and Fomin~\cite{BoFo02} this holds for every outerplanar graph and actually is tight by Coudert, Huc and Sereni~\cite{CHS06}. In \cite{FoTh06}, Fomin and Thilikos proved that there is a constant $c$ such that the pathwidth of every 3-connected graph $G$ satisfies: $\text{pw}(G^*) \leq 6\text{pw}(G)+c$. In this paper we improve this result by showing that the dual a 3-connected planar graph has pathwidth at most $3$ times the pathwidth of the primal plus two. We prove also that the question can be answered positively for $4$-connected planar graphs.},

}

@TechReport{BCRS06,
author = {J-C. Bermond and D. Coudert and H. Rivano and M. Syska},
title = {Critical resource sharing, State of the art Survey},
institution = {IST FET AEOLUS, Integrated Project IST-015964},
year = {2006},
number = {Deliverable 2.2.1},
sorte = "Rapports",
pdf = {http://aeolus.ceid.upatras.gr/sub-projects/deliverables/D221.pdf},

}

@TechReport{BGK+06d,
author = {J-C. Bermond and J. Galtier and R. Klasing and N. Morales and S. P\'erennes},
title = {Hardness and approximation of gathering in static radio networks},
year = {2006},
month = {06},
institution = {INRIA},
number = {5936},
type = {Research Report},
sorte = "Rapports",
url= {http://hal.inria.fr/inria-00081032},
pdf = {http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/08/14/26/PDF/RR-5936.pdf&docid=81426},
abstract = {In this paper, we address the problem of gathering information in a specific node (or \emph{sink}) of a radio network, where interference constraints are present. We take into account the fact that, when a node transmits, it produces interference in an area bigger than the area in which its message can actually be received. The network is modeled by a graph; a node is able to transmit one unit of information to the set of vertices at distance at most $\dt$ in the graph, but when doing so it generates interference that does not allow nodes at distance up to $\di$ ($\di \ge \dt$) to listen to other transmissions. Time is synchronous and divided into time-steps in each of which a round (set of non-interfering radio transmissions) is performed. We give general lower bounds on the number of rounds required to gather into a sink of a general graph, and present an algorithm working on any graph, with an approximation factor of 4. We also show that the problem of finding an optimal strategy for gathering is \textsc{NP-hard}, for any values of $\di$ and $\dt$. If $\di>\dt$, we show that the problem remains hard when restricted to the uniform case where each vertex in the network has exactly one piece of information to communicate to the sink.},

}

@TechReport{BPP06,
author = {J-C. Bermond and V. Papadopoulou and E. Pitoura},
title = {Subproject2: Resource Management Report on the activities of the first year},
institution = {IST FET AEOLUS, Integrated Project IST-015964},
year = {2006},
number = {Deliverable 2.O.1},
sorte = "Rapports",
pdf = {http://aeolus.ceid.upatras.gr/sub-projects/deliverables/D201.pdf},

}

@TECHREPORT{CDP+06,
author = {D. Coudert and P. Datta and S. P\'erennes and H. Rivano and M-E. Voge},
title = {Complexity and approximability issues of Shared Risk Resource Group},
institution = {INRIA Research Report 5859 and I3S Research Report I3S/RR-2006-08-FR},
year = {2006},
sorte = "Rapports",
abstract = {This article investigates complexity and approximability properties of combinatorial optimization problems yielded by the notion of Shared Risk Resource Group (SRRG). SRRG has been introduced in order to capture network survivability issues where a failure may break a whole set of resources, and has been formalized as colored graphs, where a set of resources is represented by a set of edges with same color. We consider here the analogous of classical problems such as determining paths or cuts with the minimum numbers of colors or color disjoint paths. These optimization problems are much more difficult than their counterparts in classical graph theory. In particular standard relationship such as the Max Flow - Min Cut equality do not hold any longer. In this article we identify cases where these problems are polynomial, for example when the edges of a given color form a connected subgraph, and otherwise give hardness and non approximability results for these problems.},
pdf = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5859.pdf},
postscript = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5859.ps.gz},
url = {http://hal.inria.fr/inria-00070167} 
}

@TECHREPORT{CHS06,
author = {D. Coudert and F. Huc and J.S. Sereni},
title = {Pathwidth of outerplanar graphs},
institution = {INRIA Research Report 5804 and I3S Research Report I3S/RR-2006-02-FR},
year = {2006},
month = {January},
sorte = "Rapports",
abstract = {We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin, after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geometric) dual plus two, conjectured that there exists a constant c such that the pathwidth of every biconnected outerplanar graph is at most c plus the pathwidth of its dual. They also conjectured that this was actually true with c being one for every biconnected planar graph. Fomin proved that the second conjecture is true for all planar triangulations. First, we construct for each p>=1 a biconnected outerplanar graph of pathwidth 2p 1 whose (geometric) dual has pathwidth p 1, thereby disproving both conjectures. Next, we also disprove two other conjectures (one of Bodlaender and Fomin, implied by one of Fomin). Finally we prove, in an algorithmic way, that the pathwidth of every biconnected outerplanar graph is at most twice the pathwidth of its (geometric) dual minus one. A tight interval for the studied relation is therefore obtained, and we show that all cases in the interval happen.},
optnote = {Submitted to Journal of Graph Theory},
pdf = {http://www.i3s.unice.fr/~mh/RR/2006/RR-06.02-D.COUDERT.pdf},
postscript = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5804.ps.gz},
url = {http://www.inria.fr/rrrt/rr-5804.html} 
}

@TechReport{Dal06a,
author = {O. Dalle},
title = {{OSA}: an {O}pen {C}omponent-based {A}rchitecture for {D}iscrete-{E}vent Simulation},
institution = {INRIA},
year = {2006},
OPTkey = {},
OPTtype = {},
number = {RR-5762, version 2},
OPTaddress = {},
month = {February},
OPTnote = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Dal06a.pdf},
OPTannote = {},
sorte = "Rapports",
url = {http://hal.inria.fr/inria-00070258/fr/},
abstract = {This report describes work in progress to initiate the collaborative development of a new software platform for discrete-event simulation studies, the Open Simulation Architecture (OSA). OSA is primarily designed to be a federating platform for the simulation community: it is designed to favour the integration of new or existing contributions at every level of its architecture. This report describes the way OSA provides an open platform intended to support simulationists in a wide set of their simulation activities, and how it favours the reuse and sharing of system models by means of a flexible component model (Fractal). Indeed, OSA supports component-based modeling, which has many well-known good properties. Out of these properties is the ability to dispatch the modeling effort amongst several experts each having their own area of system expertise. Clearly, the less experts have to care about areas of expertise of others, the more efficient they are in modeling sub-systems in their own area. Furthermore, the process of studying complex systems using discrete-event computer simulations involves several areas of non-system expertise, such as discrete-event techniques or experiment planning. In OSA, all these tasks are clearly separated by identifying different kinds of (virtual) users: experimenters, developpers, model architects, and so on. OSA shall eventually supports each of these users by integrating dedicated tools for each of their specific tasks.},

}

@TechReport{DHM+06,
author = {O. Delmas and F. Havet and M. Montassier and S. P\'erennes},
title = {Design of fault tolerant on-board networks},
month = {March},
year = {2006},
type = {Research report},
sorte = "Rapports",
institution = {INRIA Research Report 5866},
POSTSCRIPT = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5866.ps.gz},
pdf = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5866.pdf},
URL = {http://hal.inria.fr/inria-00070160/fr/},
abstract = {An $(n,k,r)$-network is a triple $N=(G,in,out)$ where $G=(V,E)$ is a graph and $in,out$ are integral functions defined on $V$ called input and output functions, such that for any $v \inV$, $in(v)+out(v)+ deg(v)\leq2r$ with $deg(v)$ the degree of $v$ in the graph $G$. The total number of inputs is $in(V)=\sum_v\inVin(v)$, and the total number of outputs is $out(V)=\sum_v\inVout(v)+k$. An $(n,k,r)$-network is valid, if for any faulty output function $out'$ (that is such that $out'(v) \leqout(v)$ for any $v \inV$, and $out'(V) = n$), there are $n$ edge-disjoint paths in $G$ such that each vertex $v\inV$ is the initial vertex of $in(v)$ paths and the terminal vertex of $out'(v)$ paths. We investigate the design problem of determining the minimum number of vertices in a valid $(n,k,r)$-network and of constructing minimum $(n,k,r)$-networks, or at least valid $(n,k,r)$-networks with a number of vertices close to the optimal value. We first show $\frac3n+k2r-2+ \frac3r^2k \leq\calN(n,k,r)\leq\left\lceil\frack+22r-2\right\rceil\fracn2$. We prove a better upper bound when $r\geqk/2$: $\calN(n,k,r) \leq\fracr-2+k/2r^2-2r+k/2 n + O(1)$. Finally, we give the exact value of $\calN(n,k,r)$ when $k\leq6$ and exhibit the corresponding networks.},

}

@TechReport{HKMS06,
author = {F. Havet and R. J. Kang and T. M\"uller and J.-S. Sereni},
title = {Circular Choosability},
institution = {INRIA Research Report 5957 and I3S Research Report I3S/RR-2006-21-FR},
year = {2006},
month = {July},
note = {Submitted to Journal of Graph Theory},
type={Research report},
sorte = "Rapports",
url= {http://hal.inria.fr/inria-00086981},
POSTSCRIPT={http://hal.inria.fr/docs/00/08/83/74/PS/RR-5957.ps},
PDF={http://www.i3s.unice.fr/%7Emh/RR/2006/RR-06.21-F.HAVET.pdf},
abstract = {In this paper, we study the notion of circular choosability recently introduced by Mohar and Zhu. First, we provide a negative answer to a question of Zhu about circular cliques. We next prove that, for every graph G, cch(G) = O( ch(G) + ln |V(G)| ). We investigate a generalisation of circular choosability, circular f-choosability, when f is a function of the degrees. We also consider the circular choice number of planar graphs. Mohar asked for the value of tau := sup{ cch(G) : G is planar }, and we prove that 6 <= tau <= 8, thereby providing a negative answer to another question of Mohar. Finally, we study the circular choice number of planar and outerplanar graphs with prescribed girth, and graphs with bounded density.},

}

@TechReport{HSS06,
author = {F. Havet and J.-S. Sereni and R. {\v{S}}krekovski},
title = {3-facial colouring of plane graphs},
institution = {INRIA Research Report 5943 and I3S Research Report I3S/RR-2006-20-FR},
year = {2006},
month = {July},
note = {Submitted to SIAM Journal on Discrete Mathematics},
type={Research report},
sorte = "Rapports",
url={http://hal.inria.fr/inria-00083533},
POSTSCRIPT={http://hal.inria.fr/docs/00/08/44/30/PS/squelette-rr.ps},
PDF = {http://www.i3s.unice.fr/~mh/RR/2006/RR-06.20-J.-S.SERENI.pdf},
abstract = {A plane graph is l-facially k-colourable if its vertices can be coloured with k colours such that any two distinct vertices on a facial segment of length at most l are coloured differently. We prove that every plane graph is 3-facially 11-colourable. As a consequence, we derive that every 2-connected plane graph with maximum face-size at most 7 is cyclically 11-colourable. These two bounds are for one off from those that are proposed by the (3l+1)-Conjecture and the Cyclic Conjecture.},

}

@TechReport{HTY06,
author = {F. Havet and S. Thomass\'e and A. Yeo},
title = {Ho{\`a}ng-Reed conjecture holds for tournaments},
institution = {INRIA Research Report 5976},
year = {2006},
month = {September},
note = {Submitted Discrete Mathematics},
type={Research report},
url= {http://hal.inria.fr/inria-00091366},
sorte = "Rapports",
PDF={http://hal.inria.fr/docs/00/09/50/31/PDF/RR-5976.pdf},
abstract = {Ho� ng-Reed conjecture asserts that every digraph $D$ has a collection $\cal C$ of circuits $C_1,\dots,C_{\delta ^+}$, where $\delta ^+$ is the minimum outdegree of $D$, such that the circuits of $\cal C$ have a forest-like structure. Formally, $|V(C_i)\cap (V(C_1)\cup \dots \cup V(C_{i-1}))|\leq 1$, for all $i=2,\dots ,\delta^+$. We verify this conjecture for the class of tournaments.},

}

@TechReport{Hav06b,
author = {F. Havet},
title = {Choosability of the square of planar subcubic graphs with large girth},
month = {January},
year = {2006},
type = {Research report},
sorte = "Rapports",
institution = {INRIA Research Report 5800 and I3S Research Report I3S/RR-2006-01-FR},
POSTSCRIPT = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5800.ps.gz},
pdf = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5800.pdf},
URL = {http://hal.inria.fr/inria-00070223/fr/},
note = {Submitted to Discrete Mathematics},
abstract = {We first show that the choose number of the square of a subcubic graph with maximum average degree less than 18/7 is at most 6. As a corollary, we get that the choose number of the square of a planar graph with girth at least 9 is at most 6. We then show that the choose number of the square of a subcubic planar graph with girth at least 13 is at most 5.},

}

@TECHREPORT{LHL06,
sorte = "Rapports",
AUTHOR = {M. Lenisa and F. Honsell and L. Liquori},
TITLE = {A Framework for Defining Logical Frameworks},
INSTITUTION = {RR INRIA and University of Udine},
type={Research Report},
YEAR = {2006},
URL = {http://hal.inria.fr/inria-00088809},

}

@TECHREPORT{MPR06,
sorte = "Rapports",
author = {G. M\'eheut and S. P\'erennes and H. Rivano},
title = {Evaluation stochastique et simulation des r\'eseaux radio},
institution = {INRIA},
year = {2006},
type = {Research report},
number = {5989},
month = {September},
abstract = {La capacité d'un réseau ad hoc sans fil passe mal � l'échelle lorsque le nombre $N$ de noeuds du réseau augmente. Si chaque noeud choisit un interlocuteur parmi les autres noeuds, le débit avec lequel les noeuds peuvent communiquer doit tendre vers $0$ au moins en $\mathcal{O}\left(1/\sqrt{N}\right)$ lorsque $N$ tend vers l'infini. Le problème fondamental des réseaux ad hoc sans fil est de trouver un compromis entre connectivité et parallélisme: il est nécessaire d'utiliser une puissance d'émission suffisante pour éviter d'avoir des noeuds isolés mais il faut aussi limiter cette puissance pour limiter les interférences et ainisi obtenir du parallélisme dans l'accès au médium. L'objectif principal de cette étude est de proposer des protocoles de routage qui permettent d'atteindre la borne asymptotique pour la capacité et de dépasser le résultat déj� connu de $\mathcal{O}\left(1/\sqrt{N\ln(N)}\right)$ dans le cadre des réseaux aléatoires sur le carré unité $[0,1]\times[0,1]$ avec un trafic également aléatoire. Une première approche � l'aide d'un routage local utilisant une puissance d'émission variable permet de se rapprocher de cette borne sans toutefois l'atteindre en raison d'une mauvaise répartition du trafic due � l'aspect aléatoire du réseau. Une seconde approche fondée sur la théorie de la percolation aboutit � l'existence avec une forte probabilité d'un nombre suffisant de chemins disjoints formés de {\og petits sauts \fg} et traversant le réseau. Ces chemins permettent d'acheminer l'ensemble du trafic avec suffisamment de parallélisme pour atteindre asymptotiquement un débit en $\Theta\left(\frac{1}{\sqrt{N}}\right)$ pour chaque noeud. On s'appuie en outre sur des simulations afin de valider empiriquement les résultats de l'analyse théorique.},
url = {http://hal.inria.fr/inria-00102039} 
}

@TECHREPORT{RTV06b,
sorte = "Rapports",
author = {H. Rivano and F. Th\'eoleyre and F. Valois},
title = {About the Capacity of Flat and Self-Organized Ad Hoc and Hybrid Networks},
institution = {INRIA Research Report 5977},
year = {2006},
type = {Research Report},
abstract = {Ad hoc networking specific challenges foster a strong research effort on efficient protocols design. Routing protocols based on a self-organized structure have been studied principally for the robustness and the scalability they provide. On the other hand, self-organization schemes may decrease the network capacity since they concentrate the traffic on privileged links. This paper presents four models for evaluating the capacity of a routing schemes on 802.11 like networks. Our approach consists in modeling the radio resource sharing principles of 802.11 like MAC protocols as a set of linear constraints. We have implemented two models of fairness. The first one assumes that nodes have a fair access to the channel, while the second one assumes that on the radio links. We then develop a pessimistic and an optimistic scenarii of spatial re-utilization of the medium, yielding a lower bound and an upper bound on the network capacity for each fairness case. Our models are independent of the routing protocols and provide therefore a relevant framework for their comparison. We apply our models to a comparative analysis of the well-known shortest path base flat routing protocol OLSR against two main self-organized structure approaches, VSR, and Wu \& Li's protocols. This study concludes on the relevance of self-organized approaches from the network capacity point of view.},
url = {http://hal.inria.fr/inria-00095216} 
}

@MastersThesis{Ben06,
sorte = "Rapports",
author = {F. Ben Hfaiedh},
title = {Reconfiguration dans les r\'eseaux {WDM}},
school = {Master STIC 2 "RSD"},
year = {2006},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {} 
}

@MastersThesis{Mol06,
sorte = "Rapports",
author = {C. Molle},
title = {Evaluation de la capacit\'e et routage pour les r\'eseaux radio},
school = {Universit\'e Pierre et Marie Curie, Paris {VI}},
year = {2006},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {} 
}

@MastersThesis{Meh06,
sorte = "Rapports",
author = {G. M\'eheut},
title = {Evaluation stochastique et simulation des r\'eseaux radio},
school = {Ecole Polytechnique, Palaiseaux},
year = {2006},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {} 
}

@MastersThesis{Sau06,
sorte = "Rapports",
author = {I. Sau},
title = {Minimizing the number of {ADMs} in {WDM} Optical Rings with Traffic Grooming},
school = {Universit\'e Polytechnique de Barcelone, Espagne},
year = {2006},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {} 
}

@book{HKP+05,
title= { Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance },
author= {J.~Hromkovi\v{c} and R.~Klasing and A.~Pelc and P.~Ru\v{z}i\v{c}ka and W.~Unger},
year= { 2005 },
publisher= { Springer-Verlag },
series= { Springer Monograph },

}

@phdthesis{Jar05,
author={A. Jarry},
title = { Connexit\'e dans les r\'eseaux de t\'el\'ecommunications},
year = {2005},
month = {March},
school = {\'Ecole doctorale STIC, Universit\'e de Nice-Sophia Antipolis},

}

@article {MR2145514,
AUTHOR = {Addario-Berry, L. and Aldred, R. E. L. and Dalal, K. and Reed, B.},
TITLE = {Vertex colouring edge partitions},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {94},
YEAR = {2005},
NUMBER = {2},
PAGES = {237--244},

}

@article {MR2127410,
AUTHOR = {Avis, D. and De Simone, C. and Reed, B.},
TITLE = {On the fractional chromatic index of a graph and its complement},
JOURNAL = {Oper. Res. Lett.},
VOLUME = {33},
YEAR = {2005},
NUMBER = {4},
PAGES = {385--388},

}

@Article{BLS05,
author={R. Bayon and N. Lygeros and J.-S. Sereni},
title ={New progress in enumeration of mixed models},
journal={Applied Mathematics E-Notes},
volume={5},
year={2005},
pages={60--65},
URL={http://www.math.nthu.edu.tw/~amen/},
PDF={http://kam.mff.cuni.cz/~sereni/Articles/BLS05.pdf},

}

@ARTICLE{BCC+05,
author = {J-C. Bermond and C. Colbourn and D. Coudert and G. Ge and A. Ling and X. Mu{\~n}oz},
title = {Traffic Grooming in Unidirectional {WDM} Rings With Grooming Ratio {C=6}},
journal = {SIAM Journal on Discrete Mathematics},
year = {2005},
volume = {19},
pages = {523-542},
number = {2},
abstract = {SONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a grooming, consisting of unions of primitive rings. The cost of such a decomposition is the sum, over all graphs in the decompositio n, of the number of vertices of nonzero degree in the graph. The existence of such decompositions with minimum cost, when every pair of sites employs no mo re than $\frac{1}{6}$~of the wavelength capacity, is determined with a finite number of possible exceptions. Indeed, when the number $N$ of sites satisfies $N \equiv 1 \pmod{3}$, the determination is complete, and when $N \equiv 2 \pmod{3}$, the only value le ft undetermined is $N = 17$. When $N \equiv 0 \pmod{3}$, a finite number of values of $N$ remain, the largest being $N = 2580$. The techniques developed rely heavily on tools from combinatorial design theory.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCC+-DM05.pdf} 
}

@article{CJP05,
author={S. Choplin and A. Jarry and S. P\'erennes},
title={Virtual network embedding in the cycle},
journal={Discrete Applied Mathematics},
volume={145},
number={3},
pages={368--375},
year={2005},

}

@Article{CKZ05a,
title = { Lower Bounds and Algorithms for Dominating Sets in Web Graphs },
author = { C. Cooper and R. Klasing and M. Zito },
year = { 2005 },
journal = { Internet Mathematics },
volume = {2},
number={3},
pages={275--300},

}

@article{DLLL05,
author = {D. J. Dougherty and P. Lescanne and L. Liquori and F. Lang},
title = {Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract},
journal = {TERMGRAPH: International Workshop on Computing with Terms and Graphs. Electr. Notes Theor. Comput. Sci.},
volume = {127},
number = {5},
year = {2005},
pages = {57--82},
POSTSCRIPT= {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/termgraph-04.ps.gz} 
}

@article {MR2132584,
AUTHOR = {Everett, H. and de Figueiredo, C. M. H. and Klein, S. and Reed, B.},
TITLE = {The perfection and recognition of bull-reducible {B}erge graphs},
JOURNAL = {Theor. Inform. Appl.},
VOLUME = {39},
YEAR = {2005},
NUMBER = {1},
PAGES = {145--160},

}

@article {MR2117935,
AUTHOR = {Farzad, B. and Molloy, M. and Reed, B.},
TITLE = {{$(\Delta-k)$}-critical graphs},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {93},
YEAR = {2005},
NUMBER = {2},
PAGES = {173--185},

}

@article{FlPe05,
AUTHOR = {Flammini, M. and P\'erennes, S.},
TITLE = {Lower bounds on systolic gossip},
JOURNAL = {Information and Computation},
VOLUME = {196},
YEAR = {2005},
NUMBER = {2},
PAGES = {71--94},
ISSN = {0890-5401},

}

@article{LiRo05,
author = {L. Liquori and S. Ronchi Della Rocca},
title = {Towards an Intersection Typed System {\it \`a la} {C}hurch},
journal = {ITRS: Workshop on Intersection Types and Related Systems. Electr. Notes Theor. Comput. Sci.},
volume = {136},
year = {2005},
pages = {43--56},
POSTSCRIPT= {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/itrs-04.ps.gz} 
}

@article{LiWa05,
author = {L. Liquori and B. Wack},
title = {The Polymorphic Rewriting-calculus: [Type Checking vs. Type Inference]},
journal = {WRLA: International Workshop on Rewriting Logic and its Applications. Electr. Notes Theor. Comput. Sci.},
volume = {117},
year = {2005},
pages = {89--111},
POSTSCRIPT= {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/wrla-04.ps.gz} 
}

@article {MR2109199,
AUTHOR = {Reed, B. and Sudakov, B.},
TITLE = {List colouring when the chromatic number is close to the order of the graph},
JOURNAL = {Combinatorica},
VOLUME = {25},
YEAR = {2005},
NUMBER = {1},
PAGES = {117--123},

}

@inproceedings {MR2173795,
AUTHOR = {Addario-Berry, L. and Dalal, K. and Reed, B.},
TITLE = {Degree constrained subgraphs},
BOOKTITLE = {Proceedings of GRACO2005},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {19},
PAGES = {257--263 (electronic)},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2005},

}

@Inproceedings{AAG+05,
author = {S. Alouf and E. Altman and J. Galtier and J.-F. Lalande and C. Touati},
title = {Quasi-optimal bandwidth allocation for multi-spot {MFTDMA} satellites},
booktitle = {{IEEE} {INFOCOM} 2005},
year = {2005},
address = {Miami, FL},
month = {March},
pages={71--94},
POSTSCRIPT={ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Francois.Lalande/articles/quasi-optimal_bandwidth_allocation_for_multi-spot_mftdma_satellites.ps.gz},
PDF={ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Francois.Lalande/articles/quasi-optimal_bandwidth_allocation_for_multi-spot_mftdma_satellites.pdf},
URL={http://www.ieee-infocom.org/2005/index.htm},

}

@INPROCEEDINGS{BBC05,
author = {J-C. Bermond and L. Braud and D. Coudert},
title = {Traffic Grooming on the Path},
booktitle = {12th International Colloquium on Structural Information and Communication Complexity -- SIROCCO},
year = {2005},
pages = {34-48},
address = {Le Mont Saint-Michel, France},
month = {May 24-26},
publisher = {LNCS 3499},
abstract = {In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most $1/C$ of the bandwidth of the wavelength, we will say that the grooming factor is $C$. That means that on a given edge of the network we can groom (group) at most $C$ requests on the same wavelength. With this constraint the objective can be either to minimize the number of wavelengths (related to the transmission cost) or minimize the number of Add Drop Multiplexer (shortly ADM) used in the network (related to the cost of the nodes).Here we consider the case where the network is a path on $N$ nodes, $P_N$. Thus the routing is unique. For a given grooming factor $C$ minimizing the number of wavelengths is an easy problem, well known and related to the load problem.But minimizing the number of ADM's is NP-complete for a general set of requests and no results are known. Here we show how to model the problem as a graph partition problem and using tools of design theory we completely solve the case where $C=2$ and where we have a static uniform all-to-all traffic (requests being all pairs of vertices).},
optnote = {accepted},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BBC-Sirocco05.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BBC-Sirocco05.ps.gz} 
}

@InProceedings{BePe05,
author = {J-C. Bermond and J. Peters},
title={Efficient Gathering in Radio Grids with Interference},
booktitle={Septi\`emes Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel'05)},
year={2005},
address={Presqu'\^ile de Giens},
month={May},
pages={103--106},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BePe05.pdf},

}

@INPROCEEDINGS{CFGR+05b,
author = {C. Chaudet and E. Fleury and I. Gu�rin-Lassous and H. Rivano and M.-E. Voge},
title = {Optimal positioning of active and passive monitoring devices},
booktitle = {CoNEXT 2005},
year = {2005},
address = {Toulouse, France},
month = {October},
abstract = {Network measurement is essential for assessing performance issues, identifying and locating problems. Two common strategies are the passive approach that attaches specific devices to links in order to monitor the traffic that passes through the network and the active approach that generates explicit control packets in the network for measurements. One of the key issues in this domain is to minimize the overhead in terms of hardware, software, maintenance cost and additional traffic. In this paper, we study the problem of assigning tap devices for passive monitoring and beacons for active monitoring. Minimizing the number of devices and finding optimal strategic locations is a key issue, mandatory for deploying scalable monitoring platforms. In this article, we present a combinatorial view of the problem from which we derive complexity and approximability results, as well as efficient and versatile Mixed Integer Programming (MIP) formulations.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/cfgr05b.pdf},
url = {http://dmi.ensica.fr/conext/} 
}

@INPROCEEDINGS{CFGR+05,
author = {C. Chaudet and E. Fleury and I. Gu�rin-Lassous and H. Rivano and M.-E. Voge},
title = {Surveillance passive dans l'Internet},
booktitle = {Septi�mes Rencontres Francophones sur les Aspects Algorithmiques des T�l�communications (AlgoTel'05)},
year = {2005},
pages = {121--124},
address = {Presqu'�le de Giens},
month = {May},
abstract = {Afin d'obtenir les informations n�cessaires � une bonne gestion des ressources de leur r�seau, les op�rateurs placent des sondes passives sur les liens de leurs points de pr�sence. Dans cet article, nous donnons des �critures en programmes lin�aires mixtes des probl�mes de placement de sondes simples ou avec �chantillonnage, et donnons une strat�gie pour la maintenance de la surveillance partielle de trafics dynamiques dans un point de pr�sence. Ces formulations am�liorent les r�sultats de deux articles r�cents de la litt�rature.},
pdf = {http://www-sop.inria.fr/mascotte/Algotel2005/Actes/26.pdf},
url = {http://www-sop.inria.fr/mascotte/Algotel2005/} 
}

@INPROCEEDINGS{CPPS05,
author = {D. Coudert and S. Perennes and Q-C. Pham and J-S. Sereni},
title = {Rerouting requests in WDM networks},
booktitle = {AlgoTel'05},
year = {2005},
pages = {17-20},
address = {Presqu'�le de Giens, France},
month = mai,
abstract = {We model a problem related to routing reconfiguration in WDM networks. We establish some similarities and differences with two other known problems: the pathwidth and the pursuit problem. We then present a distributed linear-time algorithm to solve the problem on trees. Last we give the solutions for some classes of graphs, in particular complete $d$-ary trees and grids.},
optpostscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCLR-AlgoTel03.ps.gz},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CPPS-AlgoTel05.pdf} 
}

@inproceedings{MR2210011,
AUTHOR = {Fiorini, S. and Hardy, N. and Reed, B. and Vetta, A.},
TITLE = {Approximate min-max relations for odd cycles in planar graphs},
BOOKTITLE = {Integer programming and combinatorial optimization},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {3509},
PAGES = {35--50},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2005},

}

@inproceedings {MR2173796,
AUTHOR = {Fiorini, S. and Hardy, N. and Reed, B. and Vetta, A.},
TITLE = {Planar graph bipartization in linear time},
BOOKTITLE = {Proceedings of GRACO2005},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {19},
PAGES = {265--271 (electronic)},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2005},

}

@InProceedings{FMNP05,
author={M. Flammini and L. Moscardelli and A. Navarra and S. P\'erennes},
title={Asymptotically Optimal Solutions for Small World Graphs},
booktitle={Proceedings of the 19th International Symposium on Distributed Computing, (DISC 2005)},
series={Lecture Notes in Computer Science},
year={2005},
month={September},
publisher={Springer Verlag},
volume={3724},
pages={414--428},
URL={http://www.mimuw.edu.pl/~disc2005/},

}

@InProceedings{FNP05,
author={M. Flammini and A. Navarra and S. P\'erennes},
title={The "Real" approximation factor of the MST heuristic for the Minimum Energy Broadcasting},
booktitle={Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms, (WEA 2005)},
series={Lecture Notes in Computer Science},
year={2005},
month={May},
publisher={Springer Verlag},
volume={3503},
pages={22--31},
URL={http://ru1.cti.gr/wea05/},

}

@inproceedings{FFN05,
author = {F. V. Fomin and P. Fraigniaud and N. Nisse},
title = {Nondeterministic Graph Searching: From Pathwidth to Treewidth},
booktitle = {Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS)},
year = {2005},
pages = {364-375},
abstract = {We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial analysis applying to both pathwidth and treewidth. We prove equivalence between this game-theoretic approach and graph decompositions called q -branched tree decompositions, which can be interpreted as a parameterized version of tree decompositions. Path decomposition and (standard) tree decomposition are two extreme cases of q-branched tree decompositions. The equivalence between nondeterministic graph searching and q-branched tree decomposition enables us to design an exact (exponential time) algorithm computing q-branched treewidth for all q, which is thus valid for both treewidth and pathwidth. This algorithm performs as fast as the best known exact algorithm for pathwidth. Conversely, this equivalence also enables us to design a lower bound on the amount of nondeterminism required to search a graph with the minimum number of searchers.},
url = {http://www.informatik.uni-trier.de/~ley/db/conf/mfcs/mfcs2005.html},
pdf={http://www-sop.inria.fr/members/Nicolas.Nisse/publications/MFCS2005.ps} 
}

@InProceedings{FrNi05,
sorte = "conf-nat",
author = {P. Fraigniaud and N. Nisse},
title = {Strat\'egies d'encerclement connexes dans un r\'eseau},
booktitle = {7\`emes Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel)},
year = {2005},
pages = {13-16},
url = {http://www-sop.inria.fr/mascotte/Algotel2005/},
pdf = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Algotel2005.ps},
abstract = {Le probl\`eme de l'encerclement dans les r\'eseaux a \'et\'e introduit par Parson (1976)~: \'etant donn\'e un r\'eseau "contamin\'e" (par exemple dans lequel un intrus s'est introduit), l'\emph{encerclement} du r\'eseau est le nombre minimum d'agents n\'ecessaires pour "nettoyer" le r\'eseau (c'est-\`a-dire capturer l'intrus). Une strat\'egie d'encerclement est dite connexe si \`a chaque \'etape de la strat\'egie, l'ensemble des liens nettoy\'es induit un sous-r\'eseau connexe. Les strat\'egies d'encerclement connexes sont essentielles si l'on souhaite assurer des communications s\^ures entre les agents. Dans le cas des r\'eseaux en arbres, Barri\`ere {\sl et al.} (2002, 2003) ont prouv\'e que le rapport entre l'encerclement connexe et l'encerclement est major\'e par 2, et que cette borne est optimale. Dans cet article, nous donnons une borne pour ce rapport dans le cas des r\'eseaux arbitraires. Pour cela nous utilisons une notion cruciale de th\'eorie des graphes~: la largeur arborescente. L'\'egalit\'e entre la largeur arborescente connexe d'un graphe et sa largeur arborescente d\'ecoule du th\'eor\`eme de Parra et Scheffler (1995). Nous donnons ici une preuve constructive de cette \'egalit\'e. Plus pr\'ecisemment, nous proposons un algorithme qui \'etant donn\'es un graphe $G$ de $n$ sommets et une d\'ecomposition arborescente de largeur $k$ de $G$, calcule en temps $O(n~k^3)$ une d\'ecomposition arborescente connexe de largeur $\leq k$ de $G$. Une cons\'equence importante de notre r\'esultat est qu'il permet de borner par $\lceil\log{n}\rceil+1$ le rapport entre encerclement connexe et encerclement d'un r\'eseau de $n$ n{\oe}uds.},

}

@InProceedings{GLP05,
author = {J. Galtier and A. Laugier and P. Pons},
title = {Algorithms to evaluate the reliability of a network},
booktitle = {The 5th International Workshop on Design of Reliable Communication Networks},
year = {2005},
pages= {93--100},
URL={http://drcn2005.telecomitalialab.com/},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/GLP05.pdf},

}

@inproceedings{Gir05,
author = {F. Giroire},
title = {Order statistics and estimating cardinalities of massive data sets},
booktitle = {2005 International Conference on Analysis of Algorithms},
year = {2005},
editor = {Conrado Martínez},
publisher = {Discrete Mathematics and Theoretical Computer Science},
volume = {AD},
series = {DMTCS Proceedings},
pages = {157-166},
url = {http://www.dmtcs.org/proceedings/html/dmAD0115.abs.html},
pdf = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/Gir05.pdf},
abstract = {We introduce a new class of algorithms to estimate the cardinality of very large multisets using constant memory and doi ng only one pass on the data. It is based on order statistics rather that on bit patterns in binary representations of numbers. We analyse three families of estimators. They attain a standard error of $\frac 1{\sqrt M}$ using $M$ unit s of storage, which places them in the same class as the best known algorithms so far. They have a very simple internal loop, which g ives them an advantage in term of processing speed. The algorithms are validated on internet traffic traces.},

}

@INPROCEEDINGS{GM05,
AUTHOR = {C. Gomes and G. {Robson Mateus}},
TITLE = {Low-Cost Design Approach to WDM Mesh Networks},
BOOKTITLE = {4th International Conference on Networking (ICN)},
SCHOOL = {Reunion Island},
YEAR = {2005},
PAGES = {60-67},

}

@inproceedings{GM05,
author= {A. Guitton and J. Moulierac},
title= {{S}calable {T}ree {A}ggregation for {M}ulticast},
booktitle= {8th International Conference on Telecommunications ({ConTEL})},
year= {2005},
month= {June},
pages= {129--134},
note= {Best Student Paper Award},
PDF={ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/guitton05scalable.pdf},
ABSTRACT={IP multicast is not widely deployed yet over Internet. This is mainly due to the forwarding entries scalability and control explosion problems. In this paper, we propose an algorithm called STA (Scalable Tree Aggregation) which reduces the number of trees by allowing several groups to be aggregated to the same tree: the less trees, the less forwarding entries and the less control messages to maintain trees. STA performs faster aggregations than previous aggregation algorithms by evaluating fewer trees for each group, while keeping the same performance. We show the scalability and the fastness of STA by extensive simulations and we compare its performance to the previous algorithm.} 
}

@InProceedings{HKS05,
author ={F. Havet and R. J. Kang and J.-S. Sereni},
booktitle={Proceedings of the 7th International Conference on Graph Theory (ICGT'05)},
month={September},
pages={123--128},
publisher={Elsevier},
series={Electronic Notes in Discrete Mathematics},
title={Improper colouring of unit disk graphs},
year={2005},
volume={22},
PDF={http://kam.mff.cuni.cz/~sereni/Articles/HKS05.pdf},
URL={http://www-sop.inria.fr/mascotte/ICGT05/},

}

@InProceedings{HaSe05,
author = {F. Havet and J.-S. Sereni},
booktitle = {Proceedings of the 31st Workshop on Graph-Theoretic Concepts in Computer Science (WG'05)},
month = {June},
pages = {81--90},
publisher = {Springer Verlag},
series = {Lecture Notes in Computer Science},
title = {Channel assignment and improper choosability of graphs},
volume = {3787},
year = {2005},
PDF={http://kam.mff.cuni.cz/~sereni/Articles/HaSe05.pdf},
URL={http://lita.sciences.univ-metz.fr/~wg2005/},

}

@InProceedings{HuRo05b,
author = {G. Huiban and G. {Robson Mateus}},
title = {A {MILP} model for the reconfiguration problem in multi-fiber {WDM} networks},
booktitle = {SBRC Simp�sio Brasileiro de Redes de Computadores},
year = {2005},
month = {May},
OPTnote = {ISBN: 85-7669-021-7},
url = {http://www.sbrc2005.ufc.br/},
PDF={ftp://ftp-sop.inria.fr/mascotte/Publications/HuRo05b.pdf},
abstract = {We address the reconfiguration problem in multi-fiber WDM networks. It consists of finding out which adaptations should be made to the virtual topology and the routing when the traffic evolves. We propose a Mixed Integer Linear Programming (MILP) model solving the problem for different objective functions. We tried to make a concise model in relations with the number of variables and restrictions, to reduce the memory occupation during the optimization process. We also add some cuts to the model. We make some experiments with this model and compare the results obtained with a simple greedy algorithm and with an algorithm from the literature} 
}

@InProceedings{HuRo05a,
author = {G. Huiban and G. {Robson Mateus}},
title = {A multiobjective approach of the virtual topology design and routing problem in {WDM} networks},
booktitle = {ICT International Conference on Telecommunications},
year = {2005},
month = {May},
publisher = {IEEE Computer Society Press},
OPTnote = {ISBN: 0-9584901-3-9},
url = {http://www.ee.up.ac.za/~ieee/ict2005/},
PDF={ftp://ftp-sop.inria.fr/mascotte/Publications/HuRo05a.pdf},
abstract = {We deal with the classical virtual topology design and routing problems in optical WDM (Wavelength Division Multiplexing) networks. We propose a multiobjective based algorithm to compute the Pareto set of solutions of the problem. Although the computational cost may be high, such approach permits the decision maker to have a better perception of the gain and the loss of choosing any given solution. We describe briefly the treated problem, and the MILP (Mixed Integer Linear Programing) model used. We present the method applied to obtain the Pareto set. We report some computational results and they fully justify the interest of carrying out a multiobjective study.} 
}

@InProceedings{KMS05a,
author={R. J. Kang and T. M\"uller and J.-S. Sereni},
booktitle={Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2005)},
month={September},
pages={193--198},
series={Discrete Mathematics and Theoretical Computer Science},
title={Improper colouring of (random) unit disk graphs},
year={2005},
URL={http://www.math.tu-berlin.de/EuroComb05/},
PDF={http://kam.mff.cuni.cz/~sereni/Articles/KMS05a.pdf},

}

@InProceedings{KLNP05,
author={R. Klasing and Z. Lotker and A. Navarra and S. P\'erennes},
title={From Balls and Bins to Points and Vertices},
booktitle={Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005)},
series={Lecture Notes in Computer Science},
publisher={Springer Verlag},
volume={3827},
month={December},
year={2005},
URL={http://www.cs.cityu.edu.hk/~isaac2005/},
pages={757--766},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/KLNP05.pdf},

}

@InProceedings{KMRS05b,
author={R. Klasing and E. Markou and T. Radzik and F. Sarracco},
title={Approximation bounds for Black Hole Search problems},
booktitle={Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS 2005)},
series={Lecture Notes in Computer Science},
publisher={Springer Verlag},
volume={3974},
month={December},
year={2005},
URL={http://www.di.unipi.it/OPODIS2005/},

}

@InProceedings{KMRS05a,
author={R. Klasing and E. Markou and T. Radzik and F. Sarracco},
title={Hardness and approximation results for black hole search in arbitrary graphs},
booktitle={Proceedings of the 12th Colloquium on Structural Information and Communication Complexity (SIROCCO 2005)},
series={Lecture Notes in Computer Science},
publisher={Springer Verlag},
volume={3499},
month={May},
year={2005},
URL={http://sirocco.informatika.sk/},
PDF={},
pages={200--215},

}

@InProceedings{LSV05,
author = {J.-F. Lalande and M. Syska and Y. Verhoeven},
title = {Arrondi al�atoire et protection des r�seaux {WDM}},
booktitle = {ROADEF},
OPTcrossref = {},
OPTkey = {},
pages = {241--242},
year = {2005},
editor = {Ecole Polytechnique de l'Universit� de Tours},
OPTvolume = {},
number = {6},
address = {Tours, France},
OPTmonth = {F�vrier},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {},
POSTSCRIPT={ftp://ftp-sop.inria.fr/mascotte/Jean-Francois.Lalande/articles/arrondi_aleatoire_et_protection_des_reseaux_wdm.ps.gz},
PDF={ftp://ftp-sop.inria.fr/mascotte/Jean-Francois.Lalande/articles/arrondi_aleatoire_et_protection_des_reseaux_wdm.pdf},
URL={http://www.ocea.li.univ-tours.fr/roadef05/},

}

@InProceedings{LaRa05,
author = {A. Laugier and S. Raymond},
title = {Recherche de graphes expansifs dans le graphe du Web},
booktitle = {Roadef},
year = {2005},
URL={http://www.ocea.li.univ-tours.fr/roadef05/},

}

@inproceedings{MR2200308,
AUTHOR = {Li, Z. and Reed, B.},
TITLE = {Heap building bounds},
BOOKTITLE = {Algorithms and data structures},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {3608},
PAGES = {14--23},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2005},

}

@inproceedings {MR2173800,
AUTHOR = {Meagher, C. and Reed, B.},
TITLE = {Fractionally total colouring {$G\sb {n,p}$}},
BOOKTITLE = {Proceedings of GRACO2005},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {19},
PAGES = {297--303 (electronic)},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2005},

}

@inproceedings{MG05b,
author= {J. Moulierac and A. Guitton},
title= {{Q}o{S} {S}calable {T}ree {A}ggregation},
booktitle= {IFIP Networking},
year= {2005},
pages = {1405--1408},
number= {3462},
series= {LNCS},
month= {May},
PDF={ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/moulierac05qos.pdf},
ABSTRACT={Some of the main reasons which prevents the deployment of IP multicast are forwarding state scalability and control explosion prob- lems. In this paper, we propose an algorithm called Q-STA (QoS Scalable Tree Aggregation) which reduces the number of forwarding states by al- lowing several groups to share the same tree. Q-STA accepts groups only if there is enough available bandwidth. Q-STA accepts much more groups and performs faster aggregations than previous algorithms.} 
}

@InProceedings{PeVo05,
author = {S. Petat and M.-E. Voge},
title={Groupage sur un chemin orient\'e},
booktitle={Septi\`emes Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel'05)},
year={2005},
address={Presqu'\^ile de Giens},
month={May},
pages={21--24},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/PeVo05.pdf},

}

@INPROCEEDINGS{RTV05,
author = {H. Rivano and F. Th�oleyre and F. Valois},
title = {Influence de l'auto-organisation sur la capacit� des r�seaux ad hoc},
booktitle = {Septi�mes Rencontres Francophones sur les Aspects Algorithmiques des T�l�communications (AlgoTel'05)},
year = {2005},
pages = {53--56},
address = {Presqu'�le de Giens},
month = {May},
abstract = {Les r�seaux ad hoc tirent parti de la collaboration des noeuds pour acheminer des informations. Si de nombreuses approches ont vu le jour, la probl�matique du routage demeure un point crucial. Deux approches se d�tachent : une premi�re r�sidant dans une vision � plat du r�seau et une seconde, plus r�cente, o� le routage repose sur une auto-organisation du r�seau. Il s'agit de fournir une solution d'organisation afin de tirer parti des propri�t�s structurelles et d'am�liorer des services tels que le routage. Les performances obtenues sont int�ressantes bien que les auto-organisations r�duisent le nombre de liens radio effectivement utilis�s. Nous proposons donc ici de quantifier les changements, en terme de bande passante disponible, entre un r�seau � plat et un r�seau structur�.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/rtv05.pdf},
url = {http://www-sop.inria.fr/mascotte/Algotel2005/} 
}

@TechReport{AHT05,
author = {L. Addario-Berry and F.~Havet and S.~Thomass\'e},
title = {Paths with two blocks in $n$-chromatic digraphs},
institution = {INRIA Research Report 5688 and I3S Research Report I3S/RR-2005-27-FR},
year = {2005},
POSTSCRIPT={ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5688.ps.gz},
PDF={ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5688.pdf},
URL={http://www.inria.fr/rrrt/rr-5688.html},
type = {Research report},

}

@TECHREPORT{BBC05b,
author = {J-C. Bermond and L. Braud and D. Coudert},
title = {Traffic Grooming on the Path},
institution = {INRIA Research Report 5645 (.ps.gz) and I3S Research Report I3S/RR-2005-20-FR (.pdf)},
year = {2005},
abstract = {In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most $1/C$ of the bandwidth of the wavelength, we will say that the grooming factor is $C$. That means that on a given edge of the network we can groom (group) at most $C$ requests on the same wavelength. With this constraint the objective can be either to minimize the number of wavelengths (related to the transmission cost) or minimize the number of Add Drop Multiplexer (shortly ADM) used in the network (related to the cost of the nodes).Here we consider the case where the network is a path on $N$ nodes, $P_N$. Thus the routing is unique. For a given grooming factor $C$ minimizing the number of wavelengths is an easy problem, well known and related to the load problem.But minimizing the number of ADM's is NP-complete for a general set of requests and no results are known. Here we show how to model the problem as a graph partition problem and using tools of design theory we completely solve the case where $C=2$ and where we have a static uniform all-to-all traffic (requests being all pairs of vertices).},
optnote = {Final version submitted to TCS},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/I3SRR-2005-20-FR.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/RR-5645.ps.gz} 
}

@TECHREPORT{BCCP05,
author = {J-C. Bermond and M. Cosnard and D. Coudert and S. Perennes},
title = {Optimal Solution of the Maximum All Request Path Grooming Problem},
institution = {INRIA Research Report 5627 (.ps.gz) and I3S Research Report I3S/RR-2005-18-FR (.pdf)},
year = {2005},
abstract = {We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the maximum number of connections which can be established in a path of size $N$, where each arc has a capacity or bandwidth $C$ (grooming factor). We present a greedy algorithm to solve the problem and an explicit formula for the maximum number of requests that can be groomed. In particular, if $C = s(s 1)/2$ and $N > s(s-1)$, an optimal solution is obtained by taking all the requests of smallest length, that is of length 1 to $s$. However this is not true in general since anomalies can exist. We give a complete analysis and the exact number of such anomalies.},
optnote = {Accepted to AICT 06},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/I3SRR-2005-18-FR.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/RR-5627.ps.gz} 
}

@TechReport{CKZ05b,
author = {C. Cooper and R. Klasing and M. Zito},
title = {Lower Bounds and Algorithms for Dominating Sets in Web Graphs},
institution = {INRIA Research Report RR-5529 and I3S Research Report I3S/RR-2005-09-FR},
year = {2005},
OPTkey = {},
OPTtype = {},
OPTnumber = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
PDF = {http://www.i3s.unice.fr/~mh/RR/2005/RR-05.09-R.KLASING.pdf},
POSTSCRIPT = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5529.ps.gz},
url = {http://hal.inria.fr/inria-00070478/fr/},
abstract = {In this paper we study the size of dominating sets, and their generalizations, in two graph processes which are widely used to model aspects of the world-wide web. In these processes each new vertex connects to the existing graph by a constant number, $m$, of edges. The terminal vertices of these edges are chosen uniformly at random or by preferential attachment depending on the process. We show that almost all such graph processes have minimal dominating sets linear in the size of the graph and give bounds for this size as a function of $m$. We obtain the upper bounds from simple on-line algorithms for dominating sets. The lower bounds are obtained by proving that the lexicographically first set of a given size is the most likely to dominate.},

}

@TECHREPORT{CDRV05,
author = {D. Coudert and P. Datta and H. Rivano and M.-E. Voge},
title = {Minimum Color Problems and Shared Risk Resource Group in Multilayer Networks},
institution = {I3S Research Report I3S/RR-2005-37-FR},
year = {2005},
type = {Research Report},
pdf = {http://www.i3s.unice.fr/~mh/RR/2005/RR-05.37-M-E.VOGE.pdf},
url = {http://www.i3s.unice.fr/~mh/RR/2005/liste-2005.html} 
}

@TECHREPORT{GoRi05,
author = {C. Gomes and H. Rivano},
title = {WDM Mesh Networks with Dynamic Traffic},
institution = {INRIA Research Report 5713},
year = {2005},
type = {Research report},
abstract = {This article presents a mathematical model that results in a low-cost network design to satisfy a set of point-to-point demands that arrive and leave the network along of time. It considers the problem of routing working traffic and assigning wavelengths in an all-optical network avoiding if possible that wavelengths assignment changes and flow rerouting. The model allows to know when a reconfiguration/expansion is needed. The model provides a physical network configuration selecting a lowest cost set of components of the network (subnetworks and OXCs) with sufficient capacities to attend the demands and the required wavelengths in all time.},
url = {http://hal.inria.fr/inria-00070304} 
}

@TechReport{Hav05,
author = {F.~Havet},
title = {Repartitors, selectors and superselectors},
institution = {INRIA Research Report 5686},
year = {2005},
POSTSCRIPT={ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5686.ps.gz},
PDF={ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5686.pdf},
URL={http://www.inria.fr/rrrt/rr-5686.html},
type = {Research report},

}

@TechReport{HuDa05,
author = {G. Huiban and P. Datta},
title = {Virtual topology reconfiguration issues in evolution of {WDM} optical networks},
institution = {INRIA},
year = {2005},
type = {Research report},
number = {5711},
pdf = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5711.pdf},
url = {http://www.inria.fr/rrrt/rr-5711.html},
abstract = {We consider the reconfiguration problem in multi-fiber WDM optical networks. In a real-time network as the traffic evolves with time: the virtual topology may not remain optimal for the evolving traffic, leading to a degradation of network performance. However, adapting the virtual topology to the changing traffic may lead to service disruption. This optimization problem hence captures the trade-off between network performance and number of reconfigurations applied to the virtual topology. The above problem is solved through a Mixed Integer Linear Programming formulation with a multivariate objective function, that captures both these parameters. However the problem is NP-hard and such an approach is unable to solve large problem instances in a reasonable time. In this paper, we also propose a simulated annealing based heuristic algorithm for solving problems of higher complexity. We compare the performance and the computation time of the MILP model and the heuristic algorithm considering different tests instances. Our results indicate that simulated annealing obtains results within 5\% of the optimal solution, thus making it a viable approach in large scale networks. } 
}

@TechReport{HuRo05c,
author = {G. Huiban and G. {Robson Mateus}},
title = {Optimization aspects of the reconfiguration problem in {WDM} networks},
institution = {INRIA Research Report 5730 and I3S Research Report I3S/RR-2005-33-FR},
year = {2005},
type = {Research report},
PDF = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5730.pdf},
URL={http://www.inria.fr/rrrt/rr-5730.html},
abstract = {We propose an in-depth study of the reconfiguration problem in multi-fiber WDM networks. It consists in defining how to adapt the optical layer to changing traffic patterns. Our objective is to treat the problem globally. We consider arbitrary mesh topology, all-to-all traffic and multi-hop routing. However, we restrict ourselves to prevision: the traffic evolutions are foreseen. We propose a compact Mixed Integer Linear Programming model, allowing to solve medium instances. We define many metrics to evaluate the performance of a solution. We also propose some mathematical cuts and a lower bound for the problem. We make extensive experiments based on this model, in order to find out the influence of different parameters, such as the metric chosen or the cut formulation. To do so, many instances were solved with different networks.} 
}

@TechReport{KMS05b,
author = {R. J. Kang and T. M\"uller and J.-S. Sereni},
title = {Improper colouring of (random) unit disk graphs},
institution = {INRIA Research Report 5761 and I3S Research Report I3S/RR-2005-35-FR},
year = {2005},
month={November},
PDF={ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5761.pdf},
POSTSCRIPT={ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5761.ps.gz},
URL={http://hal.inria.fr/inria-00070259/fr/},
type = {Research report},
abstract = {For any graph $G$, the $k$-improper chromatic number $\chi^k(G)$ is the smallest number of colours used in a colouring of $G$ such that each colour class induces a subgraph of maximum degree $k$. We investigate the ratio of the $k$-improper chromatic number to the clique number for unit disk graphs and random unit disk graphs to generalise results where only proper colouring was considered.},

}

@TechReport{KLPT05,
author = {R. Klasing and C. Laforest and J. Peters and N. Thibault},
title = {Constructing Incremental Sequences in Graphs},
institution = {INRIA Research Report RR-5648 and I3S Research Report I3S/RR-2005-22-FR},
type = {Research Report},
year = {2005},
OPTkey = {},
OPTtype = {},
OPTnumber = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
PDF = {http://www.i3s.unice.fr/~mh/RR/2005/RR-05.22-R.KLASING.pdf},
POSTSCRIPT = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5648.ps.gz},
url = {http://hal.inria.fr/inria-00070361/fr/},
abstract = {Given a weighted graph $G=(V,E,w)$, we investigate the problem of constructing a sequence of $n=|V|$ subsets of vertices $M_1,...,M_n$ (called groups) with small diameters, where the diameter of a group is calculated using distances in $G$. The constraint on these $n$ groups is that they must be incremental: $M_1\subsetM_2 \subset...\subsetM_n=V$. The cost of a sequence is the maximum ratio between the diameter of each group $M_i$ and the diameter of a group $N_i^*$ with $i$ vertices and minimum diameter: $\max_2 \leqi \leqn \left{ \fracD(M_i)D(N_i^*) \right}$. This quantity captures the impact of the incremental constraint on the diameters of the groups in a sequence. We give general bounds on the value of this ratio and we prove that the problem of constructing an optimal incremental sequence cannot be solved approximately in polynomial time with an approximation ratio less than 2 unless $P = NP$. Finally, we give a 4-approximation algorithm and we show that the analysis of our algorithm is tight.},

}

@TechReport{KMRS05c,
author = {R. Klasing and E. Markou and T. Radzik and F. Sarracco},
title = {Approximation Results for Black Hole Search in Arbitrary Networks},
institution = {INRIA Research Report RR-5659 and I3S Research Report I3S/RR-2005-23-FR},
type = {Research Report},
year = {2005},
OPTkey = {},
OPTtype = {},
OPTnumber = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
PDF = {http://www.i3s.unice.fr/~mh/RR/2005/RR-05.23-R.KLASING.pdf},
POSTSCRIPT = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5659.ps.gz},

}

@techreport{MG05a,
author = {J. Moulierac and A. Guitton},
title = {{Distributed Multicast Tree Aggregation}},
institution = {Inria},
year = {2005},
number = {5636},
month = {July},
PDF={ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/RR-5636.pdf},
ABSTRACT={Multicast is not scalable mainly due to the number of forwarding states and control overhead required to maintain trees. Tree aggregation reduces the number of multicast forwarding states and the tree maintenance overhead by allowing several multicast groups to share the same delivery tree. In this paper, we exhibit several drawbacks of the existing protocols: the latency to manage group dynamics is high, the managers are critical points of failures and some group-specific entries are stored unnecessarily. Then, we propose a new distributed protocol that significantly reduces the number of control messages and limits the number of trees within a domain. By simulations, we show that our protocol achieves good performance and outperforms the previous known distributed algorithm.} 
}

@techreport{MM05,
author = {J. Moulierac and M. Moln\`ar},
title = {{Active monitoring of delays with asymmetric routes}},
institution = {Inria},
year = {2005},
number = {5635},
month = {July},
PDF={ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/RR-5635.pdf},
ABSTRACT={There is an increasing interest in network monitoring recently. Indeed, knowledge of link characteristics is of significant importance in order to provide efficient routing. In this paper, we consider active network monitoring of link delays in a Service Provider or Enterprise IP network using round trip delays. Our proposition guarantees that all links are monitored contrary to previous propositions. Indeed, previous propositions assume symmetric routing in networks when placing the monitoring stations. With this assumption, round trips may be different when routes are asymmetric and link delays are not significant. We say that links are not monitored in this case. Previous propositions do not monitor 5.76\% of links in average and 10\% in worst cases during our simulations while we monitor always 100\% of links. Moreover, in our proposition, the amount of traffic is reduced and the measures are more precise since the distance from a monitoring station (beacon) to the edges is limited by a given bound. Indeed, probe messages use short paths, traverse less routers and less links with our proposition. Finally, the number of beacons is not increased compared to the previous heuristic and so the installation and maintenance costs are minimized.} 
}

@mastersthesis{Gne05,
author = {M.-L. Gnemmi},
title={Mise en place de d�monstrations pas-�-pas d'algorithmes de graphes},
type = {Rapport de premi\`ere ann\'ee d'\'el\`eve ing\'enieur, 2 mois, encadrant D. Coudert},
school={ENSEA},
year = {2005},
PDF={ftp://ftp-sop.inria.fr/mascotte/Stages/Rapports-2004-2005/rapport_gnemmi.pdf},

}

@MastersThesis{Lep05,
author = {C. Lepelletier},
title = {Probl\`emes de charge et de longueur d'onde sur des r\'eseaux tol\'erants des pannes},
school = {DEA MDFI, Marseille},
year = {2005},
type = {M\'emoire de DEA, 3 mois, encadrants {J-C. Bermond and S. Bessy}},

}

@MastersThesis{Sav05a,
author = {C. Savio},
title={Estimation de Matrices Origine-Destination en Temps R\'eel: Utilisation de donn\'ees issues de v\'ehicules instrument\'es en milieu urbain},
type = {Rapport de fin d'\'etudes TPE, 3 mois, encadrant P. Mussi},
school={ENTPE Vaulx-en-Velin},
year = {2005},
pdf={ftp://ftp-sop.inria.fr/mascotte/Stages/Rapports-2004-2005/rapport_savio_a.pdf},

}

@MastersThesis{Sav05b,
author = {C. Savio},
title={Estimation de Matrices Origine-Destination en Temps R\'eel},
type = {Rapport de Mast\`ere Recherche, 6 mois, encadrant P. Mussi},
school={ENTPE Vaulx-en-Velin},
year = {2005},
PDF={ftp://ftp-sop.inria.fr/mascotte/Stages/Rapports-2004-2005/rapport_savio_b.pdf},

}

@phdthesis{Lal04,
author = {J.-F. Lalande},
title = {Conception de r\'eseaux de t\'el\'ecommunications~: optimisation et exp\'erimentations},
year = {2004},
month = {D\'ecembre},
school = {\'Ecole doctorale STIC, Universit\'e de Nice-Sophia Antipolis},
PDF={ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Francois.Lalande/articles/these_conception_de_reseaux_de_telecommunications_optimisation_et_experimentations.pdf},
POSTSCRIPT={ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Francois.Lalande/articles/these_conception_de_reseaux_de_telecommunications_optimisation_et_experimentations.ps.gz} 
}

@article{BCLY04,
author= {J-C. Bermond and C.J. Colbourn and A. Ling and M-L. Yu},
title= {Grooming in unidirectional rings : $K_4 -e$ designs},
journal= {Discrete Mathematics, Lindner's Volume},
year= {2004},
volume= {284},
number= {1-3},
pages= {57--62},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BCLY04.pdf},

}

@Article{BBH+04,
title = { On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality },
author = { H.-J. B\"ockenhauer and D. Bongartz and J. Hromkovi\v{c} and R. Klasing and G. Proietti and S. Seibert and W. Unger },
year = { 2004 },
journal = { Theoretical Computer Science },
pages = { 137--153 },
volume = { 326 },
number = { 1--3 },

}

@article{CFKP+04,
author= { I. Caragiannis and A. Ferreira and C. Kaklamanis and S. P\'erennes and P. Persiano and H. Rivano },
title= { Approximate Constrained Bipartite Edge Coloring },
journal= { Discrete Applied Mathematics },
year= { 2004 },
volume= { 143 },
pages= { 54--61 },
number= { 1-3 },
month= { September },
abstract= { We study the following Constrained Bipartite Edge Coloring (CBEC) problem: We are given a bipartite graph G(U,V,E) of maximum degree l with n vertices, in which some of the edges have been legally colored with c colors. We wish to complete the coloring of the edges of G minimizing the total number of colors used. The problem has been proved to be NP-hard event for bipartite graphs of maximum degree three. },
pdf= { ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/CFKP+04.pdf },
postscript= { ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/CFKP+04.ps.gz },

}

@Article{CJY04,
author = {M. Cosnard and E. Jeannot and T. Yang},
title = "{Compact Dag Representation and its Symbolic Scheduling}",
journal = "{Journal of Parallel and Distributed Computing}",
year = {2004},
volume = {64},
number = {8},
pages = {921--935},
month = {August},

}

@ARTICLE{CeHa04,
AUTHOR = "S. C\'eroi and F. Havet",
TITLE = "Trees with three leaves are $(n+1)$-unavoidable",
JOURNAL = "Discrete Applied Mathematics",
VOLUME = "141",
YEAR = "2004",
PAGES = "19--39",
PDF = "ftp://ftp-sop.inria.fr/mascotte/Publications/CeHa04.pdf",

}

@article {MR2087864,
AUTHOR = {Dantas, S. and de Figueiredo, C. M. H. and Klein, S. and Gravier, S. and Reed, B.},
TITLE = {Stable skew partition problem},
JOURNAL = {Discrete Appl. Math.},
VOLUME = {143},
YEAR = {2004},
NUMBER = {1-3},
PAGES = {17--22},

}

@article {MR2047529,
AUTHOR = {DeVos, M. and Ding, G. and Oporowski, B. and Sanders, D. P. and Reed, B. and Seymour, P. and Vertigan, D.},
TITLE = {Excluding any graph as a minor allows a low tree-width 2-coloring},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {91},
YEAR = {2004},
NUMBER = {1},
PAGES = {25--41},

}

@Article{Fer04,
title={Building a reference combinatorial model for MANETs},
author={A. Ferreira},
journal={{IEEE} Network},
volume={18},
number={5},
year={2004},
pages={24--29},

}

@article {MR2089462,
AUTHOR = {Fertin, G. and Raspaud, A. and Reed, B.},
TITLE = {Star coloring of graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {47},
YEAR = {2004},
NUMBER = {3},
PAGES = {163--182},

}

@article{FlPe04,
author= { M. Flammini and S. P\'erennes },
title= { Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols },
journal= { SIAM Journal on Discrete Mathematics },
volume= { 17 },
number= { 4 },
pages= { 521--540 },
publisher= { SIAM, Philadelphia, USA },
year= { 2004 },
pdf= {ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/FlPe04.pdf },

}

@article{GPPR04,
title= { Distance labeling in Graphs },
author= { C. Gavoille and D. Peleg and S. P\'erennes and R. Raz },
year= { 2004 },
journal= { Journal of Algorithms },
pages= { 85--112 },
volume= { 53 },
number = {1},
pdf= { ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/GPPR04.pdf },

}

@ARTICLE{Hav04b,
AUTHOR = "F. Havet",
TITLE = "Stable set meeting every longest path",
JOURNAL = "Discrete Mathematics",
VOLUME = "289",
NUMBER = "1--3",
YEAR = "2004",
PAGES = "169--173",
PDF = "ftp://ftp-sop.inria.fr/mascotte/Publications/Hav04b.pdf",

}

@ARTICLE{Hav04,
AUTHOR = "F. Havet",
TITLE = "Pancyclic arcs and connectivity in tournaments",
JOURNAL = "Journal of Graph Theory",
VOLUME = "47",
NUMBER = "2",
YEAR = "2004",
PAGES = "87--110",
PDF = "ftp://ftp-sop.inria.fr/mascotte/Publications/Hav04.pdf",

}

@ARTICLE{HaWe04,
AUTHOR = "F. Havet and M. Wennink",
TITLE = "The Push Tree Problem",
JOURNAL = "Networks",
VOLUME = "44",
NUMBER = "4",
YEAR = "2004",
PAGES = "281--291",
PDF = "ftp://ftp-sop.inria.fr/mascotte/Publications/HaWe04.pdf",

}

@article {MR2134417,
AUTHOR = {Ho{\`a}ng, C. T. and Reed, B.},
TITLE = {On the co-{$P\sb 3$}-structure of perfect graphs},
JOURNAL = {SIAM J. Discrete Math.},
VOLUME = {18},
YEAR = {2004/05},
NUMBER = {3},
PAGES = {571--576 (electronic)},

}

@article{KlLa04,
author = {R. Klasing and C. Laforest},
title = {Hardness results and approximation algorithms of $k$-tuple domination in graphs},
journal = {Information Processing Letters},
volume = {89},
number = {2},
year = {2004},
issn = {0020-0190},
pages = {75--83},
URL = {http://dx.doi.org/10.1016/j.ipl.2003.10.004},
publisher = {Elsevier North-Holland, Inc.},

}

@article {MR2079904,
AUTHOR = {Reed, B. and Seymour, P.},
TITLE = {Hadwiger's conjecture for line graphs},
JOURNAL = {European J. Combin.},
VOLUME = {25},
YEAR = {2004},
NUMBER = {6},
PAGES = {873--876},

}

@article {MR2057781,
AUTHOR = {Reed, B. and Smith, K. and Vetta, A.},
TITLE = {Finding odd cycle transversals},
JOURNAL = {Oper. Res. Lett.},
VOLUME = {32},
YEAR = {2004},
NUMBER = {4},
PAGES = {299--301},

}

@article {MR2065894,
AUTHOR = {Reed, B. and Song, S. W. and Szwarcfiter, J. L.},
TITLE = {Preface [{B}razilian {S}ymposium on {G}raphs, {A}lgorithms and {C}ombinatorics]},
NOTE = {Held in Fortaleza, 2001},
JOURNAL = {Discrete Appl. Math.},
VOLUME = {141},
YEAR = {2004},
NUMBER = {1-3},
PAGES = {1},

}

@inProceedings{BeTh04,
AUTHOR = {Bessy, S. and Thomass\'e, S.},
TITLE = {Three min-max theorems concerning cyclic orders of strong digraphs},
booktitle= {Acts of IPCO X 2004},
series= {Lecture Notes in Computer Sciences},
volume = {3064},
pages={132--138},
PUBLISHER = {Springer-Verlag},
YEAR = {2004},
URL ={http://lapcs.univ-lyon1.fr/~bessy/},

}

@inProceedings{Bes04,
AUTHOR = {Bessy, S.},
TITLE = {Un algorithme d'approximation pour le sous-digraphe fortement connexe minimal},
booktitle = {Sixi\`emes Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel'04)},
YEAR = {2004},
pages = {57--61},
PUBLISHER = {INRIA},
URL ={http://ares.insa-lyon.fr/algotel2004/program.html},

}

@conference{CKZ04,
author= {C. Cooper and R. Klasing and M. Zito},
title= {Dominating Sets in Web Graphs},
booktitle= {Proceedings of the Third Workshop on Algorithms and Models for the Web-Graph (WAW 2004)},
series= {Lecture Notes in Computer Science},
publisher= {Springer-Verlag},
volume={3243},
pages={31--43},
year= {2004},
month={October},

}

@InProceedings{FeJa04,
author={A. Ferreira and A. Jarry},
title={Complexity of Minimum Spanning Tree in Evolving Graphs and the Minimum-Energy Broadcast Routing Problem},
booktitle ={Proceedings of WiOpt'04 -- Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks},
year = {2004},
address = {Cambridge, United Kingdom},
month = {March},

}

@inproceedings{FKNP04,
title= { Improved approximation results for the Minimum Energy Broadcasting Problem },
author= { M. Flammini and R. Klasing and A. Navarra and S. P\'erennes },
pages = {85--91},
URL= {http://doi.acm.org/10.1145/1022630.1022644},
publisher = {ACM Press},
isbn = {1-58113-921-7},
booktitle= { 2nd ACM/SIGMOBILE Annual International Joint Workshop on Foundation of Mobile Computing (DIALM-POMC 2004) },
year= { 2004 },
POSTSCRIPT= { ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/FKNP04.ps },

}

@InProceedings{FKLS04,
title={Improved Algorithms for the Connected Sensor Cover Problem},
author={S. Funke and A. Kesselman and Z. Lotker and M. Segal},
booktitle={ADHOC-NOW 04},
pages={56--59},
year={2004},

}

@InProceedings{Gal04a,
author ={J. Galtier},
title ={Optimizing the {IEEE} 802.11b Performance using Slow Congestion Window Decrease},
booktitle ={Proccedings of the 16th ITC Specialist Seminar on performance evaluation of wireless and mobile systems},
pages = {165--176},
year = {2004},
address = {Antwerpen, Belgium},
month = {August/September},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/Gal04a.pdf},

}

@INPROCEEDINGS{GM04,
AUTHOR = {C. Gomes and G. {Robson Mateus}},
TITLE = {Routing and Wavelength Assignment in a Mesh Network},
BOOKTITLE = {3rd International Information and Telecommunication Technologies Symposium (I2TS)},
SCHOOL = {S\~ao Carlos Federal University (UFSCar), SP},
YEAR = {2004},

}

@InProceedings{Jar04,
author={A. Jarry},
title = {Integral Symmetric 2-Commodity Flows},
booktitle = {Proceedings of STACS'04},
year = {2004},
address = {Montpellier},
month = {March},

}

@InProceedings{JaLa04,
author = {A. Jarry and A. Laugier},
title = {On the minimum number edges of two-connected graphs with given diameter},
booktitle = {GT04},
year = {2004},
address = {Paris, France},
month = {July},

}

@conference{JaLo04,
title= {Connectivity in Evolving Graph with Geometric Properties},
author= {A. Jarry and Z. Lotker},
year= {2004},
booktitle= {Dial MPOMC 2004 The Second ACM/SIGMOBILE Annual International Joint Workshop on Foundations of Mobile Computing},

}

@conference{KNPP04,
author= { R. Klasing and A. Navarra and A. Papadopoulos and S. P\'erennes },
title= { Adaptive Broadcast Consumption (ABC), a new heuristic and new bounds for the Minimum Energy Broadcast Routing Problem },
booktitle= { Proc.\ 3rd FIP-TC6 Networking Conference ( Networking~2004) },
series={Lecture Notes in Computer Science},
volume={3042},
publisher={Springer-Verlag},
pages= { 866--877 },
year= { 2004 },
POSTSCRIPT= { ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/KNPP04.ps },

}

@InProceedings{KLSS04,
title={Geometrically Aware Communication in Random Wireless Networks},
author={G. Kozma and Z. Lotker and M. Sharir and G. Stupp},
booktitle={24th ACM Symp.~on Principles of Distributed Computing},
pages={310--319},
year={2004},

}

@inproceedings{LiSe04,
author = {L. Liquori and B. P. Serpette},
title = {iRho: an imperative rewriting calculus},
booktitle = {Proc. of ACM-PPDP: International Conference on Principles and Practice of Declarative Programming},
year = {2004},
pages = {167--178},
POSTSCRIPT= {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/ppdp-04.ps.gz} 
}

@inproceedings{LMP04,
title= {Range-Free Ranking in Sensors Networks and Its Applications to Localization},
author= {Z. Lotker and Martinez de Albeniz, M. and S. P\'erennes},
booktitle= {ADHOC-NOW 2004},
pages= {158--171},
year= {2004},
postscript= { ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/ALP04.ps } 
}

@inproceedings{MKM04,
author = {J. Moulierac and J-C. K\"onig and M. Moln\'ar},
title = {{Diffusion contrainte dans un groupe}},
booktitle = {ALGOTEL - Rencontre francophone sur les aspects Algorithmiques des T\'el\'ecommunications},
year = {2004},
PDF={ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/moulierac04diffusion.pdf},
ABSTRACT={Dans ce papier nous traitons de problemes particuliers de communications de groupe dans les reseaux. Le probleme de diffusion contrainte dans un groupe consiste \`a envoyer un message d'un \'emetteur \`a un ensemble de destinataires en imposant son passage par des noeuds sp\'ecifiques appel\'es les traducteurs. Dans un premier temps, nous prouvons que ce probleme est NP-difficile et nous proposons une heuristique r-approchee pour le resoudre, ou r est le facteur d'approximation de l'heuristique pour le probleme de Steiner. Dans un deuxieme temps, nous presentons une heuristique permettant de resoudre le probeme de diffusion contrainte dans un groupe auquel on a rajoute une contrainte d'equilibrage.} 
}

@TechReport{AAG+04,
author = {S. Alouf and E. Altman and J. Galtier and J.-F. Lalande and C. Touati},
institution = {INRIA Sophia Antipolis},
type = {Research Report},
title = {Un algorithme d'allocation de bande passante satellitaire},
year = {2004},
number = {RR-5172},
month = {April},
address = {2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis},
POSTSCRIPT = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5172.ps.gz},
PDF = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5172.pdf},
URL = {http://www.inria.fr/rrrt/rr-5172.html},

}

@TechReport{BHT04,
author={J-C. Bermond and F. Havet and C. D. T\'oth},
title={Fault tolerant on-board networks with priorities},
institution = {INRIA},
type = {Research Report},
year = {2004},
number = {RR-5363},
month = {November},
address = {2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis},
POSTSCRIPT={ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5363.ps.gz},
PDF = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5363.pdf},
URL = {http://www.inria.fr/rrrt/rr-5363.html},

}

@TechReport{BBH04,
author={Bessy, S. and Birmel\'e, E. and F. Havet},
title={Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree},
institution = {INRIA},
type = {Research Report},
year = {2004},
number = {RR-5364},
month = {November},
address = {2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis},
POSTSCRIPT={ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5364.ps.gz},
PDF = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5364.pdf},
URL = {http://www.inria.fr/rrrt/rr-5364.html},

}

@TechReport{CGP04,
author = {S. Choplin and J. Galtier and S. P\'erennes},
title = {Optimal concave costs in the SDH context},
institution = {INRIA},
type = {Research Report},
year = {2004},
number = {RR-5201},
month = {May},
address = {2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis},
POSTSCRIPT = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5201.ps.gz},
PDF = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5201.pdf},
URL = {http://www.inria.fr/rrrt/rr-5201.html} 
}

@TechReport{CKR04,
author = {C. Cooper and R. Klasing and T. Radzik},
title = {A randomized algorithm for the joining protocol in dynamic distributed networks},
institution = {INRIA Research Report RR-5376 and I3S Research Report I3S/RR-2004-39-FR},
type = {Research Report},
year = {2004},
PDF = {http://www.i3s.unice.fr/~mh/RR/2004/RR-04.39-R.KLASING.pdf},
POSTSCRIPT = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5376.ps.gz},

}

@techreport{GM04,
author= {A. Guitton and J. Moulierac},
title= {{S}calable {T}ree {A}ggregation with a {L}arge {N}umber of {M}ulticast {G}roups},
institution= {Irisa},
number= {1663},
year= {2004},
month= {December},
PDF={ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/guitton04scalable.pdf},
ABSTRACT={IP multicast is not widely deployed yet over Internet. This is mainly due to the forwarding entries scalability and control explosion problems. In this paper, we propose an algorithm called STA (Scalable Tree Aggregation) which reduces the number of trees by allowing several groups to be aggregated to the same tree: the less trees, the less forwarding entries and the less control messages to maintain trees. STA performs faster aggregations than previous aggregation algorithms by evaluating fewer trees for each group, while keeping the same performance. We show the scalability and the fastness of STA by extensive simulations and we compare its performance to the previous algorithm.} 
}

@TechReport{HaSe04,
AUTHOR = {F. Havet and J.-S. Sereni},
TITLE = {Improper choosability of graphs and maximum average degree},
institution= {INRIA Research Report 5164 and I3S Research Report I3S/RR-2004-11-FR},
MONTH = {April},
YEAR = {2004},
POSTSCRIPT = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5164.ps.gz},
pdf = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5164.pdf},
URL={http://www.inria.fr/rrrt/rr-5164.html},
type = {Research report},

}

@techreport{KLNP04,
title= {The Points and Vertices Game},
author= {R. Klasing and Z. Lotker and A. Navarra and S. P\'erennes},
year= {2004},
number= {TRCS 030/2004},
institution= {Dipartimento di Informatica, Universit\`a degli Studi di L'Aquila},
type = {Research Report},
pdf= { ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/KLNP04.pdf },
POSTSCRIPT= { ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/KLNP04.ps },

}

@TechReport{KMP04,
author = {R. Klasing and N. Morales and S. P\'erennes},
title = {On the Complexity of Bandwidth Allocation in Radio Networks with Steady Traffic Demands},
institution = {INRIA Research Report RR-5432 and I3S Research Report I3S/RR-2004-40-FR},
type = {Research Report},
year = {2004},
PDF = {http://www.i3s.unice.fr/~mh/RR/2004/RR-04.40-R.KLASING.pdf},
POSTSCRIPT = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5432.ps.gz},
note={Submitted to Theoretical Computer Science},

}

@TechReport{LSV04,
author = {J.-F. Lalande and M. Syska and Y. Verhoeven},
institution = {INRIA Sophia Antipolis},
title = {Mascopt - A Network Optimization Library: Graph Manipulation},
year = {2004},
number = {RT-0293},
month = {April},
address = {2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/pub/rapports/RT-0293.ps.gz},
PDF = {ftp://ftp-sop.inria.fr/pub/rapports/RT-0293.pdf},
URL = {http://www-sop.inria.fr/rapports/sophia/RT-0293.html},

}

@TechReport{Nav04,
author={A. Navarra},
title={Tighter Bounds for the Minimum Energy Broadcasting problem},
year= { 2004 },
number= { TRCS 033/2004 },
institution= { Dipartimento di Informatica, Universit\`a degli Studi di L'Aquila },
type = {Research Report},

}

@MastersThesis{Bra04,
author = {L.~Braud},
title = {Groupage de trafic sur le chemin},
type = {{Rapport de stage de Magist\`ere d'Informatique, 2 mois, encadrant D.~Coudert}},
school={ENS Lyon},
year = {2004},
PDF={ftp://fpt-sop.inria.fr/mascotte/Stages/Rapports-2003-2004/rapport_braud.pdf} 
}

@MastersThesis{Dav04,
author = {A.~Davert},
title = {Reroutage incr\'emental sur r\'eseau optique},
type = {{Rapport de stage de DEA RSD, 4 mois, encadrant D.~Coudert}},
school={Universit\'e de Nice Sophia-Antipolis},
year = {2004},
PDF={ftp://ftp-sop.inria.fr/mascotte/Stages/Rapports-2003-2004/rapport_davert.pdf} 
}

@MastersThesis{Jou04,
author = {L.~Jouhet},
title = {Protocole CDMA pour les r\'eseaux Ad Hoc},
type = {{Rapport de stage de Magist\`ere d'Informatique, 2 mois, encadrant H.~Rivano}},
school={ENS Lyon},
year = {2004},
PDF={ftp://ftp-sop.inria.fr/mascotte/Stages/Rapports-2003-2004/rapport_jouhet.pdf} 
}

@MastersThesis{Mos04,
author = {C.~Mosse},
title = {Impl\'ementation d'algorithmes pour les r\'eseaux optiques {WDM}},
type = {{Rapport de fin d'\'etudes d'El\`eve Ing\'enieur Ma\^itre, 4 mois, encadrants D.~Coudert et M.~Syska}},
school={IUP GMI d'Avignon},
year = {2004},
PDF={ftp://ftp-sop.inria.fr/mascotte/Stages/Rapports-2003-2004/rapport_mosse.pdf} 
}

@MastersThesis{Pha04,
author = {Q.~C.~Pham},
title = {Etude d'un probl\`eme algorithmique intervenant dans la reconfiguration des r\'eseaux {WDM}},
type = {{Rapport de stage de Magist\`ere d'Informatique, 2 mois, encadrants D.~Coudert et S.~P\'erennes}},
school={ENS Paris},
year = {2004},
POSTSCRIPT={ftp://ftp-sop.inria.fr/mascotte/Stages/Rapports-2003-2004/rapport_pham.ps.gz} 
}

@MastersThesis{Sam04,
author = {L. Samper},
title = {A Markovian approach of the hidden terminal problem in {IEEE} 802.11},
type = {Rapport de stage de DEA MDFI, 4 mois, encadrant J. Galtier},
school={Universit\'e de Luminy, Marseille},
year = {2004},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/Stages/Rapports-2003-2004/rapport_samper.ps},

}

@MastersThesis{Sch04,
author = {A.~Schwing},
title = {Estimation fine du trafic urbain \`a partir de capteurs mobiles},
type = {{Rapport de Mast\`ere, 2 mois, encadrant P. Mussi}},
school={EPU Marseille},
year = {2004},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Stages/Rapports-2003-2004/rapport_schwing.pdf},

}

@MastersThesis{Ser04,
author = {J.~Serror},
title = {R\'eseaux d'interconnexion : tol\'erance aux pannes},
type = {{Rapport de stage de Ma\^itrise, 2 mois, encadrant J-C.~Bermond}},
school={ENS Paris},
year = {2004},
POSTSCRIPT={ftp://ftp-sop.inria.fr/mascotte/Stages/Rapports-2003-2004/rapport_serror.ps.gz} 
}

@book {MR1952980,
TITLE = {Recent advances in algorithms and combinatorics},
SERIES = {CMS Books in Mathematics/Ouvrages de Math\'ematiques de la SMC, 11},
EDITOR = {Reed, B. and Linhares-Sales, C.},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
YEAR = {2003},
PAGES = {xiv+351},

}

@PHDTHESIS{Riv03,
author = {H. Rivano},
title = {Algorithmique et t�l�communications : coloration et multiflot approch�s et applications aux r�seaux d'infrastructure},
school = {Universit� de Nice-Sophia Antipolis},
year = {2003},
month = {November},
abstract = {Cette th�se s'int�resse aux probl�matiques fondamentales d'optimisation combinatoire qui se d�gagent de la mod�lisation structurelle et algorithmique du dimensionnement des r�seaux d'infrastructure de t�l�communication. L'optimisation de ces r�seaux est essentielle aux op�rateurs de t�l�communication, qui demandent la garantie d'une exploitation efficace des ressources d�ploy�es. Nous donnons une nouvelle mod�lisation des r�seaux optiques WDM multifibres. En consid�rant un routage agr�g� au niveau des c�bles, nous optons pour une nouvelle lecture des contraintes d'affectation de longueurs d'onde fond�e sur des conflits de groupe. Nous �tudions aussi le probl�me de coloration de chemins, issu de l'affectation de longueurs d'onde dans les r�seaux optiques monofibres. Nous d�veloppons, pour la relaxation lin�aire de ce probl�me, un algorithme polynomial efficace dans les arbres de degr� born�, puis, par extension, dans les graphes de largeur arborescente born�e. Nous majorons le co�t d'une telle coloration dans les arbres binaires et donnons une (1+5/(3e)+o(1))-approximation al�atoire pour la coloration enti�re dans les arbres de degr� born�, ce qui am�liore le meilleur algorithme connu pour ce cas. Nous pr�sentons enfin des avanc�es algorithmiques pour les probl�mes de multiflot entier et fractionnaire. Nous donnons un algorithme d'arrondi al�atoire incr�mental pour l'approximation du multiflot entier. Motiv�s par le besoin d'un calcul rapide de multiflot fractionnaire pour l'algorithme pr�c�dent, nous nous int�ressons aux approximations combinatoires de ce probl�me. En employant des techniques de calcul dynamique des plus courts chemins, nous am�liorons l'un des meilleurs algorithme de la litt�rature.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/these.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/these.ps.gz},
url = {http://www-sop.inria.fr/mascotte/Herve.Rivano/?lang=fr&to_inc=thesis.php} 
}

@PhdThesis{Tou03,
author = {C. Touati},
title = {Les principes d'\'equit\'e appliqu\'es aux r\'eseaux de t\'el\'ecommunications},
school = {Universit\'e de Nice-Sophia Antipolis},
year = {2003},
month = {September} 
}

@INBOOK{CoMu03,
chapter = {37, Graph Theory and Traffic Grooming in WDM Rings},
pages = {759-778},
title = {Recent Research Developments in Optics, 3},
publisher = {Research Signpost. Kerala, India},
year = {2003},
author = {D. Coudert and X. Mu{\~n}oz},
note = {ISBN: 81-271-0028-5},
abstract = { This paper has a double purpose. In the first part of the paper we give an overview of different aspects of graph theory which can be applied in communication engineering, not trying to present immediate results to be applied neither a complete survey of results, but to give a flavor of how graph theory can help research in optical networks. The second part of this paper is a detailed example of the usage of graph theory, but it is also a complete survey of recent results in minimization of the number of add--drop multiplexers (ADMs) required in a WDM ring with traffic grooming.},
optnumber = {3},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CoMu03.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CoMu03.ps.gz} 
}

@incollection {MR1952984,
AUTHOR = {Reed, B.},
TITLE = {Algorithmic aspects of tree width},
BOOKTITLE = {Recent advances in algorithms and combinatorics},
SERIES = {CMS Books Math./Ouvrages Math. SMC},
VOLUME = {11},
PAGES = {85--107},
PUBLISHER = {Springer},
ADDRESS = {New York},
YEAR = {2003},

}

@Article{BBPY03,
Author= {R. Balakhrishnan and J-C. Bermond and P. Paulraja and M-L. Yu},
Title= {On Hamilton cycle decompositions of the tensor product of complete graphs},
Year={2003},
Journal={Discrete Mathematics},
Volume= {268},
Pages={49--58},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BBPY03.pdf},

}

@article{BCRV03,
author = {O. Barrientos and R. Correa and P. Reyes and A. Valdebenito},
title = {A Branch and Bound Method for Solving Integer Separable Concave Problems},
journal = {Comput. Optim. Appl.},
volume = {26},
number = {2},
year = {2003},
issn = {0926-6003},
pages = {155--171},
url = {http://dx.doi.org/10.1023/A:1025746430535},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/BCRV03.pdf},
publisher = {Kluwer Academic Publishers},
address = {Norwell, MA, USA},
abstract = {A branch and bound algorithm is proposed for solving integer separable concave problems. The method uses Lagrangian duality to obtain lower and upper bounds. We show that the dual program of a separable concave problem is a linear program. Moreover, we identify an excellent candidate to test on each region of the branch and we show an optimality sufficient condition for this candidate. Preliminary computational results are reported.},

}

@Article{BBPP03,
author = {J-C. Bermond and J. Bond and D. Peleg and S. P\'erennes},
title = {The power of small coalitions in graphs},
journal = {Discrete Applied Mathematics, Editor's Choice},
year = {2003},
Volume= {127},
number={3},
Pages={399-414},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BBPP03.pdf},

}

@Article{BeCe03,
author = {J-C. Bermond and S. Ceroi},
title = {Minimizing {SONET ADM}s in unidirectional {WDM} rings with grooming ratio 3},
journal = {Networks},
year = {2003},
Volume= {41},
Number= {2},
Pages={83--86},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BeCe03.pdf},

}

@article{BCP03,
author= { J-C. Bermond and S. Choplin and S. P\'erennes },
title= { Hierarchical ring networks design },
journal= { Theory of Computing Systems },
year= { 2003 },
volume= { 36 },
number = {6},
pages= { 663--682 },
pdf= { http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BCP03.pdf },

}

@ARTICLE{BCY03,
author = {J-C. Bermond and D. Coudert and M-L. Yu},
title = {{On DRC-Covering of $K_n$ by cycles}},
journal = {Journal of Combinatorial Designs},
year = {2003},
volume = {11},
pages = {100-112},
number = {2},
abstract = {This paper considers the cycle covering of complete graphs motivated by the design of survivable WDM networks, where the requests are routed on sub-networks which are protected independently from each other. The problem can be stated as follows~: for a given graph $G$, find a cycle covering of the edge set of $K_n$, where $V(K_n) = V(G)$, such that each cycle in the covering satisfies the disjoint routing constraint (DRC), relatively to $G$, which can be stated as follows~: to each edge of $K_n$ we associate in G a path and all the paths associated to the edges of a cycle of the covering must be vertex disjoint. Here we consider the case where $G = C_n$, a ring of size $n$ and we want to minimize the number of cycles in the covering. We give optimal solutions for the problem as well as for variations of the problem, namely, its directed version and the case when the cycle length is fixed to 4.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCY-JCD03.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCY-JCD03.ps.gz},
url = {http://dx.doi.org/10.1002/jcd.10040} 
}

@article{BFIP03,
author= { J-C. Bermond and M. {Di Ianni} and M. Flammini and S. P\'erennes },
title= { Acyclic orientations for deadlock prevention in usual networks },
year= { 2003 },
journal= { Discrete Applied Mathematics },
volume= { 129 },
number = {1},
pages= { 31--47 },
pdf= { http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BDFP03.pdf },

}

@article{BMPP03,
author= { J-C. Bermond and N. Marlin and D. Peleg and S. P\'erennes },
title= { Directed Virtual Path Layout in {ATM} networks },
journal= { Theoretical Computer Science },
year= { 2003 },
volume= { 291 },
number = {1},
pages= { 3--28 },
pdf={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BMPP03.pdf},

}

@ARTICLE{BFJ03a,
AUTHOR = {B. Bui-Xuan and A. Ferreira and A. Jarry},
JOURNAL = {International Journal of Foundations of Computer Science},
MONTH = {April},
NUMBER = {2},
PAGES = {267--285},
TITLE = {Computing shortest, fastest, and foremost journeys in dynamic networks},
VOLUME = {14},
YEAR = {2003},
OPTnote = {},
OPTannote = {} 
}

@article {MR1999215,
AUTHOR = {C{\u{a}}linescu, G. and Fernandes, C. G. and Reed, B.},
TITLE = {Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width},
JOURNAL = {J. Algorithms},
VOLUME = {48},
YEAR = {2003},
NUMBER = {2},
PAGES = {333--359},

}

@article{CKLW03,
author = {H. Cirstea and C. Kirchner and L. Liquori and B. Wack},
title = {{Rewrite strategies in the Rewriting Calculus}},
journal = {WRS, International Workshop on Reduction Strategies in Rewriting and Programming. Electr. Notes Theor. Comput. Sci.},
volume = {86},
number = {4},
year = {2003},
POSTSCRIPT= {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/wrs-03.ps.gz} 
}

@ARTICLE{CFPP+03,
AUTHOR = {A. Clementi and A. Ferreira and P. Penna and S. P\'erennes and R. Silvestri},
JOURNAL = {Algorithmica},
KEY = {j},
NUMBER = {2},
PAGES = {95--110},
TITLE = {{The Minimum Range Assignment Problem on Linear Radio Networks}},
VOLUME = {35},
YEAR = {2003},

}

@article{FPRR+03,
author= { A. Ferreira and S. P\'erennes and A. W. Richa and H. Rivano and N. Stier },
title= { Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks },
journal= { Telecommunication Systems },
year= { 2003 },
volume= { 24 },
pages= { 123--138 },
number= { 2 },
month= { October },
abstract= { In this paper, we study multi-fiber optical networks with wavelength division multiplexing (WDM). We extend the definition of the well-known Wavelength Assignment Problem (WAP) to the case of k fibers per link and w wavelengths per fiber, generalization that we will call (k,w)-WAP. We develop a new model for the (k,w)-WAP based on conflict hypergraphs. Furthermore, we consider two natural optimization problems that arise from the (k,w)-WAP: minimizing the number of fibers k given a number of wavelengths w, on one hand, and minimizing w given k, on the other. We develop and analyze the practical performance of two methodologies based on hypergraph coloring. },
pdf= { ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/fprrs03a.pdf },
url= { http://www.springerlink.com/content/m38310658021/ },

}

@Article{GHHN+03,
author = {J. Galtier and F. Hurtado and M. Noy and S. P\'erennes and J. Hurrutia},
title = {Simultaneous edge flipping in triangulations},
journal = {International Journal of Computational Geometry and Applications},
year = {2003},
volume = {13},
number = {2},
pages = {113--133} 
}

@article{GLO03,
author = {O. Goldschmidt and A. Laugier and E. Olinick},
title = {SONET/SDH ring assignment with capacity constraints},
journal = {Discrete Applied Math.},
volume = {129},
pages = {99--128},
month = {June},
year = {2003},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GLO03.pdf},

}

@ARTICLE {Hav03,
AUTHOR = "F. Havet",
TITLE = "On unavoidability of trees with $k$ leaves",
JOURNAL = "Graphs and Combinatorics",
VOLUME = "19",
YEAR = "2003",
PAGES = "101--110",
PDF = "ftp://ftp-sop.inria.fr/mascotte/Publications/Hav03.pdf",

}

@article {MR2025948,
AUTHOR = {Loebl, M. and Ne{\v{s}}et{\v{r}}il, J. and Reed, B.},
TITLE = {A note on random homomorphism from arbitrary graphs to {$\mathbb Z$}},
NOTE = {EuroComb'01 (Barcelona)},
JOURNAL = {Discrete Math.},
VOLUME = {273},
YEAR = {2003},
NUMBER = {1-3},
PAGES = {173--181},

}

@article {MR2025949,
AUTHOR = {McDiarmid, C. and Reed, B.},
TITLE = {Channel assignment on graphs of bounded treewidth},
NOTE = {EuroComb'01 (Barcelona)},
JOURNAL = {Discrete Math.},
VOLUME = {273},
YEAR = {2003},
NUMBER = {1-3},
PAGES = {183--192},

}

@article {MR2146357,
AUTHOR = {Reed, B.},
TITLE = {The height of a random binary search tree},
JOURNAL = {J. ACM},
VOLUME = {50},
YEAR = {2003},
NUMBER = {3},
PAGES = {306--332 (electronic)},

}

@Article{TAG03c,
author = {C. Touati and E. Altman and J. Galtier},
title = {Semi-definite programming approach for bandwidth allocation and routing in networks},
journal = {Game Theory and Applications},
pages = {169--179},
publisher = {Nova},
year = {2003},
volume = {9},

}

@InProceedings{ABF+03,
author = {E. Altman and I. Buret and B. Fabre and J. Galtier and C. Guiraud and T. Tocker and C. Touati},
title = {Slot allocation in a {TDMA} satellite system: simulated annealing approach},
booktitle = {Proceedings of AIAA International Communication Satellite Systems Conference and Exhibit},
year = {2003},
address = {Yokohama, Japan},
month = {April},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/ABF+03.pdf},

}

@InProceedings{AGT03b,
author = {E. Altman and J. Galtier and C. Touati},
title = {Radio Planning in Multibeam Geostationary Satellite Networks},
booktitle = {Proceedings of AIAA International Communication Satellite Systems Conference and Exhibit},
year = {2003},
address = {Yokohama, Japan},
month = {April},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/AGT03b.pdf},

}

@InProceedings{AGT03a,
author = {E. Altman and J. Galtier and C. Touati},
title = {Semi-definite programming approach for bandwidth allocation and routing in networks},
booktitle = {Proceedings of ITC 18},
year = {2003},
pages = {1091--1100},
address = {Berlin, Germany},
month = {August/September},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/AGT03a.pdf},

}

@inproceedings{BCKL03,
author = {G. Barthe and H. Cirstea and C. Kirchner and L. Liquori},
title = {{Pure Patterns Type Systems}},
booktitle = {{POPL, Symposium on Principles of Programming Languages}},
PUBLISHER = {ACM},
year = {2003},
pages = {250--261},
POSTSCRIPT= {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/popl-03.ps.gz} 
}

@InProceedings{BLS03,
author = {R. Bayon and N. Lygeros and J.-S. Sereni},
title = {Nouveaux progr\`es dans l'\'enum\'eration des mod\`eles mixtes},
booktitle = {Knowledge discovery and discrete mathematics : JIM'2003},
pages = {243--246},
year = {2003},
PUBLISHER = {INRIA},
number = {},
series = {},
address = {Universit\'e de Metz, France},
URL={http://www.iut.univ-metz.fr/~esanjuan/JIM03/},
PDF={http://kam.mff.cuni.cz/~sereni/Articles/BLS03.pdf},

}

@INPROCEEDINGS{BCM03,
author = {J-C. Bermond and D. Coudert and X. Mu{\~n}oz},
title = {Traffic Grooming in Unidirectional {WDM} Ring Networks: The All-to-all Unitary Case},
booktitle = {The 7th IFIP Working Conference on Optical Network Design \& Modelling -- ONDM},
year = {2003},
pages = {1135-1153},
address = {Budapest, Hongrie},
abstract = {We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. This problem corresponds to a partition of the edges of the complete graph into subgraphs, where each subgraph has at most $C$ edges (where $C$ is the grooming ratio) and where the total number of vertices has to be minimized. Using tools of graph and design theory, we optimally solve the problem for practical values and infinite congruence classes of values for a given $C$. Among others, we give optimal constructions when $C\geq N(N-1)/6$ and results when $C=12$. We also show how to improve lower bounds by using refined counting techniques, and how to use efficiently an ILP program by restricting the search space.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCM-ONDM03.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCM-ONDM03.ps.gz} 
}

@INPROCEEDINGS{BeCo03,
author = {J-C. Bermond and D. Coudert},
title = {Traffic Grooming in Unidirectional {WDM} Ring Networks using Design Theory},
booktitle = {IEEE ICC},
year = {2003},
volume = {2},
pages = {1402-1406},
address = {Anchorage, Alaska},
month = may,
note = {ON07-3},
abstract = { We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. We show that this problem corresponds to a partition of the edges of the complete graph into subgraphs, where each subgraph has at most $C$ edges (where $C$ is the grooming ratio) and where the total number of vertices has to be minimized. Using tools of graph and design theory, we optimally solve the problem for practical values and infinite congruence classes of values for a given $C$, and thus improve and unify all the preceding results. We disprove a conjecture of Chiu and Modiano (IEEE/OSA JLT 2000) saying that the minimum number of ADMs cannot be achieved with the minimum number of wavelengths, and also another conjecture of Hu (OSA JON 2002).},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BC-ICC03.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BC-ICC03.ps.gz} 
}

@InProceedings{BDH+03,
Author= {J-C. Bermond and O. Delmas and F. Havet and M. Montassier and S. P\'erennes},
Title= {R\'eseaux de t\'el\'ecommunications minimaux embarqu\'es tol\'erants},
Year={2003},
Pages = {27--32},
BookTitle={Conference ALGOTEL2003, Banyuls, May 2003},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BDH+03.pdf},

}

@InProceedings{BDPS03,
Author= {J-C. Bermond and O. DeRivoyre and S. P\'erennes and M. Syska },
Title= {Groupage par tubes},
Year={2003},
Pages = {169--174},
BookTitle={Conference ALGOTEL2003, Banyuls, May 2003},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BDPS03.pdf},

}

@INPROCEEDINGS{BDF03,
AUTHOR = {P. Berthom\'e and M. Diallo and A. Ferreira},
BOOKTITLE = {Proceedings of WG'03},
MONTH = {June},
PAGES = {71--80},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {Generalized Parametric Multi-Terminal Flows Problem},
VOLUME = {2880},
YEAR = {2003},

}

@INPROCEEDINGS{BhFe03,
AUTHOR = {S. Bhadra and A. Ferreira},
ADDRESS = {Montreal},
BOOKTITLE = {Proceedings of Adhoc-Now'03},
MONTH = {October},
TITLE = {Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks},
YEAR = {2003},
pages = {259--270},
editor = {S. Pierre and M. Barbeau and E. Kranakis},
volume = {2865},
series = {Lecture Notes in Computer Science},
publisher = {Springer Verlag},

}

@INPROCEEDINGS{BCL+03,
author = {M. Bouklit and D. Coudert and J-F. Lalande and C. Paul and H. Rivano},
title = {Approximate multicommodity flow for {WDM} networks design},
booktitle = {SIROCCO 10},
year = {2003},
editor = {J. Sibeyn},
number = {17},
series = {Proceedings in Informatics},
pages = {43--56},
address = {Umea, Sweden},
publisher = {Carleton Scientific},
abstract = { The design of WDM optical networks is an issue for telecom operators since the spreading of this technology will not occur unless enough performance guarantees are provided. Motivated by the quest for efficient algorithms for the Routing and Wavelength Assignment problem (RWA), we address approximations of the fractional multicommodity flow problem which is the central part of a complex randomized rounding algorithm for the integral problem. Through the use of dynamic shortest path computations and other combinatorial approaches, we improve on the best known algorithm. We also provide directions for further improvements.},
optmonth = {#jun#},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCLPR-SIROCCO03.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCLPR-SIROCCO03.ps.gz} 
}

@INPROCEEDINGS{BCLR03,
author = {M. Bouklit and D. Coudert and J-F. Lalande and H. Rivano},
title = {Approximation combinatoire de multiflot fractionnaire : am�liorations},
booktitle = {AlgoTel'03},
year = {2003},
address = {Banyuls-sur-mer, France},
month = mai,
abstract = {Motiv\'e par la recherche d'algorithmes performants de dimensionnement de r\'eseaux optiques WDM, nous consid\'erons les $(1+\epsilon)$-approximations du calcul de multiflot fractionnaire. Nous proposons des am\'eliorations d'un algorithme de la litt\'erature en utilisant des calculs de plus courts chemins dynamiques, \'eventuellement sp\'ecialis\'e au cas du routage optique dans les r\'eseaux WDM multifibres sans conversion.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCLR-AlgoTel03.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCLR-AlgoTel03.ps.gz} 
}

@INPROCEEDINGS{BFJ03b,
AUTHOR = {B. Bui-Xuan and A. Ferreira and A. Jarry},
ADDRESS = {Sophia Antipolis},
BOOKTITLE = {{Proceedings of WiOpt'03 -- Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks}},
MONTH = {March},
PAGES = {141--150},
PUBLISHER = {INRIA Press},
TITLE = {Evolving graphs and least cost journeys in dynamic networks},
YEAR = {2003},

}

@inproceedings{ BBH+03,
author= {H.-J.~B\"ockenhauer and D.~Bongartz and J.~Hromkovi\v{c} and R.~Klasing and G.~Proietti and S.~Seibert and W.~Unger },
title= {On $k$-Edge-Connectivity Problems with Sharpened Triangle Inequality (Extended Abstract) },
booktitle= {Proc.\ 5th Italian Conference on Algorithms and Complexity ({\em CIAC~2003}) },
series= {Lecture Notes in Computer Science},
publisher={Springer-Verlag },
volume= {2653},
pages= {189--200},
year= {2003 },

}

@inproceedings{CLM03b,
author = {A. Ciaffaglione and L. Liquori and M. Miculan},
title = {Reasoning on an imperative object-based calculus in Higher Order Abstract Syntax},
booktitle = {{MERLIN, International Workshop on Mechanized Reasoning about Languages with Variable Binding}},
publisher = {ACM},
year = {2003},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/merlin-03.pdf} 
}

@inproceedings{CLM03a,
author = {A. Ciaffaglione and L. Liquori and M. Miculan},
title = {Imperative Object-Based Calculi in Co-inductive Type Theories},
booktitle = {{LPAR, International Conference on Logic for Programming Artificial Intelligence and Reasoning}},
series = lncs,
VOLUME = {2850},
year = {2003},
pages = {59--77},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/lpar-03.pdf} 
}

@INPROCEEDINGS{CLW03,
AUTHOR = {Cirstea,~H. and Liquori,~L. and Wack,~B.},
TITLE = {{Rewriting Calculus with Fixpoints: Untyped and First-order Systems}},
YEAR = {2003},
BOOKTITLE = {TYPES, International Workshop on Types for Proof and Programs},
series = lncs,
VOLUME = {3085},
PAGES = {147--161},
PUBLISHER = {Springer Verlag},
POSTSCRIPT= {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/types-03.ps.gz} 
}

@InProceedings{CHRV03,
author = {A. Clementi and G. Huiban and G. Rossi and Y. Verhoeven},
title = {On the approximation ratio of the {MST} based heuristic for the energy-efficient broadcast problem in static ad-hoc radio networks},
booktitle = {Parallel and Distributed Processing Symposium (IPDPS)},
pages = {8},
year = {2003},
month = {April},
publisher = {IEEE Computer Society Press},
OPTnote = {DOI 10.1109/IPDPS.2003.1213407},
url = {http://www.ipdps.org/ipdps2003/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CHRV03.pdf},
abstract = {We present a technique to evaluate the approximation ratio on random instances of the Minimum Energy Broadcast Problem in Ad-Hoc Radio Networks which is known to be NP-hard and approximable within 12. Our technique relies on polynomial-time computable lower bound on the optimal cost of any instance. The main result of this paper is that the approximation ratio has never achieved a value greater than 6.4. Furthermore, the worst values of this ratio are achieved for small network sizes. We also provide a clear geometrical motivation of such good approximation results.} 
}

@INPROCEEDINGS{CRR03,
author = {D. Coudert and H. Rivano and X. Roche},
title = {A combinatorial approximation algorithm for the multicommodity flow problem},
booktitle = {WAOA 03},
year = {2003},
editor = {K. Jansen and R. Solis-Oba},
number = {2909},
series = {Lecture Notes in Computer Science},
pages = {256--259},
address = {Budapest, Hungary},
month = sep,
publisher = {Springer-Verlag},
abstract = { This work is motivated by the need for approximation algorithms for the integral multicommodity flow problem which arise in numerous optimization scenarios, including the design of telecommunication networks. We improve on one of the most efficient known combinatorial approximation algorithm for fractional multicommodity flow by using an incremental approach. This approach is validated by experimental results, which show a significant speed-up.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CRR-WAOA03.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CRR-WAOA03.ps.gz} 
}

@inproceedings{DaMu03,
AUTHOR = {O. Dalle and P. Mussi},
TITLE = {Cooperative Software Development and Computational Resource Sharing},
BOOKTITLE = {NMSC System Simulation Workshop},
YEAR = 2003,
ORGANIZATION = {European Space Agency},
MONTH = mar,
ADDRESS = {ESTEC, Noordwijk, The Netherlands} 
}

@INPROCEEDINGS{FPR+03b,
author = {Ferreira, A. and Perennes, S. and Richa, A.W. and Rivano, H. and Stier Moses, N.},
title = {Models, complexity and algorithms for the design of multifiber WDM networks},
booktitle = {Telecommunications, 2003. ICT 2003. 10th International Conference on},
year = {2003},
volume = {1},
pages = {12--18},
month = {23 Feb.-1 March},
abstract = {We study multifiber optical networks with wavelength division multiplexing (WDM). Assuming that the lightpaths use the same wavelength from source to destination, we extend the definition of the well-known wavelength assignment problem (WAP), to the case where there are k fibers per link, and w wavelengths per fiber are available: This generalization is called the (k,w)-WAP. We develop a new model for the (k,w)-WAP, based on conflict hypergraphs: conflict hypergraphs more accurately capture the lightpath interdependencies, generalizing the conflict graphs used for single-fiber networks. By relating the (k,w)-WAP with the hypergraph coloring problem, we prove that the former is NP-complete, and present further results with respect to the complexity of that problem. We consider the two natural optimization problems that arise from the (k,w)-WAP: the problem of minimizing k given w, and that of minimizing w given k. We develop and analyze the practical performances of two methodologies based on hypergraph coloring, one for each of the two optimization problems, on existing backbone networks in Europe and in the USA. The first methodology relies on two heuristics based on a randomized approximation algorithm and the second consists on an integer programming formulation.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/fprrs03.pdf} 
}

@InProceedings{GNTD03,
author = {F. Giroire and A. Nucci and N. Taft and C. Diot},
title = {Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection},
booktitle = {Proceedings of the Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM)},
year = {2003},
url = {http://www.sprintlabs.com/People/anucci/Papers/Infocom03.pdf},
pdf = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/GNTD03.pdf},
abstract = {There are two fundamental technology issues that challenge the robustness of IP backbones. First, SONET protection is gradually being removed because of its high cost (while SONET framing is kept for failure detection purposes). Protection and restoration are provided by the IP layer that operates directly over a DWDM infrastructure. Second, ISPs are systematically forced to use the shortest distance path between two Points of Presence in order to meet their promised SLAs. In this context, IP backbones are extremely vulnerable to fiber cuts that can bring down a significant fraction of the IP routes. We propose two solutions (an ILP model and a heuristic algorithm) to optimally map a given IP topology onto a fiber infrastructure. The version of the mapping problem that we address incorporates a number of real constraints and requirements faced by carriers today. The optimal mapping maximizes the robustness of the network while maintaining the ISP's SLA delay requirements. In addition, our heuristic takes into consideration constraints such as a shortage of wavelengths and priorities among POPs and routes. The heuristic is evaluated on the Sprint backbone network. We illustrate the tradeoffs between the many requirements.},

}

@INPROCEEDINGS{GM03,
AUTHOR = {C. Gomes and G. {Robson Mateus}},
TITLE = {Aloca\c c\~ao de Caminhos Comutatos por R\'otulo em Redes Multiplexadas por Comprimento de Onda},
BOOKTITLE = {SPG},
SCHOOL = {Minas Gerais Federal University, MG},
YEAR = {2003},

}

@InProceedings{JaLa03,
author = {A. Jarry and A. Laugier},
title = {Graphes 2-connexes \`a diam\`etre donn\'e},
booktitle = {ROADEF 2003},
pages = {102--104},
year = {2003},
PUBLISHER = {Universit\'e d'Avignon et des Pays de Vaucluse},
number = {5},
series = {Proceedings in Informatics},
address = {Avignon, France},
month = {June},

}

@InProceedings{LPS03,
author = {J.-F. Lalande and S. P\'erennes and M. Syska},
title = {Groupage dans les r\'eseaux dorsaux {WDM}},
booktitle = {ROADEF 2003},
pages = {254--255},
year = {2003},
PUBLISHER = {Universit\'e d'Avignon et des Pays de Vaucluse},
number = {5},
series = {Proceedings in Informatics},
address = {Avignon, France},
month = {June},

}

@INPROCEEDINGS{LaPe03,
AUTHOR = {A. Laugier and S. Petat},
BOOKTITLE = {Proc. of International Network Optimization Conference},
PAGES = {374--379},
TITLE = {Network Design and b-matching},
YEAR = {2003},
OPTsorte = {#colin},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/Publications/LaPe03.ps},

}

@INPROCEEDINGS{TGCG+03,
AUTHOR = {E. Trajano and D. Guigue and E. Costa and C. Gomes and H. Almeida and K. Silva and N. Cavalcanti},
TITLE = {SOS - A Tool for the Automatic Segmentation of Musical Flows},
BOOKTITLE = {IX SBCM},
SCHOOL = {Campinas, SP},
YEAR = {2003},

}

@TechReport{Hav03c,
AUTHOR = "F. Havet",
TITLE = "Stable set meeting every longest path",
institution = "INRIA Research Report 5009 and I3S Research Report I3S/RR-2003-29-FR",
YEAR = "2003",
type="Research Report",
URL = {http://www.inria.fr/rrrt/rr-5009.html},
PDF = {http://www.i3s.unice.fr/~mh/RR/2003/RR-03.29-F.HAVET.pdf},

}

@Techreport{Hav03b,
AUTHOR = "F. Havet",
TITLE = "Upper bound for the span of (s,1)-total labelling of graphs",
institution = "INRIA Research Report 4816 and I3S Research Report I3S/RR-2003-13-FR",
YEAR = "2003",
type="Research Report",
url = {http://www.inria.fr/rrrt/rr-4816.html},
PDF = {http://www.i3s.unice.fr/~mh/RR/2003/RR-03.13-F.HAVET.pdf},

}

@MastersThesis{Aco03,
author = {A.~Acosta},
title = {MOEDIG~: Environnement de simulation pour mod�les � \'ev�nements discrets g\'en\'eralis\'es},
type = {Rapport de Magist�re en Ing\'enierie Electronique et Informatique, 6 mois, encadrants O. Dalle et P. Mussi},
school={ENS Bretagne},
year = {2003},

}

@MastersThesis{Der03,
author = {O.~de~Rivoyre},
title = {Optimisation du groupage dans les r\'eseaux de t\'el\'ecommunication},
type = {Rapport de DEA RSD, 5 mois, encadrants J-C. Bermond et M. Syska},
school={Universit\'e de Nice Sophia-Antipolis},
year = {2003},

}

@MastersThesis{Esp03,
author = {L.~Esperet},
title = {Coloration $(d,1)$-totale et m\'ethode probabiliste},
type = {Rapport de Magist�re d'Informatique, 5 semaines, encadrant F. Havet},
school={ENS Lyon},
year = {2003},

}

@mastersthesis{Gir03,
author = {F. Giroire},
title = {Etude de Probl\`emes Combinatoires li\'es \`a l'Analyse du G\'enome : S\'equen\c{c}age et Polymorphisme},
year = {2003},
school = {DEA Algorithmique, Universit\'e Paris VI.},
pdf = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/Gir03.pdf},
abstract = {},

}

@MastersThesis{Jou03,
author = {G.~Joutel},
title = {Synth�se de r\'eseau},
type = {Rapport de Magist�re d'Informatique, 6 semaines, encadrant J. Galtier},
school={Universit\'e Claude Bernard, Lyon I},
year = {2003},

}

@MastersThesis{Mor03,
author = {N.~Morales},
title = {Robust models for simultaneous open pit and underground mines},
type = {Rapport de stage Chilean pre-doc, 4 mois et 1/2, encadrant R. Klasing},
year = {2003},

}

@MastersThesis{Pap03,
author = {A.~Papadopoulos},
title = {Adaptive broadcast consumption (ABC), a new heuristic and new bounds for the minimum energy broadcast routing problem},
type = {Rapport de Master, Gr\`ece, 6 mois, encadrant R. Klasing},
year = {2003},

}

@MastersThesis{Roc03,
author = {X. Roche},
title = {Approximation du multiflot fractionnaire},
type = {Rapport de Magist�re d'Informatique, 5 semaines, encadrants D. Coudert et H. Rivano},
school={ENS Lyon},
year = {2003},

}

@MastersThesis{Vog03,
author = {M.-E.~Voge},
title = {Conception de r\'eseaux SDH en anneaux},
type = {Rapport de DEA ROCO, 4 mois, encadrants M.Burlet et A.Laugier},
school={INP Grenoble},
year = {2003},

}

@misc{DaFr03,
AUTHOR = {Dalle, O. and Fran\c{c}oise, O.},
TITLE = {Building High Performance Communications Through the Virtual File System {API}},
HOWPUBLISHED = {Solutions Linux International Conference},
YEAR = {2003},
MONTH = {February},
address = {Paris},

}

@book {MR1869439,
AUTHOR = {Molloy, M. and Reed, B.},
TITLE = {Graph colouring and the probabilistic method},
SERIES = {Algorithms and Combinatorics},
VOLUME = {23},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin},
YEAR = {2002},
PAGES = {xiv+326},

}

@BOOK{AlFe02,
EDITOR = {H. Alt and A. Ferreira},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{Proceedings of STACS 2002}},
VOLUME = {2285},
YEAR = {2002},

}

@proceedings{DFR02,
TITLE = {Cinqui\`eme Ecole d'Hiver des T\'el\'ecommunications},
YEAR = 2002,
EDITOR = {Dalle, O. and Fr\'enot, S. and Riveill, M.},
ADDRESS = {Golfe Juan, France},
MONTH = dec,
PUBLISHER = {INRIA},
ORGANIZATION = {INRIA - CNRS - Univ. de Nice} 
}

@PhdThesis{Cho02,
author = {S. Choplin},
title = {Dimensionnement de r\'eseaux virtuels de t\'el\'ecommunication},
school = {Universit\'e de Nice - Sophia Antipolis},
year = {2002},
month = nov,

}

@PhdThesis{Flo02,
author = {L. Floriani},
title = {M\'ethodes d'Analyse des Donn\'ees Multivariables pour l'\'etude des M\'ecanismes des Heuristiques},
school = {Universit\'e de Nice--Sophia Antipolis},
year = {2002},
month = jan,

}

@PhdThesis{Lau02,
AUTHOR={A. Laugier},
TITLE={C\^{o}nes de Matrices et Programmation Math\'{e}matique : Quelques Applications},
MONTH= mar,
SCHOOL={Universit� de Nice--Sophia Antipolis},
OPTTYPE={Th�se de Doctorat},
YEAR={2002},

}

@InCollection{Cos02,
author = {M. Cosnard},
editor = {R. Corr�a and I. Dutra and M. Fiallos and F. Gomes},
title = {Introduction to the Complexity of Parallel Algorithms},
booktitle = {Parallel and Distributed Algorithms: {T}heory, Algorithmic Techniques and Applications},
chapter = {1, part I},
publisher = {Kluwer Academic Publishers},
year = {2002},
series = {Applied Optimization},
address = {Boston (USA)},
pages = {3--25} 
}

@incollection{MR1940135,
AUTHOR = {Devroye, L. and McDiarmid, C. and Reed, B.},
TITLE = {Giant components for two expanding graph processes},
BOOKTITLE = {Mathematics and computer science, II (Versailles, 2002)},
SERIES = {Trends Math.},
PAGES = {161--173},
PUBLISHER = {Birkh\"auser},
ADDRESS = {Basel},
YEAR = {2002},

}

@INCOLLECTION{FGP02,
AUTHOR = {A. Ferreira and J. Galtier and P. Penna},
BOOKTITLE = {Handbook of Wireless Networks and Mobile Computing},
EDITOR = {I. Stojmenovic},
PAGES = {473--507},
PUBLISHER = {John Wiley and Sons},
TITLE = {Topological design, routing and hand-over in satellite networks},
YEAR = {2002},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/FGP02.pdf},

}

@INCOLLECTION{Fer02a,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Encyclopedia of Optimization},
EDITOR = {C. Floudas and P. Pardalos},
PUBLISHER = {Kluwer Academic Publisher, Boston (USA)},
TITLE = {{Parallel Computing: Models}},
YEAR = {2002},

}

@INCOLLECTION{FeGu02,
AUTHOR = {A. Ferreira and I. Gu\'erin-Lassous},
BOOKTITLE = {Parallel and Distributed Algorithms: {T}heory, Algorithmic Techniques and Applications},
EDITOR = {R. Corr\^ea and I. Dutra and M. Fiallos and F. Gomes},
PUBLISHER = {Kluwer Academic Publishers},
TITLE = {Discrete Computing with Coarse Grained Systems},
year = {2002},
series = {Applied Optimization},
chapter = {5, part I},
address = {Boston (USA)},
pages = {117--143},

}

@ARTICLE{BeDa02,
AUTHOR = {B. Beauquier and E. Darrot},
JOURNAL = {Parallel Processing Letters},
VOLUME = {12},
NUMBER = {3},
PUBLISHER = {World Scientific},
TITLE = {On Arbitrary Size {W}aksman Networks and their Vulnerability},
YEAR = {2002},

}

@Article{BDD02,
Author= {J-C. Bermond and E. Darrot and O. Delmas},
Title= {Design of fault tolerant on-board networks in satellites},
Year={2002},
Journal={Networks},
Volume= {40},
Pages={202--207},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BDD02.pdf},

}

@Article{BHK+02,
author = {H.-J.~B\"ockenhauer and J.~Hromkovi\v{c} and R.~Klasing and S.~Seibert and W.~Unger},
title = {Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem},
journal = {Theoretical Computer Science},
year = {2002},
volume = {285},
number = {1},
pages = {3--24},

}

@ARTICLE{CDF+02,
AUTHOR = {E. Caceres and F. Dehne and A. Ferreira and P. Flocchini and I. Rieping and A. Roncato and N. Santoro and S. Song},
JOURNAL = {Algorithmica},
PAGES = {183--200},
TITLE = {{Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP}},
VOLUME = {33},
YEAR = {2002},

}

@article{CKL02,
author = {H. Cirstea and C. Kirchner and L. Liquori},
title = {{Rewriting Calculus with(out) Types}},
journal = {WRLA, International Workshop on Rewriting Logic and its Applications. Electr. Notes Theor. Comput. Sci.},
volume = {71},
year = {2002},
POSTSCRIPT= {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/wrla-02.ps.gz} 
}

@article {MR1918719,
AUTHOR = {Cooper, C. and Frieze, A. and Reed, B. and Riordan, O.},
TITLE = {Random regular graphs of non-constant degree: independence and chromatic number},
JOURNAL = {Combin. Probab. Comput.},
VOLUME = {11},
YEAR = {2002},
NUMBER = {4},
PAGES = {323--341},

}

@article {MR1909501,
AUTHOR = {Cooper, C. and Frieze, A. and Reed, B.},
TITLE = {Random regular graphs of non-constant degree: connectivity and {H}amiltonicity},
JOURNAL = {Combin. Probab. Comput.},
VOLUME = {11},
YEAR = {2002},
NUMBER = {3},
PAGES = {249--261},

}

@ARTICLE{CFP02,
author = {D. Coudert and A. Ferreira and S. P\'erennes},
title = {Isomorphisms of the De Bruijn Digraph and Free-Space Optical Networks},
journal = {Networks (Wiley-Interscience)},
year = {2002},
volume = {40},
pages = {155-164},
number = {3},
month = oct,
abstract = {The de Bruijn digraph $B(d,D)$ has degree $d$, diameter $D$, $d^D$ vertices and $d^{D+1}$ arcs. It is usually defined by words of size $D$ on an alphabet of cardinality $d$, through a cyclic left shift permutation on the words, after which the rightmost symbol is changed. In this paper, we show that any digraph defined on words of a given size, through an {\em arbitrary} permutation on the alphabet {\bf and} an {\em arbitrary} permutation on the word indices, is isomorphic to the de Bruijn digraph, provided that this latter permutation is {\em cyclic}. We use this result to improve from $O\left(d^{D+1}\right)$ to $\Theta\left(\sqrt{d^{D+1}}\right)$ the number of lenses required for the implementation of $B(d,D)$ by the Optical Transpose Interconnection System proposed by Marsden {\em et al.} (Optics Letters 18(13):1083-1085, July 1993).},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFP-Networks-ac02.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFP-Networks-ac02.ps.gz} 
}

@ARTICLE{FGM+02,
AUTHOR = {A. Ferreira and I. Gu\'erin-Lassous and K. Marcus and A. Rau-Chaplin},
JOURNAL = {Concurrency and Computation - Practice and Experience},
TITLE = {{Parallel Computation on Interval Graphs: Algorithms and Experiments}},
YEAR = {2002},
MONTH = {january},
NUMBER = {1},
PAGES = {47--70},
VOLUME = {56},

}

@ARTICLE{HaZe02,
AUTHOR = {F. Havet and J. Zerovnik},
JOURNAL = {Discrete Mathematics},
PAGES = {103--108},
TITLE = {Finding a Five Bicolouring of a Triangle-Free Subgraph of the Triangular Lattice},
VOLUME = {244},
YEAR = {2002},

}

@ARTICLE{Hav02a,
AUTHOR = {F. Havet},
JOURNAL = {Discrete Mathematics},
NUMBER = {1--3},
PAGES = {121--134},
TITLE = {Trees in Tournament},
VOLUME = {243},
YEAR = {2002},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Hav02a.pdf},

}

@article {MR1930121,
AUTHOR = {Reed, B. and Sudakov, B.},
TITLE = {Asymptotically the list colouring constants are 1},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {86},
YEAR = {2002},
NUMBER = {1},
PAGES = {27--37},

}

@InProceedings{AGT02b,
author="E. Altman and J. Galtier and C. Touati",
title ="Fair power and transmission rate control in wireless networks",
booktitle = {Proc. of IEEE GlobeCom'02},
year = {2002},
address = {Taipei, Taiwan},
month =nov,

}

@InProceedings{AGT02a,
author = {E. Altman and J. Galtier and C. Touati},
title = {Utility Based Fair Bandwidth Allocation},
booktitle = {IASTED International Conference on Networks, Parallel and Distributed Processing, and Applications (NPDPA 2002)},
year = 2002 
}

@InProceedings{AGT02c,
author = {E. Altman and J. Galtier and C. Touati},
title = {Semi-Definite Programming Approach for Bandwidth Allocation and Routing in Networks},
booktitle = {Proc. of 10th Int. Symp. on Dynamic Games and Application -- Networking Games \& Resource Allocation Workshop (NGRA-2002)},
publisher = {Altman and Mazaloz},
year = 2002,
address = {Petrozavodsk, Russia},
month = jul 
}

@INPROCEEDINGS{BCP02,
AUTHOR = {J-C. Bermond and S. Choplin and S. P\'erennes},
BOOKTITLE = {9th International Colloquium on Structural Information and Communication Complexity ({SIROCCO}'02)},
PAGES = {1--16},
PUBLISHER = {Carleton Scientific},
TITLE = {Hierarchical Ring Network Design},
YEAR = {2002},

}

@InProceedings{BBH+02,
author = {H.-J. B\"ockenhauer and D. Bongartz and J. Hromkovi\v{c} and R. Klasing and G. Proietti and S. Seibert and W. Unger},
title = {On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality},
booktitle = {Proc. of the 22nd Conference on Foundations of Software Technology and Theoretial Computer Science (FSTTCS 2002)},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
volume = {2556},
year = {2002},
isbn = {3-540-00225-1},
pages = {59--70},

}

@INPROCEEDINGS{CoRi02,
author = {D. Coudert and H. Rivano},
title = {Routage optique dans les r\'eseaux {WDM} multifibres avec conversion partielle.},
booktitle = {AlgoTel'02},
year = {2002},
pages = {17-24},
address = {M\`eze, France},
month = may,
abstract = {Nous consid\'erons le probl\`eme du routage optique d'un ensemble donn\'e de requ\^etes de communications dans un r\'eseau \wdm multifibres avec conversion partielle. \'Etant donn\'e un tel r\'eseau disposant de $w$ longueurs d'onde par fibre, $k$ fibres par lien et $c$ conversions possibles par \noeud du r\'eseau, le probl\`eme revient \`a d\'ecider s'il est possible de trouver un chemin $w$-color\'e pour chaque requ\^ete, de sorte qu'au plus $k$ chemins utilisent une m\^eme longueur d'onde sur un m\^eme lien du r\'eseau et qu'aucun \noeud n'op\`ere plus de $c$ conversions. Notre r\'esultat principal r\'eside dans l'\'ecriture de ce probl\`eme sous la forme d'une instance particuli\`ere de multiflot entier, int\'egrant dans un m\^eme mod\`ele le routage et l'affectation de longueurs d'onde. Nous fournissons ensuite trois heuristiques bas\'ees sur l'arrondi al\'eatoire de multiflots fractionnaires, qui sont trois r\'eponses diff\'erentes au compromis efficacit\'e/pr\'ecision des approximations. Nous les validons en comparant leur performances sur des instances th\'eoriques ou issue du monde r\'eel.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CR-AlgoTel02.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CR-AlgoTel02.ps.gz},
url = {http://hipercom.inria.fr/algotel2002/} 
}

@INPROCEEDINGS{CoRi02b,
author = {Coudert, D. and Rivano, H.},
title = {Lightpath assignment for multifibers WDM networks with wavelength translators},
booktitle = {Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE},
year = {2002},
volume = {3},
pages = {2686--2690vol.3},
month = {17-21 Nov.},
note = {OPNT-01-5},
abstract = {We consider the problem of finding a lightpath assignment for a given set of communication requests on a multifiber WDM optical network with wavelength translators. Given such a network and w, the number of wavelengths available on each fiber, k, the number of fibers per link, and c, the number of partial wavelength translations available on each node, our problem stands for deciding whether it is possible to find a w-lightpath for each request in the set such that there is no link carrying more that k lightpaths using the same wavelength nor node where more than c wavelength translations take place. Our main theoretical result is the writing of this problem as a particular instance of integral multicommodity flow, hence integrating routing and wavelength assignment in the same model. We then provide three heuristics mainly based upon randomized rounding of fractional multicommodity flow and enhancements that are three different answers to the trade-off between efficiency and tightness of approximation, and discuss their practical performances on both theoretical and real-world instances.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CR-Globecom02.pdf} 
}

@INPROCEEDINGS{FPR+02,
author = {A. Ferreira and S. P�rennes and A. Richa and H. Rivano and N. Stier},
title = {On the design of multifiber WDM networks},
booktitle = {AlgoTel'02},
year = {2002},
pages = {25--32},
address = {M�ze, France},
month = {May},
abstract = {In this paper, we address multifiber optical networks with Wavelength Division Multiplexing (\wdm). Assuming that the lightpaths use the same wavelength from source to destination, we extend the definition of the well-known Wavelength Assignment Problem (\wap) to the case where there are $k$ fibers per link, and $w$ wavelengths per fiber are available. This generalization is called the $(k,w)$-\wap. We develop a new model for the $(k,w)$-\wap based on \emph{ conflict hypergraphs}. Conflict hypergraphs accurately capture the lightpath interdependencies, generalizing the conflict graphs used for single-fiber networks. By relating the $(k,w)$-\wap with the hypergraph coloring problem, we prove that the former is \npc, and present further results with respect to the complexity of that problem. We consider the two natural optimization problems that arise from the $(k,w)$-\wap : the problem of minimizing $k$ given $w$, and that of minimizing $w$ given $k$. We develop and analyze the practical performances of two methodologies based on hypergraph coloring, one for each of the two optimization problems, on existing backbone networks in Europe and in the USA. The first methodology relies on an integer programming formulation, and the second consists of a heuristic based on a randomized algorithm.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/fprrs02.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/fprrs02.ps.gz},
url = {http://hipercom.inria.fr/algotel2002/} 
}

@INPROCEEDINGS{Fer02b,
AUTHOR = {A. Ferreira},
ADDRESS = {M�ze, France},
BOOKTITLE = {4$^{\rm e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2002)},
MONTH = may,
TITLE = {{{On models and algorithms for dynamic communication networks: The case for evolving graphs}}},
YEAR = {2002},

}

@INPROCEEDINGS{Hav02b,
AUTHOR = {F. Havet},
ADDRESS = {Andros, Greece},
BOOKTITLE = {Proc. of SIROCCO'02},
MONTH = jun,
PAGES = {165--180},
TITLE = {Design of Fault Tolerant Satellite Networks with Priorities via Selectors},
YEAR = {2002},

}

@INPROCEEDINGS{Hav02c,
AUTHOR = {F. Havet},
ADDRESS = {M�ze, France},
BOOKTITLE = {$4^{e}$ rencontres francophones sur les Aspects Algorithmiques des T�l�communications (AlgoTel'02)},
MONTH = may,
PAGES = {81--86},
TITLE = {Robustness of a Routing Tree for the Push Tree Problem},
YEAR = {2002},

}

@INPROCEEDINGS{HuPeSy02,
AUTHOR = {G. Huiban and S. P\'erennes and M. Syska},
ADDRESS = {New-York},
BOOKTITLE = {IEEE ICC},
MONTH = apr,
TITLE = {Traffic Grooming in {WDM} Networks with Multi-Layer Switches},
YEAR = {2002},
NOTE = {CD-Rom},

}

@InProceedings{Jar02a,
author = {A. Jarry},
title = {{Disjoint Paths in Symmetric Digraphs}},
booktitle = {International Colloquium on Structural Information and Communi cation Complexity -- SIROCCO},
pages = {211--222},
year = {2002},
address = {Andros, Greece},
month = jun,
publisher = {Carleton},

}

@INPROCEEDINGS{Mus02,
AUTHOR = {P. Mussi},
ADDRESS = {Lisbon, Portugal},
BOOKTITLE = {AI, Simulation \& Planning in High Autonomy Systems},
MONTH = {April},
TITLE = {Tuning Car Following Algorithms for Realistic Behaviour},
YEAR = {2002},
pages={281--284},

}

@inproceedings{MR1957563,
AUTHOR = {Reed, B. and Sudakov, B.},
TITLE = {List colouring of graphs with at most {$(2-o(1))\chi$} vertices},
BOOKTITLE = {Proceedings of the International Congress of Mathematicians, Vol. III (Beijing, 2002)},
PAGES = {587--603},
PUBLISHER = {Higher Ed. Press},
ADDRESS = {Beijing},
YEAR = {2002},

}

@TechReport{AGT02c,
author = {E. Altman and J. Galtier and C. Touati},
title = {Fair Bandwidth allocation between service providers in a geostationary satellite network },
institution = {INRIA},
year = 2002,
number = {RR-4421},
month = mar 
}

@TECHREPORT{BPR02,
author = {N. Baskiotis and S. P�rennes and H. Rivano},
title = {Heuristic design of multifiber WDM optical networks by randomized rounding of multicommodity flow},
institution = {INRIA Research Report 4418},
year = {2002},
type = {Research Report},
number = {RR-4418},
abstract = {Ces travaux s'attachent � d�finir le probl�me du routage optique multifibres ainsi qu'une mod�lisation en terme de multiflot entier. Cette mod�lisation permet d'envisager de bonnes approximations et heuristiques.},
url = {http://hal.inria.fr/inria-00072170} 
}

@TECHREPORT{CRE02,
AUTHOR = {B. Beauquier and S. P\'erennes and M. Syska},
ADDRESS = {Sophia Antipolis},
INSTITUTION = {Projet MASCOTTE (CNRS/INRIA/UNSA)},
MONTH = jul,
TITLE = {Efficient Access to Optical Bandwidth, Routing and Grooming in {WDM} Networks: {S}tate-of-the-art survey},
TYPE = {{IST} {CRESCCO} report},
YEAR = {2002},

}

@Techreport{BeCe02,
author = {J-C. Bermond and S. C�roi},
title = {Minimizing {SONET ADM}s in unidirectional {WDM} ring with grooming ratio 3},
institution = {INRIA},
year = {2002},
number = {RR-4626},
address = {Sophia Antipolis},
month = nov,

}

@TECHREPORT{BHP02,
AUTHOR = {S. Bessy and F. Havet and J. Palaysi},
ADDRESS = {Sophia Antipolis},
INSTITUTION = {Projet MASCOTTE},
MONTH = aug,
TITLE = {Pancyclic Arcs and Connectivity in Tournaments},
TYPE = {{R}apport de recherche {INRIA/RR-4522}},
YEAR = {2002},

}

@TECHREPORT{BhFe02,
AUTHOR = {S. Bhadra and A. Ferreira},
INSTITUTION = {INRIA},
NUMBER = {4531},
TITLE = {Computing multicast trees in dynamic networks using evolving graphs},
TYPE = {Research Report},
YEAR = {2002},

}

@TECHREPORT{CoRi02c,
author = {D. Coudert and H. Rivano},
title = {Lightpath assignment for multifibers WDM optical networks with wavelength translators},
institution = {INRIA Research Report 4487},
year = {2002},
type = {Research Report},
abstract = {We consider the problem of finding a lightpath assignment for a given set of communication requests on a multifiber WDM optical network with wavelength translators. Given such a network, and w the number of wavelengths available on each fiber, k the number of fiber per link and c the number of partial wavelength translation available on each node, our problem stands for deciding whether it is possible to find a w-lightpath for each request in the set such that there is no link carrying more that k lightpaths using the same wavelength nor node where more than c wavelength translations take place. Our main theoretical result is the writing of this problem as a particular instance of integral multicommodity flow, hence integrating routing and wavelength assignment in the same model. We then provide three heuristics mainly based upon randomized rounding of fractional multicommodity flow and enhancements that are three different answers to the trade-off between efficiency and tightness of approximation and discuss their practical performances on both theoretical and real-world instances.},
url = {http://hal.inria.fr/inria-00072101},
pdf = {http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/07/21/01/PDF/RR-4487.pdf&docid=72101},

}

@TECHREPORT{FeVi02,
AUTHOR = {A. Ferreira and L. Viennot},
INSTITUTION = {INRIA},
NUMBER = {4403},
TITLE = {A Note on Models, Algorithms, and Data Structures for Dynamic Communication Networks},
TYPE = {Research Report},
YEAR = {2002},

}

@techreport{GNTD02,
author = {F. Giroire and A. Nucci and N. Taft and C. Diot},
title = {Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection},
institution = {Sprint},
type = {Technical Report},
year = {2002},
abstract = {There are two fundamental technology issues that challenge the robustness of IP backbones. First, SONET protection is gradually being removed because of its high cost (while SONET framing is kept for failure detection purposes). Protection and restoration are provided by the IP layer that operates directly over a DWDM infrastructure. Second, ISPs are systematically forced to use the shortest distance path between two Points of Presence in order to meet their promised SLAs. In this context, IP backbones are extremely vulnerable to fiber cuts that can bring down a significant fraction of the IP routes. We propose two solutions (an ILP model and a heuristic algorithm) to optimally map a given IP topology onto a fiber infrastructure. The version of the mapping problem that we address incorporates a number of real constraints and requirements faced by carriers today. The optimal mapping maximizes the robustness of the network while maintaining the ISP's SLA delay requirements. In addition, our heuristic takes into consideration constraints such as a shortage of wavelengths and priorities among POPs and routes. The heuristic is evaluated on the Sprint backbone network. We illustrate the tradeoffs between the many requirements.},

}

@TECHREPORT{HaYu02,
AUTHOR = {F. Havet and M-L. Yu},
ADDRESS = {Sophia Antipolis},
INSTITUTION = {Projet MASCOTTE},
MONTH = nov,
TITLE = {On $(d,1)$-total labelling of graphs},
TYPE = {{R}apport de recherche {INRIA}},
YEAR = {2002},

}

@TECHREPORT{Hav02d,
AUTHOR = {F. Havet},
ADDRESS = {Sophia Antipolis},
INSTITUTION = {Projet MASCOTTE},
MONTH = mar,
TITLE = {Pancyclic Arcs and Connectivity in Tournaments},
TYPE = {{R}apport de recherche {INRIA/RR-4378}},
YEAR = {2002},

}

@TechReport{Jar02b,
author = {A. Jarry},
title = {Integral Symmetric 2-Commodity Flows},
institution = {INRIA},
year = {2002},
number = {RR-4622},
address = {Sophia Antipolis},
month = nov,

}

@TechReport{JaLa02,
author = {A. Jarry and A. Laugier},
title = {Two-connected graphs with given diameter},
institution = {INRIA},
year = {2002},
number = {RR-4307},
address = {Sophia Antipolis},
month = mar,

}

@TechReport{BFJ02,
author = {B. Xuan and A. Ferreira and A. Jarry},
title = {Computing shortest, fastest, and foremost journeys in dynamic networks},
institution = {INRIA},
year = {2002},
number = {RR-4589},
address = {Sophia Antipolis},
month = nov,

}

@MASTERSTHESIS{Riv02,
AUTHOR = {O. de Rivoyre},
MONTH = sep,
SCHOOL = {ESSI},
TITLE = {Le Groupage par Tubes},
type = {{R}apport de stage, 3e ann\'ee d'Ing\'enieur},
YEAR = {2002},

}

@MASTERSTHESIS{Fra02a,
AUTHOR = {O. Fran\c coise},
MONTH = {jun},
SCHOOL = {ESSI},
TITLE = {Conception d'une {API} de contr\^ole g\'en\'erique pour le noyau {L}inux bas\'ee sur le m\'ecanisme de syst\`eme de fichiers virtuels},
TYPE = {{R}apport de stage de DEA},
YEAR = {2002},

}

@MASTERSTHESIS{God02,
AUTHOR = {J-C. Godin},
SCHOOL = {Universit\'e de Luminy, Marseille},
TITLE = {Choisissabilit� de graphes et allocations de fr�quences},
type = {Rapport de DEA MDFI},
YEAR = {2002},

}

@MASTERSTHESIS{Gui02,
AUTHOR = {T. Guillier},
SCHOOL = {ESSI},
TITLE = {Implantation au niveau utilisateur du protocole de contr\^ole de {MPCFS}},
TYPE = {{R}apport de stage, 2e ann\'ee d'Ing\'enieur},
YEAR = {2002},

}

@MASTERSTHESIS{Lev02,
AUTHOR = {B. L\'ev\`eque},
SCHOOL = {ENS Lyon, Licence d'Informatique},
TITLE = {Minimisation du nombre d'{ADM} dans les r\'eseaux {WDM}},
TYPE = {{R}apport de stage},
YEAR = {2002},

}

@MastersThesis{Pons02,
author = {P. Pons},
title = {Recherche d'algorithmes pour \'evaluer la disponibilit\'e d'un r\'eseau de t\'el\'ecommunications},
type = {Rapport de DEA},
month = {sep},
year = {2002} 
}

@MASTERSTHESIS{Rai02,
AUTHOR = {S. Rai},
SCHOOL = {IIT New Delhi},
TITLE = {Design and optimization of {WDM} networks: Grooming},
type = {Rapport de stage},
YEAR = {2002} 
}

@MASTERSTHESIS{Vig02,
AUTHOR = {F. Viger},
SCHOOL = {ENS},
TITLE = {Mod\'elisation de ph\'enom\`enes complexes du trafic routier},
type = {{R}apport de Ma\^{i}trise d'Informatique},
YEAR = {2002},

}

@MASTERSTHESIS{Vui02,
AUTHOR = {R. Vuillemot},
SCHOOL = {ENS Lyon},
TITLE = {Conception d'un mod\`ele du protocole {GMPLS} pour l'environnement de simulation {ASIMUT}},
type = {{R}apport de Licence d'Informatique},
YEAR = {2002},

}

@MASTERSTHESIS{Wal02,
AUTHOR = {M. Walter},
SCHOOL = {ESSI},
TITLE = {Evaluation et validation d'un logiciel de dimensionnement de r\'eseaux},
type = {Rapport de DESS},
YEAR = {2002},

}

@misc{Sys02,
author = {M. Syska},
title = {{PORTO}: Planification et Optimisation des R�seaux de Transport Optiques},
howpublished = {Poster, Colloque annuel du {RNRT}, Grenoble, 7 f�vrier},
url = {http://www.telecom.gouv.fr/rnrt/coll/posters/porto.ppt},
year = {2002} 
}

@MISC{Bui02,
AUTHOR = {B. M. B. Xuan},
SCHOOL = {ENS Lyon},
TITLE = {Graphes �volutifs et r�seaux dynamiques � calendrier fix�},
TYPE = {Rapport de stage},
YEAR = {2002},

}

@BOOK{FeKr01,
EDITOR = {A. Ferreira and D. Krob},
PUBLISHER = {ACM/Baltzer},
TITLE = {{Mobile Networks \& Applications (MONET) -- Special Issue on Discrete Algorithms and Methods for Mobile Computing and Communications}},
YEAR = {2001},

}

@book {MR1858793,
TITLE = {Perfect graphs},
SERIES = {Wiley-Interscience Series in Discrete Mathematics and Optimization},
EDITOR = {Ram{\'{\i}}rez Alfons{\'{\i}}n, J. L. and Reed, B.},
PUBLISHER = {John Wiley \& Sons Ltd.},
ADDRESS = {Chichester},
YEAR = {2001},
PAGES = {xxii+362},

}

@BOOK{FeRe01,
EDITOR = {A. Ferreira and H. Reichel},
KEY = {b-edition},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{Proceedings of STACS 2001}},
VOLUME = {2010},
YEAR = {2001},

}

@PHDTHESIS{Cou01b,
author = {D. Coudert},
title = {Algorithmique et optimisation de r\'eseaux de communications optiques},
school = {{Universit\'e de Nice Sophia-Antipolis (UNSA)}},
year = {2001},
month = {D\'ecembre},
abstract = {This thesis deals with optical communication networks, especially free space optical networks and optical fiber networks. First we address the design of free space optical networks using the Optical Transpose Interconnection System (OTIS) architecture defined in [MMHE93]. We give a model of these networks with H(p,q,d) digraphs which we characterize. We take a specific interest in isomorphisms between these digraphs and well known digraphs (de Bruijn, Kautz and other alphabet graphs). We develop a family of alphabet digraphs which includes a large number of digraphs isomorphic to the de Bruijn and use it to obtain an optimal design of the de Bruijn with OTIS, in terms of minimizing the number of lenses. Then, we study a family of networks modeled by directed hypergraphs and called stack-Kautz, for which we provide routing algorithms and control protocols. In a second part we address the problem of WDM network survivability using protection. This problem consists in using precomputed and dedicated resources in order to ensure traffic continuity if a bundle of fibers breaks down. We describe numerous strategies for protecting the instance and the network. We go more deeply into subnetwork protection where protection resources are shared by sets of request describing a specific subnetwork (circuit). We give an optimal solution to this problem when the network is a cycle and the requests realize the All-to-All pattern. },
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/these.ps.gz} 
}

@incollection {MR1861358,
AUTHOR = {Everett, H. and de Figueiredo, C. M. H. and Linhares-Sales, C. and Maffray, F. and Porto, O. and Reed, B.},
TITLE = {Even pairs},
BOOKTITLE = {Perfect graphs},
SERIES = {Wiley-Intersci. Ser. Discrete Math. Optim.},
PAGES = {67--92},
PUBLISHER = {Wiley},
ADDRESS = {Chichester},
YEAR = {2001},

}

@INCOLLECTION{Fer01,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Encyclopedia of Optimization -- Vol. IV},
EDITOR = {C. A. Floudas and P. Pardalos},
KEY = {bc-chapter},
PAGES = {264--269},
PUBLISHER = {Kluwer Academic Publisher, Boston (USA)},
TITLE = {{Parallel Computing: Models}},
YEAR = {2001},

}

@incollection {MR1861360,
AUTHOR = {Hayward, R. and Reed, B.},
TITLE = {Forbidding holes and antiholes},
BOOKTITLE = {Perfect graphs},
SERIES = {Wiley-Intersci. Ser. Discrete Math. Optim.},
PAGES = {113--137},
PUBLISHER = {Wiley},
ADDRESS = {Chichester},
YEAR = {2001},

}

@incollection {MR1861365,
AUTHOR = {Reed, B.},
TITLE = {A gentle introduction to semi-definite programming},
BOOKTITLE = {Perfect graphs},
SERIES = {Wiley-Intersci. Ser. Discrete Math. Optim.},
PAGES = {233--259},
PUBLISHER = {Wiley},
ADDRESS = {Chichester},
YEAR = {2001},

}

@incollection {MR1861356,
AUTHOR = {Reed, B.},
TITLE = {From conjecture to theorem},
BOOKTITLE = {Perfect graphs},
SERIES = {Wiley-Intersci. Ser. Discrete Math. Optim.},
PAGES = {13--24},
PUBLISHER = {Wiley},
ADDRESS = {Chichester},
YEAR = {2001},

}

@article{AlCo01,
author={J.-P. Allouche and M. Cosnard},
title={Non-integer bases, iteration of continuous real maps, and an arithmetic self-similar set},
journal={Acta Mathematica Hungarica},
volume={91},
year={2001},
pages={325--332},

}

@ARTICLE{ABJ+01,
AUTHOR="E. Altman and E. Ba{\c c}sar and T. Jim�nez and N. Shimkin",
TITLE="Competitive Routing in Networks with Polynomial Cost",
JOURNAL="IEEE Trans. on Automatic Control",
YEAR="2001" 
}

@ARTICLE{AJK01,
AUTHOR="E. Altman and T. Jim�nez and G. Koole",
TITLE="Comparing tandem queueing systems and their fluid limits",
YEAR="2001",
JOURNAL="PEIS",
NUMBER="2" 
}

@Article{BDP01,
author = {B. Beauquier and O. Delmas and S. P\'erennes},
title = "Tight Bounds for Broadcasting in the Linear Cost Model",
journal = {Journal of Interconnection Network},
year = {2001},
volume = {2},
number = {2},
pages = {175--188},
publisher = {World Scientific},

}

@ARTICLE{BFGP01,
AUTHOR = {P. Berg\'e and A. Ferreira and J. Galtier and J.-N. Petit},
JOURNAL = {International Journal on Telecommunication Systems},
NUMBER = {1-3},
PAGES = {123--135},
TITLE = {{A Probabilistic Study of Inter-Satellite Links Load in Polar Orbit Satellite Constellations}},
VOLUME = {18},
YEAR = {2001},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/BFGP01.pdf},

}

@Article{BMM01,
author = "J-C. Bermond and X. Mu{\~n}oz and A. Marchetti-Spaccamela",
title = "A Broadcasting Protocol in Line Digraphs",
journal = "Journal of Parallel and Distributed Computing",
volume = "61",
number = "8",
pages = "1013--1032",
month = "August",
year = "2001",
PDF = "http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BMM01.pdf",

}

@Article{CoJe01,
author = {M. Cosnard and E. Jeannot},
title = "Automatic Parallelization Techniques Based on Compact DAG Extraction and Symbolic Scheduling",
journal = {Parallel Processing Letters},
year = {2001},
volume = {11},
number = {1},
pages = {151--168} 
}

@ARTICLE{DFR01,
AUTHOR = {M. Diallo and A. Ferreira and A. Rau-Chaplin},
JOURNAL = {Parallel Processing Letters},
NUMBER = {2/3},
PAGES = {327--340},
TITLE = {{A note on communication-efficient deterministic p aralle algorithms for planar point location and 2D Voronoi diagram}},
VOLUME = {11},
YEAR = {2001},

}

@ARTICLE{FGPR01,
author = {A. Ferreira and J. Galtier and J.-N. Petit and H. Rivano},
title = {Re-routing algorithms in a meshed satellite constellation},
journal = {Annals of Telecommunications},
year = {2001},
volume = {56},
pages = {169--174},
number = {3/4},
month = {march/april},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/FGPR01.pdf},
abstract = {In this paper we present a simple model for satellite constellations with polar orbits and inter-satellite links. This model is used to propose and study two algorithms for routing and re-routing communications, which aim at improving the quality of service for long communications. In order to study these algorithms, we have developed a satellite constellation simulator. Some of its results are presented.} 
}

@article{FlPe01,
author= { Flammini, M. and P\'erennes, S. },
title= { On the optimality of general lower bounds for broadcasting and gossiping },
journal= { SIAM J. Discrete Math. },
volume= { 14 },
year= { 2001 },
number= { 2 },
pages= { 267--282 },
issn= { 1095-7146 },

}

@article{FPPP01,
title= { Assigning labels in unknown network with a leader },
author= { P. Fraigniaud and A. Pelc and D. Peleg and S. P\'erennes },
journal= { Distributed Computing },
volume= { 14 },
number= { 3 },
pages= { 163--183 },
year= { 2001 },

}

@Article{Gal01a,
author = {J. Galtier},
title = {Geographical reservation for guaranteed handover and routing in low earth orbit constellations},
journal = {Telecommunication Systems},
year = {2001},
volume = {18},
number = {1/3},
pages = {101--121},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/Gal01a.pdf},

}

@article{GHP01,
author= { L. Gargano and P. Hell and S. P\'erennes },
title= { Coloring all directed paths in a symmetric tree, with an application to optical networks },
journal= { Journal of Graph Theory },
year= { 2001 },
volume= { 38 },
number= { 4 },
pages= { 183--196 },

}

@article{GPPV01,
author= { Gargano, L. and Pelc, A. and P\'erennes, S. and Vaccaro, U. },
title= { Efficient communication in unknown networks },
journal= { Networks },
volume= { 38 },
year= { 2001 },
number= { 1 },
pages= { 39--49 },
issn= { 0028-3045 },

}

@ARTICLE{Havet01a,
AUTHOR = "F. Havet",
TITLE = "Channel assignement and multicolouring of the induced subgraphs of the triangular lattice",
JOURNAL = "Discrete Mathematics",
VOLUME = "233",
YEAR = "2001",
PAGES ="219--231",

}

@article{HMP00,
author= { M.-C. Heydemann and N. Marlin and S. P\'erennes },
title= { Complete Rotations in Cayley Graphs },
journal= { European Journal of Combinatorics },
year= { 2001 },
volume = {22},
number = {2},
pages = {179-196},
url = {http://dx.doi.org/10.1006/eujc.2000.0460},

}

@article {MR1876582,
AUTHOR = {Linhares-Sales, C. and Maffray, F. and Reed, B.},
TITLE = {Recognizing planar strict quasi-parity graphs},
JOURNAL = {Graphs Combin.},
VOLUME = {17},
YEAR = {2001},
NUMBER = {4},
PAGES = {745--757},

}

@article {MR1832451,
AUTHOR = {Rautenbach, D. and Reed, B.},
TITLE = {The {E}rd{\H o}s-{P}\'osa property for odd cycles in highly connected graphs},
NOTE = {Paul Erd\H os and his mathematics (Budapest, 1999)},
JOURNAL = {Combinatorica},
VOLUME = {21},
YEAR = {2001},
NUMBER = {2},
PAGES = {267--278},

}

@INPROCEEDINGS{BC+01b,
author = {J-C. Bermond and L. Chacon and D. Coudert and F. Tillerot},
title = {{Cycle Covering}},
booktitle = {International Colloquium on Structural Information and Communication Complexity -- SIROCCO},
year = {2001},
series = {Proceedings in Informatics 11},
pages = {21-34},
address = {Vall de Nuria, Spain},
month = {27-29 June},
publisher = {Carleton Scientific},
abstract = {This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on the case where the optical WDM network is a ring, there are requests between any pair of vertices and the covering is done with small cycles. This problem can be modelled as follows: Find a covering of the edges of a logical graph $I$ (here the complete graph $K_n$) by subgraphs $I_k$ of a certain kind (here cycles $C_k$ of length $k$), such that, for each $I_k$, there exists in the physical graph $G$ (here $C_n$) a disjoint routing of the edges of $I_k$. The aim is to minimize the number of subgraphs $I_k$ in the covering. We give optimal solutions for that problem.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCCT-SIROCCO01.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCCT-SIROCCO01.ps.gz} 
}

@INPROCEEDINGS{BC+01a,
author = {J-C. Bermond and L. Chacon and D. Coudert and F. Tillerot},
title = {{A Note on Cycle Covering}},
booktitle = {ACM Symposium on Parallel Algorithms and Architectures -- SPAA},
year = {2001},
pages = {310-311},
address = {Crete island, Greece},
month = {4-6 July},
abstract = {This study considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other.},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCCT-SPAA01.ps.gz} 
}

@InProceedings{BHT01,
AUTHOR={J-C. Bermond and F. Havet and D. T\'oth},
TITLE={Design of fault tolerant on board networks with priorities},
booktitle = {$3^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2001)},
pages = {95--98},
year = {2001},
address = {Saint-Jean-de-Luz , France},
month = {Mai} 
}

@InProceedings{BLM01,
AUTHOR={S. Bertrand and A. Laugier and P. Mahey},
TITLE={Routing flows in networks with heterogenous protocols and path-dependent edge costs},
booktitle = {$3^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2001)},
pages = {55--60},
year = {2001},
address = {Saint-Jean-de-Luz , France},
month = {Mai} 
}

@INPROCEEDINGS{CFF01,
AUTHOR = {A. Caminada and A. Ferreira and L. Floriani},
ADDRESS = {San Francisco (USA)},
BOOKTITLE = {Proceedings of GECCO 2001 Workshop on Real-life Evolutionary Design Optimisation},
TITLE = {{Principal Component Analysis for data volume reduction in experimental analysis of heuristics}},
YEAR = {2001},

}

@INPROCEEDINGS{CFK+01b,
author = {I. Caragiannis and A. Ferreira and C. Kaklamanis and S. P�rennes and P. Persiano and H. Rivano},
title = {Approximate Constrained Bipartite Edge Coloring},
booktitle = {27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'01)},
year = {2001},
editor = {A. Branst\"adt, V.B. Le},
volume = {2204},
series = {Lecture Notes in Computer Science},
pages = {21--31},
address = {Boltenhagen, Germany},
month = {June},
publisher = {Springer-Verlag},
abstract = {We study the following Constrained Bipartite Edge Coloring (CBEC) problem: We are given a bipartite graph G(U,V,E) of maximum degree l with n vertices, in which some of the edges have been legally colored with c colors. We wish to complete the coloring of the edges of G minimizing the total number of colors used. The problem has been proved to be NP-hard event for bipartite graphs of maximum degree three [5].},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/cfk01b.pdf} 
}

@INPROCEEDINGS{CFKPR01,
author = {I. Caragiannis and A. Ferreira and C. Kaklamanis and S. P�rennes and H. Rivano},
title = {Fractional path coloring on bounded degree trees},
booktitle = {Proceedings of the 28th ICALP},
year = {2001},
editor = {F. Orejas and P. G. Spirakis and van Leeuwen, J.},
volume = {2076},
series = {Lecture Notes in Computer Science},
pages = {732--743},
address = {Crete, Greece},
month = {July},
publisher = {Springer-Verlag},
abstract = {This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a symmetric directed graph with a minimum number of colors, in such a way that paths using the same arc of the graph have different colors. This classic combinatorial problem finds applications in the minimization of the number of wavelengths in wavelength division multiplexing (wdm) all-optical networks.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/cfk01.pdf} 
}

@InProceedings{Cho01,
author = {S. Choplin},
title = {Virtual Path Layout in {ATM} Path with given hop count},
booktitle = {International Conference on Networking, ICN01},
pages = {527--537},
year = {2001},
volume = {2094, Part II},
series = {LNCS},
publisher = {Springer} 
}

@inproceedings{CKL01a,
author = {H. Cirstea and C. Kirchner and L. Liquori},
title = {{Matching Power}},
booktitle = {RTA, International Conference on Rewriting Techniques and Applications},
pages = {77--92},
series = lncs,
VOLUME = {2051},
year = {2001},
POSTSCRIPT= {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/rta-01.ps.gz} 
}

@inproceedings{CKL01b,
author = {H. Cirstea and C. Kirchner and L. Liquori},
title = {{The Rho Cube}},
booktitle = {FoSSaCS, International Conference on Foundations of Software Science and Computation Structures},
volume = {2030},
series = lncs,
year = {2001},
pages = {168--183},
POSTSCRIPT= {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/fossacs-01.ps.gz} 
}

@InProceedings{CoGr01,
author = {M. Cosnard and L. Grigori},
title = {A Parallel Algorithm for Sparse Symbolic LU Factorization without Pivoting on Out of Core Matrices},
booktitle = {15th ACM International Conference on Supercomputing (ICS'01)},
year = {2001},
month = {},
pages = {} 
}

@INPROCEEDINGS{Cou01,
author = {D. Coudert},
title = {Chemins disjoints de poids minimum pour la s�curisation de r�seaux de t�l�communications},
booktitle = {{Rencontres Francophones sur les Aspects Algorithmiques des T�l�communications -- AlgoTel}},
year = {2001},
pages = {47-53},
address = {St-Jean de Luz, France},
month = {28-30 Mai},
abstract = { Cette \'etude s'int\'eresse \`a la planification de r\'eseaux WDM tol\'erants aux pannes. Nous cherchons \`a \'etablir, pour chaque couple de n{\oe}uds du r\'eseau, deux chemins de communication disjoints, l'un \'etant r\'eserv\'e \`a la protection de l'autre. Pour un r\'eseau \`a $n$ n{\oe}uds et $m$ liens de communications, nous donnons un algorithme en $O(n(m+n\log n))$, permettant de calculer depuis un n{\oe}ud donn\'e et vers chacun des autres n{\oe}uds deux chemins arc-disjoints dont la somme des poids est minimale. Ceci am\'eliore la complexit\'e des solutions bas\'ees sur les algorithmes de flot de poids minimum, qui est en temps $O(m(m+n\log n)\log n)$ pour un seul couple de sommets.},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/Cou-AlgoTel01.ps.gz} 
}

@INPROCEEDINGS{CM01,
author = {D. Coudert and X. Mu�oz},
title = {{How Graph Theory can help Communications Engineering}},
booktitle = {Broad band optical fiber communications technology -- BBOFCT},
year = {2001},
editor = {D.K.Gautam},
pages = {47-61},
address = {Jalgaon, India},
month = {December},
publisher = {Nirtali Prakashan},
note = {Invited paper},
abstract = { We give an overview of different aspects of graph theory which can be applied in communication engineering, not trying to present immediate results to be applied neither a complete survey of results, but to give a flavor of how graph theory can help this field. We deal in this paper with network topologies, resource competition, state transition diagrams and specific models for optical networks.},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CM-BBOFCT01.ps.gz} 
}

@inproceedings{CeHa01,
author = "S. C�roi and F. Havet",
title = "Trees with three leaves are (n + 1)-unavoidable",
booktitle = "Electronic Notes in Discrete Mathematics",
volume = "7",
publisher = "Elsevier Science Publishers",
editor = "Jayme Szwarcfiter and Siang Song",
year = "2001" 
}

@inproceedings{DRR+01,
AUTHOR = {Dalle, O. and Radzik, J. and Rigal, C. and Rodi\`ere, F. and Sarol\'ea, C.},
TITLE = {{ASIMUT}: An Environment for the Simulation of Multi-Media Satellite Telecommunication Networks},
BOOKTITLE = {19th International Communications Satellite Systems Conference (ICSSC)},
YEAR = 2001,
ORGANIZATION = {AIAA},
MONTH = apr,
ADDRESS = {Toulouse, France} 
}

@inproceedings{MR2154484,
AUTHOR = {Everett, H. and de Figueiredo, C. M. H. and Klein, S. and Reed, B.},
TITLE = {Bull-reducible {B}erge graphs are perfect},
BOOKTITLE = {Comb01---Euroconference on Combinatorics, Graph Theory and Applications},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {10},
PAGES = {3 pp. (electronic)},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2001},

}

@inproceedings{MR1905628,
AUTHOR = {Fertin, G. and Raspaud, A. and Reed, B.},
TITLE = {On star coloring of graphs},
BOOKTITLE = {Graph-theoretic concepts in computer science (Boltenhagen, 2001)},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {2204},
PAGES = {140--153},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2001},

}

@InProceedings{Gal01b,
author = {J. Galtier},
title = {Semi-Definite Programming as a Simple Extension to Linear Programming: Convex Optimization with Queueing, Equity and Other Telecom Functionals},
booktitle = {$3^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2001)},
pages = {21--28},
year = 2001,
address = {Saint-Jean-de-Luz},
month = {May} 
}

@InProceedings{GaOl01,
author = {J. Galtier and A. Oliveira},
title = {A proposal to study satellite constellation routing via classical linear programming methods},
booktitle = {43rd conference of the Canadian Operations Research Society},
year = 2001 
}

@InProceedings{GPPR01,
title={Distance Labeling in Graphs},
author={C. Gavoille and D. Peleg and S. P\'erennes and R. Raz},
booktitle ={ SODA'01},
pages={210--219},
year={2001},

}

@INPROCEEDINGS{GD01,
AUTHOR = {C. Gomes and A. H. Dominguez},
TITLE = {Modelagem e Implementa\c c\~ao do m\'odulo tutor do ambiente AVA-TA@ead},
BOOKTITLE = {Anais XI Encontro de Inicia\c c\~ao Cient\'ifica da Universidade Federal de Alagoas},
SCHOOL = {Alagoas Federal University, AL},
YEAR = {2001},

}

@INPROCEEDINGS{HaWe01,
AUTHOR = "F. Havet and M. Wennink",
TITLE = "The Push Tree Problem",
BOOKTITLE = " SPAA'01: 13th ACM Symposium on Parallel Algorithms and Architectures",
YEAR = "2001",
address = {Cr\`ete , Gr\`ece},
month = {Juillet},
PAGES = "318--319",

}

@inproceedings{MR2154509,
AUTHOR = {McDiarmid, C. and Reed, B.},
TITLE = {Channel assignment on nearly bipartite and bounded treewidth graphs},
BOOKTITLE = {Comb01---Euroconference on Combinatorics, Graph Theory and Applications},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {10},
PAGES = {4 pp. (electronic)},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2001},

}

@inproceedings {MR2120347,
AUTHOR = {Molloy, M. and Reed, B.},
TITLE = {Colouring graphs when the number of colours is nearly the maximum degree},
BOOKTITLE = {Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing},
PAGES = {462--470 (electronic)},
PUBLISHER = {ACM},
ADDRESS = {New York},
YEAR = {2001},

}

@inproceedings {MR1958432,
AUTHOR = {Rautenbach, D. and Reed, B.},
TITLE = {Approximately covering by cycles in planar graphs},
BOOKTITLE = {Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (Washington, DC, 2001)},
PAGES = {402--406},
PUBLISHER = {SIAM},
ADDRESS = {Philadelphia, PA},
YEAR = {2001},

}

@INPROCEEDINGS{Riv01,
author = {H. Rivano},
title = {Planification de r�seaux optiques WDM k-fibres},
booktitle = {AlgoTel'01 - $3^{e}$ Rencontres Fran�aises sur les Aspects Algorithmiques des T�l�communications},
year = {2001},
pages = {41--46},
address = {Saint-Jean-de-Luz, France},
month = {mai},
abstract = {Cet article propose une mod�lisation en termes d'hypergraphe du probl�me d'affectation de longueurs d'onde � des chemins dans un r�seau \wdm $k$-fibres. La contrainte classique rencontr�e dans les r�seaux \wdm change de nature lorsque plusieurs fibres connectent physiquement deux noeuds du r�seau. Nous montrons l'�quivalence entre ce probl�me et la coloration $k${\em -tol�rante} de {\em l'hypergraphe des conflits} des chemins. Nous exploitons ensuite deux r�sultats d'algorithmique al�atoire de la litt�rature pour donner une premi�re approximation du dimensionnement des r�seaux $k$-fibres.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/riv01.pdf},
url = {http://ares.insa-lyon.fr/tarot/jsp/site/Portal.jsp?page_id=14} 
}

@techreport{AGT,
title="On fairness in bandwidth allocation",
author="E. Altman and J. Galtier and C. Touati",
month="septembre",
year="2001",
number="4269",
type="Rapport de Recherche",
institution="INRIA, Sophia Antipolis" 
}

@TECHREPORT{porto,
AUTHOR = {O. Audouin and C. Blaizot and E. Dotaro and M. Vigoureux and B. Beauquier and J-C. Bermond and B. Bongiovanni and S. P�rennes and M. Syska and S. Bibas and L. Chacon and B. Decocq and E. Didelet and A. Laugier and A. Lisser and A. Ouorou and F. Tillerot},
ADDRESS = {Sophia Antipolis},
INSTITUTION = {Alcatel Research \& Innovation, Projet MASCOTTE (CNRS/INRIA/UNSA) et France T�l�com R\&D},
MONTH = dec,
TITLE = {Planification et Optimisation des R�seaux de Transport Optiques},
TYPE = {{R}apport final {RNRT PORTO}},
YEAR = {2001},

}

@TECHREPORT{BCY01,
author = {J-C. Bermond and D. Coudert and M-L. Yu},
title = {{On DRC-Covering of $K_n$ by cycles}},
institution = {INRIA Research Report RR-4299, I3S Research Report I3S/RR-2002-30-FR},
year = {2001},
optnote = {RR-4299},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/I3SRR-2002-30-FR.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/RR-4299.ps.gz} 
}

@TECHREPORT{FPR+01,
author = {A. Ferreira and S. P�rennes and A. Richa and H. Rivano and N. Stier},
title = {On the design of multifiber WDM networks},
institution = {INRIA Research Report 4244},
year = {2001},
type = {Research Report},
month = {August},
abstract = {In this paper, we address multifiber optical networks with Wavelength Division Multiplexing (WDM). Assuming that the lightpaths use the same wavelength from source to destination, we extend the definition of the well-known Wavelength Assignment Problem (WAP), to the case where there are $k$ fibers per link, and $w$ wavelengths per fiber are available. We then develop a new model for the $(k,w)$-WAP, based on conflict hypergraphs -Conflict hypergraphs more accurately capture the lightpath interdependencies- , generalizing the conflict graphs used for single-fiber networks. By relating the $(k,w)$-WAP with the hypergraph coloring problem, we prove that the former is \npc, and present further results with respect to the complexity of that problem. Finally, we analyze the practical performances of two methodologies based on hypergraph coloring, on existing backbone networks in Europe and in the USA. The first relies on an integer programming formulation and the second consists of a heuristic based on a randomized algorithm. We consider the two natural optimization problems that arise from the $(k,w)$-WAP : the problem of minimizing $k$ given $w$, and that of minimizing $w$ given $k$},
url = {http://hal.inria.fr/inria-00072343} 
}

@TECHREPORT{FPR01,
author = {A. Ferreira and S. P�rennes and H. Rivano},
title = {Fractional coloring of bounded degree trees},
institution = {INRIA Research Report 4094},
year = {2001},
type = {Research Report},
month = {January},
abstract = {We study the dipath-coloring problem in bounded degree and treewidth symmetric digraphs, in which one needs to color the dipaths with a minimum number of colors, in such a way that dipaths using the same arc have different colors. This classic combinatorial problem finds applications in the minimization of the number of wavelengths in wavelength division multiplexing (WDM) all optical networks. In this paper, we prove that finding an optimal fractional coloring of such dipaths is polynomial. Our solution is constructive, i.e. we give an effective polynomial algorithm for the problem above. We also show some relationships between the integral and fractional problems, prove some polynomial instances of the coloring problem, and derive a $1 + 5/3e$ approximation for the \wdm problem in symmetric directed trees, where $e$ is the classical Neper constant, improving on previous results. Finally we present computational results suggesting that fractional coloring is a good oracle for a branch and bound strategy for coloring dipaths in symmetric directed trees and cycles.},
url = {http://hal.inria.fr/inria-00072538} 
}

@MastersThesis{Bas01,
author = {N. Baskiotis},
title = {Dimensionnement heuristique des r\'eseaux optiques WDM multifibres},
type={Rapport de Licence d'Informatique},
school = {ENS Lyon},
year = {2001},
type = {Rapport de stage},

}

@MastersThesis{Ber01,
author = {O. Bernardi},
title = {R\'eseaux de permutation et tol\'erance aux pannes},
school = {ENS Paris},
year = {2001},
type = {Rapport de Licence d'Informatique},

}

@MastersThesis{Bha01,
author = {S. Bhadra},
title = {Technique de d\'ecodage},
school = {IIT Madras},
year = {2001},
type = {Rapport de stage},

}

@MastersThesis{BCFN01,
author = { B. Boschat and A. Cusumano and S. Fourr� and P. Nassif-Bouery},
title = {Optimisation de r\'eseaux},
school = {Universit� de Nice Sophia Antipolis},
year = {2001},
type = {Rapport de projet, Ma\^{i}trise d'Informatique},

}

@MastersThesis{Cru01,
author = {T. Crulli},
title = {Partition de domaine en boucles},
school = {Brown university},
year = {2001},
type = {Rapport de stage},

}

@MastersThesis{Dil01,
author = {T. Dilys},
title = {Allocation de fr\'equences},
school = {IIT Bombay},
year = {2001},
type = {Rapport de stage},

}

@MastersThesis{Gir01,
author = {F. Giroire},
title = {Minimisation des commutateurs de r\'eseaux de satellites avec exc\`es d'entr\'ees et de sorties},
school = {ENS Paris},
year = {2001},
type = {Rapport de Ma\^{i}trise d'Informatique},

}

@MastersThesis{Jar01,
author = {A. Jarry},
title = {Protection dans les r\'eseaux optiques: graphes 2-connexes de diam\`etre fix\'e},
school = {ENS Lyon},
year = {2001},
type = {Rapport de DEA},

}

@MastersThesis{Lal01,
author = {J.-F. Lalande},
title = {Protection dans les r�seaux de t�l�communications},
school = {ISIMA Clermont-Ferrand},
year = {2001},
type = {Rapport de DEA},
PDF={ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Francois.Lalande/articles/rapport_stage_2001_dea.pdf},
POSTSCRIPT={ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Francois.Lalande/articles/rapport_stage_2001_dea.ps.gz} 
}

@MastersThesis{LeSc01,
author = {C. Lekbir and C. Scherhag},
title = {Finance algorithmique},
school = {IMAFA},
year = {2001},
type = {Rapport de projet},

}

@MastersThesis{Rai01,
author = {S. Rai},
title = { Design and optimisation of WDM networks},
school = {IIT New Delhi},
year = {2001},
type = {Rapport de stage},

}

@MastersThesis{Rau01,
author = {A. Raux},
title = {Site WWW du projet MASCOTTE},
school = {I.U.T.},
year = {2001},
type = {Rapport de 2e ann\'ee},

}

@MastersThesis{Rom01,
author = {S. Romanet},
title = {Interface et visualisation 3D pour la simulation de trafic routier},
school = {ISTG Grenoble},
year = {2001},
type = {Rapport de Ma\^{i}trise},

}

@MastersThesis{StG01,
author = {R. Saint-Gratien},
title = {Evaluation et optimisation des performances du syst\`eme de fichiers MPCFS},
school = {ESSI},
year = {2001},
type = {Rapport de projet},

}

@MastersThesis{Sav01,
author = {J. Savaresse},
title = {Microsimulation de trafic routier},
school = {ISIMA Clermont-Ferrand},
year = {2001},
type = {Rapport de 2e ann\'ee},

}

@MastersThesis{Soo01,
author = {R. Sood},
title = {Application du couplage au probl\`eme de tourn\'ee de v\'ehicules},
school = {IIT New Delhi},
year = {2001},
type = {Rapport de stage},

}

@MastersThesis{Sti01,
author = {N. Stier},
title = {Optimisation de r\'eseaux optiques},
school = {MIT Boston},
year = {2001},
type = {Rapport de stage},

}

@MastersThesis{Tem01,
author = {G. Temporal},
title = {Conception de r\'eseaux embarqu\'es tol\'erants aux pannes},
school = {Universit� de Nice Sophia Antipolis},
year = {2001},
type = {Rapport de DEA},

}

@MastersThesis{Val01,
author = {C. Vallebella},
title = {Routage et groupage dans les r�seaux de transport optiques},
school = {ESSI},
year = {2001},
type = {Rapport de 3e ann\'ee},

}

@BOOK{FeKi00,
EDITOR = {A. Ferreira and G. Kindervater},
NUMBER = {1},
PUBLISHER = {Elsevier Science B. V.},
TITLE = {Parallel Computing -- Special Issue on High Performance Computing in Operations Research},
VOLUME = {26},
YEAR = {2000},

}

@PhdThesis{Bea00,
author = "B. Beauquier",
title = "Communications dans les r�seaux optiques par multiplexage en longueur d'onde",
school = "universit� de Nice-Sophia Antipolis -- STIC",
year = "2000",
month = "janvier",
POSTSCRIPT = "ftp://ftp-sop.inria.fr/mascotte/Publications/Bea00.ps.gz",

}

@PHDTHESIS{Jim00,
AUTHOR = {T. Jim�nez},
MONTH = sep,
SCHOOL = {universit� de Nice-Sophia Antipolis},
TITLE = {Simulation de trafic routier: �tude des m�thodologies de mod�lisation et parall�lisation et mise en \oe uvre},
YEAR = {2000} 
}

@PhdThesis{Mar00,
author = {N. Marlin},
title = {Communications Structur�es dans les R�seaux},
school = {universit� de Nice-Sophia Antipolis},
year = {2000},
address = {},
month = {juin},

}

@ARTICLE{ABJ+00b,
AUTHOR="E. Altman and E. Ba{\c c}sar and T. Jim�nez and N. Shimkin",
TITLE="Routing into Two Parallel Links:Game-Theoretic Distributed Algorithms",
JOURNAL="Journal of Parallel and Distributed Computing",
NUMBER="Special Issue on Routing in Computer and Communication Networks",
YEAR="2000" 
}

@ARTICLE{AJK00,
AUTHOR="E. Altman and T. Jim�nez and G. Koole",
TITLE="On optimal call admission control",
JOURNAL="IEEE Trans. on Communications",
YEAR="2000" 
}

@article{BBDD+00,
AUTHOR = {Becker, M. and Beylot, A.-L. and Dalle, O. and Dhaou, R. and Marot, M. and Mussi, P. and Rigal, C. and Sutter, V.},
TITLE = {The ASIMUT Simulation Workshop},
JOURNAL = {Networking and Information Systems Journal},
YEAR = 2000,
VOLUME = 3,
NUMBER = 2,
pages = {335--348} 
}

@article {MR1735345,
AUTHOR = {Berge, C. and Reed, B.},
TITLE = {Optimal packings of edge-disjoint odd cycles},
JOURNAL = {Discrete Math.},
VOLUME = {211},
YEAR = {2000},
NUMBER = {1-3},
PAGES = {197--202},

}

@Article{BBM+00,
Author= {J-C. Bermond and J. Bond and C. Martin and A. Pekec and F. S. Roberts},
Title= {Optimal orientation of annular networks},
Year={2000},
Journal={ JOIN },
Volume= {1},
Number= {1},
Pages= {21-46},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BBM+00.pdf},

}

@article{BGPR+00,
author= { J-C. Bermond and L. Gargano and S. P\'erennes and A.A. Rescigno and U. Vaccaro },
title= { Efficient Collective Communications in Optical Networks },
journal= { Theoretical Computer Science },
year= { 2000 },
volume= { 233 },
number = {1-2},
pages= { 165--189 },
pdf= { http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BGP+00.pdf },

}

@Article{BMY00,
Author= {J-C. Bermond and S. Marshall and M-L. Yu},
Title={Improved bounds for gossiping in mesh-bus networks},
Year={2000},
Journal={ JOIN},
Volume= {1},
Number= {1},
Pages= {1-19},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BMY00.pdf},

}

@article{BFMP+00,
author= { P. Berthom\'e and A. Ferreira and S. P\'erennes and G. Plaxton and B. Maggs },
journal= { Algorithmica },
pages= { 237--254 },
title= { Sorting-based selection algorithms on hypercubic networks },
volume= { 26 },
number = {2},
year= { 2000 },

}

@Article{BDLM00,
author = {M. Bugliesi and G. Delzanno and L. Liquori and M. Martelli},
title = {Object {C}alculi in {L}inear {L}ogic},
journal = jlc,
year = {2000},
pages = {75--104},
number = {1},
volume = {10},
editor = {Oxford University Press},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/jlc-00.ps.gz} 
}

@ARTICLE{CFM00,
author = {D. Coudert and A. Ferreira and X. Mu�oz},
title = {{Topologies for Optical Interconnection Networks Based on the Optical Transpose Interconnection System}},
journal = {OSA Applied Optics -- Information Processing},
year = {2000},
volume = {39},
pages = {2965-2974},
number = {17},
month = jun,
abstract = {Many results exist in the literature describing technological and theoretical advances in optical network topologies and design. However, an essential effort has yet to be done in linking those results together. In this paper, we propose a step in this direction, by giving optical layouts for several graph-theoretical topologies studied in the literature, using the Optical Transpose Interconnection System (OTIS) architecture. These topologies include the family of Partitioned Optical Passive Star (POPS) and stack-Kautz networks as well as a generalization of the Kautz and de Bruijn digraphs.},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFM-AO00.ps.gz} 
}

@ARTICLE{CFM00b,
author = {D. Coudert and A. Ferreira and X. Mu{\~n}oz},
title = {A Multihop-Multi-OPS Optical Interconnection Network},
journal = {IEEE/OSA Journal of Lightwave Technology},
year = {2000},
volume = {18},
pages = {2076-2085},
number = {12},
abstract = { In this paper we study the design of regular multicast networks implemented with Optical Passive Star (OPS) couplers. We focus on an architecture based on both Kautz graphs and stack-graphs, and show that it is very cost-effective with respect to its resources requirements, namely the number of OPS couplers, power budget, scalability and number of transceivers, and presents a large ratio number-of-nodes/diameter. The important issue of medium access control is also addressed and control protocols for accessing the optical couplers are given and analyzed. Finally, we show through simulation that these control protocols efficiently implement shortest path routing on these networks.},
key = {December},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFM-JLT00.ps.gz} 
}

@ARTICLE{FGS00,
AUTHOR = {A. Ferreira and A. Goldman and S. W. Song},
JOURNAL = {Journal of Interconnection Networks - JOIN},
TITLE = {Broadcasting in bus interconnection networks},
VOLUME = {1},
NUMBER = {2},
PAGES = {73--94},
YEAR = {2000},

}

@ARTICLE{FeSc00,
AUTHOR = {A. Ferreira and Nicolas Schabanel},
ADDRESS = {Australia},
JOURNAL = {Parallel Processing Letters},
NUMBER = {3},
PAGES = {411--422},
TITLE = {A randomized {BSP/CGM} algorithm for the maximal independent set},
VOLUME = {9},
YEAR = {2000},

}

@Article{Gal00b,
author = {J. Galtier},
title = {Load Balancing Issues in the Prepartitioning Method},
journal = {Computers and Artificial Intelligence},
year = {2000},
volume = {19},
number = {4},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/Gal00b.pdf},

}

@article {MR1793319,
AUTHOR = {McDiarmid, C. and Reed, B.},
TITLE = {Channel assignment and weighted coloring},
JOURNAL = {Networks},
VOLUME = {36},
YEAR = {2000},
NUMBER = {2},
PAGES = {114--117},

}

@article {MR1792120,
AUTHOR = {Perkovi{\'c}, L. and Reed, B.},
TITLE = {An improved algorithm for finding tree decompositions of small width},
NOTE = {Selected papers from the Workshop on Theoretical Aspects of Computer Science (WG 99), Part 1 (Ascona)},
JOURNAL = {Internat. J. Found. Comput. Sci.},
VOLUME = {11},
YEAR = {2000},
NUMBER = {3},
PAGES = {365--371},

}

@article {MR1737626,
AUTHOR = {Reed, B. and Thomas, R.},
TITLE = {Clique minors in graphs and their complements},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {78},
YEAR = {2000},
NUMBER = {1},
PAGES = {81--85},

}

@INPROCEEDINGS{ABJ+00a,
AUTHOR="E. Altman and E. Ba\c{c}sar and T. Jim�nez and N. Shimkin",
TITLE="Competitive Routing in Networks with Polynomial Cost",
BOOKTITLE="IEEE Infocom 2000",
MONTH="mars ",
PAGES="1586--1593",
YEAR="2000" 
}

@INPROCEEDINGS{ACPR00,
author = "A. Andreev and A. Clementi and P. Penna and J. Rolim",
title = "Parallel Read Operations Without Memory Contention",
booktitle = "Electronic Colloquium on Computational Complexity",
volume = "TR00-53",
year = "2000" 
}

@InProceedings{BCF+00,
author = {B. Beauquier and K.S. Candan and A. Ferreira and S. P�rennes and A. Sen},
title = "On shortest path problems with ``non-{M}arkovian'' link contribution to path lengths",
booktitle = {Proc. of IFIP/TC6 Networking 2000 Conference},
OPTpages = {},
year = {2000},
address = {Paris, France},
month = "mai",

}

@InProceedings{BeDa00,
author = {B. Beauquier and E. Darrot},
title = "Arbitrary size {W}aksman networks and their vulnerability",
year = {2000},
OPTpages = {},
publisher = {World Scientific},
booktitle = {Actes des $1^{res}$ Rencontres Francophones sur les Aspects Algorithmiques des T�l�communications (AlgoTel'99)},

}

@InProceedings{BFGP00a,
author = {P. Berg� and A. Ferreira and J. Galtier and S. Petit},
title = {A probabilistic study of inter-satellite links load in polar orbit satellite constellations},
booktitle = {$2^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2000)},
pages = {137--142},
year = {2000},
address = {La Rochelle, France},
month = {Mai} 
}

@InProceedings{BBK+00,
Author= {J-C. Bermond and A. Bonnecaze and T. Kodate and S. Perennes and P. Sole },
Title= {Broadcasting in hypercubes in the circuit switched model},
Year={2000},
BookTitle={Proc. Conference IPDPS 2000, Cancun, Mexico,, May 2000},
Pages={21-26},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BBK+00.pdf},

}

@INPROCEEDINGS{BC+00,
author = {J-C. Bermond and L. Chacon and D. Coudert and F. Tillerot},
title = {Conception d'un r\'eseau {WDM} prot\'eg\'e par sous-r\'eseaux},
booktitle = {2\`eme Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel'00)},
year = {2000},
pages = {83-88},
address = {La Rochelle, France},
month = May,
abstract = {Nous proposons une mod�lisation de la construction d'un r�seau WDM prot�g� comme l'extension du probl�me classique de couverture des ar�tes d'un graphe. Un ensemble de r�sultats est donn� pour la r�alisation de l'instance All-to-All sur un r�seau en anneau.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Publications/BC+00.pdf},
url = {http://hal.inria.fr/inria-00429292},
isbn = {2-7261-1157-2},
publisher = {INRIA},

}

@INPROCEEDINGS{BCP00,
author = "G. Bongiovanni and A. Clementi and P. Penna",
title = "A Note on Parallel Read Operations on Large Public Databases",
booktitle = "Proc. of ARACNE-00, International Workshop on Approximation and Randomized Algorithms in Communication Networks",
volume = "Carleton Scientific Press",
pages = "123--133",
year = "2000" 
}

@INPROCEEDINGS{CFP+00,
author = "A. Clementi and A. Ferreira and P. Penna and S. P�rennes and R. Silvestri",
title = "The Minimum Range Assignment Problem on Linear Radio Networks",
booktitle = "Proc. of ESA-00, 8th Annual European Symposium on Algorithms",
year = "2000",
volume = "LNCS",
number = "1879",
pages = "143--154" 
}

@INPROCEEDINGS{CPS00b,
author = "A. Clementi and P. Penna and R. Silvestri",
title = "On The Power Assignment Problem in Radio Networks",
booktitle = "Electronic Colloquium on Computational Complexity",
volume = "TR00-54",
year = "2000" 
}

@INPROCEEDINGS{CPS00a,
author = "A. Clementi and P. Penna and R. Silvestri",
title = "The Power Range Assignment Problem in Radio Networks on the Plane",
booktitle = "Proc. of STACS-00, 17th Annual Symposium on Theoretical Aspects of Computer Science",
year = "2000",
volume = "LNCS",
number = "1770",
pages = "651--660" 
}

@INPROCEEDINGS{CoLi00b,
AUTHOR = {Colnet, D. and Liquori, L.},
TITLE = {Match-{O}, a {S}tatically {S}afe\,(?) {D}ialect of {E}iffel},
YEAR = {2000},
PUBLISHER = {IEEE Computer Society},
BOOKTITLE = {TOOLS, International Conference on Technology of Object-Oriented Languages and Systems},
PAGES = {190--201},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/tools-00.ps.gz} 
}

@INPROCEEDINGS{CFP00,
author = {D. Coudert and A. Ferreira and S. Perennes},
title = {{De Bruijn Isomorphisms and Free Space Optical Networks}},
booktitle = {IEEE International Parallel and Distributed Processing Symposium},
year = {2000},
pages = {769-774},
publisher = {IEEE Press},
abstract = {The de Bruijn digraph $B(d,D)$ has degree $d$, diameter $D$, $d^D$ vertices and $d^{D+1}$ arcs. It is usually defined by words of size $D$ on an alphabet of cardinality $d$, through a cyclic left shift permutation on the words, after which the rightmost symbol is changed. In this paper, we show that any digraph defined on words of a given size, through an {\em arbitrary} permutation on the alphabet {\bf and} an {\em arbitrary} permutation on the word indices, is isomorphic to the de Bruijn digraph, provided that this latter permutation is {\em cyclic}. We use this result to improve from $O\left(d^{D+1}\right)$ to $\Theta\left(\sqrt{d^{D+1}}\right)$ the number of lenses required for the implementation of $B(d,D)$ by the Optical Transpose Interconnection System proposed by Marsden {\em et al.} (Optics Letters 18(13):1083-1085, July 1993).},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFP-IPDPS00.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFP-IPDPS00.ps.gz} 
}

@INPROCEEDINGS{CGP00,
author = "P. Crescenzi and G. Gambosi and P. Penna",
title = "On-Line Algorithms for the Channel Assignment Problem in Cellular Networks",
booktitle = "Proc. of ACM DIALM-2000, 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications",
year = "2000",
pages = "1--7" 
}

@InProceedings{DMRS00,
Author= {O. Dalle and P. Mussi and and C. Rigal and V. Sutter},
Title= {ASIMUT: An Environment for the Simulation of Multi-Media Satellite Telecommunication Networks},
BookTitle={Proc. 6th ESA Workshop on Simulation in European Space Pragrams},
Year={2000},
Month={October},
Organization={European Space Agency},
ADDRESS = {ESTEC, Noordwijk, The Netherlands},
url={http://www.inria.fr/mascotte/Olivier.Dalle/Postscript/ESA-SESP2000.ps.gz},
pages={285--288},

}

@INPROCEEDINGS{FGM+00,
AUTHOR = {A. Ferreira and J. Galtier and P. Mahey and G. Mateus and A. Oliveira},
ADDRESS = {Dallas, USA},
BOOKTITLE = {Proceedings of ISPAN},
MONTH = dec,
TITLE = {An Optimization Model for Routing in Low Earth Orbit Satellite Constellations},
YEAR = {2000},

}

@InProceedings{FGP00,
author = {A. Ferreira and J. Galtier and S. P\'erennes},
title = {Approximation of a straight line in a bounded lattice},
booktitle = {$2^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2000)},
pages = {53--58},
year = {2000},
address = {La Rochelle, France},
month = {Mai} 
}

@conference{FPPP00,
title={Assigning labels in unknown anonymous networks},
author={P. Fraigniaud and A. Pelc and D. Peleg and S. P�rennes},
booktitle={Proceedings of PODC 2000, (Nineteenth Annual ACM SIGACT-SIGOPS Symposium on PRINCIPLES OF DISTRIBUTED COMPUTING)},
pages={101--112},
year={2000},

}

@InProceedings{GaLa00,
author = {J. Galtier and S. Lanteri},
title = {On overlapping partitions},
booktitle = {Proceedings of the 2000 International Conference on Parallel Processing},
pages = {461--468},
year = 2000,
editor = {David J. Lilja},
address = {Toronto, Canada},
month = {ao�t} 
}

@InProceedings{Gal00,
author = {J. Galtier},
title = {Routing issues for LEO satellite constellations},
booktitle = {International Conference on Advances in Infrastructure for Electronic Business, Science, and Education on the Internet (SSGRR 2000)},
year = 2000,
address = {L'Aquila, Italie},
month = {juillet} 
}

@conference{GPPV00,
author={L. Gargano and A. Pelc and S. P�rennes and U. Vaccaro},
title={ Efficient communication in unknown networks},
booktitle={ Proc. of WG'2000 - 26th International Workshop on Graph-Theoretic Concepts in Computer Science},
year={2000},
note={A para�tre},

}

@InProceedings{HLM00b,
AUTHOR = {S. Haddad and A. Laugier and Jean-Francois Maurras},
TITLE = {Global designing of telecommunication networks},
booktitle = {CO 2000},
YEAR = {2000}
}

@InProceedings{HLM00a,
AUTHOR = {S. Haddad and A. Laugier and Jean-Francois Maurras},
TITLE = {Designing telecommunication networks with global capacities under survivability constraints},
booktitle = {ECCO XIII},
YEAR = {2000}
}

@InProceedings{HMP00b,
author = {M.-C. Heydemann and N. Marlin and S. P�rennes},
title = {Rotational Cayley Graphs on Transposition Generated Groups (Extended Abstract)},
booktitle = {6�me Colloque International de Th�orie des Graphes},
pages = {187--190},
year = {2000},
series = {Electronical Notes in Discrete Mathematics},
publisher = {Elsevier Science} 
}

@INPROCEEDINGS{Jim00a,
AUTHOR="T. Jim�nez",
TITLE="Optimal Admission Control for High Speed Networks: A Dynamic Programming Approach",
BOOKTITLE="IEEE Conference on Decision and Control",
MONTH="decembre",
YEAR="2000" 
}

@InProceedings{JMS00a,
author = {T. Jim�nez and P. Mussi and G. Siegel },
title = {A road traffic simulator : car-following and lane-changing},
booktitle = {European Simulation Multiconference 2000},
ADDRESS = "Gent, Belgium",
year = {2000},
month = {Mai},
pages={241--245},

}

@InProceedings{JMS00b,
author = {T. Jim�nez and P. Mussi and G. Siegel },
title = {The distribution and partitioning scheme of the {HIPERTRANS} traffic simulator},
booktitle = {European Simulation Symposium 2000},
ADDRESS = "Hamburg, Allemagne",
year = {2000},
month = {September},
pages={462--466},

}

@InProceedings{LaMa00,
AUTHOR={A. Laugier and P. Mahey},
TITLE={Design of multi-level-protocol data networks},
booktitle = {$2^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2000)},
pages = {107--111},
year = {2000},
address = {La Rochelle, France},
month = {Mai} 
}

@inproceedings {MR1801140,
AUTHOR = {Molloy, M. and Reed, B.},
TITLE = {Near-optimal list colorings},
BOOKTITLE = {Proceedings of the Ninth International Conference ``Random Structures and Algorithms'' (Poznan, 1999)},
JOURNAL = {Random Structures Algorithms},
VOLUME = {17},
YEAR = {2000},
NUMBER = {3-4},
PAGES = {376--402},

}

@inproceedings{MR1969967,
AUTHOR = {Molloy, M. and Reed, B.},
TITLE = {{$k$}-colouring when {$k$} is close to {$\Delta$}},
BOOKTITLE = {6th International Conference on Graph Theory (Marseille, 2000)},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {5},
PAGES = {4 pp. (electronic)},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2000},

}

@INPROCEEDINGS{Pen00,
author = "P. Penna",
title = "Succinct Representations of Model Based Belief Revision",
booktitle = "Proc. of STACS-00, 17th Annual Symposium on Theoretical Aspects of Computer Science",
year = "2000",
volume = "LNCS",
number = "1770",
pages = "205--216" 
}

@inproceedings {MR2115284,
AUTHOR = {Reed, B.},
TITLE = {How tall is a tree?},
BOOKTITLE = {Proceedings of the Thiry-Second Annual ACM Symposium on Theory of Computing},
PAGES = {479--483 (electronic)},
PUBLISHER = {ACM},
ADDRESS = {New York},
YEAR = {2000},

}

@TechReport{BDP00,
author = {B. Beauquier and O. Delmas and S. P\'erennes},
title = "Tight bounds for broadcasting in the linear cost model",
institution = {INRIA},
year = {2000},
type = {Rapport de Recherche},
number = {3827},
OPTaddress = {},
month = "novembre",

}

@techreport{DaRi00,
AUTHOR = {Dalle, O. and Rigal, C.},
TITLE = {Exemple d'utilisation de l'environnement de simulation {ASIMUT}},
INSTITUTION = {C.N.E.S.},
YEAR = {2000},
MONTH = {Mars},
TYPE = {Rapport technique},
NUMBER = {ATF-SB-1-0043-CNES} 
}

@techreport{DaSu00,
AUTHOR = {Dalle, O. and Sutter, V.},
TITLE = {Sp\'ecification technique de besoin logiciel de l'environnement de simulation {ASIMUT}},
INSTITUTION = {C.N.E.S.},
YEAR = {2000},
MONTH = {Mars},
TYPE = {Sp�cification},
NUMBER = {ATF-SB-1-0029-CNES} 
}

@TechReport{Dar00,
Author = {Darrot, E.},
Title = {Convention A11518 {INRIA}--{A}lcatel {S}pace {I}ndustries},
Type = {Rapport de contrat,version r�vis�e},
Institution = {INRIA Sophia Antipolis},
Address = {France},
Month = {Mai},
Year = {2000} 
}

@MastersThesis{Bla00,
author = {F. Blanc},
title = {Probl�mes de flips 3D},
school = {ESSI},
year = {2000},
type = {Rapport de stage},

}

@MastersThesis{Bof00,
author = {P. Boffa},
title = {L'internet dynamique},
school = {DUT Infocom IUT de Nice c�te d'azur, Universit\'e de Nice Sophia-Antipolis},
year = {2000},
type = {Rapport de stage de deuxi�me ann�e},

}

@MastersThesis{Bon00,
author = {B. Bongiovanni},
title = {IGP Interface Graphique pour PORTO},
school = {Universit\'e de Nice Sophia-Antipolis},
year = {2000},
type = {Rapport de DESS Telecoms},

}

@MastersThesis{Con00,
author = {G. Conjat},
title = {Data Mining sur le Web avec applications � l'Analyse Technique des March�s financiers},
school = {ESSI},
type = {Rapport de stage},
year = {2000},

}

@MastersThesis{Hui00,
author = {G.Huiban},
title = {Les probl�mes de groupage dans les r�seaux de t�l�communication},
school = { ISIMA, Clermont-Ferrand},
year = {2000},
type = {Rapport de stage de deuxi�me ann�e},

}

@MastersThesis{Gav00,
author = {J. Gavet},
title = {Hipertrans: validation et modification des algorithmes},
school = {ISIMA, Clermont-ferrand},
year = {2000},
type = {Rapport de stage de deuxi�me ann�e},

}

@MastersThesis{Lic00,
author = {N. Lichiardopol},
title = {Points fixes des rotations compl�tes dans un graphe de cayley orient�},
school = {Universit\'e de Luminy, Marseille},
year = {2000},
type = {Rapport de DEA MDFI},

}

@MastersThesis{Mag00,
author = {F. Maginot},
title = {R�seaux tol�rants aux pannes},
school = {Universit\'e de Luminy, Marseille},
year = {2000},
type = {Rapport de DEA MDFI},

}

@MastersThesis{Mas00,
author = {G. Masson},
title = {IGP Interface Graphique pour PORTO},
school = {Universit\'e de Nice Sophia-Antipolis},
year = {2000},
type = {Rapport de DESS Telecoms},

}

@MastersThesis{Plo00,
author = {J. Plouchart},
title = {Propositions m�thodologiques pour la simulation multi-niveaux},
school = {Universit� de Nice Sophia-Antipolis},
year = {2000},
type = {Rapport de DEA RSD},

}

@MASTERSTHESIS{Riv00,
author = {H. Rivano},
title = {La coloration fractionnaire appliqu�e � la r�solution de probl�mes de planification de r�seaux optiques WDM},
school = {Universit� de Nice Sophia-Antipolis et ENS Lyon},
year = {2000},
type = {Rapport de DEA RSD},
url = {http://ensl.free.fr/rapports/} 
}

@MastersThesis{Wac00,
author = {B. Wack},
title = {R�seaux optiques � multiplexage en longueur d'onde},
school = {ENS Lyon},
year = {2000},
type = {Rapport de stage de magist\`ere d'informatique},

}

@Book{AFG99,
author ={E. Altman and A. Ferreira and J. Galtier},
title = {Les r�seaux satellitaires de t�l�communications},
publisher = {Inter�ditions},
year = {1999},

}

@phdthesis{Dal99a,
AUTHOR = {Dalle, O.},
TITLE = {Techniques et outils pour les communications et la r\'epartition dynamique de charge dans les r\'eseaux de stations de travail},
SCHOOL = {Universit\'e de Nice - Sophia Antipolis, \'Ecole doctorale Sciences Pour l'Ing\'enieur},
YEAR = 1999,
MONTH = {Janvier},
TYPE = {Th\`ese de Doctorat} 
}

@PHDTHESIS{Fur99,
AUTHOR = {N. Furmento},
ADDRESS = {France},
MONTH = may,
SCHOOL = {Universit\'e de Nice-Sophia Antipolis},
TITLE = {{Schooner\,: Une Encapsulation Orint\'ee Objet de Supports d'Ex\'ecution pour Applications R\'eparties}},
YEAR = {1999} 
}

@INCOLLECTION{BBP99,
Author= {R. Balakhrishnan and J-C. Bermond and P. Paulraja},
booktitle ={Editors Special Issues of Discrete Mathematics},
title ={Combinatorics and Number Theory},
Year={1999},
Journal={Discrete Mathematics },
publisher ={North Holland},
Volume= {206},
Pages= {1-220},

}

@INCOLLECTION{Fer99,
author = {A. Ferreira},
title = {On the design of parallel discrete algorithms for high performance computing systems},
booktitle = {Parallel Processing of Discrete Problems},
editor = {P. Pardalos},
publisher = {Springer Verlag},
volume = {106},
pages = {75-83},
address = {New York (USA)},
series = {The IMA Volumes in Mathematics and its Aplications},
year = {1999} 
}

@INCOLLECTION{Fer99,
AUTHOR = {A. Ferreira},
ADDRESS = {New York (USA)},
BOOKTITLE = {Parallel Processing of Discrete Problems},
EDITOR = {P. Pardalos},
KEY = {bc-chapter},
PAGES = {75-83},
PUBLISHER = {Springer Verlag},
SERIES = {The IMA Volumes in Mathematics and its Aplications},
TITLE = {{On the design of parallel discrete algorithms for high performance computing systems}},
VOLUME = {106},
YEAR = {1999},

}

@incollection {MR1673506,
AUTHOR = {Molloy, M. and Reed, B.},
TITLE = {Graph colouring via the probabilistic method},
BOOKTITLE = {Graph theory and combinatorial biology (Balatonlelle, 1996)},
SERIES = {Bolyai Soc. Math. Stud.},
VOLUME = {7},
PAGES = {125--155},
PUBLISHER = {J\'anos Bolyai Math. Soc.},
ADDRESS = {Budapest},
YEAR = {1999},

}

@incollection {MR1660786,
AUTHOR = {Molloy, M. and Reed, B. and Steiger, William},
TITLE = {On the mixing rate of the triangulation walk},
BOOKTITLE = {Randomization methods in algorithm design (Princeton, NJ, 1997)},
SERIES = {DIMACS Ser. Discrete Math. Theoret. Comput. Sci.},
VOLUME = {43},
PAGES = {179--190},
PUBLISHER = {Amer. Math. Soc.},
ADDRESS = {Providence, RI},
YEAR = {1999},

}

@ARTICLE{Bea99,
author = {B. Beauquier},
title = {All-To-All Communication in some Wavelength-Routed All-Optical Networks},
journal = {Networks},
publisher = {Wiley-Interscience},
volume = {33},
number = {3},
pages = {179--187},
year = {1999},
month = {may},

}

@article {MR1703423,
AUTHOR = {Berge, C. and Reed, B.},
TITLE = {Edge-disjoint odd cycles in graphs with small chromatic number},
NOTE = {Symposium \`a la M\'emoire de Fran\c cois Jaeger (Grenoble, 1998)},
JOURNAL = {Ann. Inst. Fourier (Grenoble)},
VOLUME = {49},
YEAR = {1999},
NUMBER = {3},
PAGES = {783--786},

}

@article{BBKP+99,
author= { J-C. Bermond and A. Bonnecaze and T. Kodate and S. P\'erennes and P. Sol\'e },
title= { Symetric flows and broadcasting in hypercubes },
year= { 1999 },
journal= { Annales de l'Institut Fourier },
volume= { 49 },
pages= { 787-807 },
pdf= { http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BBK+99.pdf },

}

@Article{BBDL99,
author = {Bono, V. and Bugliesi, M. and {Dezani-Ciancaglini}, M. and Liquori, L.},
title = {Subtyping for {E}xtensible, {I}ncomplete {O}bjects},
journal = fi,
year = {1999},
volume = {38},
number = {4},
pages = {325--364},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/fi-99.ps.gz} 
}

@ARTICLE{CFR99,
AUTHOR = {R. Corr\^ea and A. Ferreira and P. Rebreyend},
JOURNAL = {IEEE Transactions on Parallel and Distributed Systems},
KEY = {j-journal},
MONTH = aug,
NUMBER = {8},
PAGES = {825-837},
TITLE = {{Scheduling multiprocessor tasks with genetic algorithms}},
VOLUME = {10},
YEAR = {1999},

}

@ARTICLE{CFR99,
AUTHOR = {R. Corr\^ea and A. Ferreira and P. Rebreyend},
JOURNAL = {IEEE Transactions on Parallel and Distributed Systems},
KEY = {j},
MONTH = aug,
NUMBER = {8},
PAGES = {825-837},
TITLE = {Integrating list heuristics in genetic algorithms for multiprocessor scheduling},
VOLUME = {10},
YEAR = {1999} 
}

@ARTICLE{DFRU99,
author = {M. Diallo and A. Ferreira and A. Rau-Chaplin and S. Ub�da},
title = {Scalable 2d convex hull and triangulation algorithms for coarse-grained multicomputers},
journal = {Journal of Parallel and Distributed Computing},
volume = {56},
number = {1},
pages = {47--70},
year = {1999},
month = {jan},

}

@ARTICLE{FKRU99,
author = {A. Ferreira and C. Kenyon and A. Rau-Chaplin and S. Ub�da},
title = {d-Dimensional Range Search on Multicomputers},
journal = {Algorithmica},
volume = {24},
number = {3/4},
pages = {195-208},
note = {Special Issue on Coarse Grained Parallel Algorithms},
year = {1999},

}

@ARTICLE{FeUb99,
author = {A. Ferreira and S. Ub�da},
title = {Computing the medial axis transform in parallel with 8 scan operations},
journal = {IEEE Transactions on Pattern Analysis \& Machine Intelligence (PAMI)},
volume = {21},
number = {3},
pages = {277-282},
year = {1999},
month = {mar},

}

@article {MR1643445,
AUTHOR = {Hind, Hugh and Molloy, M. and Reed, B.},
TITLE = {Total coloring with {$\Delta+{\rm poly}(\log\Delta)$} colors},
JOURNAL = {SIAM J. Comput.},
VOLUME = {28},
YEAR = {1999},
NUMBER = {3},
PAGES = {816--821 (electronic)},

}

@article {MR1666954,
AUTHOR = {Maffray, F. and Reed, B.},
TITLE = {A description of claw-free perfect graphs},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {75},
YEAR = {1999},
NUMBER = {1},
PAGES = {134--156},

}

@article {MR1665964,
AUTHOR = {Mahadev, N. V. R. and Reed, B. A.},
TITLE = {A note on vertex orders for stability number},
JOURNAL = {J. Graph Theory},
VOLUME = {30},
YEAR = {1999},
NUMBER = {2},
PAGES = {113--120},

}

@article {MR1675915,
AUTHOR = {McDiarmid, C. and Reed, B.},
TITLE = {Colouring proximity graphs in the plane},
JOURNAL = {Discrete Math.},
VOLUME = {199},
YEAR = {1999},
NUMBER = {1-3},
PAGES = {123--137},

}

@article {MR1712383,
AUTHOR = {Molloy, M. and Reed, B.},
TITLE = {Critical subgraphs of a random graph},
JOURNAL = {Electron. J. Combin.},
VOLUME = {6},
YEAR = {1999},
PAGES = {Research Paper 35, 13 pp. (electronic)},

}

@article {MR1686286,
AUTHOR = {Reed, B.},
TITLE = {The list colouring constants},
JOURNAL = {J. Graph Theory},
VOLUME = {31},
YEAR = {1999},
NUMBER = {2},
PAGES = {149--153},

}

@article {MR1684925,
AUTHOR = {Reed, B.},
TITLE = {Edge coloring nearly bipartite graphs},
JOURNAL = {Oper. Res. Lett.},
VOLUME = {24},
YEAR = {1999},
NUMBER = {1-2},
PAGES = {11--14},

}

@article {MR1723044,
AUTHOR = {Reed, B.},
TITLE = {Mangoes and blueberries},
JOURNAL = {Combinatorica},
VOLUME = {19},
YEAR = {1999},
NUMBER = {2},
PAGES = {267--296},

}

@article {MR1699199,
AUTHOR = {Reed, B.},
TITLE = {A strengthening of {B}rooks' theorem},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {76},
YEAR = {1999},
NUMBER = {2},
PAGES = {136--149},

}

@INPROCEEDINGS{AKJ99,
author = {E. Altman and G. Koole and T. Jim�nez},
title = {Comparing tandem queueing systems and their fluid limits},
booktitle = {37th Annual Allerton Conference on Communication, Control, and Computing},
year = {1999},
month = {September},

}

@INPROCEEDINGS{BCFS99,
AUTHOR = {F. Baude and D. Caromel and N. Furmento and D. Sagnol},
ADDRESS = {Amsterdam, The Netherlands},
BOOKTITLE = {Proceedings of the 7th International Conference - High Performance Computing Networking'99 (HPCN Europe 1999)},
EDITOR = {Peter Sloot and Marian Bubak and Alfons Hoekstra and Bob Hertzberger},
MONTH = apr,
PAGES = {744-753},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{Overlapping Communication with Computation in Distributed Object Systems}},
VOLUME = {1593},
YEAR = {1999} 
}

@InProceedings{BeDa99,
author = {B. Beauquier and E. Darrot},
title = {Arbitrary size {W}aksman networks},
booktitle = {Actes des 1�res Rencontres Francophones sur les Aspects Algorithmiques des T�l�communications (AlgoTel'99)},
pages = {95-100},
address = {Roscoff, France},
year = {1999},
month = {may},

}

@InProceedings{BPT99,
author = {B. Beauquier and S. P{\'e}rennes and D. T{\'o}th},
title = {All-to-All Routing and Coloring in Weighted Trees of Rings},
booktitle = {Proc. of 11th ACM Symp. on Parallel Algorithms and Architectures (SPAA)},
publisher = {ACM Press},
address = {Saint-Malo, France},
year = {1999},
pages = {185-190},
month = {jun},

}

@InProceedings{BFGP99,
author = {P. Berg\'e and A. Ferreira and J. Galtier and J.-N. Petit},
title = {A load study for intersatellite links in satellite constellations},
booktitle = {ECSC 5 - Fifth European Conference on Satellite Communications},
address = {Toulouse, France,CDRom},
year = {1999},
month = {November},

}

@conference{BMPP99,
author = {J-C. Bermond and N. Marlin and D. Peleg and S. P\'erennes},
title = {Virtual path layouts with low congestion or low diameter in ATM networks},
booktitle = {Actes des 1�res Rencontres Francophones sur les Aspects Algorithmiques des T�l�communications (AlgoTel'99)},
address = {Roscoff, France},
pages = {77-82},
year = {1999},
month = {May},

}

@INPROCEEDINGS{CoFe99,
author = {R. Corr�a and A. Ferreira},
title = {A polynomial-time branching procedure for the multiprocessor scheduling problem},
booktitle = {Proceedings of Europar'99},
publisher = {Springer Verlag},
address = {Toulouse (F)},
PAGES = {272-279},
VOLUME = {1685},
series = {Lecture Notes in Computer Science},
year = {1999},
month = {aug},

}

@INPROCEEDINGS{CFM99,
author = {D. Coudert and A. Ferreira and X. Mu�oz},
title = {{OTIS-Based Multi-Hop Multi-OPS Lightwave Networks}},
booktitle = {Proceedings of the Workshop on Optics and Computer Science 1999},
year = {1999},
editor = {J. Rolim et al.},
volume = {1586},
series = {Lecture Notes in Computer Science},
pages = {897-910},
month = {April},
publisher = {Springer Verlag},
abstract = {Many results exist in the literature describing technological and theoretical advances in optical network topologies and design. However, an essential effort has yet to be done in linking those results together. In this paper, we propose a step in this direction, by giving optical layouts for several graph-theoretical topologies studied in the literature, using the Optical Transpose Interconnection System (OTIS) architecture. These topologies include the family of Partitioned Optical Passive Star (POPS) and stack-Kautz networks as well as a generalization of the Kautz and de Bruijn digraphs.},
journal = {IEEE International Parallel Processing Symposium -- IPPS'99},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFM-WOCS99.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFM-WOCS99.ps.gz} 
}

@INPROCEEDINGS{CFP99,
author = {D. Coudert and A. Ferreira and S. Perennes},
title = {{Theoretical Aspects of the Optical Transpose Interconnecting System Architecture}},
booktitle = {{Premi\`ere Rencontres Francophones sur les aspects Algorithmiques des T�l�communications -- AlgoTel}},
year = {1999},
pages = {101-106},
address = {Roscoff, France},
month = {5-7 Mai},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFP-AlgoTel99.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFP-AlgoTel99.ps.gz} 
}

@INPROCEEDINGS{FGPR99,
author = {A. Ferreira and J. Galtier and J.-N. Petit and H. Rivano},
title = {Algorithmes de reroutage dans une constellation de satellites},
booktitle = {Actes des 1�res Rencontres Francophones sur les Aspects Algorithmiques des T�l�communications (AlgoTel'99)},
year = {1999},
pages = {107-112},
address = {Roscoff, France},
month = {May},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/fgpr99.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/fgpr99.ps.gz},
url = {http://ares.insa-lyon.fr/tarot/jsp/site/Portal.jsp?page_id=7} 
}

@INPROCEEDINGS{FeSc99,
author = {A. Ferreira and N. Schabanel},
title = {A randomized {BSP/CGM} algorithm for the maximal independent set problem},
booktitle = {Proceedings of ISPAN'99},
address = {Fremantle, Australia},
pages = {284-289},
year = {1999},
month = {jun},
publisher = {IEEE},

}

@conference{GaPe99b,
author = {J. Galtier and S. P\'erennes},
title = {Parallel flips on planar triangulations},
booktitle = {15th European Workshop on Computational Geometry, Antibes Juan-Les-Pins},
pages = {80-86},
year = {1999},

}

@InProceedings{Gal99,
author = {J. Galtier},
title = {Geographical reservation for guaranteed handover and routing in low earth orbit constellations},
booktitle = {I Workshop de Comunicacao Sem Fio},
editor = {Geraldo Robson Mateus},
address = {Belo Horizonte, Minas Gerais, Brazil},
pages = {77-86},
year = {1999},
month = {July},

}

@INPROCEEDINGS{JFMS99c,
author = {T. Jim\'enez and N. Furmento and P. Mussi and G. Siegel},
title = {A Traffic Simulator for Advanced Transport Telematics (ATT) Strategies},
booktitle = {AFRICON'99},
address = {Cape Town, South Africa},
year = {1999},
month = {September},
pages={33--36},
volume={1},

}

@INPROCEEDINGS{JFMS99,
author = {T. Jim�nez and N. Furmento and P. Mussi and G. Siegel},
title = {Un framework \`a objets pour la simulation de trafic routier},
booktitle = {Mod\'elisation et Simulation des Flux Physiques et Informationnels (MOSIM)},
year = {1999},
address = {Annecy, France},
month = {Octobre},
PAGES = "257--262",
EDITOR="Georges Habchi et Alain Haurat",
PUBLISHER=" SCS International",

}

@InProceedings{LLL99,
author = {Lang, F. and Lescanne, P. and Liquori, L.},
title = {{A Framework for Defining Object-Calculi (extended abstract)}},
booktitle = {FM, World Congress on Formal Methods in the Development of Computing Systems},
year = {1999},
volume = 1709,
pages = {963--982},
series = lncs,
publisher = {Springer Verlag},
POSTSCRIPT= {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/fm-99.ps.gz} 
}

@inproceedings{MR1715600,
AUTHOR = {Molloy, M. and Reed, B.},
TITLE = {Further algorithmic aspects of the local lemma},
BOOKTITLE = {STOC '98 (Dallas, TX)},
PAGES = {524--529},
PUBLISHER = {ACM},
ADDRESS = {New York},
YEAR = {1999},

}

@inproceedings{MR1852482,
AUTHOR = {Perkovi{\'c}, L. and Reed, B.},
TITLE = {An improved algorithm for finding tree decompositions of small width},
BOOKTITLE = {Graph-theoretic concepts in computer science (Ascona, 1999)},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {1665},
PAGES = {148--154},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {1999},

}

@inproceedings{MR1966425,
AUTHOR = {Reed, B.},
TITLE = {Introducing directed tree width},
BOOKTITLE = {6th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1999)},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {3},
PAGES = {8 pp. (electronic)},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {1999},

}

@TechReport{BeDa99b,
Author = {Beauquier, B. and Darrot, E.},
Title = {On arbitrary size {W}aksman networks and their vulnerability},
Type = {Rapport de recherche},
Number = {3788 --- Th\`eme~1},
Institution = {INRIA Sophia Antipolis},
Address = {France},
Month = oct,
Year = {1999},

}

@TECHREPORT{CFP99b,
author = {D. Coudert and A. Ferreira and S. Perennes},
title = {{Digraph Isomorphisms and Free Space Optical Networks}},
institution = {INRIA Research Report 3817},
year = {1999},
optnote = {http://www.inria.fr/rapports/sophia/RR-3817.html},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/RR-3817.ps.gz} 
}

@techreport{Dal99b,
AUTHOR = {O. Dalle},
TITLE = {Etat de l'art sur les couches {MAC}},
TYPE = {Contribution du {C.N.E.S.} au rapport d'avancement de la Convention 2 du projet {R.N.R.T.} <<Constellations>>},
YEAR = {1999},
MONTH = {Juin} 
}

@TechReport{Dar99b,
Author = {Darrot, E.},
Title = {Evitement des boucles dans les anneaux de redondance},
Type = {Rapport de recherche},
Number = {???? --- Th\`eme~1},
Institution = {INRIA Sophia Antipolis},
Address = {France},
Month = nov,
Year = {1999} 
}

@TechReport{Dar99,
Author = {Darrot, E.},
Title = {Convention {A11518} {INRIA}--{A}lcatel {S}pace {I}ndustries},
Type = {Rapport de contrat},
Number = {???? --- Th\`eme~1},
Institution = {INRIA Sophia Antipolis},
Address = {France},
Month = nov,
Year = {1999} 
}

@TechReport{Dar99a,
Author = {Darrot, E.},
Title = {R\'eseaux r\'earrangeables \`a commutateurs \`a lamelles},
Type = {Rapport de recherche},
Number = {???? --- Th\`eme~1},
Institution = {INRIA Sophia Antipolis},
Address = {France},
Month = nov,
Year = {1999} 
}

@Techreport{FlPe99,
author = {M. Flammini and S. P\'erennes},
title = {{Lower Bounds on systolic gossip.}},
institution = {INRIA},
number = {3612},
note = {soumis � Journal on Information theory},
year = {1999},

}

@Techreport{FlPe99b,
author = {M. Flammini and S. P\'erennes},
title = {Tight Upper bound for broadcasting and gossiping},
institution = {INRIA},
note = {soumis � Journal on Information theory},
year = {1999},

}

@Techreport{FrPe99,
author = {F. Fraigniaud and A. Pelc and S. P\'erennes},
title = {Fast tree naming},
institution = {INRIA},
number = {3609},
year = {1999},

}

@TechReport{Gal99b,
author = {J. Galtier},
title = {Using Parallel Computing to Reduce CPU Power},
institution = {INRIA},
year = {1999},
OPTkey = {},
type = {Research Report},
number = {3621},
OPTaddress = {},
month = {February},
OPTannote = {},
url = {http://hal.inria.fr/inria-00073056/fr/},
pdf ={http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/07/30/56/PDF/RR-3621.pdf&docid=73056},

}

@Techreport{GPPV99,
author = {L. Gargano and A. Pelc and S. P\'erennes and U. Vaccaro},
title = {{Optimal broadcasting in unknown networks}},
institution = {INRIA},
number = {3609},
year = {1999},

}

@Misc{Semantics,
author = {L. Liquori},
title = {{On Object Calculi}},
howpublished = {\'Ecole des Mines de Nancy},
year = {1999-2000},
note = {Cours {SI} 142 : {F}ondements de l'algorithmique et de la programmation}
}

@Misc{BugJava,
author = {L. Liquori},
title = {{Le Bug de Java}},
howpublished = {\'Ecole des Mines de Nancy},
year = {1999-2000},
note = {Cours {SI} 153 : {S}\^uret\'e des syst\`emes informatiques}
}

@Misc{Asn1-Gdmo,
author = {L. Liquori},
title = {{The Languages ASN.1 and GDMO}},
howpublished = {\'Ecole des Mines de Nancy},
year = {1999-2000},
note = {Cours {SI} 151 : {R}\'eseaux et t\'el\'ecommunications}
}

@Misc{Archilog,
author = {L. Liquori},
title = {{A Brief Introduction to Corba}},
howpublished = {\'Ecole des Mines de Nancy},
year = {1999-2000},
note = {Cours {SI} 131 : {C}onception d'architectures logicielles},

}

@Misc{C++compilers,
author = {L. Liquori and K. Tombre},
title = {{On C++ Compilers}},
howpublished = {\'Ecole des Mines de Nancy},
year = {1999-2000},
note = {Cours {SI} 131 : {C}onception d'architectures logicielles}
}

@BOOK{FRST98,
EDITOR = {A. Ferreira and J. Rolim and H. Simon and S. Teng},
KEY = {b-edition},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{Solving Irregularly Structured Problems in Parallel -- Irregular'98}},
VOLUME = {1457},
YEAR = {1998},

}

@book {MR1678554,
TITLE = {Probabilistic methods for algorithmic discrete mathematics},
SERIES = {Algorithms and Combinatorics},
VOLUME = {16},
EDITOR = {Habib, M. and McDiarmid, C. and Ramirez-Alfonsin, J. and Reed, B.},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin},
YEAR = {1998},
PAGES = {xviii+323},

}

@BOOK{FeRo98,
EDITOR = {A. Ferreira and J. Rolim},
KEY = {e-editor},
MONTH = apr,
NUMBER = {1/2},
PUBLISHER = {Academic Press},
TITLE = {{Journal of Parallel and Distributed Computing -- Special Issue on Irregular Problems}},
VOLUME = {50},
YEAR = {1998},

}

@BOOK{BeFe98,
ADDRESS = {Boston (USA)},
EDITOR = {P. Berthom\'e and A. Ferreira},
KEY = {b-edition},
PUBLISHER = {Kluwer Academic Publisher},
TITLE = {{Optical Interconnects and Parallel Processing: Trends at the Interface}},
YEAR = {1998},

}

@INCOLLECTION{CFP98,
AUTHOR = {R. Corr\^ea and A. Ferreira and S. Porto},
BOOKTITLE = {Handbook of Combinatorial Optimization},
EDITOR = {D. Du and P. Pardalos},
KEY = {bc-chapter},
PAGES = {407-456},
PUBLISHER = {Kluwer Academic Publisher, Boston (USA)},
TITLE = {{Selected Algorithmic Techniques for Parallel Optimization}},
VOLUME = {3},
YEAR = {1998},

}

@INCOLLECTION{Fer98,
AUTHOR = {A. Ferreira},
ADDRESS = {Boston (USA)},
BOOKTITLE = {Optical Interconnects and Parallel Processing: Trends at the Interface},
EDITOR = {P. Berthom\'e and A. Ferreira},
KEY = {bc-chapter},
PAGES = {209-233},
PUBLISHER = {Kluwer Academic Publisher},
TITLE = {{{Towards effective models for OPS--based lightwave networks}}},
YEAR = {1998},

}

@INCOLLECTION{FeGu98,
AUTHOR = {A. Ferreira and I. Gu\'erin-Lassous},
ADDRESS = {Paris (F)},
BOOKTITLE = {Parall\'elisme et R\'epartitions},
CHAPTER = {II},
EDITOR = {J.-F. Myoupo},
KEY = {bc-chapter},
PAGES = {23-47},
PUBLISHER = {Hermes},
TITLE = {{Algorithmique discr\`ete parall\`ele : le cha\^inon manquant}},
YEAR = {1998},

}

@incollection {MR1678562,
AUTHOR = {Frieze, A. M. and Reed, B.},
TITLE = {Probabilistic analysis of algorithms},
BOOKTITLE = {Probabilistic methods for algorithmic discrete mathematics},
SERIES = {Algorithms Combin.},
VOLUME = {16},
PAGES = {36--92},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {1998},

}

@article{BHP98,
author= { B. Beauquier and P. Hell and S. P\'erennes },
title= { Optimal Wavelength-routed Multicasting },
journal= { DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science },
year= { 1998 },
volume= { 84 },
number = {1-3},
month = may,
url= { citeseer.nj.nec.com/312543.html },

}

@article{BDDP98a,
author= { J-C. Bermond and E. Darrot and O. Delmas and S. P\'erennes },
title= { Hamilton cycle decomposition of the butterfly networks },
journal= { Parallel Processing Letters },
year= { 1998 },
volume= { 8 },
number= { 3 },
pages= { 371-385 },
pdf= { http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BDDP98a.pdf },

}

@article{BDDP98,
author= { J-C. Bermond and E. Darrot and O. Delmas and S. P\'erennes },
title= { Hamilton circuits in the directed wrapped butterfly network },
year= { 1998 },
journal= { Discrete Applied Mathematics },
volume= { 84 },
number= { 1-3 },
pages= { 21-42 },
pdf= { http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BDDP98b.pdf },

}

@article{BGP98,
author= { J-C. Bermond and L. Gargano and S. P\'erennes },
title= { Optimal sequential gossiping by short messages },
year= { 1998 },
journal= { Discrete Applied Mathematics },
volume= { 86 },
number = {2-3},
pages= { 145-155 },
pdf= { http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BGP98.pdf },

}

@Article{BGRV98,
Author= {J-C. Bermond and L. Gargano and A.A. Rescigno and U. Vaccaro},
Title= {Fast gossiping by short messages },
Journal={SIAM Journal on Computing},
Pages={917-941},
Volume={27},
Number= {4},
Year={1998},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BGRV98.pdf},

}

@ARTICLE{BFM98,
AUTHOR = {H. Bourdin and A. Ferreira and K. Marcus},
JOURNAL = {Computer Networks and ISDN Systems},
KEY = {j-journal},
MONTH = may,
NUMBER = {30},
PAGES = {805-819},
TITLE = {{A performance comparison between graph and hypergraph topologies for passive star {WDM} lightwave networks}},
VOLUME = {8},
YEAR = {1998},

}

@article {MR1664335,
AUTHOR = {Molloy, M. and Reed, B.},
TITLE = {The size of the giant component of a random graph with a given degree sequence},
JOURNAL = {Combin. Probab. Comput.},
VOLUME = {7},
YEAR = {1998},
NUMBER = {3},
PAGES = {295--305},

}

@article {MR1656544,
AUTHOR = {Molloy, M. and Reed, B.},
TITLE = {A bound on the total chromatic number},
JOURNAL = {Combinatorica},
VOLUME = {18},
YEAR = {1998},
NUMBER = {2},
PAGES = {241--280},

}

@article{Per98,
author = {S. Perennes},
journal = { Discrete Applied Mathematics},
volume = {83},
title = {{Broadcasting and gossiping on de Bruijn, shuffle exchange and similar networks.}},
pages = {247-262},
year = 1998,
key = {0106},

}

@article {MR1610746,
AUTHOR = {Reed, B.},
TITLE = {{$\omega,\ \Delta$}, and {$\chi$}},
JOURNAL = {J. Graph Theory},
VOLUME = {27},
YEAR = {1998},
NUMBER = {4},
PAGES = {177--212},

}

@article {MR1654153,
AUTHOR = {Reed, B. and Seymour, P.},
TITLE = {Fractional colouring and {H}adwiger's conjecture},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {74},
YEAR = {1998},
NUMBER = {2},
PAGES = {147--152},

}

@InProceedings{BMPP98b,
Author= {J-C. Bermond and N. Marlin and D. Peleg and S. P\'erennes },
Title= {Virtual path layouts in simple ATM networks},
Year={1998},
BookTitle={Proc. Conference IFIP ATM '98,Ilkley,U.K.,Jul. 1998},

}

@InProceedings{BMPP98a,
Author= {J-C. Bermond and N. Marlin and D. Peleg and S. P\'erennes },
Title= {Directed virtual path layouts in {ATM} networks},
Year={1998},
BookTitle={Proc. Conference DISC98, Andros, Greece,Sep. 1998 Lecture Notes in Computer Science, 1499},
Pages="75-i88. (Full version appeared in TCS)",
Publisher={Springer Verlag},

}

@inproceedings{MR1726341,
AUTHOR = {C{\u{a}}linescu, Gruia and Fernandes, Cristina G. and Reed, B.},
TITLE = {Multicuts in unweighted graphs with bounded degree and bounded tree-width},
BOOKTITLE = {Integer programming and combinatorial optimization (Houston, TX, 1998)},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {1412},
PAGES = {137--152},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {1998},

}

@INPROCEEDINGS{CFM98,
author = {D. Coudert and A. Ferreira and X. Mu�oz},
title = {{Multiprocessor Architectures Using Multi-hops Multi-OPS Lightwave Networks and Distributed Control}},
booktitle = {IEEE International Parallel Processing Symposium},
year = {1998},
pages = {151-155},
publisher = {IEEE Press},
abstract = { In this paper we study the design of regular multicast networks implemented with Optical Passive Star (OPS) couplers. We focus on an architecture based on both Kautz graphs and stack-graphs, and show that it is very cost-effective with respect to its resources requirements, namely the number of OPS couplers, power budget, scalability and number of transceivers, and presents a large ratio number-of-nodes/diameter. The important issue of medium access control is also addressed and control protocols for accessing the optical couplers are given and analyzed. Finally, we show through simulation that these control protocols efficiently implement shortest path routing on these networks.},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFM-IPPS98.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFM-IPPS98.ps.gz} 
}

@inproceedings{Dal98b,
author = {Dalle, O.},
title = {{MPCFS}~: un exemple d'int{\'e}gration transparente de m\'ecanismes de communication multipoints dans les syst{\`e}mes {UNIX}},
booktitle = {10$^e$ Rencontres Francophones du Parall{\'e}lisme ({RENPAR}'10)},
editor = {M{\'e}ry, Dominique and Perrin, Guy-Ren{\'e}},
month = {Juin},
year = {1998},
address = {Strasbourg} 
}

@inproceedings{Dal98a,
author = {Dalle, O.},
title = {{MPCFS}~: un syst\`eme de fichiers virtuel pour communications multipoints fiables entre syst\`emes {UNIX}},
booktitle = {Deuxi\`emes {J}ourn\'ees {D}octorales {I}nformatique et {R}\'eseaux ({JDIR}'98)},
month = {Avril},
year = 1998,
address = {Paris} 
}

@InProceedings{DHL98,
author = {P. {Di~G}ianantonio and F. Honsell and L. Liquori},
title = {A {L}ambda {C}alculus of {O}bjects with {S}elf-inflicted {E}xtension},
booktitle = {Proc. of ACM-SIGPLAN OOPSLA, International Symposium on Object Oriented, Programming, System, Languages and Applications},
publisher = {The ACM Press},
pages = {166--178},
year = "1998",
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/oopsla-98.ps.gz},

}

@INPROCEEDINGS{DFR98,
AUTHOR = {M. Diallo and A. Ferreira and A. Rau-Chaplin},
ADDRESS = {Paris, France},
BOOKTITLE = {Proceedings of the {15th Symposium on Theoretical Aspects of Computer Science -- STACS'98}},
KEY = {p-congint},
MONTH = feb,
PAGES = {399--409},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{Communication-efficient deterministic parallel algorithms for planar point location and 2d {Voronoi} diagram}},
VOLUME = {1373},
YEAR = {1998},

}

@inproceedings {MR1676561,
AUTHOR = {Everett, Hazel and Klein, Sulamita and Reed, B.},
TITLE = {An optimal algorithm for finding clique-cross partitions},
BOOKTITLE = {Proceedings of the Twenty-ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1998)},
JOURNAL = {Congr. Numer.},
VOLUME = {135},
YEAR = {1998},
PAGES = {171--177},

}

@INPROCEEDINGS{FGMR98,
AUTHOR = {A. Ferreira and I. Gu\'erin-Lassous and K. Marcus and A. Rau-Chaplin},
ADDRESS = {Southampton, UK},
BOOKTITLE = {Proceedings of Europar'98 (Distinguished Paper)},
EDITOR = {D. Pritchard and J. Reeves},
KEY = {p-congint},
MONTH = sep,
PAGES = {875-886},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{Parallel Computation on Interval Graphs using PC clusters: Algorithms and Experiments}},
VOLUME = {1470},
YEAR = {1998},

}

@InProceedings{Liq98b,
author = "Liquori, L.",
title = "Bounded {P}olymorphism for {E}xtensible {O}bjects",
booktitle = "Types, International Workshop on Types for Proof and Programs",
editor = "",
pages = "149--163",
volume = "1657",
series = lncs,
publisher = {Springer Verlag},
month = "",
year = "1998",
POSTSCRIPT= {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/types-98.ps.gz},

}

@InProceedings{Liq98a,
author = "Liquori, L.",
title = "On {O}bject {E}xtension",
booktitle = "ECOOP, European Conference on Object Oriented Programming",
editor = "",
pages = "498--552",
volume = "1445",
series = lncs,
publisher = {Springer Verlag},
month = "",
year = "1998",
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/ecoop-98.ps.gz},

}

@inproceedings{MR1635533,
AUTHOR = {Molloy, M. and Reed, B.},
TITLE = {Colouring graphs where chromatic number is almost their maximum degree},
BOOKTITLE = {LATIN'98: theoretical informatics (Campinas, 1998)},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {1380},
PAGES = {216--225},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {1998},

}

@TechReport{BG+98b,
author = {D. Bacchiega and D. Gotta and L. Liquori and M. Porta and M. Ramella Votta},
title = {{Ipotesi Evolutive del Sistema MOMIX per la Specifica e Qualificazione di Sistemi TMN}},
institution = {CSELT, Centro Studi e Laboratori Telecomunicazioni, Telecom Italia Research Center},
year = {1998},
type = {Technical Report},
number = {DTR 98.0089},
note = {Not available. In Italian} 
}

@TECHREPORT{JMSV98,
AUTHOR = {T. Jim\'enez and P. Mussi and G. Siegel and L. Villefranche},
INSTITUTION = {Hipertrans Consortium},
TITLE = {Parallel Architecture Issues},
YEAR = {1998} 
}

@TECHREPORT{JMSV98,
AUTHOR = {T. Jim\'enez and P. Mussi and G. Siegel and L. Villefranche},
INSTITUTION = {Hipertrans Consortium},
TITLE = {Car Following Algorithms},
YEAR = {1998} 
}

@MastersThesis{Jar99,
author = {A. Jarry},
title = {Th\'eorie des graphes : chemins disjoints},
school = {ENS Lyon},
year = {1998},
type = {Rapport de stage de magist\`ere d'informatique},
key={},

}

@MASTERSTHESIS{Riv98,
author = {H. Rivano},
title = {Communication par constellations de satellites : reroutage pour les t�l�communications mobiles},
school = {ENS Lyon},
year = {1998},
type = {Rapport de stage de premi�re ann�e de Magist�re d'Informatique et de Mod�lisation},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/riv98.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/riv98.ps.gz},
url = {http://ensl.free.fr/rapports/} 
}

@Misc{DaVa98,
Author = {Darrot, E. and Vaillant, B.},
Title = {Matrice de commutateurs \`a deux positions chacun},
HowPublished = {Demande de Brevet 98 15 397 d\'epos\'ee en France le 7 d\'ecembre 1998 au nom d'Alcatel},
year={1998},

}

@Misc{Smalltalk,
author = {L. Liquori},
title = {{An Introduction to SmallTalk}},
howpublished = {\'Ecole Normale Sup\'erieure de Lyon},
year = {1998-1999},
note = {Cours {POOGL} : {P}rogrammation \`a {O}bjets et {G}\'enie {L}ogiciel}
}

@BOOK{BFLR97,
EDITOR = {G. Bilardi and A. Ferreira and R. L\"uling and J. Rolim},
KEY = {b-edition},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{Parallel Algorithms for Solving Irregularly Structured Problems -- Irregular'97}},
VOLUME = {1253},
YEAR = {1997},

}

@INCOLLECTION{FeMo97,
AUTHOR = {A. Ferreira and M. Morvan},
BOOKTITLE = {Parallel Computing in Optimization},
EDITOR = {A. Migdalas and P. Pardalos and S. Storoy},
KEY = {bc-chapter},
PAGES = {1--26},
PUBLISHER = {Kluwer Academic Publisher, Boston (USA)},
TITLE = {{Models for Parallel Algorithm Design: An Introduction}},
YEAR = {1997},

}

@incollection {MR1477746,
AUTHOR = {Reed, B. A.},
TITLE = {Tree width and tangles: a new connectivity measure and some applications},
BOOKTITLE = {Surveys in combinatorics, 1997 (London)},
SERIES = {London Math. Soc. Lecture Note Ser.},
VOLUME = {241},
PAGES = {87--162},
PUBLISHER = {Cambridge Univ. Press},
ADDRESS = {Cambridge},
YEAR = {1997},

}

@Article{BDE97,
author = {J-C. Bermond and R. Dawes and F.O. Ergincan},
title = {{De Bruijn} and {Kautz} bus networks},
Journal = {Networks},
year = {1997},
Volume="30",
Pages ={205-218},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BDE97.pdf},

}

@Article{BHLP97,
Author= {J-C. Bermond and H.A. Harutyunyan and A.L. Liestman and S. P\'erennes},
Title= {A note on the dimensionalityof modified {Kn\"odel} Graphs},
Journal= {International Journal of Foundations of Computer Science},
Year= {1997},
Volume= {8},
Number= {2},
Pages= {109-116},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BHLP97.pdf},

}

@Article{BLS97,
Author="J-C. Bermond and Z. Liu and M. Syska",
Title="Mean eccentricities of {de Bruijn} networks",
Journal ={Networks},
Year="1997",
Volume="30",
Pages ={187-203},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BLS97.pdf},

}

@ARTICLE{BeFe97,
AUTHOR = {P. Berthom\'e and A. Ferreira},
JOURNAL = {International Journal of Foundations of Computer Science},
KEY = {j-journal},
NOTE = {Special Issue on Interconnection Networks},
NUMBER = {2},
PAGES = {143--162},
TITLE = {{Communication Issues in Parallel Systems with Optical Interconnections}},
VOLUME = {8},
YEAR = {1997},

}

@article{CoGo97,
author={M. Cosnard and E. Goles},
title={Discrete state neural networks and energies},
journal={Neural Networks},
volume={10},
number={2},
year={1997},
pages={327-334},

}

@article {MR1429790,
AUTHOR = {Everett, H. and Klein, S. and Reed, B.},
TITLE = {An algorithm for finding homogeneous pairs},
JOURNAL = {Discrete Appl. Math.},
VOLUME = {72},
YEAR = {1997},
NUMBER = {3},
PAGES = {209--218},

}

@article{GJMS97,
author={B. Gaujal and A. Jean-Marie and P. Mussi and G. Siegel},
title={High speed simulation of discrete event systems by mixing process oriented and equational approaches},
year={1997},
volume={23},
number={1-2},
month={April},
journal={Parallel Computing},
pages={219--233},

}

@article {MR1645682,
AUTHOR = {Hind, H. and Molloy, M. and Reed, B.},
TITLE = {Colouring a graph frugally},
JOURNAL = {Combinatorica},
VOLUME = {17},
YEAR = {1997},
NUMBER = {4},
PAGES = {469--482},

}

@article {MR1451490,
AUTHOR = {Linhares-Sales, C. and Maffray, F. and Reed, B.},
TITLE = {On planar perfectly contractile graphs},
JOURNAL = {Graphs Combin.},
VOLUME = {13},
YEAR = {1997},
NUMBER = {2},
PAGES = {167--187},

}

@article {MR1438613,
AUTHOR = {Molloy, M. and Reed, B.},
TITLE = {A bound on the strong chromatic index of a graph},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {69},
YEAR = {1997},
NUMBER = {2},
PAGES = {103--109},

}

@article{Per97,
author = {S. Perennes},
journal = { Discrete Applied Mathematics},
title = {{A Proof of Jean de Rumeur's conjecture}},
volume = 74,
pages = {295-299},
year = 1997,
key = {0105},

}

@article{MR1439301,
AUTHOR = {Perkovic, L. and Reed, B.},
TITLE = {Edge coloring regular graphs of high degree},
NOTE = {Graphs and combinatorics (Marseille, 1995)},
JOURNAL = {Discrete Math.},
VOLUME = {165/166},
YEAR = {1997},
PAGES = {567--578},

}

@Article{BLRU97,
author = "van Bakel, S. and Liquori, L. and {Ronchi della Rocca}, S. and Urzyczyn, P.",
title = "Comparing {C}ubes of {T}yped and {T}ype {A}ssignment {S}ystem",
journal = apal,
year = "1997",
publisher = {North-Holland},
volume = "86",
number = "3",
pages = "267--303",
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/apal-97.ps.gz},

}

@InProceedings{BBG+97,
Author= {B. Beauquier and J-C. Bermond and L. Gargano and P. Hell and S. Perennes and U. Vaccaro},
Title= {Graph problems arising from Wavelength--Routing in All--Optical Networks},
Year={1997},
BookTitle={Proc. Conference WOCS97, Geneva,April 1997},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BBG+97.pdf},

}

@InProceedings{BBPP96,
Author={J-C. Bermond and J. Bond and D. Peleg and S. P\'erennes},
Title= {Tight bounds on the size of 2-monopolies},
BookTitle={Proc. Conference SIROCCO96, Siena, June 96, International Informatics Series 6},
Year={1997},
Pages={170--179},
Publisher={Carleton U. Press},

}

@inproceedings{BDFP97,
Author= {J-C. Bermond and M. Di Ianni and M. Flammini and S. P\'erennes},
Title= {Systolic orientations for deadlock prevention in usual networks},
booktitle={Proceedings 23th Int Workshop on Graph Theoretic Concepts in Computer Science WG97, Lecture Notes in Computer Science},
Publisher={Springer verlag},
volume={1335},
Year={1997},
pages={52--64},

}

@INPROCEEDINGS{BCF97,
AUTHOR = {P. Berthom\'e and J. Cohen and A. Ferreira},
BOOKTITLE = {Proceedings of 4th International Colloquium on Structural Information and Communication Complexity - Sirocco'97},
EDITOR = {D. Krizanc and P. Widmayer},
KEY = {p-congint},
MONTH = jul,
PAGES = {40-52},
PUBLISHER = {Carleton Scientific},
SERIES = {Proceedings in Informatics},
TITLE = {{Embedding tori in {Partitioned Optical Passive Star} networks}},
VOLUME = {1},
YEAR = {1997},

}

@InProceedings{BBDL97,
author = "Bono, V. and Bugliesi, M. and {Dezani-Ciancaglini}, M. and Liquori, L.",
title = "Subtyping {C}onstraint for {I}ncomplete {O}bjects",
booktitle = "TAPSOFT/CAAP, International Conference of Theory and Practice of Software Development",
series = lncs,
publisher = {Springer Verlag},
year = "1997",
pages = "465--477",
volume = "1214",
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/tapsoftcaap-97.ps.gz},

}

@INPROCEEDINGS{CDF+97,
AUTHOR = {E. Caceres and F. Dehne and A. Ferreira and P. Flocchini and I. Rieping and A. Roncato and N. Santoro and S. Song},
BOOKTITLE = {Proceedings of ICALP'97},
EDITOR = {P. Degano and R. Gorrieri and A. Marchetti-Spaccamela},
KEY = {p-congint},
PAGES = {390--400},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP}},
VOLUME = {1256},
YEAR = {1997},

}

@inproceedings{CoJe97,
author={M. Cosnard and E. Jeannot},
title={Automatic Coarse-Grained Parallelization Techniques},
booktitle={NATO workshop on Advances in High Performance Computing},
publisher={Kluwer Academic Publishers},
year={1997},

}

@INPROCEEDINGS{FFG97,
AUTHOR = {A. Ferreira and E. Fleury and M. Grammatikakis},
ADDRESS = {Montreal (Ca)},
BOOKTITLE = {Proceedings of the 4th IEEE International Conference on Massively Parallel Processing using Optical Interconnections -- MPPOI'97},
KEY = {p-congint},
PAGES = {39--44},
PUBLISHER = {IEEE CS Press},
TITLE = {{Multicasting Control and Communications on Multihop Stack-Ring OPS Networks}},
YEAR = {1997},

}

@INPROCEEDINGS{FKRU97,
AUTHOR = {A. Ferreira and C. Kenyon and A. Rau-Chaplin and S. Ub{\'e}da},
BOOKTITLE = {Proceedings of the 11th IEEE International Parallel Processing Symposium},
JOURNAL = {IEEE International Parallel Processing Symposium -- IPPS'97},
KEY = {p-congint},
PAGES = {616--620},
PUBLISHER = {IEEE CS Press},
TITLE = {{d-Dimensional Range Search on Multicomputers}},
YEAR = {1997},

}

@INPROCEEDINGS{GHP97,
author = {L. Gargano and P. Hell and S. P\'erennes},
title = {{Colouring paths in directed symmetric trees with applications to WDM routing}},
booktitle = {ICALP'97},
year = {1997},
volume = {1256},
series = {Lecture Notes in Computer Science},
pages = {505--515},
address = {Bologna, Italy},
month = {July},
publisher = {Springer-Verlag} 
}

@InProceedings{Liq97,
author = "Liquori, L.",
title = "An {E}xtended {T}heory of {P}rimitive {O}bjects: {F}irst {O}rder {S}ystem",
booktitle = "ECOOP, European Conference on Object Oriented Programming",
editor = "",
pages = "146--169",
volume = "1241",
series = lncs,
publisher = {Springer Verlag},
month = "",
year = "1997",
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/ecoop-97.ps.gz},

}

@TechReport{BG+98a,
author = {D. Bacchiega and D. Gotta and L. Liquori and M. Porta and R. Rossi},
title = {{MOMIX-emSDH2. Simulatore di Agent di Element Manager SDH2.0. Versione 2.2.3. Manuale Utente e Guida di Riferimento}},
institution = {CSELT, Centro Studi e Laboratori Telecomunicazioni, Telecom Italia Research Center},
year = {1997},
type = {Technical Report},
number = {DTR 97.0413},
note = {Not available. In Italian} 
}

@techreport{Dal97a,
AUTHOR = {Dalle, O.},
TITLE = {{MPCFS}~: Un exemple d'int{\'e}gration transparente des m{\'e}canismes de communication multi-points au sein des Syst{\`e}mes d'Exploitation {UNIX}},
INSTITUTION = {INRIA~/~CNRS~/~UNSA},
YEAR = 1997,
NUMBER = {I3S/RR97-10} 
}

@TECHREPORT{JMVG97a,
AUTHOR = {T. Jim\'enez and P. Mussi and G. Siegel and L. Villefranche},
MONTH = {November},
INSTITUTION = {hipertrans Project},
TITLE = {PACSIM Specification},
YEAR = {1997},

}

@TECHREPORT{JMG97b,
AUTHOR = {T. Jim\'enez and P. Mussi and G. Siegel},
MONTH = {July},
INSTITUTION = {hipertrans Project},
TITLE = {About Traces and Statistics Collection in Hipertrans},
YEAR = {1997},

}

@TECHREPORT{JMG97a,
AUTHOR = {T. Jim\'enez and P. Mussi and G. Siegel},
MONTH = {July},
INSTITUTION = {hipertrans Project},
TITLE = {An Object Oriented Framework for Traffic Simulation},
YEAR = {1997},

}

@MASTERSTHESIS{Cou97,
author = {D. Coudert},
title = {Etudes sur la faisabilit\'e des r\'eseaux \`a interconnexions optiques: Des mod\`eles aux conceptions},
school = {LIP -- ENS Lyon, with A. Ferreira},
year = {1997},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/Cou-MIM3.ps.gz} 
}

@misc{RapFinalEuropa97,
author = { D. Caromel and A. McEwan and J. Nolte and J. Poole and Y. Roudier and D. Sagnol and J.-M. Challier and P. Dzwig and R. Kaufman and H. Liddell and P. Mussi and D. Parkinson and M. Rigg and G. Roberts and R. Winder},
title = {EUROPA Parallel C++},
note = {The EUROPA Working Group on Parallel C++, rapport final, HPCN Esprit Contract No 9502},
year = {1997},
month = {September},

}

@BOOK{FeRo96,
EDITOR = {A. Ferreira and J. Rolim},
KEY = {e-editor},
PUBLISHER = {North-Holland},
TITLE = {{Theoretical Computer Science -- Special Issue on Irregularly Structured Problems}},
YEAR = {1996},

}

@BOOK{FePa96,
EDITOR = {A. Ferreira and P. Pardalos},
KEY = {b-edition},
PUBLISHER = {Springer-Verlag},
SERIES = {LNCS State-of-the-Art Surveys},
TITLE = {{Solving Combinatorial Optimization Problems in Parallel: Methods and Techniques}},
VOLUME = {1054},
YEAR = {1996},

}

@BOOK{FRST96,
EDITOR = {A. Ferreira and J. Rolim and Y. Saad and T. Yang},
KEY = {b-edition},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{Parallel Algorithms for Solving Irregularly Structured Problems -- Irregular'96}},
VOLUME = {1117},
YEAR = {1996},

}

@PhdThesis{Liq96b,
author = "Liquori, L.",
title = "Type {A}ssigment {S}ystems for {L}ambda {C}alculi and for the {L}ambda {C}alculus of {O}bjects",
school = "University of Turin",
type = "Ph.D. Thesis, 193 pp.",
year = "1996",
month = "October",
POSTSCRIPT= {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/phd.ps.gz},

}

@INCOLLECTION{CoFe96,
AUTHOR = {R. Corr\^ea and A. Ferreira},
BOOKTITLE = {Solving Combinatorial Optimization Problems in Parallel},
EDITOR = {A. Ferreira and P. Pardalos},
KEY = {bc-chapter},
PAGES = {171--200},
PUBLISHER = {Springer-Verlag},
SERIES = {LNCS State-of-the-Art Surveys},
TITLE = {{Parallel Best-First Branch-and-Bound in Discrete Optimization: A Framework}},
VOLUME = {1054},
YEAR = {1996},

}

@INCOLLECTION{Fer96,
AUTHOR = {A. Ferreira},
ADDRESS = {New York (USA)},
BOOKTITLE = {Handbook of Parallel and Distributed Computing},
CHAPTER = {19},
EDITOR = {A. Zomaya},
KEY = {bc-chapter},
PAGES = {568--589},
PUBLISHER = {McGraw-Hill},
TITLE = {{Parallel and Communication Algorithms for Hypercube Multiprocessors}},
YEAR = {1996},

}

@INCOLLECTION{FePa96b,
AUTHOR = {A. Ferreira and P. Pardalos},
BOOKTITLE = {Solving Combinatorial Optimization Problems in Parallel},
EDITOR = {A. Ferreira and P. Pardalos},
KEY = {bc-chapter},
PAGES = {1--6},
PUBLISHER = {Springer-Verlag},
SERIES = {LNCS State-of-the-Art Surveys},
TITLE = {{{SCOOP -- Solving} Combinatorial Optimization Problems in Parallel}},
VOLUME = {1054},
YEAR = {1996},

}

@ARTICLE{BBCFMRS96a,
AUTHOR = {F. Baude and F. Belloncle and D. Caromel and N. Furmento and P. Mussi and Y. Roudier and G. Siegel},
JOURNAL = {{Information Sciences}},
PUBLISHER = {Elsevier},
TITLE = {{Parallel Object-Oriented Programming for Parallel Simulations}},
YEAR = {1996} 
}

@Article{BeEr96,
author = {J-C. Bermond and F.O. Ergincan},
title = {Bus Interconnection Networks},
Journal= { Discrete Applied Mathematics},
year = {1996},
Volume="68",
Pages="1-15",
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BeEr96.pdf},

}

@Article{BPST96,
Author="J-C. Bermond and C. Peyrat and I. Sakho and M. Tchuente",
Title="Parallelization of Gauss elimination algorithm on systolic arrays",
Journal="Journal of Parallel and Distributed Computing",
Year="1996",
Volume="33",
Pages="69--75" 
}

@article{BFP96,
author= { P. Berthom\'e and A. Ferreira and S. P\'erennes },
journal= { IEEE Transactions on Parallel and Distributed Systems },
key= { j-journal },
month= { December },
number= { 12 },
pages= { 1292--1300 },
title= { {Decomposing hierarchical {Cayley} graphs, with applications to information dissemination and algorithm design} },
volume= { 7 },
year= { 1996 },

}

@article{BoCo96,
author={O. Bournez and M. Cosnard},
title={On the computational power of dynamical systems and hybrid systems},
journal={Theoretical Computer Science},
volume={168},
number={2},
year={1996},
pages={417--459},

}

@article {MR1395689,
AUTHOR = {Cooper, C. and Frieze, A. and Molloy, M. and Reed, B.},
TITLE = {Perfect matchings in random {$r$}-regular, {$s$}-uniform hypergraphs},
JOURNAL = {Combin. Probab. Comput.},
VOLUME = {5},
YEAR = {1996},
NUMBER = {1},
PAGES = {1--14},

}

@ARTICLE{FGS96,
AUTHOR = {A. Ferreira and A. Goldman and S. W. Song},
JOURNAL = {Parallel Algorithms and Applications},
KEY = {j-journal},
NOTE = {Special Issue on Algorithms for Enhanced Meshes},
PAGES = {309--331},
TITLE = {{Gossiping in bus interconnection networks}},
VOLUME = {8},
YEAR = {1996},

}

@ARTICLE{FeGr96,
AUTHOR = {A. Ferreira and M. Grammatikakis},
JOURNAL = {Theoretical Computer Science},
KEY = {j-journal},
NUMBER = {1--2},
PAGES = {53--64},
TITLE = {{Randomized routing in generalized hypercubes}},
VOLUME = {158},
YEAR = {1996},

}

@ARTICLE{FeRo96b,
AUTHOR = {A. Ferreira and J.M. Robson},
JOURNAL = {Journal of Parallel and Distributed Computing},
KEY = {j-journal},
MONTH = {November},
NUMBER = {1},
PAGES = {1--13},
TITLE = {{Fast and Scalable Parallel Algorithms for Knapsack and Similar Problems}},
VOLUME = {39},
YEAR = {1996},

}

@article {MR1385380,
AUTHOR = {Markossian, S. E. and Gasparian, G. S. and Reed, B. A.},
TITLE = {{$\beta$}-perfect graphs},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {67},
YEAR = {1996},
NUMBER = {1},
PAGES = {1--11},

}

@article {MR1433641,
AUTHOR = {Reed, B. and Robertson, N. and Seymour, P. and Thomas, R.},
TITLE = {Packing directed circuits},
JOURNAL = {Combinatorica},
VOLUME = {16},
YEAR = {1996},
NUMBER = {4},
PAGES = {535--554},

}

@article {MR1433642,
AUTHOR = {Reed, B. A. and Shepherd, F. B.},
TITLE = {The {G}allai-{Y}ounger conjecture for planar graphs},
JOURNAL = {Combinatorica},
VOLUME = {16},
YEAR = {1996},
NUMBER = {4},
PAGES = {555--566},

}

@article {MR1411088,
AUTHOR = {Reed, B.},
TITLE = {Paths, stars and the number three},
JOURNAL = {Combin. Probab. Comput.},
VOLUME = {5},
YEAR = {1996},
NUMBER = {3},
PAGES = {277--295},

}

@INPROCEEDINGS{BDMS96a,
AUTHOR = {M. Badel and T. de Pretto and P. Mussi and G. Siegel},
ADDRESS = {La Jolla -- USA},
BOOKTITLE = {{Object Oriented Simulation Conference}},
MONTH = {January},
YEAR = {1996},
TITLE = {{S}tat-{T}ool: {A}n {e}xtensible and {D}istributed {O}bject {O}riented {S}tatistic {T}ool for {D}iscrete {E}vent {S}imulation} 
}

@inproceedings{BBB+96,
author = {F. Baude and F. Belloncle and J-C. Bermond and D. Caromel and O. Dalle and E. Darrot and O. Delmas and N. Furmento and B. Gaujal and P. Mussi and S. P\'erennes and Y. Roudier and G. Siegel and M. Syska},
address = {Alpe d'Huez},
booktitle = {{2nd European School of Computer Science, Parallel Programming Environments for High Performance Computing {\it ESPPE'96}}},
month = {April},
pages = {85--88},
title = {{The {\it SLOOP} project: Simulations, Parallel Object-Oriented Languages, Interconnection Networks}},
year = {1996},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BBB+96.pdf},

}

@InProceedings{BGPRV96,
author={J-C. Bermond and L. Gargano and S. P\'erennes and A.A. Rescigno and U. Vaccaro},
Title={Efficient Collective Communications in Optical Networks},
BookTitle= {Proc.23nd ICALP96, Paderborn, Germany Lecture Notes in Computer Science, 1099},
Year={1996},
Pages="574--585",
Publisher={Springer verlag},
POSTSCRIPT={http://www-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/SOURCEPS/BGPRV96.ps},

}

@inproceedings{BKP96,
author={J-C. Bermond and T. Kodate and S. Perennes},
title={Gossiping in Cayley graphs by packets},
booktitle={Proceedings of the Franco-Japanese conference Brest July 95},
year={1996},
Volume={Lecture Notes in Computer Science, 1120},
Pages="301-315",
Publisher={Springer verlag},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BKP96.pdf},

}

@InProceedings{BMM96,
Author= {J-C. Bermond and A. Marchetti and X. Munoz},
Title= {Induced broadcasting algorithms in iterated line digraphs},
BookTitle={Proc. Conference EUROPAR96, Lyon, August 96, Lecture Notes in Computer Science, 1123},
Year={1996},
Pages="313--324",
Publisher={Springer Verlag},

}

@INPROCEEDINGS{BeFe96,
AUTHOR = {P. Berthom\'e and A. Ferreira},
BOOKTITLE = {Proceedings of the 3rd IEEE International Conference on Massively Parallel Processing using Optical Interconnections -- MPPOI'96},
KEY = {p-congint},
MONTH = {October},
PAGES = {130--136},
PUBLISHER = {IEEE CS Press},
TITLE = {{Improved embeddings in {POPS} networks through stack-graph models}},
YEAR = {1996},

}

@InProceedings{BBL96,
author = "Bono, V. and Bugliesi, M. and Liquori, L.",
title = "A {L}ambda {C}alculus of {I}ncomplete {O}bjects",
booktitle = "MFCS, International Symposium of Mathematical Foundation of Computer Science",
pages = "218--229",
volume = "1113",
series = lncs,
publisher = {Springer Verlag},
month = "",
year = "1996",
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/asian-96.ps.gz},

}

@INPROCEEDINGS{BFM96,
AUTHOR = {H. Bourdin and A. Ferreira and K. Marcus},
ADDRESS = {Lyon (F)},
BOOKTITLE = {Proceedings of EuroPar'96},
EDITOR = {L. Boug\'e and P. Fraigniaud and A. Mignotte and Y. Robert},
KEY = {p-congint},
MONTH = {October},
PAGES = {218--221},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{On stack-graph {OPS}-based lightwave networks}},
VOLUME = {1123},
YEAR = {1996},

}

@InProceedings{BDLM96,
author = {M. Bugliesi and G. Delzanno and L. Liquori and M. Martelli},
title = {A {L}inear {L}ogic {C}alculus of {O}bjects},
booktitle = {JICSLP, Joint International Conference and Symposium on Logic Programming},
pages = {67--81},
year = {1996},
editor = {The MIT Press},
POSTSCRIPT= {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/jicslp-96.ps.gz},

}

@InProceedings{HPCN-caro,
author = {D. Caromel and P. Dzwig and R. Kauffman and H. Liddell and A. McEwan and P. Mussi and Johnathan Poole and M. Rigg and R. Winder},
title = {EC++ -- EUROPA Parallel C++ : A Draft Definition},
booktitle = {Proceedings of High-Performance Computing and Networking (HPCN'96)},
year = {1996},
publisher= {Springer, Lectures Notes in Computer Science (LNCS)},
month = {April},
volume = {1067},
ISBN ={3-540-61142-8},
pages = {848--857} 
}

@INPROCEEDINGS{CFR96,
AUTHOR = {R. Corr\^ea and A. Ferreira and P. Rebreyend},
ADDRESS = {New Orleans (USA)},
BOOKTITLE = {Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing -- SPDP'96},
KEY = {p-congint},
MONTH = {October},
PAGES = {462--469},
PUBLISHER = {IEEE CS Press},
TITLE = {{Integrating list heuristics in genetic algorithms for multiprocessor scheduling}},
YEAR = {1996},

}

@INPROCEEDINGS{sched.renpar:cn,
AUTHOR = {R. Corr\^ea and A. Ferreira and P. Rebreyend},
ADDRESS = {Bordeaux},
BOOKTITLE = {Proceedings of the 8\`eme Rencontres du Parall\'elisme},
KEY = {qf-congnat},
MONTH = {May},
TITLE = {{Algorithmes g\'en\'etiques ``intelligents'' pour l'ordonnancement de t\^aches}},
YEAR = {1996},

}

@INPROCEEDINGS{Dal96a,
AUTHOR = {O. Dalle},
ADDRESS = {Dijon (France)},
BOOKTITLE = {Proceedings of Parallel and Distributed Computing Systems (PDCS'96)},
EDITOR = {K. Yetongnon and S. Hariri},
MONTH = sep,
ISBN = {1-880843-17-X},
ORGANIZATION = {International Society for Computers and their Applications (ISCA)},
PAGES = {248--253},
TITLE = {{LoadBuilder}: A tool for generating and modeling workloads in distributed workstations environments},
VOLUME = {1},
YEAR = {1996} 
}

@INPROCEEDINGS{DuFe96,
AUTHOR = {T. Duboux and A. Ferreira},
ADDRESS = {Braga, Portugal},
BOOKTITLE = {Proceedings of Euromicro's 4th Workshop on Parallel and Distributed Processing},
KEY = {p-congint},
PUBLISHER = {IEEE Press},
TITLE = {{Achieving Good Performance for Dictionary Machines: A Scalable Distributed Data Balancing Technique}},
YEAR = {1996},

}

@INPROCEEDINGS{FeMa96,
AUTHOR = {A. Ferreira and K. Marcus},
ADDRESS = {Ottawa},
BOOKTITLE = {{Proceedings of The 10th IEEE Annual International Symposium on High Performance Computers -- HPCS'96}},
EDITOR = {F. Dehne and B. Hodson},
KEY = {p-congint},
MONTH = {June},
NOTE = {CD-ROM},
PUBLISHER = {IEEE Press},
TITLE = {{A theoretical framework for the design of lightwave networks}},
YEAR = {1996},

}

@INPROCEEDINGS{GJMS96a,
AUTHOR = {B. Gaujal and A. Jean-Marie and P. Mussi and G.Siegel},
ADDRESS = {Faverges de la Tour -- France},
BOOKTITLE = {{Environments and Tools for Parallel Scientific Computing}},
MONTH = {August},
TITLE = {{High Speed Simulation of Discrete Event Systems by Mixing Process Oriented and Equational Approaches}},
YEAR = {1996},

}

@inproceedings{GaPe96b,
author = {C. Gavoille and S. P\'erennes},
title = {Lower Bounds for Shortest Path Interval Routing},
booktitle = {SIROCCO'96, The 3rd International Colloquium on Structural Information {\&} Communication Complexity},
year = {1996},
pages = {88-103},
editor = {N. Santoro and P. G. Spirakis},
address = {Siena, Italy},
month = jun,

}

@inproceedings{GaPe96a,
author = {C. Gavoille and S. P\'erennes},
title = {Memory Requirements for Routing in Distributed Networks (Extended Abstract)},
booktitle = {PODC},
year = {1996},
pages = {125-133},
note = {Best student paper award} 
}

@InProceedings{LiCa96,
author = "Liquori, L. and Castagna, G.",
title = "A {T}yped {L}ambda {C}alculus of {O}bjects",
booktitle = "Asian, International Conference on Concurrency and Parallelism, Programming, Networking, and Security",
series = lncs,
publisher = {Springer Verlag},
volume = "1179",
month = "",
year = "1996",
pages = "129--141",
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/asian-96.ps.gz},

}

@INPROCEEDINGS{MS96a,
AUTHOR = {P. Mussi and G.Siegel},
ADDRESS = {Genoa--Italy},
BOOKTITLE = {{European Simulation Symposium}},
MONTH = {October},
TITLE = {{Extending the Prosit System to Support Distributed Simulation}},
YEAR = {1996} 
}

@TECHREPORT{BaDa96,
AUTHOR = {F. Baude and O. Dalle},
INSTITUTION = {{Laboratoire I3S, UPRES-A 6070 CNRS-UNSA}},
MONTH = {Mars},
NUMBER = {96-08},
TYPE = {Rapport de recherche},
TITLE = {Analyse des performances de communication du protocole {PVM}},
YEAR = {1996} 
}

@TECHREPORT{Dal96b,
AUTHOR = {O. Dalle},
INSTITUTION = {{INRIA}},
MONTH = {Octobre},
NUMBER = {RR-3045},
TITLE = {{LoadBuilder}: A tool for generating and modeling workloads in distributed workstations environments},
NOTE = {Version longue},
TYPE = {Rapport de recherche},
YEAR = {1996} 
}

@techreport{Liq96a,
author = "Liquori, L.",
title = "An {E}xtended {T}heory of {P}rimitive {O}bjects",
institution = "Computer Science Department, University of Turin",
type = "Technical Report",
number = "CS-23-96",
year = "1996",

}

@MASTERSTHESIS{Cou96,
author = {D. Coudert},
title = {{Simulation de syst\`emes multi-processeurs \`a communications \'electroniques et optiques}},
school = {ENS Lyon},
year = {1996},
address = {UCSD, San Diego (USA), with P. Marchand},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/Cou-MIM2.ps.gz} 
}

@BOOK{FeRo95,
EDITOR = {A. Ferreira and J. Rolim},
KEY = {b-edition},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{Parallel Algorithms for Solving Irregularly Structured Problems -- Irregular'95}},
VOLUME = {980},
YEAR = {1995},

}

@BOOK{AGF+95,
ADDRESS = {Paris (F)},
EDITOR = {G. Authi\'e and Jean-Marie Garcia and A. Ferreira and J.L. Roch and G. Villard and J. Roman and C. Roucairol and B. Virot},
KEY = {b-edition},
PUBLISHER = {Hermes},
TITLE = {{Algorithmique parall\`ele et applications irr\'eguli\`eres}},
YEAR = {1995},

}

@BOOK{FeRo94,
ADDRESS = {Boston (USA)},
EDITOR = {A. Ferreira and J. Rolim},
KEY = {b-edition},
PUBLISHER = {Kluwer Academic Publisher},
TITLE = {{Parallel Algorithms for Irregular Problems: State of the Art}},
YEAR = {1995},

}

@INCOLLECTION{CoFe95,
AUTHOR = {R. Corr\^ea and A. Ferreira},
BOOKTITLE = {Solving Irregular Problems in Parallel: State of the Art},
EDITOR = {A. Ferreira and J. Rolim},
KEY = {bc-chapter},
PAGES = {157--176},
PUBLISHER = {Kluwer Academic Publisher, Boston (USA)},
TITLE = {{A Distributed Implementation of Asynchronous Parallel Branch and Bound}},
YEAR = {1995},

}

@article {MR1327570,
AUTHOR = {Albert, M. and Frieze, A. and Reed, B.},
TITLE = {Multicoloured {H}amilton cycles},
JOURNAL = {Electron. J. Combin.},
VOLUME = {2},
YEAR = {1995},
PAGES = {Research Paper 10, approx.\ 13 pp.\ (electronic)},

}

@article {MR1711792,
AUTHOR = {Albert, M. and Frieze, A. and Reed, B.},
TITLE = {Comments on: ``{M}ulticoloured {H}amilton cycles'' [{E}lectron. {J}. {C}ombin. {\bf 2} (1995), {R}esearch {P}aper 10, 13 pp. (electronic); {MR}1327570 (96b:05058)]},
JOURNAL = {Electron. J. Combin.},
VOLUME = {2},
YEAR = {1995},
PAGES = {Research Paper 10, Comment 1, 1 HTML document (electronic)},

}

@Article{BCH95,
Author ="J-C. Bermond and F. Comellas and D.F. Hsu",
Title ="Distributed Loop Computer Networks: a survey",
Journal="Journal of Parallel and Distributed Computing",
Year ="1995",
Volume="24",
Pages="2--10" 
}

@Article{BFP95,
Author="J-C. Bermond and P. Fraigniaud and J.G. Peters",
Title="Antepenultimate Broadcasting",
Journal="Networks",
Year="1995",
Volume="26",
Number="3",
Pages="125--137" 
}

@ARTICLE{BeFe95,
AUTHOR = {P. Berthom\'e and A. Ferreira},
EDITOR = {D. Frank Hsu and A. L. Rosenberg and D. Sotteau},
JOURNAL = {DIMACS series in Discrete Mathematics and Theoretical Computer Science},
KEY = {j-journal},
PAGES = {19--29},
TITLE = {{On Broadcasting Schemes in Restricted Optical Passive Star Systems}},
VOLUME = {21},
YEAR = {1995},

}

@ARTICLE{CoFe95b,
AUTHOR = {R. Corr\^ea and A. Ferreira},
BOOKTITLE = {Proceedings of the DIMACS Workshop on Parallel Processing of Discrete Optimization},
EDITOR = {Panos M. Pardalos and Mauricio G.C Resende and K.G. Ramakrishnan},
JOURNAL = {DIMACS series in Discrete Mathematics and Theoretical Computer Science},
KEY = {j-journal},
PAGES = {45--56},
PUBLISHER = {American Mathematical Society},
TITLE = {{Modeling Parallel Branch-and-Bound for Asynchronous Implementations}},
VOLUME = {22},
YEAR = {1995},

}

@ARTICLE{CoFe95c,
AUTHOR = {R. Corr\^ea and A. Ferreira},
JOURNAL = {Parallel Processing Letters},
KEY = {j-journal},
NUMBER = {3},
PAGES = {375--386},
TITLE = {{On the effectivenes of parallel branch and bound}},
VOLUME = {5},
YEAR = {1995},

}

@ARTICLE{DFR95,
AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
JOURNAL = {{Computer Vision and Image Understanding}},
KEY = {j-journal},
NUMBER = {1},
PAGES = {1--10},
TITLE = {{Parallel processing of pointer based quadtrees}},
VOLUME = {62},
YEAR = {1995},

}

@article{MR1361150,
AUTHOR = {Devroye, L. and Reed, B.},
TITLE = {On the variance of the height of random binary search trees},
JOURNAL = {SIAM J. Comput.},
VOLUME = {24},
YEAR = {1995},
NUMBER = {6},
PAGES = {1157--1162},

}

@ARTICLE{DFG95,
AUTHOR = {T. Duboux and A. Ferreira and M. Gastaldo},
JOURNAL = {Microprocessors \& Microprogramming Journal},
KEY = {j-journal},
NOTE = {Special Issue on Parallel Programmable Architectures and Compilation for Multi-dimensional Processing},
PAGES = {359--372},
TITLE = {{A Scalable Design for {VLSI} Dictionary Machines}},
VOLUME = {41},
YEAR = {1995},
KEYWORDS = {parallelisme, grain fin, machine dico} 
}

@ARTICLE{Fer95,
AUTHOR = {A. Ferreira},
JOURNAL = {International Journal of High Speed Computing},
KEY = {j-journal},
PAGES = {595--606},
TITLE = {{Work and memory efficient parallel algorithms for the knapsack problem}},
VOLUME = {4},
YEAR = {1995},

}

@article {MR1333850,
AUTHOR = {Frieze, A. and Karp, R. M. and Reed, B.},
TITLE = {When is the assignment bound tight for the asymmetric traveling-salesman problem?},
JOURNAL = {SIAM J. Comput.},
VOLUME = {24},
YEAR = {1995},
NUMBER = {3},
PAGES = {484--493},

}

@article {MR1364022,
AUTHOR = {Frieze, A. and Reed, B.},
TITLE = {Covering the edges of a random graph by cliques},
JOURNAL = {Combinatorica},
VOLUME = {15},
YEAR = {1995},
NUMBER = {4},
PAGES = {489--497},

}

@article{MR1341476,
AUTHOR = {Gamble, B. and Pulleyblank, W. and Reed, B. and Shepherd, B.},
TITLE = {Right angle free subsets in the plane},
JOURNAL = {Graphs Combin.},
VOLUME = {11},
YEAR = {1995},
NUMBER = {2},
PAGES = {121--129},

}

@article {MR1356578,
AUTHOR = {McDiarmid, C. and Reed, B.},
TITLE = {Almost every graph can be covered by {$\lceil{\Delta/2}\rceil$} linear forests},
JOURNAL = {Combin. Probab. Comput.},
VOLUME = {4},
YEAR = {1995},
NUMBER = {3},
PAGES = {257--268},

}

@article {MR1369064,
AUTHOR = {Molloy, M. and Reed, B.},
TITLE = {The dominating number of a random cubic graph},
JOURNAL = {Random Structures Algorithms},
VOLUME = {7},
YEAR = {1995},
NUMBER = {3},
PAGES = {209--221},

}

@article {MR1341480,
AUTHOR = {Reed, B. and Sbihi, N.},
TITLE = {Recognizing bull-free perfect graphs},
JOURNAL = {Graphs Combin.},
VOLUME = {11},
YEAR = {1995},
NUMBER = {2},
PAGES = {171--178},

}

@article {MR1327776,
AUTHOR = {Reed, B.},
TITLE = {Rooted routing in the plane},
NOTE = {Combinatorial optimization 1992 (CO92) (Oxford)},
JOURNAL = {Discrete Appl. Math.},
VOLUME = {57},
YEAR = {1995},
NUMBER = {2-3},
PAGES = {213--227},

}

@InProceedings{BBD95,
Author = {J-C. Bermond and J. Bond and S. Djelloul},
Title = {Dense bus networks of diameter 2},
BookTitle= {Proc. Workshop on interconnection Networks, DIMACS, Feb. 1994, DIMACS Ser.},
Year={1995},
Pages={9--18},
Volume={21},
Publisher={Annals New York Academy of Sciences},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BDD95.pdf},

}

@INPROCEEDINGS{P2,
AUTHOR = {J-C. Bermond and D. Caromel and P. Mussi},
BOOKTITLE = {proceedings Joint Conference on Information Sciences (JCIS)},
MONTH = {October},
NOTE = {invited session on Object-Oriented Programming},
PAGES = {218--221},
TITLE = {Simulation within a Parallel Object-Oriented Language: The SLOOP System},
YEAR = {1995} 
}

@InProceedings{BCM95,
Author = {J-C. Bermond and D. Caromel and P. Mussi},
Title = {Simulation within a parallel object oriented language : The SLOOP System},
BookTitle= {Proceedings Joint Conference on Information Sciences (JCIS'95), North Carolina , Sept. 1995},
Year={1995},

}

@InProceedings{BGRV95,
Author = {J-C. Bermond and L. Gargano and A.A. Rescigno and U. Vaccaro},
Title = {Fast gossiping by short messages},
BookTitle= {Proc.22nd ICALP95, Szeged, Hungary},
Year={1995},
Pages={135--146},
Volume={944},
Publisher="Lecture Notes in Computer Science, Springer Verlag",
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BGRV95.pdf},

}

@InProceedings{BePe95b,
Author = {J-C. Bermond and D. Peleg},
Title = {The power of small coalitions in graphs},
BookTitle= {Proc. Conference SIROCCO95 Olympie June 95, International Informatics Series 2 },
Year={1995},
Pages="173--184",
Publisher={Carleton U. Press},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BePe95b.pdf},

}

@InProceedings{BePe95a,
Author = {J-C. Bermond and S. P\'erennes},
Title = {Efficient broadcasting protocols on de Bruijn and similar networks},
BookTitle= {Proc. Conference SIROCCO95, Olympie June 95, International Informatics Series 2},
Year={1995},
Pages={199--209},
Publisher={Carleton U. Press},
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BePe95a.pdf},

}

@INPROCEEDINGS{BeFe95b,
AUTHOR = {P. Berthom\'e and A. Ferreira},
BOOKTITLE = {Broadband Networks: Strategies and Technologies},
EDITOR = {R. A. Cryan and P. N. Fernando and P. Ghiggino and J. M. Senior},
KEY = {p-congint},
PAGES = {464--473},
PUBLISHER = {SPIE -- The International Society for Optical Engineering},
SERIES = {Proceedings of SPIE},
TITLE = {{Communication Issues in Parallel Systems with Optical Interconnections}},
VOLUME = {2450},
YEAR = {1995},

}

@InProceedings{BoLi95,
author = "Bono, V. and Liquori, L.",
title = "A {S}ubtyping for the {F}isher-{H}onsell-{M}itchell {L}ambda {C}alculus of {O}bjects",
booktitle = "CSL, International Conference of Computer Science Logic",
editor = "",
pages = "16--30",
volume = "933",
series = lncs,
publisher = {Springer Verlag},
month = "",
year = "1995",
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/csl-95.ps.gz},

}

@INPROCEEDINGS{BFM95,
AUTHOR = {H. Bourdin and A. Ferreira and K. Marcus},
ADDRESS = {San Antonio (USA)},
BOOKTITLE = {Proceedings of the 2nd IEEE International Workshop on Massively Parallel Processing using Optical Interconnections -- MPPOI'95},
KEY = {p-congint},
MONTH = {October},
PAGES = {257--264},
PUBLISHER = {IEEE Press},
TITLE = {{A comparative study of one-to-many {WDM} lightwave interconnection networks for multiprocessors}},
YEAR = {1995},

}

@INPROCEEDINGS{DFG95b,
AUTHOR = {T. Duboux and A. Ferreira and M. Gastaldo},
BOOKTITLE = {Algorithms and Parallel VLSI Architectures {III}},
EDITOR = {Moonen and Cathoor},
KEY = {p-congint},
PAGES = {143--154},
PUBLISHER = {Elsevier},
TITLE = {{A scalable design for Dictionary Machines}},
YEAR = {1995},

}

@INPROCEEDINGS{FeMa95,
AUTHOR = {A. Ferreira and K. Marcus},
BOOKTITLE = {Fiber Optic Network Components},
EDITOR = {S. I Najafi and H. Porte},
KEY = {p-congint},
PAGES = {78--86},
PUBLISHER = {SPIE -- The International Society for Optical Engineering},
SERIES = {Proceedings of SPIE},
TITLE = {{Modular multihop {WDM}--based lightwave networks, and routing}},
VOLUME = {2449},
YEAR = {1995},

}

@INPROCEEDINGS{FeQa95,
AUTHOR = {A. Ferreira and N. Qadri},
ADDRESS = {New Delhi},
BOOKTITLE = {{IEEE} International Conference on High Performance Computing -- HiPC'95},
KEY = {p-congint},
MONTH = {December},
PUBLISHER = {IEEE Press},
TITLE = {{Performance of {WDM} systems}},
YEAR = {1995},

}

@INPROCEEDINGS{FRU95,
AUTHOR = {A. Ferreira and A. Rau-Chaplin and S. Ubeda},
ADDRESS = {San Antonio (USA)},
BOOKTITLE = {Proceedings of the 7th IEEE Symposium on Parallel and Distributed Processing -- SPDP'95},
KEY = {p-congint},
MONTH = {October},
PAGES = {561--569},
PUBLISHER = {IEEE Press},
TITLE = {{Scalable 2d convex hull and triangulation algorithms for coarse-grained multicomputers}},
YEAR = {1995},

}

@INPROCEEDINGS{FeUb95,
AUTHOR = {A. Ferreira and S. Ub\'eda},
ADDRESS = {Washington DC},
BOOKTITLE = {Proceedings of the {IEEE} International Conference on Image Processing -- ICIP'95},
KEY = {p-congint},
MONTH = {October},
PAGES = {105--107},
PUBLISHER = {IEEE Press},
TITLE = {{Parallel complexity of the medial axis transform}},
VOLUME = {II},
YEAR = {1995},

}

@InProceedings{Liq95,
author = {L. Liquori},
title = {A {T}yped {A}xiomatic {O}bject {C}alculus with {S}ubtyping},
booktitle = {ATSC, International Workshop on Advances in Type Systems for Computing},
address = {Newton Institute, Cambridge},
year = {1995},

}

@inproceedings {MR1370952,
AUTHOR = {Molloy, M. and Reed, B.},
TITLE = {A critical point for random graphs with a given degree sequence},
BOOKTITLE = {Proceedings of the Sixth International Seminar on Random Graphs and Probabilistic Methods in Combinatorics and Computer Science, ``Random Graphs '93'' (Pozna\'n, 1993)},
JOURNAL = {Random Structures Algorithms},
VOLUME = {6},
YEAR = {1995},
NUMBER = {2-3},
PAGES = {161--179},

}

@INPROCEEDINGS{MS95a,
AUTHOR = {P. Mussi and G. Siegel},
ADDRESS = {{E}rlangen, {G}ermany},
BOOKTITLE = {{E}uropean {S}imulation {S}ymposium},
MONTH = {October},
PAGES = {297--301},
TITLE = {{T}he {PROSIT} {S}equential {S}imulator: {A} {T}est-bed for {O}bject {O}riented {D}iscrete {E}vent {S}imulation},
YEAR = {1995} 
}

@TECHREPORT{J7,
AUTHOR = {F. Baude and F. Belloncle and D. Caromel and N. Furmento and P. Mussi and Y. Roudier and G. Siegel},
INSTITUTION = {I3S No RR-95-59},
MONTH = {December},
TITLE = {Parallel Object-Oriented Programming for Parallel Simulations},
YEAR = {1995} 
}

@TECHREPORT{MS95b,
AUTHOR = {P. Mussi and G. Siegel},
BOOKTITLE = {{E}uropean {S}imulation {S}ymposium},
INSTITUTION = {INRIA},
MONTH = {November},
NUMBER = {RR-2713},
TITLE = {{S}equential {S}imulation in {P}rosit: {P}rogramming {M}odel and {I}mplementation},
YEAR = {1995} 
}

@MASTERSTHESIS{Cou95,
author = {D. Coudert},
title = {Contribution \`a l'implantation d'algorithmes g\'eom\'etriques sur machines parall\`eles},
month = {Juin},
school = {ENS Lyon},
year = {1995},
address = {LIP -- ENS Lyon, T. Duboux},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/Cou-MIM1.ps.gz} 
}

@book{Rum94,
author = {RUMEUR, Jean de},
address = {Paris},
publisher = {Masson},
title = {Communications dans les r\'eseaux de processeurs},
year = {1994},
note = {(including J-C. Bermond, E. Darrot ,D. Lafaye de Micheaux and M. Syska)} 
}

@BOOK{AFFS94,
EDITOR = {S. Akl and A. Ferreira and P. Fraigniaud and D. Sotteau},
KEY = {e-editor},
PUBLISHER = {World Publisher Co.},
TITLE = {{Parallel Processing Letters -- Special Issue on Algorithmic and Structural Aspects of Interconnection Networks}},
YEAR = {1994},

}

@BOOK{CFP94,
EDITOR = {M. Cosnard and A. Ferreira and J. Peters},
KEY = {b-edition},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{Parallel and Distributed Computing -- Theory and Practice}},
VOLUME = {805},
YEAR = {1994},

}

@BOOK{AFR+94,
ADDRESS = {Paris (F)},
EDITOR = {G. Authi\'e and A. Ferreira and J.L. Roch and G. Villard and J. Roman and C. Roucairol and B. Virot},
KEY = {b-edition},
PUBLISHER = {Hermes},
TITLE = {{Algorithmes parall\`eles -- analyse et conception}},
YEAR = {1994},

}

@PHDTHESIS{these3,
AUTHOR = {A. Ferreira},
ADDRESS = {France},
HOWPUBLISHED = {Habilitation \`a diriger des recherches},
MONTH = {February},
SCHOOL = {Ecole Normale Sup\'erieure de Lyon et Universit\'e Claude Bernard Lyon},
TITLE = {{Structures de donn\'ees et mod\'elisation discr\`ete pour l'algorithmique des syst\`emes massivement parall\`eles}},
TYPE = {Habilitation \`a diriger des recherches},
YEAR = {1994} 
}

@INCOLLECTION{DFG94,
AUTHOR = {T. Duboux and A. Ferreira and M. Gastaldo},
ADDRESS = {Paris (F)},
BOOKTITLE = {Algorithmes parall\`eles -- analyse et conception},
EDITOR = {G. Authi\'e and A. Ferreira and J.L. Roch and G. Villard and J. Roman and C. Roucairol and B. Virot},
KEY = {bc-chapter},
PAGES = {129--171},
PUBLISHER = {Hermes},
TITLE = {{6: Algorithmique Parall\`ele -- Structures de Donn\'ees Arborescentes}},
YEAR = {1994},

}

@Article{BeFr94,
Author="J-C. Bermond and P. Fraigniaud",
Title="Broadcasting and Gossiping in {de Bruijn} Networks",
Journal="SIAM Journal on Computing",
Pages="212--225",
Year="1994",
Volume="23",
Number="1" 
}

@ARTICLE{BeFe94,
AUTHOR = {P. Berthom{\'e} and A. Ferreira},
JOURNAL = {Parallel Algorithms and Applications},
KEY = {j-journal},
PAGES = {169--181},
PUBLISHER = {IMACS - North Holland},
TITLE = {{Time-optimal geometric algorithms in hypercubic networks}},
VOLUME = {4},
YEAR = {1994},

}

@ARTICLE{DFR94,
AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
JOURNAL = {Parallel Computing},
KEY = {j-journal},
PAGES = {1369--1382},
TITLE = {{A massively parallel knowledge-base server using a hypercube multiprocessor}},
VOLUME = {20},
YEAR = {1994},

}

@ARTICLE{FeUb94,
AUTHOR = {A. Ferreira and S. Ub\'eda},
ADDRESS = {Grenoble (Fr)},
JOURNAL = {Pattern Recognition},
KEY = {j-journal},
NUMBER = {7},
PAGES = {867--878},
TITLE = {{Ultra-fast parallel contour tracking, with applications to thinning}},
VOLUME = {27},
YEAR = {1994},

}

@article{MR1271267,
AUTHOR = {McDiarmid, C. and Reed, B. and Schrijver, A. and Shepherd, B.},
TITLE = {Induced circuits in planar graphs},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {60},
YEAR = {1994},
NUMBER = {2},
PAGES = {169--176},

}

@INPROCEEDINGS{ADF94,
AUTHOR = {S. Akl and J. Duprat and A. Ferreira},
ADDRESS = {Sophia (Bul)},
BOOKTITLE = {Advances in Parallel Algorithms -- Proceedings of the Workshop on Parallel Algorithms '92},
EDITOR = {I. Dimov and O. Tonev},
KEY = {p-congint},
PAGES = {131--143},
PUBLISHER = {IOS Press},
TITLE = {{Building hamiltonian circuits and paths on star graphs}},
YEAR = {1994},

}

@INPROCEEDINGS{DFT94,
AUTHOR = {F. Desprez and A. Ferreira and B. Tourancheau},
BOOKTITLE = {Proceedings of the First IEEE International Workshop on Massively Parallel Processing Using Optical Interconnections -- MPPOI'94},
KEY = {p-congint},
PAGES = {52--58},
PUBLISHER = {IEEE Press},
TITLE = {{Efficient communication operations on passive optical star networks}},
YEAR = {1994},

}

@inproceedings{FMSM93,
author = {P. Ferrante and P. Mussi and G. Siegel and L. Mallet},
booktitle = {Western Simulation Conference 1994, Tempe (AZ)},
month = {Juanary},
publisher = {SCS},
title = {Object Oriented Simulation: Highlights on the Prosit Parallel Discrete Event Simulator},
year = {1994} 
}

@INPROCEEDINGS{FGS94b,
AUTHOR = {A. Ferreira and A. Goldman and S. W. Song},
BOOKTITLE = {Parallel Processing: CONPAR 94 -- VAPP VI},
EDITOR = {B. Buchberger and J. Volkert},
INSTITUTION = {Laboratoire de l'Informatique du Parall\'elisme},
KEY = {p-congint},
PAGES = {797--807},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{Broadcasting in bus interconnection networks}},
VOLUME = {854},
YEAR = {1994},

}

@INPROCEEDINGS{FGS94,
AUTHOR = {A. Ferreira and A. Goldman and S.W. Song},
BOOKTITLE = {PARLE '94 -- Parallel Architectures and Languages Europe},
EDITOR = {C. Halatsis and D. Maritsas and G. Philokyprou and S. Thoedoridis},
INSTITUTION = {Laboratoire de l'Informatique du Parall\'elisme},
KEY = {p-congint},
PAGES = {553--564},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{{Bus based parallel computers: A viable way for massive parallelism}}},
VOLUME = {817},
YEAR = {1994},

}

@INPROCEEDINGS{FeGR94,
AUTHOR = {A. Ferreira and M. Grammatikakis},
BOOKTITLE = {Proceedings of PARLE},
EDITOR = {C. Halatsis and D. Maritsas and G. Philokyprou and S. Theodoridis},
JOURNAL = {Theoretical Computer Science},
KEY = {p-congint},
PAGES = {1--12},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{Improved probabilistic routing in generalized hypercubes}},
VOLUME = {817},
YEAR = {1994},

}

@InProceedings{LiSa94,
author = {L. Liquori and M.L. Sapino},
title = {Dealing with {E}xplicit {E}xceptions},
booktitle = {GULP-PRODE, International Joint Conference on Declarative Programming},
pages = {296--308},
year = {1994},
editor = {M. Alpuente and R. Barbuti and I. Ramos},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/gulp-94.ps.gz},

}

@INPROCEEDINGS{MUSSI93,
AUTHOR = {P. Mussi and P. Ferrante and G. Siegel and L. Mallet},
BOOKTITLE = {Object Oriented SImulation Conference},
MONTH = {Juanary},
NOTE = {Part of the 1994 Western Simulation Multiconference, Tempe, Arizona},
ORGANIZATION = {SCS},
PUBLISHER = {SCS},
TITLE = {Object Oriented SImulation: Highlights on the PROSIT Distributed DIscrete Event Simulator},
YEAR = {1994} 
}

@InProceedings{BLRU94,
author = {van Bakel, S. and Liquori, L. and {Ronchi della Rocca}, S. and Urzyczyn, P.},
title = {{Comparing Cubes}},
booktitle = {LFCS, International Symposium on Logical Foundations of Computer Science},
pages = {353--365},
year = {1994},
volume = {813},
series = lncs,
publisher = {Springer Verlag},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/lfcs-94.ps.gz},

}

@TECHREPORT{D19,
AUTHOR = {A. Jean-Marie and P. Mussi and M. Syska},
INSTITUTION = {INRIA},
MONTH = {September},
NUMBER = {D W3.T2-T3.19.v1},
TITLE = {Communications in Multiprocessor Machines - A Survey},
TYPE = {QMIPS Report},
YEAR = {1994} 
}

@incollection {MR1224703,
AUTHOR = {Bollob{\'a}s, B. and Reed, B. and Thomason, A.},
TITLE = {An extremal function for the achromatic number},
BOOKTITLE = {Graph structure theory (Seattle, WA, 1991)},
SERIES = {Contemp. Math.},
VOLUME = {147},
PAGES = {161--165},
PUBLISHER = {Amer. Math. Soc.},
ADDRESS = {Providence, RI},
YEAR = {1993},

}

@incollection {MR1224712,
AUTHOR = {Reed, B. A. and Robertson, N. and Schrijver, A. and Seymour, P. D.},
TITLE = {Finding disjoint trees in planar graphs in linear time},
BOOKTITLE = {Graph structure theory (Seattle, WA, 1991)},
SERIES = {Contemp. Math.},
VOLUME = {147},
PAGES = {295--301},
PUBLISHER = {Amer. Math. Soc.},
ADDRESS = {Providence, RI},
YEAR = {1993},

}

@incollection {MR1224702,
AUTHOR = {Reed, B.},
TITLE = {Counterexamples to a conjecture of {L}as {V}ergnas and {M}eyniel},
BOOKTITLE = {Graph structure theory (Seattle, WA, 1991)},
SERIES = {Contemp. Math.},
VOLUME = {147},
PAGES = {157--159},
PUBLISHER = {Amer. Math. Soc.},
ADDRESS = {Providence, RI},
YEAR = {1993},

}

@Article{BeHe93,
Author="J-C. Bermond and P. Hell",
Title="On even factorizations and the chromatic index of the {Kautz} and {de Bruijn} digraphs",
Journal="Journal of Graph theory",
Pages="647--655",
Year="1993",
Volume="17",
Number="5",
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BeHe93.pdf},

}

@Article{BLSS93,
author = {J-C. Bermond and E. Lazard and D. Sotteau and M. Syska},
title = {La Th\'eorie des graphes},
Journal={Courrier du CNRS, la recherche en informatique},
Volume="80",
Pages ={54--55},
year = {1993},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BLSS93.pdf},

}

@Article{BHP93,
Author="J-C. Bermond and N. Homobono N. and C. Peyrat",
Title="Connectivity of {Kautz} Networks",
Journal="Discrete Mathematics",
Year="1993",
Volume="114",
Pages="51--62" 
}

@article {MR1244930,
AUTHOR = {Cornu{\'e}jols, G. and Reed, B.},
TITLE = {Complete multi-partite cutsets in minimal imperfect graphs},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {59},
YEAR = {1993},
NUMBER = {2},
PAGES = {191--198},

}

@ARTICLE{Fer93,
AUTHOR = {A. Ferreira},
JOURNAL = {Theoretical Computer Science},
KEY = {j-journal},
PAGES = {311--315},
TITLE = {{On space-efficient algorithms for certain {NP-Complete} problems}},
VOLUME = {120},
YEAR = {1993},
KEYWORDS = {parallelisme, optimisation, knapsack} 
}

@ARTICLE{FeZe93,
AUTHOR = {A. Ferreira and J. Zerovnik},
JOURNAL = {International Journal on Computers \& Mathematics with Applications},
KEY = {j-journal},
NOTE = {2nd Special Issue on Global Optimization, Control and Games},
NUMBER = {10/11},
PAGES = {1--8},
TITLE = {{Bounding the probability of success of stochastic methods for global optimization}},
VOLUME = {25},
YEAR = {1993},

}

@article {MR1230055,
AUTHOR = {Frieze, A. and Reed, B.},
TITLE = {Polychromatic {H}amilton cycles},
JOURNAL = {Discrete Math.},
VOLUME = {118},
YEAR = {1993},
NUMBER = {1-3},
PAGES = {69--74},

}

@article{MR1262919,
AUTHOR = {Kilakos, K. and Reed, B.},
TITLE = {Fractionally colouring total graphs},
JOURNAL = {Combinatorica},
VOLUME = {13},
YEAR = {1993},
NUMBER = {4},
PAGES = {435--440},

}

@article {MR1198401,
AUTHOR = {McDiarmid, C. and Reed, B.},
TITLE = {On total colourings of graphs},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {57},
YEAR = {1993},
NUMBER = {1},
PAGES = {122--130},

}

@article {MR1259161,
AUTHOR = {Reed, B.},
TITLE = {Rooted routing in the plane},
JOURNAL = {CWI Quarterly},
VOLUME = {6},
YEAR = {1993},
NUMBER = {3},
PAGES = {241--255},

}

@INPROCEEDINGS{BFM+93,
AUTHOR = {P. Berthom\'e and A. Ferreira and B. Maggs and S. Perennes and G. Plaxton},
BOOKTITLE = {Proceedings of the 7th IEEE International Parallel Processing Symposium -- IPPS'93},
KEY = {p-congint},
PAGES = {89--95},
PUBLISHER = {IEEE Press},
TITLE = {{Sorting-based selection algorithms on hypercubic networks}},
YEAR = {1993},

}

@INPROCEEDINGS{BFP93,
AUTHOR = {P. Berthom\'e and A. Ferreira and S. Perennes},
BOOKTITLE = {Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing -- SPDP'93},
KEY = {p-congint},
MONTH = {December},
PAGES = {720--723},
PUBLISHER = {IEEE Press},
TITLE = {{Improved algorithm design and optimal information dissemination in {Star} and {Pancake} networks}},
YEAR = {1993},

}

@INPROCEEDINGS{CFK93,
AUTHOR = {V. Castro-Alves and A. Ferreira and O. Kebichi},
ADDRESS = {San Jose (CA)},
BOOKTITLE = {Proceedings of the {IEEE} International Workshop on Memory Testing},
KEY = {p-congint},
MONTH = {August},
PAGES = {68--71},
PUBLISHER = {IEEE Press},
TITLE = {{A new class of fault models and test algorithms for dual-port dynamic {RAM} testing}},
YEAR = {1993},

}

@INPROCEEDINGS{dm2:cn,
AUTHOR = {T. Duboux and A. Ferreira and M. Gastaldo},
ADDRESS = {Brest},
BOOKTITLE = {Proceedings of the 5\`eme Rencontres du Parall\'elisme},
KEY = {qf-congnat},
MONTH = {May},
PAGES = {213--216},
TITLE = {{Machine dictionnaire sur architectures \`a m\'emoire distribu\'ee}},
YEAR = {1993},

}

@INPROCEEDINGS{busbr:cn,
AUTHOR = {A. Ferreira and A. Goldman and S. Song},
ADDRESS = {Florian\'opolis (Br)},
BOOKTITLE = {Proceedings of the 5th Simp\'osio Brasileiro de Arquitetura de Computadores e Proc. de Alto Desempenho, SBC},
KEY = {qf-congnat},
MONTH = {September},
PAGES = {17--32},
PUBLISHER = {Brazilian Society of Computer Science},
TITLE = {{Comunica\c c\~ao em hipergrades e hipertoros usando barramentos}},
YEAR = {1993},

}

@INPROCEEDINGS{FeUb93,
AUTHOR = {A. Ferreira and S. Ub{\'e}da},
BOOKTITLE = {Parallel Computing: Trends and Applications (ParCo'93)},
EDITOR = {G.R. Joubert and D. Trystram and F.J. Peters and D.J. Evans},
KEY = {p-congint},
PAGES = {97--104},
PUBLISHER = {Elsevier Science B.V., Amsterdam},
SERIES = {Advances in Parallel Computing},
TITLE = {{Ultra-fast parallel contour tracking, with applications to thinning}},
VOLUME = {9},
YEAR = {1993},

}

@inproceedings{MALLET93b,
author = {L. Mallet and P. Mussi},
booktitle = {Modelling and Simulation FSM 93, june 7-9, LYON},
month = {June},
publisher = {SCS},
title = {Object Oriented Parallel Discrete Event Simulation: The PROSIT Approach},
year = {1993} 
}

@inproceedings{HRPM93,
author = {H. Rakotoarisoa and P. Mussi},
booktitle = {Modelling and Simulation FSM 93, june 7-9, LYON},
month = {June},
publisher = {SCS},
title = {PARSEVAL: A Workbench for Queueing Networks Parallel Simulation},
year = {1993} 
}

@book{Ber92,
title = "Interconnection Networks",
author = "J-C. Bermond, editor",
volume = "37,38",
publisher = "Discrete Applied Mathematics",
year = "1992",
Pages="582 pages",
note={(also appeared in Topics in Discrete Mathematics, Vol 5,1992, North Holland) 582 pp} 
}

@INCOLLECTION{DFR92,
AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
BOOKTITLE = {Algorithmique Parall\`ele},
EDITOR = {M.Cosnard and M.Nivat and Y.Robert},
KEY = {bc-chapter},
PAGES = {65--80},
PUBLISHER = {Masson},
SERIES = {Etudes et Recherches en Informatique},
TITLE = {{Algorithmique {SIMD}}},
YEAR = {1992},

}

@incollection {MR1218208,
AUTHOR = {Kilakos, K. and Reed, B.},
TITLE = {A semi-integral total colouring},
BOOKTITLE = {Sets, graphs and numbers (Budapest, 1991)},
SERIES = {Colloq. Math. Soc. J\'anos Bolyai},
VOLUME = {60},
PAGES = {429--438},
PUBLISHER = {North-Holland},
ADDRESS = {Amsterdam},
YEAR = {1992},

}

@ARTICLE{ACF92,
AUTHOR = {S. Akl and M. Cosnard and A. Ferreira},
JOURNAL = {Theoretical Computer Science},
KEY = {j-journal},
PAGES = {323--337},
TITLE = {{{Data-movement-intensive problems : two folk theorems in parallel computation revisited}}},
VOLUME = {95},
YEAR = {1992},

}

@article{MR1194728,
AUTHOR = {Alon, N. and McDiarmid, C. and Reed, B.},
TITLE = {Star arboricity},
JOURNAL = {Combinatorica},
VOLUME = {12},
YEAR = {1992},
NUMBER = {4},
PAGES = {375--380},

}

@Article{BDQ92,
Author="Bermond, J-C. and Delorme, C. and Quisquater, J-J.",
Title="Table of large $({\Delta},D)$-graphs",
Journal="Discrete Applied Mathematics",
Year="1992",
Volume="37/38",
Pages="575--577" 
}

@article{BHLP92b,
author="J-C. Bermond and P. Hell and A. L. Liestman and J. G. Peters",
title="Broadcasting in bounded degree graphs",
journal="SIAM Journal on Discrete Mathematics",
pages="10--24",
year="1992",
volume="5",
number="1",
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BHLP92b.pdf},

}

@Article{BHLP92,
Author="J-C. Bermond and P. Hell and A. L. Liestman and J. G. Peters",
Title="Sparse broadcast graphs",
Journal="Discrete Applied Mathematics",
Pages="97--130",
Year="1992",
Volume="36",

}

@Article{BHQ92,
Author="J-C. Bermond and P. Hell and J.-J. Quisquater",
Title="Construction of large packet radio networks",
Journal="Parallel Processing Letters",
Pages="3-12",
Year="1992",
Volume="2",
Number="1",
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BHQ92.pdf},

}

@article{BMT92,
author = {J-C. Bermond and P. Michallon and D. Trystram},
journal = {Parallel Computing},
pages = {639--648},
title = {Broadcasting in wraparound meshes with parallel monodirectional links},
volume = {18},
year = {1992},

}

@ARTICLE{DFR92b,
AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
JOURNAL = {Computational Geometry - Theory and Applications},
KEY = {j-journal},
PAGES = {141--167},
TITLE = {{Parallel fractional cascading on hypercube multiprocessors}},
VOLUME = {2},
YEAR = {1992},

}

@ARTICLE{FeSo92,
AUTHOR = {A. Ferreira and S.W. Song},
JOURNAL = {Integration: the {VLSI} journal},
KEY = {j-journal},
PAGES = {173--195},
TITLE = {{Achieving optimality for gate matrix layout and {PLA} folding : a graph theoretic approach}},
VOLUME = {14},
YEAR = {1992},

}

@article {MR1174859,
AUTHOR = {Frieze, A. and McDiarmid, C. and Reed, B.},
TITLE = {On a conjecture of {B}ondy and {F}an},
JOURNAL = {Ars Combin.},
VOLUME = {33},
YEAR = {1992},
PAGES = {329--336},

}

@article {MR1208807,
AUTHOR = {Reed, B. and McDiarmid, C.},
TITLE = {The strongly connected components of {$1$}-in, {$1$}-out},
JOURNAL = {Combin. Probab. Comput.},
VOLUME = {1},
YEAR = {1992},
NUMBER = {3},
PAGES = {265--274},

}

@INPROCEEDINGS{ACF92b,
AUTHOR = {S. Akl and M. Cosnard and A. Ferreira},
BOOKTITLE = {Proceedings of the IEEE International Conference on Computing and Information -- ICCI'92},
EDITOR = {W.W. Koczkodaj and P.L. Lauer and A.A. Toptsis},
KEY = {p-congint},
PAGES = {179--182},
PUBLISHER = {IEEE Press},
TITLE = {{Revisiting parallel speedup complexity}},
YEAR = {1992},

}

@inproceedings{BeFr92,
Author="J-C. Bermond and P. Fraigniaud",
Title="Broadcasting and {NP}-Completeness",
Booktitle="Graph Theory Notes of New York",
Pages="8--14",
Year="1992",
Volume="XXII",
Number="",
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BeFr92.pdf},

}

@inproceedings{BeSy92,
author = "J-C. Bermond and M. Syska",
booktitle = "Algorithmique Parall\`ele",
editor = "M. Cosnard, M. Nivat and Y. Robert",
pages = "149--158",
publisher = "Masson",
title = "Routage wormhole et canaux virtuels",
year = "1992",
PDF={http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BeSy92.pdf},

}

@INPROCEEDINGS{BeFe92,
AUTHOR = {P. Berthom\'e and A. Ferreira},
BOOKTITLE = {Parallel and Distributed Computing in Engineering Systems},
EDITOR = {S. Tzafestas and P. Borne and L. Grandinetti},
KEY = {p-congint},
PAGES = {123--128},
PUBLISHER = {IMACS - North Holland},
TITLE = {{Efficiently solving geometric problems on large hypercube multiprocessors}},
YEAR = {1992},

}

@INPROCEEDINGS{CoFe92,
AUTHOR = {M. Cosnard and A. Ferreira},
ADDRESS = {London (UK)},
BOOKTITLE = {invited paper, Proceedings of the International Conference on Parallel Computing -- ParCo'91},
EDITOR = {D.J. Evans and G.R. Joubert and H. Liddell},
PAGES = {3--18},
PUBLISHER = {Elsevier Science Publishers B.V.},
TITLE = {{Designing non-numerical parallel algorithms}},
YEAR = {1992},

}

@INPROCEEDINGS{DFG92,
AUTHOR = {T. Duboux and A. Ferreira and M. Gastaldo},
BOOKTITLE = {Parallel Processing: CONPAR 92 - VAPP V},
EDITOR = {L. Boug\'e et al.},
PAGES = {545--550},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{{MIMD} Dictionary Machines: from theory to practice}},
VOLUME = {634},
YEAR = {1992},

}

@INPROCEEDINGS{FeSo92b,
AUTHOR = {A. Ferreira and S. Song},
ADDRESS = {S\~ao Paulo (Br)},
BOOKTITLE = {LATIN '92},
EDITOR = {I. Simon},
KEY = {p-congint},
PAGES = {139--153},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{Achieving optimality for gate matrix layout and {PLA} folding: a graph theoretic approach}},
VOLUME = {384},
YEAR = {1992},

}

@INPROCEEDINGS{Fer92,
AUTHOR = {A. Ferreira},
ADDRESS = {Santiago - Chile},
BOOKTITLE = {Computer Science - Research and Applications},
EDITOR = {R. Baeza-Yates and U. Manber},
PAGES = {383--394},
PUBLISHER = {Plenum Press},
TITLE = {{Parallel search in sorted multisets, and {NP}-Complete problems}},
YEAR = {1992},

}

@inproceedings{MR1249504,
AUTHOR = {McDiarmid, C. and Reed, B. and Schrijver, A. and Shepherd, B.},
TITLE = {Noninterfering network flows},
BOOKTITLE = {Algorithm theory---SWAT '92 (Helsinki, 1992)},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {621},
PAGES = {245--257},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {1992},

}

@article {MR1109695,
AUTHOR = {Alon, N. and McDiarmid, C. and Reed, B.},
TITLE = {Acyclic coloring of graphs},
JOURNAL = {Random Structures Algorithms},
VOLUME = {2},
YEAR = {1991},
NUMBER = {3},
PAGES = {277--288},

}

@Article{BeKo91,
Author="J-C. Bermond and J-C. Konig",
Title="Un protocole distribu\'e pour la 2-connexit\'e",
Journal="TSI",
Pages="269--274",
Year="1991",
Volume="10",
Number="4",

}

@Article{BeTz91,
Author="J-C. Bermond and D. Tzvieli",
Title="Minimal diameter double loop networks, part {II}: dense optimal families",
Journal="Networks",
Year="1991",
Volume="21",
Pages="1--9" 
}

@ARTICLE{CoFe91,
AUTHOR = {M. Cosnard and A. Ferreira},
JOURNAL = {Parallel Processing Letters},
KEY = {j-journal},
NUMBER = {2},
PAGES = {103--111},
TITLE = {{On the real power of loosely coupled parallel architectures}},
VOLUME = {1},
YEAR = {1991},

}

@ARTICLE{Fer91,
AUTHOR = {A. Ferreira},
JOURNAL = {IEEE Transactions on Computers},
KEY = {j-journal},
NUMBER = {2},
PAGES = {221--225},
TITLE = {{A parallel time/hardware tradeoff {$T.H = O(2^{n/2})$} for the knapsack problem}},
VOLUME = {40},
YEAR = {1991},

}

@INPROCEEDINGS{CoFe91b,
AUTHOR = {M. Cosnard and A. Ferreira},
BOOKTITLE = {Advances in Computing and Information - ICCI '91},
EDITOR = {F. Dehne et al.},
KEY = {p-congint},
PAGES = {134--138},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{A tight bound for selection in {X+Y}}},
VOLUME = {497},
YEAR = {1991},

}

@INPROCEEDINGS{DFR91,
AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
ADDRESS = {St. Charles (USA)},
BOOKTITLE = {Proceedings of the International Conference on Parallel Processing -- ICPP'91},
KEY = {p-congint},
PAGES = {255--262},
TITLE = {{Efficient parallel construction and manipulation of pointer based quadtrees}},
YEAR = {1991},

}

@INPROCEEDINGS{FePe91,
AUTHOR = {A. Ferreira and J. Peters},
ADDRESS = {Vancouver (Ca)},
BOOKTITLE = {Proceedings of the Third Canadian Conference on Computational Geometry -- CCCG'91},
PAGES = {162--165},
TITLE = {{Finding the smallest path in a rectilinear polygon on a hypercube multiprocessor}},
YEAR = {1991},

}

@TECHREPORT { MuRa91,
AUTHOR = "P. Mussi and H. Rakotoarisoa",
INSTITUTION = "INRIA Sophia Antipolis",
MONTH = "Septembre",
NUMBER = "131",
TITLE = "PARall\'elisation sur r\'eseaux de Transputers de Simulations pour l'EVALuation de performances",
TYPE = "Rapport technique",
YEAR = "1991" 
}

@PHDTHESIS{these2,
AUTHOR = {A. Ferreira},
ADDRESS = {France},
MONTH = {Juanary},
SCHOOL = {Institut National Polytechnique de Grenoble},
TITLE = {{Contributions \`a la Recherche dans des Ensembles Ordonn\'es : du S\'equentiel au Parall\`ele}},
YEAR = {1990} 
}

@phdthesis{Mussi90,
title={Mod\`eles quantitatifs pour le Parall\'elisme},
AUTHOR = {P. Mussi},
MONTH = {May},
SCHOOL = {Universit\'e de Paris V},
YEAR = {1990} 
}

@Article{BHL90a,
Author="J-C. Bermond and K. Heinrich and M-L. Yu",
Title="Existence of resolvable path designs",
Journal="Journal Europeen de Combinatoire",
Year="1990",
Volume="11",
Pages="205--211" 
}

@Article{BHL90b,
Author="J-C. Bermond and K. Heinrich and M-L. Yu",
Title="On resolvable mixed path designs",
Journal="Journal Europeen de Combinatoire",
Year="1990",
Volume="11",
Pages="313--318" 
}

@ARTICLE{CDF90,
AUTHOR = {M. Cosnard and J. Duprat and A. Ferreira},
JOURNAL = {Information Processing Letters},
KEY = {j-journal},
NUMBER = {34},
PAGES = {103--109},
TITLE = {{The complexity of searching in {X+Y} and other multisets}},
YEAR = {1990},

}

@ARTICLE{DFR90,
AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
JOURNAL = {Parallel Computing},
KEY = {j-journal},
NUMBER = {1-3},
PAGES = {201--209},
TITLE = {{Parallel branch and bound on fine grained hypercube multiprocessors}},
VOLUME = {15},
YEAR = {1990},

}

@ARTICLE{triexp:j,
AUTHOR = {A. Ferreira and M. Gastaldo},
JOURNAL = {La Lettre du Transputer},
KEY = {qf-congnat},
NUMBER = {5},
PAGES = {311--21},
TITLE = {{Experimentations de deux algorithmes de tri sur un hypercube de transputers}},
YEAR = {1990},

}

@article {MR1053934,
AUTHOR = {Frieze, A. and McDiarmid, C. and Reed, B.},
TITLE = {Greedy matching on the line},
JOURNAL = {SIAM J. Comput.},
VOLUME = {19},
YEAR = {1990},
NUMBER = {4},
PAGES = {666--672},

}

@article {MR1138434,
AUTHOR = {McDiarmid, C. and Reed, B.},
TITLE = {Linear arboricity of random regular graphs},
JOURNAL = {Random Structures Algorithms},
VOLUME = {1},
YEAR = {1990},
NUMBER = {4},
PAGES = {443--445},

}

@InProceedings{ABS90,
Author="Alspach, B. and Bermond, J-C. and Sotteau, D.",
Title="Decomposition into cycles {I}: {H}amilton decompositions",
BookTitle="Proceedings of 1987 Cycles and Rays Colloquium, Montr{\'e}al",
Year="1990",
Pages="9--18",
Publisher="NATO ASI Ser. C, Kluwer Academic Publishers, Dordrech" PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/ABS90.pdf},

}

@InProceedings{BeBo90,
Author="J-C. Bermond and J. Bond",
Title="Combinatorial designs and hypergraphs of diameter one",
BookTitle="Proceedings of the firts China-US International Conference, Jinan, China, June 1986",
Year="1990",
Volume="576",
Pages="51--62",
Publisher="Annals of the New York Academy of Sciences",

}

@INPROCEEDINGS{BFZ90,
AUTHOR = {B. Braschi and A. Ferreira and J. Zerovnik},
BOOKTITLE = {Proceedings of the International Conference on Parallel Computing -- ParCo'89},
EDITOR = {D.J. Evans and G.R. Joubert and F.J. Peters},
KEY = {p-congint},
PAGES = {263--268},
PUBLISHER = {North-Holland},
TITLE = {{{On the asymptotic behaviour of parallel simulated annealing}}},
YEAR = {1990},

}

@INPROCEEDINGS{DFR90b,
AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
ADDRESS = {East-Berlin},
BOOKTITLE = {invited paper, Proceedings of the International Workshop on Parallel Processing by Cellular Automata and Arrrays (PARCELLA)},
EDITOR = {G. Wolf et al.},
KEY = {p-congint},
PAGES = {51--65},
TITLE = {{{Parallel AI algorithms for fine-grained hypercube multiprocessors}}},
VOLUME = {2},
YEAR = {1990},

}

@INPROCEEDINGS{DFR90c,
AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
ADDRESS = {Washington D.C.},
BOOKTITLE = {Proceedings of the IEEE International Conference on Tools for AI},
KEY = {p-congint},
PAGES = {660--666},
PUBLISHER = {IEEE Press},
TITLE = {{{A massively parallel knowledge-base server using a hypercube multiprocessor}}},
YEAR = {1990},

}

@MastersThesis{Liq90,
author = {Liquori, L},
title = {{Semantica e Pragmatica di un Linguaggio Funzionale con le Continuazioni Esplicite}},
year = {1990},
school = {University of Udine},
type = {Laurea in Science dell'Informazione},
note = {In Italian, 74 pp.} 
}

@article{MR1001383,
AUTHOR = {Bermond, J-C. and Berrada, K. and Bond, J.},
TITLE = {Extensions of networks with given diameter},
NOTE = {Graph theory and combinatorics (In honor of P. Erd\"os' 75, Cambridge, 1988)},
JOURNAL = {Discrete Math.},
VOLUME = {75},
YEAR = {1989},
NUMBER = {1-3},
PAGES = {31--40},
ISSN = {0012-365X},

}

@article{MR992988,
AUTHOR = {Bermond, J-C. and Favaron, O. and Mah{\'e}o, M.},
TITLE = {Hamiltonian decomposition of {C}ayley graphs of degree {$4$}},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {46},
YEAR = {1989},
NUMBER = {2},
PAGES = {142--153},
ISSN = {0095-8956},

}

@article{MR1000955,
AUTHOR = {Bermond, J-C. and Fourneau, J.-M.},
TITLE = {Independent connections: an easy characterization of baseline-equivalent multistage interconnection networks},
JOURNAL = {Theoret. Comput. Sci.},
VOLUME = {64},
YEAR = {1989},
NUMBER = {2},
PAGES = {191--201},
ISSN = {0304-3975},

}

@article{MR998267,
AUTHOR = {Bermond, J-C. and Homobono, N. and Peyrat, C.},
TITLE = {Large fault-tolerant interconnection networks},
JOURNAL = {Graphs Combin.},
VOLUME = {5},
YEAR = {1989},
NUMBER = {2},
PAGES = {107--123},
ISSN = {0911-0119},

}

@article{BePe89b,
AUTHOR = {Bermond, J-C. and Peyrat, C.},
TITLE = {Induced subgraphs of the power of a cycle},
JOURNAL = {SIAM J. Discrete Math.},
VOLUME = {2},
YEAR = {1989},
NUMBER = {4},
PAGES = {452--455},
ISSN = {0895-4801},

}

@ARTICLE{CDF89,
AUTHOR = {M. Cosnard and J. Duprat and A. Ferreira},
JOURNAL = {Theoretical Computer Science},
KEY = {j-journal},
PAGES = {115--120},
TITLE = {{{Complexity of selection in {X+Y}}}},
VOLUME = {67},
YEAR = {1989},

}

@ARTICLE{CoFe89,
AUTHOR = {M. Cosnard and A. Ferreira},
JOURNAL = {The Computer Journal},
KEY = {j-journal},
NUMBER = {6},
PAGES = {571--573},
TITLE = {{Generating Permutations on a {VLSI} Suitable Linear Network}},
VOLUME = {32},
YEAR = {1989},

}

@article {MR989133,
AUTHOR = {Ho{\`a}ng, C. T. and Reed, B. A.},
TITLE = {{$P\sb 4$}-comparability graphs},
NOTE = {Graph colouring and variations},
JOURNAL = {Discrete Math.},
VOLUME = {74},
YEAR = {1989},
NUMBER = {1-2},
PAGES = {173--200},

}

@article {MR1010579,
AUTHOR = {Ho{\`a}ng, C. T. and Reed, B. A.},
TITLE = {Some classes of perfectly orderable graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {13},
YEAR = {1989},
NUMBER = {4},
PAGES = {445--463},

}

@article {MR1006990,
AUTHOR = {McDiarmid, C. J. H. and Reed, B. A.},
TITLE = {Building heaps fast},
JOURNAL = {J. Algorithms},
VOLUME = {10},
YEAR = {1989},
NUMBER = {3},
PAGES = {352--365},

}

@inproceedings{MR1018608,
AUTHOR = {Bermond, J-C. and Illiades, G. and Peyrat, C.},
TITLE = {An optimization problem in distributed loop computer networks},
BOOKTITLE = {Combinatorial Mathematics: Proceedings of the Third International Conference (New York, 1985)},
SERIES = {Ann. New York Acad. Sci.},
VOLUME = {555},
PAGES = {45--55},
PUBLISHER = {New York Acad. Sci.},
ADDRESS = {New York},
YEAR = {1989},

}

@inproceedings{BeKo89,
author = {Bermond, J-C. and Konig, J-C.},
title = {General and efficient decentralized consensus protocols II},
booktitle = {Proc. of the International Workshop on Parallel and distributed algorithms, Bonas, France},
year = {1989},
publisher = {North-Holland},
pages = {199--210},

}

@InProceedings{BePe89,
Author={Bermond, J-C. and Peyrat, C.},
Title={De {B}ruijn and {K}autz networks: a competitor for the hypercube?},
BookTitle={Proceedings of the 1st European Workshop on Hypercubes and Distributed Computers, Rennes},
Year={1989},
Pages={279--293},
Editor={F. Andr\'e and J-P. Verjus},
Publisher={North Holland},

}

@INPROCEEDINGS{CoFe89b,
AUTHOR = {M. Cosnard and A. Ferreira},
BOOKTITLE = {Proceedings of the International Conference on Parallel Processing -- ICPP'89},
EDITOR = {F.Ris and P.M.Kogge},
KEY = {p-congint},
PAGES = {16--19},
PUBLISHER = {Penn State University Press},
TITLE = {{Parallel algorithms for searching in {X+Y}}},
VOLUME = {3},
YEAR = {1989},

}

@INPROCEEDINGS{DFR89b,
AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
BOOKTITLE = {Proceedings of the 27th Annual Allerton Conference on Communication, Control and Computing},
KEY = {p-congint},
MONTH = {October},
PAGES = {1084--1093},
TITLE = {{{Parallel fractional cascading on a hypercube multiprocessor}}},
YEAR = {1989},

}

@INPROCEEDINGS{DFR89,
AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
ADDRESS = {Herndon, VA (USA)},
BOOKTITLE = {Proceedings of the IEEE Workshop on Tools for AI},
KEY = {p-congint},
PAGES = {616--622},
PUBLISHER = {IEEE Press},
TITLE = {{{Parallel branch and bound on fine grained hypercube multiprocessors}}},
YEAR = {1989},

}

@INPROCEEDINGS{FeGa89,
AUTHOR = {A. Ferreira and M. Gastaldo},
BOOKTITLE = {Hypercube and Distributed Computers},
EDITOR = {F. Andr\'e et J.-P. Verjus},
KEY = {p-congint},
PAGES = {359--360},
PUBLISHER = {INRIA-North-Holland},
TITLE = {{{Implementing sorting on a hypercube}}},
YEAR = {1989},

}

@INPROCEEDINGS{Fer89,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Parallel and Distributed Algorithms},
EDITOR = {M. Cosnard et al.},
KEY = {p-congint},
PAGES = {145--152},
PUBLISHER = {North-Holland},
TITLE = {{The Knapsack Problem on Parallel Architectures}},
YEAR = {1989},

}

@inproceedings{LiMu89,
author = {Z. Liu and P. Mussi},
booktitle = {International Conference on Super Computing},
location = {Heraklion, Greece},
title = {Performance evaluation of a deadlock free protocol for blocking rings},
year = {1989},
month = {June} 
}

@TECHREPORT{IMSE552,
AUTHOR = "F. Baccelli and M. Badel and A. Jean-Marie and Z. Liu and P. Mussi",
INSTITUTION = "INRIA Sophia Antipolis",
TITLE = "Specifications for Synchronization Primitives in the QNET Tool",
YEAR = "1989" 
}

@TECHREPORT{plaabs:j,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Advances in Optimization and Control},
EDITOR = {H.A.Eiseltand G.Pederzoli},
JOURNAL = {Zentralblatt f\"ur Mathematik},
KEY = {x},
NOTE = {(abstract)},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Economics and Math. Systems},
TITLE = {{An optimal ${O(n^2)}$ algorithm to fold special {PLA's}}},
VOLUME = {655.90029},
YEAR = {1989} 
}

@TECHREPORT{IMSE556,
AUTHOR = "P. Mussi and P. Nain",
INSTITUTION = "INRIA Sophia Antipolis",
TITLE = "On New Product-Form Queueing Network Stations",
YEAR = "1989" 
}

@TECHREPORT{IMSE553,
AUTHOR = "P. Mussi and P. Nain",
INSTITUTION = "INRIA Sophia Antipolis",
TITLE = "Description and Specifications for New Product-Form Queueing Network Stations",
YEAR = "1989" 
}

@article{MR983247,
AUTHOR = {Bermond, J-C. and Fourneau, J.-M. and Jean-Marie, A.},
TITLE = {A graph theoretical approach to equivalence of multistage interconnection networks},
JOURNAL = {Discrete Appl. Math.},
VOLUME = {22},
YEAR = {1988/89},
NUMBER = {3},
PAGES = {201--214},
ISSN = {0166-218X},

}

@article{MR992909,
AUTHOR = {Bermond, J-C. and Peyrat, C.},
TITLE = {Broadcasting in de {B}ruijn networks},
NOTE = {Nineteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Baton Rouge, LA, 1988)},
JOURNAL = {Congr. Numer.},
VOLUME = {66},
YEAR = {1988},
PAGES = {283--292},
ISSN = {0384-9864},

}

@article {MR958437,
AUTHOR = {Bertschi, M. and Reed, B. A.},
TITLE = {Erratum: ``{A} note on even pairs'' [{D}iscrete {M}ath.\ {\bf 65} (1987), no.\ 3, 317--318; {MR}0897656 (88f:05066)] by {R}eed},
JOURNAL = {Discrete Math.},
VOLUME = {71},
YEAR = {1988},
NUMBER = {2},
PAGES = {187},

}

@ARTICLE{CFH88,
AUTHOR = {M. Cosnard and A. Ferreira and H. Herbelin},
JOURNAL = {Parallel Computing},
KEY = {j-journal},
NUMBER = {9},
PAGES = {385--388},
TITLE = {{The Two-List Algorithm for the Knapsack Problem on a {FPS T20}}},
YEAR = {1988},

}

@article {MR961145,
AUTHOR = {Frieze, A. M. and Jackson, B. and McDiarmid, C. J. H. and Reed, B.},
TITLE = {Edge-colouring random graphs},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {45},
YEAR = {1988},
NUMBER = {2},
PAGES = {135--149},

}

@article {MR956196,
AUTHOR = {Monma, C. L. and Reed, B. and Trotter, Jr., W. T.},
TITLE = {Threshold tolerance graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {12},
YEAR = {1988},
NUMBER = {3},
PAGES = {343--362},

}

@inproceedings{BeFo88,
author = {Bermond, J-C. and Fourneau, J.-M.},
title= {Independent connections: an easy characterization of baseline equivalent multistage interconnection networks},
booktitle={Int. Conf. on Parallel Processing},
month = {August},
year = {1988},

}

@inproceedings{MR1018423,
AUTHOR = {Bermond, J-C. and K{\"o}nig, J-C. and Raynal, M.},
TITLE = {General and efficient decentralized consensus protocols},
BOOKTITLE = {Distributed algorithms (Amsterdam, 1987)},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {312},
PAGES = {41--56},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {1988},

}

@INPROCEEDINGS{CoFe88,
AUTHOR = {M. Cosnard and A. Ferreira},
BOOKTITLE = {Parallel Processing and Applications},
EDITOR = {E. Chiricozzi and A. D'Amico},
KEY = {p-congint},
PAGES = {141--147},
PUBLISHER = {North-Holland},
TITLE = {{A processor network for generating all the permutations}},
YEAR = {1988},

}

@INPROCEEDINGS{Fer88,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Parallel Processing},
EDITOR = {M. Cosnard et al.},
KEY = {p-congint},
PAGES = {169--179},
PUBLISHER = {IFIP-North Holland},
TITLE = {{Efficient parallel algorithms for the knapsack problem}},
YEAR = {1988},

}

@INPROCEEDINGS{Fer88b,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Advances in Optimization and Control},
EDITOR = {H.A.Eiselt and G.Pederzoli},
KEY = {p-congint},
PAGES = {92--102},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Economics and Math. Systems},
TITLE = {{An optimal ${O(n^2)}$ algorithm to fold special {PLA's}}},
VOLUME = {302},
YEAR = {1988},

}

@article{MR920635,
AUTHOR = {Bermond, J-C. and Bond, J. and Sotteau, D.},
TITLE = {On regular packings and coverings},
journal = { Annals of Discrete mathematics},
VOLUME = {34},
PAGES = {81--100},
YEAR = {1987},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BBS87.pdf},

}

@article{BFJ87,
author = {Bermond, J-C. and Fourneau, J.-M. and Jean-Marie, A.},
title = {Equivalence of multistage interconnection networks},
journal = {Information Processing Letters},
volume = {26},
year = {1987},
pages = {45--50},

}

@article {MR900933,
AUTHOR = {Ho{\`a}ng, C. T. and Reed, B.},
TITLE = {A note on short cycles in digraphs},
JOURNAL = {Discrete Math.},
VOLUME = {66},
YEAR = {1987},
NUMBER = {1-2},
PAGES = {103--107},

}

@article {MR897656,
AUTHOR = {Reed, B. A.},
TITLE = {A note on even pairs},
JOURNAL = {Discrete Math.},
VOLUME = {65},
YEAR = {1987},
NUMBER = {3},
PAGES = {317--318},

}

@article {MR904406,
AUTHOR = {Reed, B.},
TITLE = {A semistrong perfect graph theorem},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {43},
YEAR = {1987},
NUMBER = {2},
PAGES = {223--240},

}

@ARTICLE{BaMu86,
AUTHOR = {F. Baccelli and P. Mussi},
JOURNAL = {{ IEEE Transactions on Computers}},
PUBLISHER= {IEEE},
TITLE = {{An asynchronous parallel interpreter for arithmetic expressions and its evaluation}},
MONTH={March},
YEAR = {1986},
PAGES={245--256},
VOLUME = {C35-3} 
}

@article{BDQ86,
author = {J-C. Bermond and C. Delorme and J.-J. Quisquater},
title = {Strategies for interconnection networks: some methods from graph theory},
journal = {J. Parallel Distributed Computing},
volume = {3},
number = {4},
year = {1986},
issn = {0743-7315},
pages = {433--449},
url = {http://dx.doi.org/10.1016/0743-7315(86)90008-0},
publisher = {Academic Press, Inc.},
address = {Orlando, FL, USA},

}

@article{BePa86,
author={Bermond, J-C. and Paoli, M.},
title={Research problem: Hamilton powers of graphs},
journal={Discrete Mathematics},
volume={62},
year={1986},
pages={329--331},

}

@inproceedings{BBP86,
author={Bermond, J-C. and Bond, J. and Peyrat, C.},
title={Interconnection networks with each node on two buses in Parallel Algorithms and Architectures},
booktitle={Proceedings InTernational Workshop on Parallel Algorithms and Architectures},
month={April},
year={1986},
publisher={North Holland},
pages={155--167},

}

@INPROCEEDINGS{pla2:cn,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Proceedings of the 6th Brazilian Congress on Computer Science},
KEY = {qf-congnat},
PUBLISHER = {University of Pernambuco Press},
TITLE = {{O problema do dobramento optimal de {PLA's}: uma nova abordagem e seu algoritmo}},
YEAR = {1986},

}

@inproceedings {MR885307,
AUTHOR = {Monma, C. L. and Reed, B. and Trotter, Jr., W. T.},
TITLE = {A generalization of threshold graphs with tolerances},
BOOKTITLE = {Proceedings of the seventeenth Southeastern international conference on combinatorics, graph theory, and computing (Boca Raton, Fla., 1986)},
JOURNAL = {Congr. Numer.},
VOLUME = {55},
YEAR = {1986},
PAGES = {187--197},

}

@MASTERSTHESIS{these1,
AUTHOR = {A. Ferreira},
ADDRESS = {Brazil},
SCHOOL = {Instituto de Matem\'atica e Estat{\'\i}stica da Universidade de S\~ao Paulo},
TITLE = {{{\em O Problema do Dobramento Optimal de {PLA's}}}},
YEAR = {1986} 
}

@article {MR787499,
AUTHOR = {Reed, B.},
TITLE = {A note on the semistrong perfect graph conjecture},
JOURNAL = {Discrete Math.},
VOLUME = {54},
YEAR = {1985},
NUMBER = {1},
PAGES = {111--112},

}

@inproceedings{MR812658,
AUTHOR = {Bermond, J-C. and Memmi, G.},
TITLE = {A graph theoretical characterization of minimal deadlocks in {P}etri nets},
BOOKTITLE = {Graph theory with applications to algorithms and computer science (Kalamazoo, Mich., 1984)},
SERIES = {Wiley-Intersci. Publ.},
PAGES = {73--87},
PUBLISHER = {Wiley},
ADDRESS = {New York},
YEAR = {1985},

}

@INPROCEEDINGS{pla1:cn,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Proceedings of the 5th Brazilian Symposium of Microelectronics},
KEY = {qf-congnat},
PUBLISHER = {University of S\~ao Paulo Press},
TITLE = {{Algoritmos heur{\'\i}sticos para otimiza{\c c\~ao} de {PLA's}}},
YEAR = {1985},

}

@inproceedings{JaMaMu85,
author = {W. Jalby and J. Maillard and P. Mussi},
booktitle = {Parallel Computing 85},
pages = 279--285,
title = {Evaluation of Parallel Execution of Program Tree Structures},
year = {1985},

}

@article{MR742385,
AUTHOR = {Bermond, J-C. and Delorme, C. and Farhi, G.},
TITLE = {Large graphs with given degree and diameter. {II}},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {36},
YEAR = {1984},
NUMBER = {1},
PAGES = {32--48},
ISSN = {0095-8956},

}

@article{MR772276,
AUTHOR = {Bermond, J-C. and Fouquet, J.-L. and Habib, M. and P{\'e}roche, B.},
TITLE = {On linear {$k$}-arboricity},
JOURNAL = {Discrete Math.},
VOLUME = {52},
YEAR = {1984},
NUMBER = {2-3},
PAGES = {123--132},
ISSN = {0012-365X},

}

@article{MR747707,
AUTHOR = {Bermond, J-C. and Las Vergnas, M.},
TITLE = {Regular factors in nearly regular graphs},
JOURNAL = {Discrete Math.},
VOLUME = {50},
YEAR = {1984},
NUMBER = {1},
PAGES = {9--13},
ISSN = {0012-365X},

}

@ARTICLE{FHBM84,
AUTHOR = {M. H\'ebert and P. Mussi and O. Faugeras and J.-D. Boissonnat},
JOURNAL = {{Computer Vision, Graphics, and Image Processing}},
TITLE = {{Polyhedral Approximation of 3-D Objects without Holes}},
YEAR = {1984},
VOLUME = 25 
}

@inproceedings{MR777161,
AUTHOR = {Bermond, J-C. and Bond, J. and Sacl{\'e}, J.-F.},
TITLE = {Large hypergraphs of diameter {$1$}},
BOOKTITLE = {Graph theory and combinatorics (Cambridge, 1983)},
PAGES = {19--28},
PUBLISHER = {Academic Press},
ADDRESS = {London},
YEAR = {1984},

}

@inproceedings{MuNa84,
author = {P. Mussi and P. Nain},
booktitle = {ACM SIGMETRICS Conference on Measurement and Modeling},
month = {August},
publisher = {ACM},
title = {Evaluation of Parallel Execution of Program Tree Structures},
year = {1984},
volume = 12,
number = 3,
location = {Cambridge, MA} 
}

@incollection{MR721179,
AUTHOR = {Bermond, J-C. and Bond, J. and Paoli, M. and Peyrat, C.},
TITLE = {Graphs and interconnection networks: diameter and vulnerability},
BOOKTITLE = {Surveys in combinatorics (Southampton, 1983)},
SERIES = {London Math. Soc. Lecture Note Ser.},
VOLUME = {82},
PAGES = {1--30},
PUBLISHER = {Cambridge Univ. Press},
ADDRESS = {Cambridge},
YEAR = {1983},

}

@article{MR735197,
AUTHOR = {Bermond, J-C. and Jackson, B. and Jaeger, F.},
TITLE = {Shortest coverings of graphs with cycles},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {35},
YEAR = {1983},
NUMBER = {3},
PAGES = {297--308},
ISSN = {0095-8956},

}

@inproceedings{MR841281,
AUTHOR = {Bermond, J-C. and Delorme, C. and Quisquater, J.-J.},
TITLE = {Grands graphes de degr\'e et diam\`etre fix\'es},
BOOKTITLE = {Combinatorial mathematics (Marseille-Luminy, 1981)},
SERIES = {North-Holland Math. Stud.},
VOLUME = {75},
PAGES = {65--73},
PUBLISHER = {North-Holland},
ADDRESS = {Amsterdam},
YEAR = {1983},

}

@incollection{MR671900,
AUTHOR = {Bermond, J-C. and Delorme, C. and Farhi, G.},
TITLE = {Large graphs with given degree and diameter. {III}},
BOOKTITLE = {Graph theory},
NOTE = {Pr\'esent\'e au Colloque Cambridge, England, 1981},
SERIES = {North-Holland Math. Stud.},
VOLUME = {62},
PAGES = {23--31},
PUBLISHER = {North-Holland},
ADDRESS = {Amsterdam},
YEAR = {1982},

}

@incollection{MR806968,
AUTHOR = {Bermond, J-C. and Farhi, G.},
TITLE = {Sur un probl\`eme combinatoire d'antennes en radioastronomie. {II}},
BOOKTITLE = {Theory and practice of combinatorics},
SERIES = {North-Holland Math. Stud.},
VOLUME = {60},
PAGES = {49--53},
PUBLISHER = {North-Holland},
ADDRESS = {Amsterdam},
YEAR = {1982},

}

@article{MR678026,
AUTHOR = {Bermond, J-C. and Delorme, C. and Quisquater, J.-J.},
TITLE = {Tables of large graphs with given degree and diameter},
JOURNAL = {Inform. Process. Lett.},
VOLUME = {15},
YEAR = {1982},
NUMBER = {1},
PAGES = {10--13},
ISSN = {0020-0190},

}

@article{MR647983,
AUTHOR = {Bermond, J-C. and Germa, A. and Heydemann, M.-C. and Sotteau, D.},
TITLE = {Longest paths in digraphs},
JOURNAL = {Combinatorica},
VOLUME = {1},
YEAR = {1981},
NUMBER = {4},
PAGES = {337--341},
ISSN = {0209-9683},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BGHS81.pdf},

}

@article{MR604304,
AUTHOR = {Bermond, J-C. and Thomassen, C.},
TITLE = {Cycles in digraphs---a survey},
JOURNAL = {J. Graph Theory},
VOLUME = {5},
YEAR = {1981},
NUMBER = {1},
PAGES = {1--43},
ISSN = {0364-9024},

}

@inproceedings{MR681867,
AUTHOR = {Bermond, J-C. and Bollob{\'a}s, B.},
TITLE = {The diameter of graphs---a survey},
BOOKTITLE = {Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, Vol. I (Baton Rouge, La., 1981)},
JOURNAL = {Congr. Numer.},
VOLUME = {32},
YEAR = {1981},
PAGES = {3--27},
ISSN = {0384-9864},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BeBo81.pdf},

}

@article{MR573645,
AUTHOR = {Bermond, J-C. and Frankl, P. and Sterboul, F.},
TITLE = {On the maximum number of edges in a hypergraph whose linegraph contains no cycle},
JOURNAL = {Discrete Math.},
VOLUME = {30},
YEAR = {1980},
NUMBER = {3},
PAGES = {295--298},
ISSN = {0012-365X},

}

@article{MR584678,
AUTHOR = {Bermond, J-C. and Germa, A. and Heydemann, M.-C. and Sotteau, D.},
TITLE = {Girth in digraphs},
JOURNAL = {J. Graph Theory},
VOLUME = {4},
YEAR = {1980},
NUMBER = {3},
PAGES = {337--341},
ISSN = {0364-9024},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BGHS80.pdf},

}

@article{MR598914,
AUTHOR = {Bermond, J-C. and Huang, C. and Rosa, A. and Sotteau, D.},
TITLE = {Decomposition of complete graphs into isomorphic subgraphs with five vertices},
JOURNAL = {Ars Combin.},
VOLUME = {10},
YEAR = {1980},
PAGES = {211--254},
ISSN = {0381-7032},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BHRS80.pdf},

}

@article{MR597188,
AUTHOR = {Bermond, J-C. and Sotteau, D. and Germa, A. and Heydemann, M.-C.},
TITLE = {Chemins et circuits dans les graphes orient\'es},
NOTE = {Pr\'esent\'e au Colloque Combinatorics 79, Univ. Montr\'eal, Montreal, Canada, 1979},
JOURNAL = {Ann. Discrete Math.},
VOLUME = {8},
YEAR = {1980},
PAGES = {293--309},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BSGH80pdf},

}

@InBook{Ber79,
author = {Bermond, J-C.},
editor = {L. Beineke and R. Wilson},
title = {Hamiltonian Graphs},
chapter = {6},
publisher = {Academic Press},
year = {1979},
OPTkey = {},
OPTvolume = {},
OPTnumber = {},
series = {Selected Topics in Graph Theory},
OPTtype = {},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
pages = {127-167},
OPTnote = {},
OPTannote = {} 
}

@article{MR555158,
AUTHOR = {Bermond, J-C. and Germa, A. and Heydemann, M.-C.},
TITLE = {Hamiltonian cycles in strong products of graphs},
JOURNAL = {Canad. Math. Bull.},
VOLUME = {22},
YEAR = {1979},
NUMBER = {3},
PAGES = {305--309},
ISSN = {0008-4395},

}

@article{MR530289,
AUTHOR = {Bermond, J-C. and Germa, A. and Sotteau, D.},
TITLE = {Resolvable decomposition of {$K\sp{\ast} \sb{n}$}},
JOURNAL = {J. Combin. Theory Ser. A},
VOLUME = {26},
YEAR = {1979},
NUMBER = {2},
PAGES = {179--185},
ISSN = {0097-3165},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BGS79.pdf},

}

@article{MR522008,
AUTHOR = {Bermond, J-C. and Marczyk, Anton},
TITLE = {Comparaison des puissances de graphes},
JOURNAL = {C. R. Acad. Sci. Paris S\'er. A-B},
VOLUME = {288},
YEAR = {1979},
NUMBER = {1},
PAGES = {A13--A15},
ISSN = {0151-0509},

}

@article{MR557475,
AUTHOR = {Bermond, J-C. and Sim oes-Pereira, J. M. S. and Zamfirescu, Christina M.},
TITLE = {On non-{H}amiltonian homogeneously traceable digraphs},
JOURNAL = {Math. Japon.},
VOLUME = {24},
YEAR = {1979/80},
NUMBER = {4},
PAGES = {423--426},
ISSN = {0025-5513},

}

@inproceedings{MR587620,
AUTHOR = {Bermond, J-C.},
TITLE = {Graceful graphs, radio antennae and {F}rench windmills},
BOOKTITLE = {Graph theory and combinatorics (Proc. Conf., Open Univ., Milton Keynes, 1978)},
SERIES = {Res. Notes in Math.},
VOLUME = {34},
PAGES = {18--37},
PUBLISHER = {Pitman},
ADDRESS = {Boston, Mass.},
YEAR = {1979},

}

@article{MR543175,
AUTHOR = {Bermond, J-C. and Germa, A. and Heydemann, M.-C.},
TITLE = {Graphes repr\'esentatifs d'hypergraphes},
NOTE = {Pr\'esent\'e au Colloque Math\'ematiques Discr\`etes: Codes et Hypergraphes, Brussels, 1978},
JOURNAL = {Cahiers Centre \'Etudes Rech. Op\'er.},
VOLUME = {20},
YEAR = {1978},
NUMBER = {3-4},
PAGES = {325--329},
ISSN = {0008-9737},

}

@article{MR504873,
AUTHOR = {Bermond, J-C. and Huang, C. and Sotteau, D.},
TITLE = {Balanced cycle and circuit designs: even cases},
JOURNAL = {Ars Combin.},
VOLUME = {5},
YEAR = {1978},
PAGES = {293--318},
ISSN = {0381-7032},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BHS78.pdf},

}

@article{MR0505807,
AUTHOR = {Bermond, J-C.},
TITLE = {Hamiltonian decompositions of graphs, directed graphs and hypergraphs},
NOTE = {Pr\'esent\'e au Cambridge Combinatorial Conf., Advances in graph theory , Trinity College, Cambridge, England, 1977},
JOURNAL = {Ann. Discrete Math.},
VOLUME = {3},
YEAR = {1978},
PAGES = {21--28},

}

@inproceedings{MR539935,
AUTHOR = {Bermond, J-C.},
TITLE = {Le probl\`eme des ``ouvroirs''},
BOOKTITLE = {Probl\`emes combinatoires et th\'eorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976)},
SERIES = {Colloq. Internat. CNRS},
VOLUME = {260},
PAGES = {31--34},
PUBLISHER = {CNRS},
ADDRESS = {Paris},
YEAR = {1978},

}

@inproceedings{MR539936,
AUTHOR = {Bermond, J-C. and Brouwer, A. E. and Germa, A.},
TITLE = {Syst\`emes de triplets et diff\'erences associ\'ees},
BOOKTITLE = {Probl\`emes combinatoires et th\'eorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976)},
SERIES = {Colloq. Internat. CNRS},
VOLUME = {260},
PAGES = {35--38},
PUBLISHER = {CNRS},
ADDRESS = {Paris},
YEAR = {1978},

}

@inproceedings{MR539937,
AUTHOR = {Bermond, J-C. and Germa, A. and Heydemann, M.-C. and Sotteau, D.},
TITLE = {Hypergraphes hamiltoniens},
BOOKTITLE = {Probl\`emes combinatoires et th\'eorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976)},
SERIES = {Colloq. Internat. CNRS},
VOLUME = {260},
PAGES = {39--43},
PUBLISHER = {CNRS},
ADDRESS = {Paris},
YEAR = {1978},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BGHS78.pdf},

}

@inproceedings{MR519261,
AUTHOR = {Bermond, J-C. and Kotzig, A. and Turgeon, J.},
TITLE = {On a combinatorial problem of antennas in radioastronomy},
BOOKTITLE = {Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. I},
SERIES = {Colloq. Math. Soc. J\'anos Bolyai},
VOLUME = {18},
PAGES = {135--149},
PUBLISHER = {North-Holland},
ADDRESS = {Amsterdam},
YEAR = {1978},

}

@article{MR0457287,
AUTHOR = {Bermond, J-C. and Frankl, P.},
TITLE = {On a conjecture of {C}hv\'atal on {$m$}-intersecting hypergraphs},
JOURNAL = {Bull. London Math. Soc.},
VOLUME = {9},
YEAR = {1977},
NUMBER = {3},
PAGES = {310--312},
ISSN = {0024-6093},

}

@article{MR0472571,
AUTHOR = {Bermond, J-C. and Germa, A. and Sotteau, D.},
TITLE = {Hypergraph-designs},
JOURNAL = {Ars Combinatoria},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BGS77.pdf},
VOLUME = {3},
YEAR = {1977},
PAGES = {47--66},
ISSN = {0381-7032},

}

@article{MR0463003,
AUTHOR = {Bermond, J-C. and Heydemann, M.-C. and Sotteau, D.},
TITLE = {Line graphs of hypergraphs. {I}},
JOURNAL = {Discrete Math.},
VOLUME = {18},
YEAR = {1977},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BHS77.pdf},
NUMBER = {3},
PAGES = {235--241},
ISSN = {0012-365X},

}

@article{MR0480188,
AUTHOR = {Bermond, J-C. and Sch{\"o}nheim, J.},
TITLE = {{$G$}-decomposition of {$K\sb{n}$}, where {$G$} has four vertices or less},
JOURNAL = {Discrete Math.},
VOLUME = {19},
YEAR = {1977},
NUMBER = {2},
PAGES = {113--120},
ISSN = {0012-365X},

}

@inproceedings{MR599763,
AUTHOR = {Bermond, J-C. and Sotteau, D.},
TITLE = {Cycle and circuit designs odd case},
BOOKTITLE = {Contributions to graph theory and its applications (Internat. Colloq., Oberhof, 1977) (Germany)},
PAGES = {11--32},
PUBLISHER = {Tech. Hochschule Ilmenau},
ADDRESS = {Ilmenau},
YEAR = {1977},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BeSo77.pdf},

}

@article{MR0429627,
AUTHOR = {Bermond, J-C. and Faber, V.},
TITLE = {Decomposition of the complete directed graph into {$k$}-circuits},
JOURNAL = {J. Combinatorial Theory Ser. B},
VOLUME = {21},
YEAR = {1976},
NUMBER = {2},
PAGES = {146--155},

}

@article{MR0416971,
AUTHOR = {Bermond, J-C. and Kodratoff, Y.},
TITLE = {Une heuristique pour le calcul de l'indice de transitivit\'e d'un tournoi},
JOURNAL = {Rev. Fran\c caise Automat. Informat. Recherche Op\'erationnelle S\'er. Rouge Informat. Th\'eor.},
VOLUME = {10},
YEAR = {1976},
NUMBER = {R-1},
PAGES = {83--92},

}

@article{MR0396273,
TITLE = {Unsolved problems},
PAGES = {678--696. Congressus Numerantium, No. XV},
NOTE = {Chairman: P. Erd\H os, With contributions by C. C. Chen, D. E. Daykin, B. Bollob\'as, P. Erd\H os, A. Frank, A. Gardiner, F. Jaeger, A. Bondy, L. Lov\'asz, A. Recski, S. Maurer, A. R\'enyi, C. St. J. A. Nash-Williams, B. Recam\'an, D. A. Waller, D. D. Grant, M. Las Vergnas, S. E. Eldridge, A. D. Keedwell, J. Sheehan, A. J. W. Hilton, J-C. Bermond, R. J. Wilson, J. A. Bondy, and R. L. Hemminger},
YEAR = {1976},

}

@inproceedings{MR0398891,
AUTHOR = {Bermond, J-C.},
TITLE = {On {H}amiltonian walks},
BOOKTITLE = {Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975)},
PAGES = {41--51. Congressus Numerantium, No. XV},
PUBLISHER = {Utilitas Math.},
ADDRESS = {Winnipeg, Man.},
YEAR = {1976},

}

@inproceedings{MR0450102,
AUTHOR = {Bermond, J-C. and Sotteau, D.},
TITLE = {Graph decompositions and {$G$}-designs},
BOOKTITLE = {Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975)},
PAGES = {53--72. Congressus Numerantium, No. XV},
PUBLISHER = {Utilitas Math.},
ADDRESS = {Winnipeg, Man.},
YEAR = {1976},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BeSo76.pdf} 
}

@incollection{MR0382044,
TITLE = {Problems},
BOOKTITLE = {Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague, 1974)},
PAGES = {541--544},
NOTE = {Contributed by P. Erd\H os, M. Simonovits, V. T. S\'os, L. Lov\'asz, J-C. Bermond, G. O. H. Katona, T. Tarj\'an, R. A. Brualdi, L. S. Mel' nikov and B. Toft},
PUBLISHER = {Academia},
ADDRESS = {Prague},
YEAR = {1975},

}

@article{MR0406865,
AUTHOR = {Bermond, J-C. and Meyer, J. C.},
TITLE = {Hypergraphes et configurations},
NOTE = {Pr\'esent\'e au Colloque sur la Th\'eorie des Graphes, Paris, 1974},
JOURNAL = {Cahiers Centre \'Etudes Recherche Op\'er.},
VOLUME = {17},
YEAR = {1975},
NUMBER = {2-4},
PAGES = {137--154},
ISSN = {0774-3068},

}

@article{MR0404040,
AUTHOR = {Bermond, J-C.},
TITLE = {{$1$}-graphes r\'eguliers minimaux de girth donn\'e},
NOTE = {Pr\'esent\'e au Colloque sur la Th\'eorie des Graphes, Paris, 1974},
JOURNAL = {Cahiers Centre \'Etudes Recherche Op\'er.},
VOLUME = {17},
YEAR = {1975},
NUMBER = {2-4},
PAGES = {125--135},
ISSN = {0774-3068},

}

@inproceedings{MR0409276,
AUTHOR = {Bermond, J-C.},
TITLE = {Decomposition of {$K\sp*\sb{n}$} into {$k$}-circuits and balanced {$G$}-designs},
BOOKTITLE = {Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague, 1974)},
PAGES = {57--68},
PUBLISHER = {Academia},
ADDRESS = {Prague},
YEAR = {1975},

}

@inproceedings{MR0396319,
AUTHOR = {Bermond, J-C.},
TITLE = {The circuit-hypergraph of a tournament},
BOOKTITLE = {Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erd\H os on his 60th birthday), Vol. I},
PAGES = {165--180. Colloq. Math. Soc. J\'anos Bolyai, Vol. 10},
PUBLISHER = {North-Holland},
ADDRESS = {Amsterdam},
YEAR = {1975},

}

@article{MR0392642,
AUTHOR = {Bermond, J-C.},
TITLE = {Nombre chromatique total du graphe {$r$}-parti complet},
JOURNAL = {J. London Math. Soc. (2)},
VOLUME = {9},
YEAR = {1974/75},
PAGES = {279--285},
ISSN = {0024-6107},

}

@article{MR0416967,
AUTHOR = {Bermond, J-C.},
TITLE = {Some {R}amsey numbers for directed graphs},
JOURNAL = {Discrete Math.},
VOLUME = {9},
YEAR = {1974},
PAGES = {313--321},
ISSN = {0012-365X},

}

@article{MR0340094,
AUTHOR = {Bermond, J-C.},
TITLE = {An application of the solution of {K}irkman's schoolgirl problem: the decomposition of the symmetric oriented complete graph into {$3$}-circuits},
JOURNAL = {Discrete Math.},
VOLUME = {8},
YEAR = {1974},
PAGES = {301--304},
ISSN = {0012-365X},

}

@inproceedings{MR0376436,
AUTHOR = {Bermond, J-C.},
TITLE = {Graphe repr\'esentatif de l'hypergraphe {$h$}-parti complet},
BOOKTITLE = {Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio, 1972; dedicated to Arnold Ross)},
PAGES = {34--53. Lecture Notes in Math., Vol. 411},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {1974},

}

@article{MR0357227,
AUTHOR = {Bermond, J-C. and Meyer, J. C.},
TITLE = {Graphe repr\'esentatif des ar\^etes d'un multigraphe},
JOURNAL = {J. Math. Pures Appl. (9)},
VOLUME = {52},
YEAR = {1973},
PAGES = {299--308},
ISSN = {0021-7824},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/BeMe73.pdf},

}

@article{MR0366733,
AUTHOR = {Bermond, J-C. and Rosenstiehl, P.},
TITLE = {Pancyclisme du carr\'e du graphe aux ar\^etes d'un graphe},
NOTE = {Pr\'esent\'e au Colloque sur la Th\'eorie des Graphes,Brussels, 1973},
JOURNAL = {Cahiers Centre \'Etudes Recherche Op\'er.},
VOLUME = {15},
YEAR = {1973},
PAGES = {285--286},
ISSN = {0774-3068},

}

@article{MR0300927,
AUTHOR = {Bermond, J-C.},
TITLE = {Ordres \`a distance minimum d'un tournoi et graphes partiels sans circuits maximaux},
JOURNAL = {Math. Sci Humaines},
NUMBER = {37},
YEAR = {1972},
PAGES = {5--25},
ISSN = {0025-5815},

}

@article{MR0307953,
AUTHOR = {Bermond, J-C.},
TITLE = {Arbres maximaux ayant au plus {$n$} sommets pendants},
JOURNAL = {C. R. Acad. Sci. Paris S\'er. A-B},
VOLUME = {274},
YEAR = {1972},
PAGES = {A1878--A1881},

}

@article{MR0269547,
AUTHOR = {Bermond, J-C.},
TITLE = {Graphes orient\'es fortement {$k$}-connexes et graphes ``{$k$} arc hamiltoniens''},
JOURNAL = {C. R. Acad. Sci. Paris S\'er. A-B},
VOLUME = {271},
YEAR = {1970},
PAGES = {A141--A144},

}