| # | Document title | Authors | Year | Source | Cited by |
| 1 | A tight bound on approximating arbitrary metrics by tree metrics | Fakcharoenphol J., Rao S., Talwar K. | 2004 | Journal of Computer and System Sciences,
69(3 SPEC. ISS.), pp. 485-497 | 392 |
| 2 | A tight bound on approximating arbitrary metrics by tree metrics | Fakcharoenphol J., Rao S., Talwar K. | 2003 | Conference Proceedings of the Annual ACM Symposium on Theory of Computing,
pp. 448-455 | 335 |
| 3 | Planar graphs, negative weight edges, shortest paths, and near linear time | Fakcharoenphol J., Rao S. | 2006 | Journal of Computer and System Sciences,
72(5), pp. 868-889 | 158 |
| 4 | A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs | Attiratanasunthron N., Fakcharoenphol J. | 2008 | Information Processing Letters,
105(3), pp. 88-92 | 72 |
| 5 | An improved decomposition theorem for graphs excluding a fixed minor | Fakcharoenphol J., Talwar K. | 2003 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
2764, pp. 36-46 | 59 |
| 6 | The k-traveling repairmen problem | Fakcharoenphol J., Harrelson C., Rao S. | 2007 | ACM Transactions on Algorithms,
3(4), 1290677 | 59 |
| 7 | The k-traveling repairman problem | Fakcharoenphol J., Harrelson C., Rao S. | 2003 | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms,
pp. 655-664 | 56 |
| 8 | Planar graphs, negative weight edges, shortest paths, and near linear time | Fakcharoenphol J., Rao S. | 2001 | Annual Symposium on Foundations of Computer Science - Proceedings,
pp. 232-241 | 51 |
| 9 | An improved approximation algorithm for the 0-extension problem | Fakcharoenphol J., Harrelson C., Rao S., Talwar K. | 2003 | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms,
pp. 257-265 | 47 |
| 10 | Approximate classification via earthmover metrics | Archer A., Fakcharoenphol J., Harrelson C., Krauthgamer R., Talwar K., Tardos E. | 2004 | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms,
15, pp. 1072-1080 | 41 |
| 11 | An O(log2 k)-Approximation algorithm for the k-Vertex connected spanning subgraph problem | Fakcharoenphol J., Laekhanukit B. | 2008 | Proceedings of the Annual ACM Symposium on Theory of Computing,
pp. 153-158 | 27 |
| 12 | A deterministic near-linear time algorithm for finding minimum cuts in planar graphs | Chalermsook P., Fakcharoenphol J., Nanongkai D. | 2004 | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms,
15, pp. 821-822 | 26 |
| 13 | An O(log 2 k)-Approximation algorithm for the k-vertex connected spanning Subgraph problem | Fakcharoenphol J., Laekhanukit B. | 2012 | SIAM Journal on Computing,
41(5), pp. 1095-1109 | 20 |
| 14 | Faster algorithms for semi-matching problems | Fakcharoenphol J., Laekhanukit B., Nanongkai D. | 2014 | ACM Transactions on Algorithms,
10(3), 14 | 19 |
| 15 | Simple distributed algorithms for approximating minimum steiner trees | Chalermsook P., Chalermsook P., Fakcharoenphol J. | 2005 | Lecture Notes in Computer Science,
3595, pp. 380-389 | 19 |
| 16 | Faster algorithms for semi-matching problems | Fakcharoenphol J., Laekhanukit B., Nanongkai D. | 2010 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
6198 LNCS(PART 1), pp. 176-187 | 11 |
| 17 | A faster algorithm for the tree containment problem for binary nearly stable phylogenetic networks | Fakcharoenphol J., Kumpijit T., Putwattana A. | 2015 | Proceedings of the 2015 12th International Joint Conference on Computer Science and Software Engineering, JCSSE 2015,
pp. 337-342, 7219820 | 9 |
| 18 | A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems | Chawachat J., Fakcharoenphol J. | 2015 | Networks,
66(3), pp. 235-249 | 5 |
| 19 | An improved centralized algorithm for distance-preserving dominating sets in heterogeneous wireless sensor networks | Putwattana A., Fakcharoenphol J. | 2017 | 20th International Computer Science and Engineering Conference: Smart Ubiquitos Computing and Knowledge, ICSEC 2016,
7859930 | 4 |
| 20 | Practical Differential Privacy for Location Data Aggregation using a Hadamard Matrix | Sangiamchit P., Fakcharoenphol J. | 2019 | JCSSE 2019 - 16th International Joint Conference on Computer Science and Software Engineering: Knowledge Evolution Towards Singularity of Man-Machine Intelligence,
pp. 79-84, 8864180 | 3 |
| 21 | Constructing multiclass learners from binary learners: A simple black-box analysis of the generalization errors | Fakcharoenphol J., Kijsirikul B. | 2005 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
3734 LNAI, pp. 135-147 | 3 |
| 22 | Learning network structures from contagion | Supeesun A., Fakcharoenphol J. | 2017 | Information Processing Letters,
121, pp. 11-16 | 2 |
| 23 | An improved approximation algorithm for the s-t path movement problem | Jindaluang W., Chawachat J., Chouvatut V., Fakcharoenphol J., Kantabutra S. | 2017 | Chiang Mai Journal of Science,
44(1), pp. 279-286 | 1 |
| 24 | The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking | Chawachat J., Fakcharoenphol J., Jindaluang W. | 2012 | Information Processing Letters,
112(24), pp. 937-941 | 1 |
| 25 | Fair resource allocation for demands with sharp lower tail inequalities | Mettanant V., Fakcharoenphol J. | 2021 | Operations Research Letters,
49(4), pp. 590-596 | 1 |
| 26 | An nO(1/ϵ) Approximation Scheme for the Minimum Dominating Set in Unit Disk Graphs | Fakcharoephol J., Sukprasert P., Sukprasert P. | 2018 | Proceeding of 2018 15th International Joint Conference on Computer Science and Software Engineering, JCSSE 2018,
8457372 | 1 |
| 27 | Erratum: Constructing multiclass learners from binary learners: A simple black-box analysis of the generalization errors (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)) | Fakcharoenphol J., Kijsirikul B. | 2008 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
5254 LNAI, pp. 464-466 | 1 |
| 28 | Short proofs for online multiclass prediction on graphs | Fakcharoenphol J., Kijsirikul B. | 2010 | Information Processing Letters,
110(8-9), pp. 309-311 | 0 |
| 29 | Building two communication towers over a terrain | Aiemvaravutigul C., Fakcharoenphol J., Phetmak N. | 2020 | JCSSE 2020 - 17th International Joint Conference on Computer Science and Software Engineering,
pp. 150-154, 09268436 | 0 |
| 30 | Approximating k-Connected m-Dominating Sets in Disk Graphs | Burathep K., Fakcharoenphol J., Wongwattanakij N. | 2020 | 2020 24th International Computer Science and Engineering Conference, ICSEC 2020,
9375178 | 0 |
| 31 | Improved Generative Adversarial Networks for Intersection of Two Domains | Charattrakool M., Fakcharoenphol J. | 2022 | 2022 19th International Joint Conference on Computer Science and Software Engineering, JCSSE 2022 | 0 |
| 32 | An Approximation Algorithm for the Vertex Multicut on Trees with an Application to the Tracking Paths Problem | Burathep K., Fakcharoenphol J. | 2022 | 2022 19th International Joint Conference on Computer Science and Software Engineering, JCSSE 2022 | 0 |
| 33 | MAX-CUT on Samplings of Dense Graphs | Fakcharoenphol J., Vajanopath P. | 2022 | 2022 19th International Joint Conference on Computer Science and Software Engineering, JCSSE 2022 | 0 |
| 34 | Improved Fairlet Decomposition for Fair Correlation Clustering | Mettanant V., Supeesun A., Fakcharoenphol J. | 2023 | ECTI Transactions on Computer and Information Technology,
17(1), pp. 137-152 | 0 |
| 35 | Folding Every Point on a Polygon Boundary to a Point | Phetmak N., Fakcharoenphol J. | 2023 | Algorithms,
16(6), 281 | 0 |
| 36 | Uniformly Generating Derangements with Fixed Number of Cycles in Polynomial Time | Phetmak N., Fakcharoenphol J. | 2023 | Thai Journal of Mathematics,
21(4), pp. 899-915 | 0 |
| 37 | Estimating Group Fairness Using Pairwise Similarity | Supeesun A., Chawachat J., Mettanant V., Fakcharoenphol J. | 2024 | Proceedings - 21st International Joint Conference on Computer Science and Software Engineering, JCSSE 2024,
pp. 343-350 | 0 |
| 38 | An improved PTAS for covering targets with mobile sensors | Wongwattanakij N., Phetmak N., Jaikaeo C., Fakcharoenphol J. | 2025 | Journal of Combinatorial Optimization,
49(2), 20 | 0 |
| 39 | A PTAS for k-hop MST on the Euclidean plane: Improving dependency on k | Fakcharoenphol J., Wongwattanakij N. | 2025 | Information Processing Letters,
190, 106581 | 0 |
| 40 | Shortest Paths in Planar Graphs with Negative Weight Edges | Fakcharoenphol J., Rao S. | 2016 | Encyclopedia of Algorithms Second Edition,
pp. 1971-1974 | 0 |
| 41 | Approximating Metric Spaces by Tree Metrics | Fakcharoenphol J., Rao S., Talwar K. | 2016 | Encyclopedia of Algorithms Second Edition,
pp. 113-116 | 0 |
| 42 | Robust Bichromatic Classification in 3D Using Planes and Slices | Nuntasombat G., Phetmak N., Fakcharoenphol J. | 2025 | 22nd International Conference on Electrical Engineering Electronics Computer Telecommunications and Information Technology Ecti Con 2025 | 0 |
| 43 | Data-Diff with Strict Increment Modifiers | Wattanawaroon T., Fakcharoenphol J., Rakthanmanon T. | 2025 | Icsec 2025 29th International Computer Science and Engineering Conference 2025,
pp. 94-99 | 0 |
| 44 | An Improved Linear Extractable Sketch Data Structure for Flow Count Statistics | Tantiameorn P., Nuntasombat G., Fakcharoenphol J. | 2025 | Icsec 2025 29th International Computer Science and Engineering Conference 2025,
pp. 298-304 | 0 |
| 45 | Bandit Multiclass Linear Classification for the Group Linear Separable Case | Fakcharoenphol J., Prompak C. | 2019 | Proceedings - 2019 14th International Joint Symposium on Artificial Intelligence and Natural Language Processing, iSAI-NLP 2019,
9045540 | 0 |
| 46 | Get involved! The IOI workshop 2010, its goals and results | Pohl W., Burton B., Dagiene V., Fakcharoenphol J., Forišek M., Hiron M., Opmanis M., Skupas B., Van Der Vegt W. | 2010 | Olympiads in Informatics,
4, pp. 158-169 | 0 |
| 47 | An improved bound for multiple source-sink linear network coding | Eamopas M., Fakcharoenphol J. | 2011 | Proceedings of the 2011 8th International Joint Conference on Computer Science and Software Engineering, JCSSE 2011,
pp. 12-16, 5930078 | 0 |
| 48 | Comparison of recovery schemes to maximize restorable throughput in multicast networks | Suraprasert S., Fakcharoenphol J. | 2012 | Journal of Network and Computer Applications,
35(3), pp. 1106-1115 | 0 |