Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder. - Per Austrin; Aleksa Stankovic (APPROX-RANDOM, 2019)

On regularity of Max-CSPs and Min-CSPs. - Aleksa Stankovic (Inf. Process. Lett., 2022)

Hardness of Approximating Constraint Satisfaction Problems and Their Variants in Presence of Additional Structural Assumptions. - Aleksa Stankovic (2023)

Max-3-Lin Over Non-abelian Groups with Universal Factor Graphs. - Amey Bhangale; Aleksa Stankovic (Algorithmica, 2023)

OptiRefine: Densest subgraphs and maximum cuts with k refinements. - Sijing Tu; Aleksa Stankovic; Stefan Neumann 003; Aristides Gionis (CoRR, 2025)

Some Results on Approximability of Minimum Sum Vertex Cover. - Aleksa Stankovic (ACM Trans. Comput. Theory, 2025)