Parinya Chalermsook

639 total citations
22 papers, 128 citations indexed

About

Parinya Chalermsook is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Parinya Chalermsook has authored 22 papers receiving a total of 128 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Computational Theory and Mathematics, 9 papers in Computer Networks and Communications and 7 papers in Artificial Intelligence. Recurrent topics in Parinya Chalermsook's work include Complexity and Algorithms in Graphs (17 papers), Advanced Graph Theory Research (9 papers) and Optimization and Search Problems (8 papers). Parinya Chalermsook is often cited by papers focused on Complexity and Algorithms in Graphs (17 papers), Advanced Graph Theory Research (9 papers) and Optimization and Search Problems (8 papers). Parinya Chalermsook collaborates with scholars based in Germany, United States and Finland. Parinya Chalermsook's co-authors include Julia Chuzhoy, Danupon Nanongkai, Bundit Laekhanukit, Jittat Fakcharoenphol, Ashwin Lall, Atish Das Sarma, Kurt Mehlhorn, Pasin Manurangsi, Guy Kortsarz and Thatchaphol Saranurak and has published in prestigious journals such as Mathematical Programming, SIAM Journal on Computing and ACM SIGMETRICS Performance Evaluation Review.

In The Last Decade

Parinya Chalermsook

17 papers receiving 122 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Parinya Chalermsook Germany 7 70 53 50 20 13 22 128
Tamás Király Hungary 7 137 2.0× 54 1.0× 31 0.6× 18 0.9× 15 1.2× 36 193
Jakub Łącki Poland 8 96 1.4× 69 1.3× 14 0.3× 48 2.4× 29 2.2× 26 153
Rajiv Raman United States 8 105 1.5× 48 0.9× 31 0.6× 14 0.7× 6 0.5× 25 160
Euiwoong Lee United States 6 70 1.0× 50 0.9× 12 0.2× 19 0.9× 7 0.5× 42 122
Hamid Zarrabi-Zadeh Canada 6 42 0.6× 51 1.0× 46 0.9× 28 1.4× 32 2.5× 22 120
Maximilian Probst Gutenberg Switzerland 5 72 1.0× 49 0.9× 10 0.2× 34 1.7× 10 0.8× 16 107
A. V. Karzanov Russia 7 143 2.0× 68 1.3× 22 0.4× 31 1.6× 13 1.0× 19 213
Lujun Jia United States 7 76 1.1× 297 5.6× 18 0.4× 18 0.9× 5 0.4× 7 324
Mathieu Liedloff France 11 217 3.1× 110 2.1× 6 0.1× 20 1.0× 10 0.8× 36 276
Oded Lachish United Kingdom 8 112 1.6× 44 0.8× 7 0.1× 79 4.0× 8 0.6× 26 164

Countries citing papers authored by Parinya Chalermsook

Since Specialization
Citations

This map shows the geographic impact of Parinya Chalermsook'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 Parinya Chalermsook with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Parinya Chalermsook more than expected).

Fields of papers citing papers by Parinya Chalermsook

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Parinya Chalermsook. 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 Parinya Chalermsook. The network helps show where Parinya Chalermsook may publish in the future.

Co-authorship network of co-authors of Parinya Chalermsook

This figure shows the co-authorship network connecting the top 25 collaborators of Parinya Chalermsook. A scholar is included among the top collaborators of Parinya Chalermsook 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 Parinya Chalermsook. Parinya Chalermsook is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Byrka, Jarosław, et al.. (2023). Parameterized Approximation Schemes for Clustering with General Norm Objectives. 1377–1399. 3 indexed citations
2.
Chalermsook, Parinya & Bartosz Walczak. (2021). Coloring and Maximum Weight Independent Set of Rectangles. arXiv (Cornell University). 860–868.
3.
Chalermsook, Parinya, Marek Cygan, Guy Kortsarz, et al.. (2020). From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More. SIAM Journal on Computing. 49(4). 772–810. 6 indexed citations
4.
Chalermsook, Parinya, Mayank Goswami, László Kozma, Kurt Mehlhorn, & Thatchaphol Saranurak. (2018). Multi-Finger Binary Search Trees. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1–26. 1 indexed citations
5.
Adamaszek, Anna, Parinya Chalermsook, Alina Ene, & Andreas Wiese. (2018). Submodular unsplittable flow on trees. Mathematical Programming. 172(1-2). 565–589.
6.
Chalermsook, Parinya, et al.. (2017). Beyond metric embedding: approximating group steiner trees on bounded treewidth graphs. Symposium on Discrete Algorithms. 737–751. 1 indexed citations
7.
Chalermsook, Parinya, et al.. (2017). Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. SPIRE - Sciences Po Institutional REpository. 737–751.
8.
Chalermsook, Parinya, Mayank Goswami, László Kozma, Kurt Mehlhorn, & Thatchaphol Saranurak. (2015). Pattern-Avoiding Access in Binary Search Trees. 410–423. 6 indexed citations
9.
Chalermsook, Parinya, Atish Das Sarma, Ashwin Lall, & Danupon Nanongkai. (2015). Social Network Monetization via Sponsored Viral Marketing. ACM SIGMETRICS Performance Evaluation Review. 43(1). 259–270. 6 indexed citations
10.
Chalermsook, Parinya, José Correa, Andreas Karrenbauer, et al.. (2015). On Guillotine Cutting Sequences. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1–19. 3 indexed citations
11.
Chalermsook, Parinya, Atish Das Sarma, Ashwin Lall, & Danupon Nanongkai. (2015). Social Network Monetization via Sponsored Viral Marketing. 259–270. 8 indexed citations
12.
Adamaszek, Anna, Parinya Chalermsook, & Andreas Wiese. (2015). How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
13.
Chalermsook, Parinya, Bundit Laekhanukit, & Danupon Nanongkai. (2014). Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. 21. 444–453. 1 indexed citations
14.
Chalermsook, Parinya, Shiva Kintali, Richard J. Lipton, & Danupon Nanongkai. (2013). . 19(1). 1–19.
15.
Chalermsook, Parinya, Bundit Laekhanukit, & Danupon Nanongkai. (2013). Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. 370–379. 19 indexed citations
16.
Chalermsook, Parinya, Julia Chuzhoy, Alina Ene, & Shi Li. (2012). Approximation algorithms and hardness of integral concurrent flow. 689–708. 1 indexed citations
17.
Chalermsook, Parinya & Julia Chuzhoy. (2010). Resource Minimization for Fire Containment. 1334–1349. 1 indexed citations
18.
Chalermsook, Parinya & Julia Chuzhoy. (2009). Maximum independent set of rectangles. Symposium on Discrete Algorithms. 892–901. 32 indexed citations
19.
Chalermsook, Parinya & Julia Chuzhoy. (2009). Maximum Independent Set of Rectangles. 892–901. 20 indexed citations
20.
Chalermsook, Parinya, Jittat Fakcharoenphol, & Danupon Nanongkai. (2004). A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. Symposium on Discrete Algorithms. 828–829. 18 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 Tamás Király Breakdown of academic impact, for papers by Jakub Łącki Breakdown of academic impact, for papers by Rajiv Raman Breakdown of academic impact, for papers by Euiwoong Lee Breakdown of academic impact, for papers by Hamid Zarrabi-Zadeh Breakdown of academic impact, for papers by Maximilian Probst Gutenberg Breakdown of academic impact, for papers by A. V. Karzanov Breakdown of academic impact, for papers by Lujun Jia Breakdown of academic impact, for papers by Mathieu Liedloff Breakdown of academic impact, for papers by Oded Lachish
Rankless by CCL
2026