| Publication | Date of Publication | Type |
|---|
On Iiro Honkala's contributions to identifying codes
Fundamenta Informaticae | 2024-10-07 | Paper |
Some results about a conjecture on identifying codes in complete suns
International Transactions in Operational Research | 2023-11-27 | Paper |
Some rainbow problems in graphs have complexity equivalent to satisfiability problems
International Transactions in Operational Research | 2023-11-27 | Paper |
Locating-domination and identification
Topics in Domination in Graphs | 2021-12-15 | Paper |
Optimization of wireless sensor networks deployment with coverage and connectivity constraints
Annals of Operations Research | 2021-05-05 | Paper |
Voting procedures, complexity of
Complex Social and Behavioral Systems | 2021-02-15 | Paper |
| Weighted tournament solutions | 2020-11-12 | Paper |
| On the complexity of determining whether there is a unique Hamiltonian cycle or path | 2020-11-12 | Paper |
| Complexity of unique (optimal) solutions in graphs: vertex cover and domination | 2020-11-12 | Paper |
The compared costs of domination location-domination and identification
Discussiones Mathematicae Graph Theory | 2020-01-08 | Paper |
Application of the ``descent with mutations metaheuristic to a clique partitioning problem
RAIRO - Operations Research | 2019-11-06 | Paper |
Unique (optimal) solutions: complexity results for identifying and locating-dominating codes
Theoretical Computer Science | 2019-03-26 | Paper |
More results on the complexity of domination problems in graphs
International Journal of Information and Coding Theory | 2018-08-24 | Paper |
| Descent with mutations applied to the linear ordering problem | 2018-08-17 | Paper |
| Slater orders and Hamiltonian paths of tournaments | 2016-07-01 | Paper |
On the ensemble of optimal identifying codes in a twin-free graph
Cryptography and Communications | 2016-04-11 | Paper |
More results on the complexity of identifying problems in graphs
Theoretical Computer Science | 2016-03-31 | Paper |
Maximum size of a minimum watching system and the graphs achieving the bound
Discrete Applied Mathematics | 2015-09-22 | Paper |
Complexity results for extensions of median orders to different types of remoteness
Annals of Operations Research | 2015-06-15 | Paper |
On the ensemble of optimal dominating and locating-dominating codes in a graph
Information Processing Letters | 2015-06-02 | Paper |
A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands
European Journal of Operational Research | 2015-02-18 | Paper |
On the number of optimal identifying codes in a twin-free graph
Discrete Applied Mathematics | 2014-11-28 | Paper |
Minimum sizes of identifying codes in graphs differing by one edge
Cryptography and Communications | 2014-06-20 | Paper |
NP-hardness of the computation of a median equivalence relation in classification (Régnier's problem)
Mathématiques et sciences humaines | 2014-04-25 | Paper |
Watching systems in graphs: an extension of identifying codes
Discrete Applied Mathematics | 2014-04-16 | Paper |
Extremal values for the maximum degree in a twin-free graph.
Ars Combinatoria | 2013-12-06 | Paper |
Minimum sizes of identifying codes in graphs differing by one vertex
Cryptography and Communications | 2013-08-02 | Paper |
Extremal values for identification, domination and maximum cliques in twin-free graphs.
Ars Combinatoria | 2012-10-08 | Paper |
On the computation of median linear orders, of median complete preorders and of median weak orders
Mathematical Social Sciences | 2012-09-11 | Paper |
Maximum transfer distance between partitions
Journal of Classification | 2012-05-30 | Paper |
A post-optimization method to route scheduled lightpath demands with multiplicity
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
On the sizes of graphs and their powers: the undirected case
Discrete Applied Mathematics | 2011-10-27 | Paper |
Consensus theories. An oriented survey
Mathématiques et sciences humaines | 2011-07-04 | Paper |
Liminaire au n° spécial : Mathématiques discrètes : théories et usages. Numéro en hommage à Bruno Leclerc
Mathématiques et sciences humaines | 2011-07-04 | Paper |
| On the sizes of the graphs \(G\), \(G^r\), \(G^r\setminus G\): the directed case | 2011-05-31 | Paper |
Complexity results for identifying codes in planar graphs
International Transactions in Operational Research | 2011-05-20 | Paper |
On the existence of a cycle of length at least 7 in a \((1,\leq 2)\)-twin-free graph
Discussiones Mathematicae Graph Theory | 2011-05-09 | Paper |
Maximum distance between Slater orders and Copeland orders of tournaments
Order | 2011-03-31 | Paper |
| Branch-and-bound methods | 2011-03-09 | Paper |
An updated survey on the linear ordering problem for weighted or unweighted tournaments
Annals of Operations Research | 2010-05-10 | Paper |
New identifying codes in the binary Hamming space
European Journal of Combinatorics | 2010-04-27 | Paper |
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs
Advances in Mathematics of Communications | 2010-03-10 | Paper |
Erratum to ``Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs.
Advances in Mathematics of Communications | 2010-03-08 | Paper |
Maximum of the transfer distance to a given partition
Mathématiques et sciences humaines | 2010-02-11 | Paper |
| Foreword to the special issue: ``Social choice theory: golden jubilee | 2010-02-11 | Paper |
On the complexity of Slater's problems
European Journal of Operational Research | 2009-12-07 | Paper |
A survey on the complexity of tournament solutions
Mathematical Social Sciences | 2009-12-07 | Paper |
Self-tuning of the noising methods
Optimization | 2009-11-19 | Paper |
NP-hardness results for the aggregation of linear orders into median orders
Annals of Operations Research | 2009-08-04 | Paper |
Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
Advances in Mathematics of Communications | 2009-02-19 | Paper |
Overlapping Clustering in a Graph Using k-Means and Application to Protein Interactions Networks
Selected Contributions in Data Analysis and Classification | 2009-01-07 | Paper |
Optimal clustering of multipartite graphs
Discrete Applied Mathematics | 2008-09-29 | Paper |
Discriminating codes in (bipartite) planar graphs
European Journal of Combinatorics | 2008-05-29 | Paper |
Links Between Discriminating and Identifying Codes in the Binary Hamming Space
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes | 2008-04-17 | Paper |
A survey on the linear ordering problem for weighted or unweighted tournaments
4OR | 2007-08-31 | Paper |
Discriminating codes in bipartite graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
On the Structure of Identifiable Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Structural properties of twin-free graphs
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Structural properties of twin-free graphs
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Extremal cardinalities for identifying and locating-dominating codes in graphs
Discrete Mathematics | 2007-02-13 | Paper |
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
Discrete Applied Mathematics | 2006-10-30 | Paper |
| Possible cardinalities for locating-dominating codes in graphs | 2006-09-13 | Paper |
A linear algorithm for minimum 1-identifying codes in oriented trees
Discrete Applied Mathematics | 2006-06-30 | Paper |
Noising methods for a clique partitioning problem
Discrete Applied Mathematics | 2006-04-28 | Paper |
A smallest tournament for which the Banks set and the Copeland set are disjoint
Social Choice and Welfare | 2005-08-22 | Paper |
| scientific article; zbMATH DE number 2186985 (Why is no real title available?) | 2005-07-13 | Paper |
Identifying and locating-dominating codes: NP-completeness results for directed graphs
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
| scientific article; zbMATH DE number 2147927 (Why is no real title available?) | 2005-03-21 | Paper |
A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger
Social Choice and Welfare | 2005-03-08 | Paper |
Identifying and locating-dominating codes on chains and cycles
European Journal of Combinatorics | 2004-10-13 | Paper |
| scientific article; zbMATH DE number 2096708 (Why is no real title available?) | 2004-09-06 | Paper |
The minimum density of an identifying code in the king lattice.
Discrete Mathematics | 2004-02-14 | Paper |
Links between the Slater index and the Ryser index of tournaments
Graphs and Combinatorics | 2003-10-16 | Paper |
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
Theoretical Computer Science | 2003-08-17 | Paper |
| The noising methods: A survey | 2003-02-25 | Paper |
| scientific article; zbMATH DE number 1855678 (Why is no real title available?) | 2003-01-19 | Paper |
Identifying codes with small radius in some infinite regular graphs
The Electronic Journal of Combinatorics | 2002-04-25 | Paper |
Identifying codes with small radius in some infinite regular graphs
The Electronic Journal of Combinatorics | 2002-04-25 | Paper |
General bounds for identifying codes in some infinite regular graphs
The Electronic Journal of Combinatorics | 2002-02-07 | Paper |
General bounds for identifying codes in some infinite regular graphs
The Electronic Journal of Combinatorics | 2002-02-07 | Paper |
Random generation of tournaments and asymmetric graphs with given out-degrees
European Journal of Operational Research | 2001-12-13 | Paper |
| scientific article; zbMATH DE number 1500612 (Why is no real title available?) | 2001-02-12 | Paper |
The noising methods: A generalization of some metaheuristics
European Journal of Operational Research | 2001-01-01 | Paper |
Application of the noising method to the travelling salesman problem
European Journal of Operational Research | 2000-09-14 | Paper |
| scientific article; zbMATH DE number 1422720 (Why is no real title available?) | 2000-04-06 | Paper |
| scientific article; zbMATH DE number 1422720 (Why is no real title available?) | 2000-04-06 | Paper |
Lamarckian genetic algorithms applied to the aggregation of preferences
Annals of Operations Research | 1998-07-28 | Paper |
| scientific article; zbMATH DE number 1163867 (Why is no real title available?) | 1998-06-11 | Paper |
A 16-vertex tournament for which Banks set and Slater set are disjoint
Discrete Applied Mathematics | 1998-06-02 | Paper |
New results on the computation of median orders
Discrete Mathematics | 1997-12-14 | Paper |
| scientific article; zbMATH DE number 1054957 (Why is no real title available?) | 1997-08-28 | Paper |
| scientific article; zbMATH DE number 1022238 (Why is no real title available?) | 1997-06-16 | Paper |
| scientific article; zbMATH DE number 1022238 (Why is no real title available?) | 1997-06-16 | Paper |
| scientific article; zbMATH DE number 892279 (Why is no real title available?) | 1996-09-29 | Paper |
| scientific article; zbMATH DE number 892279 (Why is no real title available?) | 1996-09-29 | Paper |
| scientific article; zbMATH DE number 878679 (Why is no real title available?) | 1996-07-08 | Paper |
| scientific article; zbMATH DE number 878679 (Why is no real title available?) | 1996-07-08 | Paper |
The reversing number of a digraph
Discrete Applied Mathematics | 1995-09-06 | Paper |
The noising method: A new method for combinatorial optimization
Operations Research Letters | 1994-11-01 | Paper |
Median linear orders: Heuristics and a branch and bound algorithm
European Journal of Operational Research | 1989-01-01 | Paper |
Iiro Honkala's contributions to identifying codes
(available as arXiv preprint) | N/A | Paper |
