From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP

Catarina Carvalho, Florent R. Madelaine, Barnaby Martin. From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP. In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015. pages 462-474, IEEE, 2015. [doi]

@inproceedings{CarvalhoMM15,
  title = {From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP},
  author = {Catarina Carvalho and Florent R. Madelaine and Barnaby Martin},
  year = {2015},
  doi = {10.1109/LICS.2015.50},
  url = {http://dx.doi.org/10.1109/LICS.2015.50},
  researchr = {https://researchr.org/publication/CarvalhoMM15},
  cites = {0},
  citedby = {0},
  pages = {462-474},
  booktitle = {30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015},
  publisher = {IEEE},
  isbn = {978-1-4799-8875-4},
}