-
Alvinice Kodjo.
Design and optimization of wireless backhaul networks.
Theses,
Université Nice Sophia Antipolis,
December 2014.
[WWW
] [PDF
]
Keywords:
Infrastructure sharing,
Energy saving,
Design,
Robust optimization,
Microwave backhaul,
Réseaux de collecte,
Optimisation robuste,
Dimensionnement,
Consommation d'énergie,
Partage d'infrastructure.
@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},
}
-
Aurélien Lancin.
Study of complex networks properties for the optimization of routing models.
Theses,
Université Nice Sophia Antipolis,
December 2014.
[WWW
] [PDF
]
Keywords:
Routing,
Graph decomposition,
Graph,
Hyperbolicity,
Algorithm,
Parallel distributed simulation,
Internet,
Algorithme,
Graphe,
Hyperbolicité,
Décomposition de graphe,
Routage,
BGP,
Simulation,
Simulation parallèle distribuée.
@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},
}
-
Bi Li.
Tree decompositions and routing problems.
Theses,
Université Nice Sophia Antipolis,
November 2014.
[WWW
] [PDF
]
Keywords:
Tree decomposition,
Compact routing scheme,
Prize collecting Steiner tree,
Gathering,
Décomposition arborescente,
Schéma de routage compact.
@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},
}
-
Nicolas Nisse.
Algorithmic complexity: Between Structure and Knowledge How Pursuit-evasion Games help..
Habilitation à diriger des recherches,
Université Nice Sophia Antipolis,
May 2014.
[WWW
] [PDF
]
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 é.
@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},
}
-
Ana Karolinna Maia de Oliveira.
Subdivisions of digraphs.
Theses,
Université Nice Sophia Antipolis,
November 2014.
[WWW
] [PDF
]
Keywords:
Digraph,
Subdivision,
Linkage,
Oriented graphs,
Digraphe,
Graphes orientés.
@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},
}
-
Truong Khoa Phan.
Design and management of networks with low power consumption.
Theses,
Université Nice Sophia Antipolis,
September 2014.
[WWW
] [PDF
]
Keywords:
Software defined networks,
Open Shortest Path First,
Energy-aware routing,
Redundancy elimination,
Routage conscience-énergie,
Élimination de redondance.
@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},
}
-
Julio Araujo,
Jean-Claude Bermond,
and Guillaume Ducoffe.
Eulerian and Hamiltonian dicycles in directed hypergraphs.
Discrete Mathematics, Algorithms and Applications,
06:1450012,
2014.
[WWW
] [PDF
]
Keywords:
Eulerian and Hamiltonian dicycles,
11xxx,
de Bruijn dihyper-graphs Mathematics Subject Classification 2000: 11xxx,
Directed hypergraphs.
@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},
}
-
Julio Araujo,
Nicolas Nisse,
and Stéphane Pérennes.
Weighted Coloring in Trees.
Siam Journal on Discrete Mathematics,
28(4):2029 - 2041,
2014.
[WWW
] [PDF
]
@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},
}
-
Victor Campos,
Claudia Linhares Sales,
Ana Karolinna Maia,
and Rudini Sampaio.
Maximization Coloring Problems on graphs with few P4s.
Discrete Applied Mathematics,
164(2):539-546,
February 2014.
[WWW
] [PDF
]
@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},
}
-
Grit Classen,
David Coudert,
Arie Koster,
and Napoleao Nepomuceno.
Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks.
INFORMS Journal on Computing,
26(4):893-909,
2014.
[WWW
] [PDF
]
Keywords:
network reliability,
fixed wireless networks,
capacitated network design,
integer programming,
chance-constrained programming.
@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},
}
-
David Coudert and Guillaume Ducoffe.
Recognition of C4-free and 1/2-hyperbolic graphs.
Siam Journal on Discrete Mathematics,
28(3):1601-1617,
September 2014.
[WWW
] [PDF
]
Keywords:
rectangular matrix multiplication,
Hyperbolicity,
discrete metric space,
graph algorithms,
C4-free graphs,
rectangular matrix multiplication..
@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},
}
-
Fedor V. Fomin,
Frédéric Giroire,
Alain Jean-Marie,
Dorian Mazauric,
and Nicolas Nisse.
To satisfy impatient Web surfers is hard.
Journal of Theoretical Computer Science (TCS),
526:1-17,
March 2014.
[WWW
] [PDF
]
@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},
}
-
Frédéric Havet,
Andrew D. King,
Mathieu Liedloff,
and Ioan Todinca.
(Circular) backbone colouring: forest backbones in planar graphs.
Discrete Applied Mathematics,
169:119-134,
2014.
[WWW
] [PDF
]
@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},
}
-
Frédéric Havet and Andrew King.
List circular backbone colouring.
Discrete Mathematics and Theoretical Computer Science,
Vol. 16 no. 1 (in progress)(1):89--104,
March 2014.
Note: Graph Theory.
[WWW
] [PDF
]
Keywords:
Discrete Mathematics,
Graph Theory.
@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},
}
-
Frédéric Havet,
Nagarajan Paramaguru,
and Rathinaswamy Sampathkumar.
Detection number of bipartite graphs and cubic graphs.
Discrete Mathematics and Theoretical Computer Science,
Vol. 16 no. 3 (in progress)(3):333-342,
December 2014.
[WWW
] [PDF
]
@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},
}
-
Julio Araujo,
Nathann Cohen,
Susanna de Rezende,
Frédéric Havet,
and Phablo Moura.
On the proper orientation number of bipartite graphs.
In 9th International colloquium on graph theory and combinatorics,
Grenoble, France,
June 2014.
[WWW
] [PDF
]
Keywords:
proper orientation,
graph colouring,
bipartite graph,
hardness.
@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},
}
-
Julio Araújo,
Nicolas Nisse,
and Stéphane Pérennes.
Weighted Coloring in Trees.
In 31st Symposium on Theoretical Aspects of Computer Science (STACS),
Lyon, France,
pages 75-86,
March 2014.
Dagstuhl Publishing.
[WWW
] [PDF
]
@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},
}
-
David Coudert,
Brigitte Jaumard,
and Fatima Zahra Moataz.
Dynamic Routing and Spectrum Assignment with Non-Disruptive Defragmentation.
In ALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Le Bois-Plage-en-Ré, France,
pages 1-4,
June 2014.
[WWW
] [PDF
]
@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},
}
-
David Coudert,
Alvinice Kodjo,
and Khoa Phan.
Robust Optimization for Energy-aware Routing with Redundancy Elimination.
In ALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Le-Bois-Plage-en-Ré, France,
pages 1-4,
June 2014.
[WWW
] [PDF
]
@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},
}
-
David Coudert,
Dorian Mazauric,
and Nicolas Nisse.
Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth.
In 13th International Symposium on Experimental Algorithms,
volume 8504 of Lecture Notes in Computer Science,
Copenhagen, Denmark,
pages 46-58,
2014.
[WWW
] [PDF
]
@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},
}
-
Gianlorenzo D'Angelo,
Xavier Défago,
and Nicolas Nisse.
Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments.
In Second International Symposium on Computing and Networking (CANDAR),
Mt. Fuji, Shizuoka, Japan,
December 2014.
[WWW
] [PDF
]
@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},
}
-
Gianlorenzo D'Angelo,
Alfredo Navarra,
and Nicolas Nisse.
Gathering and Exclusive Searching on Rings under Minimal Assumptions.
In Mainak Chatterjee,
Jian-Nong Cao,
Kishore Kothapalli,
and Sergio Rajsbaum, editors,
15th International Conference on Distributed Computing and Networking (ICDCN),
volume 8314,
Coimbatore, India,
pages 149-164,
January 2014.
Springer.
[WWW
] [PDF
]
@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},
}
-
Frédéric Giroire,
Joanna Moulierac,
and Truong Khoa Phan.
Optimizing Rule Placement in Software-Defined Networks for Energy-aware Routing.
In IEEE GLOBECOM,
Austin Texas, United States,
December 2014.
IEEE.
[WWW
] [PDF
]
Keywords:
networking,
SDN,
Energy Aware routing.
@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},
}
-
Alvinice Kodjo,
David Coudert,
and Christelle Caillouet.
Optimisation robuste pour le partage de réseaux d'accès micro-ondes entre opérateurs.
In ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision,
Bordeaux, France,
February 2014.
Société française de recherche opérationnelle et d'aide à la décision.
[WWW
]
Keywords:
Wireless backhaul network,
robust optimization,
infrastructure sharing.
@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},
}
-
Mathias Lecuyer,
Guillaume Ducoffe,
Francis Lan,
Andrei Papancea,
Theofilos Petsios,
Riley Spahn,
Augustin Chaintreau,
and Roxana Geambasu.
XRay: Enhancing the Web's Transparency with Differential Correlation.
In USENIX Security Symposium,
San Diego, United States,
August 2014.
Note: Extended version of a paper presented at the 23rd USENIX Security Symposium (USENIX Security 14).
[WWW
] [PDF
]
@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},
}
-
Bi Li,
Fatima Zahra Moataz,
and Nicolas Nisse.
Minimum Size Tree-Decompositions.
In 9th International colloquium on graph theory and combinatorics (ICGT),
Grenoble, France,
2014.
[WWW
] [PDF
]
@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},
}
-
Deepesh Agarwal,
Christelle Caillouet,
David Coudert,
and Frédéric Cazals.
Unveiling Contacts within Macro-molecular assemblies by solving Minimum Weight Connectivity Inference Problems.
Research Report RR-8622,
Inria,
October 2014.
[WWW
] [PDF
]
Keywords:
Molecular machines,
Mixed integer linear program,
Biophysics,
Mass spectrometry,
Protein assembly,
Structural biology,
Connectivity Inference Connected induced sub-graphs.
@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},
}
-
Julio Araujo,
Nathann Cohen,
Susanna F. De Rezende,
Frédéric Havet,
and Phablo Moura.
On the proper orientation number of bipartite graphs.
Research Report RR-8492,
INRIA,
March 2014.
[WWW
] [PDF
]
Keywords:
proper orientation,
graph colouring,
bipartite graph.
@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},
}
-
Julio Araujo,
Frédéric Havet,
and Mathieu Schmitt.
Steinberg-like theorems for backbone colouring.
Research Report RR-8641,
INRIA Sophia Antipolis ; INRIA,
November 2014.
[WWW
] [PDF
]
@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},
}
-
Joergen Bang-Jensen,
Frédéric Havet,
and Anders Yeo.
The complexity of finding arc-disjoint branching flows.
Research Report RR-8640,
INRIA Sophia Antipolis ; INRIA,
November 2014.
[WWW
] [PDF
]
Keywords:
disjoint branchings,
branching flow,
polynomial algorithm,
NP-complete.
@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},
}
-
Nathann Cohen,
David Coudert,
Guillaume Ducoffe,
and Aurélien Lancin.
Applying clique-decomposition for computing Gromov hyperbolicity.
Research Report RR-8535,
INRIA,
June 2014.
[WWW
] [PDF
]
Keywords:
Hyperbolicity,
Algorithms,
Graphs,
Decomposition.
@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},
}
-
David Coudert and Guillaume Ducoffe.
On the recognition of $C\_4$-free and $1/2$-hyperbolic graphs.
Research Report RR-8458,
INRIA,
January 2014.
[WWW
] [PDF
]
@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},
}
-
David Coudert,
Guillaume Ducoffe,
and Nicolas Nisse.
Diameter of Minimal Separators in Graphs.
Research Report RR-8639,
Inria Sophia Antipolis ; I3S ; INRIA,
November 2014.
[WWW
] [PDF
]
@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},
}
-
David Coudert,
Alvinice Kodjo,
and Khoa Phan.
Robust Energy-aware Routing with Redundancy Elimination.
Research Report RR-8457,
INRIA,
January 2014.
[WWW
] [PDF
]
Keywords:
Robust Network Optimization,
Green Networking,
Energy-aware Routing,
Redundancy Elimination.
@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},
}
-
David Coudert,
Dorian Mazauric,
and Nicolas Nisse.
Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth.
Research Report RR-8470,
INRIA,
February 2014.
[WWW
] [PDF
]
Keywords:
Pathwidth,
vertex-separation,
branch-and-bound,
Sage.
@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},
}
-
Gianlorenzo D'Angelo,
Xavier Défago,
and Nicolas Nisse.
Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments.
Research Report RR-8614,
Inria,
2014.
[WWW
] [PDF
]
@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},
}
-
Frédéric Giroire,
Frédéric Havet,
and Joanna Moulierac.
Compressing Two-dimensional Routing Tables with Order.
Research Report RR-8658,
INRIA Sophia Antipolis ; INRIA,
December 2014.
[WWW
] [PDF
]
Keywords:
compact tables.,
FPT,
approximation algorithm,
routing,
routing tables,
software defined networks,
complexity.
@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},
}
-
Frédéric Giroire,
Joanna Moulierac,
and T. Khoa Phan.
Optimizing Rule Placement in Software-Defined Networks for Energy-aware Routing.
Research Report RR-8537,
INRIA,
May 2014.
[WWW
] [PDF
]
@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},
}
-
Frédéric Giroire,
Stéphane Pérennes,
and Issam Tahiri.
Grid spanners with low forwarding index for energy efficient networks.
Research Report RR-8643,
INRIA Sophia Antipolis ; INRIA,
December 2014.
[WWW
] [PDF
]
@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},
}
-
Frédéric Havet and Bernard Lidicky.
Splitting a tournament into two subtournaments with given minimum outdegree.
Research Report RR-8469,
INRIA,
February 2014.
[WWW
] [PDF
]
@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},
}
-
Bi Li,
Fatima Zahra Moataz,
Nicolas Nisse,
and Karol Suchan.
Size-Constrained Tree Decompositions.
Research Report,
INRIA Sophia-Antipolis,
October 2014.
[WWW
] [PDF
]
@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},
}
-
Euripides Markou,
Nicolas Nisse,
and Stéphane Pérennes.
Exclusive Graph Searching vs. Pathwidth.
Research Report RR-8523,
INRIA,
2014.
[WWW
] [PDF
]
Keywords:
graph searching,
pathwidth,
computational complexity,
monotone strategies,
exclusivity property.
@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},
}
-
Joanna Moulierac and Khoa Phan.
Optimizing IGP Link Weights for Energy-efficiency in a Changing World.
Research Report RR-8534,
INRIA,
May 2014.
[WWW
] [PDF
]
Keywords:
Robust Network Optimization,
Energy-aware Routing,
Green Networking,
Traffic Engineering.
@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},
}
