:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Heng, Pei, Sun, Yi, Guo, Jianhua
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Combinatorics 05C90
Online Access:	https://arxiv.org/abs/2602.19189
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Finding Short Paths on Simple Polytopes
by: Black, Alexander E., et al.
Published: (2026)

Cluster deletion and clique partitioning in graphs with bounded clique number
by: Galesi, Nicola, et al.
Published: (2025)

Edge coloring of products of signed graphs
by: Janczewski, Robert, et al.
Published: (2023)

A practical algorithm for 2-admissibility
by: Awofeso, Christine, et al.
Published: (2025)

Brooks-type colourings of digraphs in linear time
by: Gonçalves, Daniel, et al.
Published: (2024)

Isolation critical graphs under multiple edge subdivision
by: Bartolo, Karl, et al.
Published: (2026)

Zero-free regions of partition functions with applications to algorithms and graph limits
by: Regts, Guus
Published: (2015)

On algorithmic applications of sim-width and mim-width of $(H_1, H_2)$-free graphs
by: Munaro, Andrea, et al.
Published: (2022)

$t$-sails and sparse hereditary classes of unbounded tree-width
by: Cocks, Daniel
Published: (2023)

Perfect phylogenies via the Minimum Uncovering Branching problem: efficiently solvable cases
by: Baghirova, Narmina, et al.
Published: (2025)

A Bellman-Ford algorithm for the path-length-weighted distance in graphs
by: Arnau, R., et al.
Published: (2024)

Supermodular Maximization with Cardinality Constraints
by: Chen, Xujin, et al.
Published: (2025)

On Supmodular Matrices
by: Onn, Shmuel
Published: (2023)

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
by: Ammann, Sabrina C. L., et al.
Published: (2024)

Solving the Graph Burning Problem for Large Graphs
by: Pereira, Felipe de Carvalho, et al.
Published: (2024)

Computing distances is FPT on graph associahedra and W[2]-hard on hypergraphic polytopes
by: Cunha, Luís Felipe I., et al.
Published: (2025)

A Fast Monte Carlo algorithm for evaluating matrix functions with application in complex networks
by: Guidotti, Nicolas L., et al.
Published: (2023)

TreePIR: Efficient Private Retrieval of Merkle Proofs via Tree Colorings with Fast Indexing and Zero Storage Overhead
by: Dau, Son Hoang, et al.
Published: (2022)

Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions
by: Oum, Sang-il, et al.
Published: (2026)

Totally $Δ$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
by: McFarland, Caleb
Published: (2026)

On 3-Coloring of $(2P_4,C_5)$-Free Graphs
by: Jelínek, Vít, et al.
Published: (2020)

A simple Path-based LP Relaxation for Directed Steiner Tree
by: Pashkovich, Kanstantsin, et al.
Published: (2026)

On the on-line coloring of unit interval graphs with proper interval representation
by: Curbelo, Israel R., et al.
Published: (2024)

On $G^p$-unimodality of radius functions in graphs: structure and algorithms
by: Chalopin, Jérémie, et al.
Published: (2025)

Decline and Fall of the ICALP 2008 Modular Decomposition algorithm
by: Atherton, William, et al.
Published: (2024)

Forbidden configurations and dominating bicliques in undirected 2-quasi best match graphs
by: Korchmaros, Annachiara, et al.
Published: (2025)

Optimal Adjacency Labels for Subgraphs of Cartesian Products
by: Esperet, Louis, et al.
Published: (2022)

Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs
by: Galby, Esther, et al.
Published: (2024)

A unified worst case for classical simplex and policy iteration pivot rules
by: Disser, Yann, et al.
Published: (2023)

Online coloring of short interval graphs and two-count interval graphs
by: Curbelo, Israel R.
Published: (2024)

A Generalization of Distance Domination
by: Muth, Alicia, et al.
Published: (2025)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
by: An, Shinwoo, et al.
Published: (2025)

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
by: Dallard, Clément, et al.
Published: (2024)

Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
by: Biedl, Therese
Published: (2025)

Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs
by: Daga, Mohit
Published: (2025)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
by: Liu, Bowen
Published: (2025)

Awesome graph parameters
by: Štorgel, Kenny Bešter, et al.
Published: (2025)

Branch-width of connectivity functions is fixed-parameter tractable
by: Korhonen, Tuukka, et al.
Published: (2026)

Excluding an induced wheel minor in graphs without large induced stars
by: Choi, Mujin, et al.
Published: (2025)

On $γ$-Contraction and $β$-Contraction: A Unified Framework for Colour-Preserving Graph Reduction
by: Onofri, Elia
Published: (2024)