OOIR: Observatory of International Research

Papers

(The H4-Index of Mathematical Programming is 19. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2022-05-01 to 2026-05-01.)

Article	Citations
Towards an optimal contention resolution scheme for matchings	53
A characterization of maximal homogeneous-quadratic-free sets	37
Multiplicative updates for symmetric-cone factorizations	35
$$\mathcal {V}$$-polyhedral disjunctive cuts	32
Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations	31
On the integrality gap of binary integer programs with Gaussian data	31
The exact worst-case convergence rate of the alternating direction method of multipliers	29
Affinely representable lattices, stable matchings, and choice functions	24
A projection-free method for solving convex bilevel optimization problems	24
Efficient separation of RLT cuts for implicit and explicit bilinear terms	24
Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians	24
Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings	24
Optimal methods for convex nested stochastic composite optimization	22
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates	21
Structural iterative rounding for generalized k-median problems	21
Primal methods for variational inequality problems with functional constraints	20
A $$\nicefrac {4}{3}$$-approximation for the maximum leaf spanning arborescence problem in DAGs	20
Shapes and recession cones in mixed-integer convex representability	20
Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization	19
A cutting-plane and benders’ decomposition algorithm for two-stage distributionally robust convex programs	19
Weak notions of nondegeneracy in nonlinear semidefinite programming	19
Constrained optimization of rank-one functions with indicator variables	19
Sum-of-squares relaxations for polynomial min–max problems over simple sets	19