Minimum Fill-In on Circle and Circular-Arc Graphs

Ton Kloks, Dieter Kratsch, C. K. Wong. Minimum Fill-In on Circle and Circular-Arc Graphs. In Friedhelm Meyer auf der Heide, Burkhard Monien, editors, Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings. Volume 1099 of Lecture Notes in Computer Science, pages 256-267, Springer, 1996.

@inproceedings{KloksKW96,
  title = {Minimum Fill-In on Circle and Circular-Arc Graphs},
  author = {Ton Kloks and Dieter Kratsch and C. K. Wong},
  year = {1996},
  tags = {graph-rewriting, C++, rewriting},
  researchr = {https://researchr.org/publication/KloksKW96},
  cites = {0},
  citedby = {0},
  pages = {256-267},
  booktitle = {Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings},
  editor = {Friedhelm Meyer auf der Heide and Burkhard Monien},
  volume = {1099},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-61440-0},
}