default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIrène Charon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j48]Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Minimum sizes of identifying codes in graphs differing by one edge. Cryptogr. Commun. 6(2): 157-170 (2014)- [j47]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
Maximum size of a minimum watching system and the graphs achieving the bound. Discret. Appl. Math. 164: 20-33 (2014) - [j46]Lucile Belgacem, Irène Charon, Olivier Hudry:
A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands. Eur. J. Oper. Res. 232(2): 298-306 (2014) - 2013
- [j45]Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Minimum sizes of identifying codes in graphs differing by one vertex. Cryptogr. Commun. 5(2): 119-136 (2013) - [j44]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
Watching systems in graphs: An extension of identifying codes. Discret. Appl. Math. 161(12): 1674-1685 (2013) - [j43]Irène Charon, Olivier Hudry:
Lexicographic decomposition of preferences. Electron. Notes Discret. Math. 42: 25-32 (2013) - 2012
- [j42]Irène Charon, Olivier Hudry, Antoine Lobstein:
Extremal Values for the Maximum Degree in a Twin-Free Graph. Ars Comb. 107: 257-274 (2012) - 2011
- [j41]Irène Charon, Olivier Hudry, Antoine Lobstein:
Extremal Values for Identification, Domination and Maximum Cliques in Twin-Free Graphs. Ars Comb. 101: 161-185 (2011) - [j40]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
On the sizes of graphs and their powers: The undirected case. Discret. Appl. Math. 159(16): 1666-1675 (2011) - [j39]Irène Charon, Olivier Hudry:
Maximum Distance Between Slater Orders and Copeland Orders of Tournaments. Order 28(1): 99-119 (2011) - 2010
- [j38]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
On the sizes of the graphs G, Gr, Gr \ G: the directed case. Australas. J Comb. 48: 87-110 (2010) - [j37]Irène Charon, Olivier Hudry:
An updated survey on the linear ordering problem for weighted or unweighted tournaments. Ann. Oper. Res. 175(1): 107-158 (2010) - [j36]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
On the existence of a cycle of length at least 7 in a (1, \le 2)-twin-free graph. Discuss. Math. Graph Theory 30(4): 591-609 (2010) - [j35]Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein:
New identifying codes in the binary Hamming space. Eur. J. Comb. 31(2): 491-501 (2010) - [j34]Lucile Belgacem, Irène Charon, Olivier Hudry:
A post-optimization method to route scheduled lightpath demands with multiplicity. Electron. Notes Discret. Math. 36: 263-270 (2010) - [j33]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
Complexity results for identifying codes in planar graphs. Int. Trans. Oper. Res. 17(6): 691-710 (2010) - [c4]Irène Charon, Olivier Hudry:
A Branch and Bound Method for a Clique Partitioning Problem. CTW 2010: 43-46 - [i1]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
Watching Systems in graphs: an extension of Identifying Codes. CoRR abs/1005.0765 (2010)
2000 – 2009
- 2009
- [j32]David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs. Adv. Math. Commun. 3(1): 97-114 (2009) - [j31]David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Erratum. Adv. Math. Commun. 3(4): 429-430 (2009) - [c3]Lucile Belgacem, Irène Charon, Olivier Hudry:
Routing and Wavelength Assignment in Optical Networks by Independent Sets in Conflict Graphs. CTW 2009: 225-228 - 2008
- [j30]Emmanuel Charbit, Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein:
Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity. Adv. Math. Commun. 2(4): 403-420 (2008) - [j29]Irène Charon, Olivier Hudry:
Optimal clustering of multipartite graphs. Discret. Appl. Math. 156(8): 1330-1341 (2008) - [j28]Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein:
Discriminating codes in (bipartite) planar graphs. Eur. J. Comb. 29(5): 1353-1364 (2008) - [j27]Irène Charon, Olivier Hudry:
ALIO/EURO V Conference on Combinatorial Optimization (ENST, Paris, 26-28 October 2005). RAIRO Oper. Res. 42(4): 433-434 (2008) - 2007
- [j26]Irène Charon, Olivier Hudry:
A survey on the linear ordering problem for weighted or unweighted tournaments. 4OR 5(1): 5-60 (2007) - [j25]Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Structural Properties of Twin-Free Graphs. Electron. J. Comb. 14(1) (2007) - [j24]Irène Charon, Olivier Hudry, Antoine Lobstein:
Extremal cardinalities for identifying and locating-dominating codes in graphs. Discret. Math. 307(3-5): 356-366 (2007) - [c2]Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein:
Links Between Discriminating and Identifying Codes in the Binary Hamming Space. AAECC 2007: 267-270 - [c1]Irène Charon, Olivier Hudry:
Application of the "descent with mutations" metaheuristic to a clique partitioning problem. RIVF 2007: 29-35 - 2006
- [j23]Irène Charon, Olivier Hudry, Antoine Lobstein:
Possible cardinalities for locating-dominating codes in graphs. Australas. J Comb. 34: 23-32 (2006) - [j22]Irène Charon, Lucile Denoeud, Alain Guénoche, Olivier Hudry:
Maximum Transfer Distance Between Partitions. J. Classif. 23(1): 103-121 (2006) - [j21]Irène Charon, Olivier Hudry:
Noising methods for a clique partitioning problem. Discret. Appl. Math. 154(5): 754-769 (2006) - [j20]Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel:
A linear algorithm for minimum 1-identifying codes in oriented trees. Discret. Appl. Math. 154(8): 1246-1253 (2006) - [j19]Irène Charon, Olivier Hudry:
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments. Discret. Appl. Math. 154(15): 2097-2116 (2006) - [j18]Emmanuel Charbit, Irène Charon, Gérard D. Cohen, Olivier Hudry:
Discriminating codes in bipartite graphs. Electron. Notes Discret. Math. 26: 29-35 (2006) - 2005
- [j17]Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein:
1-identifying codes on trees. Australas. J Comb. 31: 21-36 (2005) - [j16]Irène Charon, Olivier Hudry, Antoine Lobstein:
Possible cardinalities for identifying codes in graphs. Australas. J Comb. 32: 177-196 (2005) - [j15]Irène Charon, Olivier Hudry, Antoine Lobstein:
On the Structure of Identifiable Graphs. Electron. Notes Discret. Math. 22: 491-495 (2005) - 2004
- [j14]Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
The minimum density of an identifying code in the king lattice. Discret. Math. 276(1-3): 95-109 (2004) - [j13]Nathalie Bertrand
, Irène Charon, Olivier Hudry, Antoine Lobstein:
Identifying and locating-dominating codes on chains and cycles. Eur. J. Comb. 25(7): 969-987 (2004) - 2003
- [j12]Irène Charon, Olivier Hudry:
Links between the Slater Index and the Ryser Index of Tournaments. Graphs Comb. 19(3): 309-322 (2003) - [j11]Irène Charon, Olivier Hudry, Antoine Lobstein:
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Theor. Comput. Sci. 290(3): 2109-2120 (2003) - 2002
- [j10]Irène Charon, Olivier Hudry, Antoine Lobstein:
Identifying Codes with Small Radius in Some Infinite Regular Graphs. Electron. J. Comb. 9(1) (2002) - [j9]Irène Charon, Olivier Hudry, Antoine Lobstein:
Identifying and locating-dominating codes: NP-Completeness results for directed graphs. IEEE Trans. Inf. Theory 48(8): 2192-2200 (2002) - 2001
- [j8]Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
General Bounds for Identifying Codes in Some Infinite Regular Graphs. Electron. J. Comb. 8(1) (2001) - [j7]Irène Charon, Olivier Hudry:
The noising methods: A generalization of some metaheuristics. Eur. J. Oper. Res. 135(1): 86-101 (2001) - 2000
- [j6]Irène Charon, Olivier Hudry:
Slater orders and Hamiltonian paths of tournaments. Electron. Notes Discret. Math. 5: 60-63 (2000) - [j5]Irène Charon, Olivier Hudry:
Application of the noising method to the travelling salesman problem. Eur. J. Oper. Res. 125(2): 266-277 (2000)
1990 – 1999
- 1998
- [j4]Irène Charon, Olivier Hudry:
Lamarckian genetic algorithmsapplied to the aggregation of preferences. Ann. Oper. Res. 80: 281-297 (1998) - 1997
- [j3]Irène Charon, Olivier Hudry, Frédéric Woirgard:
Note: A 16-vertex Tournament for Which Banks Set and Slater Set Are Disjoint. Discret. Appl. Math. 80(2-3): 211-215 (1997) - [j2]Irène Charon, A. Guénoche, Olivier Hudry, Frédéric Woirgard:
New results on the computation of median orders. Discret. Math. 165-166: 139-153 (1997) - 1993
- [j1]Irène Charon, Olivier Hudry:
The noising method: a new method for combinatorial optimization. Oper. Res. Lett. 14(3): 133-137 (1993)
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-04-24 23:08 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:
