| Publication | Date of Publication | Type |
|---|
| Single or Multiple Consensus for Linear Orders | 2017-06-26 | Paper |
| Generalized trees related with tree metrics | 2016-07-01 | Paper |
| TreeOfTrees method to evaluate the congruence between gene trees | 2016-04-04 | Paper |
| Sur le consensus en catégorisation libre | 2014-04-25 | Paper |
| Comparison of alignment free string distances for complete genome phylogeny | 2014-04-01 | Paper |
| Consensus of partitions: a constructive approach | 2012-11-15 | Paper |
| Distances in graph partitioning | 2012-09-14 | Paper |
| Detection of disjoint or overlapping communities in networks | 2012-09-14 | Paper |
| Maximum transfer distance between partitions | 2012-05-30 | Paper |
| Bootstrap clustering for graph partitioning | 2012-04-18 | Paper |
| Making Decisions in Multi Partitioning | 2011-10-28 | Paper |
| About the largest subtree common to several X-trees | 2011-07-04 | Paper |
| Comparison of algorithms in graph partitioning | 2010-10-26 | Paper |
| An Evolutionary Distance Based on Maximal Unique Matches | 2010-05-21 | Paper |
| Looking for High Density Zones in a Graph | 2009-01-07 | Paper |
| Two local dissimilarity measures for weighted graphs with application to protein interaction networks | 2008-10-21 | Paper |
| Comparing bacterial genomes from linear orders of patterns | 2008-09-29 | Paper |
| Comparing recent methods in graph partitioning | 2007-05-29 | Paper |
| About the design of oligo-chips | 2005-03-08 | Paper |
| On the extension of a partial metric to a tree metric | 2004-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4424496 | 2003-12-15 | Paper |
| The triangles method to build \(X\)-trees from incomplete distance matrices | 2002-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532064 | 2002-05-28 | Paper |
| Ordinal properties of tree distances | 2000-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395483 | 1998-11-15 | Paper |
| Order distance associated with a hierarchy | 1998-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395490 | 1998-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375739 | 1998-05-04 | Paper |
| New results on the computation of median orders | 1997-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4339964 | 1997-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4277743 | 1994-05-19 | Paper |
| Enumeration of the partitions with minimum diameter | 1994-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4004055 | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3487400 | 1990-01-01 | Paper |
| Counting and selecting at random bipartite graphs with fixed degrees | 1990-01-01 | Paper |
| Median linear orders: Heuristics and a branch and bound algorithm | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3782754 | 1987-01-01 | Paper |
| Représentations arborées des classifications | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4723056 | 1985-01-01 | Paper |
| Random spanning tree | 1983-01-01 | Paper |
| Enumeration des tableaux Standards | 1979-01-01 | Paper |
| Énumération de classes de permutations | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3950565 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3943736 | 1978-01-01 | Paper |
| Un algorithme pour pallier l'effet Condorcet | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4141122 | 1977-01-01 | Paper |
