| NAPS: Natural program synthesis dataset M Zavershynskyi, A Skidanov, I Polosukhin arXiv preprint arXiv:1807.03168, 2018 | 32 | 2018 |
| The higher-order Voronoi diagram of line segments E Papadopoulou, M Zavershynskyi Algorithmica 74 (1), 415-439, 2016 | 31 | 2016 |
| On the complexity of higher order abstract Voronoi diagrams C Bohler, P Cheilaris, R Klein, CH Liu, E Papadopoulou, M Zavershynskyi Computational Geometry 48 (8), 539-551, 2015 | 23 | 2015 |
| On the complexity of higher order abstract Voronoi diagrams C Bohler, P Cheilaris, R Klein, CH Liu, E Papadopoulou, M Zavershynskyi Automata, Languages, and Programming: 40th International Colloquium, ICALP …, 2013 | 18 | 2013 |
| A sweepline algorithm for higher order Voronoi diagrams M Zavershynskyi, E Papadopoulou 2013 10th International Symposium on Voronoi Diagrams in Science and …, 2013 | 11 | 2013 |
| On higher order Voronoi diagrams of line segments E Papadopoulou, M Zavershynskyi International Symposium on Algorithms and Computation, 177-186, 2012 | 11 | 2012 |
| A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams C Bohler, CH Liu, E Papadopoulou, M Zavershynskyi International Symposium on Algorithms and Computation, 27-37, 2014 | 10 | 2014 |
| A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams. MZ Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou Computational Geometry: Theory and Applications 59, 2016 | 9* | 2016 |
| nearai/torchfold: v0.1.0 I Polosukhin, M Zavershynskyi https://doi.org/10.5281/zenodo.1299387, 2018 | 2 | 2018 |
| nearai/program_synthesis: v0.1.2 I Polosukhin, M Zavershynskyi, R Shin https://doi.org/10.5281/zenodo.1299382, 2018 | | 2018 |
| Higher-order Voronoi diagrams of polygonal objects M Zavershynskyi | | 2014 |
