| 2010 | ICALP | Faster Algorithms for Semi-matching Problems (Extended Abstract). | Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai |
| 2008 | ALT | Erratum: Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors. | Jittat Fakcharoenphol, Boonserm Kijsirikul |
| 2008 | STOC | An o(log | Jittat Fakcharoenphol, Bundit Laekhanukit |
| 2005 | ALT | Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors. | Jittat Fakcharoenphol, Boonserm Kijsirikul |
| 2005 | COCOON | Simple Distributed Algorithms for Approximating Minimum Steiner Trees. | Parinya Chalermsook, Jittat Fakcharoenphol |
| 2004 | SODA | Approximate classification via earthmover metrics. | Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, va Tardos |
| 2004 | SODA | A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. | Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai |
| 2003 | SODA | The k-traveling repairman problem. | Jittat Fakcharoenphol, Chris Harrelson, Satish Rao |
| 2003 | SODA | An improved approximation algorithm for the 0-extension problem. | Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar |
| 2003 | STOC | A tight bound on approximating arbitrary metrics by tree metrics. | Jittat Fakcharoenphol, Satish Rao, Kunal Talwar |
| 2001 | FOCS | Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time. | Jittat Fakcharoenphol, Satish Rao |
| 2000 | VLDB | Approximating Aggregate Queries about Web Pages via Random Walks. | Ziv Bar-Yossef, Alexander C. Berg, Steve Chien, Jittat Fakcharoenphol, Dror Weitz |