Klute, Fabian

Recent Publications

Minimum Link Fencing
Algorithms and Computation (ISAAC'22) (Bae, Sang Won and Park, Heejin), volume 248 of LIPIcs, pages 34:1-34:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Balanced Independent and Dominating Sets on Colored Interval Graphs
Theory and Practice of Computer Science (SOFSEM'21) (Bureš, Tomáš and Dondi, Riccardo and Gamper, Johann and Guerrini, Giovanna and Jurdziński, Tomasz and Pahl, Claus and Sikora, Florian and Wong, Prudence), volume 12607 of LNCS, pages 89-103, 2021, Springer.
Extending Nearly Complete 1-Planar Drawings in Polynomial Time
Mathematical Foundations of Computer Science (MFCS'20) (Esparza, Javier and Král’, Daniel), volume 170 of LIPIcs, pages 31:1-31:16, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Extending Partial 1-Planar Drawings
Automata, Languages, and Programming (ICALP'20) (Artur Czumaj and Anuj Dawar and Emanuela Merelli), volume 168 of LIPIcs, pages 43:1-43:19, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik.
Efficient Segment Folding is Hard
Canadian Conference on Computational Geometry (CCCG'19), pages 177-183, 2019.
Exploring Semi-Automatic Map Labeling
Advances in Geographic Information Systems (SIGSPATIAL'19), pages 13-22, 2019, ACM.
Maximizing Ink in Partial Edge Drawings of k-plane Graphs
Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 323-336, 2019, Springer.
Mixed Linear Layouts: Complexity, Heuristics, and Experiments
Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 460-467, 2019, Springer.
On Strict (Outer-)Confluent Graphs
Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 147-161, 2019, Springer.
Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts
Computational Geometry (SoCG'18) (Speckmann, Bettina and Tóth, Csaba D.), pages 53:1-53:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Towards Characterizing Strict Outerconfluent Graphs
Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 612-614, 2018, Springer.
Minimizing crossings in constrained two-sided circular graph layouts
European Workshop on Computational Geometry (EuroCG'17), pages 265-268, April 2017.
PIGRA -- A Tool for Pixelated Graph Representations
Graph Drawing (GD'14) (Duncan, Christian A. and Symvonis, Antonios), volume 8871 of LNCS, pages 513-514, 2014, Springer Berlin Heidelberg.
Note: Poster abstract