Back to authors
Henning Köhler
- Author ID
- 13448
- ORCID
-
-
- Links
-
(found by gpt-5.6-luna on jul 26 2026)
- Most Frequent Institution
- Massey University
- Pagerank
- 0.089449259
- Overall Rank
- 782 | 96.29%
- Paper Count
- 12
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 12 of 12 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 4,303 |
Possible and Certain SQL Keys |
2015 |
VLDB |
6.7711902e-05 |
| 5,784 |
Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks |
2021 |
SIGMOD |
6.0896788e-05 |
| 6,292 |
Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks |
2023 |
SIGMOD |
5.9251728e-05 |
| 6,467 |
Efficient Parallel Skyline Processing using Hyperplane Projections |
2011 |
SIGMOD |
5.8712039e-05 |
| 6,827 |
Sampling Dirty Data for Matching Attributes |
2010 |
SIGMOD |
5.7616041e-05 |
| 7,158 |
BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale |
2022 |
SIGMOD |
5.6858492e-05 |
| 9,619 |
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks |
2025 |
SIGMOD |
5.2434488e-05 |
| 10,187 |
Accelerating Maximum Common Subgraph Computation by Exploiting Symmetries |
2026 |
SIGMOD |
5.093636e-05 |
| 10,788 |
Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks |
2025 |
SIGMOD |
5.093636e-05 |
| 10,918 |
Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks |
2025 |
VLDB |
5.093636e-05 |
| 11,044 |
Mining Meaningful Keys and Foreign Keys with High Precision and Recall |
2025 |
VLDB |
5.093636e-05 |
| 12,055 |
SQL Schema Design: Foundations, Normal Forms, and Normalization |
2016 |
SIGMOD |
5.093636e-05 |
Frequent Co-authors
Co-authored at least 5 papers.