Image de couverture de livre

Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Banik, Aritra, Parthasarathi, Mano Prakash, Raman, Venkatesh, Roy, Diya, Sahu, Abhishek
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
par: Banik, Aritra, et autres
Publié: (2024)

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2026)

Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
par: Banik, Aritra, et autres
Publié: (2025)

Hitting Axis-Parallel Segments with Weighted Points
par: Raman, Rajiv, et autres
Publié: (2026)

Computing Maximum Cliques in Unit Disk Graphs
par: Tkachenko, Anastasiia, et autres
Publié: (2025)

Computing Dominating Sets in Disk Graphs with Centers in Convex Position
par: Tkachenko, Anastasiia, et autres
Publié: (2026)

Computing Diameter +1 in Truly Subquadratic Time for Unit-Disk Graphs
par: Chang, Hsien-Chih, et autres
Publié: (2024)

Data Structures for Approximate Discrete Fréchet Distance
par: van der Hoog, Ivor, et autres
Publié: (2022)

Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher
par: Chan, Timothy M., et autres
Publié: (2026)

Data Structures for Range Sorted Consecutive Occurrence Queries
par: Akram, Waseem, et autres
Publié: (2024)

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions
par: Herold, Martin G., et autres
Publié: (2025)

Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations
par: Kar, Debajyoti, et autres
Publié: (2026)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
par: Bhore, Sujoy, et autres
Publié: (2026)

Fast Algorithms for Minimum Homology Basis
par: Dhar, Amritendu, et autres
Publié: (2021)

Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
par: Conradi, Jacobus, et autres
Publié: (2026)

On Computing Vertex Connectivity of 1-Plane Graphs
par: Biedl, Therese, et autres
Publié: (2022)

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
par: Bandopadhyay, Susobhan, et autres
Publié: (2026)

Better Diameter Algorithms for Bounded VC-dimension Graphs and Geometric Intersection Graphs
par: Duraj, Lech, et autres
Publié: (2023)

Computing Diverse and Nice Triangulations
par: Gálvez, Waldo, et autres
Publié: (2025)

Structure and Independence in Hyperbolic Uniform Disk Graphs
par: Bläsius, Thomas, et autres
Publié: (2024)

Dynamic Connectivity in Disk Graphs
par: Baumann, Alexander, et autres
Publié: (2021)

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
par: de Berg, Mark, et autres
Publié: (2026)

Algorithms for Computing Closest Points for Segments
par: Wang, Haitao
Publié: (2024)

Unit-length Rectangular Drawings of Graphs
par: Alegria, Carlos, et autres
Publié: (2022)

Clustered Planarity Variants for Level Graphs
par: Fink, Simon D., et autres
Publié: (2024)

Computing crossing numbers with topological and geometric restrictions
par: Hamm, Thekla, et autres
Publié: (2024)

A Task-Parallel Approach for Localized Topological Data Structures
par: Liu, Guoxi, et autres
Publié: (2023)

Conflict and Fairness in Resource Allocation
par: Bandopadhyay, Susobhan, et autres
Publié: (2024)

Sparse Outerstring Graphs Have Logarithmic Treewidth
par: An, Shinwoo, et autres
Publié: (2024)

Parameterized Geometric Graph Modification with Disk Scaling
par: Fomin, Fedor V., et autres
Publié: (2024)

Shortest Path Separators in Unit Disk Graphs
par: Harb, Elfarouk, et autres
Publié: (2024)

An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
par: Brewer, Bruce W., et autres
Publié: (2025)

Morphing Planar Graph Drawings Through 3D
par: Buchin, Kevin, et autres
Publié: (2022)

Ranking and Unranking of the Planar Embeddings of a Planar Graph
par: Di Battista, Giuseppe, et autres
Publié: (2024)

Computing largest minimum color-spanning intervals of imprecise points
par: Acharyya, Ankush, et autres
Publié: (2024)

Single-Source Shortest Path Problem in Weighted Disk Graphs
par: An, Shinwoo, et autres
Publié: (2025)

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
par: Marin, Malory, et autres
Publié: (2025)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
par: Brewer, Bruce W., et autres
Publié: (2024)

Maximum Independent Sets in Disk Graphs with Disks in Convex Position
par: Tkachenko, Anastasiia, et autres
Publié: (2026)

ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
par: An, Shinwoo, et autres
Publié: (2024)