h1

h2

h3

h4

h5
h6
http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png

Canonizing Graphs of Bounded Tree Width in Logspace

;

In
33rd Symposium on Theoretical Aspects of Computer Science : STACS’16, February 17-20, 2016, Orléans, France / edited by Nicolas Ollinger, Heribert Vollmer, Seiten/Artikel-Nr: 32:1-32:14

Konferenz/Event:33. Symposium on Theoretical Aspects of Computer Science , Orléans , France , STACS 2016 , 2016-02-17 - 2016-02-20

ImpressumSaarbrücken/Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH,

Umfang32:1-32:14

ISBN978-3-95977-001-9

ReiheLeibniz international proceedings in informatics : LIPIcs ; 47

Online
DOI: 10.18154/RWTH-2016-06688
DOI: 10.4230/LIPIcs.STACS.2016.32

URL: http://publications.rwth-aachen.de/record/668296/files/668296.pdf
URL: http://publications.rwth-aachen.de/record/668296/files/668296.pdf?subformat=pdfa

Einrichtungen

  1. Lehrstuhl für Informatik 7 (Logik und Theorie diskreter Systeme) (122910)
  2. Fachgruppe Informatik (120000)
  3. Juniorprofessur für Komplexität diskreter Probleme (122930)


OpenAccess:
Download fulltext PDF Download fulltext PDF (PDFA)

Dokumenttyp
Contribution to a book/Contribution to a conference proceedings

Format
online

Sprache
English

Anmerkung
Peer reviewed article

Externe Identnummern
SCOPUS: SCOPUS:2-s2.0-84961675628
WOS Core Collection: WOS:000521589000032

Interne Identnummern
RWTH-2016-06688
Datensatz-ID: 668296

Beteiligte Länder
Germany

 GO


Creative Commons Attribution CC BY 3.0 ; OpenAccess

QR Code for this record

The record appears in these collections:
Document types > Events > Contributions to a conference proceedings
Document types > Books > Contributions to a book
Publication server / Open Access
Faculty of Computer Science (Fac.9)
122930_20140620
Public records
Publications database
120000
122910

 Record created 2016-09-07, last modified 2022-10-25


OpenAccess:
Download fulltext PDF Download fulltext PDF (PDFA)
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)