Monografie
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
- Sprache
-
Englisch
- Umfang
-
xii, 149 Seiten
- ISBN
-
978-3-7983-2818-1
- Identifier
-
110159828X
- Reihe
-
Foundations of computing; volume 5
Thema
Graphentheorie ; Parametrisierte Komplexität ; Prädikatenlogik ; Hochschulschrift
Beteiligte Personen und Organisationen
- Inhaltsverzeichnis
- Rechteinformation
-
Der Zugriff auf Teile des Objekts ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.04.2024, 08:43 MESZ
Objekttyp
- Monografie
Ähnliche Objekte (12)
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Exploiting structure in computationally hard voting problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Multivariate complexity analysis of team management problems
Multivariate complexity analysis of team management problems
Matching minors in bipartite graphs
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Aspects of preprocessing applied to combinatorial graph problems
Event structures with higher-order dynamics
Algorithmic aspects of resource allocation and multiwinner voting : theory and experiments
Parity games, separations, and the modal μ-calculus
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Exploiting structure in computationally hard voting problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Multivariate complexity analysis of team management problems
Multivariate complexity analysis of team management problems
Matching minors in bipartite graphs
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Aspects of preprocessing applied to combinatorial graph problems
Event structures with higher-order dynamics
Algorithmic aspects of resource allocation and multiwinner voting : theory and experiments
Parity games, separations, and the modal μ-calculus
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Exploiting structure in computationally hard voting problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Multivariate complexity analysis of team management problems
Multivariate complexity analysis of team management problems
Matching minors in bipartite graphs
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Aspects of preprocessing applied to combinatorial graph problems
Event structures with higher-order dynamics
Algorithmic aspects of resource allocation and multiwinner voting : theory and experiments