Internal reports
| Internal reports |
-
Ali Al Zoobi,
David Coudert,
and Nicolas Nisse.
Finding the k Shortest Simple Paths: Time and Space trade-offs.
Research Report,
Inria ; I3S, Université Côte d'Azur,
April 2021.
[WWW
] [PDF
] [bibtex-entry]
-
Ali Al Zoobi,
David Coudert,
and Nicolas Nisse.
On the complexity of finding $k$ shortest dissimilar paths in a graph.
Research Report,
Inria ; CNRS ; I3S ; UCA,
2021.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
André Nusser,
and Laurent Viennot.
Enumeration of far-apart pairs by decreasing distance for faster hyperbolicity computation.
Research Report,
Inria ; I3S, Université Côte d'Azur,
April 2021.
[WWW
] [PDF
] [bibtex-entry]
-
Ali Al Zoobi,
David Coudert,
and Nicolas Nisse.
Space and time trade-off for the k shortest simple paths problem.
Research Report,
Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France,
February 2020.
[WWW
] [PDF
] [bibtex-entry]
-
Yann Busnel,
Christelle Caillouet,
and David Coudert.
VESPA: Constrained target coverage by distributed deployment of connected UAVs.
Research Report,
Inria ; I3S, Université Côte d'Azur ; IMT Atlantique,
May 2019.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Guillaume Ducoffe,
and Alexandru Popa.
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs.
Research Report,
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,
July 2017.
Note: Https://arxiv.org/abs/1707.05016.
[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,
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.
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,
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]
-
David Coudert and Guillaume Ducoffe.
Data center interconnection networks are not hyperbolic.
Research Report,
Inria Sophia Antipolis ; I3S ; Université Nice Sophia Antipolis ; CNRS,
May 2015.
[WWW
] [PDF
] [bibtex-entry]
-
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
] [bibtex-entry]
-
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
] [bibtex-entry]
-
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
] [bibtex-entry]
-
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
] [bibtex-entry]
-
David Coudert,
Alvinice Kodjo,
and Khoa Phan.
Robust Energy-aware Routing with Redundancy Elimination.
Research Report RR-8457,
INRIA,
January 2014.
[WWW
] [PDF
] [bibtex-entry]
-
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
] [bibtex-entry]
-
Deepesh Agarwal,
Julio Araujo,
Christelle Caillouet,
Frédéric Cazals,
David Coudert,
and Stéphane Pérennes.
Connectivity Inference in Mass Spectrometry based Structure Determination.
Research Report RR-8320,
INRIA,
June 2013.
[WWW
] [PDF
] [bibtex-entry]
-
Omid Amini,
David Coudert,
and Nicolas Nisse.
Some Results on Non-deterministic Graph Searching in Trees.
Research Report,
2013.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Luc Hogie,
Aurélien Lancin,
Dimitri Papadimitriou,
Stéphane Pérennes,
and Issam Tahiri.
Feasibility study on distributed simulations of BGP.
Research Report RR-8283,
April 2013.
Note: Https://arxiv.org/abs/1304.4750.
[WWW
] [PDF
] [bibtex-entry]
-
Jean-Claude Bermond,
David Coudert,
Gianlorenzo D'Angelo,
and Fatima Zahra Moataz.
Diverse Routing with the star property.
Research Report RR-8071,
INRIA,
September 2012.
[WWW
] [PDF
] [bibtex-entry]
-
Nathann Cohen,
David Coudert,
and Aurélien Lancin.
Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs.
Research Report RR-8074,
INRIA,
September 2012.
[WWW
] [PDF
] [bibtex-entry]
-
Sonia Belhareth,
David Coudert,
Dorian Mazauric,
Nicolas Nisse,
and Issam Tahiri.
Reconfiguration with physical constraints in WDM networks.
Research Report RR-7850,
INRIA,
2011.
[WWW
] [PDF
] [bibtex-entry]
-
Jean-Claude Bermond,
David Coudert,
Joanna Moulierac,
Stéphane Pérennes,
Hervé Rivano,
Ignasi Sau Valls,
and Fernando Solano Donado.
MPLS label stacking on the line network.
Research Report RR-6803,
INRIA,
2009.
[WWW
] [PDF
] [bibtex-entry]
-
Jean-Claude Bermond,
David Coudert,
Joanna Moulierac,
Stéphane Pérennes,
Ignasi Sau Valls,
and Fernando Solano Donado.
GMPLS Routing Strategies based on the Design of Hypergraph Layouts.
Research Report RR-6842,
INRIA,
2009.
[WWW
] [PDF
] [bibtex-entry]
-
Jean-Claude Bermond,
David Coudert,
Joanna Moulierac,
Stéphane Pérennes,
and Fernando Solano Donado.
GMPLS Label Space Minimization through Hypergraph Layouts.
Research Report RR-7071,
INRIA,
2009.
[WWW
] [PDF
] [bibtex-entry]
-
Jean-Claude Bermond,
David Coudert,
and Joseph Peters.
Online Distributed Traffic Grooming on Path Networks.
Research Report RR-6833,
INRIA,
2009.
[WWW
] [PDF
] [bibtex-entry]
-
Nathann Cohen,
David Coudert,
Dorian Mazauric,
Napoleão Nepomuceno,
and Nicolas Nisse.
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks.
Research Report RR-7047,
INRIA,
2009.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Frédéric Giroire,
and Ignasi Sau Valls.
Circuit visiting 10 ordered vertices in infinite grids.
Research Report RR-6910,
INRIA,
2009.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Dorian Mazauric,
and Nicolas Nisse.
Routing Reconfiguration/Process Number: Networks with Shared Bandwidth..
Research Report RR-6790,
INRIA,
2009.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Florian Huc,
Dorian Mazauric,
Nicolas Nisse,
and Jean-Sébastien Sereni.
Routing Reconfiguration/Process Number: Coping wih Two Classes of Services.
Research Report RR-6698,
INRIA,
2008.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Florian Huc,
and Dorian Mazauric.
A distributed algorithm for computing and updating the process number of a forest.
Research Report RR-6560,
INRIA,
2008.
Note: Https://arxiv.org/abs/0806.2710.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert and Dorian Mazauric.
Network Reconfiguration using Cops-and-Robber Games.
Research Report RR-6694,
INRIA,
2008.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Napoleão Nepomuceno,
and Hervé Rivano.
Wireless Backhaul Networks: Minimizing Energy Consumption by Power-Efficient Radio Links Configuration.
Research Report RR-6752,
INRIA,
2008.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert and Jean-Sébastien Sereni.
Characterization of graphs and digraphs with small process number.
Research Report RR-6285,
INRIA,
2008.
[WWW
] [PDF
] [bibtex-entry]
-
Jean-Claude Bermond,
David Coudert,
and Benjamin Lévêque.
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring.
Research Report,
2007.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Florian Huc,
Fabrice Peix,
and Marie-Emilie Voge.
On Minimizing the Average Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints.
Research Report,
2007.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Stéphane Pérennes,
Hervé Rivano,
and Marie-Emilie Voge.
Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues.
Research Report,
2007.
[WWW
] [PDF
] [bibtex-entry]
-
Jean-Claude Bermond,
Laurent Braud,
and David Coudert.
Traffic Grooming on the Path.
Research Report RR-5645,
INRIA,
2006.
[WWW
] [PDF
] [bibtex-entry]
-
Jean-Claude Bermond,
Michel Cosnard,
David Coudert,
and Stéphane Pérennes.
Optimal Solution of the Maximum All Request Path Grooming Problem.
Research Report RR-5627,
INRIA,
2006.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Pallab Datta,
Stéphane Pérennes,
Hervé Rivano,
and Marie-Emilie Voge.
Complexity and approximability issues of Shared Risk Resource Group.
Research Report RR-5859,
INRIA,
2006.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Florian Huc,
and Jean-Sébastien Sereni.
Pathwidth of outerplanar graphs.
Research Report RR-5804,
INRIA,
2006.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
P. Datta,
Hervé Rivano,
and Marie-Emilie Voge.
Minimum Color Problems and Shared Risk Resource Group in Multilayer Networks.
Research Report I3S Research Report I3S/RR-2005-37-FR,
2005.
Note: Http://www.i3s.unice.fr/ mh/RR/2005/liste-2005.shtml.
[WWW
] [bibtex-entry]
-
David Coudert and Hervé Rivano.
Lightpath assignment for multifibers wdm optical networks with wavelength translators.
Technical report RR-4487,
INRIA,
June 2002.
[WWW
] [PDF
] [bibtex-entry]
-
Jean-Claude Bermond,
David Coudert,
and Min-Li Yu.
On DRC-Covering of K_n by Cycles.
Research Report RR-4299,
INRIA,
October 2001.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Afonso Ferreira,
and Stéphane Pérennes.
Digraph Isomorphisms and Free Space Optical Networks.
Research Report RR-3817,
INRIA,
November 1999.
[WWW
] [PDF
] [bibtex-entry]
