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
2J. Bang-Jensen, F. Havet, A. Yeo.

The complexity of finding arc-disjoint branching flows, in: Discrete Applied Mathematics, 2016, vol. 209, pp. 16-26. [ DOI : 10.1016/j.dam.2015.10.012 ]

https://hal.inria.fr/hal-01360910
3L. Blin, J. Burman, N. Nisse.

Exclusive Graph Searching, in: Algorithmica, February 2016. [ DOI : 10.1007/s00453-016-0124-0 ]

https://hal.archives-ouvertes.fr/hal-01266492
4C. Caillouet, S. Pérennes, H. Rivano.

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

http://hal.inria.fr/inria-00572967/en
5N. Cohen, D. Coudert, A. Lancin.

On computing the Gromov hyperbolicity, in: ACM Journal on Experimental Algorithmics, 2015, vol. 20, n^o 1, 18 p. [ DOI : 10.1145/2780652 ]

https://hal.inria.fr/hal-01182890
6D. Coudert, G. Ducoffe, N. Nisse.

To Approximate Treewidth, Use Treelength!, in: Siam Journal on Discrete Mathematics, 2016, vol. 30, n^o 3, 13 p. [ DOI : 10.1137/15M1034039 ]

https://hal.inria.fr/hal-01348965
7F. Giroire.

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

http://dx.doi.org/10.1016/j.dam.2008.06.020
8S. 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, n^o 4, pp. 900-926.

http://hal.inria.fr/hal-00821612
9F. 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, n^o 1, pp. 145–168.

http://hal.inria.fr/inria-00327909
10J. Moulierac, T. K. Phan.

Optimizing IGP link weights for energy-efficiency in multi-period traffic matrices, in: Computer Communications, May 2015, vol. 61, 11 p. [ DOI : 10.1016/j.comcom.2015.01.004 ]

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

Publications of the year

Doctoral Dissertations and Habilitation Theses

11G. Ducoffe.

Propriés Métriques des grands graphes – Metric Properties of large graphs, Université Côte d'Azur, 2016.

http://www-sop.inria.fr/members/Guillaume.Ducoffe/these/These-Guillaume-Ducoffe.pdf

Articles in International Peer-Reviewed Journals

12J. Araujo, F. Havet, C. Linhares Sales, A. Silva.

Proper orientation of cacti, in: Journal of Theoretical Computer Science (TCS), 2016, vol. 639, pp. 14-25. [ DOI : 10.1016/j.tcs.2016.05.016 ]

https://hal.inria.fr/hal-01338646
13J. Bang-Jensen, N. Cohen, F. Havet.

Finding good 2-partitions of digraphs II. Enumerable properties, in: Journal of Theoretical Computer Science (TCS), August 2016, vol. 640, pp. 1-19. [ DOI : 10.1016/j.tcs.2016.05.034 ]

https://hal.archives-ouvertes.fr/hal-01346079
14J. Bang-Jensen, F. Havet.

Finding good 2-partitions of digraphs I. Hereditary properties, in: Journal of Theoretical Computer Science (TCS), 2016, vol. 636, pp. 85–94. [ DOI : 10.1016/j.tcs.2016.05.029 ]

https://hal.archives-ouvertes.fr/hal-01327015
15J. Bang-Jensen, F. Havet, A. Yeo.

The complexity of finding arc-disjoint branching flows, in: Discrete Applied Mathematics, 2016, vol. 209, pp. 16-26. [ DOI : 10.1016/j.dam.2015.10.012 ]

https://hal.inria.fr/hal-01360910
16J.-C. Bermond, C. Gomes Huiban, P. Reyes.

Round weighting problem and gathering in radio networks with symmetrical interference, in: Discrete Mathematics, Algorithms and Applications, 2016, vol. 8, n^o 2, 57 p, 1650035. [ DOI : 10.1142/S179383091650035X ]

https://hal.archives-ouvertes.fr/hal-01407591
17J.-C. Bermond, A. Jean-Marie, D. Mazauric, J. Yu.

Well Balanced Designs for Data Placement, in: Journal of Combinatorial Designs, February 2016, vol. 24, n^o 2, pp. 55-76. [ DOI : 10.1002/jcd.21506 ]

https://hal.inria.fr/hal-01223288
18L. Blin, J. Burman, N. Nisse.

Exclusive Graph Searching, in: Algorithmica, February 2016. [ DOI : 10.1007/s00453-016-0124-0 ]

https://hal.archives-ouvertes.fr/hal-01266492
19D. Coudert, G. Ducoffe.

Data center interconnection networks are not hyperbolic, in: Theoretical Computer Science, 2016, vol. 639, pp. 72-90. [ DOI : 10.1016/j.tcs.2016.05.025 ]

https://hal.inria.fr/hal-01323301
20D. Coudert, G. Ducoffe.

On the hyperbolicity of bipartite graphs and intersection graphs, in: Discrete Applied Mathematics, 2016, vol. 214, pp. 187-195. [ DOI : 10.1016/j.dam.2016.06.017 ]

https://hal.inria.fr/hal-01220132
21D. Coudert, G. Ducoffe, N. Nisse.

To Approximate Treewidth, Use Treelength!, in: Siam Journal on Discrete Mathematics, 2016, vol. 30, n^o 3, 13 p. [ DOI : 10.1137/15M1034039 ]

https://hal.inria.fr/hal-01348965
22D. Coudert, D. Mazauric, N. Nisse.

Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth, in: ACM Journal of Experimental Algorithmics, 2016, vol. 21, n^o 1, 23 p. [ DOI : 10.1145/2851494 ]

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

Combinatorial optimization in networks with Shared Risk Link Groups, in: Discrete Mathematics and Theoretical Computer Science, May 2016, vol. Vol. 18, no 3, 25 p.

https://hal.inria.fr/hal-01053859
24G. D 'angelo, A. Navarra, N. Nisse.

A unified approach for Gathering and Exclusive Searching on rings under weak assumptions, in: Distributed Computing, 2016.

https://hal.archives-ouvertes.fr/hal-01326473
25N. Nisse, R. Pardo Soares.

On the Monotonicity of Process Number, in: Discrete Applied Mathematics, 2016, vol. 210, pp. 103-111.

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

International Conferences with Proceedings

26M. Bouznif, F. Havet, M. Preissmann.

Minimum-Density Identifying Codes in Square Grids, in: 11th International Conference, AAIM 2016, Bergamo, Italy, Lecture Notes in Computer Science, Springer, July 2016, vol. 9778, pp. 77-88. [ DOI : 10.1007/978-3-319-41168-2_7 ]

https://hal.inria.fr/hal-01346750
27N. Cohen, F. Havet, W. Lochet, N. Nisse.

Subdivisions of oriented cycles in digraphs with large chromatic number, in: Bordeaux Graph Wokshop 2016, Bordeaux, France, November 2016, pp. 85-88.

https://hal.archives-ouvertes.fr/hal-01411115
28N. Cohen, M. Hilaire, N. Martins, N. Nisse, S. Pérennes.

Spy-Game on graphs, in: 8th International Conference on Fun with Algorithms, FUN 2016, La Maddalena, Maddalena Islands, Italy, E. D. Demaine, F. Grandoni (editors), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2016, vol. 49. [ DOI : 10.4230/LIPIcs.FUN.2016.10 ]

https://hal.archives-ouvertes.fr/hal-01326446
29D. Coudert, G. Ducoffe.

Liens entre symétries et étirements de routages dans les réseaux d'interconnexions de centres de données, in: ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Bayonne, France, May 2016.

https://hal.archives-ouvertes.fr/hal-01302470
30R. Dantas, F. Havet, R. M. Sampaio.

Identifying codes for infinite triangular grids with a finite number of rows, in: Bordeaux Graph Workshop 2016, Bordeaux, France, November 2016.

https://hal.archives-ouvertes.fr/hal-01411109
31G. Ducoffe.

The Parallel Complexity of Coloring Games, in: 9th International Symposium, SAGT 2016, Liverpool, United Kingdom, M. Gairing, R. Savani (editors), Algorithmic Game Theory, Springer International Publishing, September 2016, n^o 9928, pp. 27-39. [ DOI : 10.1007/978-3-662-53354-3_3 ]

https://hal.archives-ouvertes.fr/hal-01361056
32G. Ducoffe, S. Legay, N. Nisse.

On the Complexity of Computing Treebreadth, in: 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, Helsinki, Finland, V. Mäkinen, S. J. Puglisi, L. Salmela (editors), Combinatorial Algorithms, Springer International Publishing, August 2016, n^o 9843, pp. 3-15. [ DOI : 10.1007/978-3-319-44543-4_1 ]

https://hal.inria.fr/hal-01354996
33F. Giroire, N. Huin.

Étude d'un système distribué de diffusion de vidéo en direct, in: ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Bayonne, France, May 2016.

https://hal.inria.fr/hal-01305116
34M. Rifai, N. Huin, C. Caillouet, F. Giroire, J. Moulierac, D. Lopez Pacheco, G. Urvoy-Keller.

MINNIE : enfin un monde SDN sans (trop de) règles, in: ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Bayonne, France, May 2016.

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

Internal Reports

35J. Araujo, G. Ducoffe, N. Nisse, K. Suchan.

On interval number in cycle convexity, Inria Sophia Antipolis ; I3S, 2016.

https://hal.inria.fr/hal-01394201
36J. Araujo, F. Giroire, Y. Y. Liu, R. Modrzejewski, J. Moulierac.

Energy Efficient Content Distribution, Inria, January 2016, n^o RR-8091, 27 p.

https://hal.inria.fr/hal-00743248
37J. Bang-Jensen, N. Cohen, F. Havet.

Finding good 2-partitions of digraphs II. Enumerable properties, Inria Sophia Antipolis - I3S, February 2016, n^o RR-8868.

https://hal.inria.fr/hal-01279338
38J. Bang-Jensen, F. Havet.

Finding good 2-partitions of digraphs I. Hereditary properties, Inria Sophia Antipolis - I3S, February 2016, n^o RR-8867.

https://hal.inria.fr/hal-01279332
39O. Baudon, J. Bensmail, H. Hocquard, M. Senhaji, E. Sopena.

On locally irregular decompositions of subcubic graphs, Université de bordeaux ; Université de Nice - Sophia Antipolis, 2016.

https://hal.archives-ouvertes.fr/hal-01398228
40O. Baudon, J. Bensmail, J. Przybyło, M. Woźniak.

On locally irregular decompositions and the 1-2 Conjecture in digraphs, Inria, CNRS, Université de Bordeaux, AGH University, September 2016.

https://hal.archives-ouvertes.fr/hal-01374427
41J.-C. Bermond, N. Cohen, D. Coudert, D. Letsios, I. Milis, S. Pérennes, V. Zissimopoulos.

Bin packing with colocations, Inria ; I3S, October 2016.

https://hal.inria.fr/hal-01381333
42M. Bouznif, F. Havet, M. Preissmann.

Minimum-density identifying codes in square grids, Inria Sophia Antipolis - I3S, January 2016, n^o RR-8845.

https://hal.inria.fr/hal-01259550
43N. Cohen, F. Havet, W. Lochet, N. Nisse.

Subdivisions of oriented cycles in digraphs with large chromatic number, LRI - CNRS, University Paris-Sud ; LIP - ENS Lyon ; Inria Sophia Antipolis - I3S, February 2016, n^o RR-8865, 25 p.

https://hal.inria.fr/hal-01277578
44N. Cohen, M. Hilaire, N. Martins, N. Nisse, S. Pérennes.

Spy-Game on graphs, Inria, February 2016, n^o RR-8869.

https://hal.inria.fr/hal-01279339
45D. Coudert.

A note on Integer Linear Programming formulations for linear ordering problems on graphs, Inria ; I3S ; Universite Nice Sophia Antipolis ; CNRS, February 2016, 33 p.

https://hal.inria.fr/hal-01271838
46D. Coudert, G. Ducoffe.

Clique-decomposition revisited, Inria Sophia Antipolis - I3S, February 2016.

https://hal.archives-ouvertes.fr/hal-01266147
47D. Coudert, G. Ducoffe, N. Nisse, M. Soto.

Distance-preserving orderings in graphs, Inria Sophia Antipolis, 2016, n^o RR-8973.

https://hal.inria.fr/hal-01393523
48D. Coudert, J. Luedtke, E. Moreno, K. Priftis.

Computing and maximizing the exact reliability of wireless backhaul networks, Inria Sophia Antipolis ; I3S, November 2016, 9 p.

https://hal.inria.fr/hal-01394593
49R. Dantas, F. Havet, R. Sampaio.

Identifying codes for infinite triangular grids with a finite number of rows, Inria Sophia Antipolis - I3S, August 2016, n^o RR-8951.

https://hal.inria.fr/hal-01358064
50G. Ducoffe, S. Legay, N. Nisse.

On computing tree and path decompositions with metric constraints on the bags, Inria Sophia Antipolis - Méditerranée ; LRI - CNRS, University Paris-Sud, January 2016, n^o RR-8842, 66 p.

https://hal.inria.fr/hal-01254917
51F. Giroire, N. Huin, J. Moulierac, K. Phan.

Energy-Aware Routing in Software-Defined Networks with Table Compression (using Wildcard Rules), Inria Sophia Antipolis - I3S, April 2016, n^o RR-8897.

https://hal.inria.fr/hal-01296992
52F. Giroire, J.-C. Maureira.

Analysis of the Failure Tolerance of Linear Access Networks, 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, n^o RR-8903.

https://hal.inria.fr/hal-01308241
53N. Huin, A. Tomassilli, F. Giroire, B. Jaumard.

Energy-Efficient Service Function Chain Provisioning, Inria Sophia Antipolis ; Université Côte d'Azur ; Cnrs ; Concordia University, November 2016, n^o RR-8980, 15 p.

https://hal.inria.fr/hal-01403967
54M. Rifai, N. Huin, C. Caillouet, F. Giroire, J. Moulierac, D. Lopez Pacheco, G. Urvoy-Keller.

MINNIE: an SDN World with Few Compressed Forwarding Rules, Inria Sophia-Antipolis ; I3S, January 2016, n^o RR-8848.

https://hal.inria.fr/hal-01264387
55A. Tomassilli, N. Huin, F. Giroire, B. Jaumard.

Energy-Efficient Service Chains with Network Function Virtualization, Inria Sophia Antipolis ; Université Côte d'Azur ; Cnrs ; Concordia University, October 2016, n^o RR-8979, 14 p.

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

Patents

56L. Hogie, M. Syska, N. Chleq.

BigGraphs: distributed graph computing, September 2016, n^o IDDN.FR.001.410005.000.S.P.2015.000.31235.

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

Other Publications

57P. Aboulker, J. Bang-Jensen, N. Bousquet, P. Charbit, F. Havet, F. Maffray, J. Zamora.

χ-bounded families of oriented graphs *, December 2016, working paper or preprint.

https://hal.inria.fr/hal-01412667
58J. Bensmail, M. Senhaji, K. Szabo Lyngsie.

Equitability, edge-injectivity, and the 1-2-3 Conjecture, September 2016, working paper or preprint.

https://hal.archives-ouvertes.fr/hal-01361482
59S.-G. Jeong, Y. Tarabalka, N. Nisse, J. Zerubia.

Progressive Tree-like Curvilinear Structure Reconstruction with Structured Ranking Learning and Graph Algorithm, December 2016, working paper or preprint.

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

Previous |

Home