Jittat Fakcharoenphol

According to our database1, Jittat Fakcharoenphol authored at least 31 papers between 2000 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Bandit Multiclass Linear Classification for the Group Linear Separable Case.
CoRR, 2019

2017
Learning network structures from contagion.
Inf. Process. Lett., 2017

Finding All Useless Arcs in Directed Planar Graphs.
CoRR, 2017

2016
Approximating Metric Spaces by Tree Metrics.
Encyclopedia of Algorithms, 2016

Shortest Paths in Planar Graphs with Negative Weight Edges.
Encyclopedia of Algorithms, 2016

2015
A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems.
Networks, 2015

2014
Faster Algorithms for Semi-Matching Problems.
ACM Trans. Algorithms, 2014

2012
An O(log2k)-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem.
SIAM J. Comput., 2012

Comparison of recovery schemes to maximize restorable throughput in multicast networks.
J. Netw. Comput. Appl., 2012

The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking.
Inf. Process. Lett., 2012

2010
Short proofs for online multiclass prediction on graphs.
Inf. Process. Lett., 2010

Faster Algorithms for Semi-matching Problems (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2008
Approximating Metric Spaces by Tree Metrics.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Shortest Paths in Planar Graphs with Negative Weight Edges.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs.
Inf. Process. Lett., 2008

Low congestion online routing and an improved mistake bound for online prediction of graph labeling
CoRR, 2008

An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Erratum: Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors.
Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

2007
The k-traveling repairmen problem.
ACM Trans. Algorithms, 2007

2006
Planar graphs, negative weight edges, shortest paths, and near linear time.
J. Comput. Syst. Sci., 2006

2005
Simple Distributed Algorithms for Approximating Minimum Steiner Trees.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors.
Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

2004
Approximating metrics by tree metrics.
SIGACT News, 2004

A tight bound on approximating arbitrary metrics by tree metrics.
J. Comput. Syst. Sci., 2004

A deterministic near-linear time algorithm for finding minimum cuts in planar graphs.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Approximate classification via earthmover metrics.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
An improved approximation algorithm for the 0-extension problem.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

The k-traveling repairman problem.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor.
Proceedings of the Approximation, 2003

2001
Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
Approximating Aggregate Queries about Web Pages via Random Walks.
Proceedings of the VLDB 2000, 2000


  Loading...