Patchrawat Uthaisombut

492 total citations
15 papers, 222 citations indexed

About

Patchrawat Uthaisombut is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Hardware and Architecture. According to data from OpenAlex, Patchrawat Uthaisombut has authored 15 papers receiving a total of 222 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Computer Networks and Communications, 10 papers in Industrial and Manufacturing Engineering and 2 papers in Hardware and Architecture. Recurrent topics in Patchrawat Uthaisombut's work include Scheduling and Optimization Algorithms (10 papers), Optimization and Search Problems (10 papers) and Distributed systems and fault tolerance (3 papers). Patchrawat Uthaisombut is often cited by papers focused on Scheduling and Optimization Algorithms (10 papers), Optimization and Search Problems (10 papers) and Distributed systems and fault tolerance (3 papers). Patchrawat Uthaisombut collaborates with scholars based in United States, Netherlands and Denmark. Patchrawat Uthaisombut's co-authors include Kirk Pruhs, Eric Torng, Rob van Stee, Gerhard J. Woeginger, Houman Alborzi, Clifford Stein, George Stockman, Daniel E. Guyer, Kim S. Larsen and John Noga and has published in prestigious journals such as Journal of Algorithms, Algorithmica and Information Processing Letters.

In The Last Decade

Patchrawat Uthaisombut

15 papers receiving 209 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Patchrawat Uthaisombut United States 7 185 100 61 45 23 15 222
Claire Hanen France 8 93 0.5× 146 1.5× 54 0.9× 11 0.2× 21 0.9× 20 213
Wun-Tat Chan Hong Kong 8 123 0.7× 45 0.5× 46 0.8× 15 0.3× 14 0.6× 16 168
K. Dan Levin United States 5 267 1.4× 32 0.3× 33 0.5× 55 1.2× 5 0.2× 9 283
David P. Bunde United States 7 215 1.2× 31 0.3× 165 2.7× 78 1.7× 6 0.3× 18 240
Antonios Antoniadis Germany 7 90 0.5× 41 0.4× 63 1.0× 25 0.6× 13 0.6× 22 143
Louis-Claude Canon France 9 165 0.9× 22 0.2× 79 1.3× 110 2.4× 8 0.3× 22 187
Gábor Galambos Hungary 8 152 0.8× 160 1.6× 8 0.1× 30 0.7× 13 0.6× 14 211
S. Ghosh United States 8 295 1.6× 25 0.3× 314 5.1× 45 1.0× 10 0.4× 9 391
D. Aksoy United States 5 352 1.9× 12 0.1× 48 0.8× 23 0.5× 5 0.2× 11 366
Nimar S. Arora United States 5 223 1.2× 14 0.1× 206 3.4× 58 1.3× 6 0.3× 10 261

Countries citing papers authored by Patchrawat Uthaisombut

Since Specialization
Citations

This map shows the geographic impact of Patchrawat Uthaisombut's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Patchrawat Uthaisombut with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Patchrawat Uthaisombut more than expected).

Fields of papers citing papers by Patchrawat Uthaisombut

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Patchrawat Uthaisombut. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Patchrawat Uthaisombut. The network helps show where Patchrawat Uthaisombut may publish in the future.

Co-authorship network of co-authors of Patchrawat Uthaisombut

This figure shows the co-authorship network connecting the top 25 collaborators of Patchrawat Uthaisombut. A scholar is included among the top collaborators of Patchrawat Uthaisombut based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Patchrawat Uthaisombut. Patchrawat Uthaisombut is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

15 of 15 papers shown
1.
Pruhs, Kirk, Patchrawat Uthaisombut, & Gerhard J. Woeginger. (2008). Getting the best response for your erg. ACM Transactions on Algorithms. 4(3). 1–17. 59 indexed citations
2.
Uthaisombut, Patchrawat. (2007). Generalization of EDF and LLF: Identifying All Optimal Online Algorithms for Minimizing Maximum Lateness. Algorithmica. 50(3). 312–328. 6 indexed citations
3.
Pruhs, Kirk, Rob van Stee, & Patchrawat Uthaisombut. (2007). Speed Scaling of Tasks with Precedence Constraints. Theory of Computing Systems. 43(1). 67–80. 66 indexed citations
4.
Pruhs, Kirk & Patchrawat Uthaisombut. (2005). A Comparison of Multicast Pull Models. Algorithmica. 42(3-4). 289–307. 4 indexed citations
5.
Larsen, Kim S., et al.. (2003). Dynamic TCP acknowledgment in the LogP model. Journal of Algorithms. 48(2). 407–428. 4 indexed citations
6.
Stein, Clifford, et al.. (2002). Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. Symposium on Discrete Algorithms. 723–731. 20 indexed citations
7.
Alborzi, Houman, et al.. (2001). The k-Client Problem. Journal of Algorithms. 41(2). 115–173. 15 indexed citations
8.
Torng, Eric, et al.. (2000). Applying extra-resource analysis to load balancing. Symposium on Discrete Algorithms. 560–561. 6 indexed citations
9.
Torng, Eric & Patchrawat Uthaisombut. (2000). New directions in machine scheduling. 8 indexed citations
10.
Torng, Eric, et al.. (2000). Applying extra‐resource analysis to load balancing. Journal of Scheduling. 3(5). 273–288. 2 indexed citations
11.
Torng, Eric, et al.. (2000). Applying extra-resource analysis to load balancing. Journal of Scheduling. 3(5). 273–288. 12 indexed citations
12.
Torng, Eric & Patchrawat Uthaisombut. (1999). Lower bounds for SRPT-subsequence algorithms for nonpreemptive scheduling. Symposium on Discrete Algorithms. 973–974. 5 indexed citations
13.
Torng, Eric & Patchrawat Uthaisombut. (1999). A tight lower bound for the best- algorithm. Information Processing Letters. 71(1). 17–22. 1 indexed citations
14.
Alborzi, Houman, et al.. (1997). The k-client problem. Symposium on Discrete Algorithms. 73–82. 5 indexed citations
15.
Guyer, Daniel E., Patchrawat Uthaisombut, & George Stockman. (1996). <title>Tissue reflectance and machine vision for automated sweet cherry sorting</title>. Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE. 2907. 152–165. 9 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Claire Hanen Breakdown of academic impact, for papers by Wun-Tat Chan Breakdown of academic impact, for papers by K. Dan Levin Breakdown of academic impact, for papers by David P. Bunde Breakdown of academic impact, for papers by Antonios Antoniadis Breakdown of academic impact, for papers by Louis-Claude Canon Breakdown of academic impact, for papers by Gábor Galambos Breakdown of academic impact, for papers by S. Ghosh Breakdown of academic impact, for papers by D. Aksoy Breakdown of academic impact, for papers by Nimar S. Arora
Rankless by CCL
2026