5 citations · 8 across the 3 of their papers we have counts for
4 papers
A Structural Characterization for Certifying Robinsonian Matrices
Monique Laurent, Matteo Seminaroti, Shin-ichi Tanigawa
A symmetric matrix is Robinsonian if its rows and columns can be simultaneously reordered in such a way that entries are monotone nondecreasing in rows and columns when moving towa…
Similarity-First Search: a new algorithm with application to Robinsonian matrix recognition
Monique Laurent, Matteo Seminaroti
We present a new efficient combinatorial algorithm for recognizing if a given symmetric matrix is Robinsonian, i.e., if its rows and columns can be simultaneously reordered so that…
A Lex-BFS-based recognition algorithm for Robinsonian matrices
Monique Laurent, Matteo Seminaroti
Robinsonian matrices arise in the classical seriation problem and play an important role in many applications where unsorted similarity (or dissimilarity) information must be reord…
The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
Monique Laurent, Matteo Seminaroti
We present a new polynomially solvable case of the Quadratic Assignment Problem in Koopmans-Beckman form , by showing that the identity permutation is optimal when an…