Parameterisierte Analyse in der Künstlichen Intelligenz


Project Acronym Projekt Kurzbezeichnung
Parameterisierte Analyse in der Künstlichen Intelligenz
 
Project Title (de) Projekttitel (de)
Parameterisierte Analyse in der Künstlichen Intelligenz
 
Project Title (en) Projekttitel (en)
Parameterized Analysis in Artificial Intelligence
 
Consortium Coordinator Koordinator des Konsortiums
 
Principal Investigator Projektleiter_in
 
Funder/Funding Agency Fördergeber
FWF - Österr. Wissenschaftsfonds
Grant number Förderkennnummer
Y1329-N
 

Publications

Filter:
Date Issued:  2022

Results 1-14 of 14 (Search time: 0.009 seconds).

PreviewAuthor(s)TitleTypeIssue 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
2Eiben-2022-Finding a Cluster in Incomplete Data-vor.pdf.jpgEiben, Eduard ; Ganian, Robert ; Kanj, Iyad ; Ordyniak, Sebastian ; Szeider, Stefan Finding a Cluster in Incomplete DataInproceedings Konferenzbeitrag 1-Sep-2022
3Balko-2022-Bounding and Computing Obstacle Numbers of Graphs-vor.pdf.jpgBalko, Martin ; Chaplick, Steven ; Ganian, Robert ; Gupta, Siddharth ; Hoffmann, Michael ; Valtr, Pavel ; Wolff, Alexander Bounding and Computing Obstacle Numbers of GraphsInproceedings Konferenzbeitrag 1-Sep-2022
4Ganian-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
5Ganian-2022-Weighted Model Counting with Twin-Width-vor.pdf.jpgGanian, Robert ; Pokrývka, Filip ; Schidler, André ; Simonov, Kirill ; Szeider, Stefan Weighted Model Counting with Twin-WidthInproceedings Konferenzbeitrag 28-Jul-2022
6Ganian-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
7Ganian-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
8Hamm-2022-Parameterised Partially-Predrawn Crossing Number-vor.pdf.jpgHamm, Thekla ; Hliněný, Petr Parameterised Partially-Predrawn Crossing NumberInproceedings Konferenzbeitrag 1-Jun-2022
9Chaplick-2022-Parameterized Algorithms for Upward Planarity-vor.pdf.jpgChaplick, Steven ; Di Giacomo, Emilio ; Frati, Fabrizio ; Ganian, Robert ; Raftopoulou, Chrysanthi ; Simonov, Kirill Parameterized Algorithms for Upward PlanarityInproceedings Konferenzbeitrag 1-Jun-2022
10Bhore-2022-Journal of Graph Algorithms and Applications-vor.pdf.jpgBhore, Sujoy ; Ganian, Robert ; Montecchiani, Fabrizio ; Nöllenburg, Martin Parameterized Algorithms for Queue LayoutsArticle Artikel Jun-2022
11Bergren-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
12Eiben-2022-A Unifying Framework for Characterizing and Computing Width Me...-vor.pdf.jpgEiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Jaffke, Lars ; Kwon, O-Joung A Unifying Framework for Characterizing and Computing Width MeasuresInproceedings Konferenzbeitrag Jan-2022
13Ganian-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
14Deligkas-2022-The Complexity of Envy-Free Graph Cutting-vor.pdf.jpgDeligkas, Argyrios ; Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Ordyniak, Sebastian The Complexity of Envy-Free Graph CuttingInproceedings Konferenzbeitrag 2022