Image de couverture de livre

Transitions in Dynamic Point Labeling

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Depian, Thomas, Li, Guangping, Nöllenburg, Martin, Wulms, Jules
Format:	Preprint
Publié:	2022
Sujets:	Computational Geometry Computational Complexity F.1.3; I.3.5
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Explicit Commutative ROABPs from Partial Derivatives
par: Bhargava, Vishwas, et autres
Publié: (2024)

Constrained Boundary Labeling
par: Depian, Thomas, et autres
Publié: (2024)

On bounded depth proofs for Tseitin formulas on the grid; revisited
par: Håstad, Johan, et autres
Publié: (2022)

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
par: Conneryd, Jonas, et autres
Publié: (2025)

Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
par: de Rezende, Susanna F., et autres
Publié: (2026)

Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients
par: de Rezende, Susanna F., et autres
Publié: (2024)

Supercritical Tradeoffs for Monotone Circuits
par: Göös, Mika, et autres
Publié: (2024)

Greedy Spanners in Euclidean Spaces Admit Sublinear Separators
par: Le, Hung, et autres
Publié: (2021)

Optimizing Visibility-based Search in Polygonal Domains
par: Huynh, Kien C., et autres
Publié: (2024)

Geometric Give and Take
par: Aichholzer, Oswin, et autres
Publié: (2026)

The Voronoi Diagram of Four Lines in $\mathbb{R}^3$
par: Papadopoulou, Evanthia, et autres
Publié: (2026)

Homogeneous Algebraic Complexity Theory and Algebraic Formulas
par: Dutta, Pranjal, et autres
Publié: (2023)

Improving Angular Speed Uniformity by Piecewise Radical Reparameterization
par: Hong, Hoon, et autres
Publié: (2024)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
par: de Rezende, Susanna F., et autres
Publié: (2019)

Problems from Optimization and Computational Algebra Equivalent to Hilbert's Nullstellensatz
par: Bläser, Markus, et autres
Publié: (2025)

L is different from NP
par: Montoya, J. Andres
Publié: (2024)

Separation Results for Constant-Depth and Multilinear Ideal Proof Systems
par: Behera, Amik Raj, et autres
Publié: (2026)

Completing the Complexity Classification of 2-Solo Chess: Knights and Kings are Hard
par: Kühn, Kolja, et autres
Publié: (2026)

Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting
par: Hemaspaandra, Lane A., et autres
Publié: (2021)

Disjunctive Complexity
par: Ivanov, Nikita, et autres
Publié: (2025)

Hausdorff Reductions and the Exponential Hierarchies
par: Malizia, Enrico
Publié: (2024)

Understanding Robust Catalytic Computing
par: Koucký, Michal, et autres
Publié: (2026)

Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays
par: Paoluzzi, Alberto, et autres
Publié: (2019)

The Rectilinear Marco Polo Problem
par: Gila, Ofek, et autres
Publié: (2025)

Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations
par: Antonelli, Melissa, et autres
Publié: (2025)

Complexity Classes Arising from Circuits over Finite Algebraic Structures
par: Kawałek, Piotr, et autres
Publié: (2026)

A technique for solving the polygon inclusion problems
par: Jin, Kai, et autres
Publié: (2017)

Constraints Matrices and Convergence Proof of TPMS2STEP
par: Zhao, Yaonaiming, et autres
Publié: (2024)

Translating TPMS models to STEP files
par: Zhao, Yaonaiming, et autres
Publié: (2024)

Fixed-parameter debordering of Waring rank
par: Dutta, Pranjal, et autres
Publié: (2024)

Apictorial Jigsaw Puzzle Reconstruction Based on Curve Matching via a Corotational Beam Spline
par: Orynyak, Igor, et autres
Publié: (2025)

A point to set principle for finite-state dimension
par: Mayordomo, Elvira
Publié: (2022)

Catalytic Computing and Register Programs Beyond Log-Depth
par: Alekseev, Yaroslav, et autres
Publié: (2025)

Reachability with Restricted Reactions in Inhibitory Chemical Reaction Networks
par: Bajaj, Divya, et autres
Publié: (2026)

Computational Complexity of Polynomial Subalgebras
par: Kayser, Leonie
Publié: (2025)

Structure of sparse Boolean functions over Abelian groups, and its application to testing
par: Chakraborty, Sourav, et autres
Publié: (2024)

Parametric/direct CAD integration
par: Zou, Qiang
Publié: (2022)

Analyzing Time-Varying Scalar Fields using Piecewise-Linear Morse-Cerf Theory
par: Dhar, Amritendu, et autres
Publié: (2025)

Imperative process algebra and models of computation
par: Middelburg, C. A.
Publié: (2022)

Graph Neural Networks and Arithmetic Circuits
par: Barlag, Timon, et autres
Publié: (2024)