Jittat Fakcharoenphol

51 papers A* 8B 2Misc 1Journal 27Unranked 9

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A PTAS for k-hop MST on the Euclidean plane: Improving dependency on k. Inf. Process. Lett. Jittat Fakcharoenphol, Nonthaphat Wongwattanakij
2025	J	`jnl`	An improved PTAS for covering targets with mobile sensors. J. Comb. Optim. Nonthaphat Wongwattanakij, Nattawut Phetmak, Chaiporn Jaikaeo, Jittat Fakcharoenphol
2024	—	`conf`	Estimating Group Fairness Using Pairwise Similarity. JCSSE Adisak Supeesun, Jakarin Chawachat, Vacharapat Mettanant, Jittat Fakcharoenphol
2023	J	`jnl`	An Improved PTAS for Covering Targets with Mobile Sensors. CoRR Nonthaphat Wongwattanakij, Nattawut Phetmak, Chaiporn Jaikaeo, Jittat Fakcharoenphol
2023	J	`jnl`	Folding Every Point on a Polygon Boundary to a Point. Algorithms Nattawut Phetmak, Jittat Fakcharoenphol
2023	J	`jnl`	Folding Every Point on a Polygon Boundary to a Point. CoRR Nattawut Phetmak, Jittat Fakcharoenphol
2023	J	`jnl`	Stochastic Contextual Bandits with Graph-based Contexts. CoRR Jittat Fakcharoenphol, Chayutpong Prompak
2022	—	`conf`	An Approximation Algorithm for the Vertex Multicut on Trees with an Application to the Tracking Paths Problem. JCSSE Kunanon Burathep, Jittat Fakcharoenphol
2022	—	`conf`	Improved Generative Adversarial Networks for Intersection of Two Domains. JCSSE Monthol Charattrakool, Jittat Fakcharoenphol
2022	—	`conf`	MAX-CUT on Samplings of Dense Graphs. JCSSE Jittat Fakcharoenphol, Phanu Vajanopath
2021	J	`jnl`	A PTAS for k-hop MST on the Euclidean plane: Improving Dependency on k. CoRR Jittat Fakcharoenphol, Nonthaphat Wongwattanakij
2021	J	`jnl`	Fair Resource Allocation for Demands with Sharp Lower Tail Inequalities. CoRR Vacharapat Mettanant, Jittat Fakcharoenphol
2021	J	`jnl`	Fair resource allocation for demands with sharp lower tail inequalities. Oper. Res. Lett. Vacharapat Mettanant, Jittat Fakcharoenphol
2020	—	`conf`	Building two communication towers over a terrain. JCSSE Chawin Aiemvaravutigul, Jittat Fakcharoenphol, Nattawut Phetmak
2019	J	`jnl`	Bandit Multiclass Linear Classification for the Group Linear Separable Case. CoRR Jittat Fakcharoenphol, Chayutpong Prompak
2019	—	`conf`	Practical Differential Privacy for Location Data Aggregation using a Hadamard Matrix. JCSSE Patinya Sangiamchit, Jittat Fakcharoenphol
2018	—	`conf`	An n JCSSE Jittat Fakcharoenphol, Pattara Sukprasert
2017	J	`jnl`	Finding All Useless Arcs in Directed Planar Graphs. CoRR Jittat Fakcharoenphol, Bundit Laekhanukit, Pattara Sukprasert
2017	J	`jnl`	Learning Network Structures from Contagion. CoRR Adisak Supeesun, Jittat Fakcharoenphol
2017	J	`jnl`	Learning network structures from contagion. Inf. Process. Lett. Adisak Supeesun, Jittat Fakcharoenphol
2016	—	`ch.`	Approximating Metric Spaces by Tree Metrics. Encyclopedia of Algorithms Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
2016	—	`ch.`	Shortest Paths in Planar Graphs with Negative Weight Edges. Encyclopedia of Algorithms Jittat Fakcharoenphol, Satish Rao
2015	J	`jnl`	A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems. Networks Jakarin Chawachat, Jittat Fakcharoenphol
2014	J	`jnl`	Faster Algorithms for Semi-Matching Problems. ACM Trans. Algorithms Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai
2012	J	`jnl`	A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems CoRR Jakarin Chawachat, Jittat Fakcharoenphol
2012	J	`jnl`	An O(log SIAM J. Comput. Jittat Fakcharoenphol, Bundit Laekhanukit
2012	J	`jnl`	Comparison of recovery schemes to maximize restorable throughput in multicast networks. J. Netw. Comput. Appl. S. Suraprasert, Jittat Fakcharoenphol
2012	J	`jnl`	The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking. Inf. Process. Lett. Jakarin Chawachat, Jittat Fakcharoenphol, Wattana Jindaluang
2010	J	`jnl`	Faster Algorithms for Semi-Matching Problems CoRR Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai
2010	—	`conf`	Faster Algorithms for Semi-matching Problems (Extended Abstract). ICALP (1) Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai
2010	J	`jnl`	Short proofs for online multiclass prediction on graphs. Inf. Process. Lett. Jittat Fakcharoenphol, Boonserm Kijsirikul
2008	J	`jnl`	A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs. Inf. Process. Lett. Nattapat Attiratanasunthron, Jittat Fakcharoenphol
2008	A*	`conf`	An o(log STOC Jittat Fakcharoenphol, Bundit Laekhanukit
2008	—	`ch.`	Approximating Metric Spaces by Tree Metrics. Encyclopedia of Algorithms Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
2008	B	`conf`	Erratum: Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors. ALT Jittat Fakcharoenphol, Boonserm Kijsirikul
2008	J	`jnl`	Low congestion online routing and an improved mistake bound for online prediction of graph labeling CoRR Jittat Fakcharoenphol, Boonserm Kijsirikul
2008	—	`ch.`	Shortest Paths in Planar Graphs with Negative Weight Edges. Encyclopedia of Algorithms Jittat Fakcharoenphol, Satish Rao
2007	J	`jnl`	The ACM Trans. Algorithms Jittat Fakcharoenphol, Chris Harrelson, Satish Rao
2006	J	`jnl`	Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci. Jittat Fakcharoenphol, Satish Rao
2005	B	`conf`	Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors. ALT Jittat Fakcharoenphol, Boonserm Kijsirikul
2005	Misc	`conf`	Simple Distributed Algorithms for Approximating Minimum Steiner Trees. COCOON Parinya Chalermsook, Jittat Fakcharoenphol
2004	A*	`conf`	A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. SODA Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai
2004	J	`jnl`	A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
2004	A*	`conf`	Approximate classification via earthmover metrics. SODA Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos
2004	J	`jnl`	Approximating metrics by tree metrics. SIGACT News Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
2003	A*	`conf`	A tight bound on approximating arbitrary metrics by tree metrics. STOC Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
2003	—	`conf`	An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor. RANDOM-APPROX Jittat Fakcharoenphol, Kunal Talwar
2003	A*	`conf`	An improved approximation algorithm for the 0-extension problem. SODA Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar
2003	A*	`conf`	The k-traveling repairman problem. SODA Jittat Fakcharoenphol, Chris Harrelson, Satish Rao
2001	A*	`conf`	Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time. FOCS Jittat Fakcharoenphol, Satish Rao
2000	A*	`conf`	Approximating Aggregate Queries about Web Pages via Random Walks. VLDB Ziv Bar-Yossef, Alexander C. Berg, Steve Chien, Jittat Fakcharoenphol, Dror Weitz