Lics

IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Thirtieth Annual IEEE Symposium on

Logic in Computer Science (LICS 2015)

Paper: From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP (at LICS 2015)

Authors: Catarina Carvalho Florent R. Madelaine Barnaby Martin

Abstract

No Abstract Available

BibTeX

  @InProceedings{CarvalhoMadelaineMa-FromComplexitytoAlg,
    author = 	 {Catarina Carvalho and Florent R. Madelaine and Barnaby Martin},
    title = 	 {From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP},
    booktitle =  {Proceedings of the Thirtieth Annual IEEE Symposium on Logic in Computer Science (LICS 2015)},
    year =	 {2015},
    month =	 {July}, 
    pages =      {462--474},
    location =   {Kyoto, Japan}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2017-04-0512:37
Andrzej Murawski