| # | Document title | Authors | Year | Source | Cited by |
| 1 | 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 | 298 |
| 2 | 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 |
| 3 | 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 | 6 |
| 4 | 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 |
| 5 | Learning network structures from contagion | Supeesun A., Fakcharoenphol J. | 2017 | Information Processing Letters
121,pp. 11-16 | 0 |
| 6 | 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
| 2 |
| 7 | 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 | 2 |
| 8 | The k-traveling repairmen problem | Fakcharoenphol J., Harrelson C., Rao S. | 2007 | ACM Transactions on Algorithms
3(4) | 46 |
| 9 | 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 | 124 |
| 10 | 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 |
| 11 | 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 |
| 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 | 23 |
| 13 | 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 | 59 |
| 14 | 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
| 0 |
| 15 | Fair resource allocation for demands with sharp lower tail inequalities | Mettanant V., Fakcharoenphol J. | 2021 | Operations Research Letters
49(4),pp. 590-596 | 0 |
| 16 | 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 | 55 |
| 17 | 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 | 25 |
| 18 | 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 | 0 |
| 19 | 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 | 0 |
| 20 | 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 | 286 |
| 21 | 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
| 0 |
| 22 | 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 |
| 23 | Faster algorithms for semi-matching problems | Fakcharoenphol J., Laekhanukit B., Nanongkai D. | 2014 | ACM Transactions on Algorithms
10(3) | 14 |
| 24 | 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
| 1 |
| 25 | 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 | 15 |
| 26 | 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 | 43 |
| 27 | 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 |
| 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 | 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 | 44 |
| 30 | 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 | 32 |
| 31 | 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 |
| 32 | 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 |
| 33 | 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 | 45 |
| 34 | Simple distributed algorithms for approximating minimum steiner trees | Chalermsook P., Chalermsook P., Fakcharoenphol J. | 2005 | Lecture Notes in Computer Science
3595,pp. 380-389 | 17 |