1 – 3 of 3
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2020
-
Mark
A simple approach to nondecreasing paths
(
- Contribution to journal › Article
- 2013
-
Mark
Unique subgraphs are not easier to find
(
- Contribution to journal › Article
- 2009
-
Mark
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication
(
- Contribution to journal › Article