Year |
Citation |
Score |
2017 |
Supeesun A, Fakcharoenphol J. Learning network structures from contagion Information Processing Letters. 121: 11-16. DOI: 10.1016/J.Ipl.2017.01.005 |
0.316 |
|
2015 |
Fakcharoenphol J, Kumpijit T, Putwattana A. A faster algorithm for the tree containment problem for binary nearly stable phylogenetic networks Proceedings of the 2015 12th International Joint Conference On Computer Science and Software Engineering, Jcsse 2015. 337-342. DOI: 10.1109/JCSSE.2015.7219820 |
0.407 |
|
2015 |
Chawachat J, Fakcharoenphol J. A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems Networks. 66: 235-249. DOI: 10.1002/Net.21627 |
0.388 |
|
2014 |
Fakcharoenphol J, Laekhanukit B, Nanongkai D. Faster algorithms for semi-matching problems Acm Transactions On Algorithms. 10. DOI: 10.1145/2601071 |
0.564 |
|
2012 |
Fakcharoenphol J, Laekhanukit B. An O(log 2 k)-Approximation algorithm for the k-vertex connected spanning Subgraph problem Siam Journal On Computing. 41: 1095-1109. DOI: 10.1137/110855910 |
0.62 |
|
2012 |
Suraprasert S, Fakcharoenphol J. Comparison of recovery schemes to maximize restorable throughput in multicast networks Journal of Network and Computer Applications. 35: 1106-1115. DOI: 10.1016/J.Jnca.2011.12.010 |
0.306 |
|
2012 |
Chawachat J, Fakcharoenphol J, Jindaluang W. The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking Information Processing Letters. 112: 937-941. DOI: 10.1016/J.Ipl.2012.08.015 |
0.588 |
|
2011 |
Eamopas M, Fakcharoenphol J. An improved bound for multiple source-sink linear network coding Proceedings of the 2011 8th International Joint Conference On Computer Science and Software Engineering, Jcsse 2011. 12-16. DOI: 10.1109/JCSSE.2011.5930078 |
0.54 |
|
2010 |
Fakcharoenphol J, Kijsirikul B. Short proofs for online multiclass prediction on graphs Information Processing Letters. 110: 309-311. DOI: 10.1016/J.Ipl.2010.02.008 |
0.478 |
|
2008 |
Attiratanasunthron N, Fakcharoenphol J. A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs Information Processing Letters. 105: 88-92. DOI: 10.1016/J.Ipl.2007.08.013 |
0.461 |
|
2008 |
Fakcharoenphol J, Laekhanukit B. An O(log2 k)-Approximation algorithm for the k-Vertex connected spanning subgraph problem Proceedings of the Annual Acm Symposium On Theory of Computing. 153-158. |
0.529 |
|
2006 |
Fakcharoenphol J, Rao S. Planar graphs, negative weight edges, shortest paths, and near linear time Journal of Computer and System Sciences. 72: 868-889. DOI: 10.1016/J.Jcss.2005.05.007 |
0.55 |
|
2005 |
Fakcharoenphol J, Kijsirikul B. 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). 3734: 135-147. DOI: 10.1007/11564089_12 |
0.382 |
|
2005 |
Chalermsook P, Fakcharoenphol J. Simple distributed algorithms for approximating minimum steiner trees Lecture Notes in Computer Science. 3595: 380-389. |
0.401 |
|
2004 |
Fakcharoenphol J, Rao S, Talwar K. Approximating metrics by tree metrics Sigact News. 35: 60-70. DOI: 10.1145/992287.992300 |
0.497 |
|
2004 |
Fakcharoenphol J, Rao S, Talwar K. A tight bound on approximating arbitrary metrics by tree metrics Journal of Computer and System Sciences. 69: 485-497. DOI: 10.1016/J.Jcss.2004.04.011 |
0.602 |
|
2004 |
Archer A, Fakcharoenphol J, Harrelson C, Krauthgamer R, Talwar K, Tardos E. Approximate classification via earthmover metrics Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 1072-1080. |
0.481 |
|
2004 |
Chalermsook P, Fakcharoenphol J, Nanongkai D. A deterministic near-linear time algorithm for finding minimum cuts in planar graphs Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 821-822. |
0.367 |
|
2003 |
Fakcharoenphol J, Harrelson C, Rao S. The k-traveling repairman problem Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 655-664. |
0.772 |
|
2003 |
Fakcharoenphol J, Harrelson C, Rao S, Talwar K. An improved approximation algorithm for the 0-extension problem Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 257-265. |
0.579 |
|
Show low-probability matches. |