Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Lobstein, Antoine
64  Ergebnisse:
Personensuche X
?
1

Some rainbow problems in graphs have complexity equivalent ..:

Hudry, Olivier ; Lobstein, Antoine
International Transactions in Operational Research.  29 (2020)  3 - p. 1547-1572 , 2020
Link: https://doi.org/10.1111/..
 
?
2

Locating-Domination and Identification:

, In: Topics in Domination in Graphs; Developments in Mathematics,
Lobstein, Antoine ; Hudry, Olivier ; Charon, Irène - p. 251-299 , 2020
Link: https://doi.org/10.1007/..
 
?
3

Unique (optimal) solutions: Complexity results for identify..:

Hudry, Olivier ; Lobstein, Antoine
Theoretical Computer Science.  767 (2019)  - p. 83-102 , 2019
Link: https://doi.org/10.1016/..
 
?
4

More results on the complexity of identifying problems in g..:

Hudry, Olivier ; Lobstein, Antoine
Theoretical Computer Science.  626 (2016)  - p. 1-12 , 2016
Link: https://doi.org/10.1016/..
 
?
5

Some results about a conjecture on identifying codes in com..:

Hudry, Olivier ; Lobstein, Antoine
International Transactions in Operational Research.  26 (2016)  2 - p. 732-746 , 2016
Link: https://doi.org/10.1111/..
 
?
6

On the ensemble of optimal identifying codes in a twin-free..:

Honkala, Iiro ; Hudry, Olivier ; Lobstein, Antoine
Cryptography and Communications.  8 (2015)  1 - p. 139-153 , 2015
Link: https://doi.org/10.1007/..
 
?
7

On the number of optimal identifying codes in a twin-free g..:

Honkala, Iiro ; Hudry, Olivier ; Lobstein, Antoine
Discrete Applied Mathematics.  180 (2015)  - p. 111-119 , 2015
Link: https://doi.org/10.1016/..
 
?
8

On the ensemble of optimal dominating and locating-dominati..:

Honkala, Iiro ; Hudry, Olivier ; Lobstein, Antoine
Information Processing Letters.  115 (2015)  9 - p. 699-702 , 2015
Link: https://doi.org/10.1016/..
 
?
9

Maximum size of a minimum watching system and the graphs ac..:

Auger, David ; Charon, Irène ; Hudry, Olivier.
Discrete Applied Mathematics.  164 (2014)  - p. 20-33 , 2014
Link: https://doi.org/10.1016/..
 
?
10

Minimum sizes of identifying codes in graphs differing by o..:

Charon, Irène ; Honkala, Iiro ; Hudry, Olivier.
Cryptography and Communications.  6 (2013)  2 - p. 157-170 , 2013
Link: https://doi.org/10.1007/..
 
?
11

Minimum sizes of identifying codes in graphs differing by o..:

Charon, Irène ; Honkala, Iiro ; Hudry, Olivier.
Cryptography and Communications.  5 (2013)  2 - p. 119-136 , 2013
Link: https://doi.org/10.1007/..
 
?
12

Watching systems in graphs: An extension of identifying cod..:

Auger, David ; Charon, Irène ; Hudry, Olivier.
Discrete Applied Mathematics.  161 (2013)  12 - p. 1674-1685 , 2013
Link: https://doi.org/10.1016/..
 
?
13

On the sizes of graphs and their powers: The undirected cas:

Auger, David ; Charon, Irène ; Hudry, Olivier.
Discrete Applied Mathematics.  159 (2011)  16 - p. 1666-1675 , 2011
Link: https://doi.org/10.1016/..
 
?
14

New identifying codes in the binary Hamming space:

Charon, Irène ; Cohen, Gérard ; Hudry, Olivier.
European Journal of Combinatorics.  31 (2010)  2 - p. 491-501 , 2010
Link: https://doi.org/10.1016/..
 
?
15

Complexity results for identifying codes in planar graphs:

Auger, David ; Charon, Irène ; Hudry, Olivier.
International Transactions in Operational Research.  17 (2010)  6 - p. 691-710 , 2010
Link: https://doi.org/10.1111/..
 
1-15