Exact Algorithms for Intervalizing Colored Graphs

Hans L. Bodlaender, Johan M. M. van Rooij. Exact Algorithms for Intervalizing Colored Graphs. In Alberto Marchetti-Spaccamela, Michael Segal, editors, Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Rome, Italy, April 18-20, 2011. Proceedings. Volume 6595 of Lecture Notes in Computer Science, pages 45-56, Springer, 2011. [doi]

@inproceedings{BodlaenderR11,
  title = {Exact Algorithms for Intervalizing Colored Graphs},
  author = {Hans L. Bodlaender and Johan M. M. van Rooij},
  year = {2011},
  doi = {10.1007/978-3-642-19754-3_7},
  url = {http://dx.doi.org/10.1007/978-3-642-19754-3_7},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderR11},
  cites = {0},
  citedby = {0},
  pages = {45-56},
  booktitle = {Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Rome, Italy, April 18-20, 2011. Proceedings},
  editor = {Alberto Marchetti-Spaccamela and Michael Segal},
  volume = {6595},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-19753-6},
}