The SCEAS System
| |||||||

## Search the dblp DataBase
Olivier Hudry:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
**General Bounds for Identifying Codes in Some Infinite Regular Graphs.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal] - Irène Charon, Olivier Hudry, Antoine Lobstein
**Identifying Codes with Small Radius in Some Infinite Regular Graphs.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal] - Jean-Pierre Barthélemy, Olivier Hudry, Garth Isaak, Fred S. Roberts, Barry A. Tesman
**The Reversing Number of a Digraph.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:39-76 [Journal] - Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel
**A linear algorithm for minimum 1-identifying codes in oriented trees.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:8, pp:1246-1253 [Journal] - Irène Charon, Olivier Hudry
**Noising methods for a clique partitioning problem.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:5, pp:754-769 [Journal] - Irène Charon, Olivier Hudry, Frédéric Woirgard
**Note: A 16-vertex Tournament for Which Banks Set and Slater Set Are Disjoint.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:80, n:2-3, pp:211-215 [Journal] - Irène Charon, Olivier Hudry
**A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:15, pp:2097-2116 [Journal] - Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
**The minimum density of an identifying code in the king lattice.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:276, n:1-3, pp:95-109 [Journal] - Irène Charon, Olivier Hudry, Antoine Lobstein
**Extremal cardinalities for identifying and locating-dominating codes in graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:3-5, pp:356-366 [Journal] - Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein
**Identifying and locating-dominating codes on chains and cycles.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2004, v:25, n:7, pp:969-987 [Journal] - Irène Charon, Olivier Hudry
**Links between the Slater Index and the Ryser Index of Tournaments.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2003, v:19, n:3, pp:309-322 [Journal] - Irène Charon, Olivier Hudry, Antoine Lobstein
**Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:290, n:3, pp:2109-2120 [Journal] - Irène Charon, Olivier Hudry, Antoine Lobstein
**Identifying and locating-dominating codes: NP-Completeness results for directed graphs.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:8, pp:2192-2200 [Journal] - Irène Charon, Olivier Hudry
**A survey on the linear ordering problem for weighted or unweighted tournaments.**[Citation Graph (0, 0)][DBLP] 4OR, 2007, v:5, n:1, pp:5-60 [Journal] - Irène Charon, A. Guénoche, Olivier Hudry, Frédéric Woirgard
**New results on the computation of median orders.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:165, n:, pp:139-153 [Journal] **Links Between Discriminating and Identifying Codes in the Binary Hamming Space.**[Citation Graph (, )][DBLP]**Application of the "descent with mutations" metaheuristic to a clique partitioning problem.**[Citation Graph (, )][DBLP]**Routing and Wavelength Assignment in Optical Networks by Independent Sets in Conflict Graphs.**[Citation Graph (, )][DBLP]**Structural Properties of Twin-Free Graphs.**[Citation Graph (, )][DBLP]**Watching Systems in graphs: an extension of Identifying Codes**[Citation Graph (, )][DBLP]**Optimal clustering of multipartite graphs.**[Citation Graph (, )][DBLP]**Preface.**[Citation Graph (, )][DBLP]**Discriminating codes in (bipartite) planar graphs.**[Citation Graph (, )][DBLP]**New identifying codes in the binary Hamming space.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |