1 – 10 of 52
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2021
-
Mark
Approximate Counting of k-Paths : Simpler, Deterministic, and in Polynomial Space
(
- Contribution to journal › Article
- 2019
-
Mark
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
(
- Contribution to journal › Article
- 2018
-
Mark
Exploiting Sparsity for Bipartite Hamiltonicity
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2017
-
Mark
Counting thin subgraphs via packings faster than meet-in-the-middle time
(
- Contribution to journal › Article
-
Mark
Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Narrow sieves for parameterized paths and packings
(
- Contribution to journal › Article
- 2016
-
Mark
Constrained Multilinear Detection and Generalized Graph Motifs
(
- Contribution to journal › Article
-
Mark
How Proofs are Prepared at Camelot
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding