|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 14 occurrences of 14 keywords
|
|
|
|
|
Results
Found 42 publication records. Showing 42 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Irène Charon, Olivier Hudry |
Maximum Distance Between Slater Orders and Copeland Orders of Tournaments.  |
Order  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein |
On the sizes of graphs and their powers: The undirected case. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lucile Belgacem, Irène Charon, Olivier Hudry |
A post-optimization method to route scheduled lightpath demands with multiplicity. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Hudry |
On the complexity of Slater's problems. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein |
New identifying codes in the binary Hamming space. |
Eur. J. Comb. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Olivier Hudry |
An updated survey on the linear ordering problem for weighted or unweighted tournaments. |
Annals OR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Discussiones Mathematicae Graph Theory |
2010 |
DBLP BibTeX RDF |
|
| 1 | David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein |
Watching Systems in graphs: an extension of Identifying Codes |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Irène Charon, Olivier Hudry |
A Branch and Bound Method for a Clique Partitioning Problem. |
CTW |
2010 |
DBLP BibTeX RDF |
|
| 1 | Olivier Hudry |
A survey on the complexity of tournament solutions. |
Mathematical Social Sciences |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Hudry |
Voting Procedures, Complexity of. |
Encyclopedia of Complexity and Systems Science |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lucile Belgacem, Irène Charon, Olivier Hudry |
Routing and Wavelength Assignment in Optical Networks by Independent Sets in Conflict Graphs. |
CTW |
2009 |
DBLP BibTeX RDF |
|
| 1 | Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein |
Discriminating codes in (bipartite) planar graphs. |
Eur. J. Comb. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Olivier Hudry |
ALIO/EURO V Conference on Combinatorial Optimization (ENST, Paris, 26-28 October 2005). |
RAIRO - Operations Research |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Hudry |
NP-hardness results for the aggregation of linear orders into median orders. |
Annals OR |
2008 |
DBLP DOI BibTeX RDF |
Partially ordered relations, Median relations, Aggregation of preferences, Complexity |
| 1 | Irène Charon, Olivier Hudry |
Optimal clustering of multipartite graphs. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Hudry, Melvin F. Janowitz, Sergei Ovchinnikov |
Preface. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Olivier Hudry, Antoine Lobstein |
Extremal cardinalities for identifying and locating-dominating codes in graphs. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Olivier Hudry |
A survey on the linear ordering problem for weighted or unweighted tournaments. |
4OR |
2007 |
DBLP DOI BibTeX RDF |
Mathematical Subject Classification (2000) 05C20, 05C90, 06A05, 91F10, 90C27, 68Q17, 68Q25, 90C57, 68R10, 90C10, 90C59, 90C35, 05C38, 06A07 |
| 1 | Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein |
Structural Properties of Twin-Free Graphs. |
Electr. J. Comb. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Irène Charon, Olivier Hudry |
Application of the "descent with mutations" metaheuristic to a clique partitioning problem. |
RIVF |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein |
Links Between Discriminating and Identifying Codes in the Binary Hamming Space. |
AAECC |
2007 |
DBLP DOI BibTeX RDF |
Discriminating Codes, Identifying Codes, Hamming Space, Graph Theory, Hypercub, Coding Theory |
| 1 | E. Charbit, Irène Charon, Gérard D. Cohen, Olivier Hudry |
Discriminating codes in bipartite graphs. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Lucile Denoeud, Alain Guénoche, Olivier Hudry |
Maximum Transfer Distance Between Partitions. |
J. Classification |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Olivier Hudry |
Noising methods for a clique partitioning problem. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Olivier Hudry |
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel |
A linear algorithm for minimum 1-identifying codes in oriented trees. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Olivier Hudry, Antoine Lobstein |
On the Structure of Identifiable Graphs. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein |
The minimum density of an identifying code in the king lattice. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein |
Identifying and locating-dominating codes on chains and cycles. |
Eur. J. Comb. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Hudry |
A note on "Banks winners in tournaments are difficult to recognize" by G. J. Woeginger. |
Social Choice and Welfare |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Olivier Hudry |
Links between the Slater Index and the Ryser Index of Tournaments. |
Graphs and Combinatorics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Olivier Hudry, Antoine Lobstein |
Identifying Codes with Small Radius in Some Infinite Regular Graphs. |
Electr. J. Comb. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Irène Charon, Olivier Hudry, Antoine Lobstein |
Identifying and locating-dominating codes: NP-Completeness results for directed graphs. |
IEEE Transactions on Information Theory |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Olivier Hudry |
The noising methods: A generalization of some metaheuristics. |
European Journal of Operational Research |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein |
General Bounds for Identifying Codes in Some Infinite Regular Graphs. |
Electr. J. Comb. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Irène Charon, Olivier Hudry |
Slater orders and Hamiltonian paths of tournaments. |
Electronic Notes in Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Olivier Hudry |
Application of the noising method to the travelling salesman problem. |
European Journal of Operational Research |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, A. Guénoche, Olivier Hudry, Frédéric Woirgard |
New results on the computation of median orders. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Charon, Olivier Hudry, Frédéric Woirgard |
Note: A 16-vertex Tournament for Which Banks Set and Slater Set Are Disjoint. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Pierre Barthélemy, Olivier Hudry, Garth Isaak, Fred S. Roberts, Barry A. Tesman |
The Reversing Number of a Digraph. |
Discrete Applied Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #42 of 42 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")