The Parameterized Complexity of Reasoning Problems

View Statistics Email Alert RSS Feed

Primary Data

Project Acronym Projekt Kurzbezeichnung
Complex Reason
 
Project Title (de) Projekttitel (de)
The Parameterized Complexity of Reasoning Problems
 
Project Title (en) Projekttitel (en)
The Parameterized Complexity of Reasoning Problems
 
Consortium Coordinator Koordinator des Konsortiums
 
Principal Investigator Projektleiter_in
 

Grants

Funder/Funding Agency Fördergeber
Europäischer Forschungsrat (ERC)
Grant number Förderkennnummer
239962
 

Publications

Filter:
Subject:  Applied Mathematics

Results 1-8 of 8 (Search time: 0.003 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Ganian, Robert ; Hliněný, Petr ; Langer, Alexander ; Obdržálek, Jan ; Rossmanith, Peter ; Sikdar, Somnath Lower bounds on the complexity of MSO₁ model-checkingArtikel Article Feb-2014
2Ganian, Robert ; Hliněný, Petr ; Kneis, Joachim ; Langer, Alexander ; Obdržálek, Jan ; Rossmanith, Peter Digraph Width Measures in Parameterized AlgorithmicsArtikel Article2014
3Gaspers, Serge ; Kratsch, Dieter ; Liedloff, Mathieu On Independent Sets and Bicliques in GraphsArtikel Article2012
4Gutin, Gregory ; Kim, Eun Jung ; Soleimanfallah, Arezou ; Szeider, Stefan ; Yeo, Anders Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint ProgrammingArtikel Article2012
5van ’t Hof, Pim ; Kamiński, Marcin ; Paulusma, Daniël ; Szeider, Stefan ; Thilikos, Dimitrios M. On Graph Contractions and Induced MinorsArtikel Article2012
6Gaspers, Serge ; Sorkin, Gregory B. A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in betweenArtikel Article2012
7Alon, Noga ; Gutin, Gregory ; Kim, Eun Jung ; Szeider, Stefan ; Yeo, Anders Solving MAX-r-SAT Above a Tight Lower BoundArtikel Article2011
8Gutin, Gregory ; Kim, Eun Jung ; Szeider, Stefan ; Yeo, Anders A Probabilistic Approach to Problems Parameterized Above or Below Tight BoundsArtikel Article2011