:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Honorato-Droguett, Nicolás, Kurita, Kazuhiro, Hanaka, Tesshu, Ono, Hirotaka
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2502.12903
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)

On the complexity of finding a spanning even tree in a graph
by: Hanaka, Tesshu, et al.
Published: (2024)

On the Complexity of Secluded Path Problems
by: Hanaka, Tesshu, et al.
Published: (2026)

The Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees
by: Komoto, Kenta, et al.
Published: (2026)

An improved spectral lower bound of treewidth
by: Gima, Tatsuya, et al.
Published: (2024)

Structural Parameterizations of Vertex Integrity
by: Gima, Tatsuya, et al.
Published: (2023)

Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion
by: Honorato-Droguett, Nicolás, et al.
Published: (2025)

Structural Parameters for Steiner Orientation
by: Hanaka, Tesshu, et al.
Published: (2025)

Finding a Minimum Spanning Tree with a Small Non-Terminal Set
by: Hanaka, Tesshu, et al.
Published: (2023)

Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
by: Kobayashi, Yasuaki, et al.
Published: (2023)

Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited
by: Hanaka, Tesshu, et al.
Published: (2025)

Parameterized Vertex Integrity Revisited
by: Hanaka, Tesshu, et al.
Published: (2024)

Core Stability in Additively Separable Hedonic Games of Low Treewidth
by: Hanaka, Tesshu, et al.
Published: (2024)

Hedonic Seat Arrangement Problems
by: Bodlaender, Hans L., et al.
Published: (2020)

On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
by: Kurita, Kazuhiro, et al.
Published: (2025)

An Approximation Algorithm for $K$-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints
by: Kurita, Kazuhiro, et al.
Published: (2022)

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Weight Constraints
by: Kobayashi, Yasuaki, et al.
Published: (2020)

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
by: Kobayashi, Yasuaki, et al.
Published: (2023)

The Complexity of Maximal Common Subsequence Enumeration
by: Buzzega, Giovanni, et al.
Published: (2025)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
by: Conte, Alessio, et al.
Published: (2024)

Finding One Local Optimum Is Easy -- but What About Two?
by: Kobayashi, Yasuaki, et al.
Published: (2025)

Broadcasting under Structural Restrictions
by: Egami, Yudai, et al.
Published: (2025)

Dichotomies for Tree Minor Containment with Structural Parameters
by: Gima, Tatsuya, et al.
Published: (2023)

Sequentially Swapping Tokens: Further on Graph Classes
by: Kiya, Hironori, et al.
Published: (2022)

Computing diverse pair of solutions for tractable SAT
by: Gima, Tatsuya, et al.
Published: (2024)

Online Coloring for Graphs of Large Odd Girth
by: Yoneda, Hirotaka, et al.
Published: (2026)

Dimensionality Reduction on Complex Vector Spaces for Euclidean Distance with Dynamic Weights
by: Moretti, Simone, et al.
Published: (2022)

Graph Partitioning With Limited Moves
by: Behbahani, Majid, et al.
Published: (2024)

Optimal-Time Move Structure Construction
by: Brown, Nathaniel K., et al.
Published: (2026)

On the Complexity of the Ordered Covering Problem in Distance Geometry
by: Souza, Michael, et al.
Published: (2025)

Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime
by: Kociumaka, Tomasz, et al.
Published: (2025)

Hamming Distance Oracle
by: Boneh, Itai, et al.
Published: (2024)

Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance
by: Das, Debarati, et al.
Published: (2025)

RLZ-r and LZ-End-r: Enhancing Move-r
by: Dinklage, Patrick, et al.
Published: (2025)

Many Flavors of Edit Distance
by: Bhattacharya, Sudatta, et al.
Published: (2024)

Distributed Distance Sensitivity Oracles
by: Manoharan, Vignesh, et al.
Published: (2024)

Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations
by: Brown, Nathaniel K., et al.
Published: (2026)

Max-Min Diversification with Asymmetric Distances
by: Kumpulainen, Iiro, et al.
Published: (2025)

Fully Dynamic Algorithms for Chamfer Distance
by: Goranci, Gramoz, et al.
Published: (2025)

On Rotation Distance of Rank Bounded Trees
by: M., Anoop S. K., et al.
Published: (2023)