The SCEAS System
| |||||||

## Search the dblp DataBase
Jittat Fakcharoenphol:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Jittat Fakcharoenphol, Boonserm Kijsirikul
**Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors.**[Citation Graph (0, 0)][DBLP] ALT, 2005, pp:135-147 [Conf] - Parinya Chalermsook, Jittat Fakcharoenphol
**Simple Distributed Algorithms for Approximating Minimum Steiner Trees.**[Citation Graph (0, 0)][DBLP] COCOON, 2005, pp:380-389 [Conf] - Jittat Fakcharoenphol, Satish Rao
**Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:232-241 [Conf] - Jittat Fakcharoenphol, Kunal Talwar
**An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2003, pp:36-46 [Conf] - Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos
**Approximate classification via earthmover metrics.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:1079-1087 [Conf] - Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai
**A deterministic near-linear time algorithm for finding minimum cuts in planar graphs.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:828-829 [Conf] - Jittat Fakcharoenphol, Chris Harrelson, Satish Rao
**The k-traveling repairman problem.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:655-664 [Conf] - Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar
**An improved approximation algorithm for the 0-extension problem.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:257-265 [Conf] - Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
**A tight bound on approximating arbitrary metrics by tree metrics.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:448-455 [Conf] - Ziv Bar-Yossef, Alexander C. Berg, Steve Chien, Jittat Fakcharoenphol, Dror Weitz
**Approximating Aggregate Queries about Web Pages via Random Walks.**[Citation Graph (0, 0)][DBLP] VLDB, 2000, pp:535-544 [Conf] - Jittat Fakcharoenphol, Satish Rao
**Planar graphs, negative weight edges, shortest paths, and near linear time.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:5, pp:868-889 [Journal] - Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
**A tight bound on approximating arbitrary metrics by tree metrics.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:69, n:3, pp:485-497 [Journal] **Erratum: Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors.**[Citation Graph (, )][DBLP]**Faster Algorithms for Semi-matching Problems (Extended Abstract).**[Citation Graph (, )][DBLP]**An o(log**[Citation Graph (, )][DBLP]^{2}k)-approximation algorithm for the k-vertex connected spanning subgraph problem.**Low congestion online routing and an improved mistake bound for online prediction of graph labeling**[Citation Graph (, )][DBLP]**Faster Algorithms for Semi-Matching Problems**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |