Publications
2022
Scholarly publications
Oostveen, J., Klute, F., & Bhore, S. (2022). On Streaming Algorithms for Geometric Independent Set and Clique. In P. Chalermsook, & B. Laekhanukit (Eds.), Approximation and Online Algorithms - 20th International Workshop, WAOA 2022, Proceedings (pp. 211-224). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13538 LNCS). Springer Cham. https://doi.org/10.48550/arXiv.2207.01108, https://doi.org/10.1007/978-3-031-18367-6_11
Klute, F., & Kreveld, M. V. (2022). On Fully Diverse Sets of Geometric Objects and Graphs. In M. A. Bekos, & M. Kaufmann (Eds.), Graph-Theoretic Concepts in Computer Science: 48th International Workshop, WG 2022, Tübingen, Germany, June 22–24, 2022, Revised Selected Papers (pp. 328-341). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13453 LNCS). Springer. https://doi.org/10.1007/978-3-031-15914-5_24
2021
Scholarly publications
Klute, F., Reddy, M. M., & Miltzow, T. (2021). Local Complexity of Polygons. (pp. 1-7). arXiv. https://doi.org/10.48550/arXiv.2101.07554
Bhore, S., Haunert, J-H., Klute, F., Li, G., & Nöllenburg, M. (2021). Balanced Independent and Dominating Sets on Colored Interval Graphs. In T. Bureš, R. Dondi, J. Gamper, G. Guerrini, T. Jurdzinski, C. Pahl, F. Sikora, & P. W. Wong (Eds.), SOFSEM 2021: Theory and Practice of Computer Science: 47th International Conference on Current Trends in Theory and Practice of Computer Science (pp. 89-103). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12607 LNCS). Springer. https://doi.org/10.1007/978-3-030-67731-2_7
Ganian, R., Klute, F., & Ordyniak, S. (2021). On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. Algorithmica, 83(1), 297-336. [1]. https://doi.org/10.1007/s00453-020-00758-8
2020
Scholarly publications
Klute, F., & Parada, I. (2020). Saturated K-Plane Drawings with Few Edges. CoRR. https://arxiv.org/abs/2012.02281
Eiben, E., Ganian, R., Hamm, T., Klute, F., & Nöllenburg, M. (2020). Extending Partial 1-Planar Drawings. In A. Czumaj, A. Dawar, & E. Merelli (Eds.), 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) (pp. 43:1-43:19). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 168). Schloss Dagstuhltextendash Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2020.43
Eiben, E., Ganian, R., Hamm, T., Klute, F., & Nöllenburg, M. (2020). Extending Nearly Complete 1-Planar Drawings in Polynomial Time. In J. Esparza, & D. Kráv l (Eds.), 45th International Symposium on Mathematical Foundations of Computer Science (MFCS'20) (pp. 31:1-31:16). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 170). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.31
Biedl, T., & Klute, F. (2020). Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3. In I. Adler, & H. Müller (Eds.), Graph-Theoretic Concepts in Computer Science: 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers (pp. 248-260). (Lecture Notes in Computer Science; Vol. 12301). Springer Cham. https://doi.org/10.1007/978-3-030-60440-0_20
Bekos, M. A., Kaufmann, M., Klute, F., Pupyrev, S., Raftopoulou, C., & Ueckerdt, T. (2020). Four Pages Are Indeed Necessary for Planar Graphs. Journal of Computational Geometry, 11(1), 332-353. https://doi.org/10.20382/jocg.v11i1a12
Arroyo, A., Klute, F., Parada, I., Seidel, R., Vogtenhuber, B., & Wiedera, T. (2020). Inserting One Edge into a Simple Drawing Is Hard. In 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'20) (pp. 325-338). (LNCS; Vol. 12301). Springer. https://doi.org/10.1007/978-3-030-60440-0_26
2019
Scholarly publications
Horiyama, T., Klute, F., Korman, M., Parada, I., Uehara, R., & Yamanaka, K. (2019). Efficient Segment Folding Is Hard. 177-183.
Klute, F., & Nöllenburg, M. (2019). Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts. Journal of Computational Geometry, 10(2), 45-69. https://doi.org/10.20382/jocg.v10i2a4
Klute, F., Li, G., Löffler, R., Nöllenburg, M., & Schmidt, M. (2019). Exploring Semi-Automatic Map Labeling. In F. B. Kashani, G. Trajcevski, R. H. Güting, L. Kulik, & S. D. Newsam (Eds.), 27th ACM International Conference on Advances in Geographic Information Systems (SIGSPATIAL'19) (pp. 13-22). ACM. https://doi.org/10.1145/3347146.3359359
Hummel, M., Klute, F., Nickel, S., & Nöllenburg, M. (2019). Maximizing Ink in Partial Edge Drawings of k-Plane Graphs. In D. Archambault, & C. D. Tóth (Eds.), 27th International Symposium on Graph Drawing and Network Visualization (GD'19) (Vol. 11904, pp. 323-336). (LNCS). Springer. https://doi.org/10.1007/978-3-030-35802-0_25
Hamm, T., Klute, F., & Parada, I. (2019). Extending to 1-Plane Drawings. 30-33.
Förster, H., Ganian, R., Klute, F., & Nöllenburg, M. (2019). On Strict (Outer-)Confluent Graphs. In D. Archambault, & C. D. Tóth (Eds.), 27th International Symposium on Graph Drawing and Network Visualization (GD'19) (Vol. 11904, pp. 147-161). (LNCS). Springer. https://doi.org/10.1007/978-3-030-35802-0_12
de Col, P., Klute, F., & Nöllenburg, M. (2019). Mixed Linear Layouts: Complexity, Heuristics, and Experiments. In D. Archambault, & C. D. Tóth (Eds.), 27th International Symposium on Graph Drawing and Network Visualization (GD'19) (Vol. 11904, pp. 460-467). (LNCS). Springer. https://doi.org/10.1007/978-3-030-35802-0_35
2018
Scholarly publications
Höller, M., Klute, F., Nickel, S., Nöllenburg, M., & Schreiber, B. (2018). Maximizing Ink in Symmetric Partial Edge Drawings of k-Plane Graphs. 50:1-50:6. Abstract from 34th European Workshop on Computational Geometry.
Klute, F., & Nöllenburg, M. (2018). Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts. In B. Speckmann, & C. D. Tóth (Eds.), 34th International Symposium on Computational Geometry (SoCG'18) (Vol. 99, pp. 53:1-53:14). (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.53
Ganian, R., Klute, F., & Ordyniak, S. (2018). On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. In R. Niedermeier, & B. Vallée (Eds.), 35th Symposium on Theoretical Aspects of Computer Science (STACS'18) (Vol. 96, pp. 33:1-33:14). (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.STACS.2018.33
2017
Scholarly publications
Klute, F., & Nöllenburg, M. (2017). Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts. 273-276. Abstract from 33rd European Workshop on Computational Geometry.
Klute, F., & Nöllenburg, M. (2017). Towards Characterizing Strict Outerconfluent Graphs. 612-614. Poster session presented at 25th International Symposium on Graph Drawing and Network Visualization.
https://dspace.library.uu.nl/bitstream/handle/1874/423624/kn_tcsog_18.pdf?sequence=2
https://dspace.library.uu.nl/bitstream/handle/1874/423624/kn_tcsog_18.pdf?sequence=2
2016
Scholarly publications
Klute, F. (2016). Robust Genealogy Drawings. 637-639. Poster session presented at 24th International Symposium on Graph Drawing and Network Visualization.
2014
Scholarly publications
Bläsius, T., Klute, F., Niedermann, B., & Nöllenburg, M. (2014). PiGra a Tool for Pixelated Graph Representations. 513-514. Poster session presented at 22nd International Symposium on Graph Drawing.