Approximating Aggregate Queries about Web Pages via Random Walks. - Ziv Bar-Yossef; Alexander C. Berg; Steve Chien; Jittat Fakcharoenphol; Dror Weitz (VLDB, 2000)

Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time. - Jittat Fakcharoenphol; Satish Rao (FOCS, 2001)

An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor. - Jittat Fakcharoenphol; Kunal Talwar (RANDOM-APPROX, 2003)

The k-traveling repairman problem. - Jittat Fakcharoenphol; Chris Harrelson; Satish Rao (SODA, 2003)

An improved approximation algorithm for the 0-extension problem. - Jittat Fakcharoenphol; Chris Harrelson; Satish Rao; Kunal Talwar (SODA, 2003)

Approximate classification via earthmover metrics. - Aaron Archer; Jittat Fakcharoenphol; Chris Harrelson; Robert Krauthgamer; Kunal Talwar; Éva Tardos (SODA, 2004)

A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. - Parinya Chalermsook; Jittat Fakcharoenphol; Danupon Nanongkai (SODA, 2004)

A tight bound on approximating arbitrary metrics by tree metrics. - Jittat Fakcharoenphol; Satish Rao; Kunal Talwar (J. Comput. Syst. Sci., 2004)

Approximating metrics by tree metrics. - Jittat Fakcharoenphol; Satish Rao; Kunal Talwar (SIGACT News, 2004)

Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors. - Jittat Fakcharoenphol; Boonserm Kijsirikul (ALT, 2005)

Simple Distributed Algorithms for Approximating Minimum Steiner Trees. - Parinya Chalermsook; Jittat Fakcharoenphol (COCOON, 2005)

Planar graphs, negative weight edges, shortest paths, and near linear time. - Jittat Fakcharoenphol; Satish Rao (J. Comput. Syst. Sci., 2006)

The k-traveling repairmen problem. - Jittat Fakcharoenphol; Chris Harrelson; Satish Rao (ACM Trans. Algorithms, 2007)

Erratum: Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors. - Jittat Fakcharoenphol; Boonserm Kijsirikul (ALT, 2008)

An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem. - Jittat Fakcharoenphol; Bundit Laekhanukit (STOC, 2008)

Low congestion online routing and an improved mistake bound for online prediction of graph labeling - Jittat Fakcharoenphol; Boonserm Kijsirikul (CoRR, 2008)

A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs. - Nattapat Attiratanasunthron; Jittat Fakcharoenphol (Inf. Process. Lett., 2008)

Shortest Paths in Planar Graphs with Negative Weight Edges. - Jittat Fakcharoenphol; Satish Rao (Encyclopedia of Algorithms, 2008)

Approximating Metric Spaces by Tree Metrics. - Jittat Fakcharoenphol; Satish Rao; Kunal Talwar (Encyclopedia of Algorithms, 2008)

Faster Algorithms for Semi-matching Problems (Extended Abstract). - Jittat Fakcharoenphol; Bundit Laekhanukit; Danupon Nanongkai (ICALP (1), 2010)

Short proofs for online multiclass prediction on graphs. - Jittat Fakcharoenphol; Boonserm Kijsirikul (Inf. Process. Lett., 2010)

The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking. - Jakarin Chawachat; Jittat Fakcharoenphol; Wattana Jindaluang (Inf. Process. Lett., 2012)

Comparison of recovery schemes to maximize restorable throughput in multicast networks. - S. Suraprasert; Jittat Fakcharoenphol (J. Netw. Comput. Appl., 2012)

An O(log2k)-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem. - Jittat Fakcharoenphol; Bundit Laekhanukit (SIAM J. Comput., 2012)

Faster Algorithms for Semi-Matching Problems. - Jittat Fakcharoenphol; Bundit Laekhanukit; Danupon Nanongkai (ACM Trans. Algorithms, 2014)

A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems. - Jakarin Chawachat; Jittat Fakcharoenphol (Networks, 2015)

Shortest Paths in Planar Graphs with Negative Weight Edges. - Jittat Fakcharoenphol; Satish Rao (Encyclopedia of Algorithms, 2016)

Approximating Metric Spaces by Tree Metrics. - Jittat Fakcharoenphol; Satish Rao; Kunal Talwar (Encyclopedia of Algorithms, 2016)

Finding All Useless Arcs in Directed Planar Graphs. - Jittat Fakcharoenphol; Bundit Laekhanukit; Pattara Sukprasert (CoRR, 2017)

Learning network structures from contagion. - Adisak Supeesun; Jittat Fakcharoenphol (Inf. Process. Lett., 2017)

An nO(1/ϵ) Approximation Scheme For The Minimum Dominating Set In Unit Disk Graphs. - Jittat Fakcharoenphol; Pattara Sukprasert (JCSSE, 2018)

Practical Differential Privacy for Location Data Aggregation using a Hadamard Matrix. - Patinya Sangiamchit; Jittat Fakcharoenphol (JCSSE, 2019)

Bandit Multiclass Linear Classification for the Group Linear Separable Case. - Jittat Fakcharoenphol; Chayutpong Prompak (CoRR, 2019)

Building two communication towers over a terrain. - Chawin Aiemvaravutigul; Jittat Fakcharoenphol; Nattawut Phetmak (JCSSE, 2020)

Fair resource allocation for demands with sharp lower tail inequalities. - Vacharapat Mettanant; Jittat Fakcharoenphol (Oper. Res. Lett., 2021)

An Approximation Algorithm for the Vertex Multicut on Trees with an Application to the Tracking Paths Problem. - Kunanon Burathep; Jittat Fakcharoenphol (JCSSE, 2022)

Improved Generative Adversarial Networks for Intersection of Two Domains. - Monthol Charattrakool; Jittat Fakcharoenphol (JCSSE, 2022)

MAX-CUT on Samplings of Dense Graphs. - Jittat Fakcharoenphol; Phanu Vajanopath (JCSSE, 2022)

Stochastic Contextual Bandits with Graph-based Contexts. - Jittat Fakcharoenphol; Chayutpong Prompak (CoRR, 2023)

Folding Every Point on a Polygon Boundary to a Point. - Nattawut Phetmak; Jittat Fakcharoenphol (Algorithms, 2023)

Estimating Group Fairness Using Pairwise Similarity. - Adisak Supeesun; Jakarin Chawachat; Vacharapat Mettanant; Jittat Fakcharoenphol (JCSSE, 2024)

A PTAS for k-hop MST on the Euclidean plane: Improving dependency on k. - Jittat Fakcharoenphol; Nonthaphat Wongwattanakij (Inf. Process. Lett., 2025)

An improved PTAS for covering targets with mobile sensors. - Nonthaphat Wongwattanakij; Nattawut Phetmak; Chaiporn Jaikaeo; Jittat Fakcharoenphol (J. Comb. Optim., 2025)