 | 2012 |
|---|
| 10 |       | Timothy M. Chan,
Elyot Grant,
Jochen Könemann,
Malcolm Sharpe:
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling.
SODA 2012: 1576-1585 |
| 2011 |
|---|
| 9 | | Elyot Grant,
Timothy M. Chan:
Exact Algorithms and APX-Hardness Results for Geometric Set Cover.
CCCG 2011 |
| 8 | | Adrian Bock,
Elyot Grant,
Jochen Könemann,
Laura Sanità:
The School Bus Problem on Trees.
ISAAC 2011: 10-19 |
| 7 | | Janusz A. Brzozowski,
Elyot Grant,
Jeffrey Shallit:
Closures in Formal Languages and Kuratowski's Theorem.
Int. J. Found. Comput. Sci. 22(2): 301-321 (2011) |
| 2010 |
|---|
| 6 | | Deeparnab Chakrabarty,
Elyot Grant,
Jochen Könemann:
On Column-Restricted and Priority Covering Integer Programs.
IPCO 2010: 355-368 |
| 5 | | Deeparnab Chakrabarty,
Elyot Grant,
Jochen Könemann:
On Column-restricted and Priority Covering Integer Programs
CoRR abs/1003.1507: (2010) |
| 4 | | Elyot Grant:
On Avoiding Sufficiently Long Abelian Squares
CoRR abs/1012.0524: (2010) |
| 2009 |
|---|
| 3 | | Janusz A. Brzozowski,
Elyot Grant,
Jeffrey Shallit:
Closures in Formal Languages and Kuratowski's Theorem.
Developments in Language Theory 2009: 125-144 |
| 2 | | Janusz A. Brzozowski,
Elyot Grant,
Jeffrey Shallit:
Closures in Formal Languages and Kuratowski's Theorem
CoRR abs/0901.3761: (2009) |
| 1 | | Janusz A. Brzozowski,
Elyot Grant,
Jeffrey Shallit:
Closures in Formal Languages: Concatenation, Separation, and Algorithms
CoRR abs/0901.3763: (2009) |
Data released under the ODC-BY 1.0 license — See also our legal information page