Dynamic parameterized problems on unit disk graphs
Fuente:
arXiv
Saved in:
| Main Authors: | An, Shinwoo, Cho, Kyungjin, Jang, Leo, Jung, Byeonghyeon, Lee, Yudam, Oh, Eunjin, Shin, Donghun, Shin, Hyeonjun, Song, Chanho |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs
by: An, Shinwoo, et al.
Published: (2024)
by: An, Shinwoo, et al.
Published: (2024)
ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
by: An, Shinwoo, et al.
Published: (2024)
by: An, Shinwoo, et al.
Published: (2024)
Single-Source Shortest Path Problem in Weighted Disk Graphs
by: An, Shinwoo, et al.
Published: (2025)
by: An, Shinwoo, et al.
Published: (2025)
Sparse Outerstring Graphs Have Logarithmic Treewidth
by: An, Shinwoo, et al.
Published: (2024)
by: An, Shinwoo, et al.
Published: (2024)
Mimicking Networks for Constrained Multicuts in Hypergraphs
by: Cho, Kyungjin, et al.
Published: (2024)
by: Cho, Kyungjin, et al.
Published: (2024)
Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
by: Park, Seongbin, et al.
Published: (2026)
by: Park, Seongbin, et al.
Published: (2026)
Range Counting Oracles for Geometric Problems
by: Driemel, Anne, et al.
Published: (2025)
by: Driemel, Anne, et al.
Published: (2025)
Touring a Sequence of Orthogonal Polygons
by: Casel, Katrin, et al.
Published: (2026)
by: Casel, Katrin, et al.
Published: (2026)
A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
by: de Berg, Sarita, et al.
Published: (2026)
by: de Berg, Sarita, et al.
Published: (2026)
Visibility Queries in Simple Polygons
by: Bhore, Sujoy, et al.
Published: (2026)
by: Bhore, Sujoy, et al.
Published: (2026)
Liar's vertex-edge domination in unit disk graph
by: Bhattacharya, Debojyoti, et al.
Published: (2025)
by: Bhattacharya, Debojyoti, et al.
Published: (2025)
Local Routing on Ordered $Θ$-graphs
by: van Renssen, André, et al.
Published: (2025)
by: van Renssen, André, et al.
Published: (2025)
Finding maximum matchings in RDV graphs efficiently
by: Biedl, Therese, et al.
Published: (2024)
by: Biedl, Therese, et al.
Published: (2024)
An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
by: An, Shinwoo, et al.
Published: (2025)
by: An, Shinwoo, et al.
Published: (2025)
A face cover perspective to $\ell_1$ embeddings of planar graphs
by: Filtser, Arnold
Published: (2019)
by: Filtser, Arnold
Published: (2019)
Spanner for the $0/1/\infty$ weighted region problem
by: Gudmundsson, Joachim, et al.
Published: (2024)
by: Gudmundsson, Joachim, et al.
Published: (2024)
Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius
by: Berthe, Gaétan, et al.
Published: (2023)
by: Berthe, Gaétan, et al.
Published: (2023)
Faster exponential algorithms for cut problems via geometric data structures
by: Kozma, László, et al.
Published: (2025)
by: Kozma, László, et al.
Published: (2025)
Dynamic Connectivity in Disk Graphs
by: Baumann, Alexander, et al.
Published: (2021)
by: Baumann, Alexander, et al.
Published: (2021)
Heisenberg-limited Hamiltonian learning without short-time control
by: Shin, Myeongjin, et al.
Published: (2026)
by: Shin, Myeongjin, et al.
Published: (2026)
Dynamic Unit-Disk Range Reporting
by: Wang, Haitao, et al.
Published: (2024)
by: Wang, Haitao, et al.
Published: (2024)
Dynamic Convex Hulls for Simple Paths
by: Brewer, Bruce, et al.
Published: (2024)
by: Brewer, Bruce, et al.
Published: (2024)
Engineering Fully Dynamic Convex Hulls
by: van der Hoog, Ivor, et al.
Published: (2026)
by: van der Hoog, Ivor, et al.
Published: (2026)
Dynamic Light Spanners in Doubling Metrics
by: Bhore, Sujoy, et al.
Published: (2026)
by: Bhore, Sujoy, et al.
Published: (2026)
Dynamic and Streaming Algorithms for Union Volume Estimation
by: Bhore, Sujoy, et al.
Published: (2026)
by: Bhore, Sujoy, et al.
Published: (2026)
Dynamic Locality Sensitive Orderings in Doubling Metrics
by: La, An, et al.
Published: (2024)
by: La, An, et al.
Published: (2024)
Dynamically Maintaining the Persistent Homology of Time Series
by: di Montesano, Sebastiano Cultrera, et al.
Published: (2023)
by: di Montesano, Sebastiano Cultrera, et al.
Published: (2023)
Facility Location on High-dimensional Euclidean Spaces
by: Lee, Euiwoong, et al.
Published: (2025)
by: Lee, Euiwoong, et al.
Published: (2025)
Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
by: Bhore, Sujoy, et al.
Published: (2024)
by: Bhore, Sujoy, et al.
Published: (2024)
Internal versus external balancing in the evaluation of graph-based number types
by: Geppert, Hanna, et al.
Published: (2019)
by: Geppert, Hanna, et al.
Published: (2019)
Efficient parameterized approximation
by: Kratsch, Stefan, et al.
Published: (2025)
by: Kratsch, Stefan, et al.
Published: (2025)
The Power of Recursive Embeddings for $\ell_p$ Metrics
by: Krauthgamer, Robert, et al.
Published: (2025)
by: Krauthgamer, Robert, et al.
Published: (2025)
Fast Nearest Neighbor Search for $\ell_p$ Metrics
by: Krauthgamer, Robert, et al.
Published: (2026)
by: Krauthgamer, Robert, et al.
Published: (2026)
Approximation Algorithms for Smallest Intersecting Balls
by: Zheng, Jiaqi, et al.
Published: (2024)
by: Zheng, Jiaqi, et al.
Published: (2024)
Light Spanners with Small Hop-Diameter
by: Bhore, Sujoy, et al.
Published: (2025)
by: Bhore, Sujoy, et al.
Published: (2025)
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
by: Depian, Thomas, et al.
Published: (2025)
by: Depian, Thomas, et al.
Published: (2025)
A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
by: Gusain, Rachana, et al.
Published: (2025)
by: Gusain, Rachana, et al.
Published: (2025)
Counting Unit Circular Arc Intersections
by: Wang, Haitao
Published: (2026)
by: Wang, Haitao
Published: (2026)
Optimal-Cost Construction of Shallow Cuttings for 3-D Dominance Ranges in the I/O-Model
by: Nekrich, Yakov, et al.
Published: (2026)
by: Nekrich, Yakov, et al.
Published: (2026)
Upward-Planar Drawings with Bounded Span
by: Angelini, Patrizio, et al.
Published: (2026)
by: Angelini, Patrizio, et al.
Published: (2026)
Similar Items
-
Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs
by: An, Shinwoo, et al.
Published: (2024) -
ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
by: An, Shinwoo, et al.
Published: (2024) -
Single-Source Shortest Path Problem in Weighted Disk Graphs
by: An, Shinwoo, et al.
Published: (2025) -
Sparse Outerstring Graphs Have Logarithmic Treewidth
by: An, Shinwoo, et al.
Published: (2024) -
Mimicking Networks for Constrained Multicuts in Hypergraphs
by: Cho, Kyungjin, et al.
Published: (2024)