Saved in:
| Main Authors: | Vogl, Ulrich, Siegle, Markus |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.26538 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Token Sliding Reconfiguration on DAGs
by: Dirks, Jona, et al.
Published: (2025)
by: Dirks, Jona, et al.
Published: (2025)
Computing $\vec{\mathcal{S}}$-DAGs and Parity Games
by: Hatzel, Meike, et al.
Published: (2024)
by: Hatzel, Meike, et al.
Published: (2024)
Characterizing and Transforming DAGs within the I-LCA Framework
by: Hellmuth, Marc, et al.
Published: (2024)
by: Hellmuth, Marc, et al.
Published: (2024)
Inferring DAGs and Phylogenetic Networks from Least Common Ancestors
by: Lindeberg, Anna, et al.
Published: (2025)
by: Lindeberg, Anna, et al.
Published: (2025)
Simplifying and Characterizing DAGs and Phylogenetic Networks via Least Common Ancestor Constraints
by: Lindeberg, Anna, et al.
Published: (2024)
by: Lindeberg, Anna, et al.
Published: (2024)
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
by: Chakraborty, Dibyayan, et al.
Published: (2024)
by: Chakraborty, Dibyayan, et al.
Published: (2024)
The Complexity of Finding Tangles
by: Firman, Oksana, et al.
Published: (2020)
by: Firman, Oksana, et al.
Published: (2020)
Minimizing breaks by minimizing odd cycle transversals
by: Fujii, Koichi, et al.
Published: (2024)
by: Fujii, Koichi, et al.
Published: (2024)
Elimination Distance to Dominated Clusters
by: Schirrmacher, Nicole, et al.
Published: (2025)
by: Schirrmacher, Nicole, et al.
Published: (2025)
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)
Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model
by: Bentert, Matthias, et al.
Published: (2023)
by: Bentert, Matthias, et al.
Published: (2023)
On Obtaining New MUBs by Finding Points on Complete Intersection Varieties over $\mathbb{R}$
by: Banerjee, Arindam, et al.
Published: (2025)
by: Banerjee, Arindam, et al.
Published: (2025)
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)
Second Price Matching with Complete Allocation and Degree Constraints
by: Pinchasi, Rom, et al.
Published: (2025)
by: Pinchasi, Rom, et al.
Published: (2025)
A Euclidean Distance Matrix Model for Convex Clustering
by: Wang, Zhaowei, et al.
Published: (2021)
by: Wang, Zhaowei, et al.
Published: (2021)
Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks
by: Dai, Wenkai, et al.
Published: (2024)
by: Dai, Wenkai, et al.
Published: (2024)
Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
by: Crane, Alex, et al.
Published: (2025)
by: Crane, Alex, et al.
Published: (2025)
Clustered independence and bounded treewidth
by: Knauer, Kolja, et al.
Published: (2023)
by: Knauer, Kolja, et al.
Published: (2023)
Enumerating Minimal Defensive Alliances
by: Feng, Zhidan, et al.
Published: (2023)
by: Feng, Zhidan, et al.
Published: (2023)
A New Method for Finding the Schulze Winner Set
by: Fujishige, Satoru, et al.
Published: (2026)
by: Fujishige, Satoru, et al.
Published: (2026)
Covering a Graph with Minimal Local Sets
by: Claudet, Nathan, et al.
Published: (2024)
by: Claudet, Nathan, et al.
Published: (2024)
Logarithmic Mixing of Random Walks on Dynamical Random Cluster Models
by: Galanis, Andreas, et al.
Published: (2026)
by: Galanis, Andreas, et al.
Published: (2026)
The 27-qubit Counterexample to the LU-LC Conjecture is Minimal
by: Claudet, Nathan
Published: (2026)
by: Claudet, Nathan
Published: (2026)
Automated Mathematical Discovery and Verification: Minimizing Pentagons in the Plane
by: Subercaseaux, Bernardo, et al.
Published: (2023)
by: Subercaseaux, Bernardo, et al.
Published: (2023)
Hardness of Finding Kings and Strong Kings
by: Alaoui, Ziad Ismaili, et al.
Published: (2025)
by: Alaoui, Ziad Ismaili, et al.
Published: (2025)
Discrepancy Minimization via Regularization
by: Pesenti, Lucas, et al.
Published: (2022)
by: Pesenti, Lucas, et al.
Published: (2022)
Pentagon Minimization without Computation
by: Mackey, John, et al.
Published: (2024)
by: Mackey, John, et al.
Published: (2024)
From the Finite to the Infinite: Sharper Asymptotic Bounds on Norin's Conjecture via SAT
by: Kirchweger, Markus, et al.
Published: (2025)
by: Kirchweger, Markus, et al.
Published: (2025)
Finding d-Cuts in Claw-free Graphs
by: Ahn, Jungho, et al.
Published: (2025)
by: Ahn, Jungho, et al.
Published: (2025)
Mixed-integer linear programming approaches for nested $p$-center problems with absolute and relative regret objectives
by: Brandstetter, Christof, et al.
Published: (2024)
by: Brandstetter, Christof, et al.
Published: (2024)
How to Reduce Temporal Cliques to Find Sparse Spanners
by: Angrick, Sebastian, et al.
Published: (2024)
by: Angrick, Sebastian, et al.
Published: (2024)
Optimal Multi-agent Path Finding in Continuous Time
by: Combrink, Alvin, et al.
Published: (2025)
by: Combrink, Alvin, et al.
Published: (2025)
Finding Minimum Matching Cuts in $H$-free Graphs
by: Lucke, Felicia, et al.
Published: (2025)
by: Lucke, Felicia, et al.
Published: (2025)
Upward Pointset Embeddings of Planar st-Graphs
by: Alegria, Carlos, et al.
Published: (2024)
by: Alegria, Carlos, et al.
Published: (2024)
Partial Optimality in Cubic Correlation Clustering for General Graphs
by: Stein, David, et al.
Published: (2025)
by: Stein, David, et al.
Published: (2025)
Fast Makespan Minimization via Short ILPs
by: Hermelin, Danny, et al.
Published: (2026)
by: Hermelin, Danny, et al.
Published: (2026)
Parameterized Complexity of Submodular Minimization under Uncertainty
by: Kakimura, Naonori, et al.
Published: (2024)
by: Kakimura, Naonori, et al.
Published: (2024)
A Theory of Conversion Relations for Prefixed Units of Measure
by: Widemann, Baltasar Trancón y, et al.
Published: (2022)
by: Widemann, Baltasar Trancón y, et al.
Published: (2022)
A Unified Approach to Minimizing Symmetric Submodular Functions
by: Iwata, Satoru, et al.
Published: (2026)
by: Iwata, Satoru, et al.
Published: (2026)
Similar Items
-
Token Sliding Reconfiguration on DAGs
by: Dirks, Jona, et al.
Published: (2025) -
Computing $\vec{\mathcal{S}}$-DAGs and Parity Games
by: Hatzel, Meike, et al.
Published: (2024) -
Characterizing and Transforming DAGs within the I-LCA Framework
by: Hellmuth, Marc, et al.
Published: (2024) -
Inferring DAGs and Phylogenetic Networks from Least Common Ancestors
by: Lindeberg, Anna, et al.
Published: (2025) -
Simplifying and Characterizing DAGs and Phylogenetic Networks via Least Common Ancestor Constraints
by: Lindeberg, Anna, et al.
Published: (2024)