| Publication | Date of Publication | Type |
|---|
An equivalent reformulation and multi-proximity gradient algorithms for a class of nonsmooth fractional programming
(available as arXiv preprint) | N/A | Paper |
Tur\'{a}n problems for star-path forests in hypergraphs
(available as arXiv preprint) | N/A | Paper |
The Turán number of Berge matchings
Discrete Mathematics | 2027-01-01 | Paper |
An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
Inverse Problems and Imaging | 2026-06-09 | Paper |
A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
Journal of Scientific Computing | 2026-03-31 | Paper |
The Turán number of Berge matchings
(available as arXiv preprint) | 2026-01-01 | Paper |
On generalized Turán problems for expansions
(available as arXiv preprint) | 2026-01-01 | Paper |
WITHDRAWN: Forbidding edge-critical graphs as trace in uniform hypergraphs
(available as arXiv preprint) | 2026-01-01 | Paper |
The Turán number of Berge paths
(available as arXiv preprint) | 2026-01-01 | Paper |
On the connected Turán number of Berge paths and Berge cycles
(available as arXiv preprint) | 2026-01-01 | Paper |
Counting sunflowers in hypergraphs with bounded matching number and Erdős Matching Conjecture in the (t,k)-norm
(available as arXiv preprint) | 2026-01-01 | Paper |
Hypergraph extensions of the Alon--Frankl Theorem and rainbow Turán problems
(available as arXiv preprint) | 2026-01-01 | Paper |
On the Turán number of blow-ups of $\mathcal{F}_5$
(available as arXiv preprint) | 2026-01-01 | Paper |
On the generalized Turán number of the complete bipartite graph $K_{3,b+1}$
(available as arXiv preprint) | 2026-01-01 | Paper |
A Spectral Confirmation of the Erdős Matching Conjecture
(available as arXiv preprint) | 2026-01-01 | Paper |
Counting large cliques in graphs with a forbidden tree
(available as arXiv preprint) | 2026-01-01 | Paper |
Counterexamples to a treewidth conjecture on generalized Turán problems
(available as arXiv preprint) | 2026-01-01 | Paper |
On Turán problems for suspension hypergraphs
Discrete Mathematics | 2025-12-16 | Paper |
Linear Turán problems with bounded matching number in hypergraphs
Discrete Mathematics | 2025-12-15 | Paper |
An equivalent reformulation and multiproximity gradient algorithms for a class of nonsmooth fractional programming
Mathematics of Operations Research | 2025-11-26 | Paper |
Turán problems for star-path forests in hypergraphs
Discrete Mathematics | 2025-06-12 | Paper |
On hypergraph Turán problems with bounded matching number
European Journal of Combinatorics | 2025-06-02 | Paper |
A note on stability results for Berge-\( K_{s , t}\) hypergraphs
Discrete Applied Mathematics | 2025-01-27 | Paper |
A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
(available as arXiv preprint) | 2025-01-01 | Paper |
On the Turán number of the expansion of the t-fan
(available as arXiv preprint) | 2025-01-01 | Paper |
On Turán problems for Berge forests
(available as arXiv preprint) | 2025-01-01 | Paper |
An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
(available as arXiv preprint) | 2025-01-01 | Paper |
A stability result for Berge-\( K_{3 , t}r\)-graphs and its applications
Discrete Applied Mathematics | 2024-09-26 | Paper |
Some properties on eccentricity matrices of uniform hypertrees
Discrete Applied Mathematics | 2024-04-02 | Paper |
On hypergraph Turán problems with bounded matching number
(available as arXiv preprint) | 2024-01-01 | Paper |
| Spectral extremal results for Berge-$K_{3,t}$-free $r$-graphs | 2023-11-29 | Paper |
Some properties on -least eigenvalue of uniform hypergraphs and their applications
Computational and Applied Mathematics | 2022-03-15 | Paper |
Some bounds for the incidence \(Q\)-spectral radius of uniform hypergraphs
Graphs and Combinatorics | 2021-11-30 | Paper |
A proximal algorithm with backtracked extrapolation for a class of structured fractional programming
Applied and Computational Harmonic Analysis | 2021-11-23 | Paper |
