Pasin Manurangsi
Zitiert von
Zitiert von
Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
P Manurangsi
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
From gap-eth to fpt-inapproximability: Clique, dominating set, and more
P Chalermsook, M Cygan, G Kortsarz, B Laekhanukit, P Manurangsi, ...
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
A birthday repetition theorem and complexity of approximating dense CSPs
P Manurangsi, P Raghavendra
arXiv preprint arXiv:1607.02986, 2016
On the parameterized complexity of approximating dominating set
B Laekhanukit, P Manurangsi
arXiv preprint arXiv:1711.11029, 2017
Inapproximability of maximum edge biclique, maximum balanced biclique and minimum k-cut from the small set expansion hypothesis
P Manurangsi
44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017
Asymptotic existence of fair divisions for groups
P Manurangsi, W Suksompong
Mathematical Social Sciences 89, 100-108, 2017
Parameterized intractability of even set and shortest vector problem from gap-eth
A Bhattacharyya, S Ghoshal, P Manurangsi
arXiv preprint arXiv:1803.09717, 2018
The computational complexity of training relu (s)
P Manurangsi, D Reichman
arXiv preprint arXiv:1810.04207, 2018
ETH-hardness of approximating 2-CSPs and Directed Steiner Network
I Dinur, P Manurangsi
arXiv preprint arXiv:1805.03867, 2018
On closest pair in euclidean metric: Monochromatic is as hard as bichromatic
CS Karthik, P Manurangsi
Combinatorica 40 (4), 539-573, 2020
Parameterized approximation algorithms for bidirected steiner network problems
R Chitnis, AE Feldmann, P Manurangsi
arXiv preprint arXiv:1707.06499, 2017
Approximation algorithms for label cover and the log-density threshold
E Chlamtáč, P Manurangsi, D Moshkovitz, A Vijayaraghavan
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
The price of fairness for indivisible goods
X Bei, X Lu, P Manurangsi, W Suksompong
arXiv preprint arXiv:1905.04910, 2019
Private aggregation from fewer anonymous messages
B Ghazi, P Manurangsi, R Pagh, A Velingker
Annual International Conference on the Theory and Applications of …, 2020
A Note on Max -Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation
P Manurangsi
arXiv preprint arXiv:1810.03792, 2018
An improved integrality gap for the Călinescu-Karloff-Rabani relaxation for multiway cut
H Angelidakis, Y Makarychev, P Manurangsi
International Conference on Integer Programming and Combinatorial …, 2017
Losing treewidth by separating subsets
A Gupta, E Lee, J Li, P Manurangsi, M Włodarczyk
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
Losing treewidth by separating subsets
A Gupta, E Lee, J Li, P Manurangsi, M Włodarczyk
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
On approximating projection games
P Manurangsi
Massachusetts Institute of Technology, 2015
Pure differentially private summation from anonymous messages
B Ghazi, N Golowich, R Kumar, P Manurangsi, R Pagh, A Velingker
arXiv preprint arXiv:2002.01919, 2020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20