Segui
Fabian Klute
Titolo
Citata da
Citata da
Anno
On structural parameterizations of the bounded-degree vertex deletion problem
R Ganian, F Klute, S Ordyniak
Algorithmica 83, 297-336, 2021
532021
Four pages are indeed necessary for planar graphs
MA Bekos, M Kaufmann, F Klute, S Pupyrev, C Raftopoulou, T Ueckerdt
arXiv preprint arXiv:2004.07630, 2020
422020
Extending partial 1-planar drawings
E Eiben, R Ganian, T Hamm, F Klute, M Nöllenburg
arXiv preprint arXiv:2004.12222, 2020
172020
Exploring semi-automatic map labeling
F Klute, G Li, R Löffler, M Nöllenburg, M Schmidt
Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances …, 2019
142019
Mixed linear layouts: Complexity, heuristics, and experiments
P de Col, F Klute, M Nöllenburg
International Symposium on Graph Drawing and Network Visualization, 460-467, 2019
132019
Inserting one edge into a simple drawing is hard
A Arroyo, F Klute, I Parada, B Vogtenhuber, R Seidel, T Wiedera
Discrete & Computational Geometry 69 (3), 745-770, 2023
112023
Minimizing crossings in constrained two-sided circular graph layouts
F Klute, M Nöllenburg
arXiv preprint arXiv:1803.05705, 2018
102018
Crossing-optimal extension of simple drawings
R Ganian, T Hamm, F Klute, I Parada, B Vogtenhuber
arXiv preprint arXiv:2012.07457, 2020
92020
Extending nearly complete 1-planar drawings in polynomial time
E Eiben, R Ganian, T Hamm, F Klute, M Nöllenburg
arXiv preprint arXiv:2007.05346, 2020
92020
Maximizing Ink in Partial Edge Drawings of k-plane Graphs
M Hummel, F Klute, S Nickel, M Nöllenburg
International Symposium on Graph Drawing and Network Visualization, 323-336, 2019
72019
Edge-Minimum Saturated k-Planar Drawings
S Chaplick, F Klute, I Parada, J Rollin, T Ueckerdt
Graph Drawing and Network Visualization: 29th International Symposium, GD …, 2021
62021
On strict (outer-) confluent graphs
H Förster, R Ganian, F Klute, M Nöllenburg
International Symposium on Graph Drawing and Network Visualization, 147-161, 2019
52019
On Streaming Algorithms for Geometric Independent Set and Clique
S Bhore, F Klute, JJ Oostveen
International Workshop on Approximation and Online Algorithms, 211-224, 2022
42022
On Strict (Outer-) Confluent Graphs.
H Förster, R Ganian, F Klute, M Nöllenburg
J. Graph Algorithms Appl. 25 (1), 481-512, 2021
22021
Balanced independent and dominating sets on colored interval graphs
S Bhore, JH Haunert, F Klute, G Li, M Nöllenburg
SOFSEM 2021: Theory and Practice of Computer Science: 47th International …, 2021
22021
Saturated -Plane Drawings with Few Edges
F Klute, I Parada
arXiv preprint arXiv:2012.02281, 2020
22020
On Fully Diverse Sets of Geometric Objects and Graphs
F Klute, M van Kreveld
International Workshop on Graph-Theoretic Concepts in Computer Science, 328-341, 2022
12022
Labeling nonograms: Boundary labeling for curve arrangements
F Klute, M Löffler, M Nöllenburg
Computational Geometry 98, 101791, 2021
12021
Local Complexity of Polygons
F Klute, MM Reddy, T Miltzow
arXiv preprint arXiv:2101.07554, 2021
12021
Finding large matchings in 1-planar graphs of minimum degree 3
T Biedl, F Klute
International Workshop on Graph-Theoretic Concepts in Computer Science, 248-260, 2020
12020
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20