Parameterisierte Analyse in der Künstlichen Intelligenz

View Statistics Email Alert RSS Feed

Primary Data

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
 

Grants

Funder/Funding Agency Fördergeber
FWF - Österr. Wissenschaftsfonds
Grant number Förderkennnummer
Y1329-N
 

Publications

Filter:
Author:  Ganian, Robert

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

PreviewAuthor(s)TitleTypeIssue Date
1Eiben-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
2Balko-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
3Ganian-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
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 Parameterized Algorithms for Upward PlanarityInproceedings Konferenzbeitrag 1-Jun-2022
7Eiben-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
8Ganian-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
9Deligkas-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
10Ganian-2022-The Complexity of Bayesian Network Learning Revisiting the Su...-vor.pdf.jpgGanian, Robert ; Korchemna, Viktoria The Complexity of Bayesian Network Learning: Revisiting the SuperstructureInproceedings Konferenzbeitrag 2021
11Dallard Clement - 2021 - Graphs with Two Moplexes.pdf.jpgDallard, Clément ; Ganian, Robert ; Hatzel, Meike ; Krnc, Matjaž ; Milanič, Martin Graphs with Two MoplexesInproceedings Konferenzbeitrag 2021