Articles with public access mandates - Pasin ManurangsiLearn more
Not available anywhere: 1
Tight inapproximability of minimum maximal matching on bipartite graphs and related problems
S Dudycz, P Manurangsi, J Marcinkowski
International Workshop on Approximation and Online Algorithms, 48-64, 2021
Mandates: National Science Centre, Poland
Available somewhere: 35
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
Mandates: US National Science Foundation
Deep learning with label differential privacy
B Ghazi, N Golowich, R Kumar, P Manurangsi, C Zhang
Advances in neural information processing systems 34, 27131-27145, 2021
Mandates: US National Science Foundation
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
Mandates: US National Science Foundation, Swedish Research Council, European Commission
On the parameterized complexity of approximating dominating set
CS Karthik, B Laekhanukit, P Manurangsi
50th Annual ACM Symposium on Theory of Computing, 1283-1296, 2018
Mandates: US National Science Foundation
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
Mandates: US National Science Foundation
The price of fairness for indivisible goods
X Bei, X Lu, P Manurangsi, W Suksompong
Theory of Computing Systems 65, 1069-1093, 2021
Mandates: US National Science Foundation, European Commission
Private robust estimation by stabilizing convex relaxations
P Kothari, P Manurangsi, A Velingker
Conference on Learning Theory, 723-777, 2022
Mandates: US National Science Foundation
Parameterized Intractability of Even Set and Shortest Vector Problem
A Bhattacharyya, É Bonnet, L Egri, S Ghoshal, B Lin, P Manurangsi, ...
Journal of the ACM (JACM) 68 (3), 1-40, 2021
Mandates: Natural Sciences and Engineering Research Council of Canada, Department of …
On closest pair in euclidean metric: Monochromatic is as hard as bichromatic
CS Karthik, P Manurangsi
Combinatorica 40 (4), 539-573, 2020
Mandates: US National Science Foundation
Parameterized approximation algorithms for bidirected steiner network problems
R Chitnis, AE Feldmann, P Manurangsi
ACM Transactions on Algorithms (TALG) 17 (2), 1-68, 2021
Mandates: European Commission
Closing gaps in asymptotic fair division
P Manurangsi, W Suksompong
SIAM Journal on Discrete Mathematics 35 (2), 668-706, 2021
Mandates: European Commission
When do envy-free allocations exist?
P Manurangsi, W Suksompong
SIAM Journal on Discrete Mathematics 34 (3), 1505-1521, 2020
Mandates: US National Science Foundation, European Commission
Sample-efficient proper PAC learning with approximate differential privacy
B Ghazi, N Golowich, R Kumar, P Manurangsi
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
Mandates: US National Science Foundation
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
Mandates: US National Science Foundation
Friend or foe? population protocols can perform community detection
L Becchetti, A Clementi, E Natale, F Pasquale, P Raghavendra, ...
arXiv preprint arXiv:1703.05045, 2017
Mandates: US National Science Foundation
Consensus halving for sets of items
PW Goldberg, A Hollender, A Igarashi, P Manurangsi, W Suksompong
Mathematics of Operations Research 47 (4), 3357-3379, 2022
Mandates: UK Engineering and Physical Sciences Research Council, European Commission …
The complexity of adversarially robust proper learning of halfspaces with agnostic noise
I Diakonikolas, DM Kane, P Manurangsi
Advances in Neural Information Processing Systems 33, 20449-20461, 2020
Mandates: US National Science Foundation
Approximation and hardness of shift-bribery
P Faliszewski, P Manurangsi, K Sornat
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1901-1908, 2019
Mandates: US National Science Foundation, Swiss National Science Foundation
Computing a small agreeable set of indivisible items
P Manurangsi, W Suksompong
Artificial Intelligence, 2018
Mandates: US National Science Foundation, European Commission
Publication and funding information is determined automatically by a computer program