BACK TO COATI PUBLICATION INDEX

Publications of year 2015

Thesis
  1. Mohamed Amine BERGACH. Adaptation of the Fast Fourier Transform processing on hybride integrated CPU/GPU architecture. Theses, Université Nice Sophia Antipolis, October 2015. [WWW ] [PDF ]
    Keywords: FFT, GPGPU, CPU, SIMD, SIMT, AAA, OpenCL. [Abstract] [bibtex-entry]
     
  2. Fatima Zahra Moataz. Towards efficient and fault-tolerant optical networks : complexity and algorithms. Theses, Université Nice Sophia Antipolis, October 2015. [WWW ] [PDF ]
    Keywords: Routing and spectrum assignment, Tree-decomposition, Complexity, Asymmetric nodes, Forbidden transitions, Shared risk link group, Noeuds asymétriques, Transitions interdites, Groupe de liens partageant un risque, Routage et allocation de spectre, Décomposition arborescente, Complexité. [Abstract] [bibtex-entry]
     
Articles in journal or book's chapters
  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. Molecular and Cellular Proteomics, 14:2274-2284, April 2015. [WWW ] [PDF ]
    Keywords: Biophysics, Bioinformatics, Mathematical Modeling, connectivity inference, Algorithms, Mass Spectrometry, Structural Biology. [Abstract] [bibtex-entry]
     
  2. Omid Amini, David Coudert, and Nicolas Nisse. Non-deterministic graph searching in trees. Journal of Theoretical Computer Science (TCS), 580:101-121, May 2015. [WWW ] [PDF ]
    Keywords: Pathwidth, Trees, Graph Searching, Treewidth. [Abstract] [bibtex-entry]
     
  3. Julio Araujo, Nathann Cohen, Susanna F. De Rezende, Frédéric Havet, and Phablo Moura. On the proper orientation number of bipartite graphs. Journal of Theoretical Computer Science (TCS), 566:59-75, February 2015. [WWW ] [Abstract] [bibtex-entry]
     
  4. Julio Araujo, Frédéric Havet, and Mathieu Schmitt. Steinberg-like theorems for backbone colouring. Electronic Notes in Discrete Mathematics, pp 223-229, December 2015. [WWW ] [PDF ]
    Keywords: Graph Colouring, Planar Graph, Backbone Colouring, Steinberg's Conjecture. [Abstract] [bibtex-entry]
     
  5. Jorgen Bang-Jensen, Frédéric Havet, and Ana Karolinna MAIA DE OLIVEIRA. Finding a subdivision of a digraph. Theoretical Computer Science, 562:20, 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  6. Florent Becker, Adrian Kosowski, Martin Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, and Ioan Todinca. Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distributed Computing, 28(3):189-200, 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  7. Jean-Claude Bermond, David Coudert, Gianlorenzo D 'angelo, and Fatima Zahra Moataz. Finding disjoint paths in networks with star shared risk link groups. Journal of Theoretical Computer Science (TCS), 579:74-87, May 2015. [WWW ] [PDF ]
    Keywords: Diverse routing, Shared Risk Link Group, Complexity, Algorithms, Disjoint paths, Colored graph. [Abstract] [bibtex-entry]
     
  8. Jean-Claude Bermond, Bi Li, Nicolas Nisse, Hervé Rivano, and Min-Li Yu. Data gathering and personalized broadcasting in radio grids with interference. Journal of Theoretical Computer Science (TCS), 562:453-475, 2015. [WWW ] [PDF ]
    Keywords: Gathering, Personalized broadcasting, Interference, Grid, Radio networks. [Abstract] [bibtex-entry]
     
  9. Nathann Cohen, David Coudert, and Aurélien Lancin. On computing the Gromov hyperbolicity. ACM Journal on Experimental Algorithmics, 20(1):18, 2015. [WWW ] [PDF ]
    Keywords: Algorithms, Gromov Hyperbolicity, Networks. [Abstract] [bibtex-entry]
     
  10. David Coudert, Alvinice Kodjo, and Truong Khoa Phan. Robust Energy-aware Routing with Redundancy Elimination. Computers and Operations Research, 64:21, December 2015. [WWW ] [PDF ]
    Keywords: Robust Network Optimization, Green Networking, Energy-aware Routing, Redundancy Elimination. [Abstract] [bibtex-entry]
     
  11. Gianlorenzo d'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, and Karol Suchan. Computing on rings by oblivious robots: a unified approach for different tasks. Algorithmica, 72(4):1055-1096, 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  12. Olivier Delmas, Frédéric Havet, and Mickaël Montassier. Design of fault-tolerant on-board networks with variable switch sizes. Theoretical Computer Science, 562:15, 2015. [WWW ] [Abstract] [bibtex-entry]
     
  13. Frédéric Giroire, Ioannis Lamprou, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, and Ronan Soares. Connected Surveillance Game. Journal of Theoretical Computer Science (TCS), 584:131-143, June 2015. [WWW ] [PDF ]
    Keywords: Surveillance game, Cops and robber games, Prefetching, Online strategy, Competitive ratio, Cost of connectivity. [Abstract] [bibtex-entry]
     
  14. Frédéric Giroire, Joanna Moulierac, Truong Khoa Phan, and frederic roudaut. Minimization of network power consumption with redundancy elimination. Computer Communications, 59:98--105, March 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  15. Frédéric Giroire, Stéphane Pérennes, and Issam Tahiri. On the complexity of equal shortest path routing. Networks, 2015. [WWW ] [PDF ]
    Keywords: shortest path, routing, OSPF-ECMP protocol, maximum flow, NP-hard, approximation algorithms, inverse shortest path. [Abstract] [bibtex-entry]
     
  16. Frédéric Havet, A Karolinna Maia, and Min-Li Yu. Complexity of greedy edge-colouring. Journal of the Brazilian Computer Society, 21(18), 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  17. Adrian Kosowski, Bi Li, Nicolas Nisse, and Karol Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth. Algorithmica, 72(3):758-777, 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  18. Joanna Moulierac and Truong Khoa Phan. Optimizing IGP link weights for energy-efficiency in multi-period traffic matrices. Computer Communications, 61:11, May 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
Conference's articles
  1. Michele Borassi, David Coudert, Pierluigi Crescenzi, and Andrea Marino. On Computing the Hyperbolicity of Real-World Graphs. In 23rd Annual European Symposium on Algorithms (ESA), volume 9294 of Lecture Notes in Computer Science, Patras, Greece, pages 215-226, September 2015. Springer. [WWW ] [PDF ]
    Keywords: Hyperbolicity, Graph, Algorithm. [Abstract] [bibtex-entry]
     
  2. Augustin Chaintreau, Guillaume Ducoffe, Roxana Geambasu, and Mathias Lécuyer. Vers une plus grande transparence du Web. In ALGOTEL 2015 - 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France, June 2015. [WWW ] [PDF ]
    Keywords: Algorithmes d'apprentissage, Formes normales disjonctives monotones, Annonces publicitaires ciblées, Sécurité de l'information (Privacy). [Abstract] [bibtex-entry]
     
  3. David Coudert, Guillaume Ducoffe, and Nicolas Nisse. Structure vs métrique dans les graphes. In ALGOTEL 2015 - 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France, June 2015. [WWW ] [PDF ]
    Keywords: Genre, Hyperbolicité, Graphe, Largeur arborescente (Treewidth), Longueur arborescente (Treelength). [Abstract] [bibtex-entry]
     
  4. Frédéric Giroire, Frédéric Havet, and Joanna Moulierac. Compressing two-dimensional routing tables with order. In INOC (International Network Optimization Conference), Varsovie, Poland, May 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  5. Frédéric Giroire and Nicolas Huin. Study of Repair Protocols for Live Video Streaming Distributed Systems. In IEEE GLOBECOM 2015 - Global Communications Conference, San Diego, United States, December 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  6. Frédéric Giroire, Stephane Perennes, and Issam Tahiri. Grid spanners with low forwarding index for energy efficient networks. In International Network Optimization Conference (INOC), Electronic Notes in Discrete Mathematics, Warsaw, Poland, May 2015. [WWW ] [PDF ]
    Keywords: spanning subgraphs, forwarding index, energy saving, routing, grid. [Abstract] [bibtex-entry]
     
  7. Frédéric Giroire, Stéphane Pérennes, and Issam Tahiri. How to design graphs with low forwarding index and limited number of edges. In 26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Verona, Italy, October 2015. [WWW ] [PDF ]
    Keywords: graphs, forwarding index, routing, design problem, energy efficiency, extremal graphs. [Abstract] [bibtex-entry]
     
  8. Frédéric Havet, Nicolas Huin, Joanna Moulierac, and Khoa Phan. Routage vert et compression de règles SDN. In ALGOTEL 2015 - 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France, June 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  9. Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, and Nicolas Nisse. On paths in grids with forbidden transitions. In ALGOTEL 2015 - 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France, June 2015. [WWW ] [PDF ]
    Keywords: Forbidden transitions, planar graph, grid, asymmetric nodes. [Abstract] [bibtex-entry]
     
  10. Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, and Nicolas Nisse. Finding Paths in Grids with Forbidden Transitions. In WG 2015, 41st International Workshop on Graph-Theoretic Concepts in Computer Science, Munich, Germany, June 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  11. Alvinice Kodjo, Brigitte Jaumard, Napoleão Nepomuceno, Mejdi Kaddour, and David Coudert. Dimensioning microwave wireless networks. In ICC 2015 : IEEE International Conference on Communications, London, United Kingdom, pages 2803 - 2809, June 2015. IEEE. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  12. Bi Li, Fatima Zahra Moataz, Nicolas Nisse, and Karol Suchan. Minimum Size Tree-decompositions. In LAGOS 2015 -- VIII Latin-American Algorithms, Graphs and Optimization Symposium, Beberibe, Ceará, Brazil, May 2015. [WWW ] [PDF ]
    Keywords: Minimum size tree-decomposition, treewidth, NP-hard. [Abstract] [bibtex-entry]
     
  13. Nicolas Nisse, Alexandre Salch, and Valentin Weber. Comment appliquer les chaînes augmentantes pour atterrir a l'heure ?. In ALGOTEL 2015 - 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France, June 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  14. Myriana Rifai, Nicolas Huin, Christelle Caillouet, Frédéric Giroire, Dino Lopez Pacheco, Joanna Moulierac, and Guillaume Urvoy-Keller. Too many SDN rules? Compress them with MINNIE. In IEEE GLOBECOM, San diego, United States, December 2015. IEEE. [WWW ] [PDF ]
    Keywords: Software defined networks, experimentation, TCAM, number of rules. [Abstract] [bibtex-entry]
     
  15. Fatima Zahra Moataz. On Spectrum Assignment in Elastic Optical Tree-Networks. In ALGOTEL 2015 - 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France, June 2015. [WWW ] [PDF ]
    Keywords: interval coloring, routing and spectrum assignment, optical networks, Approximation algorithms. [Abstract] [bibtex-entry]
     
Internal reports
  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]
     
Miscellaneous
  1. Guillaume Ducoffe, Mathias Lécuyer, Augustin Chaintreau, and Roxana Geambasu. Web Transparency for Complex Targeting: Algorithms, Limits, and Tradeoffs. SIGMETRICS '15 Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, June 2015.
    Note: Poster. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     

BACK TO COATI PUBLICATION INDEX



Last modified: Fri Oct 20 15:06:02 2017