1 – 2 of 2
- 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
- 2017
-
Mark
Counting thin subgraphs via packings faster than meet-in-the-middle time
(
- Contribution to journal › Article