Forschungsbereich Algorithms and Complexity

View Statistics Email Alert RSS Feed

Details

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
 

OrgUnit's Publications


Results 241-260 of 779 (Search time: 0.002 seconds).

PreviewAuthor(s)TitleTypeIssue Date
241Ganian-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
242Dallard Clement - 2021 - Graphs with Two Moplexes.pdf.jpgDallard, Clément ; Ganian, Robert ; Hatzel, Meike ; Krnc, Matjaž ; Milanič, Martin Graphs with Two MoplexesInproceedings Konferenzbeitrag 2021
243Djukanovic, Marko ; Raidl, Günther R. ; Blum, Christian Finding Longest Common Subsequences: New anytime A* search resultsArtikel Article Oct-2020
244Balko, Martin ; Bhore, Sujoy Kumar ; Martínez-Sandoval, Leonardo ; Valtr, Pavel On Erdős-Szekeres-type problems for 𝑘-convex point setsArtikel Article Oct-2020
245Slivovsky, Friedrich ; Szeider, Stefan A Faster Algorithm for Propositional Model Counting Parameterized by Incidence TreewidthKonferenzbeitrag Inproceedings 2020
246Kovács, Laura ; Lachnitt, Hanna ; Szeider, Stefan Formalizing Graph Trail Properties in Isabelle/HOLKonferenzbeitrag Inproceedings 2020
247Peitl, Tomáš ; Szeider, Stefan Finding the Hardest Formulas for ResolutionKonferenzbeitrag Inproceedings 2020
248Schlaipfer, Matthias ; Slivovsky, Friedrich ; Weissenbacher, Georg ; Zuleger, Florian Multi-linear Strategy Extraction for QBF Expansion Proofs via Local SoundnessKonferenzbeitrag Inproceedings 2020
249Slivovsky, Friedrich Interpolation-Based Semantic Gate Extraction and Its Applications to QBF PreprocessingKonferenzbeitrag Inproceedings 2020
250Schidler, André ; Szeider, Stefan Computing Optimal Hypertree DecompositionsKonferenzbeitrag Inproceedings 2020
251Peruvemba Ramaswamy, Vaidyanathan ; Szeider, Stefan MaxSAT-Based Postprocessing for TreedepthKonferenzbeitrag Inproceedings 2020
252Frohner, Nikolaus ; Horn, Matthias ; Raidl, Günther R. Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery DeadlinesKonferenzbeitrag Inproceedings 2020
253Gemsa, Andreas ; Niedermann, Benjamin ; Nöllenburg, Martin Placing Labels in Road Maps: Algorithms and ComplexityArtikel Article 2020
254Djukanovic, Marko ; Raidl, Günther R. ; Blum, Christian A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length CalculationKonferenzbeitrag Inproceedings 2020
255Shukla, Ankit ; Slivovsky, Friedrich ; Szeider, Stefan Short Q-Resolution Proofs with HomomorphismsKonferenzbeitrag Inproceedings 2020
256Cmolik, Ladislav ; Pavlovec, Vaclav ; Wu, Hsiang-Yun ; Nöllenburg, Martin Mixed Labeling: Integrating Internal and External LabelsKonferenzbeitrag Inproceedings 2020
257Corneil, Derek G. ; Ganian, Robert ; Proskurowski, Andrzej Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, CanadaKonferenzbeitrag Inproceedings2020
258Bergren, Dan ; Eiben, Eduard ; Ganian, Robert ; Kanj, Iyad On Covering Segments with Unit IntervalsKonferenzbeitrag Inproceedings 2020
259Jatschka, Thomas ; Rodemann, Tobias ; Raidl, Günther R. VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service PointsKonferenzbeitrag Inproceedings 2020
260Ganian, Robert ; Peitl, Tomáš ; Slivovsky, Friedrich ; Szeider, Stefan Fixed-Parameter Tractability of Dependency QBF with Structural ParametersKonferenzbeitrag Inproceedings 2020