Saved in:
| Main Authors: | Garamvölgyi, Dániel, Mizutani, Ryuhei, Oki, Taihei, Schwarcz, Tamás, Yamaguchi, Yutaro |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.06771 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Problems on Group-labeled Matroid Bases
by: Hörsch, Florian, et al.
Published: (2024)
by: Hörsch, Florian, et al.
Published: (2024)
Generalizing the Multiple Exchange Property for Matroid Bases
by: Oki, Taihei, et al.
Published: (2025)
by: Oki, Taihei, et al.
Published: (2025)
Matroid Intersection under Minimum Rank Oracle
by: Bárász, Mihály, et al.
Published: (2024)
by: Bárász, Mihály, et al.
Published: (2024)
A Polynomial Algorithm for Minimizing $k$-Distant Submodular Functions
by: Mizutani, Ryuhei
Published: (2024)
by: Mizutani, Ryuhei
Published: (2024)
Supermodular Extension of Vizing's Edge-Coloring Theorem
by: Mizutani, Ryuhei
Published: (2022)
by: Mizutani, Ryuhei
Published: (2022)
Minimizing Submodular Functions over Hierarchical Families
by: Mizutani, Ryuhei
Published: (2026)
by: Mizutani, Ryuhei
Published: (2026)
Rainbow Arborescence Conjecture
by: Bérczi, Kristóf, et al.
Published: (2024)
by: Bérczi, Kristóf, et al.
Published: (2024)
Matroid products via submodular coupling
by: Bérczi, Kristóf, et al.
Published: (2024)
by: Bérczi, Kristóf, et al.
Published: (2024)
A Note on Ordinal Submodularity
by: Fujishige, Satoru, et al.
Published: (2026)
by: Fujishige, Satoru, et al.
Published: (2026)
Position Fair Mechanisms Allocating Indivisible Goods
by: Mahara, Ryoga, et al.
Published: (2024)
by: Mahara, Ryoga, et al.
Published: (2024)
Rigidity and reconstruction in matroids of highly connected graphs
by: Garamvölgyi, Dániel
Published: (2024)
by: Garamvölgyi, Dániel
Published: (2024)
Stress-linked pairs of vertices and the generic stress matroid
by: Garamvölgyi, Dániel
Published: (2023)
by: Garamvölgyi, Dániel
Published: (2023)
The Rainbow Arborescence Problem on Cycles
by: Bérczi, Kristóf, et al.
Published: (2025)
by: Bérczi, Kristóf, et al.
Published: (2025)
Algorithmic aspects of semistability of quiver representations
by: Iwamasa, Yuni, et al.
Published: (2024)
by: Iwamasa, Yuni, et al.
Published: (2024)
Symmetric Tensor Matroids, Dual Rigidity Matroids, and the Maximality Conjecture
by: Jackson, Bill, et al.
Published: (2025)
by: Jackson, Bill, et al.
Published: (2025)
Minimally globally rigid graphs
by: Garamvölgyi, Dániel, et al.
Published: (2022)
by: Garamvölgyi, Dániel, et al.
Published: (2022)
Partial reflections and globally linked pairs in rigid graphs
by: Garamvölgyi, Dániel, et al.
Published: (2023)
by: Garamvölgyi, Dániel, et al.
Published: (2023)
Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank
by: Oki, Taihei, et al.
Published: (2022)
by: Oki, Taihei, et al.
Published: (2022)
Count and cofactor matroids of highly connected graphs
by: Garamvölgyi, Dániel, et al.
Published: (2022)
by: Garamvölgyi, Dániel, et al.
Published: (2022)
Finding Spanning Trees with Perfect Matchings
by: Bérczi, Kristóf, et al.
Published: (2024)
by: Bérczi, Kristóf, et al.
Published: (2024)
Fractional Linear Matroid Matching is in quasi-NC
by: Gurjar, Rohit, et al.
Published: (2024)
by: Gurjar, Rohit, et al.
Published: (2024)
Monotonic Decompositions of Submodular Set Functions
by: Bérczi, Kristóf, et al.
Published: (2024)
by: Bérczi, Kristóf, et al.
Published: (2024)
A Note on the Sticky Matroid Conjecture
by: Bonin, Joseph E.
Published: (2009)
by: Bonin, Joseph E.
Published: (2009)
Sparsity, Stress-Independence and Globally Linked Pairs in Graph Rigidity Theory
by: Garamvölgyi, Dániel, et al.
Published: (2025)
by: Garamvölgyi, Dániel, et al.
Published: (2025)
Approximating maximum-size properly colored forests
by: Bai, Yuhang, et al.
Published: (2024)
by: Bai, Yuhang, et al.
Published: (2024)
An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
by: Murakami, Hitoshi, et al.
Published: (2024)
by: Murakami, Hitoshi, et al.
Published: (2024)
Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs
by: Norose, Ryoma, et al.
Published: (2024)
by: Norose, Ryoma, et al.
Published: (2024)
A Linear-Time Algorithm for Finding an Odd Cycle Through Two Specified Vertices
by: Kano, Takumi, et al.
Published: (2026)
by: Kano, Takumi, et al.
Published: (2026)
Highly connected orientations from edge-disjoint rigid subgraphs
by: Garamvölgyi, Dániel, et al.
Published: (2024)
by: Garamvölgyi, Dániel, et al.
Published: (2024)
Sufficient conditions for bipartite rigidity, symmetric completability and hyperconnectivity of graphs
by: Garamvölgyi, Dániel, et al.
Published: (2025)
by: Garamvölgyi, Dániel, et al.
Published: (2025)
White's Conjecture for Paving Matroids
by: Yu, Yu-Chuan, et al.
Published: (2025)
by: Yu, Yu-Chuan, et al.
Published: (2025)
Globally rigid graphs are fully reconstructible
by: Garamvölgyi, Dániel, et al.
Published: (2021)
by: Garamvölgyi, Dániel, et al.
Published: (2021)
Computational Complexity of Swish
by: Horiyama, Takashi, et al.
Published: (2026)
by: Horiyama, Takashi, et al.
Published: (2026)
Exact Matching in Matrix Multiplication Time
by: Sato, Ryotaro, et al.
Published: (2025)
by: Sato, Ryotaro, et al.
Published: (2025)
List Chromatic Number of Finitary Matroids: A Generalization of Seymour's Result
by: Csernák, Tamás
Published: (2022)
by: Csernák, Tamás
Published: (2022)
Matchings in Matroids over Abelian Groups, III
by: Aliabadi, Mohsen, et al.
Published: (2025)
by: Aliabadi, Mohsen, et al.
Published: (2025)
Interaction between skew-representability, tensor products, extension properties, and rank inequalities
by: Bérczi, Kristóf, et al.
Published: (2025)
by: Bérczi, Kristóf, et al.
Published: (2025)
A hierarchy of edge-weight symmetries in perfect matchings
by: Bérczi, Kristóf, et al.
Published: (2026)
by: Bérczi, Kristóf, et al.
Published: (2026)
Matroid lifts and representability
by: Bernstein, Daniel Irving, et al.
Published: (2023)
by: Bernstein, Daniel Irving, et al.
Published: (2023)
Representability of Flag Matroids
by: Bernstein, Daniel Irving, et al.
Published: (2025)
by: Bernstein, Daniel Irving, et al.
Published: (2025)
Similar Items
-
Problems on Group-labeled Matroid Bases
by: Hörsch, Florian, et al.
Published: (2024) -
Generalizing the Multiple Exchange Property for Matroid Bases
by: Oki, Taihei, et al.
Published: (2025) -
Matroid Intersection under Minimum Rank Oracle
by: Bárász, Mihály, et al.
Published: (2024) -
A Polynomial Algorithm for Minimizing $k$-Distant Submodular Functions
by: Mizutani, Ryuhei
Published: (2024) -
Supermodular Extension of Vizing's Edge-Coloring Theorem
by: Mizutani, Ryuhei
Published: (2022)