1 – 10 of 20
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2018
- Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
- 2017
- Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
- Counting thin subgraphs via packings faster than meet-in-the-middle time
- Narrow sieves for parameterized paths and packings
- 2016
- How Proofs are Prepared at Camelot
- Constrained Multilinear Detection and Generalized Graph Motifs
- 2015
- Engineering Motif Search for Large Graphs
- 2014
- Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time
- Fast Witness Extraction using a Decision Oracle
- 2013
- Counting Closed Trails