Imagen de Portada

Zone Theorem for Arrangements in three dimensions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Saxena, Sanjeev
Formato:	Preprint
Publicado:	2020
Materias:	Computational Geometry Data Structures and Algorithms Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Duality between Lines and Points
por: Saxena, Sanjeev
Publicado: (2025)

Dominance for Containment Problems
por: Akram, Waseem, et al.
Publicado: (2022)

Top-k Stabbing Interval Queries
por: Akram, Waseem, et al.
Publicado: (2024)

Maximizing Weighted Dominance in the Plane
por: Akram, Waseem, et al.
Publicado: (2024)

On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and other applications
por: Filtser, Arnold
Publicado: (2024)

A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
por: Cabello, Sergio, et al.
Publicado: (2025)

On Computing Vertex Connectivity of 1-Plane Graphs
por: Biedl, Therese, et al.
Publicado: (2022)

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs
por: Galby, Esther, et al.
Publicado: (2023)

An Improved Upper Bound for the Euclidean TSP Constant Using Band Crossovers
por: Gaudio, Julia, et al.
Publicado: (2026)

A Maximum Linear Arrangement Problem on Directed Graphs
por: DeVos, Matt, et al.
Publicado: (2018)

Efficient Algorithms and Implementations for Extracting Maximum-Size $(k,\ell)$-Sparse Subgraphs
por: Madarasi, Péter
Publicado: (2025)

Implicit representations via the polynomial method
por: Cardinal, Jean, et al.
Publicado: (2026)

A New and Faster Representation for Counting Integer Points in Parametric Polyhedra
por: Gribanov, D., et al.
Publicado: (2023)

Quadratic-Time Algorithm for the Maximum-Weight $(k, \ell)$-Sparse Subgraph Problem
por: Deák, Bence, et al.
Publicado: (2025)

O(1)-Distortion Planar Emulators for String Graphs
por: Chang, Hsien-Chih, et al.
Publicado: (2025)

The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring
por: Inoue, Yuta, et al.
Publicado: (2026)

Extraction Theorems With Small Extraction Numbers
por: Agarwal, Arjun, et al.
Publicado: (2024)

On The Maximum Linear Arrangement Problem for Trees
por: Alemany-Puig, Lluís, et al.
Publicado: (2023)

Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching
por: Hougardy, Stefan, et al.
Publicado: (2024)

The Squishy Grid Problem
por: Cai, Zixi, et al.
Publicado: (2025)

On the Two Paths Theorem and the Two Disjoint Paths Problem
por: Humeau, Samuel, et al.
Publicado: (2025)

Simpler O(1) Query Algorithm for Level Ancestors
por: Saxena, Sanjeev
Publicado: (2022)

Flip Distance of Triangulations of Convex Polygons / Rotation Distance of Binary Trees is NP-complete
por: Dorfer, Joseph
Publicado: (2026)

Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra
por: Dakhno, Grigorii, et al.
Publicado: (2024)

Short circuit walks in fixed dimension
por: Black, Alexander E., et al.
Publicado: (2025)

Better Diameter Algorithms for Bounded VC-dimension Graphs and Geometric Intersection Graphs
por: Duraj, Lech, et al.
Publicado: (2023)

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
por: Chan, Timothy M., et al.
Publicado: (2025)

Trickle-down Theorems via C-Lorentzian Polynomials II: Pairwise Spectral Influence and Improved Dobrushin's Condition
por: Leake, Jonathan, et al.
Publicado: (2025)

Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences
por: Leake, Jonathan, et al.
Publicado: (2025)

A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Sorted Range Reporting and Range Minima Queries
por: Akram, Waseem, et al.
Publicado: (2021)

Efficient Reconfiguration of Tile Arrangements by a Single Active Robot
por: Becker, Aaron T., et al.
Publicado: (2025)

Unbent Collections of Orthogonal Drawings
por: Antić, Todor, et al.
Publicado: (2025)

Enumeration of minimal transversals of hypergraphs of bounded VC-dimension
por: Mary, Arnaud
Publicado: (2024)

Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
por: Jenssen, Matthew, et al.
Publicado: (2023)

Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing
por: Chakrabarty, Deeparnab, et al.
Publicado: (2024)

Scattering and Sparse Partitions, and their Applications
por: Filtser, Arnold
Publicado: (2020)

Rectangle Tiling Binary Arrays
por: Ghosal, Pratik, et al.
Publicado: (2020)

Dynamic and Streaming Algorithms for Union Volume Estimation
por: Bhore, Sujoy, et al.
Publicado: (2026)

Approximation Algorithms for Smallest Intersecting Balls
por: Zheng, Jiaqi, et al.
Publicado: (2024)