| 2025 | ADC | From Exploratory Heuristics to Exact Search: Accelerating Maximum Common Subgraph Algorithms. | Buddhi W. Kothalawala, Henning Koehler, Qing Wang, Muhammad Farhan |
| 2025 | CP | Learning to Bound for Maximum Common Subgraph Algorithms. | Buddhi W. Kothalawala, Henning Koehler, Qing Wang |
| 2025 | EDBT | Stable Tree Labelling for Accelerating Distance Queries on Dynamic Road Networks. | Henning Koehler, Muhammad Farhan, Qing Wang |
| 2025 | ER | Possibilistic SQL Constraints. | Ilya Litvinenko, Philipp Skavantzos, Henning Koehler, Sebastian Link |
| 2024 | ICDE | Entity/Relationship Profiling. | Henning Koehler, Sebastian Link |
| 2022 | SIGMOD | BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale. | Muhammad Farhan, Qing Wang, Henning Koehler |
| 2021 | SIGMOD | Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks. | Ye Wang, Qing Wang, Henning Koehler, Yu Lin |
| 2018 | ICDE | An SQL Data Summarization Tool for the Acquisition of Meaningful Cardinality Constraints and Functional Dependencies. | Aniruddh Gandhi, Sven Hartmann, Henning Koehler, Sebastian Link |