Jittat Fakcharoenphol
Jittat Fakcharoenphol
Verified email at - Homepage
Cited by
Cited by
A tight bound on approximating arbitrary metrics by tree metrics
J Fakcharoenphol, S Rao, K Talwar
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
Planar graphs, negative weight edges, shortest paths, and near linear time
J Fakcharoenphol, S Rao
Journal of Computer and System Sciences 72 (5), 868-889, 2006
Approximating aggregate queries about web pages via random walks
Z Bar-Yossef, A Berg, S Chien, J Fakcharoenphol, D Weitz
The k-traveling repairmen problem
J Fakcharoenphol, C Harrelson, S Rao
ACM Transactions on Algorithms (TALG) 3 (4), 40-es, 2007
A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs
N Attiratanasunthron, J Fakcharoenphol
Information Processing Letters 105 (3), 88-92, 2008
An improved approximation algorithm for the 0-extension problem.
J Fakcharoenphol, C Harrelson, S Rao, K Talwar
SODA 3, 257-265, 2003
An improved decomposition theorem for graphs excluding a fixed minor
J Fakcharoenphol, K Talwar
International Workshop on Randomization and Approximation Techniques in …, 2003
Approximate classification via earthmover metrics
A Archer, J Fakcharoenphol, C Harrelson, R Krauthgamer, K Talwar, ...
Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete …, 2004
An O(log^2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem
J Fakcharoenphol, B Laekhanukit
Proceedings of the 40th annual ACM symposium on Theory of computing, 153-158, 2008
Faster algorithms for semi-matching problems
J Fakcharoenphol, B Laekhanukit, D Nanongkai
ACM Transactions on Algorithms (TALG) 10 (3), 1-23, 2014
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs.
P Chalermsook, J Fakcharoenphol, D Nanongkai
SODA 4, 828-829, 2004
Simple distributed algorithms for approximating minimum steiner trees
P Chalermsook, J Fakcharoenphol
Computing and Combinatorics: 11th Annual International Conference, COCOON …, 2005
Approximating metrics by tree metrics
J Fakcharoenphol, S Rao, K Talwar
ACM SIGACT News 35 (2), 60-70, 2004
Improved decompositions of graphs with forbidden minors
J Fakcharoenphol, K Talwar
6th International workshop on Approximation algorithms for combinatorial …, 2003
A faster algorithm for the tree containment problem for binary nearly stable phylogenetic networks
J Fakcharoenphol, T Kumpijit, A Putwattana
2015 12th International Joint Conference on Computer Science and Software …, 2015
A linear-time algorithm for the multiple gene duplication problem
V Mettanant, J Fakcharoenphol
The 12th National Computer Science and Engineering Conference (NCSEC), 198-203, 2008
Detecting and cleaning intruders in sensor networks
P Yospanya, B Laekhanukit, D Nanongkai, J Fakcharoenphol
Proceedings of the 8th National Computer Science and Engineering Conference, 2004
An improved VC-dimension bound for finding network failures
J Fakcharoenphol
Master's thesis, Dept. of EECS, UC Berkeley, 2001
Low congestion online routing and an improved mistake bound for online prediction of graph labeling
J Fakcharoenphol, B Kijsirikul
arXiv preprint arXiv:0809.2075, 2008
A simpler load‐balancing algorithm for range‐partitioned data in peer‐to‐peer systems
J Chawachat, J Fakcharoenphol
Networks 66 (3), 235-249, 2015
The system can't perform the operation now. Try again later.
Articles 1–20