Image de couverture de livre

Constrained Boundary Labeling

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Depian, Thomas, Nöllenburg, Martin, Terziadis, Soeren, Wallinger, Markus
Format:	Preprint
Publié:	2024
Sujets:	Computational Geometry Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Boundary Labeling in a Circular Orbit
par: Bonerath, Annika, et autres
Publié: (2024)

Transitions in Dynamic Point Labeling
par: Depian, Thomas, et autres
Publié: (2022)

Clarity and Computational Efficiency of Orbital Boundary Labeling
par: Wallinger, Markus, et autres
Publié: (2026)

Pathways to Tractability for Geometric Thickness
par: Depian, Thomas, et autres
Publié: (2024)

Realizing Planar Linkages in Polygonal Domains
par: Depian, Thomas, et autres
Publié: (2026)

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

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

Visualizing Treewidth
par: Chiu, Alvin, et autres
Publié: (2025)

Geometry Matters in Planar Storyplans
par: Dobler, Alexander, et autres
Publié: (2025)

Generalized minimum 0-extension problem and discrete convexity
par: Dvorak, Martin, et autres
Publié: (2021)

On Saxe's theorems about the complexity of the Distance Geometry Problem
par: Kupperschmitt, Maël, et autres
Publié: (2025)

Geometric Bipartite Matching is in NC
par: Bhore, Sujoy, et autres
Publié: (2024)

Complexity of 2D Snake Cube Puzzles
par: MIT Hardness Group, et autres
Publié: (2024)

Minimum Selective Subset on Some Graph Classes
par: Manna, Bubai
Publié: (2025)

On the complexity of embedding in graph products
par: Biedl, Therese, et autres
Publié: (2023)

Counting Triangulations of Fixed Cardinal Degrees
par: Chambers, Erin, et autres
Publié: (2025)

The Parameterized Complexity of Geometric 1-Planarity
par: Firbas, Alexander
Publié: (2026)

Push-1 is PSPACE-complete, and the automated verification of motion planning gadgets
par: DeStefano, Zachary, et autres
Publié: (2025)

Query-Efficient Fixpoints of $\ell_p$-Contractions
par: Haslebacher, Sebastian, et autres
Publié: (2025)

Tighter Bounds for the Randomized Polynomial-Time Simplex Algorithm for Linear Programming
par: Gibor, Daniel
Publié: (2025)

Freeze-Tag is NP-hard in 2D with $L_1$ distance
par: Silva, Lucas de Oliveira, et autres
Publié: (2025)

On the hardness of finding normal surfaces
par: Burton, Benjamin A., et autres
Publié: (2019)

Realizing Metric Spaces with Convex Obstacles
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2025)

Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons
par: Boomari, Hossein, et autres
Publié: (2018)

Minimum Selective Subset on Unit Disk Graphs and Circle Graphs
par: Manna, Bubai
Publié: (2025)

The Complexity of Drawing Graphs on Few Lines and Few Planes
par: Chaplick, Steven, et autres
Publié: (2016)

On the complexity of covering points by guillotine cuts
par: Garijo, Delia, et autres
Publié: (2026)

Saturated Drawings of Geometric Thickness k
par: Bachmann, Patricia, et autres
Publié: (2025)

Undecidability of Translational Tiling with Three Tiles
par: Yang, Chan, et autres
Publié: (2024)

Translational Aperiodic Sets of 7 Polyominoes
par: Yang, Chao, et autres
Publié: (2024)

The Borsuk number of a graph
par: Cáceres, José, et autres
Publié: (2026)

Simple Linear Loops: Algebraic Invariants and Applications
par: Manssour, Rida Ait El, et autres
Publié: (2024)

Determination Problems for Orbit Closures and Matrix Groups
par: Manssour, Rida Ait El, et autres
Publié: (2024)

Deterministic Depth-4 PIT and Normalization
par: Guo, Zeyu, et autres
Publié: (2025)

Improved Debordering of Waring Rank
par: Shpilka, Amir
Publié: (2025)

Optimizing Staircase Motifs in Biofabric Network Layouts
par: Sara Di Bartolomeo, et autres
Publié: (2025)

Computing $p$-presentation distances is hard
par: Bjerkevik, Håvard Bakke, et autres
Publié: (2024)

Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents
par: Borzechowski, Michaela, et autres
Publié: (2024)

Self-Assembly of Patterns in the abstract Tile Assembly Model
par: Drake, Phillip, et autres
Publié: (2024)

Complexity of Contextuality
par: Yianni, Theodoros, et autres
Publié: (2025)