Internal reports

BACK TO COATI PUBLICATION INDEX

Internal reports

2022
  1. Julien Bensmail, Tapas Das, Dimitri Lajou, Soumen Nandi, and Sagnik Sen. On the pushable chromatic number of various types of grids. Research Report, Université Côte d'Azur ; Université de Bordeaux, 2022. [WWW ] [PDF ]
    Keywords: oriented graph, oriented colouring, pushable chromatic number, grid. [bibtex-entry]
     
  2. Julien Bensmail and Foivos Fioravantes. On proper 2-labellings distinguishing by sums, multisets or products. Research Report, Université Côte d'Azur, 2022. [WWW ] [PDF ]
    Keywords: proper labelling, sum of labels, multiset of labels, product of labels. [bibtex-entry]
     
2021
  1. Pierre Aboulker, Frédéric Havet, Kolja Knauer, and Clément Rambaud. On the dichromatic number of surfaces. Research Report, Inria ; CNRS ; I3S ; Université Côte D'Azur, 2021.
    Note: 25 pages, 5 figures, improved asymptotic bounds. [WWW ] [bibtex-entry]
     
  2. 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 ]
    Keywords: k shortest simple paths, graph algorithm, space-time trade-off. [bibtex-entry]
     
  3. 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 ; Université Côte d’Azur, 2021. [WWW ] [PDF ] [bibtex-entry]
     
  4. Fabricio Benevides, Jean-Claude Bermond, Hicham Lesfari, and Nicolas Nisse. Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation. Research Report, Université Côte d'Azur, 2021. [WWW ] [PDF ] [bibtex-entry]
     
  5. Julien Bensmail, François Dross, Nacim Oijid, and Éric Sopena. Generalising the achromatic number to Zaslavsky's colourings of signed graphs. Research Report, Université côte d'azur ; Université de Bordeaux ; Université lyon 1, 2021. [WWW ] [PDF ]
    Keywords: chromatic number, achromatic number, complete colouring, Zaslavsky's colouring, signed graph. [bibtex-entry]
     
  6. Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse, and Nacim Oijid. The Maker-Breaker Largest Connected Subgraph Game. Research Report, Université Côte d’Azur, CNRS, Inria, I3S, Biot, France, 2021. [WWW ] [PDF ]
    Keywords: Maker-Breaker games, Largest connected subgraph game, Connection games, PSPACE-complete. [bibtex-entry]
     
  7. Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, and Nicolas Nisse. The Largest Connected Subgraph Game. Research Report, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; CISPA Helmholtz Center for Information Security, Saarbrücken, Germany, 2021. [WWW ] [PDF ]
    Keywords: Games on graphs, Scoring games, Connection games, PSPACE-complete, GI-hard. [bibtex-entry]
     
  8. Julien Bensmail, Hervé Hocquard, Dimitri Lajou, and Éric Sopena. A proof of the Multiplicative 1-2-3 Conjecture. Research Report, Université côte d'azur ; Université de bordeaux, 2021. [WWW ] [PDF ]
    Keywords: 1-2-3 Conjecture, product version, labels 1-2-3. [bibtex-entry]
     
  9. Julien Bensmail, Hervé Hocquard, Dimitri Lajou, and Eric Sopena. On a List Variant of the Multiplicative 1-2-3 Conjecture. Research Report, Université de bordeaux ; Université côte d'azur, 2021. [WWW ] [PDF ]
    Keywords: proper labelling, 1-2-3 Conjecture, product, list. [bibtex-entry]
     
  10. Julien Bensmail, Hervé Hocquard, and Pierre-Marie Marcille. Going Wide with the 1-2-3 Conjecture. Research Report, Université Côte d'Azur ; Université de Bordeaux ; ENS Lyon, 2021. [WWW ] [PDF ]
    Keywords: Distinguishing labelling, 1-2-3 Conjecture, fixed radius. [bibtex-entry]
     
  11. Julien Bensmail and Fionn Mc Inerney. The Vertex-Capturing Game. Research Report, Université Côte d'Azur ; CISPA Helmholtz Center for Information Security, 2021. [WWW ] [PDF ]
    Keywords: scoring game, combinatorial game, 2-player game, graph. [bibtex-entry]
     
  12. David Coudert, Ali Al Zoobi, and Arthur Finkelstein. On finding $k$ earliest arrival time journeys in public transit networks. Research Report, Inria, June 2021. [WWW ] [PDF ]
    Keywords: Journey planning, shortest path, routing, timetables. [bibtex-entry]
     
  13. 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 ]
    Keywords: Gromov hyperbolicity, Graph algorithms, Far-apart pairs, Enumeration algorithms. [bibtex-entry]
     
  14. Arthur Da Cunha, Emanuele Natale, and Laurent Viennot. Neural Network Information Leakage through Hidden Learning. Research Report, Inria ; CNRS ; I3S ; Université Côte d'Azur, 2021. [WWW ] [PDF ] [bibtex-entry]
     
  15. Francesco d'Amore, Daniel Mitropolsky, Pierluigi Crescenzi, Emanuele Natale, and Christos H Papadimitriou. Planning with Biological Neurons and Synapses. Research Report, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Gran Sasso Science Institute (L'Aquila, Italie) ; Department of Computer Science, Columbia University, New York, December 2021.
    Note: To appear in AAAI 2022. [WWW ] [PDF ] [bibtex-entry]
     
  16. Francesco d'Amore and Isabella Ziccardi. Phase Transition of the 3-Majority Dynamics with Uniform Communication Noise. Research Report, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Università degli Studi dell'Aquila, December 2021. [WWW ] [PDF ]
    Keywords: Opinion Dynamics, Uniform Communication Noise, Consensus Problem, Distributed Computing, Randomized Algorithms. [bibtex-entry]
     
  17. Giuseppe Di Lena, Andrea Tomassilli, Frédéric Giroire, Damien Saucez, Thierry Turletti, and Chidung Lac. Placement Module for Distributed SDN/NFV Network Emulation. Research Report RR-9391, Inria Sophia Antipolis - Méditerranée ; I3S, Université Côte d'Azur ; Orange Labs R&D [Lannion] (France Télécom), February 2021. [WWW ] [PDF ]
    Keywords: Virtualization, Emulation, Placement, Approximation algorithms, Virtualisation réseau, Emulation distribuée, Algorithmes de placement. [bibtex-entry]
     
  18. Foivos Fioravantes, Nikolaos Melissinos, and Theofilos Triommatis. Complexity of Finding Maximum Locally Irregular Induced Subgraphs. Research Report, Inria ; I3S ; Université Côte d'Azur, September 2021. [WWW ] [PDF ]
    Keywords: FPT, largest induced subgraph, Locally irregular, treewidth, W-hardness. [bibtex-entry]
     
  19. Frédéric Giroire, Nicolas Nisse, Thibaud Trolliet, and Malgorzata Sulkowska. Preferential attachment hypergraph with high modularity. Research Report, Université Cote d'Azur, 2021. [WWW ] [PDF ]
    Keywords: Complex network, Hypergraph, Preferential attachment, Modularity. [bibtex-entry]
     
  20. Frédéric Havet, Jorgen Bang-Jensen, and Anders Yeo. Spanning eulerian subdigraphs in semicomplete digraphs. Research Report, Inria ; CNRS ; I3S ; Université côte d'azur, December 2021. [WWW ] [PDF ]
    Keywords: Arc-connectivity, Eulerian subdigraph, Tournament, Semicomplete digraph, polynomial algorithm. [bibtex-entry]
     
  21. Frédéric Havet, Dorian Mazauric, and Viet-Ha Nguyen. On the complexity of overlaying a hypergraph with a graph with bounded maximum degree. Research Report, Inria ; CNRS ; I3S ; Université Côte d'Azur, 2021. [WWW ] [PDF ] [bibtex-entry]
     
  22. Viet-Ha Nguyen and Kévin Perrot. Rikudo is NP-complete. Research Report, Inria ; Université Côte d'Azur ; I3S ; CNRS, 2021. [WWW ] [bibtex-entry]
     
  23. Malgorzata Sulkowska, Bernhard Gittenberger, Zbigniew Golębiewski, and Isabella Larcher. Counting embeddings of rooted trees into families of rooted trees. Research Report, Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142) ; Wroclaw University of Science and Technology ; Technische Universität Wien, September 2021.
    Note: 20 pages, 6 figures. [WWW ] [PDF ] [bibtex-entry]
     
  24. Malgorzata Sulkowska, Alexander Gnedin, and Patryk Koziel. Running minimum in the best-choice problem. Research Report, Wroclaw University of Science and Technology ; University of London, Queen Mary ; Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142), October 2021.
    Note: 22 pages, 9 figures. [WWW ] [PDF ] [bibtex-entry]
     
  25. Malgorzata Sulkowska, Krzysztof Grining, and Marek Klonowski. What Do Our Choices Say About Our Preferences?. Research Report, Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142) ; Wroclaw University of Science and Technology, June 2021.
    Note: 22 pages, 6 figures. [WWW ] [PDF ] [bibtex-entry]
     
  26. Malgorzata Sulkowska and Michal Lason. Modularity of minor-free graphs. Research Report, Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142) ; Institute of Mathematics of the Polish Academy of Sciences ; Wroclaw University of Science and Technology, February 2021.
    Note: 7 pages, 1 figure. [WWW ] [PDF ] [bibtex-entry]
     
2020
  1. 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]
     
  2. Julio Araujo, Julien Bensmail, Victor Campos, Frédéric Havet, Ana Karolinna Maia De Oliveira, Nicolas Nisse, and Ana Silva. On finding the best and worst orientations for the metric dimension. Research Report, Inria, 2020. [WWW ] [PDF ]
    Keywords: Undirected graphs, Resolving sets, Metric dimension, Digraphs. [bibtex-entry]
     
  3. Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, and Eric Sopena. On the signed chromatic number of some classes of graphs. Research Report, Université Côte D'Azur ; Université de Bordeaux ; Université Lyon 1, 2020. [WWW ] [PDF ]
    Keywords: Kn-minor-free graph, bounded-degree graph, triangle-free planar graph, homomorphism of signed graphs, planar graph, signed chromatic number. [bibtex-entry]
     
  4. Julien Bensmail, Foivos Fioravantes, and Fionn Mc Inerney. On the Role of 3's for the 1-2-3 Conjecture. Research Report, Université côte d'azur ; Aix-Marseille Universite, 2020. [WWW ] [PDF ]
    Keywords: Proper labellings, 3-chromatic graphs, 1-2-3 Conjecture. [bibtex-entry]
     
  5. Julien Bensmail and Foivos Fioravantes. On BMRN*-colouring of planar digraphs. Research Report, Université Côte d'Azur, CNRS, I3S, France, 2020. [WWW ] [PDF ]
    Keywords: BMRN*-colouring, planar digraphs, TDMA scheduling. [bibtex-entry]
     
  6. Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, and Nicolas Nisse. Further Results on an Equitable 1-2-3 Conjecture. Research Report, Université Côte d'Azur, CNRS, I3S, France ; Inria Sophia Antipolis ; Aix-Marseille Université (AMU), April 2020. [WWW ] [PDF ]
    Keywords: Proper labellings, Equitable labellings, 1-2-3 Conjecture. [bibtex-entry]
     
  7. Julien Bensmail, Foivos Fioravantes, and Nicolas Nisse. On Proper Labellings of Graphs with Minimum Label Sum. Research Report, Inria - Sophia antipolis, 2020. [WWW ] [PDF ] [bibtex-entry]
     
  8. Julien Bensmail, Hervé Hocquard, Dimitri Lajou, and Eric Sopena. Further Evidence Towards the Multiplicative 1-2-3 Conjecture. Research Report, Université côte d'azur ; Université de bordeaux, April 2020. [WWW ] [PDF ]
    Keywords: 1-2-3 Conjecture, multiset version, product version, 4-chromatic graphs. [bibtex-entry]
     
  9. Julien Bensmail. On a graph labelling conjecture involving coloured labels. Research Report, Université côte d'azur, April 2020. [WWW ] [PDF ]
    Keywords: Proper labellings, Coloured labels, Weak (2, 2)-Conjecture, 1-2-3 Conjecture. [bibtex-entry]
     
  10. Cláudio Carvalho, Jonas Costa, Cláudia Linhares Sales, Raul Lopes, Ana Karolinna Maia De Oliveira, and Nicolas Nisse. On the characterization of networks with multiple arc-disjoint branching flows. Research Report, UFC ; INRIA ; CNRS ; Université Côte d’Azur ; I3S ; LIRMM ; Université de Montpellier, November 2020. [WWW ] [PDF ] [bibtex-entry]
     
  11. Andrea Clementi, Francesco d'Amore, George Giakkoupis, and Emanuele Natale. On the Search Efficiency of Parallel Lévy Walks on ${\mathbb Z}^2$. Research Report, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Università degli Studi di Roma ''Tor Vergata'' ; Univ Rennes, Inria, CNRS, IRISA, France, April 2020. [WWW ] [PDF ] [bibtex-entry]
     
  12. Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, and Simon Nivelle. Treelength of Series-parallel graphs. Research Report, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France, 2020. [WWW ] [PDF ] [bibtex-entry]
     
  13. Changjiang Gou, Ali Al Zoobi, Anne Benoit, Mathieu Faverge, Loris Marchal, Grégoire Pichon, and Pierre Ramet. Improving mapping for sparse direct solvers: A trade-off between data locality and load balancing. Research Report RR-9328, Inria Rhône-Alpes, February 2020. [WWW ] [PDF ]
    Keywords: Load balancing, Data locality, Sparse direct solvers, Processor mapping, Localité des données, Equilibrage de charge, Placement, Solveurs directs creux. [bibtex-entry]
     
2019
  1. Stephan Dominique Andres, François Dross, Melissa Huggan, Fionn Mc Inerney, and Richard J Nowakowski. On the Complexity of Orthogonal Colouring Games and the NP-Completeness of Recognising Graphs Admitting a Strictly Matched Involution. Research Report, Inria - Sophia Antipolis, March 2019. [WWW ] [PDF ]
    Keywords: scoring game, strictly matched involution, NP-completeness, combinatorial game, Orthogonal Colouring Game, orthogonal graph colouring, PSPACE-completeness. [bibtex-entry]
     
  2. Hossein Baktash, Emanuele Natale, and Laurent Viennot. A Comparative Study of Neural Network Compression. Research Report, INRIA Sophia Antipolis - I3S, October 2019. [WWW ] [PDF ] [bibtex-entry]
     
  3. 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]
     
  4. Adrien Gausseran, Frédéric Giroire, Brigitte Jaumard, and Joanna Moulierac. Be Scalable and Rescue My Slices During Reconfiguration. Research Report, Inria - Sophia Antipolis ; I3S, Université Côte d'Azur ; Concordia University, December 2019. [WWW ] [PDF ]
    Keywords: Reconfiguration, Software Defined Networking, Service Function Chains, Network Function Virtualization. [bibtex-entry]
     
  5. Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, and Rémi Watrigant. Overlaying a hypergraph with a graph with bounded maximum degree. Research Report RR-9258, Inria Sophia Antipolis, February 2019. [WWW ] [PDF ]
    Keywords: computational structural biology, Hypergraph, graph, algorithm, complexity, Hypergraphe, graphe, algorithme, complexité, biologie structurale computation-nelle. [bibtex-entry]
     
  6. Andrea Tomassilli, Giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Damien Saucez, Stéphane Perennes, Thierry Turletti, Ruslan Sadykov, François Vanderbeck, and Chidung Lac. Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks. Research Report, INRIA Sophia Antipolis - I3S, April 2019. [WWW ] [PDF ]
    Keywords: network resilience strategies, Network Function Virtualization, Software Defined Networking. [bibtex-entry]
     
2018
  1. Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Sequential Metric Dimension. Research Report, Inria, 2018. [WWW ] [PDF ]
    Keywords: complexity, Metric dimension, Games in graphs. [bibtex-entry]
     
  2. Julien Bensmail, Fionn Mc Inerney, and Nicolas Nisse. Metric Dimension: from Graphs to Oriented Graphs. Research Report, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France, November 2018. [WWW ] [PDF ]
    Keywords: Strongly-connected orientations, Metric dimension, Resolving sets. [bibtex-entry]
     
  3. Andrea Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, and Luca Trevisan. Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise. Research Report, CNRS, 2018. [WWW ] [PDF ] [bibtex-entry]
     
  4. Adrien Gausseran, Andrea Tomassilli, Frédéric Giroire, and Joanna Moulierac. Don't Interrupt Me When You Reconfigure my Service Function Chains. Research Report RR-9241, UCA, Inria ; Université de Nice Sophia-Antipolis (UNS) ; CNRS ; UCA,I3S, December 2018. [WWW ] [PDF ]
    Keywords: Software Defined Networking, Service Function Chains, Network Function Virtualization, Reconfiguration, SDN (réseaux logiciels), SFC (chaînes de service), NFV (fonctions réseaux virtuelles). [bibtex-entry]
     
  5. Frédéric Havet and Nicolas Nisse. Constrained ear decompositions in graphs and digraphs. Research Report, Inria - Sophia Antipolis, 2018. [WWW ] [PDF ] [bibtex-entry]
     
  6. Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Eternal Domination in Grids. Research Report, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France, May 2018. [WWW ] [PDF ]
    Keywords: Eternal Domination, Combinatorial Games, Graphs, Grids. [bibtex-entry]
     
  7. Nicolas Nisse. Network Decontamination. Research Report, Inria & Université Nice Sophia Antipolis, CNRS, I3S, Sophia Antipolis, France, 2018. [WWW ] [PDF ]
    Keywords: Graph Searching, Computational Complexity, (Distributed) Graph Algorithms. [bibtex-entry]
     
  8. Andrea Tomassilli, Frédéric Giroire, Nicolas Huin, and Stéphane Pérennes. Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints. Research Report RR-9141, Université Côte d'Azur, CNRS, I3S, France ; Inria Sophia Antipolis, January 2018. [WWW ] [PDF ]
    Keywords: network function virtualization, service function chaining, placement, approximation algorithms, Réseaux logiciels, Optimisation, Virtualisation des fonctions réseaux, Chaînes de fonctions de service. [bibtex-entry]
     
2017
  1. Julien Bensmail, Valentin Garnero, and Nicolas Nisse. On improving matchings in trees, via bounded-length augmentations. Research Report, Université Côte d'Azur, July 2017. [WWW ] [PDF ]
    Keywords: trees, bounded-length augmentations, maximum matchings. [bibtex-entry]
     
  2. Bartlomiej Bosek, Przemyslaw Gordinowicz, Jaroslaw Grytczuk, Nicolas Nisse, Joanna Sokol, and Malgorzata Sleszynska-Nowak. Localization Game on Geometric and Planar Graphs. Research Report, Inria, 2017. [WWW ] [PDF ] [bibtex-entry]
     
  3. Nathann Cohen, Nìcolas A Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, and Rudini Sampaio. Spy-Game on graphs: complexity and simple topologies. Research Report, Inria Sophia Antipolis, 2017. [WWW ] [PDF ]
    Keywords: PSPACE-hard, Cops and Robber games, graphs. [bibtex-entry]
     
  4. Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Study of a combinatorial game in graphs through Linear Programming. Research Report, Inria Sophia Antipolis, 2017. [WWW ] [PDF ]
    Keywords: Linear Programming, Cops and Robber games, Graphs. [bibtex-entry]
     
  5. 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. [WWW ] [PDF ]
    Keywords: Fully polynomial FPT, Graph algorithms, Hardness in P, Split decomposition, Neighbourhood diversity, Primeval decomposition, Clique-width, Modular decomposition. [bibtex-entry]
     
  6. Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, and Alexandru Popa. On the (di)graphs with (directed) proper connection number two. Research Report, Université Cô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, March 2017. [WWW ] [PDF ] [bibtex-entry]
     
  7. Guillaume Ducoffe. Finding cut-vertices in the square roots of a graph. Research Report, Université Côte d’Azur, Inria, CNRS, I3S, France, February 2017. [WWW ] [PDF ]
    Keywords: square root, biconnected components, clique cutset, cactus-block graph, Gallai tree, cycle-power graph, circular-arc graph. [bibtex-entry]
     
  8. Frédéric Giroire, Nicolas Huin, and Andrea Tomassilli. The Structured Way of Dealing with Heterogeneous Live Streaming Systems. Research Report RR-9070, Inria Sophia Antipolis ; Cnrs ; Universite Cote d'Azur, June 2017. [WWW ] [PDF ]
    Keywords: distributed algorithms, reliability, diffusion tree, protocols, churn, peer-to-peer, video streaming, pair-à-pair, diffusion video en direct, protocoles, fiabilité, arbre de diffusion, algorithmes distribués. [bibtex-entry]
     
  9. Nicolas Huin, Myriana Rifai, Frédéric Giroire, Dino Lopez Pacheco, Guillaume Urvoy-Keller, and Joanna Moulierac. Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks. Research Report RR-9020, INRIA Sophia Antipolis - I3S ; I3S, January 2017. [WWW ] [PDF ]
    Keywords: Software Defined Network, energy saving, energy aware routing, hybrid network, packet loss. [bibtex-entry]
     
  10. Kolja Knauer and Nicolas Nisse. Computing metric hulls in graphs. Research Report, Inria - Sophia Antipolis, 2017. [WWW ] [PDF ] [bibtex-entry]
     
2016
  1. Julio Araujo, Guillaume Ducoffe, Nicolas Nisse, and Karol Suchan. On interval number in cycle convexity. Research Report, Inria Sophia Antipolis ; I3S, 2016. [WWW ] [PDF ]
    Keywords: graph, convexity, complexity, dominating set. [bibtex-entry]
     
  2. Julio Araujo, Frédéric Giroire, Yaning Y.L. Liu, Remigiusz Modrzejewski, and Joanna Moulierac. Energy Efficient Content Distribution. Research Report RR-8091, INRIA, January 2016. [WWW ] [PDF ]
    Keywords: Energy Efficiency, Integer Linear Programming, Content Delivery Network, Net- work Cache, Future Internet. [bibtex-entry]
     
  3. Jorgen Bang-Jensen, Nathann Cohen, and Frédéric Havet. Finding good 2-partitions of digraphs II. Enumerable properties. Research Report RR-8868, INRIA Sophia Antipolis - I3S, February 2016. [WWW ] [PDF ] [bibtex-entry]
     
  4. Jorgen Bang-Jensen and Frédéric Havet. Finding good 2-partitions of digraphs I. Hereditary properties. Research Report RR-8867, INRIA Sophia Antipolis - I3S, February 2016. [WWW ] [PDF ] [bibtex-entry]
     
  5. Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, and Eric Sopena. On locally irregular decompositions of subcubic graphs. Research Report, Université de bordeaux ; Université de Nice - Sophia Antipolis, 2016. [WWW ] [PDF ] [bibtex-entry]
     
  6. Olivier Baudon, Julien Bensmail, Jakub Przybylo, and Mariusz Wozniak. On locally irregular decompositions and the 1-2 Conjecture in digraphs. Research Report, Inria, CNRS, Université de Bordeaux, AGH University, September 2016. [WWW ] [PDF ] [bibtex-entry]
     
  7. 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]
     
  8. Marwane Bouznif, Frédéric Havet, and Myriam Preissmann. Minimum-density identifying codes in square grids. Research Report RR-8845, INRIA Sophia Antipolis - I3S, January 2016. [WWW ] [PDF ] [bibtex-entry]
     
  9. Nathann Cohen, Frédéric Havet, William Lochet, and Nicolas Nisse. Subdivisions of oriented cycles in digraphs with large chromatic number. Research Report RR-8865, LRI - CNRS, University Paris-Sud ; LIP - ENS Lyon ; INRIA Sophia Antipolis - I3S, February 2016. [WWW ] [PDF ] [bibtex-entry]
     
  10. Nathann Cohen, Mathieu Hilaire, Nicolas Martins, Nicolas Nisse, and Stéphane Pérennes. Spy-Game on graphs. Research Report RR-8869, Inria, February 2016. [WWW ] [PDF ] [bibtex-entry]
     
  11. 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]
     
  12. David Coudert and Guillaume Ducoffe. Clique-decomposition revisited. Research Report, INRIA Sophia Antipolis - I3S, February 2016. [WWW ] [PDF ]
    Keywords: planar graphs, treewidth, clique-decomposition, minimal triangulation, clique-number, bounded-degree graphs. [bibtex-entry]
     
  13. David Coudert, Guillaume Ducoffe, Nicolas Nisse, and Mauricio Soto. Distance-preserving orderings in graphs. Research Report RR-8973, Inria Sophia Antipolis, 2016. [WWW ] [PDF ]
    Keywords: bounded treewidth, distance-preserving elimination ordering, metric graph theory, NP-complete, exact expo- nential algorithm, integer linear programming. [bibtex-entry]
     
  14. 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 ]
    Keywords: Network design, Backhaul network, Reliability, Optimization. [bibtex-entry]
     
  15. Rennan Dantas, Frédéric Havet, and Rudini Sampaio. Identifying codes for infinite triangular grids with a finite number of rows. Research Report RR-8951, INRIA Sophia Antipolis - I3S, August 2016. [WWW ] [PDF ]
    Keywords: identifying code, grid, discharging method, méthode de déchargement, grille, code identifiant. [bibtex-entry]
     
  16. Guillaume Ducoffe, Sylvain Legay, and Nicolas Nisse. On computing tree and path decompositions with metric constraints on the bags. Research Report RR-8842, INRIA Sophia Antipolis - Méditerranée ; LRI - CNRS, University Paris-Sud, January 2016. [WWW ] [PDF ]
    Keywords: path-breadth, k-good tree decompositions, tree-length, tree-breadth, path-length. [bibtex-entry]
     
  17. Frédéric Giroire, Nicolas Huin, Joanna Moulierac, and Khoa Phan. Energy-Aware Routing in Software-Defined Networks with Table Compression (using Wildcard Rules). Research Report RR-8897, INRIA Sophia Antipolis - I3S, April 2016. [WWW ] [PDF ]
    Keywords: energy savings, backbone networks, Software Defined Networks, data center networks, routing tables, compression, TCAM memory, réseaux programmables, réseaux de centre de données, table de routage, mémoire TCAM, économie d'énergie, réseau backbone. [bibtex-entry]
     
  18. Frédéric Giroire and Juan-Carlos Maureira. Analysis of the Failure Tolerance of Linear Access Networks. Research Report RR-8903, 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, April 2016. [WWW ] [PDF ]
    Keywords: Access networks, failure tolerance, telecommuting, connectivity analysis, maintenance cost. [bibtex-entry]
     
  19. Nicolas Huin, Andrea Tomassilli, Frédéric Giroire, and Brigitte Jaumard. Energy-Efficient Service Function Chain Provisioning. Research Report RR-8980, Inria Sophia Antipolis ; Université Côte d'Azur ; Cnrs ; Concordia University, November 2016. [WWW ] [PDF ]
    Keywords: Column Generation, Network Function Virtualization, Service Function Chains, Software Defined Networks, Energy Efficiency, Optimization, Optimisation, Efficacité énergétique, Réseaux logiciels, Virtualisation des fonctions réseaux, Chaînes de fonctions de service, Génération de Colonnes. [bibtex-entry]
     
  20. Myriana Rifai, Nicolas Huin, Christelle Caillouet, Frédéric Giroire, Joanna Moulierac, Dino Lopez Pacheco, and Guillaume Urvoy-Keller. MINNIE: an SDN World with Few Compressed Forwarding Rules. Research Report RR-8848, INRIA Sophia-Antipolis ; I3S, January 2016. [WWW ] [PDF ]
    Keywords: Software Defined Networks, data center networks, routing tables, compression, TCAM memory. [bibtex-entry]
     
  21. Andrea Tomassilli, Nicolas Huin, Frédéric Giroire, and Brigitte Jaumard. Energy-Efficient Service Chains with Network Function Virtualization. Research Report RR-8979, Inria Sophia Antipolis ; Université Côte d'Azur ; Cnrs ; Concordia University, October 2016. [WWW ] [PDF ]
    Keywords: Optimization, Energy Efficiency, Network Function Virtualization, Service Function Chains, Software Defined Networks, Chaînes de fonctions de service, Virtualisation des fonctions réseaux, Réseaux logiciels, Efficacité énergétique, Optimisation. [bibtex-entry]
     
2015
  1. Julio Araujo, Frédéric Havet, Claudia Linhares Sales, and Ana Silva. Proper orientation of cacti. Research Report RR-8833, INRIA Sophia Antipolis - Méditerranée, December 2015. [WWW ] [PDF ]
    Keywords: proper orientation, graph coloring, cactus graph, claw-free graph. [Abstract] [bibtex-entry]
     
  2. Jean-Claude Bermond and Fatima Zahra Moataz. On Spectrum Assignment in Elastic Optical Tree-Networks. Research Report, Inria Sophia Antipolis ; Université Nice Sophia Antipolis, February 2015. [WWW ] [PDF ]
    Keywords: Approximation algorithms, routing and spectrum assignment, optical networks, interval coloring. [Abstract] [bibtex-entry]
     
  3. 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 ] [Abstract] [bibtex-entry]
     
  4. Frédéric Giroire, Stéphane Pérennes, and Issam Tahiri. Graphs with optimal forwarding indices: What is the best throughput you can get with a given number of edges?. Research Report RR-8752, INRIA Sophia Antipolis ; INRIA, June 2015. [WWW ] [PDF ]
    Keywords: graphs, forwarding index, routing, design problem, energy efficiency, extremal graphs. [Abstract] [bibtex-entry]
     
  5. Frédéric Havet, A. Karolinna Maia de Oliveira, and Bojan Mohar. Finding a subdivision of a prescribed digraph of order 4. Research Report RR-8773, INRIA, September 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  6. Seong-Gyun Jeong, Yuliya Tarabalka, Nicolas Nisse, and Josiane Zerubia. Inference of Curvilinear Structure based on Learning a Ranking Function and Graph Theory. Research Report RR-8789, Inria Sophia Antipolis, 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  7. Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, and Nicolas Nisse. Finding Paths in Grids with Forbidden Transitions. Research Report, Inria Sophia Antipolis ; Univeristé Nice Sophia Antipolis ; CNRS, February 2015. [WWW ] [PDF ]
    Keywords: asymmetric nodes, grid, planar graphs, forbidden transitions. [Abstract] [bibtex-entry]
     
  8. Nicolas Nisse, Alexandre Salch, and Valentin Weber. Recovery of disrupted airline operations using k-Maximum Matching in Graphs. Research Report RR-8679, Inria Sophia Antipolis ; INRIA, February 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
2014
  1. 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. [bibtex-entry]
     
  2. 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. [bibtex-entry]
     
  3. 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 ] [bibtex-entry]
     
  4. 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. [bibtex-entry]
     
  5. 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. [bibtex-entry]
     
  6. 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]
     
  7. 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]
     
  8. 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. [bibtex-entry]
     
  9. 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. [bibtex-entry]
     
  10. 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 ] [bibtex-entry]
     
  11. 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. [bibtex-entry]
     
  12. 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 ] [bibtex-entry]
     
  13. 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 ] [bibtex-entry]
     
  14. 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 ] [bibtex-entry]
     
  15. Bi Li, Fatima Zahra Moataz, Nicolas Nisse, and Karol Suchan. Size-Constrained Tree Decompositions. Research Report, INRIA Sophia-Antipolis, October 2014. [WWW ] [PDF ] [bibtex-entry]
     
  16. 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. [bibtex-entry]
     
  17. 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. [bibtex-entry]
     
2013
  1. D. Agarwal, J. Araujo, C. Caillouet, F. Cazals, D. Coudert, and S. Pérennes. Connectivity Inference in Mass Spectrometry based Structure Determination. Research Report RR-8320, INRIA, June 2013. [WWW ] [PDF ] [bibtex-entry]
     
  2. O. Amini, D. Coudert, and N. Nisse. Some Results on Non-deterministic Graph Searching in Trees. Research Report, 2013. [WWW ] [PDF ] [bibtex-entry]
     
  3. J. Araujo, F. Giroire, Y. Liu, R. Modrzejewski, and J. Moulierac. Energy Efficient Content Distribution. Research Report RR-8091, INRIA, May 2013. [WWW ] [PDF ] [bibtex-entry]
     
  4. J. Araujo, N. Nisse, and S. Pérennes. Weighted Coloring in Trees. Research Report RR-8249, INRIA, 2013. [WWW ] [PDF ] [bibtex-entry]
     
  5. J-C. Bermond, B. Li, N. Nisse, H. Rivano, and M-L. Yu. Data Gathering and Personalized Broadcasting in Radio Grids with Interferences. Research Report RR-8218, INRIA, 2013. [WWW ] [PDF ] [bibtex-entry]
     
  6. P. Bertomé, T. Bouvier, F. Mazoit, N. Nisse, and R. Pardo Soares. An Unified FPT Algorithm for Width of Partition Functions. Research Report RR-8372, INRIA, September 2013. [WWW ] [PDF ] [bibtex-entry]
     
  7. L. Blin, J. Burman, and N. Nisse. Exclusive Graph Searching. Report, June 2013. [WWW ] [PDF ] [bibtex-entry]
     
  8. D. Coudert, Luc Hogie, A. Lancin, D. Papadimitriou, S. Pérennes, and I. Tahiri. Feasibility study on distributed simulations of BGP. Research Report RR-8283, INRIA, April 2013. [WWW ] [PDF ] [bibtex-entry]
     
  9. G. D'Angelo, A. Navarra, and N. Nisse. Robot Searching and Gathering on Rings under Minimal Assumptions. Research Report RR-8250, INRIA, 2013. [WWW ] [PDF ] [bibtex-entry]
     
  10. F. Giroire, D. Mazauric, N. Nisse, S. Pérennes, and R. Pardo Soares. Connected Surveillance Game. Research Report RR-8297, INRIA, May 2013. [WWW ] [PDF ] [bibtex-entry]
     
  11. F. Giroire, R. Modrzejewski, N. Nisse, and S. Pérennes. Maintaining Balanced Trees For Structured Distributed Streaming Systems. Research Report RR-8309, INRIA, May 2013. [WWW ] [PDF ] [bibtex-entry]
     
  12. F. Giroire, N. Nisse, S. Pérennes, and R. Pardo Soares. Fractional Combinatorial Two-Player Games. Research Report RR-8371, INRIA, September 2013. [WWW ] [PDF ] [bibtex-entry]
     
  13. F. Havet and A. K. Maia. On disjoint directed cycles with prescribed minimum lengths. Research Report RR-8286, INRIA, April 2013. [WWW ] [PDF ] [bibtex-entry]
     
2012
  1. J. Araujo, F. Giroire, Y. Liu, R. Modrzejewski, and J. Moulierac. Energy Efficient Content Distribution. Technical report RR-8091, INRIA, October 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  2. J. Araujo, G. Morel, L. Sampaio, R. Soares, and V. Weber. Hull number: $P_5$-free graphs and reduction rules. Technical report RR-8045, INRIA, August 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  3. J. Bang-Jensen, F. Havet, and A. K. Maia. Finding a subdivision of a digraph. Technical report RR-8024, INRIA, July 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  4. J-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Diverse Routing with the star property. Technical report RR-8071, INRIA, September 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  5. L. Blin, J. Burman, and N. Nisse. Perpetual Graph Searching. Technical report RR-7897, INRIA, February 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  6. V. Campos, F. Havet, R. Sampaio, and A. Silva. Backbone colouring: tree backbones with small diameter in planar graphs. Technical report RR-8151, INRIA, November 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  7. N. Cohen, D. Coudert, and A. Lancin. Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs. Technical report RR-8074, INRIA, September 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  8. G. D'Angelo, G. Di Stefano, A. Navarra, N. Nisse, and K. Suchan. A unified approach for different tasks on rings in robot-based computing systems. Technical report RR-8013, INRIA, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  9. G. D'Angelo, G. Di Stefano, and A. Navarra. How to gather asynchronous oblivious robots on anonymous rings. Technical report RR-7963, INRIA, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  10. G. Ducoffe. Eulerian and Hamiltonian Directed Hypergraphs. Technical report RR-7893, INRIA, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  11. F. Havet, A. D. King, M. Liedloff, and I. Todinca. (Circular) backbone colouring: tree backbones in planar graphs. Technical report RR-8152, INRIA, November 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  12. F. Havet and A. D. King. List circular backbone colouring. Technical report RR-8159, INRIA, November 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  13. F. Havet, A. K. Maia, and M-L. Yu. Complexity of greedy edge-colouring. Technical report RR-8171, INRIA, December 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  14. F. Havet, N. Paramaguru, and R. Sampathkumar. Detection number of bipartite graphs and cubic graphs. Technical report RR-8115, INRIA, October 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  15. A. Kosowski, B. Li, N. Nisse, and K. Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth. Technical report RR-7888, INRIA, February 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  16. N. Nisse and R. Soares. On The Monotonicity of Process Number. Technical report RR-7003, INRIA, October 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
2011
  1. P. Aboulker, F. Havet, and N. Trotignon. On wheel-free graphs. Research Report RR-7651, INRIA, June 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  2. L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed, and S. Thomassé. Oriented trees in digraphs. Research Report 7502, INRIA, 01 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  3. J. Araujo, J-C. Bermond, F. Giroire, F. Havet, D. Mazauric, and R. Modrzejewski. Weighted Improper Colouring. Research Report RR-7590, INRIA, 04 2011. [WWW ] [PDF ]
    Keywords: graph colouring, improper colouring, grids, integer programming, algorithms. [Abstract] [bibtex-entry]
     
  4. J. Araujo, V. Campos, F. Giroire, N. Nisse, L. Sampaio, and R. Soares. On the hull number of some graph classes. Technical report RR-7567, INRIA, September 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  5. F. Becker, A. Kosowski, N. Nisse, I. Rapaport, and K. Suchan. Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power. Technical report RR-7746, INRIA, 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  6. S. Belhareth, D. Coudert, D. Mazauric, N. Nisse, and I. Tahiri. Reconfiguration with physical constraints in WDM networks. Research Report RR-7850, INRIA, 2011. [WWW ] [PDF ]
    Keywords: Reconfiguration, WDM, NP-complete, Physical Layer Impaiments.. [Abstract] [bibtex-entry]
     
  7. J-C. Bermond, A. Jean-Marie, D. Mazauric, and M-L. Yu. Well Balanced Designs for Data Placement. Research Report 7725, INRIA, 09 2011. [WWW ] [Abstract] [bibtex-entry]
     
  8. S. Bessy and F. Havet. Enumerating the edge-colourings and total colourings of a regular graph. Research Report RR-7652, INRIA, June 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  9. V. Campos and F. Havet. 5-choosability of graphs with 2 crossings. Research Report RR-7618, INRIA, 05 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  10. J. G. Chang, F. Havet, M. Montassier, and A. Raspaud. Steinberg's Conjecture and near-colorings. Rapport de recherche RR-7669, INRIA, 7 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  11. F. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, and N. Nisse. To Satisfy Impatient Web surfers is Hard. Technical report RR-7740, INRIA, September 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  12. F. Giroire, S. K. Gupta, R. Modrzejewski, J. Monteiro, and S. Pérennes. Analysis of the Repair Time in Distributed Storage Systems. Research Report RR-7538, INRIA, 02 2011. [WWW ] [PDF ]
    Keywords: P2P storage systems, data lifetime, queuing model, regenerating codes per- formance evaluation. [Abstract] [bibtex-entry]
     
  13. F. Havet and X. Zhu. The game Grundy number of graphs. Rapport de recherche RR-7646, INRIA, June 2011. [WWW ] [PDF ]
    Keywords: colouring game, game Grundy number, trees, partial 2-trees. [Abstract] [bibtex-entry]
     
  14. F. Maffray and G. Morel. On 3-colorable $P_5$-free graphs. Technical report 191, Les Cahiers Leibniz, Laboratoire G-SCOP, 2011. [PDF ] [bibtex-entry]
     
  15. J. Moulierac, T. K. Phan, N. Thoai, and C. Tran. Xcast6 Treemap Islands - A Mixed Model of Application and Network Layer Multicast. Rapport de recherche RR-7784, INRIA, December 2011. [WWW ] [PDF ]
    Keywords: IP multicast, Application Layer Multicast, Xcast, media streaming, linear program, algorithms. [Abstract] [bibtex-entry]
     
2010
  1. J. Bang-Jensen, F. Havet, and N. Trotignon. Finding an induced subdivision of a digraph. Research Report 7430, INRIA, 10 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  2. L. Barrière, P. Flocchini, F. V. Fomin, P. Fraigniaud, N. Nisse, N. Santoro, and D. Thilikos. Connected Graph Searching. Research Report 7363, INRIA, August 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  3. F. Becker, M. Matamala, N. Nisse, I. Rapaport, K. Suchan, and I. Todinca. Adding a referee to an interconnection network: What can(not) be computed in one round. Research Report arXiv:1009.4447, arXiv, September 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  4. J-C. Bermond, F. Havet, F. Huc, and C. Linhares Sales. Improper colouring of weighted grid and hexagonal graphs. Research Report RR-7250, INRIA, April 2010. [WWW ] [PDF ]
    Keywords: Improper colouring, Weighted colouring, Approximation algorithms. [Abstract] [bibtex-entry]
     
  5. V. Campos, A. Gyárfás, F. Havet, C. Linhares Sales, and F. Maffray. New bounds on the Grundy number of products of graphs. Research Report 7243, INRIA, April 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  6. S. Caron, F. Giroire, D. Mazauric, J. Monteiro, and S. Pérennes. P2P Storage Systems: Data Life Time for Different Placement Policies. Research Report RR-7209, INRIA, February 2010. [WWW ] [PDF ]
    Keywords: P2P storage system, data placement, data life time, mean time to data loss, performance evaluation, Markov chains. [Abstract] [bibtex-entry]
     
  7. J. Chalopin, V. Chepoi, N. Nisse, and Y. Vaxès. Cop and robber games when the robber can hide and ride.. Technical report INRIA-RR7178, INRIA, January 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  8. N. Cohen and F. Havet. Linear and 2-frugal choosability of graphs of small maximum average degree. Research Report RR-7213, INRIA, 02 2010. [WWW ] [Abstract] [bibtex-entry]
     
  9. F. Giroire, D. Mazauric, J. Moulierac, and B. Onfroy. Minimizing Routing Energy Consumption: from Theoretical to Practical Results. Research Report inria-00464318, May 2010. [WWW ] [PDF ]
    Keywords: power consumption, energy-efficient routing, graphs, linear programming. [Abstract] [bibtex-entry]
     
  10. N. Hanusse, D. Ilcinkas, A. Kosowski, and N. Nisse. How to beat the random walk when you have a clock?. Research Report RR-7210, INRIA, February 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  11. F. Havet, C. Linhares Sales, and L. Sampaio. b-coloring of tight graphs. Research Report 7241, INRIA, March 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  12. P. Uribe, J-C. Maureira Bravo, and O. Dalle. Extending INET Framework for Directional and Asymmetrical Wireless Communications. Research Report RR-7120, INRIA, 03 2010. [WWW ] [PDF ]
    Keywords: OMNeT++, INET Framework, Directional Radios, Asymmetrical communication. [Abstract] [bibtex-entry]
     
2009
  1. J. Araujo, N. Cohen, F. Giroire, and F. Havet. Good edge-labelling of graphs. Research Report 6934, INRIA, 2009. [WWW ] [PDF ]
    Keywords: graph theory, complexity, edge-labelling, planar graphs, matching-cut, channel assignment. [Abstract] [bibtex-entry]
     
  2. J-C. Bermond, C.J. Colbourn, L. Gionfriddo, G. Quattrocchi, and I. Sau. Drop cost and wavelength optimal two-period grooming with ratio 4. Technical report RR-7101, INRIA, November 2009. [PDF ] [Abstract] [bibtex-entry]
     
  3. J-C. Bermond, M. Cosnard, and S. Pérennes. Directed acyclic graphs with unique path property. Technical report 6932, INRIA, May 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  4. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, H. Rivano, I. Sau, and F. Solano Donado. MPLS label stacking on the line network. Technical report RR-6803, INRIA, January 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  5. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, I. Sau, and F. Solano Donado. GMPLS Label Space Minimization through Hypergraph Layouts. Research Report RR-7071, INRIA, October 2009. [WWW ] [PDF ]
    Keywords: GMPLS, optical networks, label stacking, hypergraph layout, approximation algorithms, dynamic programming.. [Abstract] [bibtex-entry]
     
  6. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, I. Sau, and F. Solano Donado. GMPLS Routing Strategies based on the Design of Hypergraph Layouts. Technical report RR-6842, INRIA, February 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  7. J-C. Bermond, D. Coudert, and J. Peters. Online Distributed Traffic Grooming on Path Networks. Technical report RR-6833, INRIA, February 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  8. J-C. Bermond, X. Muñoz, and I. Sau. Traffic Grooming in Bidirectional WDM Ring Networks. Technical report RR-7080, INRIA, October 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  9. J-C. Bermond, N. Nisse, P. Reyes, and H. Rivano. Fast Data Gathering in Radio Grid Networks. Research Report RR-6851, INRIA, March 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  10. N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and N. Nisse. Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks.. Technical report RR-7047, INRIA, September 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  11. N. Cohen, F. Havet, and T. Müller. Acyclic edge-colouring of planar graphs. Research Report 6876, INRIA, March 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  12. N. Cohen and F. Havet. Planar graphs with maximum degree $\Delta\geq 9$ are ($\Delta+1$)-edge-choosable -- short proof. Research Report RR-7098, November 2009. [WWW ]
    Keywords: edge-colouring, list colouring, List Colouring Conjecture, planar graphs. [Abstract] [bibtex-entry]
     
  13. D. Coudert, F. Giroire, and I. Sau. Circuit visiting 10 ordered vertices in infinite grids. Technical report RR-6910, INRIA, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  14. D. Coudert, D. Mazauric, and N. Nisse. Routing Reconfiguration/Process Number: Networks with Shared Bandwidth.. Technical report RR-6790, INRIA, January 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  15. N. Eggemann, F. Havet, and S. Noble. $k$-$L(2,1)$-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Research Report 6840, INRIA, February 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  16. R. Erman, F. Havet, B. Lidicky, and O. Pangrác. 5-colouring graphs with 4 crossings. Research Report 7110, INRIA, November 2009. [Abstract] [bibtex-entry]
     
  17. F. Giroire, J. Monteiro, and S. Pérennes. P2P Storage Systems: How Much Locality Can They Tolerate?. Research Report RR-7006, INRIA, July 2009. [WWW ] [PDF ]
    Keywords: P2P storage system, data placement, performance evaluation, data durability. [Abstract] [bibtex-entry]
     
  18. F. Havet, S. Jendrol', R. Soták, and E. Skrabul'aková. Facial non-repetitive edge-colouring of plane graphs. Research Report 6873, INRIA, February 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  19. L. Hogie, D. Papadimitriou, I. Tahiri, and F. Majorczyk. Simulating routing schemes on large-scale topologies. Technical report RT-0371, INRIA, November 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  20. F. Huc, C. Molle, N. Nisse, S. Perennes, and H. Rivano. Stability of a local greedy distributed routing algorithm. Technical report RR-6871, INRIA, March 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  21. J-C. Maureira Bravo, D. Dujovne, and O. Dalle. Network Provisioning for High Speed Vehicles Moving along Predictable Routes - Part 1: Spiderman Handover. Research Report RR-6850, INRIA, 2009. [WWW ] [Abstract] [bibtex-entry]
     
  22. J. Rué, I. Sau, and D. M. Thilikos. Dynamic Programming for Graphs on Surfaces. Technical report RR-7166, INRIA, December 2009. [PDF ] [Abstract] [bibtex-entry]
     
  23. A. Silva, P. Reyes, and M. Debbah. Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks. Research Report RR-6854, INRIA, March 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
2008
  1. E. Altman, P. Nain, and J-C. Bermond. Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks. Research Report RR-6645, INRIA, September 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  2. O. Amini, F. Huc, I. Sau, and J. Zerovnik. $(\ell,k)$-Routing on Plane Grids. Research Report 6480, INRIA, March 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  3. O. Amini, D. Peleg, S. Pérennes, I. Sau, and S. Saurabh. Degree-Constrained Subgraph Problems: Hardness and Approximation Results. Research Report RR-6690, INRIA, October 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  4. M. Asté, F. Havet, and C. Linhares-Sales. Grundy number and products of graphs. Research Report RR-6672, INRIA, October 2008. [PDF ] [Abstract] [bibtex-entry]
     
  5. J-C. Bermond, I. Caragiannis, D. Coudert, F. Diedrich, L. Hogie, F. Huc, C. Molle, J. Monteiro, P. Leone, H. Rivano, and I. Sau. Algorithmic solutions for critical resource sharing: third year. Technical report Deliverable 2.2.3, IST FET AEOLUS, Integrated Project IST-015964, 2008. [PDF ] [bibtex-entry]
     
  6. J-C. Bermond, R. Correa, and M-L. Yu. Optimal Gathering Protocols on Paths under Interference Constraints. Technical report inria-00168162, HAL, August 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  7. J-C. Bermond, D. Mazauric, V. Misra, and P. Nain. Distributed Call Scheduling in Wireless Networks. Technical report RR-6763, INRIA, December 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  8. J-C. Bermond, V. Papadopoulou, and E. Pitoura. Subproject2: Resource Management Report on the activities of the third year. Technical report Deliverable 2.O.3, IST FET AEOLUS, Integrated Project IST-015964, 2008. [PDF ] [bibtex-entry]
     
  9. P. Berthomé and N. Nisse. A unified FPT Algorithm for Width of Partition Functions. Research Report RR-6646, INRIA, September 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  10. R. Correa, F. Havet, and J.-S. Sereni. About a Brooks-type theorem for improper colouring. Research Report RR-6432, INRIA, January 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  11. D. Coudert, F. Huc, D. Mazauric, N. Nisse, and J-S. Sereni. Routing Reconfiguration/Process Number: Coping wih Two Classes of Services. Research Report RR-6698, INRIA, October 2008. [WWW ] [Abstract] [bibtex-entry]
     
  12. D. Coudert, F. Huc, and D. Mazauric. A distributed algorithm for computing and updating the process number of a forest. Research Report RR-6560, INRIA, June 2008. [WWW ] [Abstract] [bibtex-entry]
     
  13. D. Coudert and D. Mazauric. Network Reconfiguration using Cops-and-Robber Games. Research Report RR-6694, INRIA, August 2008. [WWW ] [Abstract] [bibtex-entry]
     
  14. D. Coudert, N. Nepomuceno, and H. Rivano. Wireless Backhaul Networks: Minimizing Energy Consumption by Power Efficient Radio Links Configuration. Technical report RR-6752, INRIA, December 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  15. O. Dalle, F. Giroire, J. Monteiro, and S. Pérennes. Analysis of Failure Correlation in Peer-to-Peer Storage Systems. Technical report RR-6761, INRIA, December 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  16. J. Galtier. New algorithms to compute the strength of a graph. Research Report RR-6592, INRIA, July 2008. [bibtex-entry]
     
  17. C. Gomes, S. Pérennes, and H. Rivano. Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks. Technical report inria-00282200, INRIA, May 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  18. F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, and M. Liedloff. Exact algorithms for $L(2,1)$-labelling. Research Report RR-6587, INRIA, 07 2008. [Abstract] [bibtex-entry]
     
  19. F. Havet, D. Král, J.-S. Sereni, and R. Skrekovski. Facial coloring using Hall's Theorem. Research Report 383, ITI-series, 2008. [PDF ] [Abstract] [bibtex-entry]
     
  20. F. Havet, B. Reed, and J.-S. Sereni. $L(p,1)$-labelling of graphs. Research Report RR-6673, INRIA, October 2008. [PDF ] [Abstract] [bibtex-entry]
     
  21. F. Havet, J. van den Heuvel, C. McDiarmid, and B. Reed. List Colouring Squares of Planar Graphs. Research Report RR-6586, INRIA, July 2008. [Abstract] [bibtex-entry]
     
  22. X. Muñoz and I. Sau. Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph. Research Report RR-6481, INRIA, March 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  23. N. Nisse, K. Suchan, and I. Rapaport. Distributed computing of efficient routing schemes in generalized chordal graphs. Technical report CMM-B-08/10-220, CMM, October 2008. [PDF ] [Abstract] [bibtex-entry]
     
  24. S. Pérennes and I. Sau. Sur la Conjecture des Jeux Uniques. Research Report RR-6691, INRIA, October 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
2007
  1. O. Amini, D. Coudert, and N. Nisse. Some Results on Non-deterministic Graph Searching in Trees. Research Report INRIA-00174965, INRIA, September 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  2. O. Amini, L. Esperet, and J. van den Heuvel. Frugal Colouring of Graphs. Research Report 6178, INRIA, May 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  3. O. Amini, F. Havet, F. Huc, and S. Thomassé. WDM and Directed Star Arboricity. Research Report 6179, INRIA, January 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  4. O. Amini, F. Mazoit, N. Nisse, and S. Thomassé. Submodular partition functions. Technical report RR-1427-07, LABRI, Univ. Bordeaux, April 2007.
    Note: Submitted in SIAM J. discrete Maths. [PDF ] [Abstract] [bibtex-entry]
     
  5. O. Amini, S. Pérennes, and I. Sau. Hardness and Approximation of Traffic Grooming. Research Report 6236, INRIA, June 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  6. O. Amini, I. Sau, and S. Saurabh. Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. Research Report 6237, INRIA, June 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  7. J-C. Bermond, I. Caragiannis, D. Coudert, C. Gomes, I. Guerin-Lassous, G. Huiban, C. Molle, and I. Sau. Algorithmic solutions for critical resource sharing: second year. Technical report Deliverable 2.2.2, IST FET AEOLUS, Integrated Project IST-015964, 2007. [PDF ] [bibtex-entry]
     
  8. J-C. Bermond, D. Coudert, and B. Leveque. Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring. Technical report inria-00175795, hal, October 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  9. J-C. Bermond, V. Papadopoulou, and E. Pitoura. Subproject2: Resource Management Report on the activities of the second year. Technical report Deliverable 2.O.2, IST FET AEOLUS, Integrated Project IST-015964, 2007. [PDF ] [bibtex-entry]
     
  10. D. Coudert, F. Huc, F. Peix, and M-E. Voge. On Minimizing the Average Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints. Technical report inria-00175813, hal, October 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  11. D. Coudert, S. Perennes, H. Rivano, and M-E. Voge. Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues. Technical report inria-00175143, HAL, September 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  12. D. Coudert and J-S. Sereni. Characterization of graphs and digraphs with small process number. Research Report 6285, INRIA, September 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  13. J. Galtier. Tournament MAC with constant size congestion window for WLAN. Technical report RR-6396, INRIA, December 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  14. F. Giroire, J. Chendrashekar, G. Iannaccone, T. Karagiannis, K. Papagiannaki, E. Schooler, and N. Taft. Inside the Forbidden City: A look at End-Host Traffic inside a Modern Enterprise. Technical Report, Intel Research, 2007. [PDF ] [bibtex-entry]
     
  15. F. Giroire, J. Chendrashekar, N. Taft, G. Iannaccone, T. Karagiannis, K. Papagiannaki, and E. Schooler. The Case For Personalizing End-Host Detectors.. Technical Report, Intel Research, 2007. [PDF ] [bibtex-entry]
     
  16. C. Gomes and H. Rivano. Fair Joint Routing and Scheduling Problem in Wireless Mesh Networks. Research Report 6198, INRIA, May 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  17. F. Havet, R. Kang, and J.-S. Sereni. Improper colouring of unit disk graphs. Research Report 6206, INRIA, May 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  18. F. Havet and S. Thomasse. Complexity of $(p,1)$-total labelling. Research Report 6305, INRIA, September 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  19. R. Klasing, Z. Lotker, A. Navarra, and S. Pérennes. From Balls and Bins to Points and Vertices. Technical Report RR-1437-07, LaBRI, October 2007. [bibtex-entry]
     
  20. L. Liquori, D. Borsetti, C. Casetti, and C. Chiasserini. Overlay Networks for Vehicular Networks. Research Report, Politecnico di Torino, 2007. [bibtex-entry]
     
  21. C. Molle, F. Peix, and H. Rivano. Cross-Layer Design for Wireless Mesh Networks Using Column Generation. Technical report 6448, INRIA, December 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  22. P. Nain, C. Casetti, and L. Liquori. A Stochastic Model of an Arigatoni Overlay Computer. Research Report to be given, Politecnico di Torino, 2007. [bibtex-entry]
     
  23. S. Teigen. Distributing OSA Simulations using FractalRMI. Technical Report, INRIA, 2007.
    Note: Unpublished, internal document.[bibtex-entry]
     
2006
  1. O. Amini, F. Giroire, F. Huc, and S. Pérennes. Minimal selectors and fault tolerant networks. Research report, INRIA Research Report HAL-00082015, July 2006. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  2. O. Amini, F. Huc, and S. Pérennes. On the pathwidth of planar graphs. Research report, INRIA Research Report HAL-00082035, July 2006. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  3. J-C. Bermond, D. Coudert, H. Rivano, and M. Syska. Critical resource sharing, State of the art Survey. Technical report Deliverable 2.2.1, IST FET AEOLUS, Integrated Project IST-015964, 2006. [PDF ] [bibtex-entry]
     
  4. J-C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes. Hardness and approximation of gathering in static radio networks. Research Report 5936, INRIA, 06 2006. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  5. J-C. Bermond, V. Papadopoulou, and E. Pitoura. Subproject2: Resource Management Report on the activities of the first year. Technical report Deliverable 2.O.1, IST FET AEOLUS, Integrated Project IST-015964, 2006. [PDF ] [bibtex-entry]
     
  6. D. Coudert, P. Datta, S. Pérennes, H. Rivano, and M-E. Voge. Complexity and approximability issues of Shared Risk Resource Group. Technical report, INRIA Research Report 5859 and I3S Research Report I3S/RR-2006-08-FR, 2006. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  7. D. Coudert, F. Huc, and J.S. Sereni. Pathwidth of outerplanar graphs. Technical report, INRIA Research Report 5804 and I3S Research Report I3S/RR-2006-02-FR, January 2006. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  8. O. Dalle. OSA: an Open Component-based Architecture for Discrete-Event Simulation. Technical report RR-5762, version 2, INRIA, February 2006. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  9. O. Delmas, F. Havet, M. Montassier, and S. Pérennes. Design of fault tolerant on-board networks. Research report, INRIA Research Report 5866, March 2006. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  10. F. Havet. Choosability of the square of planar subcubic graphs with large girth. Research report, INRIA Research Report 5800 and I3S Research Report I3S/RR-2006-01-FR, January 2006.
    Note: Submitted to Discrete Mathematics. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  11. F. Havet, R. J. Kang, T. Müller, and J.-S. Sereni. Circular Choosability. Research report, INRIA Research Report 5957 and I3S Research Report I3S/RR-2006-21-FR, July 2006.
    Note: Submitted to Journal of Graph Theory. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  12. F. Havet, J.-S. Sereni, and R. Skrekovski. 3-facial colouring of plane graphs. Research report, INRIA Research Report 5943 and I3S Research Report I3S/RR-2006-20-FR, July 2006.
    Note: Submitted to SIAM Journal on Discrete Mathematics. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  13. F. Havet, S. Thomassé, and A. Yeo. Hoàng-Reed conjecture holds for tournaments. Research report, INRIA Research Report 5976, September 2006.
    Note: Submitted Discrete Mathematics. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  14. M. Lenisa, F. Honsell, and L. Liquori. A Framework for Defining Logical Frameworks. Research Report, RR INRIA and University of Udine, 2006. [WWW ] [bibtex-entry]
     
  15. G. Méheut, S. Pérennes, and H. Rivano. Evaluation stochastique et simulation des réseaux radio. Research report 5989, INRIA, September 2006. [WWW ] [Abstract] [bibtex-entry]
     
  16. H. Rivano, F. Théoleyre, and F. Valois. About the Capacity of Flat and Self-Organized Ad Hoc and Hybrid Networks. Research Report, INRIA Research Report 5977, 2006. [WWW ] [Abstract] [bibtex-entry]
     
2005
  1. L. Addario-Berry, F. Havet, and S. Thomassé. Paths with two blocks in $n$-chromatic digraphs. Research report, INRIA Research Report 5688 and I3S Research Report I3S/RR-2005-27-FR, 2005. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]
     
  2. J-C. Bermond, L. Braud, and D. Coudert. Traffic Grooming on the Path. Technical report, INRIA Research Report 5645 (.ps.gz) and I3S Research Report I3S/RR-2005-20-FR (.pdf), 2005. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  3. J-C. Bermond, M. Cosnard, D. Coudert, and S. Perennes. Optimal Solution of the Maximum All Request Path Grooming Problem. Technical report, INRIA Research Report 5627 (.ps.gz) and I3S Research Report I3S/RR-2005-18-FR (.pdf), 2005. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  4. C. Cooper, R. Klasing, and M. Zito. Lower Bounds and Algorithms for Dominating Sets in Web Graphs. Technical report, INRIA Research Report RR-5529 and I3S Research Report I3S/RR-2005-09-FR, 2005. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  5. D. Coudert, P. Datta, H. Rivano, and M.-E. Voge. Minimum Color Problems and Shared Risk Resource Group in Multilayer Networks. Research Report, I3S Research Report I3S/RR-2005-37-FR, 2005. [WWW ] [PDF ] [bibtex-entry]
     
  6. C. Gomes and H. Rivano. WDM Mesh Networks with Dynamic Traffic. Research report, INRIA Research Report 5713, 2005. [WWW ] [Abstract] [bibtex-entry]
     
  7. F. Havet. Repartitors, selectors and superselectors. Research report, INRIA Research Report 5686, 2005. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]
     
  8. G. Huiban and P. Datta. Virtual topology reconfiguration issues in evolution of WDM optical networks. Research report 5711, INRIA, 2005. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  9. G. Huiban and G. Robson Mateus. Optimization aspects of the reconfiguration problem in WDM networks. Research report, INRIA Research Report 5730 and I3S Research Report I3S/RR-2005-33-FR, 2005. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  10. R. J. Kang, T. Müller, and J.-S. Sereni. Improper colouring of (random) unit disk graphs. Research report, INRIA Research Report 5761 and I3S Research Report I3S/RR-2005-35-FR, November 2005. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  11. R. Klasing, C. Laforest, J. Peters, and N. Thibault. Constructing Incremental Sequences in Graphs. Research Report, INRIA Research Report RR-5648 and I3S Research Report I3S/RR-2005-22-FR, 2005. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  12. R. Klasing, E. Markou, T. Radzik, and F. Sarracco. Approximation Results for Black Hole Search in Arbitrary Networks. Research Report, INRIA Research Report RR-5659 and I3S Research Report I3S/RR-2005-23-FR, 2005. [PDF ] [POSTSCRIPT ] [bibtex-entry]
     
  13. J. Moulierac and A. Guitton. Distributed Multicast Tree Aggregation. Technical report 5636, Inria, July 2005. [PDF ] [Abstract] [bibtex-entry]
     
  14. J. Moulierac and M. Molnàr. Active monitoring of delays with asymmetric routes. Technical report 5635, Inria, July 2005. [PDF ] [Abstract] [bibtex-entry]
     
2004
  1. S. Alouf, E. Altman, J. Galtier, J.-F. Lalande, and C. Touati. Un algorithme d'allocation de bande passante satellitaire. Research Report RR-5172, INRIA Sophia Antipolis, 2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis, April 2004. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]
     
  2. J-C. Bermond, F. Havet, and C. D. Tóth. Fault tolerant on-board networks with priorities. Research Report RR-5363, INRIA, 2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis, November 2004. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]
     
  3. S. Bessy, E. Birmelé, and F. Havet. Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree. Research Report RR-5364, INRIA, 2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis, November 2004. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]
     
  4. S. Choplin, J. Galtier, and S. Pérennes. Optimal concave costs in the SDH context. Research Report RR-5201, INRIA, 2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis, May 2004. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]
     
  5. C. Cooper, R. Klasing, and T. Radzik. A randomized algorithm for the joining protocol in dynamic distributed networks. Research Report, INRIA Research Report RR-5376 and I3S Research Report I3S/RR-2004-39-FR, 2004. [PDF ] [POSTSCRIPT ] [bibtex-entry]
     
  6. A. Guitton and J. Moulierac. Scalable Tree Aggregation with a Large Number of Multicast Groups. Technical report 1663, Irisa, December 2004. [PDF ] [Abstract] [bibtex-entry]
     
  7. F. Havet and J.-S. Sereni. Improper choosability of graphs and maximum average degree. Research report, INRIA Research Report 5164 and I3S Research Report I3S/RR-2004-11-FR, April 2004. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]
     
  8. R. Klasing, Z. Lotker, A. Navarra, and S. Pérennes. The Points and Vertices Game. Research Report TRCS 030/2004, Dipartimento di Informatica, Università degli Studi di L'Aquila, 2004. [PDF ] [POSTSCRIPT ] [bibtex-entry]
     
  9. R. Klasing, N. Morales, and S. Pérennes. On the Complexity of Bandwidth Allocation in Radio Networks with Steady Traffic Demands. Research Report, INRIA Research Report RR-5432 and I3S Research Report I3S/RR-2004-40-FR, 2004.
    Note: Submitted to Theoretical Computer Science. [PDF ] [POSTSCRIPT ] [bibtex-entry]
     
  10. J.-F. Lalande, M. Syska, and Y. Verhoeven. Mascopt - A Network Optimization Library: Graph Manipulation. Technical report RT-0293, INRIA Sophia Antipolis, 2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis, April 2004. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]
     
  11. A. Navarra. Tighter Bounds for the Minimum Energy Broadcasting problem. Research Report TRCS 033/2004, Dipartimento di Informatica, Università degli Studi di L'Aquila, 2004. [bibtex-entry]
     
2003
  1. F. Havet. Upper bound for the span of (s,1)-total labelling of graphs. Research Report, INRIA Research Report 4816 and I3S Research Report I3S/RR-2003-13-FR, 2003. [WWW ] [PDF ] [bibtex-entry]
     
  2. F. Havet. Stable set meeting every longest path. Research Report, INRIA Research Report 5009 and I3S Research Report I3S/RR-2003-29-FR, 2003. [WWW ] [PDF ] [bibtex-entry]
     
2002
  1. E. Altman, J. Galtier, and C. Touati. Fair Bandwidth allocation between service providers in a geostationary satellite network. Technical report RR-4421, INRIA, March 2002. [bibtex-entry]
     
  2. N. Baskiotis, S. Pérennes, and H. Rivano. Heuristic design of multifiber WDM optical networks by randomized rounding of multicommodity flow. Research Report RR-4418, INRIA Research Report 4418, 2002. [WWW ] [Abstract] [bibtex-entry]
     
  3. B. Beauquier, S. Pérennes, and M. Syska. Efficient Access to Optical Bandwidth, Routing and Grooming in WDM Networks: State-of-the-art survey. IST CRESCCO report, Projet MASCOTTE (CNRS/INRIA/UNSA), Sophia Antipolis, July 2002. [bibtex-entry]
     
  4. J-C. Bermond and S. Céroi. Minimizing SONET ADMs in unidirectional WDM ring with grooming ratio 3. Technical report RR-4626, INRIA, Sophia Antipolis, November 2002. [bibtex-entry]
     
  5. S. Bessy, F. Havet, and J. Palaysi. Pancyclic Arcs and Connectivity in Tournaments. Rapport de recherche INRIA/RR-4522, Projet MASCOTTE, Sophia Antipolis, August 2002. [bibtex-entry]
     
  6. S. Bhadra and A. Ferreira. Computing multicast trees in dynamic networks using evolving graphs. Research Report 4531, INRIA, 2002. [bibtex-entry]
     
  7. D. Coudert and H. Rivano. Lightpath assignment for multifibers WDM optical networks with wavelength translators. Research Report, INRIA Research Report 4487, 2002. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  8. A. Ferreira and L. Viennot. A Note on Models, Algorithms, and Data Structures for Dynamic Communication Networks. Research Report 4403, INRIA, 2002. [bibtex-entry]
     
  9. F. Giroire, A. Nucci, N. Taft, and C. Diot. Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection. Technical Report, Sprint, 2002. [Abstract] [bibtex-entry]
     
  10. F. Havet and M-L. Yu. On $(d,1)$-total labelling of graphs. Rapport de recherche INRIA, Projet MASCOTTE, Sophia Antipolis, November 2002. [bibtex-entry]
     
  11. F. Havet. Pancyclic Arcs and Connectivity in Tournaments. Rapport de recherche INRIA/RR-4378, Projet MASCOTTE, Sophia Antipolis, March 2002. [bibtex-entry]
     
  12. A. Jarry. Integral Symmetric 2-Commodity Flows. Technical report RR-4622, INRIA, Sophia Antipolis, November 2002. [bibtex-entry]
     
  13. A. Jarry and A. Laugier. Two-connected graphs with given diameter. Technical report RR-4307, INRIA, Sophia Antipolis, March 2002. [bibtex-entry]
     
  14. B. Xuan, A. Ferreira, and A. Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. Technical report RR-4589, INRIA, Sophia Antipolis, November 2002. [bibtex-entry]
     
2001
  1. E. Altman, J. Galtier, and C. Touati. On fairness in bandwidth allocation. Rapport de Recherche 4269, INRIA, Sophia Antipolis, septembre 2001. [bibtex-entry]
     
  2. O. Audouin, C. Blaizot, E. Dotaro, M. Vigoureux, B. Beauquier, J-C. Bermond, B. Bongiovanni, S. Pérennes, M. Syska, S. Bibas, L. Chacon, B. Decocq, E. Didelet, A. Laugier, A. Lisser, A. Ouorou, and F. Tillerot. Planification et Optimisation des Réseaux de Transport Optiques. Rapport final RNRT PORTO, Alcatel Research & Innovation, Projet MASCOTTE (CNRS/INRIA/UNSA) et France Télécom R&D, Sophia Antipolis, December 2001. [bibtex-entry]
     
  3. J-C. Bermond, D. Coudert, and M-L. Yu. On DRC-Covering of $K_n$ by cycles. Technical report, INRIA Research Report RR-4299, I3S Research Report I3S/RR-2002-30-FR, 2001. [PDF ] [POSTSCRIPT ] [bibtex-entry]
     
  4. A. Ferreira, S. Pérennes, A. Richa, H. Rivano, and N. Stier. On the design of multifiber WDM networks. Research Report, INRIA Research Report 4244, August 2001. [WWW ] [Abstract] [bibtex-entry]
     
  5. A. Ferreira, S. Pérennes, and H. Rivano. Fractional coloring of bounded degree trees. Research Report, INRIA Research Report 4094, January 2001. [WWW ] [Abstract] [bibtex-entry]
     
2000
  1. B. Beauquier, O. Delmas, and S. Pérennes. Tight bounds for broadcasting in the linear cost model. Rapport de Recherche 3827, INRIA, novembre 2000. [bibtex-entry]
     
  2. O. Dalle and C. Rigal. Exemple d'utilisation de l'environnement de simulation ASIMUT. Rapport technique ATF-SB-1-0043-CNES, C.N.E.S., Mars 2000. [bibtex-entry]
     
  3. O. Dalle and V. Sutter. Spécification technique de besoin logiciel de l'environnement de simulation ASIMUT. Spécification ATF-SB-1-0029-CNES, C.N.E.S., Mars 2000. [bibtex-entry]
     
  4. E. Darrot. Convention A11518 INRIA--Alcatel Space Industries. Rapport de contrat,version révisée, INRIA Sophia Antipolis, France, Mai 2000. [bibtex-entry]
     
1999
  1. B. Beauquier and E. Darrot. On arbitrary size Waksman networks and their vulnerability. Rapport de recherche 3788 --- Thème 1, INRIA Sophia Antipolis, France, October 1999. [bibtex-entry]
     
  2. D. Coudert, A. Ferreira, and S. Perennes. Digraph Isomorphisms and Free Space Optical Networks. Technical report, INRIA Research Report 3817, 1999. [POSTSCRIPT ] [bibtex-entry]
     
  3. O. Dalle. Etat de l'art sur les couches MAC. Contribution du C.N.E.S. au rapport d'avancement de la Convention 2 du projet R.N.R.T. <>, Juin 1999. [bibtex-entry]
     
  4. E. Darrot. Evitement des boucles dans les anneaux de redondance. Rapport de recherche ???? --- Thème 1, INRIA Sophia Antipolis, France, November 1999. [bibtex-entry]
     
  5. E. Darrot. Convention A11518 INRIA--Alcatel Space Industries. Rapport de contrat ???? --- Thème 1, INRIA Sophia Antipolis, France, November 1999. [bibtex-entry]
     
  6. E. Darrot. Réseaux réarrangeables à commutateurs à lamelles. Rapport de recherche ???? --- Thème 1, INRIA Sophia Antipolis, France, November 1999. [bibtex-entry]
     
  7. M. Flammini and S. Pérennes. Tight Upper bound for broadcasting and gossiping. Technical report, INRIA, 1999.
    Note: Soumis à Journal on Information theory. [bibtex-entry]
     
  8. M. Flammini and S. Pérennes. Lower Bounds on systolic gossip.. Technical report 3612, INRIA, 1999.
    Note: Soumis à Journal on Information theory. [bibtex-entry]
     
  9. F. Fraigniaud, A. Pelc, and S. Pérennes. Fast tree naming. Technical report 3609, INRIA, 1999. [bibtex-entry]
     
  10. J. Galtier. Using Parallel Computing to Reduce CPU Power. Research Report 3621, INRIA, February 1999. [WWW ] [PDF ] [bibtex-entry]
     
  11. L. Gargano, A. Pelc, S. Pérennes, and U. Vaccaro. Optimal broadcasting in unknown networks. Technical report 3609, INRIA, 1999. [bibtex-entry]
     
1998
  1. D. Bacchiega, D. Gotta, L. Liquori, M. Porta, and M. Ramella Votta. Ipotesi Evolutive del Sistema MOMIX per la Specifica e Qualificazione di Sistemi TMN. Technical Report DTR 98.0089, CSELT, Centro Studi e Laboratori Telecomunicazioni, Telecom Italia Research Center, 1998.
    Note: Not available. In Italian. [bibtex-entry]
     
  2. T. Jiménez, P. Mussi, G. Siegel, and L. Villefranche. Car Following Algorithms. Technical report, Hipertrans Consortium, 1998. [bibtex-entry]
     
  3. T. Jiménez, P. Mussi, G. Siegel, and L. Villefranche. Parallel Architecture Issues. Technical report, Hipertrans Consortium, 1998. [bibtex-entry]
     
1997
  1. D. Bacchiega, D. Gotta, L. Liquori, M. Porta, and R. Rossi. MOMIX-emSDH2. Simulatore di Agent di Element Manager SDH2.0. Versione 2.2.3. Manuale Utente e Guida di Riferimento. Technical Report DTR 97.0413, CSELT, Centro Studi e Laboratori Telecomunicazioni, Telecom Italia Research Center, 1997.
    Note: Not available. In Italian. [bibtex-entry]
     
  2. O. Dalle. MPCFS : Un exemple d'intégration transparente des mécanismes de communication multi-points au sein des Systèmes d'Exploitation UNIX. Technical report I3S/RR97-10, INRIA / CNRS / UNSA, 1997. [bibtex-entry]
     
  3. T. Jiménez, P. Mussi, and G. Siegel. About Traces and Statistics Collection in Hipertrans. Technical report, hipertrans Project, July 1997. [bibtex-entry]
     
  4. T. Jiménez, P. Mussi, G. Siegel, and L. Villefranche. PACSIM Specification. Technical report, hipertrans Project, November 1997. [bibtex-entry]
     
  5. T. Jiménez, P. Mussi, and G. Siegel. An Object Oriented Framework for Traffic Simulation. Technical report, hipertrans Project, July 1997. [bibtex-entry]
     
1996
  1. F. Baude and O. Dalle. Analyse des performances de communication du protocole PVM. Rapport de recherche 96-08, Laboratoire I3S, UPRES-A 6070 CNRS-UNSA, Mars 1996. [bibtex-entry]
     
  2. O. Dalle. LoadBuilder: A tool for generating and modeling workloads in distributed workstations environments. Rapport de recherche RR-3045, INRIA, Octobre 1996.
    Note: Version longue. [bibtex-entry]
     
  3. L. Liquori. An Extended Theory of Primitive Objects. Technical Report CS-23-96, Computer Science Department, University of Turin, 1996. [bibtex-entry]
     
1995
  1. F. Baude, F. Belloncle, D. Caromel, N. Furmento, P. Mussi, Y. Roudier, and G. Siegel. Parallel Object-Oriented Programming for Parallel Simulations. Technical report, I3S No RR-95-59, December 1995. [bibtex-entry]
     
  2. P. Mussi and G. Siegel. Sequential Simulation in Prosit: Programming Model and Implementation. Technical report RR-2713, INRIA, November 1995. [bibtex-entry]
     
1994
  1. A. Jean-Marie, P. Mussi, and M. Syska. Communications in Multiprocessor Machines - A Survey. QMIPS Report D W3.T2-T3.19.v1, INRIA, September 1994. [bibtex-entry]
     
1991
  1. P. Mussi and H. Rakotoarisoa. PARallélisation sur réseaux de Transputers de Simulations pour l'EVALuation de performances. Rapport technique 131, INRIA Sophia Antipolis, Septembre 1991. [bibtex-entry]
     
1989
  1. F. Baccelli, M. Badel, A. Jean-Marie, Z. Liu, and P. Mussi. Specifications for Synchronization Primitives in the QNET Tool. Technical report, INRIA Sophia Antipolis, 1989. [bibtex-entry]
     
  2. A. Ferreira. An optimal ${O(n^2)}$ algorithm to fold special PLA's. Technical report, 1989.
    Note: (abstract). [bibtex-entry]
     
  3. P. Mussi and P. Nain. Description and Specifications for New Product-Form Queueing Network Stations. Technical report, INRIA Sophia Antipolis, 1989. [bibtex-entry]
     
  4. P. Mussi and P. Nain. On New Product-Form Queueing Network Stations. Technical report, INRIA Sophia Antipolis, 1989. [bibtex-entry]
     

BACK TO COATI PUBLICATION INDEX



Last modified: Sat Jan 29 19:00:43 2022