:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Manna, Bubai
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry Computational Complexity
Online Access:	https://arxiv.org/abs/2510.01931
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Minimum Selective Subset on Some Graph Classes
by: Manna, Bubai
Published: (2025)

Minimum Consistent Subset in Interval Graphs and Circle Graphs
by: Manna, Bubai
Published: (2024)

Minimum Strict Consistent Subset in Paths, Spiders, Combs and Trees
by: Manna, Bubai
Published: (2024)

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

Subcoloring of (Unit) Disk Graphs
by: Marin, Malory, 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)

The Complexity of Drawing Graphs on Few Lines and Few Planes
by: Chaplick, Steven, et al.
Published: (2016)

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

Universal Solvability for Robot Motion Planning on Graphs
by: Dhar, Anubhav, et al.
Published: (2025)

Recognizing 2-Layer and Outer $k$-Planar Graphs
by: Kobayashi, Yasuaki, et al.
Published: (2024)

On Saxe's theorems about the complexity of the Distance Geometry Problem
by: Kupperschmitt, Maël, et al.
Published: (2025)

Counting Triangulations of Fixed Cardinal Degrees
by: Chambers, Erin, et al.
Published: (2025)

Push-1 is PSPACE-complete, and the automated verification of motion planning gadgets
by: DeStefano, Zachary, et al.
Published: (2025)

Query-Efficient Fixpoints of $\ell_p$-Contractions
by: Haslebacher, Sebastian, et al.
Published: (2025)

Tighter Bounds for the Randomized Polynomial-Time Simplex Algorithm for Linear Programming
by: Gibor, Daniel
Published: (2025)

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

Realizing Metric Spaces with Convex Obstacles
by: Kisfaludi-Bak, Sándor, et al.
Published: (2025)

On the complexity of embedding in graph products
by: Biedl, Therese, et al.
Published: (2023)

Geometric Bipartite Matching is in NC
by: Bhore, Sujoy, et al.
Published: (2024)

Complexity of 2D Snake Cube Puzzles
by: MIT Hardness Group, et al.
Published: (2024)

The Parameterized Complexity of Geometric 1-Planarity
by: Firbas, Alexander
Published: (2026)

Constrained Boundary Labeling
by: Depian, Thomas, et al.
Published: (2024)

On the hardness of finding normal surfaces
by: Burton, Benjamin A., et al.
Published: (2019)

Pathways to Tractability for Geometric Thickness
by: Depian, Thomas, et al.
Published: (2024)

On the complexity of covering points by guillotine cuts
by: Garijo, Delia, et al.
Published: (2026)

On $[1,2]$-Domination in Interval and Circle Graphs
by: Meybodi, Mohsen Alambardar, et al.
Published: (2024)

Undecidability of Translational Tiling with Three Tiles
by: Yang, Chan, et al.
Published: (2024)

Translational Aperiodic Sets of 7 Polyominoes
by: Yang, Chao, et al.
Published: (2024)

Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs
by: Nederlof, Jesper, et al.
Published: (2023)

$O(1)$-Round MPC Algorithms for Multi-dimensional Grid Graph Connectivity, EMST and DBSCAN
by: Gan, Junhao, et al.
Published: (2025)

One-way Communication Complexity of Minimum Vertex Cover in General Graphs
by: Derakhshan, Mahsa, et al.
Published: (2025)

Shortest Paths in Geodesic Unit-Disk Graphs
by: Brewer, Bruce W., et al.
Published: (2026)

On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
by: Emmerich, Michael T. M., et al.
Published: (2026)

The Borsuk number of a graph
by: Cáceres, José, et al.
Published: (2026)

Deterministic Depth-4 PIT and Normalization
by: Guo, Zeyu, et al.
Published: (2025)

Improved Debordering of Waring Rank
by: Shpilka, Amir
Published: (2025)

Complexity of Paired Domination Problems on Circle and $k$-Polygon Graphs
by: Mu, Ta-Yu, et al.
Published: (2024)

Simple Linear Loops: Algebraic Invariants and Applications
by: Manssour, Rida Ait El, et al.
Published: (2024)

Generalized minimum 0-extension problem and discrete convexity
by: Dvorak, Martin, et al.
Published: (2021)

Determination Problems for Orbit Closures and Matrix Groups
by: Manssour, Rida Ait El, et al.
Published: (2024)