publications
2022
- SIGMOD Rec.Bipartite Matching: What to do in the Real World When Computing Assignment Costs Dominates Finding the Optimal AssignmentSIGMOD Record, Jun 2022
2021
- VLDB2021Optimizing Bipartite Matching in Real-World Applications by Incremental Cost ComputationProceedings of the VLDB Endowment, Mar 2021
- IJCAI2021Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks (Extended Abstract)In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21, Mar 2021
2020
- ICAPS2020Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road NetworksIn Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, ICAPS 2020, Mar 2020
- ICDE2020K-SPIN: Efficiently Processing Spatial Keyword Queries on Road Networks (Extended Abstract)In Proceedings of the Thirty Sixth IEEE International Conference on Data Engineering, ICDE 2020, Mar 2020
- IEEE TKDEK-SPIN: Efficiently Processing Spatial Keyword Queries on Road NetworksIEEE Transactions on Knowledge and Data Engineering, Mar 2020
2018
- SOCS2018k-Nearest Neighbors on Road Networks: Euclidean Heuristic RevisitedIn Proceedings of the Eleventh Annual Symposium on Combinatorial Search, SoCS 2018, Mar 2018
2017
- DASFAA2017Efficient Landmark-Based Candidate Generation for kNN Queries on Road NetworksIn Proceedings of the Twenty Second International Conference on Database Systems for Advanced Applications, DASFAA 2017, Mar 2017