| Efficient subgraph matching: Harmonizing dynamic programming, adaptive matching order, and failing set together M Han, H Kim, G Gu, K Park, WS Han Proceedings of the 2019 International Conference on Management of Data, 1429 …, 2019 | 218 | 2019 |
| Fast algorithms for single and multiple pattern Cartesian tree matching S Song, G Gu, C Ryu, S Faro, T Lecroq, K Park Theoretical Computer Science 849, 47-63, 2021 | 20 | 2021 |
| Fast multiple order-preserving matching algorithms M Han, M Kang, S Cho, G Gu, JS Sim, K Park Combinatorial Algorithms: 26th International Workshop, IWOCA 2015, Verona …, 2016 | 16 | 2016 |
| Fast multiple pattern cartesian tree matching G Gu, S Song, S Faro, T Lecroq, K Park WALCOM: Algorithms and Computation: 14th International Conference, WALCOM …, 2020 | 6 | 2020 |
| Scalable graph isomorphism: Combining pairwise color refinement and backtracking via compressed candidate space G Gu, Y Nam, K Park, Z Galil, GF Italiano, WS Han 2021 IEEE 37th International Conference on Data Engineering (ICDE), 1368-1379, 2021 | 4 | 2021 |
| Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label Distributions G Gu, Y Nam, K Park, Z Galil, GF Italiano, WS Han 2022 IEEE 38th International Conference on Data Engineering (ICDE), 872-884, 2022 | 3 | 2022 |
