Jittat Fakcharoenphol

According to our database, Jittat Fakcharoenphol authored at least 42 papers between 2000 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Folding Every Point on a Polygon Boundary to a Point.

Nattawut Phetmak, Jittat Fakcharoenphol

Algorithms, June, 2023

An Improved PTAS for Covering Targets with Mobile Sensors.

Nonthaphat Wongwattanakij, Nattawut Phetmak, Chaiporn Jaikaeo, Jittat Fakcharoenphol

CoRR, 2023

Stochastic Contextual Bandits with Graph-based Contexts.

Jittat Fakcharoenphol, Chayutpong Prompak

CoRR, 2023

2022

MAX-CUT on Samplings of Dense Graphs.

Jittat Fakcharoenphol, Phanu Vajanopath

Proceedings of the 19th International Joint Conference on Computer Science and Software Engineering, 2022

Improved Generative Adversarial Networks for Intersection of Two Domains.

Monthol Charattrakool, Jittat Fakcharoenphol

Proceedings of the 19th International Joint Conference on Computer Science and Software Engineering, 2022

An Approximation Algorithm for the Vertex Multicut on Trees with an Application to the Tracking Paths Problem.

Kunanon Burathep, Jittat Fakcharoenphol

Proceedings of the 19th International Joint Conference on Computer Science and Software Engineering, 2022

2021

Fair resource allocation for demands with sharp lower tail inequalities.

Vacharapat Mettanant, Jittat Fakcharoenphol

Oper. Res. Lett., 2021

A PTAS for k-hop MST on the Euclidean plane: Improving Dependency on k.

Jittat Fakcharoenphol, Nonthaphat Wongwattanakij

CoRR, 2021

2020

Building two communication towers over a terrain.

Chawin Aiemvaravutigul, Jittat Fakcharoenphol, Nattawut Phetmak

Proceedings of the 17th International Joint Conference on Computer Science and Software Engineering, 2020

2019

Bandit Multiclass Linear Classification for the Group Linear Separable Case.

Jittat Fakcharoenphol, Chayutpong Prompak

CoRR, 2019

Practical Differential Privacy for Location Data Aggregation using a Hadamard Matrix.

Patinya Sangiamchit, Jittat Fakcharoenphol

Proceedings of the 16th International Joint Conference on Computer Science and Software Engineering, 2019

2018

An n^O(1/ϵ) Approximation Scheme For The Minimum Dominating Set In Unit Disk Graphs.

Jittat Fakcharoenphol, Pattara Sukprasert

Proceedings of the 15th International Joint Conference on Computer Science and Software Engineering, 2018

2017

Learning network structures from contagion.

Adisak Supeesun, Jittat Fakcharoenphol

Inf. Process. Lett., 2017

Finding All Useless Arcs in Directed Planar Graphs.

Jittat Fakcharoenphol, Bundit Laekhanukit, Pattara Sukprasert

CoRR, 2017

2016

Approximating Metric Spaces by Tree Metrics.

Jittat Fakcharoenphol, Satish Rao, Kunal Talwar

Encyclopedia of Algorithms, 2016

Shortest Paths in Planar Graphs with Negative Weight Edges.

Jittat Fakcharoenphol, Satish Rao

Encyclopedia of Algorithms, 2016

2015

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

Jakarin Chawachat, Jittat Fakcharoenphol

Networks, 2015

2014

Faster Algorithms for Semi-Matching Problems.

Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai

ACM Trans. Algorithms, 2014

2012

An O(log^2k)-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem.

Jittat Fakcharoenphol, Bundit Laekhanukit

SIAM J. Comput., 2012

Comparison of recovery schemes to maximize restorable throughput in multicast networks.

S. Suraprasert, Jittat Fakcharoenphol

J. Netw. Comput. Appl., 2012

The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking.

Jakarin Chawachat, Jittat Fakcharoenphol, Wattana Jindaluang

Inf. Process. Lett., 2012

2010

Short proofs for online multiclass prediction on graphs.

Jittat Fakcharoenphol, Boonserm Kijsirikul

Inf. Process. Lett., 2010

Faster Algorithms for Semi-matching Problems (Extended Abstract).

Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2008

Approximating Metric Spaces by Tree Metrics.

Jittat Fakcharoenphol, Satish Rao, Kunal Talwar

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Shortest Paths in Planar Graphs with Negative Weight Edges.

Jittat Fakcharoenphol, Satish Rao

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

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

Nattapat Attiratanasunthron, Jittat Fakcharoenphol

Inf. Process. Lett., 2008

Low congestion online routing and an improved mistake bound for online prediction of graph labeling

Jittat Fakcharoenphol, Boonserm Kijsirikul

CoRR, 2008

An o(log² k)-approximation algorithm for the k-vertex connected spanning subgraph problem.

Jittat Fakcharoenphol, Bundit Laekhanukit

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

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

Jittat Fakcharoenphol, Boonserm Kijsirikul

Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

2007

The <i>k</i>-traveling repairmen problem.

Jittat Fakcharoenphol, Chris Harrelson, Satish Rao

ACM Trans. Algorithms, 2007

2006

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

Jittat Fakcharoenphol, Satish Rao

J. Comput. Syst. Sci., 2006

2005

Simple Distributed Algorithms for Approximating Minimum Steiner Trees.

Parinya Chalermsook, Jittat Fakcharoenphol

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

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

Jittat Fakcharoenphol, Boonserm Kijsirikul

Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

2004

Approximating metrics by tree metrics.

Jittat Fakcharoenphol, Satish Rao, Kunal Talwar

SIGACT News, 2004

A tight bound on approximating arbitrary metrics by tree metrics.

Jittat Fakcharoenphol, Satish Rao, Kunal Talwar

J. Comput. Syst. Sci., 2004

A deterministic near-linear time algorithm for finding minimum cuts in planar graphs.

Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Approximate classification via earthmover metrics.

Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

An improved approximation algorithm for the 0-extension problem.

Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

The k-traveling repairman problem.

Jittat Fakcharoenphol, Chris Harrelson, Satish Rao

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor.

Jittat Fakcharoenphol, Kunal Talwar

Proceedings of the Approximation, 2003

2001

Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time.

Jittat Fakcharoenphol, Satish Rao

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

Approximating Aggregate Queries about Web Pages via Random Walks.

Ziv Bar-Yossef, Alexander C. Berg, Steve Chien, Jittat Fakcharoenphol, Dror Weitz

Proceedings of the VLDB 2000, 2000