The following pages link to Antoine C. Lobstein (Q1199621):
Displaying 50 items.
- (Q174192) (redirect page) (← links)
- (Q226964) (redirect page) (← links)
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- On the ensemble of optimal identifying codes in a twin-free graph (Q267807) (← links)
- On the number of optimal identifying codes in a twin-free graph (Q476309) (← links)
- Maximum size of a minimum watching system and the graphs achieving the bound (Q496659) (← links)
- Adaptive identification in Torii in the King lattice (Q540127) (← links)
- On the sizes of graphs and their powers: the undirected case (Q643002) (← links)
- Covering radius 1985-1994 (Q676007) (← links)
- On identifying codes in binary Hamming spaces (Q696908) (← links)
- Extremal cardinalities for identifying and locating-dominating codes in graphs (Q864121) (← links)
- Structural properties of twin-free graphs (Q870075) (← links)
- Discriminating codes in (bipartite) planar graphs (Q925038) (← links)
- Adaptive identification in graphs (Q958720) (← links)
- New identifying codes in the binary Hamming space (Q966160) (← links)
- Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity (Q1001641) (← links)
- On perfect arithmetic codes (Q1199622) (← links)
- New bounds for codes identifying vertices in graphs (Q1283874) (← links)
- On new perfect binary nonlinear codes (Q1360995) (← links)
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. (Q1401220) (← links)
- On the complexity of the identification problem in Hamming spaces (Q1403334) (← links)
- The minimum density of an identifying code in the king lattice. (Q1422415) (← links)
- More results on the complexity of domination problems in graphs (Q1664084) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
- On the density of identifying codes in the square lattice (Q1850615) (← links)
- Identifying and locating-dominating codes on chains and cycles (Q1883609) (← links)
- Minimum sizes of identifying codes in graphs differing by one edge (Q2016394) (← links)
- Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs (Q2268243) (← links)
- Erratum to ``Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs''. (Q2268675) (← links)
- The compared costs of domination location-domination and identification (Q2282469) (← links)
- On the ensemble of optimal dominating and locating-dominating codes in a graph (Q2346565) (← links)
- Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684) (← links)
- Watching systems in graphs: an extension of identifying codes (Q2446294) (← links)
- A linear algorithm for minimum 1-identifying codes in oriented trees (Q2495905) (← links)
- Bounds for Codes Identifying Vertices in the Hexagonal Grid (Q2706181) (← links)
- (Q2717197) (← links)
- (Q2864455) (← links)
- (Q2918543) (← links)
- On the existence of a cycle of length at least 7 in a (1,≤ 2)-twin-free graph (Q2997586) (← links)
- (Q3001191) (← links)
- Complexity results for identifying codes in planar graphs (Q3002553) (← links)
- (Q3025212) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- On codes identifying vertices in the two-dimensional square lattice with diagonals (Q3417009) (← links)
- On the Structure of Identifiable Graphs (Q3439386) (← links)
- On normal and subnormal q-ary codes (Q3472054) (← links)
- (Q3484769) (← links)
- (Q3748199) (← links)
- Sur la complexité d'un problème de codage (Q3755359) (← links)
- Further results on the covering radius of codes (Q3755361) (← links)