Aleksa Stankovic

According to our database, Aleksa Stankovic authored at least 7 papers between 2019 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Optirefine: densest subgraphs and maximum cuts with k refinements.

Sijing Tu, Aleksa Stankovic, Stefan Neumann, Aristides Gionis

Data Min. Knowl. Discov., November, 2025

OptiRefine: Densest subgraphs and maximum cuts with <i>k</i> refinements.

Sijing Tu, Aleksa Stankovic, Stefan Neumann, Aristides Gionis

CoRR, February, 2025

2023

Hardness of Approximating Constraint Satisfaction Problems and Their Variants in Presence of Additional Structural Assumptions.

Aleksa Stankovic

PhD thesis, 2023

2022

On regularity of Max-CSPs and Min-CSPs.

Aleksa Stankovic

Inf. Process. Lett., 2022

Max-3-Lin over Non-Abelian Groups with Universal Factor Graphs.

Amey Bhangale, Aleksa Stankovic

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Some Results on Approximability of Minimum Sum Vertex Cover.

Aleksa Stankovic

Proceedings of the Approximation, 2022

2019

Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder.

Per Austrin, Aleksa Stankovic

Proceedings of the Approximation, 2019