The following pages link to Irène Charon (Q226962):
Displaying 46 items.
- Maximum transfer distance between partitions (Q424003) (← links)
- Maximum size of a minimum watching system and the graphs achieving the bound (Q496659) (← links)
- Maximum distance between Slater orders and Copeland orders of tournaments (Q633222) (← links)
- On the sizes of graphs and their powers: the undirected case (Q643002) (← 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)
- Optimal clustering of multipartite graphs (Q947074) (← links)
- New identifying codes in the binary Hamming space (Q966160) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity (Q1001641) (← links)
- Random generation of tournaments and asymmetric graphs with given out-degrees (Q1278398) (← links)
- The noising method: A new method for combinatorial optimization (Q1319680) (← links)
- (Q1356735) (redirect page) (← links)
- New results on the computation of median orders (Q1356737) (← links)
- A 16-vertex tournament for which Banks set and Slater set are disjoint (Q1382278) (← links)
- Lamarckian genetic algorithms applied to the aggregation of preferences (Q1392449) (← links)
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. (Q1401220) (← links)
- Links between the Slater index and the Ryser index of tournaments (Q1411107) (← links)
- The minimum density of an identifying code in the king lattice. (Q1422415) (← links)
- Application of the noising method to the travelling salesman problem (Q1580974) (← 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)
- A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands (Q2255944) (← 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)
- Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684) (← links)
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (Q2433800) (← links)
- Watching systems in graphs: an extension of identifying codes (Q2446294) (← links)
- Noising methods for a clique partitioning problem (Q2489901) (← links)
- A linear algorithm for minimum 1-identifying codes in oriented trees (Q2495905) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- (Q2776560) (← links)
- (Q2816068) (← links)
- (Q2864455) (← links)
- A post-optimization method to route scheduled lightpath demands with multiplicity (Q2883572) (← 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)
- (Q3081834) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Maximum de la distance de transfert à une partition donnée (Q3405694) (← links)
- On the Structure of Identifiable Graphs (Q3439386) (← links)
- Discriminating codes in bipartite graphs (Q3439638) (← links)
