Akbar Rafiey

Orcid: 0000-0003-1619-3997

According to our database1, Akbar Rafiey authored at least 16 papers between 2015 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
The Price of Privacy For Approximating Max-CSP.
CoRR, February, 2026

2025
Differentiable extensions with rounding guarantees for combinatorial optimization over permutations.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Geometric Algorithms for Neural Combinatorial Optimization with Constraints.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Explaining GNN Explanations with Edge Gradients.
Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, V.2, 2025

2024
Bi-arc Digraphs: Recognition Algorithm and Applications.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Decomposable Submodular Maximization in Federated Setting.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023
Private Boosted Decision Trees via Smooth Re-Weighting.
J. Priv. Confidentiality, August, 2023

Vertex Ordering with Precedence Constraints.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022
On the complexity of CSP-based ideal membership problems.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

The Ideal Membership Problem and Abelian Groups.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Sparsification of Decomposable Submodular Functions.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2020
Fast and Private Submodular and k-Submodular Functions Maximization with Matroid Constraints.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Toward a Dichotomy for Approximation of H-Coloring.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Counting maximal near perfect matchings in quasirandom and dense graphs.
CoRR, 2018

2015
Ordering with precedence constraints and budget minimization.
CoRR, 2015

Approximation Algorithms for Generalized MST and TSP in Grid Clusters.
Proceedings of the Combinatorial Optimization and Applications, 2015


  Loading...