default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJittat Fakcharoenphol
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c20]Adisak Supeesun, Jakarin Chawachat, Vacharapat Mettanant, Jittat Fakcharoenphol:
Estimating Group Fairness Using Pairwise Similarity. JCSSE 2024: 343-350- 2023
- [j14]Nattawut Phetmak, Jittat Fakcharoenphol:
Folding Every Point on a Polygon Boundary to a Point. Algorithms 16(6): 281 (2023) - [i11]Nattawut Phetmak, Jittat Fakcharoenphol:
Folding Every Point on a Polygon Boundary to a Point. CoRR abs/2305.01467 (2023) - [i10]Jittat Fakcharoenphol, Chayutpong Prompak:
Stochastic Contextual Bandits with Graph-based Contexts. CoRR abs/2305.01470 (2023) - [i9]Nonthaphat Wongwattanakij, Nattawut Phetmak, Chaiporn Jaikaeo, Jittat Fakcharoenphol:
An Improved PTAS for Covering Targets with Mobile Sensors. CoRR abs/2305.03946 (2023) - 2022
- [c19]Kunanon Burathep, Jittat Fakcharoenphol:
An Approximation Algorithm for the Vertex Multicut on Trees with an Application to the Tracking Paths Problem. JCSSE 2022: 1-5 - [c18]Monthol Charattrakool, Jittat Fakcharoenphol:
Improved Generative Adversarial Networks for Intersection of Two Domains. JCSSE 2022: 1-6 - [c17]Jittat Fakcharoenphol, Phanu Vajanopath:
MAX-CUT on Samplings of Dense Graphs. JCSSE 2022: 1-6 - 2021
- [j13]Vacharapat Mettanant
, Jittat Fakcharoenphol:
Fair resource allocation for demands with sharp lower tail inequalities. Oper. Res. Lett. 49(4): 590-596 (2021) - [i8]Vacharapat Mettanant, Jittat Fakcharoenphol:
Fair Resource Allocation for Demands with Sharp Lower Tail Inequalities. CoRR abs/2101.12403 (2021) - [i7]Jittat Fakcharoenphol, Nonthaphat Wongwattanakij:
A PTAS for k-hop MST on the Euclidean plane: Improving Dependency on k. CoRR abs/2106.11092 (2021) - 2020
- [c16]Chawin Aiemvaravutigul, Jittat Fakcharoenphol, Nattawut Phetmak:
Building two communication towers over a terrain. JCSSE 2020: 150-154
2010 – 2019
- 2019
- [c15]Patinya Sangiamchit, Jittat Fakcharoenphol:
Practical Differential Privacy for Location Data Aggregation using a Hadamard Matrix. JCSSE 2019: 79-84 - [i6]Jittat Fakcharoenphol, Chayutpong Prompak:
Bandit Multiclass Linear Classification for the Group Linear Separable Case. CoRR abs/1912.10340 (2019) - 2018
- [c14]Jittat Fakcharoenphol, Pattara Sukprasert:
An nO(1/ϵ) Approximation Scheme For The Minimum Dominating Set In Unit Disk Graphs. JCSSE 2018: 1-5 - 2017
- [j12]Adisak Supeesun, Jittat Fakcharoenphol:
Learning network structures from contagion. Inf. Process. Lett. 121: 11-16 (2017) - [i5]Jittat Fakcharoenphol, Bundit Laekhanukit, Pattara Sukprasert:
Finding All Useless Arcs in Directed Planar Graphs. CoRR abs/1702.04786 (2017) - [i4]Adisak Supeesun, Jittat Fakcharoenphol:
Learning Network Structures from Contagion. CoRR abs/1705.10051 (2017) - 2016
- [r4]Jittat Fakcharoenphol, Satish Rao, Kunal Talwar:
Approximating Metric Spaces by Tree Metrics. Encyclopedia of Algorithms 2016: 113-116 - [r3]Jittat Fakcharoenphol, Satish Rao:
Shortest Paths in Planar Graphs with Negative Weight Edges. Encyclopedia of Algorithms 2016: 1971-1974 - 2015
- [j11]Jakarin Chawachat, Jittat Fakcharoenphol:
A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems. Networks 66(3): 235-249 (2015) - 2014
- [j10]Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai:
Faster Algorithms for Semi-Matching Problems. ACM Trans. Algorithms 10(3): 14:1-14:23 (2014) - 2012
- [j9]Jakarin Chawachat, Jittat Fakcharoenphol, Wattana Jindaluang:
The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking. Inf. Process. Lett. 112(24): 937-941 (2012) - [j8]S. Suraprasert, Jittat Fakcharoenphol:
Comparison of recovery schemes to maximize restorable throughput in multicast networks. J. Netw. Comput. Appl. 35(3): 1106-1115 (2012) - [j7]Jittat Fakcharoenphol, Bundit Laekhanukit:
An O(log2k)-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem. SIAM J. Comput. 41(5): 1095-1109 (2012) - [i3]Jakarin Chawachat, Jittat Fakcharoenphol:
A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems. CoRR abs/1210.7954 (2012) - 2010
- [j6]Jittat Fakcharoenphol, Boonserm Kijsirikul:
Short proofs for online multiclass prediction on graphs. Inf. Process. Lett. 110(8-9): 309-311 (2010) - [c13]Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai:
Faster Algorithms for Semi-matching Problems (Extended Abstract). ICALP (1) 2010: 176-187 - [i2]Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai:
Faster Algorithms for Semi-Matching Problems. CoRR abs/1004.3363 (2010)
2000 – 2009
- 2008
- [j5]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) - [c12]Jittat Fakcharoenphol, Boonserm Kijsirikul:
Erratum: Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors. ALT 2008: 464-466 - [c11]Jittat Fakcharoenphol, Bundit Laekhanukit:
An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem. STOC 2008: 153-158 - [r2]Jittat Fakcharoenphol, Satish Rao:
Shortest Paths in Planar Graphs with Negative Weight Edges. Encyclopedia of Algorithms 2008 - [r1]Jittat Fakcharoenphol, Satish Rao, Kunal Talwar:
Approximating Metric Spaces by Tree Metrics. Encyclopedia of Algorithms 2008 - [i1]Jittat Fakcharoenphol, Boonserm Kijsirikul:
Low congestion online routing and an improved mistake bound for online prediction of graph labeling. CoRR abs/0809.2075 (2008) - 2007
- [j4]Jittat Fakcharoenphol, Chris Harrelson, Satish Rao:
The k-traveling repairmen problem. ACM Trans. Algorithms 3(4): 40 (2007) - 2006
- [j3]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
- [c10]Jittat Fakcharoenphol, Boonserm Kijsirikul:
Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors. ALT 2005: 135-147 - [c9]Parinya Chalermsook, Jittat Fakcharoenphol:
Simple Distributed Algorithms for Approximating Minimum Steiner Trees. COCOON 2005: 380-389 - 2004
- [j2]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) - [j1]Jittat Fakcharoenphol, Satish Rao, Kunal Talwar:
Approximating metrics by tree metrics. SIGACT News 35(2): 60-70 (2004) - [c8]Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai:
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. SODA 2004: 828-829 - [c7]Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos:
Approximate classification via earthmover metrics. SODA 2004: 1079-1087 - 2003
- [c6]Jittat Fakcharoenphol, Kunal Talwar:
An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor. RANDOM-APPROX 2003: 36-46 - [c5]Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar:
An improved approximation algorithm for the 0-extension problem. SODA 2003: 257-265 - [c4]Jittat Fakcharoenphol, Chris Harrelson, Satish Rao:
The k-traveling repairman problem. SODA 2003: 655-664 - [c3]Jittat Fakcharoenphol, Satish Rao, Kunal Talwar:
A tight bound on approximating arbitrary metrics by tree metrics. STOC 2003: 448-455 - 2001
- [c2]Jittat Fakcharoenphol, Satish Rao:
Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time. FOCS 2001: 232-241 - 2000
- [c1]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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-10 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
