Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  • Kristoffer Arnsfelt Hansen
  • Balagopal Komarath, Department of Computer Science and Engineering, IIT Madras, Chennai, India
  • Jayalal Sarma M. N., Department of Computer Science and Engineering, IIT Madras, Chennai, India
  • Navid Talebanfard, Denmark
  • Sven Skyum
Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2014 : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II
EditorsErzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik
Number of pages12
PublisherSpringer VS
Publication year2014
Pages336-347
ISBN (print)978-3-662-44464-1
ISBN (Electronic)978-3-662-44465-8
DOIs
Publication statusPublished - 2014
EventInternational Symposium on Mathematical Foundations of Computer Science - Budapest, Hungary
Duration: 25 Aug 201429 Aug 2014

Conference

ConferenceInternational Symposium on Mathematical Foundations of Computer Science
LandHungary
ByBudapest
Periode25/08/201429/08/2014
SeriesLecture Notes in Computer Science
Volume8635
ISSN0302-9743

Bibliographical note

WACT 2014

See relations at Aarhus University Citationformats

ID: 83239313