Cover Image

Witness Set: A Visibility Problem in $NP\cap XP$

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jana, Satyabrata, Pal, Debabrata, Roy, Bodhayan, Roy, Sasanka
Format:	Preprint
Published:	2026
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Witness Set in Monotone Polygons: Exact and Approximate
by: Das, Udvas, et al.
Published: (2025)

On Approximating the Dynamic and Discrete Network Flow Problem
by: Manna, Bubai, et al.
Published: (2024)

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
by: Banik, Aritra, et al.
Published: (2024)

Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results
by: Dutta, Madhura, et al.
Published: (2025)

Maximum Cut on Interval Graphs of Interval Count Two is NP-complete
by: Barsukov, Alexey, et al.
Published: (2022)

Multipacking in Euclidean Metric Space
by: Das, Arun Kumar, et al.
Published: (2024)

The Euclidean $k$-Matching Problem is NP-hard
by: Díaz-Báñez, José-Miguel, et al.
Published: (2025)

Closed cap condition under the cap construction algorithm
by: Sandu, Mercedes, et al.
Published: (2022)

Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network
by: Manna, Bubai, et al.
Published: (2024)

The Mutual Visibility Problem for Fat Robots with Lights
by: Alsaedi, Rusul J., et al.
Published: (2022)

NP-hardness and a PTAS for the Euclidean Steiner Line Problem
by: Bartlmae, Simon, et al.
Published: (2024)

Small symplectic caps and embeddings of homology balls in the complex projective plane
by: Etnyre, John B., et al.
Published: (2023)

Covering Simple Orthogonal Polygons with Rectangles
by: Roy, Aniket Basu
Published: (2024)

The Zarankiewicz Problem for Polygon Visibility Graphs
by: Ackerman, Eyal, et al.
Published: (2025)

Asymmetric Separation Problem for Bichromatic Point Set
by: Maji, Sukanya, et al.
Published: (2024)

NP-completeness of Tiling Finite Simply Connected Regions with a Fixed Set of Wang Tiles
by: Yang, Chao, et al.
Published: (2024)

Multivariate Exploration of Metric Dilation
by: Banik, Aritra, et al.
Published: (2025)

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
by: Gálvez, Waldo, et al.
Published: (2025)

Geometric Criteria for 6-Functor Formalisms in the Setting of Pullback Formalisms
by: Magen, Roy
Published: (2025)

Subset Selection Problems in Planar Point Sets
by: Balogh, József, et al.
Published: (2024)

Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs
by: Werner, Peter, et al.
Published: (2023)

Dominating Set, Independent Set, Discrete $k$-Center, Dispersion, and Related Problems for Planar Points in Convex Position
by: Tkachenko, Anastasiia, et al.
Published: (2024)

New Lower Bound and Algorithms for Online Geometric Hitting Set Problem
by: De, Minati, et al.
Published: (2024)

Freeze-Tag is NP-hard in 2D with $L_1$ distance
by: Silva, Lucas de Oliveira, et al.
Published: (2025)

Min-1-Planarity is NP-Hard
by: Okada, Yuto
Published: (2026)

Computing the EHZ capacity is NP-hard
by: Leipold, Karla, et al.
Published: (2024)

VF-Plan: Bridging the Art Gallery Problem and Static LiDAR Scanning with Visibility Field Optimization
by: Xiong, Biao, et al.
Published: (2025)

M-Guarding in K-Visibility
by: Bahoo, Yeganeh, et al.
Published: (2025)

Empirical Analysis Of Heuristic and Approximation Algorithms for the The Mutual-Visibility Problem
by: Stojanović, Vanja, et al.
Published: (2025)

Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons
by: Boomari, Hossein, et al.
Published: (2018)

Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
by: Bjerkevik, Håvard Bakke, et al.
Published: (2026)

Optimizing Symbol Visibility through Displacement
by: Gärtner, Bernd, et al.
Published: (2023)

Shortest Paths of Mutually Visible Robots
by: Alsaedi, Rusul J., et al.
Published: (2023)

On $NP \cap coNP$ proof complexity generators
by: Krajicek, Jan
Published: (2025)

Contiguous Allocation of Indivisible Items on a Path
by: Kawase, Yasushi, et al.
Published: (2024)

BlockSets: A Structured Visualization for Sets with Large Elements
by: Novakova, Neda, et al.
Published: (2025)

An Efficient Solution to the 2D Visibility Problem in Cartesian Grid Maps and its Application in Heuristic Path Planning
by: Ibrahim, Ibrahim, et al.
Published: (2024)

Fast Witness Persistence for MRI Volumes via Hybrid Landmarking
by: Williams, Jorge Leonardo Ruiz
Published: (2025)

The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem
by: Meijer, Lucas, et al.
Published: (2026)

Generalized k-Cell Decomposition for Visibility Planning in Polygons
by: Bahoo, Yeganeh, et al.
Published: (2025)