Forschungsbereich Algorithms and Complexity

Organization Name (de) Name der Organisation (de)
E192-01 - Forschungsbereich Algorithms and Complexity
 
Code Kennzahl
E192-01
 
Type of Organization Organisationstyp
Research Division
Parent OrgUnit Übergeordnete Organisation
 
Active Aktiv
 


Results 101-120 of 777 (Search time: 0.006 seconds).

PreviewAuthors / EditorsTitleTypeIssue Date
101Dobler-2022-Turbocharging Heuristics for Weak Coloring Numbers-vor.pdf.jpgDobler, Alexander ; Sorge, Manuel ; Villedieu, Anaïs Turbocharging Heuristics for Weak Coloring NumbersInproceedings Konferenzbeitrag 1-Sep-2022
102Dreier-2022-SAT Backdoors Depth Beats Size-vor.pdf.jpgDreier, Jan ; Ordyniak, Sebastian ; Szeider, Stefan SAT Backdoors: Depth Beats SizeInproceedings Konferenzbeitrag 1-Sep-2022
103Balko-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
104Chaplick, Steven ; Di Giacomo, Emilio ; Frati, Fabrizio ; Ganian, Robert ; Raftopoulou, Chrysanthi ; Simonov, Kirill Testing Upward Planarity of Partial 2-TreesInproceedings Konferenzbeitrag Sep-2022
105Szeider, Stefan ; Ganian, Robert ; Silva, Alexandra 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)Proceedings Konferenzband22-Aug-2022
106Ganian-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
107Bonnet, Édouard ; Dreier, Jan ; Gajarský, Jakub ; Kreutzer, Stephan ; Mählmann, Nikolas ; Simon, Pierre ; Toruńczyk, Szymon Model Checking on Interpretations of Classes of Bounded Local CliquewidthInproceedings Konferenzbeitrag 4-Aug-2022
108Dreier, Jan ; Gajarský, Jakub ; Kiefer, Sandra ; Pilipczuk, Michał ; Toruńczyk, Szymon Treelike Decompositions for Transductions of Sparse GraphsInproceedings Konferenzbeitrag 4-Aug-2022
109Ganian-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
110Kirchweger-2022-A SAT Attack on Rotas Basis Conjecture-vor.pdf.jpgKirchweger, Markus ; Scheucher, Manfred ; Szeider, Stefan A SAT Attack on Rota’s Basis ConjectureInproceedings Konferenzbeitrag 28-Jul-2022
111Slivovsky-2022-Quantified CDCL with Universal Resolution-vor.pdf.jpgSlivovsky, Friedrich Quantified CDCL with Universal ResolutionInproceedings Konferenzbeitrag 28-Jul-2022
112Reichl-2022-Pedant A Certifying DQBF Solver-vor.pdf.jpgReichl, Franz Xaver ; Slivovsky, Friedrich Pedant: A Certifying DQBF SolverInproceedings Konferenzbeitrag 28-Jul-2022
113Dreier-2022-CSP Beyond Tractable Constraint Languages-vor.pdf.jpgDreier, Jan ; Ordyniak, Sebastian ; Szeider, Stefan CSP Beyond Tractable Constraint LanguagesInproceedings Konferenzbeitrag 23-Jul-2022
114Raidl, Günther Learning for Guiding MetaheuristicsPresentation Vortrag19-Jul-2022
115Frohner, Nikolaus ; Gmys, Jan ; MELAB, NOUREDINE ; Raidl, Günther ; Talbi, El-ghazali Parallel Beam Search for Combinatorial Optimization (Extended Abstract)Inproceedings Konferenzbeitrag 18-Jul-2022
116Ganian-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
117Ganian-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
118Hamm-2022-The Complexity of Temporal Vertex Cover in Small-Degree Graphs-vor.pdf.jpgHamm, Thekla ; Klobas, Nina ; Mertzios, George ; Spirakis, Paul G. The Complexity of Temporal Vertex Cover in Small-Degree GraphsInproceedings Konferenzbeitrag 28-Jun-2022
119Dvorak-2022-Tractable Abstract Argumentation via Backdoor-Treewidth-vor.pdf.jpgDvořák, Wolfgang ; Hecher, Markus ; König, Matthias ; Schidler, Andre ; Szeider, Stefan ; Woltran, Stefan Tractable Abstract Argumentation via Backdoor-TreewidthInproceedings Konferenzbeitrag 28-Jun-2022
120Angelini-2022-Recognizing Map Graphs of Bounded Treewidth-vor.pdf.jpgAngelini, Patrizio ; Bekos, Michael A. ; Da Lozzo, Giordano ; Gronemann, Martin ; Montecchiani, Fabrizio ; Tappini, Alessandra Recognizing Map Graphs of Bounded TreewidthInproceedings Konferenzbeitrag 22-Jun-2022