1 – 4 of 4
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2021
-
Mark
Modular counting of subgraphs : Matchings, matching-splittable graphs, and paths
2021) 29th Annual European Symposium on Algorithms, ESA 2021 In Leibniz International Proceedings in Informatics, LIPIcs 204.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2018
-
Mark
Extensor-Coding
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2014
-
Mark
Exponential Time Complexity of the Permanent and the Tutte Polynomial
(
- Contribution to journal › Article
- 2010
-
Mark
Exponential time complexity of the permanent and the Tutte polynomial
2010) 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) In Lecture Notes in Computer Science 6198. p.426-437(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding