Fabian Klute | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/fabian-klute/Fabian KluteHugo Blox Builder (https://hugoblox.com)en-usWed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngFabian Klutehttps://ac.tuwien.ac.at/team/fabian-klute/Crossing and Independent Families Among Polygonshttps://ac.tuwien.ac.at/publication/crossing-and-independent-families-among-polygons/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/crossing-and-independent-families-among-polygons/Minimum Link Fencinghttps://ac.tuwien.ac.at/publication/minimum-link-fencing/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimum-link-fencing/Balanced Independent and Dominating Sets on Colored Interval Graphshttps://ac.tuwien.ac.at/publication/balanced-independent-and-dominating-sets-on-colored-interval-graphs-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/balanced-independent-and-dominating-sets-on-colored-interval-graphs-2/Crossing-Optimal Extension of Simple Drawingshttps://ac.tuwien.ac.at/publication/crossing-optimal-extension-of-simple-drawings/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/crossing-optimal-extension-of-simple-drawings/Labeling Nonograms: Boundary Labeling for Curve Arrangementshttps://ac.tuwien.ac.at/publication/labeling-nonograms-boundary-labeling-for-curve-arrangements/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/labeling-nonograms-boundary-labeling-for-curve-arrangements/On Strict (Outer-)Confluent Graphshttps://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-3/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-3/On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problemhttps://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-bounded-degree-vertex-deletion-problem-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-bounded-degree-vertex-deletion-problem-2/Balanced Independent and Dominating Sets on Colored Interval Graphshttps://ac.tuwien.ac.at/publication/balanced-independent-and-dominating-sets-on-colored-interval-graphs/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/balanced-independent-and-dominating-sets-on-colored-interval-graphs/Extending Nearly Complete 1-Planar Drawings in Polynomial Timehttps://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time-2/Extending Nearly Complete 1-Planar Drawings in Polynomial Timehttps://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time/Extending Partial 1-Planar Drawingshttps://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings-2/Extending Partial 1-Planar Drawingshttps://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings/Efficient Segment Folding is Hardhttps://ac.tuwien.ac.at/publication/efficient-segment-folding-is-hard/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/efficient-segment-folding-is-hard/Exploring Semi-Automatic Map Labelinghttps://ac.tuwien.ac.at/publication/exploring-semi-automatic-map-labeling/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/exploring-semi-automatic-map-labeling/Maximizing Ink in Partial Edge Drawings of k-plane Graphshttps://ac.tuwien.ac.at/publication/maximizing-ink-in-partial-edge-drawings-of-k-plane-graphs/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/maximizing-ink-in-partial-edge-drawings-of-k-plane-graphs/Minimizing crossings in constrained two-sided circular graph layoutshttps://ac.tuwien.ac.at/publication/minimizing-crossings-in-constrained-two-sided-circular-graph-layouts-3/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-crossings-in-constrained-two-sided-circular-graph-layouts-3/Mixed Linear Layouts: Complexity, Heuristics, and Experimentshttps://ac.tuwien.ac.at/publication/mixed-linear-layouts-complexity-heuristics-and-experiments/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/mixed-linear-layouts-complexity-heuristics-and-experiments/On Strict (Outer-)Confluent Graphshttps://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-2/On Strict (Outer-)Confluent Graphshttps://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs/Minimizing Crossings in Constrained Two-Sided Circular Graph Layoutshttps://ac.tuwien.ac.at/publication/minimizing-crossings-in-constrained-two-sided-circular-graph-layouts-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-crossings-in-constrained-two-sided-circular-graph-layouts-2/On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problemhttps://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-bounded-degree-vertex-deletion-problem/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-bounded-degree-vertex-deletion-problem/Towards Characterizing Strict Outerconfluent Graphshttps://ac.tuwien.ac.at/publication/towards-characterizing-strict-outerconfluent-graphs/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/towards-characterizing-strict-outerconfluent-graphs/Minimizing crossings in constrained two-sided circular graph layoutshttps://ac.tuwien.ac.at/publication/minimizing-crossings-in-constrained-two-sided-circular-graph-layouts/Sat, 01 Apr 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-crossings-in-constrained-two-sided-circular-graph-layouts/PIGRA – A Tool for Pixelated Graph Representationshttps://ac.tuwien.ac.at/publication/pigra-a-tool-for-pixelated-graph-representations/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/pigra-a-tool-for-pixelated-graph-representations/