The following pages link to Olivier Hudry (Q226963):
Displaying 50 items.
- 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)
- Maximum transfer distance between partitions (Q424003) (← links)
- On the computation of median linear orders, of median complete preorders and of median weak orders (Q449031) (← 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)
- (Q582182) (redirect page) (← links)
- Median linear orders: Heuristics and a branch and bound algorithm (Q582183) (← 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)
- Optimization of wireless sensor networks deployment with coverage and connectivity constraints (Q829179) (← 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)
- A survey on the complexity of tournament solutions (Q1042317) (← links)
- On the complexity of Slater's problems (Q1043351) (← 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)
- 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)
- Descent with mutations applied to the linear ordering problem (Q1661893) (← 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)
- A note on ``Bank winners in tournaments are difficult to recognize'' by G. J. Woeginger (Q1767293) (← links)
- Identifying and locating-dominating codes on chains and cycles (Q1883609) (← links)
- The reversing number of a digraph (Q1894351) (← 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)
- NP-hardness results for the aggregation of linear orders into median orders (Q2271866) (← 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)
- Complexity results for extensions of median orders to different types of remoteness (Q2348767) (← links)
- A smallest tournament for which the Banks set and the Copeland set are disjoint (Q2386306) (← 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)
