Finding Order-Preserving Subgraphs
Fuente:
arXiv
Saved in:
| Main Authors: | Imamura, Haruya, Kobayashi, Yasuaki, Otachi, Yota, Saitoh, Toshiki, Sato, Keita, Takaoka, Asahi, Yoshinaka, Ryo, van der Zanden, Tom C. |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Forcing a unique minimum spanning tree and a unique shortest path
by: Gima, Tatsuya, et al.
Published: (2025)
by: Gima, Tatsuya, et al.
Published: (2025)
Finding Induced Subgraphs from Graphs with Small Mim-Width
by: Otachi, Yota, et al.
Published: (2024)
by: Otachi, Yota, et al.
Published: (2024)
Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited
by: Hanaka, Tesshu, et al.
Published: (2025)
by: Hanaka, Tesshu, et al.
Published: (2025)
Spanning tree congestion of proper interval graphs
by: Otachi, Yota
Published: (2026)
by: Otachi, Yota
Published: (2026)
Hitting Geodesic Intervals in Structurally Restricted Graphs
by: Gima, Tatsuya, et al.
Published: (2025)
by: Gima, Tatsuya, et al.
Published: (2025)
A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs
by: Grigoriev, Alexander, et al.
Published: (2025)
by: Grigoriev, Alexander, et al.
Published: (2025)
Computing diverse pair of solutions for tractable SAT
by: Gima, Tatsuya, et al.
Published: (2024)
by: Gima, Tatsuya, et al.
Published: (2024)
Structural Parameterizations of Vertex Integrity
by: Gima, Tatsuya, et al.
Published: (2023)
by: Gima, Tatsuya, et al.
Published: (2023)
Biclique Reconfiguration in Bipartite Graphs
by: Otachi, Yota, et al.
Published: (2026)
by: Otachi, Yota, et al.
Published: (2026)
Parameterized Complexity of Finding Dissimilar Shortest Paths
by: Funayama, Ryo, et al.
Published: (2024)
by: Funayama, Ryo, et al.
Published: (2024)
Hedonic Seat Arrangement Problems
by: Bodlaender, Hans L., et al.
Published: (2020)
by: Bodlaender, Hans L., et al.
Published: (2020)
Sequentially Swapping Tokens: Further on Graph Classes
by: Kiya, Hironori, et al.
Published: (2022)
by: Kiya, Hironori, et al.
Published: (2022)
Treewidth of the $n \times n$ toroidal grid
by: Gima, Tatsuya, et al.
Published: (2026)
by: Gima, Tatsuya, et al.
Published: (2026)
Optimizing Periodic Operations for Efficient Inland Waterway Lock Management
by: Golak, Julian, et al.
Published: (2025)
by: Golak, Julian, et al.
Published: (2025)
Dichotomies for Tree Minor Containment with Structural Parameters
by: Gima, Tatsuya, et al.
Published: (2023)
by: Gima, Tatsuya, et al.
Published: (2023)
Broadcasting under Structural Restrictions
by: Egami, Yudai, et al.
Published: (2025)
by: Egami, Yudai, et al.
Published: (2025)
An improved spectral lower bound of treewidth
by: Gima, Tatsuya, et al.
Published: (2024)
by: Gima, Tatsuya, et al.
Published: (2024)
Algorithms for Galois Words: Detection, Factorization, and Rotation
by: Hendrian, Diptarama, et al.
Published: (2024)
by: Hendrian, Diptarama, 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)
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)
Finding Small Complete Subgraphs Efficiently
by: Chen, Ke, et al.
Published: (2023)
by: Chen, Ke, et al.
Published: (2023)
Subsequence Matching and LCS with Segment Number Constraints
by: Yonemoto, Yuki, et al.
Published: (2024)
by: Yonemoto, Yuki, et al.
Published: (2024)
Fast and Practical Single-Exponential Algorithms for Branchwidth
by: Kaneda, Taiki, et al.
Published: (2026)
by: Kaneda, Taiki, et al.
Published: (2026)
Structural Parameterizations of $k$-Planarity
by: Gima, Tatsuya, et al.
Published: (2025)
by: Gima, Tatsuya, et al.
Published: (2025)
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)
The Complexity Landscape of Dynamic Distributed Subgraph Finding
by: Chang, Yi-Jun, et al.
Published: (2024)
by: Chang, Yi-Jun, et al.
Published: (2024)
2-Layer Fan-Planarity in Polynomial Time
by: Kobayashi, Yasuaki, et al.
Published: (2025)
by: Kobayashi, Yasuaki, 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)
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)
Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs
by: Norose, Ryoma, et al.
Published: (2024)
by: Norose, Ryoma, et al.
Published: (2024)
Space Complexity Dichotomies for Subgraph Finding Problems in the Streaming Model
by: Shih, Yu-Sheng, et al.
Published: (2026)
by: Shih, Yu-Sheng, et al.
Published: (2026)
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
by: Conte, Alessio, et al.
Published: (2024)
by: Conte, Alessio, et al.
Published: (2024)
Forbidden Subgraph Problems with Predictions
by: Böckenhauer, Hans-Joachim, et al.
Published: (2025)
by: Böckenhauer, Hans-Joachim, et al.
Published: (2025)
Destroying Densest Subgraphs is Hard
by: Bazgan, Cristina, et al.
Published: (2024)
by: Bazgan, Cristina, et al.
Published: (2024)
Distributed Subgraph Finding: Progress and Challenges
by: Censor-Hillel, Keren
Published: (2022)
by: Censor-Hillel, Keren
Published: (2022)
Counting Cohesive Subgraphs with Hereditary Properties
by: Li, Rong-Hua, et al.
Published: (2024)
by: Li, Rong-Hua, et al.
Published: (2024)
Subexponential Parameterized Algorithms for Hitting Subgraphs
by: Lokshtanov, Daniel, et al.
Published: (2024)
by: Lokshtanov, Daniel, et al.
Published: (2024)
Packing Compact Subgraphs with Applications to Districting
by: Chen, Ho-Lin, et al.
Published: (2026)
by: Chen, Ho-Lin, et al.
Published: (2026)
A Unified Approach for Approximating 2-Edge-Connected Spanning Subgraph and 2-Vertex-Connected Spanning Subgraph
by: Çivril, Ali
Published: (2023)
by: Çivril, Ali
Published: (2023)
Scalable $k$-clique Densest Subgraph Search
by: Ye, Xiaowei, et al.
Published: (2024)
by: Ye, Xiaowei, et al.
Published: (2024)
Similar Items
-
Forcing a unique minimum spanning tree and a unique shortest path
by: Gima, Tatsuya, et al.
Published: (2025) -
Finding Induced Subgraphs from Graphs with Small Mim-Width
by: Otachi, Yota, et al.
Published: (2024) -
Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited
by: Hanaka, Tesshu, et al.
Published: (2025) -
Spanning tree congestion of proper interval graphs
by: Otachi, Yota
Published: (2026) -
Hitting Geodesic Intervals in Structurally Restricted Graphs
by: Gima, Tatsuya, et al.
Published: (2025)