https://ac.tuwien.ac.at/team/martin-nollenburg/Martin NöllenburgHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/team/martin-nollenburg/avatar_hu2487309494910799022.pnghttps://ac.tuwien.ac.at/team/martin-nollenburg/https://ac.tuwien.ac.at/project/parameterized-graph-drawing/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/project/parameterized-graph-drawing/<ul> <li>Funding organization: <a href="https://www.wwtf.at/wwtf/" target="_blank" rel="noopener">Vienna Science and Technology Fund</a>, WWTF</li> <li>Project number: ICT22-029 (<a href="https://www.wwtf.at/funding/programmes/ict/#ICT22" target="_blank" rel="noopener">Information and Communication Technology 2022</a>)</li> </ul> <h2 id="project-team">Project Team</h2> <p><a href="https://ac.tuwien.ac.at/team/robert-ganian/">Robert Ganian</a> (Principal Investigator)</p> <p><a href="https://ac.tuwien.ac.at/team/martin-nollenburg/">Martin Nöllenburg</a> (Principal Investigator)</p> <p><a href="https://ac.tuwien.ac.at/team/simon-dominik-fink/">Simon Dominik Fink</a> (Postdoctoral Researcher)</p> <p><a href="https://ac.tuwien.ac.at/team/thomas-depian/">Thomas Depian</a> (PhD Student)</p> <p><a href="https://ac.tuwien.ac.at/team/alexander-firbas/">Alexander Firbas</a> (PhD Student)</p> <p> <figure > <div class="d-flex justify-content-center"> <div class="w-100" ><img alt="The Project Team" srcset=" /project/parameterized-graph-drawing/PGD-Group-scaled_hu17816735023089785297.webp 400w, /project/parameterized-graph-drawing/PGD-Group-scaled_hu17537728813777461662.webp 760w, /project/parameterized-graph-drawing/PGD-Group-scaled_hu10296446682098410735.webp 1200w" src="https://ac.tuwien.ac.at/project/parameterized-graph-drawing/PGD-Group-scaled_hu17816735023089785297.webp" width="760" height="507" loading="lazy" data-zoomable /></div> </div></figure> </p> <h2 id="heading"></h2> <h2 id="research-statement">Research Statement</h2> <p>The project is centered around two well-established fields of information and communication technology: (1) graph drawing and visualization, which deals with the construction and analysis of geometric representations of graphs and networks subject to specific layout conventions, and (2) parameterized complexity analysis, which offers the tools to design efficient algorithms as well as lower bounds custom-tailored to the specific structural properties of relevant inputs. Recent advances have highlighted the huge potential for the application of parameterized techniques on graph drawing and visualization problems. The two PIs of this proposal – Robert Ganian and Martin Nöllenburg – have already spearheaded an initial push to bring the two fields closer together, and this proposal will allow them to bring these efforts into fruition by targeting and resolving some of the most prominent questions in this intersection.</p> <p>The project focuses on developing the tools and frameworks that will facilitate the parameterized analysis of central problems in graph drawing and visualization. The work is split into four fundamental themes, covering Extension Problems, Linear and Layered Layouts, Geometric Graph Representations and Bridges to Network Visualization. The output of each theme will include not only new algorithms but also tight lower bounds and, where relevant, implementations, significantly advancing the state of the art in these increasingly prominent fields of research.</p>https://ac.tuwien.ac.at/publication/f-2-stories-a-modular-framework-for-multi-objective-optimization-of-storylines-with-a-focus-on-fairness/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/f-2-stories-a-modular-framework-for-multi-objective-optimization-of-storylines-with-a-focus-on-fairness/https://ac.tuwien.ac.at/publication/arcol-aspect-ratio-constrained-orthogonal-layout/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/arcol-aspect-ratio-constrained-orthogonal-layout/https://ac.tuwien.ac.at/publication/block-crossings-in-one-sided-tanglegrams-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/block-crossings-in-one-sided-tanglegrams-2/https://ac.tuwien.ac.at/publication/clarity-and-computational-efficiency-of-orbital-boundary-labeling/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/clarity-and-computational-efficiency-of-orbital-boundary-labeling/https://ac.tuwien.ac.at/publication/combined-network-and-set-visualization-with-hoop-and-linear-diagrams/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/combined-network-and-set-visualization-with-hoop-and-linear-diagrams/https://ac.tuwien.ac.at/publication/fully-dynamic-maximum-independent-sets-of-disks-in-polylogarithmic-update-time-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/fully-dynamic-maximum-independent-sets-of-disks-in-polylogarithmic-update-time-2/https://ac.tuwien.ac.at/publication/minimizing-visual-clutter-in-temporal-treemaps-to-enable-comparison-of-evolving-hierarchies/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-visual-clutter-in-temporal-treemaps-to-enable-comparison-of-evolving-hierarchies/https://ac.tuwien.ac.at/publication/multidimensional-manhattan-preferences-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/multidimensional-manhattan-preferences-2/https://ac.tuwien.ac.at/publication/on-the-complexity-of-extending-storylines/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-extending-storylines/https://ac.tuwien.ac.at/publication/one-sided-local-crossing-minimization/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/one-sided-local-crossing-minimization/https://ac.tuwien.ac.at/publication/paged-geophylogenies-a-coloring-approach-to-external-labeling-with-tree-constraints/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/paged-geophylogenies-a-coloring-approach-to-external-labeling-with-tree-constraints/https://ac.tuwien.ac.at/publication/realizing-planar-linkages-in-polygonal-domains/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/realizing-planar-linkages-in-polygonal-domains/https://ac.tuwien.ac.at/publication/representing-hypergraphs-by-point-line-incidences-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/representing-hypergraphs-by-point-line-incidences-2/https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-ordering-a-graph-while-avoiding-a-forbidden-pattern-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-ordering-a-graph-while-avoiding-a-forbidden-pattern-2/https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-ordering-a-graph-while-avoiding-a-forbidden-pattern/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-ordering-a-graph-while-avoiding-a-forbidden-pattern/https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts-2/https://ac.tuwien.ac.at/publication/the-peculiarities-of-extending-queue-layouts/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-peculiarities-of-extending-queue-layouts/https://ac.tuwien.ac.at/publication/the-story-line-so-far-a-survey-on-storyline-visualization/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-story-line-so-far-a-survey-on-storyline-visualization/https://ac.tuwien.ac.at/publication/two-layer-drawings-with-a-tree-on-top-vertex-splits-and-fixed-parameter-algorithms-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/two-layer-drawings-with-a-tree-on-top-vertex-splits-and-fixed-parameter-algorithms-2/https://ac.tuwien.ac.at/publication/two-layer-drawings-with-a-tree-on-top-vertex-splits-and-fixed-parameter-algorithms/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/two-layer-drawings-with-a-tree-on-top-vertex-splits-and-fixed-parameter-algorithms/https://ac.tuwien.ac.at/publication/using-beta-proximity-to-reduce-distortion-in-bundled-graph-drawings/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/using-beta-proximity-to-reduce-distortion-in-bundled-graph-drawings/https://ac.tuwien.ac.at/publication/visualizing-treewidth-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/visualizing-treewidth-2/https://ac.tuwien.ac.at/publication/an-introduction-to-and-survey-of-biological-network-visualization/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-introduction-to-and-survey-of-biological-network-visualization/https://ac.tuwien.ac.at/publication/bundling-aware-graph-drawing-revisited/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/bundling-aware-graph-drawing-revisited/https://ac.tuwien.ac.at/publication/constrained-boundary-labeling-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/constrained-boundary-labeling-2/https://ac.tuwien.ac.at/publication/f2stories-a-modular-framework-for-multi-objective-optimization-of-storylines-with-a-focus-on-fairness/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/f2stories-a-modular-framework-for-multi-objective-optimization-of-storylines-with-a-focus-on-fairness/https://ac.tuwien.ac.at/publication/geometry-matters-in-planar-storyplans/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/geometry-matters-in-planar-storyplans/https://ac.tuwien.ac.at/publication/introducing-fairness-in-network-visualization/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/introducing-fairness-in-network-visualization/https://ac.tuwien.ac.at/publication/on-minimizing-wiggle-in-stacked-area-charts/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-minimizing-wiggle-in-stacked-area-charts/https://ac.tuwien.ac.at/publication/on-planar-unit-length-linear-linkages-in-polygonal-domains/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-planar-unit-length-linear-linkages-in-polygonal-domains/https://ac.tuwien.ac.at/publication/optimizing-staircase-motifs-in-biofabric-network-layouts/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimizing-staircase-motifs-in-biofabric-network-layouts/https://ac.tuwien.ac.at/publication/optimizing-wiggle-in-storylines/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimizing-wiggle-in-storylines/https://ac.tuwien.ac.at/publication/partial-level-planarity-parameterized-by-the-size-of-the-missing-graph/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/partial-level-planarity-parameterized-by-the-size-of-the-missing-graph/https://ac.tuwien.ac.at/publication/passenger-decision-making-in-mass-transit-systems-insights-from-dual-process-theories/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/passenger-decision-making-in-mass-transit-systems-insights-from-dual-process-theories/https://ac.tuwien.ac.at/publication/pathways-to-tractability-for-geometric-thickness/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/pathways-to-tractability-for-geometric-thickness/https://ac.tuwien.ac.at/publication/pathways-to-tractability-for-geometric-thickness-best-paper-award/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/pathways-to-tractability-for-geometric-thickness-best-paper-award/https://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting-2/https://ac.tuwien.ac.at/publication/quantum-speedups-for-polynomial-time-dynamic-programming-algorithms/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/quantum-speedups-for-polynomial-time-dynamic-programming-algorithms/https://ac.tuwien.ac.at/publication/representing-hypergraphs-by-point-line-incidences/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/representing-hypergraphs-by-point-line-incidences/https://ac.tuwien.ac.at/publication/storysets-ordering-curves-and-dimensions-for-visualizing-uncertain-sets-and-multi-dimensional-discrete-data/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/storysets-ordering-curves-and-dimensions-for-visualizing-uncertain-sets-and-multi-dimensional-discrete-data/https://ac.tuwien.ac.at/publication/the-peculiarities-of-extending-queue-layouts-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-peculiarities-of-extending-queue-layouts-2/https://ac.tuwien.ac.at/publication/transitions-in-dynamic-point-labeling-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/transitions-in-dynamic-point-labeling-2/https://ac.tuwien.ac.at/publication/visualizing-treewidth/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/visualizing-treewidth/https://ac.tuwien.ac.at/publication/boundary-labeling-in-a-circular-orbit/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/boundary-labeling-in-a-circular-orbit/https://ac.tuwien.ac.at/publication/bundling-aware-graph-drawing/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/bundling-aware-graph-drawing/https://ac.tuwien.ac.at/publication/computing-data-driven-multilinear-metro-maps/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-data-driven-multilinear-metro-maps/https://ac.tuwien.ac.at/publication/computing-hive-plots-a-combinatorial-framework-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-hive-plots-a-combinatorial-framework-2/https://ac.tuwien.ac.at/publication/constrained-boundary-labeling/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/constrained-boundary-labeling/https://ac.tuwien.ac.at/project/linordvis/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/project/linordvis/<p>Funding Organisation: <a href="https://www.wwtf.at" target="_blank" rel="noopener">Vienna Science and Technology Fund</a>, WWTF<br> Project Number: <a href="https://www.wwtf.at/programmes/information_communication/ICT19-035" target="_blank" rel="noopener">ICT19-035</a><br> Duration: 07/2020 - 06/2024</p> <h2 id="project-team">Project Team</h2> <ul> <li>Alexander Dobler</li> <li>Markus Wallinger</li> <li>Jules Wulms</li> <li><a href="https://ac.tuwien.ac.at/team/martin-nollenburg/">Martin Nöllenburg</a> (Professor, Principal Investigator)</li> </ul> <p> <figure > <div class="d-flex justify-content-center"> <div class="w-100" ><img alt="Alexander Dobler, Michael Stampfer, Martin Nöllenburg at the 20th anniversary of WWTF" srcset=" /project/linordvis/WWTF-20-Jahre_01092022_WEBSIZE_104_hu3329933751107914659.webp 400w, /project/linordvis/WWTF-20-Jahre_01092022_WEBSIZE_104_hu13499493198571026005.webp 760w, /project/linordvis/WWTF-20-Jahre_01092022_WEBSIZE_104_hu3750019577051517505.webp 1200w" src="https://ac.tuwien.ac.at/project/linordvis/WWTF-20-Jahre_01092022_WEBSIZE_104_hu3329933751107914659.webp" width="760" height="507" loading="lazy" data-zoomable /></div> </div></figure> </p> <p><em>Alexander Dobler, Michael Stampfer, Martin Nöllenburg at the 20th anniversary of WWTF</em></p> <h2 id="topic">Topic</h2> <p>Optimizing linear orderings of objects is a fundamental problem for many types of data visualizations ranging from graph layouts over geospatial data to abstract sets and sequences or time-series data. Yet a systematic investigation of algorithms for solving novel constrained and application-specific ordering problems that go beyond well-studied and NP-hard classic ordering problems is missing. Practical work in visualization often resorts to heuristics without rigorous performance and quality guarantees for solving these algorithmic problems. In this project we will take an algorithmic perspective on several different ordering problems in data visualization. In the algorithm engineering sense we want to cross the gap between fundamental theory and practical applications and aim to bring the benefit of rigorous formal methods into practically relevant implementations and at the same time define new algorithmic challenges inspired by recent visualization problems. On the one hand, we will investigate the complexity of new problem settings with special input configurations, structural constraints on feasible orderings, and dependencies between multiple objects and orderings. On the other hand, we will design and implement new and sufficiently scalable algorithms with formally proven performance guarantees to compute optimal and approximate solutions. We thoroughly evaluate the improvements over existing state-of-the-art heuristics in computational experiments and user studies.</p>https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-2/https://ac.tuwien.ac.at/publication/fully-dynamic-maximum-independent-sets-of-disks-in-polylogarithmic-update-time/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/fully-dynamic-maximum-independent-sets-of-disks-in-polylogarithmic-update-time/https://ac.tuwien.ac.at/publication/gdmetrix-a-networkx-extension-for-graph-drawing-metrics/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/gdmetrix-a-networkx-extension-for-graph-drawing-metrics/https://ac.tuwien.ac.at/publication/hoop-diagrams-a-set-visualization-method/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/hoop-diagrams-a-set-visualization-method/https://ac.tuwien.ac.at/project/humalgo/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/project/humalgo/<p>Funding Organisation: <a href="http://www.fwf.ac.at" target="_blank" rel="noopener">The Austrian Science Fund</a>, FWF<br> Project Number: <a href="https://pf.fwf.ac.at/de/wissenschaft-konkret/project-finder/43064" target="_blank" rel="noopener">FWF P 31119</a><br> Duration: 11/2018 - 04/2023</p> <h2 id="project-team">Project Team</h2> <ul> <li>Sujoy Bhore</li> <li>Jules Wulms</li> <li>Guangping Li</li> <li>Anaïs Villedieu</li> <li><a href="https://ac.tuwien.ac.at/team/martin-nollenburg/">Martin Nöllenburg</a> (Principal Investigator)</li> </ul> <h2 id="topic">Topic</h2> <p>Human-centered algorithm engineering is an unconventional new paradigm in algorithmics that puts, for the first time, human factors into the focus of algorithm engineering, a methodology that is based on a cycle of design, analysis, implementation, and experimental evaluation of algorithms. Unlike other fields in computer science that investigate the interplay of humans and computers, our focus is on the symbiosis of human expert users and computers on the fundamental level of algorithms. We combine the mathematical accuracy and computational power of formal algorithmics with the creative power of the human mind in order to provide more effective and efficient algorithms for currently insufficiently solved and ill-defined algorithmic problems. Human-centered algorithms aim to produce solutions of better quality with faster overall performance, and higher user satisfaction. The project has two main goals: (i) establishing theoretical foundations, models of computation, and suitable evaluation methods and (ii) showing the practicality and benefits of the new paradigm for several prime examples of human-centered algorithmic problems that lack satisfying traditional algorithmic solutions in graph drawing and computational cartography.</p>https://ac.tuwien.ac.at/publication/improving-temporal-treemaps-by-minimizing-crossings/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/improving-temporal-treemaps-by-minimizing-crossings/https://ac.tuwien.ac.at/publication/introducing-fairness-in-graph-visualization/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/introducing-fairness-in-graph-visualization/https://ac.tuwien.ac.at/publication/introducing-fairness-in-graph-visualization-via-gradient-descent/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/introducing-fairness-in-graph-visualization-via-gradient-descent/https://ac.tuwien.ac.at/publication/minimizing-switches-in-cased-graph-drawings/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-switches-in-cased-graph-drawings/https://ac.tuwien.ac.at/publication/on-the-complexity-of-the-storyplan-problem-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-the-storyplan-problem-2/https://ac.tuwien.ac.at/publication/revisiting-ilp-models-for-exact-crossing-minimization-in-storyline-drawings/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/revisiting-ilp-models-for-exact-crossing-minimization-in-storyline-drawings/https://ac.tuwien.ac.at/publication/splitting-plane-graphs-to-outerplanarity-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/splitting-plane-graphs-to-outerplanarity-2/https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts/https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts-3/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts-3/https://ac.tuwien.ac.at/publication/uncertainty-in-humanities-network-visualization/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/uncertainty-in-humanities-network-visualization/https://ac.tuwien.ac.at/publication/visualizing-extensions-of-argumentation-frameworks-as-layered-graphs/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/visualizing-extensions-of-argumentation-frameworks-as-layered-graphs/https://ac.tuwien.ac.at/publication/block-crossings-in-one-sided-tanglegrams/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/block-crossings-in-one-sided-tanglegrams/https://ac.tuwien.ac.at/publication/computing-hive-plots-a-combinatorial-framework/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-hive-plots-a-combinatorial-framework/https://ac.tuwien.ac.at/publication/crossing-minimization-in-time-interval-storylines/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/crossing-minimization-in-time-interval-storylines/https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable/https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-3/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-3/https://ac.tuwien.ac.at/publication/faster-edge-path-bundling-through-graph-spanners/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/faster-edge-path-bundling-through-graph-spanners/https://ac.tuwien.ac.at/publication/linsets-zip-compressing-linear-set-diagrams/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/linsets-zip-compressing-linear-set-diagrams/https://ac.tuwien.ac.at/publication/mosaicsets-embedding-set-systems-into-grid-graphs/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/mosaicsets-embedding-set-systems-into-grid-graphs/https://ac.tuwien.ac.at/publication/mysemcloud-semantic-aware-word-cloud-editing/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/mysemcloud-semantic-aware-word-cloud-editing/https://ac.tuwien.ac.at/publication/new-frontiers-of-parameterized-complexity-in-graph-drawing-dagstuhl-seminar-23162/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/new-frontiers-of-parameterized-complexity-in-graph-drawing-dagstuhl-seminar-23162/https://ac.tuwien.ac.at/publication/on-families-of-planar-dags-with-constant-stack-number/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-families-of-planar-dags-with-constant-stack-number/https://ac.tuwien.ac.at/publication/on-the-complexity-of-the-storyplan-problem/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-the-storyplan-problem/https://ac.tuwien.ac.at/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results-2/https://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting/https://ac.tuwien.ac.at/publication/splitting-plane-graphs-to-outerplanarity/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/splitting-plane-graphs-to-outerplanarity/https://ac.tuwien.ac.at/publication/splitting-vertices-in-2-layer-graph-drawings/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/splitting-vertices-in-2-layer-graph-drawings/https://ac.tuwien.ac.at/publication/transitions-in-dynamic-point-labeling/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/transitions-in-dynamic-point-labeling/https://ac.tuwien.ac.at/publication/untangling-circular-drawings-algorithms-and-complexity-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/untangling-circular-drawings-algorithms-and-complexity-2/https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-2/https://ac.tuwien.ac.at/publication/an-algorithmic-study-of-fully-dynamic-independent-sets-for-map-labeling-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-algorithmic-study-of-fully-dynamic-independent-sets-for-map-labeling-2/https://ac.tuwien.ac.at/publication/edge-path-bundling-a-less-ambiguous-edge-bundling-approach/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/edge-path-bundling-a-less-ambiguous-edge-bundling-approach/https://ac.tuwien.ac.at/publication/minimum-link-fencing/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimum-link-fencing/https://ac.tuwien.ac.at/publication/mixed-labeling-integrating-internal-and-external-labels/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/mixed-labeling-integrating-internal-and-external-labels/https://ac.tuwien.ac.at/publication/multi-level-area-balancing-of-clustered-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/multi-level-area-balancing-of-clustered-graphs/https://ac.tuwien.ac.at/publication/multicriteria-optimization-for-dynamic-demers-cartograms/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/multicriteria-optimization-for-dynamic-demers-cartograms/https://ac.tuwien.ac.at/publication/multidimensional-manhattan-preferences/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/multidimensional-manhattan-preferences/https://ac.tuwien.ac.at/publication/on-computing-optimal-linear-diagrams/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-computing-optimal-linear-diagrams/https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-3/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-3/https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts/https://ac.tuwien.ac.at/publication/recognizing-weighted-and-seeded-disk-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/recognizing-weighted-and-seeded-disk-graphs/https://ac.tuwien.ac.at/publication/shape-guided-mixed-metro-map-layout/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/shape-guided-mixed-metro-map-layout/https://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/https://ac.tuwien.ac.at/publication/clustersets-optimizing-planar-clusters-in-categorical-point-data/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/clustersets-optimizing-planar-clusters-in-categorical-point-data/https://ac.tuwien.ac.at/publication/disjoint-box-covering-in-a-rectilinear-polygon/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/disjoint-box-covering-in-a-rectilinear-polygon/https://ac.tuwien.ac.at/publication/external-labeling-fundamental-concepts-and-algorithmic-techniques/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/external-labeling-fundamental-concepts-and-algorithmic-techniques/https://ac.tuwien.ac.at/publication/geometric-planar-networks-on-bichromatic-collinear-points/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/geometric-planar-networks-on-bichromatic-collinear-points/https://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/https://ac.tuwien.ac.at/publication/layered-area-proportional-rectangle-contact-representation/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/layered-area-proportional-rectangle-contact-representation/https://ac.tuwien.ac.at/publication/metrosets-visualizing-sets-as-metro-maps/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/metrosets-visualizing-sets-as-metro-maps/https://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/https://ac.tuwien.ac.at/publication/on-the-readability-of-abstract-set-visualizations/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-readability-of-abstract-set-visualizations/https://ac.tuwien.ac.at/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results/https://ac.tuwien.ac.at/publication/parameterized-complexity-in-graph-drawing-dagstuhl-seminar-21293/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-in-graph-drawing-dagstuhl-seminar-21293/https://ac.tuwien.ac.at/publication/unit-disk-representations-of-embedded-trees-outerplanar-and-multi-legged-graphs/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/unit-disk-representations-of-embedded-trees-outerplanar-and-multi-legged-graphs/https://ac.tuwien.ac.at/publication/untangling-circular-drawings-algorithms-and-complexity/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/untangling-circular-drawings-algorithms-and-complexity/https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds/https://ac.tuwien.ac.at/publication/a-survey-on-transit-map-layout-from-design-machine-and-human-perspectives/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-survey-on-transit-map-layout-from-design-machine-and-human-perspectives/https://ac.tuwien.ac.at/publication/a-unified-model-and-algorithms-for-temporal-map-labeling/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-unified-model-and-algorithms-for-temporal-map-labeling/https://ac.tuwien.ac.at/publication/an-algorithmic-study-of-fully-dynamic-independent-sets-for-map-labeling/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-algorithmic-study-of-fully-dynamic-independent-sets-for-map-labeling/https://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/https://ac.tuwien.ac.at/publication/crossing-layout-in-non-planar-graphs/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/crossing-layout-in-non-planar-graphs/https://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/https://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/https://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/https://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/https://ac.tuwien.ac.at/publication/geometric-planar-networks-on-bichromatic-points/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/geometric-planar-networks-on-bichromatic-points/https://ac.tuwien.ac.at/publication/labeling-nonograms/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/labeling-nonograms/https://ac.tuwien.ac.at/publication/layered-fan-planar-graph-drawings/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/layered-fan-planar-graph-drawings/https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-2/https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-2/https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-4/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-4/https://ac.tuwien.ac.at/publication/placing-labels-in-road-maps-algorithms-and-complexity/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/placing-labels-in-road-maps-algorithms-and-complexity/https://ac.tuwien.ac.at/publication/route-schematization-with-landmarks/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/route-schematization-with-landmarks/https://ac.tuwien.ac.at/publication/the-turing-test-for-graph-drawing-algorithms/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-turing-test-for-graph-drawing-algorithms/https://ac.tuwien.ac.at/publication/towards-data-driven-multilinear-metro-maps/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/towards-data-driven-multilinear-metro-maps/https://ac.tuwien.ac.at/publication/computing-stable-demers-cartograms/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-stable-demers-cartograms/https://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/https://ac.tuwien.ac.at/publication/external-labeling-techniques-a-taxonomy-and-survey/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/external-labeling-techniques-a-taxonomy-and-survey/https://ac.tuwien.ac.at/publication/guidelines-for-experimental-algorithmics-a-case-study-in-network-analysis/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/guidelines-for-experimental-algorithmics-a-case-study-in-network-analysis/https://ac.tuwien.ac.at/publication/lombardi-drawings-of-knots-and-links-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/lombardi-drawings-of-knots-and-links-2/https://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/https://ac.tuwien.ac.at/publication/metabopolis-scalable-network-layout-for-biological-pathway-diagrams-in-urban-map-style/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/metabopolis-scalable-network-layout-for-biological-pathway-diagrams-in-urban-map-style/https://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/https://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/https://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/https://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/https://ac.tuwien.ac.at/publication/on-the-readability-of-leaders-in-boundary-labeling/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-readability-of-leaders-in-boundary-labeling/https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-3/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-3/https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems/https://ac.tuwien.ac.at/publication/photonic-integrated-circuits-with-non-planar-topologies-realized-by-3d-printed-waveguide-overpasses/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/photonic-integrated-circuits-with-non-planar-topologies-realized-by-3d-printed-waveguide-overpasses/https://ac.tuwien.ac.at/publication/planar-drawings-of-fixed-mobile-bigraphs-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/planar-drawings-of-fixed-mobile-bigraphs-2/https://ac.tuwien.ac.at/publication/short-plane-supports-for-spatial-hypergraphs-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/short-plane-supports-for-spatial-hypergraphs-2/https://ac.tuwien.ac.at/publication/a-visual-comparison-of-hand-drawn-and-machine-generated-human-metabolic-pathways/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-visual-comparison-of-hand-drawn-and-machine-generated-human-metabolic-pathways/https://ac.tuwien.ac.at/publication/drawing-large-graphs-by-multilevel-maxent-stress-optimization-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-large-graphs-by-multilevel-maxent-stress-optimization-2/https://ac.tuwien.ac.at/publication/experimental-evaluation-of-book-drawing-algorithms/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/experimental-evaluation-of-book-drawing-algorithms/https://ac.tuwien.ac.at/publication/graph-visualization/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/graph-visualization/https://ac.tuwien.ac.at/publication/lombardi-drawings-of-knots-and-links/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/lombardi-drawings-of-knots-and-links/https://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/https://ac.tuwien.ac.at/publication/minimzing-wiggles-in-storyline-visualizations/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimzing-wiggles-in-storyline-visualizations/https://ac.tuwien.ac.at/publication/orthogonal-and-smooth-orthogonal-layouts-of-1-planar-graphs-with-low-edge-complexity/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/orthogonal-and-smooth-orthogonal-layouts-of-1-planar-graphs-with-low-edge-complexity/https://ac.tuwien.ac.at/publication/planar-and-poly-arc-lombardi-drawings/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/planar-and-poly-arc-lombardi-drawings/https://ac.tuwien.ac.at/publication/planar-drawings-of-fixed-mobile-bigraphs/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/planar-drawings-of-fixed-mobile-bigraphs/https://ac.tuwien.ac.at/publication/planar-l-drawings-of-directed-graphs/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/planar-l-drawings-of-directed-graphs/https://ac.tuwien.ac.at/publication/scalable-set-visualizations-dagstuhl-seminar-17332/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/scalable-set-visualizations-dagstuhl-seminar-17332/https://ac.tuwien.ac.at/publication/short-plane-supports-for-spatial-hypergraphs/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/short-plane-supports-for-spatial-hypergraphs/https://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/https://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/https://ac.tuwien.ac.at/publication/crowdsourcing-versus-the-laboratory-towards-human-centered-experiments-using-the-crowd/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/crowdsourcing-versus-the-laboratory-towards-human-centered-experiments-using-the-crowd/https://ac.tuwien.ac.at/publication/euclidean-greedy-drawings-of-trees-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/euclidean-greedy-drawings-of-trees-2/https://ac.tuwien.ac.at/publication/partitioning-graph-drawings-and-triangulated-simple-polygons-into-greedily-routable-regions-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/partitioning-graph-drawings-and-triangulated-simple-polygons-into-greedily-routable-regions-2/https://ac.tuwien.ac.at/publication/progress-on-partial-edge-drawings-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/progress-on-partial-edge-drawings-2/https://ac.tuwien.ac.at/publication/radial-contour-labeling-with-straight-leaders/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/radial-contour-labeling-with-straight-leaders/https://ac.tuwien.ac.at/publication/adjacency-preserving-spatial-treemaps-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/adjacency-preserving-spatial-treemaps-2/https://ac.tuwien.ac.at/publication/an-algorithmic-framework-for-labeling-road-maps/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-algorithmic-framework-for-labeling-road-maps/https://ac.tuwien.ac.at/publication/consistent-labeling-of-rotating-maps-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/consistent-labeling-of-rotating-maps-2/https://ac.tuwien.ac.at/publication/evaluation-of-labeling-strategies-for-rotating-maps-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/evaluation-of-labeling-strategies-for-rotating-maps-2/https://ac.tuwien.ac.at/publication/extending-convex-partial-drawings-of-graphs/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-convex-partial-drawings-of-graphs/https://ac.tuwien.ac.at/publication/mixed-map-labeling-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/mixed-map-labeling-2/https://ac.tuwien.ac.at/publication/on-self-approaching-and-increasing-chord-drawings-of-3-connected-planar-graphs-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-self-approaching-and-increasing-chord-drawings-of-3-connected-planar-graphs-2/https://ac.tuwien.ac.at/publication/software-visualization-via-hierarchic-micro-macro-layouts/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/software-visualization-via-hierarchic-micro-macro-layouts/https://ac.tuwien.ac.at/publication/strict-confluent-drawing-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/strict-confluent-drawing-2/https://ac.tuwien.ac.at/publication/temporal-map-labeling-a-new-unified-framework-with-experiments/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/temporal-map-labeling-a-new-unified-framework-with-experiments/https://ac.tuwien.ac.at/publication/combinatorial-properties-of-triangle-free-rectangle-arrangements-and-the-squarability-problem/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/combinatorial-properties-of-triangle-free-rectangle-arrangements-and-the-squarability-problem/https://ac.tuwien.ac.at/publication/drawing-large-graphs-by-multilevel-maxent-stress-optimization/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-large-graphs-by-multilevel-maxent-stress-optimization/https://ac.tuwien.ac.at/publication/empirical-evaluation-for-graph-drawing-dagstuhl-seminar-15052/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/empirical-evaluation-for-graph-drawing-dagstuhl-seminar-15052/https://ac.tuwien.ac.at/publication/label-placement-in-road-maps/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/label-placement-in-road-maps/https://ac.tuwien.ac.at/publication/many-to-one-boundary-labeling-with-backbones-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/many-to-one-boundary-labeling-with-backbones-2/https://ac.tuwien.ac.at/publication/mixed-map-labeling/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/mixed-map-labeling/https://ac.tuwien.ac.at/publication/multi-row-boundary-labeling-algorithms-for-panorama-images/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/multi-row-boundary-labeling-algorithms-for-panorama-images/https://ac.tuwien.ac.at/publication/on-minimizing-crossings-in-storyline-visualizations/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-minimizing-crossings-in-storyline-visualizations/https://ac.tuwien.ac.at/publication/on-the-readability-of-boundary-labeling/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-readability-of-boundary-labeling/https://ac.tuwien.ac.at/publication/operating-power-grids-with-few-flow-control-buses/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/operating-power-grids-with-few-flow-control-buses/https://ac.tuwien.ac.at/publication/partitioning-graph-drawings-and-triangulated-simple-polygons-into-greedily-routable-regions/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/partitioning-graph-drawings-and-triangulated-simple-polygons-into-greedily-routable-regions/https://ac.tuwien.ac.at/publication/recognizing-weighted-disk-contact-graphs/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/recognizing-weighted-disk-contact-graphs/https://ac.tuwien.ac.at/publication/towards-realistic-flow-control-in-power-grid-operation/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/towards-realistic-flow-control-in-power-grid-operation/https://ac.tuwien.ac.at/publication/towards-realistic-pedestrian-route-planning/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/towards-realistic-pedestrian-route-planning/https://ac.tuwien.ac.at/publication/a-survey-on-automated-metro-map-layout-methods/Tue, 01 Apr 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-survey-on-automated-metro-map-layout-methods/https://ac.tuwien.ac.at/publication/evaluation-of-labeling-strategies-for-rotating-maps/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/evaluation-of-labeling-strategies-for-rotating-maps/https://ac.tuwien.ac.at/publication/minimum-tree-supports-for-hypergraphs-and-low-concurrency-euler-diagrams/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimum-tree-supports-for-hypergraphs-and-low-concurrency-euler-diagrams/https://ac.tuwien.ac.at/publication/on-d-regular-schematization-of-embedded-paths/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-d-regular-schematization-of-embedded-paths/https://ac.tuwien.ac.at/publication/on-self-approaching-and-increasing-chord-drawings-of-3-connected-planar-graphs/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-self-approaching-and-increasing-chord-drawings-of-3-connected-planar-graphs/https://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/https://ac.tuwien.ac.at/publication/scalability-considerations-for-multivariate-graph-visualization/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/scalability-considerations-for-multivariate-graph-visualization/https://ac.tuwien.ac.at/publication/semantic-word-cloud-representations-hardness-and-approximation-algorithms/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/semantic-word-cloud-representations-hardness-and-approximation-algorithms/https://ac.tuwien.ac.at/publication/simultaneous-embeddability-of-two-partitions/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/simultaneous-embeddability-of-two-partitions/https://ac.tuwien.ac.at/publication/circular-arc-cartograms/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/circular-arc-cartograms/https://ac.tuwien.ac.at/publication/drawing-graphs-and-maps-with-curves-dagstuhl-seminar-13151/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-graphs-and-maps-with-curves-dagstuhl-seminar-13151/https://ac.tuwien.ac.at/publication/drawing-metro-maps-using-bezier-curves/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-metro-maps-using-bezier-curves/https://ac.tuwien.ac.at/publication/drawing-planar-graphs-with-a-prescribed-inner-face/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-planar-graphs-with-a-prescribed-inner-face/https://ac.tuwien.ac.at/publication/drawing-trees-with-perfect-angular-resolution-and-polynomial-area-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-trees-with-perfect-angular-resolution-and-polynomial-area-2/https://ac.tuwien.ac.at/publication/edge-weighted-contact-representations-of-planar-graphs-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/edge-weighted-contact-representations-of-planar-graphs-2/https://ac.tuwien.ac.at/publication/edge-weighted-contact-representations-of-planar-graphs/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/edge-weighted-contact-representations-of-planar-graphs/https://ac.tuwien.ac.at/publication/euclidean-greedy-drawings-of-trees/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/euclidean-greedy-drawings-of-trees/https://ac.tuwien.ac.at/publication/many-to-one-boundary-labeling-with-backbones/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/many-to-one-boundary-labeling-with-backbones/https://ac.tuwien.ac.at/publication/on-the-usability-of-lombardi-graph-drawings/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-usability-of-lombardi-graph-drawings/https://ac.tuwien.ac.at/publication/optimal-3d-angular-resolution-for-low-degree-graphs-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimal-3d-angular-resolution-for-low-degree-graphs-2/https://ac.tuwien.ac.at/publication/planar-lombardi-drawings-of-outerpaths/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/planar-lombardi-drawings-of-outerpaths/https://ac.tuwien.ac.at/publication/progress-on-partial-edge-drawings/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/progress-on-partial-edge-drawings/https://ac.tuwien.ac.at/publication/strict-confluent-drawing/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/strict-confluent-drawing/https://ac.tuwien.ac.at/publication/trajectory-based-dynamic-map-labeling/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/trajectory-based-dynamic-map-labeling/https://ac.tuwien.ac.at/publication/using-ilp-sat-to-determine-pathwidth-visibility-representations-and-other-grid-based-graph-drawings/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/using-ilp-sat-to-determine-pathwidth-visibility-representations-and-other-grid-based-graph-drawings/https://ac.tuwien.ac.at/publication/visualizing-large-hierarchically-clustered-graphs-with-a-landscape-metaphor/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/visualizing-large-hierarchically-clustered-graphs-with-a-landscape-metaphor/https://ac.tuwien.ac.at/publication/algorithms-for-computing-the-maximum-weight-region-decomposable-into-elementary-shapes/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithms-for-computing-the-maximum-weight-region-decomposable-into-elementary-shapes/https://ac.tuwien.ac.at/publication/cover-contact-graphs-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/cover-contact-graphs-2/https://ac.tuwien.ac.at/publication/drawing-complete-binary-tanglegrams/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-complete-binary-tanglegrams/https://ac.tuwien.ac.at/publication/lombardi-drawings-of-graphs-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/lombardi-drawings-of-graphs-2/https://ac.tuwien.ac.at/publication/adjacency-preserving-spatial-treemaps/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/adjacency-preserving-spatial-treemaps/https://ac.tuwien.ac.at/publication/automatic-generation-of-route-sketches/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/automatic-generation-of-route-sketches/https://ac.tuwien.ac.at/publication/boundary-labeling-algorithms-for-panorama-images/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/boundary-labeling-algorithms-for-panorama-images/https://ac.tuwien.ac.at/publication/connecting-two-trees-with-optimal-routing-cost/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/connecting-two-trees-with-optimal-routing-cost/https://ac.tuwien.ac.at/publication/consistent-labeling-of-rotating-maps/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/consistent-labeling-of-rotating-maps/https://ac.tuwien.ac.at/publication/drawing-and-labeling-high-quality-metro-maps-by-mixed-integer-programming/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-and-labeling-high-quality-metro-maps-by-mixed-integer-programming/https://ac.tuwien.ac.at/publication/drawing-trees-with-perfect-angular-resolution-and-polynomial-area/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-trees-with-perfect-angular-resolution-and-polynomial-area/https://ac.tuwien.ac.at/publication/lombardi-drawings-of-graphs/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/lombardi-drawings-of-graphs/https://ac.tuwien.ac.at/publication/on-d-regular-schematization-of-embedded-paths-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-d-regular-schematization-of-embedded-paths-2/https://ac.tuwien.ac.at/publication/optimal-3d-angular-resolution-for-low-degree-graphs/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimal-3d-angular-resolution-for-low-degree-graphs/https://ac.tuwien.ac.at/publication/sliding-labels-for-dynamic-point-labeling/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/sliding-labels-for-dynamic-point-labeling/https://ac.tuwien.ac.at/publication/an-improved-algorithm-for-the-metro-line-crossing-minimization-problem/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-improved-algorithm-for-the-metro-line-crossing-minimization-problem/https://ac.tuwien.ac.at/publication/boundary-labeling-with-octilinear-leaders-2/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/boundary-labeling-with-octilinear-leaders-2/https://ac.tuwien.ac.at/publication/dynamic-one-sided-boundary-labeling/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/dynamic-one-sided-boundary-labeling/https://ac.tuwien.ac.at/publication/optimizing-active-ranges-for-consistent-dynamic-map-labeling-2/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimizing-active-ranges-for-consistent-dynamic-map-labeling-2/https://ac.tuwien.ac.at/publication/path-schematization-for-route-sketches/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/path-schematization-for-route-sketches/https://ac.tuwien.ac.at/publication/shooting-bricks-with-orthogonal-laser-beams-a-first-step-towards-internal-external-map-labeling/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/shooting-bricks-with-orthogonal-laser-beams-a-first-step-towards-internal-external-map-labeling/https://ac.tuwien.ac.at/publication/visualisierung-von-netzen-algorithmen-anwendungen-und-komplexitat/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/visualisierung-von-netzen-algorithmen-anwendungen-und-komplexitat/https://ac.tuwien.ac.at/publication/network-visualization-algorithms-applications-and-complexity/Sun, 01 Feb 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/network-visualization-algorithms-applications-and-complexity/https://ac.tuwien.ac.at/publication/algorithms-for-multi-criteria-boundary-labeling/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithms-for-multi-criteria-boundary-labeling/https://ac.tuwien.ac.at/publication/consistent-digital-rays-2/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/consistent-digital-rays-2/https://ac.tuwien.ac.at/publication/drawing-complete-binary-tanglegrams-hardness-approximation-fixed-parameter-tractability/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-complete-binary-tanglegrams-hardness-approximation-fixed-parameter-tractability/https://ac.tuwien.ac.at/publication/drawing-binary-tanglegrams-an-experimental-evaluation/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-binary-tanglegrams-an-experimental-evaluation/https://ac.tuwien.ac.at/publication/algorithms-for-multi-criteria-one-sided-boundary-labeling/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithms-for-multi-criteria-one-sided-boundary-labeling/https://ac.tuwien.ac.at/publication/boundary-labeling-with-octilinear-leaders/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/boundary-labeling-with-octilinear-leaders/https://ac.tuwien.ac.at/publication/consistent-digital-rays/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/consistent-digital-rays/https://ac.tuwien.ac.at/publication/cover-contact-graphs/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/cover-contact-graphs/https://ac.tuwien.ac.at/publication/morphing-polylines-a-step-towards-continuous-generalization/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/morphing-polylines-a-step-towards-continuous-generalization/https://ac.tuwien.ac.at/publication/optimizing-active-ranges-for-consistent-dynamic-map-labeling/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimizing-active-ranges-for-consistent-dynamic-map-labeling/https://ac.tuwien.ac.at/publication/improved-algorithms-for-length-minimal-one-sided-boundary-labeling/Thu, 01 Mar 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/improved-algorithms-for-length-minimal-one-sided-boundary-labeling/https://ac.tuwien.ac.at/publication/geographic-visualization/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/geographic-visualization/https://ac.tuwien.ac.at/publication/minimizing-intra-edge-crossings-in-wiring-diagrams-and-public-transportation-maps/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-intra-edge-crossings-in-wiring-diagrams-and-public-transportation-maps/https://ac.tuwien.ac.at/publication/morphing-polygonal-lines-a-step-towards-continuous-generalization/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/morphing-polygonal-lines-a-step-towards-continuous-generalization/https://ac.tuwien.ac.at/publication/a-mixed-integer-program-for-drawing-high-quality-metro-maps/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-mixed-integer-program-for-drawing-high-quality-metro-maps/https://ac.tuwien.ac.at/publication/automated-drawing-of-metro-maps/Mon, 01 Aug 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/automated-drawing-of-metro-maps/https://ac.tuwien.ac.at/publication/automated-drawing-of-metro-maps-2/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/automated-drawing-of-metro-maps-2/https://ac.tuwien.ac.at/publication/validation-in-the-cluster-analysis-of-gene-expression-data/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/validation-in-the-cluster-analysis-of-gene-expression-data/