Lics

ACM/IEEE Symposium on Logic in Computer Science

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

Thirty third Annual IEEE Symposium on

Logic in Computer Science (LICS 2018)

Paper: Definable decompositions for graphs of bounded linear cliquewidth (at LICS 2018)

Authors: Mikolaj Bojanczyk Martin Grohe Michal Pilipczuk

Abstract

No Abstract Available

BibTeX

  @InProceedings{BojanczykGrohePilip-Definabledecomposit,
    author = 	 {Mikolaj Bojanczyk and Martin Grohe and Michal Pilipczuk},
    title = 	 {Definable decompositions for graphs of bounded linear cliquewidth},
    booktitle =  {Proceedings of the Thirty third Annual IEEE Symposium on Logic in Computer Science (LICS 2018)},
    year =	 {2018},
    month =	 {July}, 
    pages =      {135--144},
    location =   {Oxford}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2021-11-1017:16
Sam Staton