Jittat Fakcharoenphol

发表

A tight bound on approximating arbitrary metrics by tree metrics

Satish Rao, Kunal Talwar, Jittat Fakcharoenphol, 2003, STOC '03.

Approximating Aggregate Queries about Web Pages via Random Walks

Steve Chien, Ziv Bar-Yossef, Alexander C. Berg, 2000, VLDB.

A faster algorithm for finding optimal semi-matching

Danupon Nanongkai, Jittat Fakcharoenphol, Bundit Lekhanukit, 2007 .

Inferring gene order phylogenies by learning ancestral adjacencies

Satish Rao, Jittat Fakcharoenphol, D. Adkins, 2010 .

POLL : multiclass classification from binary classifiers through random sampling

T. Rakthanmanon, Jittat Fakcharoenphol, Nithi Bunrupunthunad, 2022 .

Shortest Paths in Planar Graphs with Negative Weight Edges

Satish Rao, Jittat Fakcharoenphol, Satish Rao, 2008, Encyclopedia of Algorithms.

Approximating Metric Spaces by Tree Metrics

Satish Rao, Kunal Talwar, Jittat Fakcharoenphol, 2008, Encyclopedia of Algorithms.

Approximating Metric Spaces by Tree Metrics

Satish Rao, Kunal Talwar, Jittat Fakcharoenphol, 2008, Encyclopedia of Algorithms.

Fair Resource Allocation for Demands with Sharp Lower Tail Inequalities pdf

Jittat Fakcharoenphol, Vacharapat Mettanant, Jittat Fakcharoenphol, 2021, Oper. Res. Lett..

A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs

Jittat Fakcharoenphol, Nattapat Attiratanasunthron, Jittat Fakcharoenphol, 2008, Inf. Process. Lett..

Fair Resource Allocation for Demands with Sharp Lower Tail Inequalities

Jittat Fakcharoenphol, Vacharapat Mettanant, 2021, Oper. Res. Lett..

Approximate classification via earthmover metrics

Robert Krauthgamer, Éva Tardos, Kunal Talwar, 2004, SODA '04.

An improved approximation algorithm for the 0-extension problem

Satish Rao, Kunal Talwar, Jittat Fakcharoenphol, 2003, SODA '03.

The k-traveling repairman problem

Satish Rao, Jittat Fakcharoenphol, Chris Harrelson, 2003, SODA '03.

Planar graphs, negative weight edges, shortest paths, and near linear time

Satish Rao, Jittat Fakcharoenphol, Satish Rao, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor

Kunal Talwar, Jittat Fakcharoenphol, Kunal Talwar, 2003, RANDOM-APPROX.

Stochastic Contextual Bandits with Graph-based Contexts

Jittat Fakcharoenphol, Chayutpong Prompak, 2023, ArXiv.

Algorithms for planar graphs

Jittat Fakcharoenphol, Jittat Fakcharoenphol, 2003 .

A simpler load‐balancing algorithm for range‐partitioned data in peer‐to‐peer systems

Jittat Fakcharoenphol, Jakarin Chawachat, Jittat Fakcharoenphol, 2012, Networks.

Approximating metrics by tree metrics

Satish Rao, Kunal Talwar, Jittat Fakcharoenphol, 2004, SIGA.

The k-traveling repairmen problem

Satish Rao, Jittat Fakcharoenphol, Chris Harrelson, 2007, ACM Trans. Algorithms.

Practical Differential Privacy for Location Data Aggregation using a Hadamard Matrix

Jittat Fakcharoenphol, Patinya Sangiamchit, Jittat Fakcharoenphol, 2019, 2019 16th International Joint Conference on Computer Science and Software Engineering (JCSSE).

Simple Distributed Algorithms for Approximating Minimum Steiner Trees

Parinya Chalermsook, Jittat Fakcharoenphol, Jittat Fakcharoenphol, 2005, COCOON.

Learning network structures from contagion pdf

Jittat Fakcharoenphol, Adisak Supeesun, Jittat Fakcharoenphol, 2017, Inf. Process. Lett..

Faster Algorithms for Semi-matching Problems (Extended Abstract)

Danupon Nanongkai, Bundit Laekhanukit, Jittat Fakcharoenphol, 2010, ICALP.

Faster Algorithms for Semi-Matching Problems pdf

Danupon Nanongkai, Bundit Laekhanukit, Jittat Fakcharoenphol, 2010, TALG.

Erratum: Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors

Boonserm Kijsirikul, Jittat Fakcharoenphol, Jittat Fakcharoenphol, 2005, ALT.

Building two communication towers over a terrain

Jittat Fakcharoenphol, Nattawut Phetmak, Chawin Aiemvaravutigul, 2020, 2020 17th International Joint Conference on Computer Science and Software Engineering (JCSSE).

A faster algorithm for the tree containment problem for binary nearly stable phylogenetic networks

Jittat Fakcharoenphol, Tanee Kumpijit, Attakorn Putwattana, 2015, 2015 12th International Joint Conference on Computer Science and Software Engineering (JCSSE).