Back to authors
Kunsoo Park
- Author ID
- u19807
- ORCID
-
-
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Seoul National University
- Pagerank
- 0.080112423
- Overall Rank
- 904 | 95.83%
- Paper Count
- 10
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing all 10 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 961 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
61 |
0.00012830477 |
| 1,901 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
41 |
9.4014537e-05 |
| 4,783 |
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming |
2021 |
VLDB |
14 |
6.4133399e-05 |
| 5,426 |
Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach |
2024 |
VLDB |
8 |
6.1332147e-05 |
| 6,506 |
BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification |
2023 |
VLDB |
10 |
5.758981e-05 |
| 8,893 |
Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space |
2026 |
SIGMOD |
1 |
5.2534908e-05 |
| 8,900 |
Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds |
2025 |
VLDB |
1 |
5.2534908e-05 |
| 10,799 |
CREST: Approximate k-Clique Counting in Real-World Networks via Refinement of Star-Based Sample Space |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 12,101 |
IDAR: Fast Supergraph Search Using DAG Integration |
2020 |
VLDB |
1 |
4.9769913e-05 |
| 12,481 |
Interval Disaggregate: A New Operator for Business Planning |
2014 |
VLDB |
0 |
4.9769913e-05 |
Frequent Co-authors
Co-authored at least 5 papers.