Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Klute, Fabian
270  Ergebnisse:
Personensuche X
?
1

Edge‐minimum saturated k‐planar drawings:

Chaplick, Steven ; Klute, Fabian ; Parada, Irene..
Journal of Graph Theory.  106 (2024)  4 - p. 741-762 , 2024
Link: https://doi.org/10.1002/..
 
?
2

Graph Drawing Contest Report:

, In: Lecture Notes in Computer Science; Graph Drawing and Network Visualization,
Kindermann, Philipp ; Klute, Fabian ; Mchedlidze, Tamara. - p. 459-470 , 2023
Link: https://doi.org/10.1007/..
 
?
3

On Streaming Algorithms for Geometric Independent Set and C..:

, In: Approximation and Online Algorithms; Lecture Notes in Computer Science,
Bhore, Sujoy ; Klute, Fabian ; Oostveen, Jelle J. - p. 211-224 , 2022
Link: https://doi.org/10.1007/..
 
?
4

On Fully Diverse Sets of Geometric Objects and Graphs:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Klute, Fabian ; van Kreveld, Marc - p. 328-341 , 2022
Link: https://doi.org/10.1007/..
 
?
5

Inserting One Edge into a Simple Drawing is Hard:

Arroyo, Alan ; Klute, Fabian ; Parada, Irene...
Discrete & Computational Geometry.  69 (2022)  3 - p. 745-770 , 2022
Link: https://doi.org/10.1007/..
 
?
6

Efficient segment folding is hard:

Horiyama, Takashi ; Klute, Fabian ; Korman, Matias...
Computational Geometry.  104 (2022)  - p. 101860 , 2022
Link: https://doi.org/10.1016/..
 
?
7

Balanced Independent and Dominating Sets on Colored Interva..:

, In: SOFSEM 2021: Theory and Practice of Computer Science; Lecture Notes in Computer Science,
Bhore, Sujoy ; Haunert, Jan-Henrik ; Klute, Fabian.. - p. 89-103 , 2021
Link: https://doi.org/10.1007/..
 
?
8

On Strict (Outer-)Confluent Graphs:

Förster, Henry ; Ganian, Robert ; Klute, Fabian.
Journal of Graph Algorithms and Applications.  25 (2021)  1 - p. 481-512 , 2021
Link: https://doi.org/10.7155/..
 
?
9

Edge-Minimum Saturated k-Planar Drawings:

, In: Lecture Notes in Computer Science; Graph Drawing and Network Visualization,
Chaplick, Steven ; Klute, Fabian ; Parada, Irene.. - p. 3-17 , 2021
Link: https://doi.org/10.1007/..
 
?
10

Labeling nonograms: Boundary labeling for curve arrangement:

Klute, Fabian ; Löffler, Maarten ; Nöllenburg, Martin
Computational Geometry.  98 (2021)  - p. 101791 , 2021
Link: https://doi.org/10.1016/..
 
?
11

On Structural Parameterizations of the Bounded-Degree Verte..:

Ganian, Robert ; Klute, Fabian ; Ordyniak, Sebastian
Algorithmica.  83 (2020)  1 - p. 297-336 , 2020
Link: https://doi.org/10.1007/..
 
?
12

Inserting One Edge into a Simple Drawing Is Hard:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Arroyo, Alan ; Klute, Fabian ; Parada, Irene... - p. 325-338 , 2020
Link: https://doi.org/10.1007/..
 
?
13

Finding Large Matchings in 1-Planar Graphs of Minimum Degre..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Biedl, Therese ; Klute, Fabian - p. 248-260 , 2020
Link: https://doi.org/10.1007/..
 
?
14

Exploring Semi-Automatic Map Labeling:

, In: Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems,
Klute, Fabian ; Li, Guangping ; Löffler, Raphael.. - p. 13-22 , 2019
Link: https://dl.acm.org/doi/1..
 
?
15

Maximizing Ink in Partial Edge Drawings of k-plane Graphs:

, In: Lecture Notes in Computer Science; Graph Drawing and Network Visualization,
Hummel, Matthias ; Klute, Fabian ; Nickel, Soeren. - p. 323-336 , 2019
Link: https://doi.org/10.1007/..
 
1-15