default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorent Foucaud
Person information
- affiliation: LIMOS, Université Clermont Auvergne, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j52]Florent Foucaud
, Narges Ghareghani, Pouyeh Sharifani:
Extremal digraphs for open neighbourhood location-domination and identifying codes. Discret. Appl. Math. 347: 62-74 (2024)- [j51]Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja:
On locating and neighbor-locating colorings of sparse graphs. Discret. Appl. Math. 358: 366-381 (2024) - [j50]Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret Katrin Wagler:
Progress towards the two-thirds conjecture on locating-total dominating sets. Discret. Math. 347(12): 114176 (2024) - [j49]Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau:
Neighbourhood complexity of graphs of bounded twin-width. Eur. J. Comb. 115: 103772 (2024) - [j48]Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Wagler:
On Three Domination-based Identification Problems in Block Graphs. Fundam. Informaticae 191(3-4): 197-229 (2024) - [j47]Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca:
On Graphs Coverable by k Shortest Paths. SIAM J. Discret. Math. 38(2): 1840-1862 (2024) - [c31]Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni:
Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity. CALDAM 2024: 29-43 - [c30]Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. ICALP 2024: 66:1-66:19 - [c29]Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale:
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. ISAAC 2024: 19:1-19:18 - [c28]Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing:
Algorithms and Complexity for Path Covers of Temporal DAGs. MFCS 2024: 38:1-38:17 - [i47]Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale:
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. CoRR abs/2402.08346 (2024) - [i46]Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing:
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic? CoRR abs/2403.04589 (2024) - [i45]Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni:
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. CoRR abs/2403.09122 (2024) - [i44]Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Metric Dimension and Geodetic Set Parameterized by Vertex Cover. CoRR abs/2405.01344 (2024) - [i43]Tapas Das, Florent Foucaud, Clara Marcille, Pavan P. D, Sagnik Sen:
Monitoring arc-geodetic sets of oriented graphs. CoRR abs/2409.00350 (2024) - [i42]Florent Foucaud, Clara Marcille, R. B. Sandeep, Sagnik Sen, S. Taruni:
Algorithms and complexity for monitoring edge-geodetic sets in graphs. CoRR abs/2409.19067 (2024) - 2023
- [j46]Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen:
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups. Algorithmica 85(7): 1850-1882 (2023) - [j45]Florent Foucaud, Tuomo Lehtilä:
Bounds and Extremal Graphs for Total Dominating Identifying Codes. Electron. J. Comb. 30(3) (2023) - [j44]Florent Foucaud, Reza Naserasr, Rongxing Xu:
Extended Double Covers and Homomorphism Bounds of Signed Graphs. Electron. J. Comb. 30(3) (2023) - [j43]Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä:
The RED-BLUE SEPARATION problem on graphs. Theor. Comput. Sci. 970: 114061 (2023) - [c27]Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja:
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs. CALDAM 2023: 121-133 - [c26]Florent Foucaud, Krishna Narayanan, Lekshmi Ramasubramony Sulochana:
Monitoring Edge-Geodetic Sets in Graphs. CALDAM 2023: 245-256 - [c25]Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Katrin Wagler:
On Three Domination-Based Identification Problems in Block Graphs. CALDAM 2023: 271-283 - [c24]Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee:
Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs. CALDAM 2023: 297-308 - [c23]Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N:
Parameterizing Path Partitions. CIAC 2023: 187-201 - [c22]Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen:
Distance-Based Covering Problems for Graphs of Given Cyclomatic Number. FCT 2023: 132-146 - [c21]Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä:
Identifying codes in bipartite graphs of given maximum degree. LAGOS 2023: 157-165 - [c20]Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès:
Isometric Path Complexity of Graphs. MFCS 2023: 32:1-32:14 - [c19]Antoine Dailly, Florent Foucaud, Anni Hakanen:
Algorithms and Hardness for Metric Dimension on Digraphs. WG 2023: 232-245 - [i41]Dibyayan Chakraborty, Florent Foucaud:
Isometric path antichain covers: beyond hyperbolic graphs. CoRR abs/2301.00278 (2023) - [i40]Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau:
Neighbourhood complexity of graphs of bounded twin-width. CoRR abs/2301.04217 (2023) - [i39]Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja:
New bounds and constructions for neighbor-locating colorings of graphs. CoRR abs/2301.13557 (2023) - [i38]Florent Foucaud, Narges Ghareghani, Pouyeh Sharifani:
Extremal digraphs for open neighbourhood location-domination and identifying codes. CoRR abs/2302.02152 (2023) - [i37]Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard:
Complexity of conjunctive regular path query homomorphisms. CoRR abs/2305.07271 (2023) - [i36]Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations. CoRR abs/2307.08149 (2023) - [i35]Antoine Dailly, Florent Foucaud, Anni Hakanen:
Algorithms and hardness for Metric Dimension on digraphs. CoRR abs/2307.09389 (2023) - [i34]Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee:
Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs. CoRR abs/2312.10485 (2023) - 2022
- [j42]Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron:
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. Algorithmica 84(5): 1183-1212 (2022) - [j41]Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller, Joe Ryan:
Monitoring the edges of a graph using distances. Discret. Appl. Math. 319: 424-438 (2022) - [j40]Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Smallest C2ℓ+1-critical graphs of odd-girth 2k+1. Discret. Appl. Math. 319: 564-575 (2022) - [j39]Florent Foucaud, Tuomo Lehtilä:
Revisiting and Improving Upper Bounds for Identifying Codes. SIAM J. Discret. Math. 36(4): 2619-2634 (2022) - [c18]Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh:
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. ISAAC 2022: 12:1-12:17 - [c17]Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca:
On Graphs Coverable by k Shortest Paths. ISAAC 2022: 40:1-40:15 - [c16]Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä:
The Red-Blue Separation Problem on Graphs. IWOCA 2022: 285-298 - [i33]Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca:
On graphs coverable by k shortest paths. CoRR abs/2206.15088 (2022) - [i32]Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä:
The RED-BLUE SEPARATION problem on graphs. CoRR abs/2211.08283 (2022) - [i31]Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret Wagler:
Progress towards the two-thirds conjecture on locating-total dominating sets. CoRR abs/2211.14178 (2022) - [i30]Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N:
Parameterizing Path Partitions. CoRR abs/2212.11653 (2022) - 2021
- [j38]Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora:
On the Complexity of Broadcast Domination and Multipacking in Digraphs. Algorithmica 83(9): 2651-2677 (2021) - [j37]Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov:
Exact square coloring of subcubic planar graphs. Discret. Appl. Math. 293: 74-89 (2021) - [j36]Florent Foucaud, Narges Ghareghani, Aida Roshany-Tabrizi, Pouyeh Sharifani:
Characterizing extremal graphs for open neighbourhood location-domination. Discret. Appl. Math. 302: 76-79 (2021) - [j35]Florent Foucaud, Hervé Hocquard, Dimitri Lajou:
Complexity and algorithms for injective edge-coloring in graphs. Inf. Process. Lett. 170: 106121 (2021) - [c15]Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov:
Cliques in exact distance powers of graphs of given maximum degree. LAGOS 2021: 427-436 - [i29]Florent Foucaud, Hervé Hocquard, Dimitri Lajou:
Complexity and algorithms for injective edge-coloring in graphs. CoRR abs/2104.08003 (2021) - [i28]Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor:
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. CoRR abs/2110.14003 (2021) - 2020
- [j34]Florent Foucaud, Shahrzad Heydarshahi, Aline Parreau:
Domination and location in twin-free digraphs. Discret. Appl. Math. 284: 42-52 (2020) - [j33]François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron:
Complexity of planar signed graph homomorphisms to cycles. Discret. Appl. Math. 284: 166-178 (2020) - [j32]Florent Foucaud, Leszek Gasieniec, Ralf Klasing, Tomasz Radzik, Bill Smyth:
IWOCA 2020 in Bordeaux (Oops! On-Line!). Bull. EATCS 132 (2020) - [c14]Florent Foucaud, Ralf Klasing, Mirka Miller, Joe Ryan:
Monitoring the Edges of a Graph Using Distances. CALDAM 2020: 28-40 - [c13]Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy:
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. CALDAM 2020: 102-115 - [c12]Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Smallest C2l+1-Critical Graphs of Odd-Girth 2k+1. CALDAM 2020: 184-196 - [c11]Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy:
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. ISAAC 2020: 7:1-7:15 - [c10]Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen:
Discriminating Codes in Geometric Setups. ISAAC 2020: 24:1-24:16 - [c9]Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora:
On the Complexity of Broadcast Domination and Multipacking in Digraphs. IWOCA 2020: 264-276 - [i27]Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora:
On the complexity of Broadcast Domination and Multipacking in digraphs. CoRR abs/2003.10570 (2020) - [i26]Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy:
Algorithms and complexity for geodetic sets on planar and chordal graphs. CoRR abs/2006.16511 (2020) - [i25]Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov:
Exact square coloring of subcubic planar graphs. CoRR abs/2009.00843 (2020) - [i24]Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen:
Discriminating Codes in Geometric Setups. CoRR abs/2009.10353 (2020) - [i23]Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller, Joe Ryan:
Monitoring the edges of a graph using distances. CoRR abs/2011.00029 (2020)
2010 – 2019
- 2019
- [j31]Laurent Beaudou, Richard C. Brewster, Florent Foucaud:
Broadcast domination and multipacking: bounds and the integrality gap. Australas. J Comb. 74: 86-97 (2019) - [j30]Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs. Discret. Appl. Math. 261: 40-51 (2019) - [j29]Antoine Dailly, Florent Foucaud, Adriana Hansberg:
Strengthening the Murty-Simon conjecture on diameter 2 critical graphs. Discret. Math. 342(11): 3142-3159 (2019) - [j28]Cristina Bazgan, Florent Foucaud, Florian Sikora:
Parameterized and approximation complexity of Partial VC Dimension. Theor. Comput. Sci. 766: 1-15 (2019) - [c8]Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard:
Complexity of Conjunctive Regular Path Query Homomorphisms. CiE 2019: 108-119 - [c7]Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron:
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. IPEC 2019: 15:1-15:16 - [i22]François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron:
Complexity of planar signed graph homomorphisms to cycles. CoRR abs/1907.03266 (2019) - [i21]Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy:
Hardness and approximation for the geodetic set problem in some graph classes. CoRR abs/1909.08795 (2019) - [i20]Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron:
Parameterized complexity of edge-coloured and signed graph homomorphism problems. CoRR abs/1910.01099 (2019) - [i19]Florent Foucaud, Shahrzad Heydarshahi, Aline Parreau:
Domination and location in twin-free digraphs. CoRR abs/1910.05311 (2019) - 2018
- [j27]Édouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora:
Complexity of Grundy coloring and its variants. Discret. Appl. Math. 243: 99-114 (2018) - [j26]Laurent Beaudou, Peter Dankelmann, Florent Foucaud, Michael A. Henning, Arnaud Mary, Aline Parreau:
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension. SIAM J. Discret. Math. 32(2): 902-918 (2018) - [i18]Antoine Dailly, Florent Foucaud, Adriana Hansberg:
Strengthening the Murty-Simon conjecture on diameter 2 critical graphs. CoRR abs/1812.08420 (2018) - 2017
- [j25]Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov:
Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity. Algorithmica 78(3): 914-944 (2017) - [j24]Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr:
The complexity of tropical graph homomorphisms. Discret. Appl. Math. 229: 64-81 (2017) - [j23]Florent Foucaud, Michael A. Henning:
Location-domination in line graphs. Discret. Math. 340(1): 3140-3153 (2017) - [j22]Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr:
The complexity of signed graph and edge-coloured graph homomorphisms. Discret. Math. 340(2): 223-235 (2017) - [j21]Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak:
Structural properties of recursively partitionable graphs with connectivity 2. Discuss. Math. Graph Theory 37(1): 89-115 (2017) - [j20]Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Homomorphism bounds and edge-colourings of K4-minor-free graphs. J. Comb. Theory B 124: 128-164 (2017) - [j19]Florent Foucaud, Ralf Klasing:
Parameterized and approximation complexity of the detection pair problem in graphs. J. Graph Algorithms Appl. 21(6): 1039-1056 (2017) - [j18]Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov:
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. Theor. Comput. Sci. 668: 43-58 (2017) - 2016
- [j17]Florent Foucaud, Michael A. Henning:
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture. Electron. J. Comb. 23(3): 3 (2016) - [j16]Florent Foucaud, Michael A. Henning, Christian Löwenstein, Thomas Sasse:
Locating-dominating sets in twin-free graphs. Discret. Appl. Math. 200: 52-58 (2016) - [j15]Florent Foucaud, Michael A. Henning:
Location-domination and matching in cubic graphs. Discret. Math. 339(4): 1221-1231 (2016) - [c6]Cristina Bazgan, Florent Foucaud, Florian Sikora:
On the Approximability of Partial VC Dimension. COCOA 2016: 92-106 - [i17]Florent Foucaud, Ralf Klasing:
Parameterized and approximation complexity of the detection pair problem in graphs. CoRR abs/1601.05003 (2016) - [i16]Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr:
The complexity of tropical graph homomorphisms. CoRR abs/1607.04777 (2016) - [i15]Cristina Bazgan, Florent Foucaud, Florian Sikora:
On the Approximability of Partial VC Dimension. CoRR abs/1609.05110 (2016) - [i14]Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Homomorphism bounds and edge-colourings of K4-minor-free graphs. CoRR abs/1610.03999 (2016) - 2015
- [j14]Camino Balbuena, Florent Foucaud, Adriana Hansberg:
Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5. Electron. J. Comb. 22(2): 2 (2015) - [j13]Florent Foucaud:
Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes. J. Discrete Algorithms 31: 48-68 (2015) - [j12]Florent Foucaud, Michael Krivelevich, Guillem Perarnau:
Large Subgraphs without Short Cycles. SIAM J. Discret. Math. 29(1): 65-78 (2015) - [c5]Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora:
Complexity of Grundy Coloring and Its Variants. COCOON 2015: 109-120 - [c4]Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov:
Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs. WG 2015: 456-471 - [i13]Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov:
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. CoRR abs/1507.08164 (2015) - [i12]Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr:
The complexity of signed graph and 2-edge-coloured graph homomorphisms. CoRR abs/1510.05502 (2015) - 2014
- [j11]Florent Foucaud, Tero Laihonen, Aline Parreau:
An improved lower bound for (1, ≤ 2)-identifying codes in the king grid. Adv. Math. Commun. 8(1): 35-52 (2014) - [j10]Olivier Baudon, Florent Foucaud, Jakub Przybylo, Mariusz Wozniak:
On the structure of arbitrarily partitionable graphs with given connectivity. Discret. Appl. Math. 162: 381-385 (2014) - [j9]Florent Foucaud, Ralf Klasing, Peter J. Slater:
Centroidal bases in graphs. Networks 64(2): 96-108 (2014) - [c3]Florent Foucaud, Reza Naserasr:
The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction. LATIN 2014: 526-537 - [i11]Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov:
Identification, location-domination and metric dimension on interval and permutation graphs. CoRR abs/1405.2424 (2014) - [i10]Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora:
Complexity of Grundy coloring and its variants. CoRR abs/1407.5336 (2014) - [i9]Camino Balbuena, Florent Foucaud, Adriana Hansberg:
Locating-dominating sets and identifying codes in graphs of girth at least 5. CoRR abs/1407.7263 (2014) - 2013
- [j8]Florent Foucaud, Reza Naserasr, Aline Parreau:
Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy's Theorem on Induced Subsets. Graphs Comb. 29(3): 463-473 (2013) - [j7]Florent Foucaud, Matjaz Kovse:
Identifying path covers in graphs. J. Discrete Algorithms 23: 21-34 (2013) - [j6]Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
Identifying Codes in Line Graphs. J. Graph Theory 73(4): 425-448 (2013) - [c2]Florent Foucaud:
The Complexity of the Identifying Code Problem in Restricted Graph Classes. IWOCA 2013: 150-163 - [i8]Florent Foucaud, Guillem Perarnau, Oriol Serra:
Random subgraphs make identification affordable. CoRR abs/1306.0819 (2013) - 2012
- [b1]Florent Foucaud:
Combinatorial and algorithmic aspects of identifying codes in graphs. (Aspects combinatoires et algorithmiques des codes identifiants dans les graphes). University of Bordeaux, France, 2012 - [j5]Florent Foucaud, Guillem Perarnau:
Bounds for Identifying Codes in Terms of Degree Parameters. Electron. J. Comb. 19(1): 32 (2012) - [j4]Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud:
On the size of identifying codes in triangle-free graphs. Discret. Appl. Math. 160(10-11): 1532-1546 (2012) - [j3]Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau:
Locally identifying colourings for graphs with given maximum degree. Discret. Math. 312(10): 1832-1837 (2012) - [c1]Florent Foucaud, Matjaz Kovse:
On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths. IWOCA 2012: 32-45 - 2011
- [j2]Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov:
Extremal graphs for the identifying code problem. Eur. J. Comb. 32(4): 628-638 (2011) - [j1]Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
Edge identifying codes. Electron. Notes Discret. Math. 38: 343-348 (2011) - [i7]Florent Foucaud, Guillem Perarnau:
Bounds for identifying codes in terms of degree parameters. CoRR abs/1103.3756 (2011) - [i6]Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
Identifying codes in line graphs. CoRR abs/1107.0207 (2011) - [i5]Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau:
Locally identifying colourings for graphs with given maximum degree. CoRR abs/1108.2769 (2011) - [i4]Florent Foucaud, Tero Laihonen, Aline Parreau:
An improved lower bound for (1,<=2)-identifying codes in the king grid. CoRR abs/1111.2477 (2011) - 2010
- [i3]Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov:
Extremal graphs for the identifying code problem. CoRR abs/1004.5230 (2010) - [i2]Florent Foucaud, Reza Naserasr, Aline Parreau:
Extremal problems on identifying codes in digraphs and Bondy's theorem on induced subsets. CoRR abs/1010.2985 (2010) - [i1]Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud:
On the size of identifying codes in triangle-free graphs. CoRR abs/1010.5975 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-05 21:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
