Filter your results
- 9
- 4
- 4
- 3
- 3
- 2
- 1
- 12
- 6
- 1
- 1
- 1
- 1
- 3
- 3
- 2
- 1
- 11
- 2
- 13
- 1
- 1
- 1
- 10
- 13
- 7
- 3
- 2
- 2
- 1
- 1
|
|
sorted by
|
Journées de 2007 de la Société francophone de classification. Avant-proposMathematics and Social Sciences, 2009, 187, pp.5-6
Journal articles
hal-02286699v1
|
|||
A branch and bound method for the aggregation of symmetric relations2nd International Symposium on Combinatorial Optimization (ISCO 2012), Apr 2012, Athènes, Greece. pp.127-130
Conference papers
hal-02286302v1
|
|||
2 : The noising methodsHeuristics: Theory and Applications, Nova Publishers, pp.1-30, 2013
Book sections
hal-02286568v1
|
|||
Variations of identifying codes in graphs obained by adding or removing one vertex9th International colloquium on graph theory and combinatorics (ICGT 2014), Jul 2014, Grenoble, France. pp.1-4
Conference papers
hal-02286931v1
|
|||
Minimum Sizes of Identifying Codes in Graphs Differing by One VertexCryptography and Communications - Discrete Structures, Boolean Functions and Sequences, 2013, 5, pp.119-136
Journal articles
hal-02286382v1
|
|||
3 : Branch-and-bound methodsConcepts of Combinatorial Optimization, Wiley-ISTE Ltd, pp.41-69, 2010
Book sections
hal-02278612v1
|
|||
|
Locating-Domination and IdentificationT. Haynes, S. Hedetniemi & M. Henning. Topics in Domination in Graphs, pp.251-299, 2020
Book sections
hal-02916929v1
|
||
Lexicographic decomposition of preferencesElectronic Notes in Discrete Mathematics, 2013, 42, pp.25-32
Journal articles
hal-02286383v1
|
|||
Codes in the q-ary Lee HypercubeWSEAS Transactions on Mathematics, 2022
Journal articles
hal-03650634v1
|
|||
|
Maximum Size of a Minimum Watching System and the Graphs Achieving the Bound2012
Preprints, Working Papers, ...
hal-00680690v1
|
||
|
Watching systems in graphs: an extension of identifying codes2010
Preprints, Working Papers, ...
hal-00481469v1
|
||
Introduction à l’optimisation continue et discrèteLavoisier, pp.500, 2019
Books
hal-02288068v1
|
|||
|
Minimum Sizes of Identifying Codes in Graphs Differing by One Edge or One Vertex2012
Preprints, Working Papers, ...
hal-00731811v1
|