Image de couverture de livre

Visualizing Treewidth

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chiu, Alvin, Depian, Thomas, Eppstein, David, Goodrich, Michael T., Nöllenburg, Martin
Format:	Preprint
Publié:	2025
Sujets:	Computational Geometry Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Peculiarities of Extending Queue Layouts
par: Depian, Thomas, et autres
Publié: (2025)

The Parameterized Complexity of Extending Stack Layouts
par: Depian, Thomas, et autres
Publié: (2024)

Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii
par: Depian, Thomas, et autres
Publié: (2026)

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
par: Eppstein, David
Publié: (2025)

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
par: Eppstein, David
Publié: (2023)

Maintaining Light Spanners via Minimal Updates
par: Khodabandeh, Hadi, et autres
Publié: (2024)

Computational Complexities of Folding
par: Eppstein, David
Publié: (2024)

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
par: Depian, Thomas, et autres
Publié: (2025)

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
par: Eppstein, David, et autres
Publié: (2025)

Sparse Outerstring Graphs Have Logarithmic Treewidth
par: An, Shinwoo, et autres
Publié: (2024)

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
par: Dobler, Alexander, et autres
Publié: (2024)

Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm
par: Goodrich, Michael T., et autres
Publié: (2024)

Zip-Tries: Simple Dynamic Data Structures for Strings
par: Eppstein, David, et autres
Publié: (2025)

A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
par: Cabello, Sergio, et autres
Publié: (2025)

Minimum Stable Cut and Treewidth
par: Lampis, Michael
Publié: (2021)

On Minimizing Wiggle in Stacked Area Charts
par: Dobler, Alexander, et autres
Publié: (2025)

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
par: Caroppo, Susanna, et autres
Publié: (2025)

k-SUM Hardness Implies Treewidth-SETH
par: Lampis, Michael
Publié: (2025)

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance
par: Gudmundsson, Joachim, et autres
Publié: (2022)

Sequential non-determinism in tile self-assembly: a general framework and an application to efficient temperature-1 self-assembly of squares
par: Furcy, David, et autres
Publié: (2024)

Simple Grid Polygon Online Exploration Revisited
par: Brock, Maximilian, et autres
Publié: (2024)

Feature-aware manifold meshing and remeshing of point clouds and polyhedral surfaces with guaranteed smallest edge length
par: Lipschütz, Henriette, et autres
Publié: (2023)

Optimized 2-Approximation of Treewidth
par: Belbasi, Mahdi, et autres
Publié: (2024)

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions
par: Herold, Martin G., et autres
Publié: (2025)

On the Complexity of the Ordered Covering Problem in Distance Geometry
par: Souza, Michael, et autres
Publié: (2025)

Parameterized Approximation of Rectangle Stabbing
par: Chu, Huairui, et autres
Publié: (2026)

Range Counting Oracles for Geometric Problems
par: Driemel, Anne, et autres
Publié: (2025)

On Planar Straight-Line Dominance Drawings
par: Angelini, Patrizio, et autres
Publié: (2025)

Weakly Leveled Planarity with Bounded Span
par: Bekos, Michael, et autres
Publié: (2024)

Spanning and Metric Tree Covers Parameterized by Treewidth
par: Elkin, Michael, et autres
Publié: (2025)

Can You Link Up With Treewidth?
par: Curticapean, Radu, et autres
Publié: (2024)

Residue Domination in Bounded-Treewidth Graphs
par: Greilhuber, Jakob, et autres
Publié: (2024)

Light Spanners with Small Hop-Diameter
par: Bhore, Sujoy, et autres
Publié: (2025)

Faster exponential algorithms for cut problems via geometric data structures
par: Kozma, László, et autres
Publié: (2025)

A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
par: Gusain, Rachana, et autres
Publié: (2025)

FPT Constant Approximation Algorithms for Colorful Sum of Radii
par: Liu, Shuilian, et autres
Publié: (2025)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
par: van der Hoog, Ivor, et autres
Publié: (2025)

Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs
par: Banik, Aritra, et autres
Publié: (2025)

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
par: Chan, Timothy M., et autres
Publié: (2025)

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
par: Bhore, Sujoy, et autres
Publié: (2025)