Jittat Fakcharoenphol, Ph.D.
Affiliations: | 2003 | University of California, Berkeley, Berkeley, CA, United States |
Area:
Biosystems & Computational Biology (BIO); Theory (THY)Google:
"Jittat Fakcharoenphol"Parents
Sign in to add mentorSatish Rao | grad student | 2003 | UC Berkeley | |
(Algorithms for planar graphs.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Supeesun A, Fakcharoenphol J. (2017) Learning network structures from contagion Information Processing Letters. 121: 11-16 |
Fakcharoenphol J, Kumpijit T, Putwattana A. (2015) 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 |
Chawachat J, Fakcharoenphol J. (2015) A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems Networks. 66: 235-249 |
Fakcharoenphol J, Laekhanukit B, Nanongkai D. (2014) Faster algorithms for semi-matching problems Acm Transactions On Algorithms. 10 |
Fakcharoenphol J, Laekhanukit B. (2012) An O(log 2 k)-Approximation algorithm for the k-vertex connected spanning Subgraph problem Siam Journal On Computing. 41: 1095-1109 |
Suraprasert S, Fakcharoenphol J. (2012) Comparison of recovery schemes to maximize restorable throughput in multicast networks Journal of Network and Computer Applications. 35: 1106-1115 |
Chawachat J, Fakcharoenphol J, Jindaluang W. (2012) The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking Information Processing Letters. 112: 937-941 |
Eamopas M, Fakcharoenphol J. (2011) 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 |
Fakcharoenphol J, Kijsirikul B. (2010) Short proofs for online multiclass prediction on graphs Information Processing Letters. 110: 309-311 |
Attiratanasunthron N, Fakcharoenphol J. (2008) A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs Information Processing Letters. 105: 88-92 |