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 321-340 of 779 (Search time: 0.003 seconds).

PreviewAuthor(s)TitleTypeIssue Date
321Lodha, Neha ; Ordyniak, Sebastian ; Szeider, Stefan A SAT Approach to BranchwidthArtikel Article 2019
322Horn, Matthias ; Raidl, Günther ; Blum, Christian Job sequencing with one common and multiple secondary resources: An A∗/Beam Search based anytime algorithmArtikel Article 2019
323Barth, Lukas ; Gemsa, Andreas ; Niedermann, Benjamin ; Nöllenburg, Martin On the readability of leaders in boundary labelingArtikel Article 2019
324Wu, Hsiang-Yun ; Nöllenburg, Martin ; Sousa, Filipa L. ; Viola, Ivan Metabopolis: scalable network layout for biological pathway diagrams in urban map styleArtikel Article 2019
325Nesic, Aleksandar ; Blaicher, Matthias ; Hoose, Tobias ; Hofmann, Andreas ; Lauermann, Matthias ; Kutuvantavida, Yasar ; Nöllenburg, Martin ; Randel, Sebastian ; Freude, Wolfgang ; Koos, Christian Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpassesArtikel Article 2019
6Leitner, Markus ; Ljubić, Ivana ; Riedler, Martin ; Ruthmair, Mario Exact Approaches for Network Design Problems with RelaysArtikel Article 2019
7Angriman, Eugenio ; Grinten, Alexander van der ; Looz, Moritz von ; Meyerhenke, Henning ; Nöllenburg, Martin ; Predari, Maria ; Tzovas, Charilaos Guidelines for Experimental Algorithmics: A Case Study in Network AnalysisArtikel Article 2019
8Haan, Ronald de ; Szeider, Stefan A Compendium of Parameterized Problems at Higher Levels of the Polynomial HierarchyArtikel Article 2019
9Li, Guangping ; Nickel, Soeren ; Nöllenburg, Martin ; Viola, Ivan ; Wu, Hsiang-Yun World map of recipesPräsentation Presentation2019
10Hamm, Thekla Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear TimeKonferenzbeitrag Inproceedings 2019
11Prandtstetter, Matthias ; Biesinger, Benjamin ; Hu, Bin ; Nolz, Pamela ; Reinthaler, Martin ; Zajicek, Jürgen ; Angelini, Alessandra ; Hauger, Georg On the Potentials and Dilemmas of Cooperative/White-Label Deliveries based on Selected Austrian Demonstration CasesKonferenzbeitrag Inproceedings2019
12Klute, Fabian ; Nöllenburg, Martin Minimizing Crossings In Constrained Two-Sided Circular Graph LayoutsArtikel Article 2019
13Ganian, Robert ; Lodha, Neha ; Ordyniak, Sebastian ; Szeider, Stefan SAT-Encodings for Treecut Width and TreedepthKonferenzbeitrag Inproceedings 2019
14Szeider, Stefan ; Ganian, Robert ; Kanj, Iyad ; Ordyniak, Sebastian Parameterized Complexity Results for the Completion and Clustering of Incomplete DataPräsentation Presentation2019
15Castermans, Thom ; van Garderen, Mereke ; Meulemans, Wouter ; Nöllenburg, Martin ; Yuan, Xiaoru Short Plane Supports for Spatial HypergraphsArtikel Article 2019
16Hummel, Matthias ; Klute, Fabian ; Nickel, Soeren ; Nöllenburg, Martin Maximizing Ink in Partial Edge Drawings of k-plane GraphsKonferenzbeitrag Inproceedings 2019
17de Col, Philipp ; Klute, Fabian ; Nöllenburg, Martin Mixed Linear Layouts: Complexity, Heuristics, and ExperimentsKonferenzbeitrag Inproceedings 2019
18Förster, Henry ; Ganian, Robert ; Klute, Fabian ; Nöllenburg, Martin On Strict (Outer-)Confluent GraphsKonferenzbeitrag Inproceedings 2019
19Bhore, Sujoy ; Ganian, Robert ; Montecchiani, Fabrizio ; Nöllenburg, Martin Parameterized Algorithms for Book Embedding ProblemsKonferenzbeitrag Inproceedings 2019
20Biesinger, Benjamin ; Hu, Bin ; Raidl, Günther R. A Memetic Algorithm for Competitive Facility Location ProblemsBuchbeitrag Book Contribution 2019