| Publication | Date of Publication | Type |
|---|
| On Iiro Honkala's contributions to identifying codes | 2024-10-07 | Paper |
| Some results about a conjecture on identifying codes in complete suns | 2023-11-27 | Paper |
| Some rainbow problems in graphs have complexity equivalent to satisfiability problems | 2023-11-27 | Paper |
| Locating-Domination and Identification | 2021-12-15 | Paper |
| Optimization of wireless sensor networks deployment with coverage and connectivity constraints | 2021-05-05 | Paper |
| Voting Procedures, Complexity of | 2021-02-15 | Paper |
| Weighted Tournament Solutions | 2020-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5133053 | 2020-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5133215 | 2020-11-12 | Paper |
| The compared costs of domination location-domination and identification | 2020-01-08 | Paper |
| Application of the “descent with mutations” metaheuristic to a clique partitioning problem | 2019-11-06 | Paper |
| Unique (optimal) solutions: complexity results for identifying and locating-dominating codes | 2019-03-26 | Paper |
| More results on the complexity of domination problems in graphs | 2018-08-24 | Paper |
| Descent with mutations applied to the linear ordering problem | 2018-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816068 | 2016-07-01 | Paper |
| On the ensemble of optimal identifying codes in a twin-free graph | 2016-04-11 | Paper |
| More results on the complexity of identifying problems in graphs | 2016-03-31 | Paper |
| Maximum size of a minimum watching system and the graphs achieving the bound | 2015-09-22 | Paper |
| Complexity results for extensions of median orders to different types of remoteness | 2015-06-15 | Paper |
| On the ensemble of optimal dominating and locating-dominating codes in a graph | 2015-06-02 | Paper |
| A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands | 2015-02-18 | Paper |
| On the number of optimal identifying codes in a twin-free graph | 2014-11-28 | Paper |
| Minimum sizes of identifying codes in graphs differing by one edge | 2014-06-20 | Paper |
| NP-hardness of the computation of a median equivalence relation in classification (Régnier problem) | 2014-04-25 | Paper |
| Watching systems in graphs: an extension of identifying codes | 2014-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2864455 | 2013-12-06 | Paper |
| Minimum sizes of identifying codes in graphs differing by one vertex | 2013-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2918543 | 2012-10-08 | Paper |
| On the computation of median linear orders, of median complete preorders and of median weak orders | 2012-09-11 | Paper |
| Maximum transfer distance between partitions | 2012-05-30 | Paper |
| A post-optimization method to route scheduled lightpath demands with multiplicity | 2012-05-13 | Paper |
| On the sizes of graphs and their powers: the undirected case | 2011-10-27 | Paper |
| Liminaire au n° spécial : Mathématiques discrètes : théories et usages. Numéro en hommage à Bruno Leclerc | 2011-07-04 | Paper |
| Consensus theories. An oriented survey | 2011-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3001191 | 2011-05-31 | Paper |
| Complexity results for identifying codes in planar graphs | 2011-05-20 | Paper |
| On the existence of a cycle of length at least 7 in a (1,≤ 2)-twin-free graph | 2011-05-09 | Paper |
| Maximum distance between Slater orders and Copeland orders of tournaments | 2011-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3081834 | 2011-03-09 | Paper |
| An updated survey on the linear ordering problem for weighted or unweighted tournaments | 2010-05-10 | Paper |
| New identifying codes in the binary Hamming space | 2010-04-27 | Paper |
| Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs | 2010-03-10 | Paper |
| Erratum to ``Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs. | 2010-03-08 | Paper |
| Maximum de la distance de transfert à une partition donnée | 2010-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3405839 | 2010-02-11 | Paper |
| A survey on the complexity of tournament solutions | 2009-12-07 | Paper |
| On the complexity of Slater's problems | 2009-12-07 | Paper |
| Self-tuning of the noising methods | 2009-11-19 | Paper |
| NP-hardness results for the aggregation of linear orders into median orders | 2009-08-04 | Paper |
| Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity | 2009-02-19 | Paper |
| Overlapping Clustering in a Graph Using k-Means and Application to Protein Interactions Networks | 2009-01-07 | Paper |
| Optimal clustering of multipartite graphs | 2008-09-29 | Paper |
| Discriminating codes in (bipartite) planar graphs | 2008-05-29 | Paper |
| Links Between Discriminating and Identifying Codes in the Binary Hamming Space | 2008-04-17 | Paper |
| A survey on the linear ordering problem for weighted or unweighted tournaments | 2007-08-31 | Paper |
| On the Structure of Identifiable Graphs | 2007-05-29 | Paper |
| Discriminating codes in bipartite graphs | 2007-05-29 | Paper |
| Structural properties of twin-free graphs | 2007-03-12 | Paper |
| Extremal cardinalities for identifying and locating-dominating codes in graphs | 2007-02-13 | Paper |
| A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments | 2006-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5487899 | 2006-09-13 | Paper |
| A linear algorithm for minimum 1-identifying codes in oriented trees | 2006-06-30 | Paper |
| Noising methods for a clique partitioning problem | 2006-04-28 | Paper |
| A smallest tournament for which the Banks set and the Copeland set are disjoint | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3025212 | 2005-07-13 | Paper |
| Identifying and locating-dominating codes: NP-completeness results for directed graphs | 2005-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4659582 | 2005-03-21 | Paper |
| A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger | 2005-03-08 | Paper |
| Identifying and locating-dominating codes on chains and cycles | 2004-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4811470 | 2004-09-06 | Paper |
| The minimum density of an identifying code in the king lattice. | 2004-02-14 | Paper |
| Links between the Slater index and the Ryser index of tournaments | 2003-10-16 | Paper |
| Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2776560 | 2003-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788093 | 2003-01-19 | Paper |
| Identifying codes with small radius in some infinite regular graphs | 2002-04-25 | Paper |
| General bounds for identifying codes in some infinite regular graphs | 2002-02-07 | Paper |
| Random generation of tournaments and asymmetric graphs with given out-degrees | 2001-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501634 | 2001-02-12 | Paper |
| The noising methods: A generalization of some metaheuristics | 2001-01-01 | Paper |
| Application of the noising method to the travelling salesman problem | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4946665 | 2000-04-06 | Paper |
| Lamarckian genetic algorithms applied to the aggregation of preferences | 1998-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395490 | 1998-06-11 | Paper |
| A 16-vertex tournament for which Banks set and Slater set are disjoint | 1998-06-02 | Paper |
| New results on the computation of median orders | 1997-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4350077 | 1997-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4339963 | 1997-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4880988 | 1996-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4878464 | 1996-07-08 | Paper |
| The reversing number of a digraph | 1995-09-06 | Paper |
| The noising method: A new method for combinatorial optimization | 1994-11-01 | Paper |
| Median linear orders: Heuristics and a branch and bound algorithm | 1989-01-01 | Paper |
| Iiro Honkala's contributions to identifying codes | N/A | Paper |
