Aleksa Stankovic

13 papers A 2Journal 9Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
OptiRefine: Densest subgraphs and maximum cuts with
CoRR
Sijing Tu, Aleksa Stankovic, Stefan Neumann, Aristides Gionis
2025 J jnl
Optirefine: densest subgraphs and maximum cuts with k refinements.
Data Min. Knowl. Discov.
Sijing Tu, Aleksa Stankovic, Stefan Neumann, Aristides Gionis
2025 J jnl
Some Results on Approximability of Minimum Sum Vertex Cover.
ACM Trans. Comput. Theory
Aleksa Stankovic
2023 — —
Hardness of Approximating Constraint Satisfaction Problems and Their Variants in Presence of Additional Structural Assumptions.
Aleksa Stankovic
2023 J jnl
Max-3-Lin Over Non-abelian Groups with Universal Factor Graphs.
Algorithmica
Amey Bhangale, Aleksa Stankovic
2022 A conf
Max-3-Lin over Non-Abelian Groups with Universal Factor Graphs.
ITCS
Amey Bhangale, Aleksa Stankovic
2022 J jnl
On regularity of Max-CSPs and Min-CSPs.
Inf. Process. Lett.
Aleksa Stankovic
2022 A conf
Some Results on Approximability of Minimum Sum Vertex Cover.
APPROX/RANDOM
Aleksa Stankovic
2022 J jnl
Some Results on Approximability of Minimum Sum Vertex Cover.
CoRR
Aleksa Stankovic
2021 J jnl
Max-3-Lin over Non-Abelian Groups with Universal Factor Graphs.
CoRR
Amey Bhangale, Aleksa Stankovic
2020 J jnl
On Regularity of Max-CSPs and Min-CSPs.
CoRR
Aleksa Stankovic
2019 — conf
Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder.
APPROX-RANDOM
Per Austrin, Aleksa Stankovic
2019 J jnl
Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder.
CoRR
Per Austrin, Aleksa Stankovic