1 – 10 of 30
- 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
- 2018
-
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
Computing the permanent modulo a prime power
(
- Contribution to journal › Article
-
Mark
Narrow sieves for parameterized paths and packings
(
- Contribution to journal › Article
- 2015
-
Mark
The Parity of Set Systems under Random Restrictions with Applications to Exponential Time Problems
2015) The 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) 9134. p.231-242(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2014
-
Mark
Shortest Two Disjoint Paths in Polynomial Time
2014) Automata, Languages, and Programming : 41st International Colloquium, ICALP 2014 8572. p.211-222(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2013
-
Mark
The Parity of Directed Hamiltonian Cycles
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2012
-
Mark
The Traveling Salesman Problem in Bounded Degree Graphs
(
- Contribution to journal › Article