Lics

IEEE Symposium on Logic in Computer Science

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

Thirty first Annual IEEE Symposium on

Logic in Computer Science (LICS 2016)

Paper: Definability equals recognizability for graphs of bounded treewidth (at LICS 2016)

Authors: Mikolaj Bojanczyk Michal Pilipczuk

Abstract

No Abstract Available

BibTeX

  @InProceedings{BojanczykPilipczuk-Definabilityequalsr,
    author = 	 {Mikolaj Bojanczyk and Michal Pilipczuk},
    title = 	 {Definability equals recognizability for graphs of bounded treewidth},
    booktitle =  {Proceedings of the Thirty first Annual IEEE Symposium on Logic in Computer Science (LICS 2016)},
    year =	 {2016},
    month =	 {July}, 
    pages =      {407--416},
    location =   {New York City}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2018-06-2121:59
Andrzej Murawski