Publications of year 2016
| Publications of year 2016 |
-
David Coudert and Guillaume Ducoffe.
Data center interconnection networks are not hyperbolic.
Theoretical Computer Science,
639:72-90,
2016.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Guillaume Ducoffe,
and Nicolas Nisse.
To Approximate Treewidth, Use Treelength!.
SIAM Journal on Discrete Mathematics,
30(3):13,
2016.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert and Guillaume Ducoffe.
On the hyperbolicity of bipartite graphs and intersection graphs.
Discrete Applied Mathematics,
214:187-195,
2016.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Dorian Mazauric,
and Nicolas Nisse.
Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth.
ACM Journal of Experimental Algorithmics,
21(1):23,
2016.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Stéphane Pérennes,
Hervé Rivano,
and Marie-Emilie Voge.
Combinatorial optimization in networks with Shared Risk Link Groups.
Discrete Mathematics and Theoretical Computer Science,
18(3):25,
May 2016.
[WWW
] [PDF
] [bibtex-entry]
-
Jean-Claude Bermond,
Nathann Cohen,
David Coudert,
Dimitrios Letsios,
Ioannis Milis,
Stéphane Pérennes,
and Vassilis Zissimopoulos.
Bin Packing with Colocations.
In Klaus Jansen and Monaldo Mastrolilli, editors,
14th International Workshop on Approximation and Online Algorithms (WAOA),
volume 10138,
Aarhus, Denmark,
pages 40-51,
August 2016.
Springer.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert and Guillaume Ducoffe.
Liens entre symétries et étirements de routages dans les réseaux d'interconnexions de centres de données.
In ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Bayonne, France,
May 2016.
[WWW
] [PDF
] [bibtex-entry]
-
Jean-Claude Bermond,
Nathann Cohen,
David Coudert,
Dimitrios Letsios,
Ioannis Milis,
Stéphane Pérennes,
and Vassilis Zissimopoulos.
Bin packing with colocations.
Research Report,
Inria ; I3S,
October 2016.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert and Guillaume Ducoffe.
Clique-decomposition revisited.
Research Report,
INRIA Sophia Antipolis - I3S,
February 2016.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert.
A note on Integer Linear Programming formulations for linear ordering problems on graphs.
Research Report,
Inria ; I3S ; Universite Nice Sophia Antipolis ; CNRS,
February 2016.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Guillaume Ducoffe,
Nicolas Nisse,
and Mauricio Soto.
Distance-preserving orderings in graphs.
Research Report RR-8973,
Inria Sophia Antipolis,
2016.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
James Luedtke,
Eduardo Moreno,
and Konstantinos Priftis.
Computing and maximizing the exact reliability of wireless backhaul networks.
Research Report,
Inria Sophia Antipolis ; I3S,
November 2016.
[WWW
] [PDF
] [bibtex-entry]
