1 – 3 of 3
- 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
- 2010
-
Mark
Finding failure-disjoint paths for path diversity protection in communication networks
(
- Contribution to journal › Article
- 2002
-
Mark
Finding a path of superlogarithmic length
2002) Proceedings of 29th International Colloquium on Automata, Languages and Programming LNCS 2380. p.985-992(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding