Cited By
View all- Aloupis GIacono JLangerman SÖzkan ÖWuhrer S(2024)The Complexity of Order Type IsomorphismDiscrete & Computational Geometry10.1007/s00454-024-00687-172:2(483-502)Online publication date: 18-Sep-2024
- Fang WBeckert U(2018)Parallel Tree Search in Volunteer ComputingJournal of Grid Computing10.1007/s10723-017-9411-516:4(647-662)Online publication date: 1-Dec-2018
- Aloupis GIacono JLangerman SÖzkan ÖWuhrer SChekuri C(2014)The complexity of order type isomorphismProceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms10.5555/2634074.2634104(405-415)Online publication date: 5-Jan-2014
- Show More Cited By