Personal information

Other IDs

Scopus Author ID: 56291728800

Activities

Collapse all

Employment (1)

Kasetsart University: Bangkok, TH

(Department of Computer Engineering)
Employment
Source: Self-asserted source
Jittat Fakcharoenphol

Works (21)

An improved PTAS for covering targets with mobile sensors

Journal of Combinatorial Optimization
2025-03 | Journal article
DOI: 10.1007/s10878-024-01253-4
Contributors: Nonthaphat Wongwattanakij; Nattawut Phetmak; Chaiporn Jaikaeo; Jittat Fakcharoenphol
Source: check_circle
Crossref

Fair resource allocation for demands with sharp lower tail inequalities

Operations Research Letters
2021-07 | Journal article
DOI: 10.1016/j.orl.2021.06.009
Contributors: Vacharapat Mettanant; Jittat Fakcharoenphol
Source: check_circle
Crossref

Practical Differential Privacy for Location Data Aggregation using a Hadamard Matrix

JCSSE 2019 - 16th International Joint Conference on Computer Science and Software Engineering: Knowledge Evolution Towards Singularity of Man-Machine Intelligence
2019 | Conference paper
DOI: 10.1109/JCSSE.2019.8864180
EID:

2-s2.0-85074235571
Contributors: Sangiamchit, P.; Fakcharoenphol, J.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

An improved approximation algorithm for the s-t path movement problem

Chiang Mai Journal of Science
2017 | Journal article
EID:

2-s2.0-85010824713
Contributors: Jindaluang, W.; Chawachat, J.; Chouvatut, V.; Fakcharoenphol, J.; Kantabutra, S.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

An improved centralized algorithm for distance-preserving dominating sets in heterogeneous wireless sensor networks

20th International Computer Science and Engineering Conference: Smart Ubiquitos Computing and Knowledge, ICSEC 2016
2017 | Conference paper
DOI: 10.1109/ICSEC.2016.7859930
EID:

2-s2.0-85016181350
Contributors: Putwattana, A.; Fakcharoenphol, J.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

Learning network structures from contagion

Information Processing Letters
2017 | Journal article
DOI: 10.1016/j.ipl.2017.01.005
EID:

2-s2.0-85010366370
Contributors: Supeesun, A.; Fakcharoenphol, J.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

A faster algorithm for the tree containment problem for binary nearly stable phylogenetic networks

Proceedings of the 2015 12th International Joint Conference on Computer Science and Software Engineering, JCSSE 2015
2015 | Conference paper
DOI: 10.1109/JCSSE.2015.7219820
EID:

2-s2.0-84945951963
Contributors: Fakcharoenphol, J.; Kumpijit, T.; Putwattana, A.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

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

Networks
2015 | Journal article
DOI: 10.1002/net.21627
EID:

2-s2.0-84941176441
Contributors: Chawachat, J.; Fakcharoenphol, J.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

Faster algorithms for semi-matching problems

ACM Transactions on Algorithms
2014 | Journal article
DOI: 10.1145/2601071
EID:

2-s2.0-84904787377
Contributors: Fakcharoenphol, J.; Laekhanukit, B.; Nanongkai, D.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

An O(log <sup>2</sup> k)-Approximation algorithm for the k-vertex connected spanning Subgraph problem

SIAM Journal on Computing
2012 | Journal article
DOI: 10.1137/110855910
EID:

2-s2.0-84868259434
Contributors: Fakcharoenphol, J.; Laekhanukit, B.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

Comparison of recovery schemes to maximize restorable throughput in multicast networks

Journal of Network and Computer Applications
2012 | Journal article
DOI: 10.1016/j.jnca.2011.12.010
EID:

2-s2.0-84858074859
Contributors: Suraprasert, S.; Fakcharoenphol, J.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

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

Information Processing Letters
2012 | Journal article
DOI: 10.1016/j.ipl.2012.08.015
EID:

2-s2.0-84865840326
Contributors: Chawachat, J.; Fakcharoenphol, J.; Jindaluang, W.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

An improved bound for multiple source-sink linear network coding

Proceedings of the 2011 8th International Joint Conference on Computer Science and Software Engineering, JCSSE 2011
2011 | Conference paper
DOI: 10.1109/JCSSE.2011.5930078
EID:

2-s2.0-79960403457
Contributors: Eamopas, M.; Fakcharoenphol, J.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

Faster algorithms for semi-matching problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2010 | Book
DOI: 10.1007/978-3-642-14165-2_16
EID:

2-s2.0-77955323043
Contributors: Fakcharoenphol, J.; Laekhanukit, B.; Nanongkai, D.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

Get involved! The IOI workshop 2010, its goals and results

Olympiads in Informatics
2010 | Conference paper
EID:

2-s2.0-85011634973
Contributors: Pohl, W.; Burton, B.A.; Dagiene, V.; Fakcharoenphol, J.; ForiĊĦek, M.; Hiron, M.; Opmanis, M.; Skupas, B.; Van Der Vegt, W.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

Short proofs for online multiclass prediction on graphs

Information Processing Letters
2010 | Journal article
DOI: 10.1016/j.ipl.2010.02.008
EID:

2-s2.0-77949489809
Contributors: Fakcharoenphol, J.; Kijsirikul, B.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

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

Information Processing Letters
2008 | Journal article
DOI: 10.1016/j.ipl.2007.08.013
EID:

2-s2.0-36549010415
Contributors: Attiratanasunthron, N.; Fakcharoenphol, J.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

An O(log<sup>2</sup> k)-Approximation algorithm for the k-Vertex connected spanning subgraph problem

Proceedings of the Annual ACM Symposium on Theory of Computing
2008 | Conference paper
EID:

2-s2.0-57049099296
Contributors: Fakcharoenphol, J.; Laekhanukit, B.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

Erratum: Constructing multiclass learners from binary learners: A simple black-box analysis of the generalization errors (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics))

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2008 | Book
DOI: 10.1007/978-3-540-87987-9_37
EID:

2-s2.0-56749158271
Contributors: Fakcharoenphol, J.; Kijsirikul, B.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

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

Journal of Computer and System Sciences
2006 | Journal article
DOI: 10.1016/j.jcss.2005.05.007
EID:

2-s2.0-33646503679
Contributors: Fakcharoenphol, J.; Rao, S.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier

Constructing multiclass learners from binary learners: A simple black-box analysis of the generalization errors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2005 | Book
DOI: 10.1007/11564089_12
EID:

2-s2.0-33646535265
Contributors: Fakcharoenphol, J.; Kijsirikul, B.
Source: Self-asserted source
Jittat Fakcharoenphol via Scopus - Elsevier
How many people are using ORCID?