Saved in:
| Main Authors: | Fujii, Koichi, Matsui, Tomomi |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.15463 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization
by: Tanaka, Masato, et al.
Published: (2021)
by: Tanaka, Masato, et al.
Published: (2021)
Strong odd colorings in graph classes of bounded expansion
by: Pilipczuk, Michał
Published: (2025)
by: Pilipczuk, Michał
Published: (2025)
Enumeration of minimal transversals of hypergraphs of bounded VC-dimension
by: Mary, Arnaud
Published: (2024)
by: Mary, Arnaud
Published: (2024)
Independent transversal blow-up of graphs
by: Dai, Tianjiao, et al.
Published: (2025)
by: Dai, Tianjiao, et al.
Published: (2025)
The sandwich problem for odd-hole-free and even-hole-free graphs
by: Cameron, Kathie, et al.
Published: (2024)
by: Cameron, Kathie, et al.
Published: (2024)
Finding Minimal Clusters in st-DAGs
by: Vogl, Ulrich, et al.
Published: (2026)
by: Vogl, Ulrich, et al.
Published: (2026)
Substitution discrete plane tilings with $2n$-fold rotational symmetry for odd n
by: Kari, Jarkko, et al.
Published: (2020)
by: Kari, Jarkko, et al.
Published: (2020)
On scheduling coupled tasks with exact delays to minimize maximum lateness
by: Kubiak, Wiesław
Published: (2026)
by: Kubiak, Wiesław
Published: (2026)
Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
by: Choi, Mujin, et al.
Published: (2025)
by: Choi, Mujin, et al.
Published: (2025)
Planar cycle-extendable graphs
by: Dalwadi, Aditya Y, et al.
Published: (2024)
by: Dalwadi, Aditya Y, et al.
Published: (2024)
Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges
by: Zhou, Xiaotian, et al.
Published: (2025)
by: Zhou, Xiaotian, et al.
Published: (2025)
The Power of Amortization on Minimizing Total Completion Time with Explorable Uncertainty
by: Krekelberg, Bob, et al.
Published: (2025)
by: Krekelberg, Bob, et al.
Published: (2025)
Extremal minimal bipartite matching covered graphs
by: Mallik, Amit Kumar, et al.
Published: (2024)
by: Mallik, Amit Kumar, et al.
Published: (2024)
A first efficient algorithm for enumerating all the extreme points of a bisubmodular polyhedron
by: Matsui, Yasuko, et al.
Published: (2024)
by: Matsui, Yasuko, et al.
Published: (2024)
Facial diagrams and cycle double cover
by: Ghanbari, Babak, et al.
Published: (2026)
by: Ghanbari, Babak, et al.
Published: (2026)
Word-representability and comparability: Minimal forbidden induced subgraphs and cover number bounds
by: Kenkireth, Benny George, et al.
Published: (2025)
by: Kenkireth, Benny George, et al.
Published: (2025)
Erdős--Pósa property of cycles that are far apart
by: Dujmović, Vida, et al.
Published: (2024)
by: Dujmović, Vida, et al.
Published: (2024)
Redicolouring digraphs: directed treewidth and cycle-degeneracy
by: Nisse, Nicolas, et al.
Published: (2023)
by: Nisse, Nicolas, et al.
Published: (2023)
Dividing sums of cycles in the semiring of functional digraphs
by: Bridoux, Florian, et al.
Published: (2025)
by: Bridoux, Florian, et al.
Published: (2025)
A polynomial bound for the minimal excluded minors for a surface
by: Houdaigoui, Sarah, et al.
Published: (2026)
by: Houdaigoui, Sarah, et al.
Published: (2026)
On the existence of factors intersecting sets of cycles in regular graphs
by: Goedgebeur, Jan, et al.
Published: (2024)
by: Goedgebeur, Jan, et al.
Published: (2024)
Bounds on treewidth via excluding disjoint unions of cycles
by: Hatzel, Meike, et al.
Published: (2025)
by: Hatzel, Meike, et al.
Published: (2025)
Unavoidable butterfly minors in digraphs of large cycle rank
by: Hatzel, Meike, et al.
Published: (2025)
by: Hatzel, Meike, et al.
Published: (2025)
A quasi-polynomial bound for the minimal excluded minors for a surface
by: Houdaigoui, Sarah, et al.
Published: (2025)
by: Houdaigoui, Sarah, et al.
Published: (2025)
Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks
by: Dai, Wenkai, et al.
Published: (2024)
by: Dai, Wenkai, et al.
Published: (2024)
Separating the edges of a graph by cycles and by subdivisions of $K_4$
by: Botler, Fábio, et al.
Published: (2024)
by: Botler, Fábio, et al.
Published: (2024)
Exact rainbow numbers of cycle-related graphs in multi-hubbed wheels
by: Dai, Mengyao, et al.
Published: (2025)
by: Dai, Mengyao, et al.
Published: (2025)
Enumerating Minimal Defensive Alliances
by: Feng, Zhidan, et al.
Published: (2023)
by: Feng, Zhidan, et al.
Published: (2023)
Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
by: Joret, Gwenaël, et al.
Published: (2026)
by: Joret, Gwenaël, et al.
Published: (2026)
Oriented discrepancy of Hamilton cycles in oriented graphs satisfying Ore-type condition
by: Ai, Jiangdong, et al.
Published: (2025)
by: Ai, Jiangdong, et al.
Published: (2025)
Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
by: Sawada, Joe, et al.
Published: (2025)
by: Sawada, Joe, et al.
Published: (2025)
Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)
by: Jedličková, Nikola, et al.
Published: (2023)
Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions
by: Sawada, J., et al.
Published: (2023)
by: Sawada, J., et al.
Published: (2023)
Chorded cycle facets of the clique partitioning polytope
by: Irmai, Jannik, et al.
Published: (2024)
by: Irmai, Jannik, et al.
Published: (2024)
Scheduling on identical machines with conflicts to minimize the mean flow time
by: Tellache, Nour ElHouda, et al.
Published: (2025)
by: Tellache, Nour ElHouda, et al.
Published: (2025)
Covering a Graph with Minimal Local Sets
by: Claudet, Nathan, et al.
Published: (2024)
by: Claudet, Nathan, et al.
Published: (2024)
Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
by: Kurapov, Sergey, et al.
Published: (2024)
by: Kurapov, Sergey, et al.
Published: (2024)
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)
by: Pilipczuk, Marcin, et al.
Published: (2023)
Automated Mathematical Discovery and Verification: Minimizing Pentagons in the Plane
by: Subercaseaux, Bernardo, et al.
Published: (2023)
by: Subercaseaux, Bernardo, et al.
Published: (2023)
The 27-qubit Counterexample to the LU-LC Conjecture is Minimal
by: Claudet, Nathan
Published: (2026)
by: Claudet, Nathan
Published: (2026)
Similar Items
-
New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization
by: Tanaka, Masato, et al.
Published: (2021) -
Strong odd colorings in graph classes of bounded expansion
by: Pilipczuk, Michał
Published: (2025) -
Enumeration of minimal transversals of hypergraphs of bounded VC-dimension
by: Mary, Arnaud
Published: (2024) -
Independent transversal blow-up of graphs
by: Dai, Tianjiao, et al.
Published: (2025) -
The sandwich problem for odd-hole-free and even-hole-free graphs
by: Cameron, Kathie, et al.
Published: (2024)