- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), March 10-12, 2011, Dortmund, Germany, S. 531-542
- Erschienen in
-
Leibniz International Proceedings in Informatics (LIPIcs) ; 9
- Ereignis
-
Veröffentlichung
- (wo)
-
Augsburg
- (wer)
-
Universität Augsburg
- (wann)
-
2011
- Ereignis
-
Veröffentlichung
- (wo)
-
Dagstuhl
- (wer)
-
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- (wann)
-
2011
- Urheber
- Beteiligte Personen und Organisationen
-
Schwentick, Thomas
Dürr, Christoph
- DOI
-
10.4230/LIPIcs.STACS.2011.531
- URN
-
urn:nbn:de:bvb:384-opus4-1152467
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 15.08.2025, 07:20 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Antoniadis, Antonios
- Hueffner, Falk
- Lenzner, Pascal
- Moldenhauer, Carsten
- Souza, Alexander
- Schwentick, Thomas
- Dürr, Christoph
- Universität Augsburg
- Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Entstanden
- 2011
Ähnliche Objekte (12)
The Interval Constrained 3-Coloring Problem
Approximation the Interval Constrained Coloring Problem
Approximation algorithms for the interval constrained coloring problem
Algorithms for interval coloring, geometric packing and memory optimization
Interval Decomposition Lattices are Balanced
Foundations of Coloring Algebra with Consequences for Feature-Oriented Programming
High-performance and balanced parallel graph coloring on multicore platforms
Balanced teaching
Foundations of coloring algebra with consequences for feature-oriented programming
From Sequential Algebra to Kleene Algebra: Interval Modalities and Duration Calculus
Balanced generalized weighing matrices and their applications
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring
The Interval Constrained 3-Coloring Problem
Approximation the Interval Constrained Coloring Problem
Approximation algorithms for the interval constrained coloring problem
Algorithms for interval coloring, geometric packing and memory optimization
Interval Decomposition Lattices are Balanced
Foundations of Coloring Algebra with Consequences for Feature-Oriented Programming
High-performance and balanced parallel graph coloring on multicore platforms
Balanced teaching
Foundations of coloring algebra with consequences for feature-oriented programming
From Sequential Algebra to Kleene Algebra: Interval Modalities and Duration Calculus
Balanced generalized weighing matrices and their applications
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring
The Interval Constrained 3-Coloring Problem
Approximation the Interval Constrained Coloring Problem
Approximation algorithms for the interval constrained coloring problem
Algorithms for interval coloring, geometric packing and memory optimization
Interval Decomposition Lattices are Balanced
Foundations of Coloring Algebra with Consequences for Feature-Oriented Programming
High-performance and balanced parallel graph coloring on multicore platforms
Balanced teaching
Foundations of coloring algebra with consequences for feature-oriented programming
From Sequential Algebra to Kleene Algebra: Interval Modalities and Duration Calculus
Balanced generalized weighing matrices and their applications