 | 2012 |
|---|
| 10 |       | Parinya Chalermsook,
Julia Chuzhoy,
Alina Ene,
Shi Li:
Approximation algorithms and hardness of integral concurrent flow.
STOC 2012: 689-708 |
| 9 | | Parinya Chalermsook,
Khaled M. Elbassioni,
Danupon Nanongkai,
He Sun:
Multi-Attribute Profit-Maximizing Pricing (Extended Abstract)
CoRR abs/1202.2840: (2012) |
| 8 | | Parinya Chalermsook,
Shiva Kintali,
Richard J. Lipton,
Danupon Nanongkai:
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-partite graphs
CoRR abs/1203.1940: (2012) |
| 2011 |
|---|
| 7 | | Parinya Chalermsook:
Coloring and Maximum Independent Set of Rectangles.
APPROX-RANDOM 2011: 123-134 |
| 2010 |
|---|
| 6 | | Parinya Chalermsook,
Julia Chuzhoy:
Resource Minimization for Fire Containment.
SODA 2010: 1334-1349 |
| 5 | | Patrick Briest,
Parinya Chalermsook,
Sanjeev Khanna,
Bundit Laekhanukit,
Danupon Nanongkai:
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.
WINE 2010: 444-454 |
| 2009 |
|---|
| 4 | | Parinya Chalermsook,
Julia Chuzhoy:
Maximum independent set of rectangles.
SODA 2009: 892-901 |
| 3 | | Parinya Chalermsook,
Bundit Laekhanukit,
Danupon Nanongkai:
Stackelberg Pricing is Hard to Approximate within $2-\epsilon$
CoRR abs/0910.0443: (2009) |
| 2005 |
|---|
| 2 | | Parinya Chalermsook,
Jittat Fakcharoenphol:
Simple Distributed Algorithms for Approximating Minimum Steiner Trees.
COCOON 2005: 380-389 |
| 2004 |
|---|
| 1 | | Parinya Chalermsook,
Jittat Fakcharoenphol,
Danupon Nanongkai:
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs.
SODA 2004: 828-829 |
Data released under the ODC-BY 1.0 license — See also our legal information page