Jittat Fakcharoenphol

	2008
20		Jittat Fakcharoenphol, Boonserm Kijsirikul: Erratum: Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors. ALT 2008: 464-466
19		Jittat Fakcharoenphol, Bundit Laekhanukit: An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem. STOC 2008: 153-158
18		Jittat Fakcharoenphol, Satish Rao, Kunal Talwar: Approximating Metric Spaces by Tree Metrics. Encyclopedia of Algorithms 2008
17		Jittat Fakcharoenphol, Satish Rao: Shortest Paths in Planar Graphs with Negative Weight Edges. Encyclopedia of Algorithms 2008
16		Jittat Fakcharoenphol, Boonserm Kijsirikul: Low congestion online routing and an improved mistake bound for online prediction of graph labeling CoRR abs/0809.2075: (2008)
15		Nattapat Attiratanasunthron, Jittat Fakcharoenphol: A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs. Inf. Process. Lett. 105(3): 88-92 (2008)
	2007
14		Jittat Fakcharoenphol, Chris Harrelson, Satish Rao: The k-traveling repairmen problem. ACM Transactions on Algorithms 3(4): (2007)
	2006
13		Jittat Fakcharoenphol, Satish Rao: Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci. 72(5): 868-889 (2006)
	2005
12		Jittat Fakcharoenphol, Boonserm Kijsirikul: Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors. ALT 2005: 135-147
11		Parinya Chalermsook, Jittat Fakcharoenphol: Simple Distributed Algorithms for Approximating Minimum Steiner Trees. COCOON 2005: 380-389
	2004
10		Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos: Approximate classification via earthmover metrics. SODA 2004: 1079-1087
9		Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai: A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. SODA 2004: 828-829
8		Jittat Fakcharoenphol, Satish Rao, Kunal Talwar: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69(3): 485-497 (2004)
7		Jittat Fakcharoenphol, Satish Rao, Kunal Talwar: Approximating metrics by tree metrics. SIGACT News 35(2): 60-70 (2004)
	2003
6		Jittat Fakcharoenphol, Kunal Talwar: An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor. RANDOM-APPROX 2003: 36-46
5		Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar: An improved approximation algorithm for the 0-extension problem. SODA 2003: 257-265
4		Jittat Fakcharoenphol, Chris Harrelson, Satish Rao: The k-traveling repairman problem. SODA 2003: 655-664
3		Jittat Fakcharoenphol, Satish Rao, Kunal Talwar: A tight bound on approximating arbitrary metrics by tree metrics. STOC 2003: 448-455
	2001
2		Jittat Fakcharoenphol, Satish Rao: Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time. FOCS 2001: 232-241
	2000
1		Ziv Bar-Yossef, Alexander C. Berg, Steve Chien, Jittat Fakcharoenphol, Dror Weitz: Approximating Aggregate Queries about Web Pages via Random Walks. VLDB 2000: 535-544

Coauthor Index

1	Aaron Archer	[10]
2	Nattapat Attiratanasunthron	[15]
3	Ziv Bar-Yossef	[1]
4	Alexander C. Berg	[1]
5	Parinya Chalermsook	[9] [11]
6	Steve Chien	[1]
7	Chris Harrelson	[4] [5] [10] [14]
8	Boonserm Kijsirikul	[12] [16] [20]
9	Robert Krauthgamer	[10]
10	Bundit Laekhanukit	[19]
11	Danupon Nanongkai	[9]
12	Satish Rao	[2] [3] [4] [5] [7] [8] [13] [14] [17] [18]
13	Kunal Talwar	[3] [5] [6] [7] [8] [10] [18]
14	Éva Tardos	[10]
15	Dror Weitz	[1]

Colors in the list of coauthors