Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Irène Charon
@article{DBLP:journals/ccds/CharonHHL14,
author = {Ir{\`{e}}ne Charon and
Iiro S. Honkala and
Olivier Hudry and
Antoine Lobstein},
title = {Minimum sizes of identifying codes in graphs differing by one edge},
journal = {Cryptogr. Commun.},
volume = {6},
number = {2},
pages = {157--170},
year = {2014},
url = {https://doi.org/10.1007/s12095-013-0094-x},
doi = {10.1007/S12095-013-0094-X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ccds/CharonHHL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AugerCHL14,
author = {David Auger and
Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {Maximum size of a minimum watching system and the graphs achieving
the bound},
journal = {Discret. Appl. Math.},
volume = {164},
pages = {20--33},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2012.08.028},
doi = {10.1016/J.DAM.2012.08.028},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AugerCHL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BelgacemCH14,
author = {Lucile Belgacem and
Ir{\`{e}}ne Charon and
Olivier Hudry},
title = {A post-optimization method for the routing and wavelength assignment
problem applied to scheduled lightpath demands},
journal = {Eur. J. Oper. Res.},
volume = {232},
number = {2},
pages = {298--306},
year = {2014},
url = {https://doi.org/10.1016/j.ejor.2013.06.050},
doi = {10.1016/J.EJOR.2013.06.050},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BelgacemCH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ccds/CharonHHL13,
author = {Ir{\`{e}}ne Charon and
Iiro S. Honkala and
Olivier Hudry and
Antoine Lobstein},
title = {Minimum sizes of identifying codes in graphs differing by one vertex},
journal = {Cryptogr. Commun.},
volume = {5},
number = {2},
pages = {119--136},
year = {2013},
url = {https://doi.org/10.1007/s12095-012-0078-2},
doi = {10.1007/S12095-012-0078-2},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ccds/CharonHHL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AugerCHL13,
author = {David Auger and
Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {Watching systems in graphs: An extension of identifying codes},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1674--1685},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.04.025},
doi = {10.1016/J.DAM.2011.04.025},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AugerCHL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CharonH13,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry},
title = {Lexicographic decomposition of preferences},
journal = {Electron. Notes Discret. Math.},
volume = {42},
pages = {25--32},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.142},
doi = {10.1016/J.ENDM.2013.05.142},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CharonH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/CharonHL12,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {Extremal Values for the Maximum Degree in a Twin-Free Graph},
journal = {Ars Comb.},
volume = {107},
pages = {257--274},
year = {2012},
timestamp = {Wed, 13 Mar 2013 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/CharonHL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/CharonHL11,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {Extremal Values for Identification, Domination and Maximum Cliques
in Twin-Free Graphs},
journal = {Ars Comb.},
volume = {101},
pages = {161--185},
year = {2011},
timestamp = {Thu, 07 Mar 2013 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/CharonHL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AugerCHL11,
author = {David Auger and
Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {On the sizes of graphs and their powers: The undirected case},
journal = {Discret. Appl. Math.},
volume = {159},
number = {16},
pages = {1666--1675},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.04.010},
doi = {10.1016/J.DAM.2011.04.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AugerCHL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/order/CharonH11,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry},
title = {Maximum Distance Between Slater Orders and Copeland Orders of Tournaments},
journal = {Order},
volume = {28},
number = {1},
pages = {99--119},
year = {2011},
url = {https://doi.org/10.1007/s11083-010-9155-3},
doi = {10.1007/S11083-010-9155-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/order/CharonH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/AugerCHL10,
author = {David Auger and
Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {On the sizes of the graphs G, G\({}^{\mbox{r}}\), G\({}^{\mbox{r}}\)
{\textbackslash} {G:} the directed case},
journal = {Australas. {J} Comb.},
volume = {48},
pages = {87--110},
year = {2010},
url = {http://ajc.maths.uq.edu.au/pdf/48/ajc\_v48\_p087.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/AugerCHL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/CharonH10,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry},
title = {An updated survey on the linear ordering problem for weighted or unweighted
tournaments},
journal = {Ann. Oper. Res.},
volume = {175},
number = {1},
pages = {107--158},
year = {2010},
url = {https://doi.org/10.1007/s10479-009-0648-7},
doi = {10.1007/S10479-009-0648-7},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/CharonH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/AugerCHL10,
author = {David Auger and
Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {On the existence of a cycle of length at least 7 in a \emph{(1, {\textbackslash}le
2)}-twin-free graph},
journal = {Discuss. Math. Graph Theory},
volume = {30},
number = {4},
pages = {591--609},
year = {2010},
url = {https://doi.org/10.7151/dmgt.1516},
doi = {10.7151/DMGT.1516},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/AugerCHL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/CharonCHL10,
author = {Ir{\`{e}}ne Charon and
G{\'{e}}rard D. Cohen and
Olivier Hudry and
Antoine Lobstein},
title = {New identifying codes in the binary Hamming space},
journal = {Eur. J. Comb.},
volume = {31},
number = {2},
pages = {491--501},
year = {2010},
url = {https://doi.org/10.1016/j.ejc.2009.03.032},
doi = {10.1016/J.EJC.2009.03.032},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/CharonCHL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BelgacemCH10,
author = {Lucile Belgacem and
Ir{\`{e}}ne Charon and
Olivier Hudry},
title = {A post-optimization method to route scheduled lightpath demands with
multiplicity},
journal = {Electron. Notes Discret. Math.},
volume = {36},
pages = {263--270},
year = {2010},
url = {https://doi.org/10.1016/j.endm.2010.05.034},
doi = {10.1016/J.ENDM.2010.05.034},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BelgacemCH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/itor/AugerCHL10,
author = {David Auger and
Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {Complexity results for identifying codes in planar graphs},
journal = {Int. Trans. Oper. Res.},
volume = {17},
number = {6},
pages = {691--710},
year = {2010},
url = {https://doi.org/10.1111/j.1475-3995.2009.00750.x},
doi = {10.1111/J.1475-3995.2009.00750.X},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/itor/AugerCHL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/CharonH10,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry},
editor = {Ulrich Faigle and
Rainer Schrader and
Daniel Herrmann},
title = {A Branch and Bound Method for a Clique Partitioning Problem},
booktitle = {9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Cologne, Germany, May 25-27, 2010. Extended Abstracts},
pages = {43--46},
year = {2010},
timestamp = {Tue, 09 Nov 2010 19:12:38 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/CharonH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1005-0765,
author = {David Auger and
Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {Watching Systems in graphs: an extension of Identifying Codes},
journal = {CoRR},
volume = {abs/1005.0765},
year = {2010},
url = {http://arxiv.org/abs/1005.0765},
eprinttype = {arXiv},
eprint = {1005.0765},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1005-0765.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amco/AugerCHHL09,
author = {David Auger and
Ir{\`{e}}ne Charon and
Iiro S. Honkala and
Olivier Hudry and
Antoine Lobstein},
title = {Edge number, minimum degree, maximum independent set, radius and diameter
in twin-free graphs},
journal = {Adv. Math. Commun.},
volume = {3},
number = {1},
pages = {97--114},
year = {2009},
url = {https://doi.org/10.3934/amc.2009.3.97},
doi = {10.3934/AMC.2009.3.97},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amco/AugerCHHL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amco/AugerCHHL09a,
author = {David Auger and
Ir{\`{e}}ne Charon and
Iiro S. Honkala and
Olivier Hudry and
Antoine Lobstein},
title = {Erratum},
journal = {Adv. Math. Commun.},
volume = {3},
number = {4},
pages = {429--430},
year = {2009},
url = {https://doi.org/10.3934/amc.2009.3.429},
doi = {10.3934/AMC.2009.3.429},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amco/AugerCHHL09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/BelgacemCH09,
author = {Lucile Belgacem and
Ir{\`{e}}ne Charon and
Olivier Hudry},
editor = {Sonia Cafieri and
Antonio Mucherino and
Giacomo Nannicini and
Fabien Tarissan and
Leo Liberti},
title = {Routing and Wavelength Assignment in Optical Networks by Independent
Sets in Conflict Graphs},
booktitle = {Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial
Optimization, {CTW} 2009, Paris, France, June 2-4 2009},
pages = {225--228},
year = {2009},
url = {http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf\#page=237},
timestamp = {Thu, 12 Mar 2020 11:34:41 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/BelgacemCH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amco/CharbitCCHL08,
author = {Emmanuel Charbit and
Ir{\`{e}}ne Charon and
G{\'{e}}rard D. Cohen and
Olivier Hudry and
Antoine Lobstein},
title = {Discriminating codes in bipartite graphs: bounds, extremal cardinalities,
complexity},
journal = {Adv. Math. Commun.},
volume = {2},
number = {4},
pages = {403--420},
year = {2008},
url = {https://doi.org/10.3934/amc.2008.2.403},
doi = {10.3934/AMC.2008.2.403},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amco/CharbitCCHL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CharonH08,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry},
title = {Optimal clustering of multipartite graphs},
journal = {Discret. Appl. Math.},
volume = {156},
number = {8},
pages = {1330--1341},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2007.05.033},
doi = {10.1016/J.DAM.2007.05.033},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CharonH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/CharonCHL08,
author = {Ir{\`{e}}ne Charon and
G{\'{e}}rard D. Cohen and
Olivier Hudry and
Antoine Lobstein},
title = {Discriminating codes in (bipartite) planar graphs},
journal = {Eur. J. Comb.},
volume = {29},
number = {5},
pages = {1353--1364},
year = {2008},
url = {https://doi.org/10.1016/j.ejc.2007.05.006},
doi = {10.1016/J.EJC.2007.05.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/CharonCHL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/CharonH08,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry},
title = {{ALIO/EURO} {V} Conference on Combinatorial Optimization (ENST, Paris,
26-28 October 2005)},
journal = {{RAIRO} Oper. Res.},
volume = {42},
number = {4},
pages = {433--434},
year = {2008},
url = {https://doi.org/10.1051/ro:2008025},
doi = {10.1051/RO:2008025},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/CharonH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/CharonH07,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry},
title = {A survey on the linear ordering problem for weighted or unweighted
tournaments},
journal = {4OR},
volume = {5},
number = {1},
pages = {5--60},
year = {2007},
url = {https://doi.org/10.1007/s10288-007-0036-6},
doi = {10.1007/S10288-007-0036-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/CharonH07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/CharonHHL07,
author = {Ir{\`{e}}ne Charon and
Iiro S. Honkala and
Olivier Hudry and
Antoine Lobstein},
title = {Structural Properties of Twin-Free Graphs},
journal = {Electron. J. Comb.},
volume = {14},
number = {1},
year = {2007},
url = {https://doi.org/10.37236/934},
doi = {10.37236/934},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/CharonHHL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CharonHL07,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {Extremal cardinalities for identifying and locating-dominating codes
in graphs},
journal = {Discret. Math.},
volume = {307},
number = {3-5},
pages = {356--366},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2005.09.027},
doi = {10.1016/J.DISC.2005.09.027},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CharonHL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaecc/CharonCHL07,
author = {Ir{\`{e}}ne Charon and
G{\'{e}}rard D. Cohen and
Olivier Hudry and
Antoine Lobstein},
editor = {Serdar Boztas and
Hsiao{-}feng Lu},
title = {Links Between Discriminating and Identifying Codes in the Binary Hamming
Space},
booktitle = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes,
17th International Symposium, AAECC-17, Bangalore, India, December
16-20, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4851},
pages = {267--270},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77224-8\_31},
doi = {10.1007/978-3-540-77224-8\_31},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/aaecc/CharonCHL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rivf/CharonH07,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry},
title = {Application of the "descent with mutations" metaheuristic
to a clique partitioning problem},
booktitle = {2007 {IEEE} International Conference on Research, Innovation and Vision
for the Future in Computing {\&} Communication Technologies, {RIVF}
2007, Hanoi, Vietnam, 5-9 March 2007},
pages = {29--35},
publisher = {{IEEE}},
year = {2007},
url = {https://doi.org/10.1109/RIVF.2007.369132},
doi = {10.1109/RIVF.2007.369132},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/rivf/CharonH07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/CharonHL06,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {Possible cardinalities for locating-dominating codes in graphs},
journal = {Australas. {J} Comb.},
volume = {34},
pages = {23--32},
year = {2006},
url = {http://ajc.maths.uq.edu.au/pdf/34/ajc\_v34\_p023.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/CharonHL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/classification/CharonDGH06,
author = {Ir{\`{e}}ne Charon and
Lucile Denoeud and
Alain Gu{\'{e}}noche and
Olivier Hudry},
title = {Maximum Transfer Distance Between Partitions},
journal = {J. Classif.},
volume = {23},
number = {1},
pages = {103--121},
year = {2006},
url = {https://doi.org/10.1007/s00357-006-0006-2},
doi = {10.1007/S00357-006-0006-2},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/classification/CharonDGH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CharonH06,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry},
title = {Noising methods for a clique partitioning problem},
journal = {Discret. Appl. Math.},
volume = {154},
number = {5},
pages = {754--769},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.05.029},
doi = {10.1016/J.DAM.2005.05.029},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CharonH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CharonGHLMM06,
author = {Ir{\`{e}}ne Charon and
Sylvain Gravier and
Olivier Hudry and
Antoine Lobstein and
Michel Mollard and
Julien Moncel},
title = {A linear algorithm for minimum 1-identifying codes in oriented trees},
journal = {Discret. Appl. Math.},
volume = {154},
number = {8},
pages = {1246--1253},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.11.007},
doi = {10.1016/J.DAM.2005.11.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CharonGHLMM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CharonH06a,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry},
title = {A branch-and-bound algorithm to solve the linear ordering problem
for weighted tournaments},
journal = {Discret. Appl. Math.},
volume = {154},
number = {15},
pages = {2097--2116},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.04.020},
doi = {10.1016/J.DAM.2005.04.020},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CharonH06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CharbitCCH06,
author = {Emmanuel Charbit and
Ir{\`{e}}ne Charon and
G{\'{e}}rard D. Cohen and
Olivier Hudry},
title = {Discriminating codes in bipartite graphs},
journal = {Electron. Notes Discret. Math.},
volume = {26},
pages = {29--35},
year = {2006},
url = {https://doi.org/10.1016/j.endm.2006.08.005},
doi = {10.1016/J.ENDM.2006.08.005},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CharbitCCH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/0001CHL05,
author = {Nathalie Bertrand and
Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {1-identifying codes on trees},
journal = {Australas. {J} Comb.},
volume = {31},
pages = {21--36},
year = {2005},
url = {http://ajc.maths.uq.edu.au/pdf/31/ajc\_v31\_p021.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/0001CHL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/CharonHL05,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {Possible cardinalities for identifying codes in graphs},
journal = {Australas. {J} Comb.},
volume = {32},
pages = {177--196},
year = {2005},
url = {http://ajc.maths.uq.edu.au/pdf/32/ajc\_v32\_p177.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/CharonHL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CharonHL05,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {On the Structure of Identifiable Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {22},
pages = {491--495},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.06.094},
doi = {10.1016/J.ENDM.2005.06.094},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CharonHL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CharonHHL04,
author = {Ir{\`{e}}ne Charon and
Iiro S. Honkala and
Olivier Hudry and
Antoine Lobstein},
title = {The minimum density of an identifying code in the king lattice},
journal = {Discret. Math.},
volume = {276},
number = {1-3},
pages = {95--109},
year = {2004},
url = {https://doi.org/10.1016/S0012-365X(03)00306-6},
doi = {10.1016/S0012-365X(03)00306-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CharonHHL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BertrandCHL04,
author = {Nathalie Bertrand and
Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {Identifying and locating-dominating codes on chains and cycles},
journal = {Eur. J. Comb.},
volume = {25},
number = {7},
pages = {969--987},
year = {2004},
url = {https://doi.org/10.1016/j.ejc.2003.12.013},
doi = {10.1016/J.EJC.2003.12.013},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BertrandCHL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/CharonH03,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry},
title = {Links between the Slater Index and the Ryser Index of Tournaments},
journal = {Graphs Comb.},
volume = {19},
number = {3},
pages = {309--322},
year = {2003},
url = {https://doi.org/10.1007/s00373-002-0510-z},
doi = {10.1007/S00373-002-0510-Z},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/CharonH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CharonHL03,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {Minimizing the size of an identifying or locating-dominating code
in a graph is NP-hard},
journal = {Theor. Comput. Sci.},
volume = {290},
number = {3},
pages = {2109--2120},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00536-4},
doi = {10.1016/S0304-3975(02)00536-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CharonHL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/CharonHL02,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {Identifying Codes with Small Radius in Some Infinite Regular Graphs},
journal = {Electron. J. Comb.},
volume = {9},
number = {1},
year = {2002},
url = {https://doi.org/10.37236/1628},
doi = {10.37236/1628},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/CharonHL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/CharonHL02,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {Identifying and locating-dominating codes: NP-Completeness results
for directed graphs},
journal = {{IEEE} Trans. Inf. Theory},
volume = {48},
number = {8},
pages = {2192--2200},
year = {2002},
url = {https://doi.org/10.1109/TIT.2002.800490},
doi = {10.1109/TIT.2002.800490},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/CharonHL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/CharonHHL01,
author = {Ir{\`{e}}ne Charon and
Iiro S. Honkala and
Olivier Hudry and
Antoine Lobstein},
title = {General Bounds for Identifying Codes in Some Infinite Regular Graphs},
journal = {Electron. J. Comb.},
volume = {8},
number = {1},
year = {2001},
url = {https://doi.org/10.37236/1583},
doi = {10.37236/1583},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/CharonHHL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/CharonH01,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry},
title = {The noising methods: {A} generalization of some metaheuristics},
journal = {Eur. J. Oper. Res.},
volume = {135},
number = {1},
pages = {86--101},
year = {2001},
url = {https://doi.org/10.1016/S0377-2217(00)00305-2},
doi = {10.1016/S0377-2217(00)00305-2},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/CharonH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CharonH00,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry},
title = {Slater orders and Hamiltonian paths of tournaments},
journal = {Electron. Notes Discret. Math.},
volume = {5},
pages = {60--63},
year = {2000},
url = {https://doi.org/10.1016/S1571-0653(05)80125-8},
doi = {10.1016/S1571-0653(05)80125-8},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CharonH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/CharonH00,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry},
title = {Application of the noising method to the travelling salesman problem},
journal = {Eur. J. Oper. Res.},
volume = {125},
number = {2},
pages = {266--277},
year = {2000},
url = {https://doi.org/10.1016/S0377-2217(99)00457-9},
doi = {10.1016/S0377-2217(99)00457-9},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/CharonH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/CharonH98,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry},
title = {Lamarckian genetic algorithmsapplied to the aggregation of preferences},
journal = {Ann. Oper. Res.},
volume = {80},
pages = {281--297},
year = {1998},
url = {https://doi.org/10.1023/A\%3A1018976217274},
doi = {10.1023/A\%3A1018976217274},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/CharonH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CharonHW97,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry and
Fr{\'{e}}d{\'{e}}ric Woirgard},
title = {Note: {A} 16-vertex Tournament for Which Banks Set and Slater Set
Are Disjoint},
journal = {Discret. Appl. Math.},
volume = {80},
number = {2-3},
pages = {211--215},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(97)88689-1},
doi = {10.1016/S0166-218X(97)88689-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CharonHW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CharonGHW97,
author = {Ir{\`{e}}ne Charon and
A. Gu{\'{e}}noche and
Olivier Hudry and
Fr{\'{e}}d{\'{e}}ric Woirgard},
title = {New results on the computation of median orders},
journal = {Discret. Math.},
volume = {165-166},
pages = {139--153},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00166-5},
doi = {10.1016/S0012-365X(96)00166-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CharonGHW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CharonH93,
author = {Ir{\`{e}}ne Charon and
Olivier Hudry},
title = {The noising method: a new method for combinatorial optimization},
journal = {Oper. Res. Lett.},
volume = {14},
number = {3},
pages = {133--137},
year = {1993},
url = {https://doi.org/10.1016/0167-6377(93)90023-A},
doi = {10.1016/0167-6377(93)90023-A},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/CharonH93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2023-09-27 22:48 CEST 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:
