1 – 5 of 5
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2022
-
Mark
The shortest even cycle problem is tractable
2022) 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022 In Proceedings of the Annual ACM Symposium on Theory of Computing p.117-130(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2019
-
Mark
Shortest two disjoint paths in polynomial time
(
- Contribution to journal › Article
-
Mark
Approximate counting of K-paths : Deterministic and in polynomial space
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A faster hafnian formula for complex matrices and its benchmarking on a supercomputer
(
- Contribution to journal › Article
- 2017
-
Mark
Spotting Trees with Few Leaves
(
- Contribution to journal › Article