Block crossings in one-sided tanglegrams

DOI10.1007/978-3-031-38906-1_25arXiv2305.04682OpenAlexW4385317099MaRDI QIDQ6179427

Alexander Dobler, Martin Nöllenburg

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.04682

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Comparing trees via crossing minimization
• Drawing (complete) binary tanglegrams
• Optimal leaf ordering of complete binary trees
• A simpler and faster 1.5-approximation algorithm for sorting by transpositions
• Bundled Crossings in Embedded Graphs
• The Bundled Crossing Number
• Sorting by Transpositions Is Difficult
• A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
• Sorting by Transpositions
• Crossing Layout in Non-planar Graph Drawings
• Ordering Metro Lines by Block Crossings
• Drawing Binary Tanglegrams: An Experimental Evaluation
• APPROXIMATE BLOCK SORTING
• Block Crossings in Storyline Visualizations
• Sorting a bridge hand

This page was built for publication: Block crossings in one-sided tanglegrams