License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2017.82
URN: urn:nbn:de:0030-drops-81384
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/8138/
Go to the corresponding LIPIcs Volume Portal

Pilipczuk, Michal

On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk)

pdf-format:
LIPIcs-MFCS-2017-82.pdf (0.2 MB)

Abstract

This is an overview of the invited talk delivered at the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017).

BibTeX - Entry

@InProceedings{pilipczuk:LIPIcs:2017:8138,
  author =	{Michal Pilipczuk},
  title =	{{On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk)}},
  booktitle =	{42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
  pages =	{82:1--82:2},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-046-0},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{83},
  editor =	{Kim G. Larsen and Hans L. Bodlaender and Jean-Francois Raskin},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/8138},
  URN =		{urn:nbn:de:0030-drops-81384},
  doi =		{10.4230/LIPIcs.MFCS.2017.82},
  annote =	{Keywords: monadic second-order logic, treewidth, recognizability}
}

Keywords: monadic second-order logic, treewidth, recognizability
Collection: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
Issue Date: 2017
Date of publication: 01.12.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI