New Frontiers for Parameterized Complexity

View Statistics Email Alert RSS Feed

Primary Data

Project Acronym Projekt Kurzbezeichnung
NFPC
 
Project Title (de) Projekttitel (de)
New Frontiers for Parameterized Complexity
 
Project Title (en) Projekttitel (en)
New Frontiers for Parameterized Complexity
 
Consortium Coordinator Koordinator des Konsortiums
 
Principal Investigator Projektleiter_in
 

Grants

Funder/Funding Agency Fördergeber
FWF Fonds zur Förderung der wissenschaftlichen Forschung (FWF)
Grant number Förderkennnummer
P31336-N35
 

Publications

Results 1-12 of 12 (Search time: 0.005 seconds).

PreviewAuthors / EditorsTitleTypeIssue Date
1Ganian-2022-SIAM Journal on Discrete Mathematics-vor.pdf.jpgGanian, Robert ; Kim, Eun Jung ; Szeider, Stefan Algorithmic applications of tree-cut widthArticle Artikel Dec-2022
2Ganian-2022-Journal of Artificial Intelligence Research-vor.pdf.jpgGanian, Robert ; Schidler, André ; Sorge, Manuel ; Szeider, Stefan Threshold Treewidth and Hypertree WidthArticle Artikel 10-Aug-2022
3Ganian-2022-Weighted Model Counting with Twin-Width-vor.pdf.jpgGanian, Robert ; Pokrývka, Filip ; Schidler, André ; Simonov, Kirill ; Szeider, Stefan ; Meel, Kuldeep S. ; Strichman, Ofer Weighted Model Counting with Twin-WidthInproceedings Konferenzbeitrag 28-Jul-2022
4Ganian-2022-The Fine-Grained Complexity of Graph Homomorphism Parameteriz...-vor.pdf.jpgGanian, Robert ; Hamm, Thekla ; Korchemna, Viktoriia ; Okrasa, Karolina ; Simonov, Kirill The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-WidthInproceedings Konferenzbeitrag 1-Jul-2022
5Ganian-2022-Hedonic Diversity Games A Complexity Picture with More than T...-vor.pdf.jpgGanian, Robert ; Hamm, Thekla ; Knop, Dušan ; Schierreich, Šimon ; Suchý, Ondřej Hedonic Diversity Games: A Complexity Picture with More than Two ColorsInproceedings Konferenzbeitrag 30-Jun-2022
6Chaplick-2022-Parameterized Algorithms for Upward Planarity-vor.pdf.jpgChaplick, Steven ; Di Giacomo, Emilio ; Frati, Fabrizio ; Ganian, Robert ; Raftopoulou, Chrysanthi ; Simonov, Kirill ; Goaoc, Xavier ; Kerber, Michael Parameterized Algorithms for Upward PlanarityInproceedings Konferenzbeitrag 1-Jun-2022
7Hamm-2022-Parameterised Partially-Predrawn Crossing Number-vor.pdf.jpgHamm, Thekla ; Hliněný, Petr ; Goaoc, Xavier ; Kerber, Michael Parameterised Partially-Predrawn Crossing NumberInproceedings Konferenzbeitrag 1-Jun-2022
8Ganian-2022-Journal of Artificial Intelligence Research-vor.pdf.jpgGanian, Robert ; Kim, Eun Jung ; Slivovsky, Friedrich ; Szeider, Stefan Sum-of-Products with Default Values: Algorithms and Complexity ResultsArticle Artikel 10-Feb-2022
9Bergren-2022-SIAM Journal on Discrete Mathematics-vor.pdf.jpgBergren, Dan ; Eiben, Eduard ; Ganian, Robert ; Kanj, Iyad On Covering Segments with Unit IntervalsArticle Artikel 1-Jan-2022
10Deligkas-2022-The Complexity of Envy-Free Graph Cutting-vor.pdf.jpgDeligkas, Argyrios ; Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Ordyniak, Sebastian ; De Raedt, Luc The Complexity of Envy-Free Graph CuttingInproceedings Konferenzbeitrag 2022
11Ganian-2022-The Complexity of k-Means Clustering when Little is Known-vor.pdf.jpgGanian, Robert ; Hamm, Thekla ; Korchemna, Viktoriia ; Okrasa, Karolina ; Simonov, Kirill The Complexity of k-Means Clustering when Little is KnownInproceedings Konferenzbeitrag 2022
12Ganian-2022-The Complexity of Bayesian Network Learning Revisiting the Su...-vor.pdf.jpgGanian, Robert ; Korchemna, Viktoria ; Ranzato, M. ; Beygelzimer, A. ; Dauphin, Y. ; Liang, P.S. ; Wortman Vaughan, J. The Complexity of Bayesian Network Learning: Revisiting the SuperstructureInproceedings Konferenzbeitrag 2021