The following pages link to Pasin Manurangsi (Q513281):
Displayed 50 items.
- Improved approximation algorithms for projection games (Q513283) (← links)
- Asymptotic existence of fair divisions for groups (Q1680744) (← links)
- A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems (Q1730018) (← links)
- On the complexity of fair house allocation (Q2060606) (← links)
- Tight inapproximability of minimum maximal matching on bipartite graphs and related problems (Q2085735) (← links)
- Nearly optimal robust secret sharing against rushing adversaries (Q2102061) (← links)
- To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
- Private aggregation from fewer anonymous messages (Q2119033) (← links)
- Almost envy-freeness for groups: improved bounds via discrepancy theory (Q2166776) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- The price of fairness for indivisible goods (Q2230722) (← links)
- Linear discrepancy is \(\Pi_2\)-hard to approximate (Q2234789) (← links)
- Approximation and hardness of shift-Bribery (Q2238694) (← links)
- Computing a small agreeable set of indivisible items (Q2321268) (← links)
- An improved integrality gap for the Călinescu-Karloff-Rabani relaxation for multiway cut (Q2401143) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- Consensus halving for sets of items (Q2692297) (← links)
- Improved Approximation Algorithms for Projection Games (Q2849357) (← links)
- Dissection with the Fewest Pieces is Hard, Even to Approximate (Q2958085) (← links)
- Approximation Algorithms for Label Cover and The Log-Density Threshold (Q4575796) (← links)
- (Q4636446) (← links)
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph (Q4978037) (← links)
- Closing Gaps in Asymptotic Fair Division (Q4986806) (← links)
- (Q4993301) (← links)
- (Q5002683) (← links)
- (Q5009502) (← links)
- (Q5009512) (← links)
- (Q5009564) (← links)
- (Q5009577) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5032020) (← links)
- Parameterized Intractability of Even Set and Shortest Vector Problem (Q5056405) (← links)
- (Q5077145) (← links)
- (Q5090390) (← links)
- (Q5111409) (← links)
- (Q5111410) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- When Do Envy-Free Allocations Exist? (Q5130903) (← links)
- Tight Running Time Lower Bounds for Strong Inapproximability of Maximum <i>k</i>-Coverage, Unique Set Cover and Related Problems (via <i>t</i>-Wise Agreement Testing Theorem) (Q5146765) (← links)
- On the Parameterized Complexity of Approximating Dominating Set (Q5215462) (← links)
- Multitasking Capacity: Hardness Results and Improved Constructions (Q5220467) (← links)
- On the parameterized complexity of approximating dominating set (Q5230381) (← links)
- Losing Treewidth by Separating Subsets (Q5236288) (← links)
- (Q5351913) (← links)
- Consensus Halving for Sets of Items (Q5870379) (← links)
- (Q6059375) (← links)
- Fixing knockout tournaments with seeds (Q6064833) (← links)
- A note on hardness of computing recursive teaching dimension (Q6072213) (← links)
- Sample-efficient proper PAC learning with approximate differential privacy (Q6086991) (← links)
- Justifying groups in multiwinner approval voting (Q6109541) (← links)
- On maximum bipartite matching with separation (Q6161448) (← links)