Saved in:
| Main Authors: | Komoto, Kenta, Kurita, Kazuhiro, Ono, Hirotaka |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.03436 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
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)
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)
Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
by: Kobayashi, Yasuaki, et al.
Published: (2023)
by: Kobayashi, Yasuaki, et al.
Published: (2023)
The Complexity of Maximal Common Subsequence Enumeration
by: Buzzega, Giovanni, et al.
Published: (2025)
by: Buzzega, Giovanni, et al.
Published: (2025)
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
by: Kobayashi, Yasuaki, et al.
Published: (2023)
by: Kobayashi, Yasuaki, et al.
Published: (2023)
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
by: Kurita, Kazuhiro, et al.
Published: (2025)
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)
by: Kurita, Kazuhiro, et al.
Published: (2022)
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)
Dichotomies for Tree Minor Containment with Structural Parameters
by: Gima, Tatsuya, et al.
Published: (2023)
by: Gima, Tatsuya, et al.
Published: (2023)
Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Weight Constraints
by: Kobayashi, Yasuaki, et al.
Published: (2020)
by: Kobayashi, Yasuaki, et al.
Published: (2020)
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
by: Conte, Alessio, et al.
Published: (2024)
by: Conte, Alessio, et al.
Published: (2024)
Finding One Local Optimum Is Easy -- but What About Two?
by: Kobayashi, Yasuaki, et al.
Published: (2025)
by: Kobayashi, Yasuaki, et al.
Published: (2025)
Fast and Optimal Differentially Private Frequent-Substring Mining
by: Guo, Peaker, et al.
Published: (2026)
by: Guo, Peaker, et al.
Published: (2026)
Sequentially Swapping Tokens: Further on Graph Classes
by: Kiya, Hironori, et al.
Published: (2022)
by: Kiya, Hironori, et al.
Published: (2022)
Computing diverse pair of solutions for tractable SAT
by: Gima, Tatsuya, et al.
Published: (2024)
by: Gima, Tatsuya, et al.
Published: (2024)
A Parameterized Complexity Analysis of Bounded Height Depth-first Search Trees
by: Jaffke, Lars, et al.
Published: (2025)
by: Jaffke, Lars, et al.
Published: (2025)
Streaming Maximal Matching with Bounded Deletions
by: Khanna, Sanjeev, et al.
Published: (2025)
by: Khanna, Sanjeev, et al.
Published: (2025)
Structural Parameterizations of Vertex Integrity
by: Gima, Tatsuya, et al.
Published: (2023)
by: Gima, Tatsuya, et al.
Published: (2023)
Advances in Exact and Approximate Group Closeness Centrality Maximization
by: Schulz, Christian, et al.
Published: (2026)
by: Schulz, Christian, et al.
Published: (2026)
An improved spectral lower bound of treewidth
by: Gima, Tatsuya, et al.
Published: (2024)
by: Gima, Tatsuya, et al.
Published: (2024)
Exploring Temporal Graphs with Frequent and Regular Edges
by: Adamson, Duncan
Published: (2025)
by: Adamson, Duncan
Published: (2025)
Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint
by: Hao, Yimin, et al.
Published: (2025)
by: Hao, Yimin, et al.
Published: (2025)
Height-bounded Lempel-Ziv encodings
by: Bannai, Hideo, et al.
Published: (2024)
by: Bannai, Hideo, et al.
Published: (2024)
Learning-Augmented Frequent Directions
by: Aamand, Anders, et al.
Published: (2025)
by: Aamand, Anders, et al.
Published: (2025)
Online Coloring for Graphs of Large Odd Girth
by: Yoneda, Hirotaka, et al.
Published: (2026)
by: Yoneda, Hirotaka, et al.
Published: (2026)
On Rotation Distance of Rank Bounded Trees
by: M., Anoop S. K., et al.
Published: (2023)
by: M., Anoop S. K., et al.
Published: (2023)
Structural Parameters for Steiner Orientation
by: Hanaka, Tesshu, et al.
Published: (2025)
by: Hanaka, Tesshu, et al.
Published: (2025)
Maximal Closed Substrings
by: Badkobeh, Golnaz, et al.
Published: (2022)
by: Badkobeh, Golnaz, et al.
Published: (2022)
Profit Maximization in Closed Social Networks
by: Sharma, Poonam, et al.
Published: (2026)
by: Sharma, Poonam, et al.
Published: (2026)
Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method
by: Huiberts, Sophie, et al.
Published: (2022)
by: Huiberts, Sophie, et al.
Published: (2022)
A Note On Deterministic Submodular Maximization With Bounded Curvature
by: Li, Wenxin
Published: (2024)
by: Li, Wenxin
Published: (2024)
Lower Bounds on Tree Covers
by: Chen, Yu, et al.
Published: (2025)
by: Chen, Yu, et al.
Published: (2025)
Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
by: Mendoza-Cadena, Mirabel, et al.
Published: (2026)
by: Mendoza-Cadena, Mirabel, et al.
Published: (2026)
Subsequences With Generalised Gap Constraints: Upper and Lower Complexity Bounds
by: Manea, Florin, et al.
Published: (2024)
by: Manea, Florin, et al.
Published: (2024)
On the Complexity of Telephone Broadcasting: From Cacti to Bounded Pathwidth Graphs
by: Aminian, Aida, et al.
Published: (2025)
by: Aminian, Aida, et al.
Published: (2025)
Heights of butterfly trees
by: Peca-Medlin, John, et al.
Published: (2025)
by: Peca-Medlin, John, et al.
Published: (2025)
Query Complexity of the Metric Steiner Tree Problem
by: Chen, Yu, et al.
Published: (2022)
by: Chen, Yu, et al.
Published: (2022)
Resilient Pattern Mining
by: Bian, Pengxin, et al.
Published: (2025)
by: Bian, Pengxin, et al.
Published: (2025)
Nearly Optimal Bounds for Computing Decision Tree Splits in Data Streams
by: Ta, Hoang, et al.
Published: (2026)
by: Ta, Hoang, et al.
Published: (2026)
Lower Bound Techniques in the Comparison-Query Model and Inversion Minimization on Trees
by: Hu, Ivan, et al.
Published: (2022)
by: Hu, Ivan, et al.
Published: (2022)
Similar Items
-
On the Complexity of Minimising the Moving Distance for Dispersing Objects
by: Honorato-Droguett, Nicolás, et al.
Published: (2025) -
Algorithms for Optimally Shifting Intervals under Intersection Graph Models
by: Honorato-Droguett, Nicolás, et al.
Published: (2023) -
Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
by: Kobayashi, Yasuaki, et al.
Published: (2023) -
The Complexity of Maximal Common Subsequence Enumeration
by: Buzzega, Giovanni, et al.
Published: (2025) -
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
by: Kobayashi, Yasuaki, et al.
Published: (2023)