I agree that this site is using cookies. You can find further informations here.
X
Jiamjitrak, Wanchote
8  results:
Search for persons X
?
1

Co-Bipartite Neighborhood Edge Elimination Orderings:

Jiamjitrak, Wanchote ; van Leeuwen, Erik Jan
Electronic Notes in Discrete Mathematics.  61 (2017)  - p. 655-661 , 2017
Link: https://doi.org/10.1016/..
 
?
2

On Finding Balanced Bicliques via Matchings:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Chalermsook, Parinya ; Jiamjitrak, Wanchote Po ; Orgo, Ly - p. 238-247 , 2020
Link: https://doi.org/10.1007/..
 
?
3

The Group Access Bounds for Binary Search Trees:

Chalermsook, Parinya ; Gupta, Manoj ; Jiamjitrak, Wanchote..
http://arxiv.org/abs/2312.15426.  , 2023
Link: http://arxiv.org/abs/231..
 
?
4

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matri..:

Chalermsook, Parinya ; Gupta, Manoj ; Jiamjitrak, Wanchote...
info:eu-repo/grantAgreement/EC/H2020/759557/EU//ALGOCom.  , 2023
Link: https://aaltodoc.aalto.f..
 
?
5

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matri..:

Chalermsook, Parinya ; Gupta, Manoj ; Jiamjitrak, Wanchote...
http://arxiv.org/abs/2211.04112.  , 2022
Link: http://arxiv.org/abs/221..
 
?
6

On Finding Balanced Bicliques via Matchings:

Chalermsook, Parinya ; Jiamjitrak, Wanchote Po ; Orgo, Ly
info:eu-repo/grantAgreement/EC/H2020/759557/EU//ALGOCom.  , 2020
Link: https://aaltodoc.aalto.f..
 
?
7

New Binary Search Tree Bounds via Geometric Inversions:

Chalermsook, Parinya ; Jiamjitrak, Wanchote Po
doi:10.4230/LIPIcs.ESA.2020.28.  , 2020
Link: https://doi.org/10.4230/..
 
?
8

New binary search tree bounds via geometric inversions:

Chalermsook, Parinya ; Jiamjitrak, Wanchote Po
info:eu-repo/grantAgreement/EC/H2020/759557/EU//ALGOCom.  , 2020
Link: https://aaltodoc.aalto.f..
 
1-8