Hochschulschrift
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
- Alternative title
-
Festparameter-Linearzeitalgorithmen für NP-schwere Graphen- und Hypergraphenprobleme aus industriellen Anwendungen
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Foundations of Computing ; 01
- Keyword
-
NP-hartes Problem
Graph
Hypergraph
Berechnungskomplexität
Effizienter Algorithmus
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Universitätsverlag der TU Berlin
- (when)
-
2014
- Creator
- Contributor
-
Niedermeier, Rolf
Fomin, Fedor V.
Möhring, Rolf
- URN
-
urn:nbn:de:kobv:83-opus4-55292
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
20.08.2025, 3:18 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Van Bevern, René
- Niedermeier, Rolf
- Fomin, Fedor V.
- Möhring, Rolf
- Universitätsverlag der TU Berlin
Time of origin
- 2014
Other Objects (12)
Preprocessing to Deal with Hard Problems
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Exploiting structure in computationally hard voting problems
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
The Power of Linear-Time Data Reduction for Maximum Matching
Majority Relations and Tournament Solutions : A Computational Study
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
A refined complexity analysis of fair districting over graphs
Modification-fair cluster editing
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
The power of linear-time data reduction for maximum matching
On coalitional manipulation for multiwinner elections: shortlisting
Preprocessing to Deal with Hard Problems
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Exploiting structure in computationally hard voting problems
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
The Power of Linear-Time Data Reduction for Maximum Matching
Majority Relations and Tournament Solutions : A Computational Study
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
A refined complexity analysis of fair districting over graphs
Modification-fair cluster editing
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
The power of linear-time data reduction for maximum matching
On coalitional manipulation for multiwinner elections: shortlisting
Preprocessing to Deal with Hard Problems
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Exploiting structure in computationally hard voting problems
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
The Power of Linear-Time Data Reduction for Maximum Matching
Majority Relations and Tournament Solutions : A Computational Study
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
A refined complexity analysis of fair districting over graphs
Modification-fair cluster editing
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
The power of linear-time data reduction for maximum matching