default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabian Klute
Person information
- affiliation: Universitat Politècnica de Catalunya, Barcelona, Spain
- affiliation (former): Utrecht University, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j7]Alan Arroyo
, Fabian Klute, Irene Parada, Birgit Vogtenhuber, Raimund Seidel, Tilo Wiedera:
Inserting One Edge into a Simple Drawing is Hard. Discret. Comput. Geom. 69(3): 745-770 (2023)- 2022
- [j6]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Efficient segment folding is hard. Comput. Geom. 104: 101860 (2022) - 2021
- [j5]Robert Ganian, Fabian Klute, Sebastian Ordyniak:
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. Algorithmica 83(1): 297-336 (2021) - [j4]Fabian Klute, Maarten Löffler, Martin Nöllenburg:
Labeling nonograms: Boundary labeling for curve arrangements. Comput. Geom. 98: 101791 (2021) - [j3]Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg:
On Strict (Outer-)Confluent Graphs. J. Graph Algorithms Appl. 25(1): 481-512 (2021) - 2020
- [j2]Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt:
Four Pages Are Indeed Necessary for Planar Graphs. J. Comput. Geom. 11(1): 332-353 (2020) - 2019
- [j1]Fabian Klute, Martin Nöllenburg:
Minimizing crossings in constrained two-sided circular graph layouts. J. Comput. Geom. 10(2): 45-69 (2019)
Conference and Workshop Papers
- 2024
- [c20]Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter:
On k-Plane Insertion into Plane Drawings. GD 2024: 35:1-35:11 - [c19]Sara Di Bartolomeo, Fabian Klute, Debajyoti Mondal, Jules Wulms:
Graph Drawing Contest Report (Graph Drawing Contest Report). GD 2024: 41:1-41:13 - 2022
- [c18]Philipp Kindermann, Fabian Klute, Tamara Mchedlidze, Wouter Meulemans:
Graph Drawing Contest Report. GD 2022: 459-470 - [c17]Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu:
Minimum Link Fencing. ISAAC 2022: 34:1-34:14 - [c16]Sujoy Bhore, Fabian Klute, Jelle J. Oostveen:
On Streaming Algorithms for Geometric Independent Set and Clique. WAOA 2022: 211-224 - [c15]Fabian Klute, Marc J. van Kreveld:
On Fully Diverse Sets of Geometric Objects and Graphs. WG 2022: 328-341 - 2021
- [c14]Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt:
Edge-Minimum Saturated k-Planar Drawings. GD 2021: 3-17 - [c13]Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber:
Crossing-Optimal Extension of Simple Drawings. ICALP 2021: 72:1-72:17 - [c12]Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg:
Balanced Independent and Dominating Sets on Colored Interval Graphs. SOFSEM 2021: 89-103 - 2020
- [c11]Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg:
Extending Partial 1-Planar Drawings. ICALP 2020: 43:1-43:19 - [c10]Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg:
Extending Nearly Complete 1-Planar Drawings in Polynomial Time. MFCS 2020: 31:1-31:16 - [c9]Therese Biedl, Fabian Klute:
Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3. WG 2020: 248-260 - [c8]Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera:
Inserting One Edge into a Simple Drawing Is Hard. WG 2020: 325-338 - 2019
- [c7]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Ecient Segment Folding is Hard. CCCG 2019: 177-183 - [c6]Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg:
On Strict (Outer-)Confluent Graphs. GD 2019: 147-161 - [c5]Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg:
Maximizing Ink in Partial Edge Drawings of k-plane Graphs. GD 2019: 323-336 - [c4]Philipp de Col, Fabian Klute, Martin Nöllenburg:
Mixed Linear Layouts: Complexity, Heuristics, and Experiments. GD 2019: 460-467 - [c3]Fabian Klute, Guangping Li, Raphael Löffler, Martin Nöllenburg, Manuela Schmidt:
Exploring Semi-Automatic Map Labeling. SIGSPATIAL/GIS 2019: 13-22 - 2018
- [c2]Fabian Klute, Martin Nöllenburg:
Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts. SoCG 2018: 53:1-53:14 - [c1]Robert Ganian, Fabian Klute, Sebastian Ordyniak:
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. STACS 2018: 33:1-33:14
Informal and Other Publications
- 2024
- [i19]Ivor van der Hoog, Fabian Klute, Irene Parada, Patrick Schnider:
Barking dogs: A Fréchet distance variant for detour detection. CoRR abs/2402.13159 (2024) - [i18]Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter:
On k-Plane Insertion into Plane Drawings. CoRR abs/2402.14552 (2024) - 2022
- [i17]Sujoy Bhore, Fabian Klute, Jelle J. Oostveen:
On Streaming Algorithms for Geometric Independent Set and Clique. CoRR abs/2207.01108 (2022) - [i16]Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu:
Minimum Link Fencing. CoRR abs/2209.14804 (2022) - 2021
- [i15]Fabian Klute, Meghana M. Reddy, Tillmann Miltzow:
Local Complexity of Polygons. CoRR abs/2101.07554 (2021) - 2020
- [i14]Therese Biedl, Fabian Klute:
Finding large matchings in 1-planar graphs of minimum degree 3. CoRR abs/2002.11818 (2020) - [i13]Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg:
Balanced Independent and Dominating Sets on Colored Interval Graphs. CoRR abs/2003.05289 (2020) - [i12]Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt:
Four Pages Are Indeed Necessary for Planar Graphs. CoRR abs/2004.07630 (2020) - [i11]Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg:
Extending Partial 1-Planar Drawings. CoRR abs/2004.12222 (2020) - [i10]Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg:
Extending Nearly Complete 1-Planar Drawings in Polynomial Time. CoRR abs/2007.05346 (2020) - [i9]Fabian Klute, Irene Parada:
Saturated k-Plane Drawings with Few Edges. CoRR abs/2012.02281 (2020) - [i8]Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber:
Crossing-Optimal Extension of Simple Drawings. CoRR abs/2012.07457 (2020) - [i7]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Efficient Segment Folding is Hard. CoRR abs/2012.11062 (2020) - 2019
- [i6]Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg:
On Strict (Outer-)Confluent Graphs. CoRR abs/1908.05345 (2019) - [i5]Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg:
Maximizing Ink in Partial Edge Drawings of k-plane Graphs. CoRR abs/1908.08905 (2019) - [i4]Philipp de Col, Fabian Klute, Martin Nöllenburg:
Mixed Linear Layouts: Complexity, Heuristics, and Experiments. CoRR abs/1908.08938 (2019) - [i3]Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera:
Extending simple drawings with one edge is hard. CoRR abs/1909.07347 (2019) - [i2]Fabian Klute, Guangping Li, Raphael Löffler, Martin Nöllenburg, Manuela Schmidt:
Exploring Semi-Automatic Map Labeling. CoRR abs/1910.07799 (2019) - 2018
- [i1]Fabian Klute, Martin Nöllenburg:
Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts. CoRR abs/1803.05705 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
