:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Krekelberg, Bob, Liu, Alison Hsiang-Hsuan, Liu, Fu-Hong, Wong, Prudence W. H., Zhang, Xiao-Ou
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics
Online Access:	https://arxiv.org/abs/2503.13357
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Harmonic Indel Distance
by: Pepin, Bob
Published: (2020)

On the FirstFit Algorithm for Online Unit-Interval Coloring
by: Krekelberg, Bob, et al.
Published: (2025)

Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete
by: la Tour, Max Dupré, et al.
Published: (2025)

Parameterized Complexity of Submodular Minimization under Uncertainty
by: Kakimura, Naonori, et al.
Published: (2024)

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges
by: Zhou, Xiaotian, et al.
Published: (2025)

Finding Minimal Clusters in st-DAGs
by: Vogl, Ulrich, et al.
Published: (2026)

Minimizing breaks by minimizing odd cycle transversals
by: Fujii, Koichi, et al.
Published: (2024)

Completely Independent Steiner Trees
by: Maheshwari, Anil, et al.
Published: (2026)

An Algorithm for the Decomposition of Complete Graph into Minimum Number of Edge-disjoint Trees
by: Sinha, Antika, et al.
Published: (2024)

Ternary Binomial and Trinomial Bent Functions in the Completed Maiorana-McFarland Class
by: Helleseth, Tor, et al.
Published: (2025)

Bounds on the Complete Forcing Number of Graphs
by: Ebrahimi, Javad B., et al.
Published: (2024)

Word-representability and comparability: Minimal forbidden induced subgraphs and cover number bounds
by: Kenkireth, Benny George, et al.
Published: (2025)

On Obtaining New MUBs by Finding Points on Complete Intersection Varieties over $\mathbb{R}$
by: Banerjee, Arindam, et al.
Published: (2025)

Covering Complete Geometric Graphs by Monotone Paths
by: Dumitrescu, Adrian, et al.
Published: (2025)

Automated Mathematical Discovery and Verification: Minimizing Pentagons in the Plane
by: Subercaseaux, Bernardo, et al.
Published: (2023)

Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks
by: Dai, Wenkai, et al.
Published: (2024)

Complete polyhedral description of chemical graphs of maximum degree at most 3
by: Dusollier, Valentin, et al.
Published: (2025)

Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
by: Dumitrescu, Adrian, et al.
Published: (2024)

Enumerating Minimal Defensive Alliances
by: Feng, Zhidan, et al.
Published: (2023)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
by: Bourneuf, Romain, et al.
Published: (2025)

Online Firefighting on Cactus Graphs
by: Hugen, Max, et al.
Published: (2025)

Well-mixing vertices and almost expanders
by: Chakraborti, Debsoumya, et al.
Published: (2021)

Application of the Quantum Approximate Optimization Algorithm in Solving the Total Domination Problem
by: Pan, Haoqian, et al.
Published: (2024)

Limit Laws for Critical Dispersion on Complete Graphs
by: De Ambroggio, Umberto, et al.
Published: (2024)

Equitable coloring of sparse graphs
by: Liu, Weichan, et al.
Published: (2024)

Covering a Graph with Minimal Local Sets
by: Claudet, Nathan, et al.
Published: (2024)

Burning Graph Powers and Branching Trees
by: Jansson, Jesper, et al.
Published: (2026)

The 27-qubit Counterexample to the LU-LC Conjecture is Minimal
by: Claudet, Nathan
Published: (2026)

Independent transversal blow-up of graphs
by: Dai, Tianjiao, et al.
Published: (2025)

A Euclidean Distance Matrix Model for Convex Clustering
by: Wang, Zhaowei, et al.
Published: (2021)

Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
by: Liu, Bowie, et al.
Published: (2025)

Discrepancy Minimization via Regularization
by: Pesenti, Lucas, et al.
Published: (2022)

Pentagon Minimization without Computation
by: Mackey, John, et al.
Published: (2024)

Fine-Grained Expressive Power of Weisfeiler-Leman: A Homomorphism Counting Perspective
by: Zhou, Junru, et al.
Published: (2024)

Towards Complete Causal Explanation with Expert Knowledge
by: Venkateswaran, Aparajithan, et al.
Published: (2024)

Fault tolerance for metric dimension and its variants
by: Geneson, Jesse, et al.
Published: (2025)

A Systematic Study of Single-Anchor Logical Gadgets
by: Güngör, Fikret H.
Published: (2025)

Powers of large matrices on GPU platforms to compute the Roman domination number of cylindrical graphs
by: Martínez, J. A., et al.
Published: (2024)

Packing Topological Minors Half-Integrally
by: Liu, Chun-Hung
Published: (2017)

Fast Makespan Minimization via Short ILPs
by: Hermelin, Danny, et al.
Published: (2026)