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.080125402
- Overall Rank
- 902 | 95.85%
- 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 |
| 952 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
62 |
0.00012878316 |
| 1,907 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
42 |
9.379165e-05 |
| 4,801 |
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming |
2021 |
VLDB |
14 |
6.3940913e-05 |
| 5,271 |
Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach |
2024 |
VLDB |
9 |
6.1891764e-05 |
| 6,251 |
BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification |
2023 |
VLDB |
11 |
5.8179719e-05 |
| 8,913 |
Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space |
2026 |
SIGMOD |
1 |
5.2361195e-05 |
| 8,920 |
Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds |
2025 |
VLDB |
1 |
5.2361195e-05 |
| 10,860 |
CREST: Approximate k-Clique Counting in Real-World Networks via Refinement of Star-Based Sample Space |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 12,145 |
IDAR: Fast Supergraph Search Using DAG Integration |
2020 |
VLDB |
1 |
4.9605343e-05 |
| 12,524 |
Interval Disaggregate: A New Operator for Business Planning |
2014 |
VLDB |
0 |
4.9605343e-05 |
Frequent Co-authors
Co-authored at least 5 papers.