| Flip distance between two triangulations of a point set is NP-complete A Lubiw, V Pathak Computational Geometry 49, 17-23, 2015 | 71 | 2015 |
| Streaming and dynamic algorithms for minimum enclosing balls in high dimensions TM Chan, V Pathak Computational Geometry 47 (2), 240-247, 2014 | 49 | 2014 |
| Shortest reconfiguration paths in the solution space of Boolean formulas AE Mouawad, N Nishimura, V Pathak, V Raman SIAM Journal on Discrete Mathematics 31 (3), 2185-2200, 2017 | 46 | 2017 |
| Self-approaching graphs S Alamdari, TM Chan, E Grant, A Lubiw, V Pathak Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA …, 2013 | 33 | 2013 |
| Smart-grid electricity allocation via strip packing with slicing S Alamdari, T Biedl, TM Chan, E Grant, KR Jampani, S Keshav, A Lubiw, ... Algorithms and Data Structures: 13th International Symposium, WADS 2013 …, 2013 | 27* | 2013 |
| Flipping edge-labelled triangulations P Bose, A Lubiw, V Pathak, S Verdonschot Computational Geometry 68, 309-326, 2018 | 21 | 2018 |
| Black-box certification and learning under adversarial perturbations H Ashtiani, V Pathak, R Urner International Conference on Machine Learning, 388-398, 2020 | 19 | 2020 |
| Reconfiguring triangulations V Pathak University of Waterloo, 2015 | 4 | 2015 |
| Reconfiguring ordered bases of a matroid A Lubiw, V Pathak arXiv preprint arXiv:1612.00958, 2016 | 3 | 2016 |
| Adversarially robust learning with tolerance H Ashtiani, V Pathak, R Urner International Conference on Algorithmic Learning Theory, 115-135, 2023 | 2 | 2023 |
| Streaming and dynamic algorithms for minimum enclosing balls in high dimensions V Pathak University of Waterloo, 2011 | 1 | 2011 |
Anna LubiwProfessor, David R. Cheriton School of Computer Science, University of WaterlooVerified email at uwaterloo.ca
