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 437 (Search time: 0.005 seconds).

PreviewAuthor(s)TitleTypeIssue Date
101Jatschka, Thomas ; Rauscher, Matthias ; Kreutzer, Bernhard ; Rodemann, Tobias ; Raidl, Günther A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric ScootersInproceedings Konferenzbeitrag 2022
102Jatschka, Thomas ; Rauscher, Matthias ; Kreutzer, Bernhard ; Okamoto, Yusuke ; Kataoka, Hiroaki ; Rodemann, Tobias ; Raidl, Günther R. A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric ScootersInproceedings Konferenzbeitrag 2022
103Hainzl-2022-Finding a Battleship of Uncertain Shape-vor.pdf.jpgHainzl, Eva-Maria ; Löffler, Maarten ; Perz, Daniel ; Tkadlec, Josef ; Wallinger, Markus Finding a Battleship of Uncertain ShapeInproceedings Konferenzbeitrag 2022
104Peruvemba Ramaswamy-2022-Learning Fast-Inference Bayesian Networks-vor.pdf.jpgPeruvemba Ramaswamy, Vaidyanathan ; Szeider, Stefan Learning Fast-Inference Bayesian NetworksInproceedings Konferenzbeitrag 2022
105Ganian-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
106Mayerhofer-2022-A Beam Search fortheShortest Common Supersequence Problem ...-am.pdf.jpgMayerhofer, Jonas ; Kirchweger, Markus ; Huber, Marc ; Raidl, Günther A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length CalculationInproceedings Konferenzbeitrag 2022
107Deligkas-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
108Peruvemba Ramaswamy-2022-Learning Large Bayesian Networks with Expert Con...-vor.pdf.jpgPeruvemba Ramaswamy, Vaidyanathan ; Szeider, Stefan Learning Large Bayesian Networks with Expert ConstraintsInproceedings Konferenzbeitrag 2022
109Ganian, Robert ; Montecchiani, Fabrizio ; Nöllenburg, Martin ; Zehavi, Meirav Parameterized Complexity in Graph DrawingKonferenzbeitrag Inproceedings2021
110Bracher, Adrian ; Frohner, Nikolaus ; Raidl, Günther R. Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery ProblemsKonferenzbeitrag Inproceedings 2021
111Horn, Matthias ; Raidl, Günther R. A$$^*$$-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence ProblemKonferenzbeitrag Inproceedings 2021
112Dreier, Jan Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion ClassesKonferenzbeitrag Inproceedings 2021
113Hamm, Thekla ; Lackner, Martin ; Rapberger, Anna Computing Kemeny Rankings from d-Euclidean PreferencesKonferenzbeitrag Inproceedings 2021
114Bhore, Sujoy ; Löffler, Maarten ; Nickel, Soeren ; Nöllenburg, Martin Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged GraphsKonferenzbeitrag Inproceedings 2021
115Nöllenburg, Martin ; Villedieu, Anaïs ; Wulms, Jules Layered Area-Proportional Rectangle Contact RepresentationsKonferenzbeitrag Inproceedings 2021
116Batik, Tobias ; Terziadis, Soeren ; Nöllenburg, Martin ; Wang, Yu-Shen ; Wu, Hsiang-Yun Mixed Metro Maps with User-Specied MotifsKonferenzbeitrag Inproceedings 2021
117Chen, Jiehua ; Ganian, Robert ; Hamm, Thekla Stable Matchings with Diversity Constraints: Affirmative Action is beyond NPKonferenzbeitrag Inproceedings 2021
118Chen, Jiehua ; Chmurovic, Adrian ; Jogl, Fabian ; Sorge, Manuel On (Coalitional) Exchange-Stable MatchingKonferenzbeitrag Inproceedings 2021
119Geiger, J. ; Cornelsen, S. ; Haunert, J.‐H. ; Kindermann, P. ; Mchedlidze, T. ; Nöllenburg, M. ; Okamoto, Y. ; Wolff, A. ClusterSets: Optimizing Planar Clusters in Categorical Point DataKonferenzbeitrag Inproceedings 2021
120Schreiner, Wolfgang ; Reichl, Franz-Xaver First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT SolvingKonferenzbeitrag Inproceedings 2021