Parinya Chalermsook
Assistant Professor at Aalto University School of Business
Schools
- Aalto University School of Business
Links
Biography
Aalto University School of Business
Research interests:
- Approximation Algorithms
- Hardness of Approximation
- Combinatorial optimization
- Combinatorics (mostly, graph theory)
- Data structures
CURRICULUM VITAE
Education
- PhD (Computer Science). University of Chicago (2012)
- MS (Computer Science) University of Chicago (2008)
- M.Eng. Asian Institute of Technology (2005)
- B.Eng. Kasetsart University (2002)
Past Experience
- Senior Researcher. Max Planck Institute for Informatics, Germany.
- Postdoc. Max Planck Institute for Informatics, Germany.
- Researcher. IDSIA, Switzerland.
- Lecturer. Kasetsart University, Thailand.
Peer-reviewed scientific articles
Journal article-refereed, Original researchTwo lower bounds for shortest double-base number system
Chalermsook, Parinya; Imai, Hiroshi; Suppakitpaisarn, Vorapong2015 in IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES (Maruzen Co., Ltd/Maruzen Kabushikikaisha)ISSN: 0916-8508Simple distributed algorithms for approximating minimum steiner trees
Chalermsook, Parinya; Fakcharoenphol, Jittat2005 in Springer Verlag (Maruzen Co., Ltd/Maruzen Kabushikikaisha)Conference proceedingsNew integrality gap results for the firefighters problem on trees
Chalermsook, Parinya; Vaz, Daniel2017 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer-Verlag)ISBN: 9783319517407ISSN: 0302-9743Beyond metric embedding Approximating group steiner trees on bounded treewidth graphs
Chalermsook, Parinya; Das, Syamantak; Laekhanukit, Bundit; Vaz, Daniel2017 ISBN: 9781611974782Submodular unsplittable flow on trees
Adamaszek, Anna; Chalermsook, Parinya; Ene, Alina; Wiese, Andreas2016 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer-Verlag)ISBN: 9783319334608ISSN: 0302-9743On guillotine cutting sequences
Abed, Fidaa; Chalermsook, Parinya; Correa, José; Karrenbauer, Andreas; Pérez-Lantero, Pablo; Soto, José A.; Wiese, Andreas2015 ISBN: 9783939897897How to tame rectangles Solving independent set and coloring of rectangles via shrinking
Adamaszek, Anna; Chalermsook, Parinya; Wiese, Andreas2015 ISBN: 9783939897897Pattern-Avoiding Access in Binary Search Trees
Chalermsook, Parinya; Goswami, Mayank; Kozma, Laszlo; Mehlhorn, Kurt; Saranurak, Thatchaphol2015 ISBN: 9781467381918Greedy is an almost optimal deque
Chalermsook, Parinya; Goswami, Mayank; Kozma, László; Mehlhorn, Kurt; Saranurak, Thatchaphol2015 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer-Verlag)ISBN: 9783319218397ISSN: 0302-9743On survivable set connectivity
Chalermsook, Parinya; Grandoni, Fabrizio; Laekhanukit, Bundit2015 Self-adjusting binary search trees What makes them tick?
Chalermsook, Parinya; Goswami, Mayank; Kozma, László; Mehlhorn, Kurt; Saranurak, Thatchaphol2015 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer-Verlag)ISBN: 9783662483497ISSN: 0302-9743New approximability results for the robust k-median problem
Bhattacharya, Sayan; Chalermsook, Parinya; Mehlhorn, Kurt; Neumann, Adrian2014 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer-Verlag)ISBN: 9783319084039ISSN: 0302-9743Coloring graph powers Graph product bounds and hardness of approximation
Chalermsook, Parinya; Laekhanukit, Bundit; Nanongkai, Danupon2014 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer-Verlag)ISBN: 9783642544224ISSN: 0302-9743Nearly tight approximability results for minimum biclique cover and partition
Chalermsook, Parinya; Heydrich, Sandy; Holm, Eugenia; Karrenbauer, Andreas2014 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer-Verlag)ISBN: 9783662447765ISSN: 0302-9743Pre-reduction graph products Hardnesses of properly learning DFAs and approximating EDP on DAGs
Chalermsook, Parinya; Laekhanukit, Bundit; Nanongkai, Danupon2014 ISBN: 9781479965175Independent set, induced matching, and pricing Connections and tight (subexponential time) approximation hardnesses
Chalermsook, Parinya; Laekhanukit, Bundit; Nanongkai, Danupon2013 ISBN: 9780769551357Graph products revisited Tight approximation hardness of induced matching, poset dimension and more
Chalermsook, Parinya; Laekhanukit, Bundit; Nanongkai, Danupon2013 ISBN: 9781611972511Clustering with center constraints
Chalermsook, Parinya; Venkatasubramanian, Suresh2013 ISBN: 9783939897644Improved hardness results for profit maximization pricing problems with unlimited supply
Chalermsook, Parinya; Chuzhoy, Julia; Kannan, Sampath; Khanna, Sanjeev2012 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing)ISBN: 9783642325113ISSN: 0302-9743Approximation algorithms and hardness of integral concurrent flow
Chalermsook, Parinya; Chuzhoy, Julia; Ene, Alina; Li, Shi2012 ISBN: 9781450312455Coloring and maximum independent set of rectangles
Chalermsook, Parinya2011 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing)ISBN: 9783642229343ISSN: 0302-9743Improved hardness of approximation for Stackelberg shortest-path pricing
Briest, Patrick; Chalermsook, Parinya; Khanna, Sanjeev; Laekhanukit, Bundit; Nanongkai, Danupon2010 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing)ISBN: 3642175716ISSN: 0302-9743Resource minimization for fire containment
Chalermsook, Parinya; Chuzhoy, Julia2010 ISBN: 9780898717013Maximum independent set of rectangles
Chalermsook, Parinya; Chuzhoy, Julia2009 ISBN: 9780898716801A deterministic near-linear time algorithm for finding minimum cuts in planar graphs
Chalermsook, Parinya; Fakcharoenphol, Jittat; Nanongkai, Danupon2004
Two lower bounds for shortest double-base number system
Chalermsook, Parinya; Imai, Hiroshi; Suppakitpaisarn, Vorapong
2015 in IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES (Maruzen Co., Ltd/Maruzen Kabushikikaisha)ISSN: 0916-8508
Simple distributed algorithms for approximating minimum steiner trees
Chalermsook, Parinya; Fakcharoenphol, Jittat
2005 in Springer Verlag (Maruzen Co., Ltd/Maruzen Kabushikikaisha)New integrality gap results for the firefighters problem on trees
Chalermsook, Parinya; Vaz, Daniel
2017 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer-Verlag)ISBN: 9783319517407
ISSN: 0302-9743
Beyond metric embedding Approximating group steiner trees on bounded treewidth graphs
Chalermsook, Parinya; Das, Syamantak; Laekhanukit, Bundit; Vaz, Daniel
2017 ISBN: 9781611974782
Submodular unsplittable flow on trees
Adamaszek, Anna; Chalermsook, Parinya; Ene, Alina; Wiese, Andreas
2016 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer-Verlag)ISBN: 9783319334608
ISSN: 0302-9743
On guillotine cutting sequences
Abed, Fidaa; Chalermsook, Parinya; Correa, José; Karrenbauer, Andreas; Pérez-Lantero, Pablo; Soto, José A.; Wiese, Andreas
2015 ISBN: 9783939897897
How to tame rectangles Solving independent set and coloring of rectangles via shrinking
Adamaszek, Anna; Chalermsook, Parinya; Wiese, Andreas
2015 ISBN: 9783939897897
Pattern-Avoiding Access in Binary Search Trees
Chalermsook, Parinya; Goswami, Mayank; Kozma, Laszlo; Mehlhorn, Kurt; Saranurak, Thatchaphol
2015 ISBN: 9781467381918
Greedy is an almost optimal deque
Chalermsook, Parinya; Goswami, Mayank; Kozma, László; Mehlhorn, Kurt; Saranurak, Thatchaphol
2015 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer-Verlag)ISBN: 9783319218397
ISSN: 0302-9743
On survivable set connectivity
Chalermsook, Parinya; Grandoni, Fabrizio; Laekhanukit, Bundit
2015 Self-adjusting binary search trees What makes them tick?
Chalermsook, Parinya; Goswami, Mayank; Kozma, László; Mehlhorn, Kurt; Saranurak, Thatchaphol
2015 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer-Verlag)ISBN: 9783662483497
ISSN: 0302-9743
New approximability results for the robust k-median problem
Bhattacharya, Sayan; Chalermsook, Parinya; Mehlhorn, Kurt; Neumann, Adrian
2014 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer-Verlag)ISBN: 9783319084039
ISSN: 0302-9743
Coloring graph powers Graph product bounds and hardness of approximation
Chalermsook, Parinya; Laekhanukit, Bundit; Nanongkai, Danupon
2014 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer-Verlag)ISBN: 9783642544224
ISSN: 0302-9743
Nearly tight approximability results for minimum biclique cover and partition
Chalermsook, Parinya; Heydrich, Sandy; Holm, Eugenia; Karrenbauer, Andreas
2014 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer-Verlag)ISBN: 9783662447765
ISSN: 0302-9743
Pre-reduction graph products Hardnesses of properly learning DFAs and approximating EDP on DAGs
Chalermsook, Parinya; Laekhanukit, Bundit; Nanongkai, Danupon
2014 ISBN: 9781479965175
Independent set, induced matching, and pricing Connections and tight (subexponential time) approximation hardnesses
Chalermsook, Parinya; Laekhanukit, Bundit; Nanongkai, Danupon
2013 ISBN: 9780769551357
Graph products revisited Tight approximation hardness of induced matching, poset dimension and more
Chalermsook, Parinya; Laekhanukit, Bundit; Nanongkai, Danupon
2013 ISBN: 9781611972511
Clustering with center constraints
Chalermsook, Parinya; Venkatasubramanian, Suresh
2013 ISBN: 9783939897644
Improved hardness results for profit maximization pricing problems with unlimited supply
Chalermsook, Parinya; Chuzhoy, Julia; Kannan, Sampath; Khanna, Sanjeev
2012 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing)ISBN: 9783642325113
ISSN: 0302-9743
Approximation algorithms and hardness of integral concurrent flow
Chalermsook, Parinya; Chuzhoy, Julia; Ene, Alina; Li, Shi
2012 ISBN: 9781450312455
Coloring and maximum independent set of rectangles
Chalermsook, Parinya
2011 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing)ISBN: 9783642229343
ISSN: 0302-9743
Improved hardness of approximation for Stackelberg shortest-path pricing
Briest, Patrick; Chalermsook, Parinya; Khanna, Sanjeev; Laekhanukit, Bundit; Nanongkai, Danupon
2010 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing)ISBN: 3642175716
ISSN: 0302-9743
Resource minimization for fire containment
Chalermsook, Parinya; Chuzhoy, Julia
2010 ISBN: 9780898717013
Maximum independent set of rectangles
Chalermsook, Parinya; Chuzhoy, Julia
2009 ISBN: 9780898716801
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs
Chalermsook, Parinya; Fakcharoenphol, Jittat; Nanongkai, Danupon
2004 Read about executive education
Other experts
Roberta De Sanctis
Curriculum Vitae SDA Fellow Degree in Political Sciences, University of Rome, 1995 School for interpreter and translator, Rome, 1992 MBA, SDA Bocconi, Milan, Italy, 2000 Academic position and/or professional activities Contract Professor; Responsible of Corporate Relationships for Master MiM...
Freimut Bodendorf
Freimut Bodendorf (born in 1953) studied computer science at the Faculty of Engineering at Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU) from 1972 to 1978. After completing his doctoral degree in 1981 at FAU’s School of Business and Economics, he was head of the Department of Documentat...
Looking for an expert?
Contact us and we'll find the best option for you.