Imagen de Portada

Minimum Selective Subset on Some Graph Classes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Manna, Bubai
Formato:	Preprint
Publicado:	2025
Materias:	Computational Geometry Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Minimum Selective Subset on Unit Disk Graphs and Circle Graphs
por: Manna, Bubai
Publicado: (2025)

Minimum Consistent Subset in Interval Graphs and Circle Graphs
por: Manna, Bubai
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

The Parameterized Complexity of Geometric 1-Planarity
por: Firbas, Alexander
Publicado: (2026)

Constrained Boundary Labeling
por: Depian, Thomas, et al.
Publicado: (2024)

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

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

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

Subcoloring of (Unit) Disk Graphs
por: Marin, Malory, et al.
Publicado: (2025)

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

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

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

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

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

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

Improved Debordering of Waring Rank
por: Shpilka, Amir
Publicado: (2025)

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

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

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

Complexity of Contextuality
por: Yianni, Theodoros, et al.
Publicado: (2025)

Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings
por: Vu, Thi Xuan
Publicado: (2025)

An elementary proof that linking problems are hard
por: Cheng, Shannon, et al.
Publicado: (2025)

Computing $p$-presentation distances is hard
por: Bjerkevik, Håvard Bakke, et al.
Publicado: (2024)

Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents
por: Borzechowski, Michaela, et al.
Publicado: (2024)

On the complexity of Chow and Hurwitz forms
por: Doğan, Mahmut Levent, et al.
Publicado: (2022)

Self-Assembly of Patterns in the abstract Tile Assembly Model
por: Drake, Phillip, et al.
Publicado: (2024)