Saved in:
| Main Authors: | Honorato-Droguett, Nicolás, Kurita, Kazuhiro, Hanaka, Tesshu, Ono, Hirotaka, Wolff, Alexander |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.20903 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Algorithms for Optimally Shifting Intervals under Intersection Graph Models
by: Honorato-Droguett, Nicolás, et al.
Published: (2023)
by: Honorato-Droguett, Nicolás, et al.
Published: (2023)
On the Complexity of Minimising the Moving Distance for Dispersing Objects
by: Honorato-Droguett, Nicolás, et al.
Published: (2025)
by: Honorato-Droguett, Nicolás, et al.
Published: (2025)
Game-Theoretic and Algorithmic Analyses of Multi-Agent Routing under Crossing Costs
by: Hanaka, Tesshu, et al.
Published: (2026)
by: Hanaka, Tesshu, et al.
Published: (2026)
Finding a HIST: Chordality, Structural Parameters, and Diameter
by: Hanaka, Tesshu, et al.
Published: (2025)
by: Hanaka, Tesshu, et al.
Published: (2025)
On the complexity of finding a spanning even tree in a graph
by: Hanaka, Tesshu, et al.
Published: (2024)
by: Hanaka, Tesshu, et al.
Published: (2024)
Sparse Bounded Hop-Spanners for Geometric Intersection Graphs
by: Bhore, Sujoy, et al.
Published: (2025)
by: Bhore, Sujoy, et al.
Published: (2025)
Structural Parameters for Steiner Orientation
by: Hanaka, Tesshu, et al.
Published: (2025)
by: Hanaka, Tesshu, et al.
Published: (2025)
Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results
by: Dutta, Madhura, et al.
Published: (2025)
by: Dutta, Madhura, et al.
Published: (2025)
Finding a Minimum Spanning Tree with a Small Non-Terminal Set
by: Hanaka, Tesshu, et al.
Published: (2023)
by: Hanaka, Tesshu, et al.
Published: (2023)
An improved spectral lower bound of treewidth
by: Gima, Tatsuya, et al.
Published: (2024)
by: Gima, Tatsuya, et al.
Published: (2024)
Hop-Spanners for Geometric Intersection Graphs
by: Conroy, Jonathan B., et al.
Published: (2021)
by: Conroy, Jonathan B., et al.
Published: (2021)
Approximating Densest Subgraph in Geometric Intersection Graphs
by: Har-Peled, Sariel, et al.
Published: (2024)
by: Har-Peled, Sariel, et al.
Published: (2024)
Core Stability in Additively Separable Hedonic Games of Low Treewidth
by: Hanaka, Tesshu, et al.
Published: (2024)
by: Hanaka, Tesshu, et al.
Published: (2024)
Hedonic Seat Arrangement Problems
by: Bodlaender, Hans L., et al.
Published: (2020)
by: Bodlaender, Hans L., et al.
Published: (2020)
Structural Parameterizations of Vertex Integrity
by: Gima, Tatsuya, et al.
Published: (2023)
by: Gima, Tatsuya, et al.
Published: (2023)
On the Complexity of Secluded Path Problems
by: Hanaka, Tesshu, et al.
Published: (2026)
by: Hanaka, Tesshu, et al.
Published: (2026)
Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
by: Marin, Malory, et al.
Published: (2025)
by: Marin, Malory, et al.
Published: (2025)
The Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees
by: Komoto, Kenta, et al.
Published: (2026)
by: Komoto, Kenta, et al.
Published: (2026)
Better Diameter Algorithms for Bounded VC-dimension Graphs and Geometric Intersection Graphs
by: Duraj, Lech, et al.
Published: (2023)
by: Duraj, Lech, et al.
Published: (2023)
Maximum Matchings in Geometric Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2019)
by: Bonnet, Édouard, et al.
Published: (2019)
On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
by: Bhore, Sujoy, et al.
Published: (2025)
by: Bhore, Sujoy, et al.
Published: (2025)
Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
by: Kisfaludi-Bak, Sándor, et al.
Published: (2026)
by: Kisfaludi-Bak, Sándor, et al.
Published: (2026)
Small Independent Sets versus Small Separator in Geometric Intersection Graphs
by: Marin, Malory, et al.
Published: (2026)
by: Marin, Malory, et al.
Published: (2026)
Visualization of Event Graphs for Train Schedules
by: Hartleb, Johann, et al.
Published: (2025)
by: Hartleb, Johann, et al.
Published: (2025)
Further Connectivity Results on Plane Spanning Path Reconfiguration
by: Boucard, Valentino, et al.
Published: (2024)
by: Boucard, Valentino, et al.
Published: (2024)
Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher
by: Chan, Timothy M., et al.
Published: (2026)
by: Chan, Timothy M., et al.
Published: (2026)
Parameterized Vertex Integrity Revisited
by: Hanaka, Tesshu, et al.
Published: (2024)
by: Hanaka, Tesshu, et al.
Published: (2024)
Recognizing 2-Layer and Outer $k$-Planar Graphs
by: Kobayashi, Yasuaki, et al.
Published: (2024)
by: Kobayashi, Yasuaki, et al.
Published: (2024)
The Complexity of Drawing Graphs on Few Lines and Few Planes
by: Chaplick, Steven, et al.
Published: (2016)
by: Chaplick, Steven, et al.
Published: (2016)
Computing the Girth of a Segment Intersection Graph
by: Chan, Timothy M., et al.
Published: (2026)
by: Chan, Timothy M., et al.
Published: (2026)
Eliminating Crossings in Ordered Graphs
by: Agrawal, Akanksha, et al.
Published: (2024)
by: Agrawal, Akanksha, et al.
Published: (2024)
Adjacency Graphs of Polyhedral Surfaces
by: Arseneva, Elena, et al.
Published: (2021)
by: Arseneva, Elena, et al.
Published: (2021)
Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs
by: van der Hoog, Ivor, et al.
Published: (2024)
by: van der Hoog, Ivor, et al.
Published: (2024)
Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
by: Chan, Timothy M., et al.
Published: (2026)
by: Chan, Timothy M., et al.
Published: (2026)
Grounded String Representations of Series-Parallel Graphs without Transitive Edges
by: Cornelsen, Sabine, et al.
Published: (2026)
by: Cornelsen, Sabine, et al.
Published: (2026)
Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations
by: Firman, Oksana, et al.
Published: (2024)
by: Firman, Oksana, et al.
Published: (2024)
Morphing Graph Drawings in the Presence of Point Obstacles
by: Firman, Oksana, et al.
Published: (2023)
by: Firman, Oksana, et al.
Published: (2023)
Intersection Graphs with and without Product Structure
by: Merker, Laura, et al.
Published: (2024)
by: Merker, Laura, et al.
Published: (2024)
Star-Based Separators for Intersection Graphs of $c$-Colored Pseudo-Segments
by: de Berg, M., et al.
Published: (2025)
by: de Berg, M., et al.
Published: (2025)
On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects
by: Chan, Timothy M., et al.
Published: (2024)
by: Chan, Timothy M., et al.
Published: (2024)
Similar Items
-
Algorithms for Optimally Shifting Intervals under Intersection Graph Models
by: Honorato-Droguett, Nicolás, et al.
Published: (2023) -
On the Complexity of Minimising the Moving Distance for Dispersing Objects
by: Honorato-Droguett, Nicolás, et al.
Published: (2025) -
Game-Theoretic and Algorithmic Analyses of Multi-Agent Routing under Crossing Costs
by: Hanaka, Tesshu, et al.
Published: (2026) -
Finding a HIST: Chordality, Structural Parameters, and Diameter
by: Hanaka, Tesshu, et al.
Published: (2025) -
On the complexity of finding a spanning even tree in a graph
by: Hanaka, Tesshu, et al.
Published: (2024)