My research interests are in design and analysis of algorithms and 
combinatorial optimization. 

===== Theory publications =====
  * [[https://arxiv.org/abs/1705.10051|Learning Network Structures from Contagion]]. (with Adisak Supeesun) //IPL.//
  * [[http://it.science.cmu.ac.th/ejournal/journalDetail.php?journal_id=7681|An Improved Approximation Algorithm for the s-t Path Movement Problem]]. (with Wattana Jindaluang, Jakarin Chawachat, Varin Chouvatut, Sanpawat Kantabutra) //Chiang Mai Journal of Science.//
  * [[http://arxiv.org/abs/1210.7954|A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems]]. (with Jakarin Chawachat) //Networks.// ([[http://onlinelibrary.wiley.com/doi/10.1002/net.21627/abstract|journal version]])
  * [[http://theory.cpe.ku.ac.th/~jittat/papers/ipl-min-diameter.pdf|The Non-uniform Bounded Degree Minimum Diameter Spanning Tree Problem with an Application in P2P Networking]]. (with Jakarin Chawachat and Wattana Jindaluang) //IPL.//
  * [[http://theory.cpe.ku.ac.th/~jittat/papers/jcsse2011-multinetcode.pdf|An improved bound for multiple source-sink linear network coding]]. (with Munin Eamopas) //JCSSE 2011.// 
  * [[http://arxiv.org/abs/1004.3363|Faster Algorithms for Semi-Matching Problems]]. (with Bundit Laekhanukit and Danupon Nanongkai) //ICALP 2010.// ([[https://dl.acm.org/citation.cfm?doid=2601071|journal version]] in TALG)
  * [[http://theory.cpe.ku.ac.th/~jittat/papers/ipl-graph-prediction-nn.pdf|Short proofs for online multiclass prediction on graphs]]. (with Boonserm Kijsirikul) //IPL.// 
  * [[http://arxiv.org/abs/0809.2075|Low congestion online routing and an improved mistake bound for online prediction of graph labeling]]. (with Boonserm Kijsirikul) //manuscript.// 
  * [[http://theory.cpe.ku.ac.th/~jittat/papers/ncsec08-LinearMGDP.pdf|A Linear-Time Algorithm for the Multiple Gene Duplication Problem]]. (with Vacharapat Mettanant) //The 12th National Computer Science and Engineering Conference (NCSEC'08).//
  * [[http://www.cpe.ku.ac.th/~jtf/papers/kvcss.pdf|An $O(\log^2 k)$-approximation algorithm for the $k$-vertex connected spanning subgraph problem]] (with [[http://lbundit.googlepages.com/|Bundit Laekhanukit]]).  //STOC'08.//
  * [[http://theory.cpe.ku.ac.th/~jittat/papers/jcsse08-imp_importance_final.pdf|A better analysis of a Perceptron-based algorithm for multiclass importance weighted online learning]] //JCSSE 2008.// (with Adisak Supeesun)
  * [[http://www.cpe.ku.ac.th/~jtf/papers/ant-short.pdf|A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs]] (with Nattapat Attiratanasunthron). //IPL//. 105(3), pp 88-92, 2008.
  * [[http://www.cpe.ku.ac.th/~jtf/papers/blackbox-erratum.pdf|Erratum]] to [[http://www.cpe.ku.ac.th/~jtf/papers/blackbox.ps|Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors.]] //ALT'05// (with [[http://www.cp.eng.chula.ac.th/~boonserm/|Boonserm Kijsirikul]])\\ Note: This paper contains errors. See the [[http://www.cpe.ku.ac.th/~jtf/papers/blackbox-erratum.pdf|erratum]].
  * [[http://www.cpe.ku.ac.th/~jtf/papers/dist-steiner.pdf|Simple distributed algorithms for approximating Steiner trees]] //COCOON'05// (with Parinya Chalermsook)
  * [[http://www.cpe.ku.ac.th/~jtf/papers/decomposable.ps|Approximate classification via earthmover metrics]]. //SODA 04// (with Aaron Archer, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, and Eva Tardos)
  * [[http://www.cpe.ku.ac.th/~jtf/papers/planarmincut.ps|A deterministic nearly linear-time algorithm for finding minimum cuts in planar graphs]]. //SODA 04// (with Parinya Chalermsook and Danupon Nanongkai)
  * Multicommodity flows in planar graphs where all sinks are on the same face. //Manuscript.// 2003. (with Satish Rao) (see Ch.5 in thesis)
  * [[http://theory.cpe.ku.ac.th/~jittat/papers/thesis.pdf|Algorithms for planar graphs.]] //PhD Thesis.// (advisor: Satish Rao)
  * [[http://www.cpe.ku.ac.th/~jtf/papers/excludedminor.ps|An improved decomposition  theorem for graphs excluding a fixed minor.]] //APPROX 03//.  (with [[http://www.cs.berkeley.edu/~kunal|Kunal Talwar]])
  * [[http://www.cpe.ku.ac.th/~jtf/papers/treelogn.ps|A tight bound on approximating arbitrary metrics by tree metrics.]] //STOC 2003.// (with [[http://www.cs.berkeley.edu/~satishr|Satish Rao]] and [[http://www.cs.berkeley.edu/~kunal|Kunal Talwar]])  ([[http://www.cpe.ku.ac.th/~jtf/papers/treelogn-jcss.ps|journal version]])
  * [[http://www.cpe.ku.ac.th/~jtf/papers/k-min-latency.ps|The k-traveling repairman problem.]] //SODA 2003//.  (with [[http://www.cs.berkeley.edu/~chrishtr|Chris Harrelson]] and[[http://www.cs.berkeley.edu/~satishr|Satish Rao]])
  * [[http://theory.cpe.ku.ac.th/~jittat/papers/0-ext.pdf|An improved approximation algorithm for the 0-extension problem.]] //SODA 2003//  (with Chris Harrelson, Satish Rao, Kunal Talwar)
  * [[http://theory.cpe.ku.ac.th/~jittat/papers/negcycle.pdf|Planar graphs, negative weight edges, shortest paths, and near linear time.]] //FOCS 2001//  (with Satish Rao) ([[http://theory.cpe.ku.ac.th/~jittat/papers/negcycle-journal.pdf|.ps full version]])
  * [[http://theory.cpe.ku.ac.th/~jittat/papers/master.pdf|An improved VC-dimension bound for finding network failures]] //Master project report// (advisor: Satish Rao)

===== Applications of theory =====  
  * [[http://theory.cpe.ku.ac.th/~jittat/papers/icsec16-wsn.pdf|An Improved Centralized Algorithm for Distance-Preserving Dominating Sets in Heterogeneous Wireless Sensor Networks]] //ICSEC'16// (with Attakorn Putwattana)
  * [[http://theory.cpe.ku.ac.th/~jittat/papers/tree-containment.pdf|A faster algorithm for the tree containment problem for binary nearly stable phylogenetic networks]] //JCSSE'15// (with Tanee Kumpijit and Attakorn Putwattana)
  * [[http://theory.cpe.ku.ac.th/~jittat/papers/jnca-multicast-recovery.pdf|Comparison of recovery schemes to maximize restorable throughput in multicast networks]] //J. Network and Computer Applications 35(3): 1106-1115 (2012)// (with Suwara Suraprasert)
  * [[http://www.cpe.ku.ac.th/~jtf/papers/smallsplit.ps|Detecting and cleaning intruders in sensor networks.]] //National Comp.  Sci. and  Eng. Conf. 2004 (NCSEC'04)// (with Poonna Yospanya, Bundit Laekhanukit, and Danupon Nanongkai)
  * [[http://www.cpe.ku.ac.th/~jtf/papers/multiclass.ps|POLL: multiclass classification from binary classifiers through random sampling.]] //InTech'03.// (with Nithi Bunrupunthunad and Thanawin Rakthanmanon)
  * [[http://www.cpe.ku.ac.th/~jtf/papers/vldb2000.pdf|Approximating Aggregate Queries about Web Pages via Random Walks]] //VLDB 2000.// (with Ziv Bar-Yossef, Alex Berg, Steve Chien, and Dror Weitz)

===== Papers in Thai =====
  * [[http://theory.cpe.ku.ac.th/~jittat/papers/ncsec07-sybil3.pdf|การปรับปรุงไซบิลการ์ดด้วยวิธีการตรวจสอบแบบท้องถิ่น]] (Improving SybilGuard using local verification). //NCSEC 2007// (ทำกับ ณัฐวุฒิ กิจบุตราวัฒน์)
  * [[http://theory.cpe.ku.ac.th/~jittat/papers/ncsec07-online-importance-final.pdf|การเรียนรู้แบบออนไลน์สําหรับการจําแนกข้อมูลที่มีน้ำหนักความสําคัญ]] (Online learning for importance weighted classification). //poster presentation NCSEC 2007.// (ทำกับ อดิศักดิ์ สุภีสุน)