| Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling TM Chan, E Grant, J Könemann, M Sharpe Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 135 | 2012 |
| Exact algorithms and APX-hardness results for geometric packing and covering problems TM Chan, E Grant Computational Geometry 47 (2), 112-124, 2014 | 94 | 2014 |
| On column-restricted and priority covering integer programs D Chakrabarty, E Grant, J Könemann Integer Programming and Combinatorial Optimization: 14th International …, 2010 | 54 | 2010 |
| Self-approaching graphs S Alamdari, TM Chan, E Grant, A Lubiw, V Pathak Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA …, 2013 | 38 | 2013 |
| The school bus problem on trees A Bock, E Grant, J Könemann, L Sanità Algorithmica 67, 49-64, 2013 | 35 | 2013 |
| Closures in formal languages and Kuratowski's theorem J Brzozowski, E Grant, J Shallit International Journal of Foundations of Computer Science 22 (02), 301-321, 2011 | 33 | 2011 |
| 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 | 29 | 2013 |
| Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences E Grant, J Shallit, T Stoll arXiv preprint arXiv:0812.3186, 2008 | 25 | 2008 |
| Nearly optimal linear embeddings into very low dimensions E Grant, C Hegde, P Indyk 2013 IEEE Global Conference on Signal and Information Processing, 973-976, 2013 | 13 | 2013 |
| Exact algorithms and apx-hardness results for geometric set cover TM Chan, E Grant Proc. 23rd Canadian Conference on Computational Geometry, 431-436, 2011 | 9 | 2011 |
| Strip packing with slicing S Alamdari, T Biedl, T Chan, E Grant, K Jampani, S Keshav, A Lubiw, ... 2013b). URL http://csclub. uwaterloo. ca/∼ egrant/ElyotResearchPapers …, 0 | 7 | |
| The Approximability and Integrality Gap of Interval Stabbing and Independence Problems. S Ben-David, E Grant, W Ma, M Sharpe CCCG, 47-52, 2012 | 3 | 2012 |
| Closures in formal languages: Concatenation, separation, and algorithms J Brzozowski, E Grant, J Shallit arXiv preprint arXiv:0901.3763, 2009 | 2 | 2009 |
| Covering Problems via Structural Approaches E Grant University of Waterloo, 2011 | 1 | 2011 |
| Compressive sensing using locality-preserving matrices E Grant, P Indyk Proceedings of the twenty-ninth annual symposium on Computational geometry …, 2013 | | 2013 |
| A geometric approach to combinatorial fixed-point theorems E Grant, W Ma The Seventh European Conference on Combinatorics, Graph Theory and …, 2013 | | 2013 |
| Dimension reduction algorithms for near-optimal low-dimensional embeddings and compressive sensing E Grant Massachusetts Institute of Technology, 2013 | | 2013 |
| On Avoiding Sufficiently Long Abelian Squares E Grant arXiv preprint arXiv:1012.0524, 2010 | | 2010 |
