EN FR
Homepage Inria website


Bibliography

Major publications by the team in recent years
  • 1D. Agarwal, J. Araujo, C. Caillouet, F. Cazals, D. Coudert, S. Perennes.

    Connectivity Inference in Mass Spectrometry based Structure Determination, in: European Symposium on Algorithms, Sophia-Antipolis, France, France, H. Bodlaender, G. Italiano (editors), Lecture Notes in Computer Science - LNCS, Springer, 2013, vol. 8125, pp. 289-300. [ DOI : 10.1007/978-3-642-40450-4_25 ]

    http://hal.inria.fr/hal-00849873
  • 2E. Altman, P. Nain, J.-C. Bermond.

    Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks, in: INFOCOM 2009, Rio De Janeiro, Brazil, April 2009, pp. 1431 - 1439.

    http://dx.doi.org/10.1109/INFCOM.2009.5062059
  • 3J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, F. Solano Donado.

    GMPLS Label Space Minimization through Hypergraph Layouts, in: Theoretical Computer Science, July 2012, vol. 444, pp. 3-16.

    http://hal.inria.fr/hal-00706260
  • 4J.-C. Bermond, F. Ergincan, M. Syska.

    Line Directed Hypergraphs, in: Cryptography and Security: From Theory to Applications – Essays Dedicated to Jean-Jacques Quisquater on the Occasion of His 65th Birthday, D. Naccache (editor), Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2012, vol. 6805, pp. 25-34. [ DOI : 10.1007/978-3-642-28368-0_5 ]

    http://hal.archives-ouvertes.fr/hal-00643785
  • 5C. Caillouet, S. Pérennes, H. Rivano.

    Framework for Optimizing the Capacity of Wireless Mesh Networks, in: Computer Communications, 2011, vol. 34, no 13, pp. 1645-1659.

    http://hal.inria.fr/inria-00572967/en
  • 6N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, N. Nisse.

    Tradeoffs in process strategy games with application in the WDM reconfiguration problem, in: Theoretical Computer Science (TCS), August 2011, vol. 412, no 35, pp. 4675-4687.

    http://dx.doi.org/10.1016/j.tcs.2011.05.002
  • 7F. V. Fomin, P. Fraigniaud, N. Nisse.

    Nondeterministic Graph Searching: From Pathwidth to Treewidth, in: Algorithmica, 2009, vol. 53, no 3, pp. 358-373.

    http://www.springerlink.com/content/42g5tp1588w89186/
  • 8F. V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, N. Nisse.

    To satisfy impatient Web surfers is hard, in: Journal of Theoretical Computer Science (TCS), March 2014, vol. 526, pp. 1-17. [ DOI : 10.1016/j.tcs.2014.01.009 ]

    https://hal.inria.fr/hal-00966985
  • 9F. Giroire.

    Order statistics and estimating cardinalities of massive data sets, in: Discrete Applied Mathematics, 2009, vol. 157, no 2, pp. 406-427.

    http://dx.doi.org/10.1016/j.dam.2008.06.020
  • 10F. Giroire, D. Mazauric, J. Moulierac.

    Energy Efficient Routing by Switching-Off Network Interfaces, in: Energy-Aware Systems and Networking for Sustainable Initiatives, N. Kaabouch, W.-C. Hu (editors), IGI Global, 2012, pp. 207-236.

    http://hal.inria.fr/hal-00759894
  • 11S. Guillemot, F. Havet, C. Paul, A. Perez.

    On the (non-)existence of polynomial kernels for P_l-free edge modification problems, in: Algorithmica, 2013, vol. 65, no 4, pp. 900-926.

    http://hal.inria.fr/hal-00821612
  • 12F. Havet, B. Reed, J.-S. Sereni.

    Griggs and Yeh's Conjecture and L(p,1)-labelings, in: Siam Journal on Discrete Mathematics, February 2012, vol. 26, no 1, pp. 145–168.

    http://hal.inria.fr/inria-00327909
Publications of the year

Doctoral Dissertations and Habilitation Theses

Articles in International Peer-Reviewed Journals

  • 19J. Araujo, J.-C. Bermond, G. Ducoffe.

    Eulerian and Hamiltonian dicycles in directed hypergraphs, in: Discrete Mathematics, Algorithms and Applications, 2014, vol. 06, 1450012. [ DOI : 10.1142/S1793830914500128 ]

    https://hal.archives-ouvertes.fr/hal-01104634
  • 20J. Araujo, N. Cohen, S. F. De Rezende, F. Havet, P. Moura.

    On the proper orientation number of bipartite graphs, in: Journal of Theoretical Computer Science (TCS), February 2015, vol. 566, pp. 59-75. [ DOI : 10.1016/j.tcs.2014.11.037 ]

    https://hal.archives-ouvertes.fr/hal-01101578
  • 21J. Araujo, N. Nisse, S. Pérennes.

    Weighted Coloring in Trees, in: Siam Journal on Discrete Mathematics, 2014, vol. 28, no 4, pp. 2029 - 2041. [ DOI : 10.1137/140954167 ]

    https://hal.inria.fr/hal-01109194
  • 22J. Bang-Jensen, F. Havet, A. K. Maia de Oliveira.

    Finding a subdivision of a digraph, in: Theoretical Computer Science, 2015, vol. 562, 20 p.

    https://hal.inria.fr/hal-01111374
  • 23J.-C. Bermond, B. Li, N. Nisse, H. Rivano, M.-L. Yu.

    Data gathering and personalized broadcasting in radio grids with interference, in: Journal of Theoretical Computer Science (TCS), October 2014, 23 p. [ DOI : 10.1016/j.tcs.2014.10.029 ]

    https://hal.inria.fr/hal-01084996
  • 24V. Campos, C. Linhares Sales, A. K. Maia de Oliveira, R. Sampaio.

    Maximization Coloring Problems on graphs with few P4s, in: Discrete Applied Mathematics, February 2014, vol. 164, no 2, pp. 539-546. [ DOI : 10.1016/j.dam.2013.10.031 ]

    https://hal.inria.fr/hal-00951135
  • 25G. Classen, D. Coudert, A. Koster, N. Nepomuceno.

    Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks, in: INFORMS Journal on Computing, 2014, vol. 26, no 4, pp. 893-909. [ DOI : 10.1287/ijoc.2014.0605 ]

    https://hal.inria.fr/hal-01070780
  • 26D. Coudert, G. Ducoffe.

    Recognition of C4-free and 1/2-hyperbolic graphs, in: Siam Journal on Discrete Mathematics, September 2014, vol. 28, no 3, pp. 1601-1617. [ DOI : 10.1137/140954787 ]

    https://hal.inria.fr/hal-01070768
  • 27O. Delmas, F. Havet, M. Montassier.

    Design of fault-tolerant on-board networks with variable switch sizes, in: Theoretical Computer Science, 2015, vol. 562, 15 p.

    https://hal.inria.fr/hal-01111370
  • 28F. V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, N. Nisse.

    To satisfy impatient Web surfers is hard, in: Journal of Theoretical Computer Science (TCS), March 2014, vol. 526, pp. 1-17. [ DOI : 10.1016/j.tcs.2014.01.009 ]

    https://hal.inria.fr/hal-00966985
  • 29F. Havet, A. D. King.

    List circular backbone colouring, in: Discrete Mathematics and Theoretical Computer Science, 2014, vol. 16, no 1.

    https://hal.inria.fr/hal-00957260
  • 30F. Havet, A. D. King, M. Liedloff, I. Todinca.

    (Circular) backbone colouring: Forest backbones in planar graphs, in: Discrete Applied Mathematics, 2014, vol. 169, pp. 119-134. [ DOI : 10.1016/j.dam.2014.01.011 ]

    https://hal.inria.fr/hal-00957243
  • 31F. Havet, N. Paramaguru, R. Sampathkumar.

    Detection number of bipartite graphs and cubic graphs, in: Discrete Mathematics and Theoretical Computer Science, 2014, vol. 16, no 3, 10 p.

    https://hal.inria.fr/hal-01110978

International Conferences with Proceedings

  • 32J. Araujo, N. Cohen, S. de Rezende, F. Havet, P. Moura.

    On the proper orientation number of bipartite graphs, in: 9th International colloquium on graph theory and combinatorics, Grenoble, France, June 2014.

    https://hal.archives-ouvertes.fr/hal-01076904
  • 33J. Araujo, N. Nisse, S. Pérennes.

    Weighted Coloring in Trees, in: 31st Symposium on Theoretical Aspects of Computer Science (STACS), Lyon, France, Dagstuhl Publishing, March 2014, pp. 75-86.

    https://hal.inria.fr/hal-00931523
  • 34D. Coudert, B. Jaumard, F. Z. Moataz.

    Dynamic Routing and Spectrum Assignment with Non-Disruptive Defragmentation, in: ALGOTEL 2014 – 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Le Bois-Plage-en-Ré, France, June 2014, pp. 1-4.

    https://hal.archives-ouvertes.fr/hal-00983492
  • 35D. Coudert, A. Kodjo, K. Phan.

    Robust Optimization for Energy-aware Routing with Redundancy Elimination, in: ALGOTEL 2014 – 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Le-Bois-Plage-en-Ré, France, June 2014, pp. 1-4.

    https://hal.inria.fr/hal-00982366
  • 36D. Coudert, D. Mazauric, N. Nisse.

    Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth, in: 13th International Symposium on Experimental Algorithms, Copenhagen, Denmark, Lecture Notes in Computer Science, 2014, vol. 8504, pp. 46-58.

    https://hal.inria.fr/hal-00966851
  • 37G. D'Angelo, X. Défago, N. Nisse.

    Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments, in: Second International Symposium on Computing and Networking (CANDAR), Mt. Fuji, Shizuoka, Japan, December 2014.

    https://hal.inria.fr/hal-01072723
  • 38G. D'Angelo, A. Navarra, N. Nisse.

    Gathering and Exclusive Searching on Rings under Minimal Assumptions, in: 15th International Conference on Distributed Computing and Networking (ICDCN), Coimbatore, India, M. Chatterjee, J.-N. Cao, K. Kothapalli, S. Rajsbaum (editors), Springer, January 2014, vol. 8314, pp. 149-164. [ DOI : 10.1007/978-3-642-45249-9_10 ]

    https://hal.inria.fr/hal-00931514
  • 39F. Giroire, J. Moulierac, T. Khoa Phan.

    Optimizing Rule Placement in Software-Defined Networks for Energy-aware Routing, in: IEEE GLOBECOM, Austin Texas, United States, IEEE, December 2014.

    https://hal.inria.fr/hal-01070576
  • 40M. Lecuyer, G. Ducoffe, F. Lan, A. Papancea, T. Petsios, R. Spahn, A. Chaintreau, R. Geambasu.

    XRay: Enhancing the Web's Transparency with Differential Correlation, in: USENIX Security Symposium, San Diego, United States, August 2014, Extended version of a paper presented at the 23rd USENIX Security Symposium (USENIX Security 14).

    https://hal.archives-ouvertes.fr/hal-01100757

Conferences without Proceedings

  • 41A. Kodjo, D. Coudert, C. Caillouet-Molle.

    Optimisation robuste pour le partage de réseaux d'accès micro-ondes entre opérateurs, in: ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Bordeaux, France, February 2014.

    https://hal.archives-ouvertes.fr/hal-00946419
  • 42B. Li, F. Z. Moataz, N. Nisse.

    Minimum Size Tree-Decompositions, in: 9th International colloquium on graph theory and combinatorics (ICGT), Grenoble, France, 2014.

    https://hal.inria.fr/hal-01023904

Internal Reports

  • 43D. Agarwal, C. Caillouet, D. Coudert, F. Cazals.

    Unveiling Contacts within Macro-molecular assemblies by solving Minimum Weight Connectivity Inference Problems, Inria, October 2014, no RR-8622.

    https://hal.archives-ouvertes.fr/hal-01078378
  • 44J. Araujo, N. Cohen, S. F. De Rezende, F. Havet, P. Moura.

    On the proper orientation number of bipartite graphs, March 2014, no RR-8492, 23 p.

    https://hal.inria.fr/hal-00957453
  • 45J. Araujo, F. Havet, M. Schmitt.

    Steinberg-like theorems for backbone colouring, Inria Sophia Antipolis, November 2014, no RR-8641.

    https://hal.inria.fr/hal-01088698
  • 46J. Bang-Jensen, F. Havet, A. Yeo.

    The complexity of finding arc-disjoint branching flows, Inria Sophia Antipolis, November 2014, no RR-8640.

    https://hal.inria.fr/hal-01088664
  • 47N. Cohen, D. Coudert, G. Ducoffe, A. Lancin.

    Applying clique-decomposition for computing Gromov hyperbolicity, June 2014, no RR-8535, 33 p.

    https://hal.inria.fr/hal-00989024
  • 48D. Coudert, G. Ducoffe.

    On the recognition of C4-free and 1/2-hyperbolic graphs, January 2014, no RR-8458, 20 p.

    https://hal.inria.fr/hal-00937935
  • 49D. Coudert, G. Ducoffe, N. Nisse.

    Diameter of Minimal Separators in Graphs, Inria Sophia Antipolis ; I3S, November 2014, no RR-8639, 16 p.

    https://hal.inria.fr/hal-01088423
  • 50D. Coudert, A. Kodjo, K. Phan.

    Robust Energy-aware Routing with Redundancy Elimination, January 2014, no RR-8457.

    https://hal.inria.fr/hal-00936745
  • 51D. Coudert, D. Mazauric, N. Nisse.

    Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth, February 2014, no RR-8470, 301 p.

    https://hal.inria.fr/hal-00943549
  • 52D. Coudert, S. Pérennes, H. Rivano, M.-E. Voge.

    Combinatorial optimization in networks with Shared Risk Link Groups, July 2014, no RR-8575, 26 p.

    https://hal.inria.fr/hal-01053859
  • 53G. D'Angelo, X. Défago, N. Nisse.

    Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments, Inria, 2014, no RR-8614.

    https://hal.inria.fr/hal-01073368
  • 54F. Fomin, P. Fraigniaud, N. Nisse, D. M. Thilikos.

    Report on GRASTA 2014, 6th Workshop on GRAph Searching, Theory and Applications, 2014.

    https://hal.archives-ouvertes.fr/hal-01084230
  • 55F. Giroire, F. Havet, J. Moulierac.

    Compressing Two-dimensional Routing Tables with Order, Inria Sophia Antipolis, December 2014, no RR-8658.

    https://hal.inria.fr/hal-01097910
  • 56F. Giroire, J. Moulierac, T. K. Phan.

    Optimizing Rule Placement in Software-Defined Networks for Energy-aware Routing, May 2014, no RR-8537, 23 p.

    https://hal.inria.fr/hal-00996780
  • 57F. Giroire, S. Pérennes, I. Tahiri.

    Grid spanners with low forwarding index for energy efficient networks, Inria Sophia Antipolis, December 2014, no RR-8643.

    https://hal.inria.fr/hal-01095179
  • 58F. Havet, B. Lidicky.

    Splitting a tournament into two subtournaments with given minimum outdegree, February 2014, no RR-8469.

    https://hal.inria.fr/hal-00943152
  • 59M. M. Kanté, F. Z. Moataz, B. Momège, N. Nisse.

    Finding Paths in Grids with Forbidden Transitions, Inria Sophia Antipolis ; Université Nice Sophia Antipolis ; CNRS, February 2015.

    https://hal.inria.fr/hal-01115395
  • 60B. Li, F. Z. Moataz, N. Nisse, K. Suchan.

    Size-Constrained Tree Decompositions, Inria Sophia-Antipolis, October 2014.

    https://hal.inria.fr/hal-01074177
  • 61E. Markou, N. Nisse, S. Pérennes.

    Exclusive Graph Searching vs. Pathwidth, 2014, no RR-8523.

    https://hal.inria.fr/hal-00980877
  • 62J. Moulierac, K. Phan.

    Optimizing IGP Link Weights for Energy-efficiency in a Changing World, May 2014, no RR-8534, 21 p.

    https://hal.inria.fr/hal-00996779
References in notes
  • 63D. Agarwal, J. Araujo, C. Caillouet, F. Cazals, D. Coudert, S. Perennes.

    Connectivity Inference in Mass Spectrometry based Structure Determination, in: European Symposium on Algorithms, Sophia-Antipolis, France, France, H. Bodlaender, G. Italiano (editors), Springer, September 2013, vol. 8125, pp. 289-300. [ DOI : 10.1007/978-3-642-40450-4_25 ]

    https://hal.inria.fr/hal-00849873