The LNCS 16416, constitutes the refereed post-conference proceedings of the 18th International Conference on Combinatorial Optimization and Applications, COCOA 2025, held in Tianjin, China, during November 2830, 2025.

The 44 full papers included in these volumes were carefully reviewed and selected from 113 submissions. The area of combinatorial optimization and its applications, including algorithm design, theoretical and experimental analysis, and applied research of general algorithmic interest.

Inhalt

.- Online Busy Time Scheduling with Flexible Jobs.

.- Broadcasting in Fully Connected Cliques.

.- Fast Algorithms for Correlation Clustering with Partition Size Constraints.

.- Collision-free Exploration by Mobile Agents with Pebbles in Tree Networks and Grids.

.- Parameterized Approximations for the $k$-Center and $k$-Supplier Problems in General Finite-Dimensional Normed Linear Space.

.- Node-weighted k-prize-collecting Steiner tree problem on planar graphs.

.- Job Scheduling to Minimize Peak Demand Above a Resource Curve.

.- Beyond Prime Implicants: Explaining Satisfiability with Prime Partitions.

.- The Regularized Chebyshev-Halley Method with Global Convergence.

.- An improved local improvement algorithm for $k-$-star partition.

.- Improved Semi-Streaming Algorithms for $k$-Submodular Maximization with the Knapsack Constraint.

.- Approximation Algorithms for the Metric Maximum-Weight $k$-Star Partition Problem.

.- Approximation Algorithms for Single-machine Scheduling with Weighted Makespan and General Penalties.

.- The Rounding Algorithm for Fuzzy Uncapacitated Facility Location Problem.

.- Partial inverse optimal value problem on minimum spanning tree.

.- Rounding Two Dimensional Solutions of the SDP Relaxation of Quantum Generalization of Max Cut.

.- Multi-Objective Evolutionary Algorithm for k-Submodular Maximization with a Knapsack Constraint.

.- On the $f$-clustered prize-collecting traveling salesman problem.

.- On the constrained windy postman problem.

.- Multitasking Parallel-Machine Scheduling with Due-Window and Resource Allocation.

.- Incentive Compatible Auctions for Digital Goods with Externalities.

.- Graph-based Scheduling in Multitrees with {1,L}-Task Weights.

.- Combinatorial approximation algorithms for solving bottleneck $k$-assignment problems.

.- Approximation schemes for early work scheduling on hierarchical identical parallel machines with a common due date.

.- A Best Possible Online Algorithm for Scheduling with an Unexpected Machine Unavailable Interval.

.- Polynomial time algorithm for a Bi-objective Spanning Star Forest Problem on Trees.

.- Traub and Vygen Algorithm for the Asymmetric Traveling Salesman Problem: Implementation and Experimental Analysis.

.- Investigating the $3$-Path Vertex Cover polytope in trees.

.- An analysis of the All Or None Maximum Dissociation Set problem.

.- Modeling wireless routing problems using colored digraphs.

.- The Bichromatic Two-Center Problem on Graphs.

.- DGRec++: Enhancing Diversified Recommendation via Advanced GNN Architectures.

.- A 1/2-Approximation Algorithm on k-Correlation Clustering of Uniform Hypergraphs.

.- Parallel Dynamic Complexity of Maintaining Count of Spanning Trees.

.- A Local Search Approximation Algorithm for a Sum of Squares k-Facility Location Problem.

.- LWT-XNet : A Skin Lesion Segmentation Network with Learnable Wavelet Transform Integration.

.- Facility Location Games for Multi-Location Agents with Satisfaction.

.- Identical scheduling game problem of m machines with two hierarchies.

.- On the Minimum Doubly Resolving Set Problem in Line Graphs.

.- On Some Structural Insights of $(p+1)K 2$-Saturated Graphs.

.- An approximation algorithm based on LP rounding for the capacitated power cover problem.

.- Semi-Supervised Graph Attention Regression with Pseudo-Labeling for Large-Scale Seismic Data.

.- An efficient Moss Growth Optimization algorithm for the task mapping problem in the Network-on-Chip design.

.- Single machine scheduling subject to a restricted job rejection constraint in cloud-edge collaborative computing.