Reordering the Reorderable Matrix as an Algorithmic Problem

Erkki Mäkinen, Harri Siirtola. Reordering the Reorderable Matrix as an Algorithmic Problem. In Michael Anderson, Peter Cheng, Volker Haarslev, editors, Theory and Application of Diagrams, First International Conference, Diagrams 2000, Edinburgh, Scotland, UK, September 1-3, 2000, Proceedings. Volume 1889 of Lecture Notes in Computer Science, pages 453-467, Springer, 2000. [doi]

@inproceedings{MakinenS00,
  title = {Reordering the Reorderable Matrix as an Algorithmic Problem},
  author = {Erkki Mäkinen and Harri Siirtola},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1889/18890453.htm},
  researchr = {https://researchr.org/publication/MakinenS00},
  cites = {0},
  citedby = {0},
  pages = {453-467},
  booktitle = {Theory and Application of Diagrams, First International Conference, Diagrams 2000, Edinburgh, Scotland, UK, September 1-3, 2000, Proceedings},
  editor = {Michael Anderson and Peter Cheng and Volker Haarslev},
  volume = {1889},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-67915-4},
}