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 181-200 of 777 (Search time: 0.002 seconds).

PreviewAuthor(s)TitleTypeIssue Date
181Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Kwon, O-joung Measuring what matters: Ahybrid approach to dynamic programming with treewidthArtikel Article 2021
182Ganian, Robert ; Szeider, Stefan New width parameters for SAT and #SATArtikel Article 2021
183Gupta, Sushmita ; Roy, Sanjukta ; Saurabh, Saket ; Zehavi, Meirav Balanced stable marriage: How close is close enough?Artikel Article 2021
184Bulteau, Laurent ; Grüttemeier, Niels ; Komusiewicz, Christian ; Sorge, Manuel Your rugby mates don't need to know your colleagues: Triadic closure with edgecolorsArtikel Article 2021
185Bracher, Adrian ; Frohner, Nikolaus ; Raidl, Günther R. Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery ProblemsKonferenzbeitrag Inproceedings 2021
186Horn, Matthias ; Raidl, Günther R. A$$^*$$-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence ProblemKonferenzbeitrag Inproceedings 2021
187Bekos, Michael A. ; Niedermann, Benjamin ; Nöllenburg, Martin External Labeling: Fundamental Concepts and Algorithmic TechniquesBuch Book 2021
188Jatschka, Thomas ; Raidl, Günther R. ; Rodemann, Tobias A General Cooperative Optimization Approach for Distributing Service Points in Mobility ApplicationsArtikel Article 2021
189Wallinger, Markus ; Jacobsen, Ben ; Kobourov, Stephen G. ; Nöllenburg, Martin On the Readability of Abstract Set VisualizationsArtikel Article 2021
190Jacobsen, Ben ; Wallinger, Markus ; Kobourov, Stephen G. ; Nöllenburg, Martin MetroSets: Visualizing Sets as Metro MapsArtikel Article 2021
191Chen, Jiehua ; Grottke, Sven Small one‑dimensional Euclidean preference profilesArtikel Article 2021
192Chen, Jiehua ; Hermelin, Danny ; Sorge, Manuel Computational aspects of multiwinner approval voting via p-norm Hamming distance vectorsPräsentation Presentation2021
193Dreier, Jan Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion ClassesKonferenzbeitrag Inproceedings 2021
194Hamm, Thekla ; Lackner, Martin ; Rapberger, Anna Computing Kemeny Rankings from d-Euclidean PreferencesKonferenzbeitrag Inproceedings 2021
195Dvořák, Pavel ; Eiben, Eduard ; Ganian, Robert ; Knop, Dušan ; Ordyniak, Sebastian The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraintsArtikel Article 2021
196Ganian, Robert ; Ordyniak, Sebastian ; Ramanujan, M. S. On Structural Parameterizations of the Edge Disjoint Paths ProblemArtikel Article 2021
197Förster, Henry ; Ganian, Robert ; Klute, Fabian ; Nöllenburg, Martin On Strict (Outer-)Confluent GraphsArtikel Article 2021
198Klute, Fabian ; Löffler, Maarten ; Nöllenburg, Martin Labeling nonograms: Boundary labeling for curve arrangementsArtikel Article 2021
199Bandyapadhyay, Sayan ; Banik, Aritra ; Bhore, Sujoy ; Nöllenburg, Martin Geometric planar networks on bichromatic collinear pointsArtikel Article 2021
200Bhore, Sujoy ; Löffler, Maarten ; Nickel, Soeren ; Nöllenburg, Martin Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged GraphsKonferenzbeitrag Inproceedings 2021