- Sprache
-
Englisch
- Anmerkungen
-
Berlin, Technische Universität Berlin, Diss., 2012
- Identifier
-
106654638X
Thema
Kombinatorische Graphentheorie ; NP-hartes Problem ; Polynomialzeitalgorithmus ; Parametrisierte Komplexität ; Vorverarbeitung ; Hochschulschrift
Beteiligte Personen und Organisationen
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:58 MEZ
Objekttyp
- Monografie
Ähnliche Objekte (12)
Aspects of preprocessing applied to combinatorial graph problems
On combinatorial search problems which involve graphs
A combinatorial approach to orthogonal placement problems
Parameterized Algorithmics for Network Analysis: Clustering & Querying
Parameterized algorithmics for time-evolving structures: temporalizing and multistaging
Exploiting structure in computationally hard voting problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
The maximum feasible subsystem problem and vertex facet incidences of polyhedra
Multivariate complexity analysis of team management problems
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Solving large scale crew pairing problems
Fine-grained complexity analysis of some combinatorial data science problems
Aspects of preprocessing applied to combinatorial graph problems
On combinatorial search problems which involve graphs
A combinatorial approach to orthogonal placement problems
Parameterized Algorithmics for Network Analysis: Clustering & Querying
Parameterized algorithmics for time-evolving structures: temporalizing and multistaging
Exploiting structure in computationally hard voting problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
The maximum feasible subsystem problem and vertex facet incidences of polyhedra
Multivariate complexity analysis of team management problems
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Solving large scale crew pairing problems
Fine-grained complexity analysis of some combinatorial data science problems
Aspects of preprocessing applied to combinatorial graph problems
On combinatorial search problems which involve graphs
A combinatorial approach to orthogonal placement problems
Parameterized Algorithmics for Network Analysis: Clustering & Querying
Parameterized algorithmics for time-evolving structures: temporalizing and multistaging
Exploiting structure in computationally hard voting problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
The maximum feasible subsystem problem and vertex facet incidences of polyhedra
Multivariate complexity analysis of team management problems
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Solving large scale crew pairing problems