Jittat Fakcharoenphol

1. Faster Algorithms for Semi-Matching Problems
   2010/04/20 by Jittat Fakcharoenphol, Fakcharoenphol, Jittat, Bundit Laekhanukit +3 · 1 citation
   Computer Science · #05C85 #68P05 #90B35 #Data Structures and Algorithms (cs.DS) #E.1 #F.2.2 #FOS: Computer and information sciences #G.2.2 #acm:05C85 #acm:68P05 #acm:90B35 #cs.DS #msc:05C85 #msc:68P05 #msc:90B35
2. A PTAS for k-hop MST on the Euclidean plane: Improving Dependency on k
   2021/06/21 by Jittat Fakcharoenphol, Fakcharoenphol, Jittat, Nonthaphat Wongwattanakij +1 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Algorithms and Data Compression #Complexity and Algorithms in Graphs #Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
3. Low congestion online routing and an improved mistake bound for online prediction of graph labeling
   2008/09/11 by Jittat Fakcharoenphol, Fakcharoenphol, Jittat, Boonserm Kijsirikul +1 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #Machine Learning (cs.LG) #Optimization and Search Problems #cs.DM #cs.DS #cs.LG
4. Covering Planar Lattices with Interior-Disjoint Unit Disks
   2026/07/22 by Nattawut Phetmak, Grittin Nuntasombat, Jittat Fakcharoenphol
   Computer Science · #cs.CG