J. Comb. Optim 2025

15 papers

Top Research Directions

The 2 research directions with J. Comb. Optim 2025 papers, ranked by paper count, next to 2024. Share is the fraction of the edition’s papers in the direction.

#Direction20252024Share 2025Share 20242024 rank
1Structural Induction for Proving Graph Properties106.7%0.0%—
2Structural Proofs via Minimal Counterexample Analysis106.7%0.0%—

Download all directions as CSV

Institutions

Institutions credited by J. Comb. Optim 2025 papers: a paper credits every institution named in its affiliations, once. 2 institutions share 3 credited papers.

#InstitutionPapersShare20242024 rank
1Phenikaa University 266.7%0—
2Harbin Engineering University 133.3%0—

Download all institutions as CSV

About this data

Papers. J. Comb. Optim 2025 lists 15 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.

Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers. Comparisons with 2024 use shares, since the edition went from 8 to 15 papers.

Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 3 of 15 papers (20.0%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.

Data. Counts come from Lacuna’s data build of 2026-11-20 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “J. Comb. Optim 2025”, https://lacuna.tiptreesystems.com/venue/j-comb-optim/2025.

Top Authors

AuthorPapers
Alvaro Velasquez1
Canh V. Pham1
Ling Gai1
Ruiqi Yang1
Shaojie Tang1
Tien Anh Mai1
Yang Lv1
Yao Wang1
Yong Xia1
Yuxin Sun1
Zhanshan Li1

Papers

Title
$(K_{1}\vee {P_{t})}$-saturated graphs with minimum number of edges
Advancing discrete optimization: novel approaches with dataless neural networks
Advertising meets assortment planning: joint advertising and assortment optimization under multinomial logit model
An exponential cone integer programming and piece-wise linear approximation approach for 0-1 fractional programming
Approximating combinatorial contracts with a cardinality constraint
Approximation algorithm for dynamic facility location problem
Bivalent quadratic optimization with sum-of-square of quadratic penalties
Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity
Fast Approximation Algorithm for Non-Monotone DR-submodular Maximization under Size Constraint
Graph Coloring problem solving using monte carlo tree search and deep reinforcement learning
Greedy algorithms for stochastic monotone k-submodular maximization under full-bandit feedback
Mutually dependent, balanced contributions, and the priority value
Online multiple one way non-preemptive time series search with interrelated prices
On some path-critical Ramsey numbers
Uav trajectory optimization for maximizing the ToI-based data utility in wireless sensor networks