1 – 20 of 25
- show: 20
- |
- 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
- 2021
-
Mark
The fine-grained complexity of computing the tutte polynomial of a linear matroid
2021) 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms p.2333-2345(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2019
-
Mark
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
(
- Contribution to journal › Article
-
Mark
Solving systems of polynomial equations over GF(2) by a parity-counting self-reduction
2019) 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 In Leibniz International Proceedings in Informatics (LIPIcs) 132. p.1-26(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2018
-
Mark
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2017
-
Mark
Counting thin subgraphs via packings faster than meet-in-the-middle time
(
- Contribution to journal › Article
-
Mark
Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Narrow sieves for parameterized paths and packings
(
- Contribution to journal › Article
- 2016
-
Mark
How Proofs are Prepared at Camelot
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Constrained Multilinear Detection and Generalized Graph Motifs
(
- Contribution to journal › Article
- 2015
-
Mark
Engineering Motif Search for Large Graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2014
-
Mark
Fast Witness Extraction using a Decision Oracle
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2013
-
Mark
Counting Closed Trails
(
- Contribution to journal › Letter
-
Mark
Probably Optimal Graph Motifs
2013) 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), LIPIcs 20. p.20-31(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2012
-
Mark
The Traveling Salesman Problem in Bounded Degree Graphs
(
- Contribution to journal › Article
- 2010
-
Mark
Trimmed moebius inversion and graphs of bounded degree
(
- Contribution to journal › Article
-
Mark
Evaluation of permanents in rings and semirings
(
- Contribution to journal › Article
-
Mark
Covering and packing in linear space
2010) 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) 6198. p.727-737(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding