1 – 8 of 8
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2018
- Are unique subgraphs not easier to find?
- 2015
- Detecting monomials with k distinct variables
- 2014
- Efficiently Correcting Matrix Products
- 2009
- Faster multi-witnesses for Boolean matrix multiplication
- 2005
- A note on maximum independent set and related problems on box graphs
- 2004
- Approximation algorithms for Hamming clustering problems
- 2002
- Approximation algorithms for time-dependent orienteering
- 2001
- A fast algorithm for optimal alignment between similar ordered trees
