Pasin Manurangsi

Available identifiers

zbMath Open manurangsi.pasinMaRDI QIDQ513281

List of research outcomes

Publication	Date of Publication	Type
Fixing knockout tournaments with seeds	2023-12-11	Paper
Sample-efficient proper PAC learning with approximate differential privacy	2023-11-14	Paper
https://portal.mardi4nfdi.de/entity/Q6059375	2023-11-02	Paper
A note on hardness of computing recursive teaching dimension	2023-10-12	Paper
Justifying groups in multiwinner approval voting	2023-08-01	Paper
Justifying groups in multiwinner approval voting	2023-07-28	Paper
On maximum bipartite matching with separation	2023-06-05	Paper
Consensus halving for sets of items	2023-03-21	Paper
Consensus Halving for Sets of Items	2023-01-09	Paper
Parameterized Intractability of Even Set and Shortest Vector Problem	2022-12-08	Paper
Nearly optimal robust secret sharing against rushing adversaries	2022-12-07	Paper
Tight inapproximability of minimum maximal matching on bipartite graphs and related problems	2022-10-19	Paper
Almost envy-freeness for groups: improved bounds via discrepancy theory	2022-08-25	Paper
https://portal.mardi4nfdi.de/entity/Q5090390	2022-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q5077145	2022-05-18	Paper
Private aggregation from fewer anonymous messages	2022-03-23	Paper
To close is easier than to open: dual parameterization to \(k\)-median	2022-03-22	Paper
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems	2022-02-16	Paper
On the complexity of fair house allocation	2021-12-13	Paper
Approximation and hardness of shift-Bribery	2021-11-02	Paper
Linear discrepancy is \(\Pi_2\)-hard to approximate	2021-10-19	Paper
The price of fairness for indivisible goods	2021-09-28	Paper
https://portal.mardi4nfdi.de/entity/Q5009502	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5009512	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5009564	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5009577	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5002683	2021-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q4993301	2021-06-15	Paper
Almost Envy-Freeness for Groups: Improved Bounds via Discrepancy Theory	2021-05-04	Paper
Generalized Kings and Single-Elimination Winners in Random Tournaments	2021-05-01	Paper
Closing Gaps in Asymptotic Fair Division	2021-04-28	Paper
Tight Running Time Lower Bounds for Strong Inapproximability of Maximum k-Coverage, Unique Set Cover and Related Problems (via t-Wise Agreement Testing Theorem)	2021-02-02	Paper
On closest pair in Euclidean metric: monochromatic is as hard as bichromatic	2021-01-25	Paper
When Do Envy-Free Allocations Exist?	2020-10-29	Paper
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More	2020-08-18	Paper
Near-tight closure bounds for Littlestone and threshold dimensions	2020-07-07	Paper
https://portal.mardi4nfdi.de/entity/Q5111409	2020-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q5111410	2020-05-27	Paper
Multitasking Capacity: Hardness Results and Improved Constructions	2020-03-26	Paper
On the Parameterized Complexity of Approximating Dominating Set	2020-02-11	Paper
Losing Treewidth by Separating Subsets	2019-10-15	Paper
Computing a small agreeable set of indivisible items	2019-08-28	Paper
On the parameterized complexity of approximating dominating set	2019-08-22	Paper
Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis	2019-05-08	Paper
A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems	2019-03-11	Paper
Approximation Algorithms for Label Cover and The Log-Density Threshold	2018-07-16	Paper
https://portal.mardi4nfdi.de/entity/Q4636446	2018-04-19	Paper
Asymptotic existence of fair divisions for groups	2017-11-16	Paper
An improved integrality gap for the Călinescu-Karloff-Rabani relaxation for multiway cut	2017-08-31	Paper
https://portal.mardi4nfdi.de/entity/Q5351913	2017-08-31	Paper
Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph	2017-08-17	Paper
Improved approximation algorithms for projection games	2017-03-03	Paper
Dissection with the Fewest Pieces is Hard, Even to Approximate	2017-02-01	Paper
Improved Approximation Algorithms for Projection Games	2013-09-17	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Pasin Manurangsi