Access content directly

Florent Foucaud

83
Documents

Publications

Image document

Extremal digraphs for open neighbourhood location-domination and identifying codes

Florent Foucaud , Narges Ghareghani , Pouyeh Sharifani
Discrete Applied Mathematics, In press, 347, pp.62-74. ⟨10.1016/j.dam.2023.12.018⟩
Journal articles hal-04398730v1
Image document

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly

Laurent Beaudou , Caroline Brosse , Oscar Defrain , Florent Foucaud , Aurélie Lagoutte
Discrete Mathematics and Theoretical Computer Science, 2024, vol. 25:2 (Graph Theory), ⟨10.46298/dmtcs.8715⟩
Journal articles hal-03406709v1
Image document

Neighbourhood complexity of graphs of bounded twin-width

Édouard Bonnet , Florent Foucaud , Tuomo Lehtilä , Aline Parreau
European Journal of Combinatorics, 2024, 115, pp.103772. ⟨10.1016/j.ejc.2023.103772⟩
Journal articles hal-04177614v1

Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups

Sanjana Dey , Florent Foucaud , Subhas Nandy , Arunabha Sen
Algorithmica, 2023, 85 (7), pp.1850-1882. ⟨10.1007/s00453-022-01073-0⟩
Journal articles hal-04145915v1
Image document

Extended Double Covers and Homomorphism Bounds of Signed Graphs

Florent Foucaud , Reza Naserasr , Rongxing Xu
The Electronic Journal of Combinatorics, 2023, 30 (3), pp.P3.31. ⟨10.37236/10754⟩
Journal articles hal-03356591v2
Image document

The RED-BLUE SEPARATION problem on graphs

Subhadeep Ranjan Dev , Sanjana Dey , Florent Foucaud , Ralf Klasing , Tuomo Lehtilä
Theoretical Computer Science, 2023, 970, pp.114061. ⟨10.1016/j.tcs.2023.114061⟩
Journal articles hal-03854400v1
Image document

Bounds and Extremal Graphs for Total Dominating Identifying Codes

Florent Foucaud , Tuomo Lehtilä
The Electronic Journal of Combinatorics, 2023, 30 (3), ⟨10.37236/11342⟩
Journal articles hal-04173548v1
Image document

Revisiting and Improving Upper Bounds for Identifying Codes

Florent Foucaud , Tuomo Lehtilä
SIAM Journal on Discrete Mathematics, 2022, 36 (4), pp.2619-2634. ⟨10.1137/22M148999X⟩
Journal articles hal-03849449v1
Image document

Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity

Florent Foucaud , Hervé Hocquard , Dimitri Lajou , Valia Mitsou , Théo Pierron
Algorithmica, 2022, 84 (5), pp.1183-1212. ⟨10.1007/s00453-021-00918-4⟩
Journal articles hal-03658581v1
Image document

Smallest $C_{2l+1}$-critical graphs of odd-girth $2k+1$

Laurent Beaudou , Florent Foucaud , Reza Naserasr
Discrete Applied Mathematics, 2022, 319, pp.564 - 575. ⟨10.1016/j.dam.2021.08.040⟩
Journal articles hal-03784719v1
Image document

Problems Related to a Conjecture on Location-Domination in Twin-Free Graphs

Florent Foucaud
Indian Journal of Discrete Mathematics, 2022, 8 (1), pp.39-41
Journal articles hal-03784417v1
Image document

Monitoring the edges of a graph using distances

Florent Foucaud , Shih-Shun Kao , Ralf Klasing , Mirka Miller , Joe Ryan
Discrete Applied Mathematics, 2022, 319, pp.425-438
Journal articles hal-03043870v2
Image document

Complexity and algorithms for injective edge-coloring in graphs

Florent Foucaud , Hervé Hocquard , Dimitri Lajou
Information Processing Letters, 2021, 170, pp.106121. ⟨10.1016/j.ipl.2021.106121⟩
Journal articles hal-03201544v1
Image document

Exact square coloring of subcubic planar graphs

Florent Foucaud , Hervé Hocquard , Suchismita Mishra , Narayanan Narayanan , Reza Naserasr
Discrete Applied Mathematics, 2021, 293, pp.74-89. ⟨10.1016/j.dam.2021.01.007⟩
Journal articles hal-02925881v3
Image document

Characterizing extremal graphs for open neighbourhood location-domination

Florent Foucaud , Narges Ghareghani , Aida Roshany-Tabrizi , Pouyeh Sharifani
Discrete Applied Mathematics, 2021, 302, pp.76-79. ⟨10.1016/j.dam.2021.06.006⟩
Journal articles hal-03540625v1
Image document

Complexity of planar signed graph homomorphisms to cycles

François Dross , Florent Foucaud , Valia Mitsou , Pascal Ochem , Théo Pierron
Discrete Applied Mathematics, 2020, 284, pp.166-178. ⟨10.1016/j.dam.2020.03.029⟩
Journal articles hal-02990576v1
Image document

Domination and location in twin-free digraphs

Florent Foucaud , Shahrzad Heydarshahi , Aline Parreau
Discrete Applied Mathematics, 2020, 284, pp.42-52. ⟨10.1016/j.dam.2020.03.025⟩
Journal articles hal-03041356v1
Image document

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs

Antoine Dailly , Florent Foucaud , Adriana Hansberg
Discrete Mathematics, 2019, 342 (11), pp.3142-3159. ⟨10.1016/j.disc.2019.06.023⟩
Journal articles hal-01959683v1

Broadcast domination and multipacking: bounds and the integrality gap

Laurent Beaudou , Richard C. Brewster , Florent Foucaud
The Australasian Journal of Combinatorics, 2019, 74 (1), pp.86-97
Journal articles hal-03041313v1
Image document

Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs

Laurent Beaudou , Florent Foucaud , Reza Naserasr
Discrete Applied Mathematics, 2019, 261, pp.40-51. ⟨10.1016/j.dam.2018.09.004⟩
Journal articles hal-01915269v1
Image document

Complexity of Grundy coloring and its variants

Edouard Bonnet , Foucaud Florent , Eunjung Kim , Florian Sikora
Discrete Applied Mathematics, 2018
Journal articles hal-01991659v1
Image document

Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension

Laurent Beaudou , Peter Dankelmann , Florent Foucaud , Michael Antony Henning , Arnaud Mary
SIAM Journal on Discrete Mathematics, 2018, 32 (2), pp.902 - 918. ⟨10.1137/16M1097833⟩
Journal articles hal-01848648v1

Parameterized and approximation complexity of the detection pair problem in graphs

Florent Foucaud , Ralf Klasing
Journal of Graph Algorithms and Applications, 2017, 21 (6), pp.1039 - 1056. ⟨10.7155/jgaa.00449⟩
Journal articles hal-01871140v1

Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity

Florent Foucaud , George B. Mertzios , Reza Naserasr , Aline Parreau , Petru Valicov
Algorithmica, 2017, 78 (3), pp.914-944. ⟨10.1007/s00453-016-0184-1⟩
Journal articles hal-01198784v1

Random subgraphs make identification affordable

Florent Foucaud , Guillem Perarnau , Oriol Serra
Journal of Combinatorics, 2017, 8 (1), pp.57-77. ⟨10.4310/JOC.2017.v8.n1.a3⟩
Journal articles hal-03041297v1

Location-domination in line graphs

Florent Foucaud , Michael Henning
Discrete Mathematics, 2017, 340 (1), pp.3140-3153. ⟨10.1016/j.disc.2016.05.020⟩
Journal articles hal-03041286v1

The complexity of tropical graph homomorphisms.

Florent Foucaud , Ararat Harutyunyan , Pavol Hell , Sylvain Legay , Yannis Manoussakis
Discrete Applied Mathematics, 2017, 229, pp.64-81. ⟨10.1016/j.dam.2017.04.027⟩
Journal articles hal-01520739v1
Image document

Structural properties of recursively partitionable graphs with connectivity 2

Olivier Baudon , Julien Bensmail , Florent Foucaud , Monika Pilsniak
Discussiones Mathematicae Graph Theory, 2017, 37, pp.89-115. ⟨10.7151/dmgt.1925⟩
Journal articles hal-00672505v4

Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds

Florent Foucaud , George B. Mertzios , Reza Naserasr , Aline Parreau , Petru Valicov
Theoretical Computer Science, 2017, 668, pp.43-58. ⟨10.1016/j.tcs.2017.01.006⟩
Journal articles hal-01198783v1

Homomorphism bounds and edge-colourings of K4-minor-free graphs

Laurent Beaudou , Florent Foucaud , Reza Naserasr
Journal of Combinatorial Theory, Series B, 2017, 124, pp.128-164. ⟨10.1016/j.jctb.2017.01.001⟩
Journal articles hal-01520741v1

Location-domination and matching in cubic graphs

Florent Foucaud , Michael Henning
Discrete Mathematics, 2016, 339 (4), pp.1221-1231. ⟨10.1016/j.disc.2015.11.016⟩
Journal articles hal-03041274v1

Locating-total dominating sets in twin-free graphs: a conjecture

Florent Foucaud , Michael A. Henning
The Electronic Journal of Combinatorics, 2016, 23 (3), pp.P3.9
Journal articles hal-03041282v1

Locating–dominating sets in twin-free graphs

Florent Foucaud , Michael Henning , Christian Löwenstein , Thomas Sasse
Discrete Applied Mathematics, 2016, 200, pp.52-58. ⟨10.1016/j.dam.2015.06.038⟩
Journal articles hal-03041273v1

Large Subgraphs without Short Cycles

Florent Foucaud , M. Krivelevich , G. Perarnau
SIAM Journal on Discrete Mathematics, 2015, 29 (1), pp.65-78. ⟨10.1137/140954416⟩
Journal articles hal-03041235v1

Locating-dominating sets and identifying codes in graphs of girth at least 5

Camino Balbuena , Florent Foucaud , Adriana Hansberg
The Electronic Journal of Combinatorics, 2015, 22 (2), pp.P2.15
Journal articles hal-03041268v1
Image document

Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes

Florent Foucaud
Journal of Discrete Algorithms, 2015, 31, pp.48-68
Journal articles hal-00923356v1

On the structure of arbitrarily partitionable graphs with given connectivity

Olivier Baudon , Florent Foucaud , Jakub Przybylo , Mariusz Woźniak
Discrete Applied Mathematics, 2014, 162, pp.381-385. ⟨10.1016/j.dam.2013.09.007⟩
Journal articles hal-00918947v1

Centroidal bases in graphs

Florent Foucaud , Ralf Klasing , Peter J. Slater
Networks, 2014, 64 (2), pp.96-108. ⟨10.1002/net.21560⟩
Journal articles hal-01428804v1
Image document

An improved lower bound for (1,<=2)-identifying codes in the king grid

Florent Foucaud , Tero Laihonen , Aline Parreau
Advances in Mathematics of Communications, 2014, 8 (1), pp.35-52. ⟨10.3934/amc.2014.8.35⟩
Journal articles hal-00639998v1
Image document

Identifying codes in line graphs

Florent Foucaud , Sylvain Gravier , Reza Naserasr , Aline Parreau , Petru Valicov
Journal of Graph Theory, 2013, 73 (4), pp.425-448. ⟨10.1002/jgt.21686⟩
Journal articles hal-00605406v2
Image document

Identifying path covers in graphs

Florent Foucaud , Matjaz Kovse
Journal of Discrete Algorithms, 2013, 23, pp.21-34. ⟨10.1016/j.jda.2013.07.006⟩
Journal articles hal-00957969v1
Image document

Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets

Florent Foucaud , Reza Naserasr , Aline Parreau
Graphs and Combinatorics, 2013, 29 (3), pp.463-473. ⟨10.1007/s00373-012-1136-4⟩
Journal articles hal-00526446v3
Image document

Locally identifying colourings for graphs with given maximum degree

Florent Foucaud , Iiro Honkala , Tero Laihonen , Aline Parreau , Guillem Perarnau
Discrete Mathematics, 2012, 312 (10), pp.1832--1837. ⟨10.1016/j.disc.2012.01.034⟩
Journal articles hal-00614513v2
Image document

On the size of identifying codes in triangle-free graphs

Florent Foucaud , Ralf Klasing , Adrian Kosowski , André Raspaud
Discrete Applied Mathematics, 2012, 160 (10-11), pp.1532-1546. ⟨10.1016/j.dam.2012.02.009⟩
Journal articles hal-00530172v3
Image document

Bounds for identifying codes in terms of degree parameters

Florent Foucaud , Guillem Perarnau
The Electronic Journal of Combinatorics, 2012, 19, pp.P32
Journal articles hal-00578230v5
Image document

Extremal graphs for the identifying code problem

Florent Foucaud , Eleonora Guerrini , Matjaz Kovse , Reza Naserasr , Aline Parreau
European Journal of Combinatorics, 2011, 32 (4), pp.628-638. ⟨10.1016/j.ejc.2011.01.002⟩
Journal articles hal-00477467v4
Image document

Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity

Florent Foucaud , Pierre-Marie Marcille , Zin Mar Myint , R. B. Sandeep , Sagnik Sen
10th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2024), Feb 2024, Bhilai, India. pp.29-43, ⟨10.1007/978-3-031-52213-0_3⟩
Conference papers hal-04396469v1
Image document

New Bounds and Constructions for Neighbor-Locating Colorings of Graphs

Dipayan Chakraborty , Florent Foucaud , Soumen Nandi , Sagnik Sen , D K Supraja
9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023), Feb 2023, Gandhinagar, India. pp.121-133, ⟨10.1007/978-3-031-25211-2_9⟩
Conference papers hal-03965313v1
Image document

Algorithms and Hardness for Metric Dimension on Digraphs

Antoine Dailly , Florent Foucaud , Anni Hakanen
49th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2023), Jun 2023, fribourg, Switzerland. pp.232-245, ⟨10.1007/978-3-031-43380-1_17⟩
Conference papers hal-04216265v2
Image document

Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs

Sandip Das , Florent Foucaud , Sk Samim Islam , Joydeep Mukherjee
9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023), Feb 2023, Gandhinagar, India. pp.297-308, ⟨10.1007/978-3-031-25211-2_23⟩
Conference papers hal-03974126v1
Image document

On Three Domination-Based Identification Problems in Block Graphs

Dipayan Chakraborty , Florent Foucaud , Aline Parreau , Annegret Wagler
9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023), Feb 2023, Gandhinagar, India. pp.271-283, ⟨10.1007/978-3-031-25211-2_21⟩
Conference papers hal-03974121v1
Image document

Parameterizing Path Partitions

Henning Fernau , Florent Foucaud , Kevin Mann , Utkarsh Padariya , K. N. Rajath Rao
13th International Conference on Algorithms and Complexity (CIAC 2023), Jun 2023, Larnaca, Cyprus. pp.187-201, ⟨10.1007/978-3-031-30448-4_14⟩
Conference papers hal-04085831v3
Image document

Isometric Path Complexity of Graphs

Dibyayan Chakraborty , Jérémie Chalopin , Florent Foucaud , Yann Vaxès
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), Aug 2023, Bordeaux, France. pp.32:1-32:14, ⟨10.4230/LIPIcs.MFCS.2023.32⟩
Conference papers hal-04184516v1
Image document

Distance-Based Covering Problems for Graphs of Given Cyclomatic Number

Dibyayan Chakraborty , Florent Foucaud , Anni Hakanen
24th International Symposium on Fundamentals of Computation Theory (FCT 2023), Sep 2023, Trier, Germany. pp.132-146, ⟨10.1007/978-3-031-43587-4_10⟩
Conference papers hal-04214541v1
Image document

Identifying codes in bipartite graphs of given maximum degree

Dipayan Chakraborty , Florent Foucaud , Tuomo Lehtilä
12th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023), Sep 2023, Huatulco, Oaxaca, México, Mexico. pp.157-165, ⟨10.1016/j.procs.2023.08.225⟩
Conference papers hal-04213143v1
Image document

Monitoring edge-geodetic sets in graphs

Florent Foucaud , Krishna Narayanan , Lekshmi Ramasubramony Sulochana
9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023), Feb 2023, Gandhinagar, India. pp.245-256, ⟨10.1007/978-3-031-25211-2_19⟩
Conference papers hal-03812622v1
Image document

The Red-Blue Separation Problem on Graphs

Subhadeep Ranjan Dev , Sanjana Dey , Florent Foucaud , Ralf Klasing , Tuomo Lehtilä
IWOCA 2022, Jun 2022, Trier, Germany. pp.285-298, ⟨10.1007/978-3-031-06678-8_21⟩
Conference papers hal-03711361v1

On graphs coverable by k shortest paths

Maël Dumas , Florent Foucaud , Anthony Perez , Ioan Todinca
33rd International Symposium on Algorithms and Computation (ISAAC 2022), Dec 2022, Seoul, South Korea. pp.40:1--40:15, ⟨10.4230/LIPIcs.ISAAC.2022.40⟩
Conference papers hal-03895886v1
Image document

Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond

Dibyayan Chakraborty , Antoine Dailly , Sandip Das , Florent Foucaud , Harmender Gahlawat
33rd International Symposium on Algorithms and Computation (ISAAC 2022), Dec 2022, Seoul, France. pp.12:1--12:17, ⟨10.4230/LIPIcs.ISAAC.2022.12⟩
Conference papers hal-03899912v1
Image document

Cliques in exact distance powers of graphs of given maximum degree

Florent Foucaud , Suchismita Mishra , Narayanan Narayanan , Reza Naserasr , Petru Valicov
LAGOS 2021 - 11th Latin and American Algorithms, Graphs and Optimisation Symposium, May 2021, Sao Paulo, Brazil. pp.427-436, ⟨10.1016/j.procs.2021.11.052⟩
Conference papers hal-03540673v1
Image document

Monitoring the edges of a graph using distances

Florent Foucaud , Ralf Klasing , Mirka Miller , Joe Ryan
Proceedings of the 6th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), Feb 2020, Hyderabad, India. pp.28-40, ⟨10.1007/978-3-030-39219-2_3⟩
Conference papers hal-02500423v1

On the Complexity of Broadcast Domination and Multipacking in Digraphs

Florent Foucaud , Benjamin Gras , Anthony Perez , Florian Sikora
Combinatorial Algorithms - 31st International Workshop, Jun 2020, Bordeaux, France. pp.264-276, ⟨10.1007/978-3-030-48966-3_20⟩
Conference papers hal-02793880v1

Smallest $C_{2l+1}$-Critical Graphs of Odd-Girth $2k+1$

Laurent Beaudou , Florent Foucaud , Reza Naserasr
6th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), Feb 2020, Hyderabad, India. pp.184-196, ⟨10.1007/978-3-030-39219-2_16⟩
Conference papers hal-03041342v1

Discriminating Codes in Geometric Setups

Sanjana Dey , Florent Foucaud , Subhas C Nandy , Arunabha Sen
31st International Symposium on Algorithms and Computation (ISAAC 2020), Dec 2020, Hong-Kong, Hong Kong SAR China. pp.24:1-16, ⟨10.4230/LIPIcs.ISAAC.2020.24⟩
Conference papers hal-03041359v1

Algorithms and complexity for geodetic sets on planar and chordal graphs

Dibyayan Chakraborty , Sandip Das , Florent Foucaud , Harmender Gahlawat , Dimitri Lajou
31st International Symposium on Algorithms and Computation (ISAAC 2020), Dec 2020, Hong-Kong, Hong Kong SAR China. pp.7:1-15, ⟨10.4230/LIPIcs.ISAAC.2020.7⟩
Conference papers hal-03041361v1

Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes

Dibyayan Chakraborty , Florent Foucaud , Harmender Gahlawat , Subir Kumar Ghosh , Bodhayan Roy
6th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), Feb 2020, Hyderabad, India. pp.102-115, ⟨10.1007/978-3-030-39219-2_9⟩
Conference papers hal-03041353v1

Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems

Florent Foucaud , Hervé Hocquard , Dimitri Lajou , Valia Mitsou , Theo Pierron
IPEC 2019, Sep 2019, Munich, Germany. pp.15:1-16, ⟨10.4230/LIPIcs.IPEC.2019.15⟩
Conference papers hal-02491871v1
Image document

Complexity of Conjunctive Regular Path Query Homomorphisms

Laurent Beaudou , Florent Foucaud , Florent Madelaine , Lhouari Nourine , Gaétan Richard
Conference on Computability in Europe (CiE 2019), Jul 2019, Durham, United Kingdom. pp.108-119, ⟨10.1007/978-3-030-22996-2_10⟩
Conference papers hal-02288666v1

On the Approximability of Partial VC Dimension

Cristina Bazgan , Florent Foucaud , Florian Sikora
10th International Conference, COCOA 2016, Dec 2016, Hong Kong, China. pp.92-106, ⟨10.1007/978-3-319-48749-6_7⟩
Conference papers hal-01431728v1
Image document

Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs

Florent Foucaud , George Mertzios , Reza Naserasr , Aline Parreau , Petru Valicov
International Workshop on Graph-Theoretic Concepts in Computer Science WG 2015, Jun 2015, Munich, Germany. pp.175 - 471, ⟨10.1007/978-3-662-53174-7_32⟩
Conference papers hal-01518713v1

Complexity of Grundy Coloring and Its Variants

Edouard Bonnet , Florent Foucaud , Eun Jung Kim , Florian Sikora
21st International Conference on Computing and Combinatorics, COCOON 2015, Aug 2015, Beijing, China. pp.109-120, ⟨10.1007/978-3-319-21398-9_9⟩
Conference papers hal-01370531v1

The complexity of the identifying code problem in restricted graph classes

Florent Foucaud
International Workshop on Combinatorial Algorithms (IWOCA), Jul 2013, Rouen, France. pp.150-163, ⟨10.1007/978-3-642-45278-9_14⟩
Conference papers hal-00960564v1

Random subgraphs make identification affordable

Florent Foucaud , Guillem Perarnau , Oriol Serra
7th European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2013), Sep 2013, Pisa, Italy. pp.415-420, ⟨10.1007/978-88-7642-475-5_66⟩
Conference papers hal-03041296v1

On graph identification problems and the special case of identifying vertices using paths

Florent Foucaud , Matjaž Kovše
International Workshop on Combinatorial Algorithms (IWOCA), Jul 2012, Krishnankoil, India. pp.32-45, ⟨10.1007/978-3-642-35926-2_4⟩
Conference papers hal-00960561v1

Edge identifying codes

Florent Foucaud , Sylvain Gravier , Reza Naserasr , Aline Parreau , Petru Valicov
European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), Aug 2011, Budapest, Hungary. pp.343-348, ⟨10.1016/j.endm.2011.09.056⟩
Conference papers hal-00960555v1
Image document

Combinatorial and algorithmic aspects of identifying codes in graphs

Florent Foucaud
Data Structures and Algorithms [cs.DS]. Université Sciences et Technologies - Bordeaux I, 2012. English. ⟨NNT : ⟩
Theses tel-00766138v1