Parinya Chalermsook

Available identifiers

zbMath Open chalermsook.parinyaMaRDI QIDQ510955

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6138067	2024-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q6147304	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6062157	2023-10-31	Paper
Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns	2023-07-05	Paper
https://portal.mardi4nfdi.de/entity/Q5874496	2023-02-07	Paper
On finding balanced bicliques via matchings	2022-12-21	Paper
https://portal.mardi4nfdi.de/entity/Q5091047	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5090466	2022-07-18	Paper
On minimum generalized Manhattan connections	2022-03-25	Paper
https://portal.mardi4nfdi.de/entity/Q5009500	2021-08-04	Paper
Multi-transversals for Triangles and the Tuza's Conjecture	2021-02-02	Paper
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More	2020-08-18	Paper
New tools and connections for exponential-time approximation	2019-09-10	Paper
Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation	2019-05-15	Paper
https://portal.mardi4nfdi.de/entity/Q4633902	2019-05-06	Paper
Submodular unsplittable flow on trees	2018-10-26	Paper
Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs	2018-07-16	Paper
A Tight Extremal Bound on the Lov\'{a}sz Cactus Number in Planar Graphs	2018-04-10	Paper
On Survivable Set Connectivity	2017-10-05	Paper
https://portal.mardi4nfdi.de/entity/Q5351886	2017-08-31	Paper
https://portal.mardi4nfdi.de/entity/Q5351888	2017-08-31	Paper
Finding Triangles for Maximum Planar Subgraphs	2017-05-05	Paper
New Integrality Gap Results for the Firefighters Problem on Trees	2017-04-04	Paper
https://portal.mardi4nfdi.de/entity/Q2963930	2017-02-21	Paper
A note on fractional coloring and the integrality gap of LP for maximum weight independent set	2017-02-14	Paper
Submodular Unsplittable Flow on Trees	2016-08-10	Paper
Self-Adjusting Binary Search Trees: What Makes Them Tick?	2015-11-19	Paper
Greedy Is an Almost Optimal Deque	2015-10-30	Paper
https://portal.mardi4nfdi.de/entity/Q5501344	2015-08-03	Paper
Pattern-avoiding access in binary search trees	2015-07-24	Paper
Nearly Tight Approximability Results for Minimum Biclique Cover and Partition	2014-10-08	Paper
New Approximability Results for the Robust k-Median Problem	2014-09-02	Paper
https://portal.mardi4nfdi.de/entity/Q5417712	2014-05-22	Paper
Approximation algorithms and hardness of integral concurrent flow	2014-05-13	Paper
https://portal.mardi4nfdi.de/entity/Q5414632	2014-05-07	Paper
Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation	2014-03-31	Paper
Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply	2012-11-02	Paper
Coloring and Maximum Independent Set of Rectangles	2011-08-17	Paper
Computing and Combinatorics	2006-01-11	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Parinya Chalermsook