- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
WSI-Reports - Schriftenreihe des Wilhelm-Schickard-Instituts für Informatik ; 2001, 8
- Klassifikation
-
Informatik
- Schlagwort
-
Tübingen / Wilhelm-Schickard-Institut für Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Tübingen
- (wer)
-
Universitätsbibliothek Tübingen
- (wann)
-
2001
- Urheber
- URN
-
urn:nbn:de:bsz:21-opus-11962
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:24 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
- Alber, Jochen
- Fernau, Henning
- Niedermeier, Rolf
- Universitätsbibliothek Tübingen
Entstanden
- 2001
Ähnliche Objekte (12)
Parameterized Mixed Graph Coloring
Parameterized Complexity of Graph Burning
Efficient parameterized algorithms on structured graphs
Parameterized Algorithmics for Graph-Based Data Analysis
Vertex Deletion Problems : A Parameterized Point of View
A Parameterized Complexity View on Collapsing k-Cores
A Parameterized Complexity View on Collapsing k-Cores
Classes of graphs with strongly sublinear separators
Clique-Based Separators for Geometric Intersection Graphs
Deciding circular-arc graph isomorphism in parameterized logspace
Algorithm design techniques for parameterized graph modification problems
A Graph Multi-separator Problem for Image Segmentation
Parameterized Mixed Graph Coloring
Parameterized Complexity of Graph Burning
Efficient parameterized algorithms on structured graphs
Parameterized Algorithmics for Graph-Based Data Analysis
Vertex Deletion Problems : A Parameterized Point of View
A Parameterized Complexity View on Collapsing k-Cores
A Parameterized Complexity View on Collapsing k-Cores
Classes of graphs with strongly sublinear separators
Clique-Based Separators for Geometric Intersection Graphs
Deciding circular-arc graph isomorphism in parameterized logspace
Algorithm design techniques for parameterized graph modification problems
A Graph Multi-separator Problem for Image Segmentation
Parameterized Mixed Graph Coloring
Parameterized Complexity of Graph Burning
Efficient parameterized algorithms on structured graphs
Parameterized Algorithmics for Graph-Based Data Analysis
Vertex Deletion Problems : A Parameterized Point of View
A Parameterized Complexity View on Collapsing k-Cores
A Parameterized Complexity View on Collapsing k-Cores
Classes of graphs with strongly sublinear separators
Clique-Based Separators for Geometric Intersection Graphs
Deciding circular-arc graph isomorphism in parameterized logspace
Algorithm design techniques for parameterized graph modification problems