11 – 20 of 29
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2021
-
Mark
Clique Is Hard on Average for Regular Resolution
(
- Contribution to journal › Article
- 2020
-
Mark
The Phases of a Discrete Flow of Particles on Graphs
(
- Contribution to journal › Article
-
Mark
Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
2020) 35th Computational Complexity Conference, CCC 2020 In Leibniz International Proceedings in Informatics, LIPIcs 169.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Multivariate Analysis of Orthogonal Range Searching and Graph Distances
(
- Contribution to journal › Article
- 2019
-
Mark
Shortest two disjoint paths in polynomial time
(
- Contribution to journal › Article
-
Mark
A faster hafnian formula for complex matrices and its benchmarking on a supercomputer
(
- 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
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
(
- Contribution to journal › Article
- 2018
-
Mark
Extensor-Coding
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2017
-
Mark
Spotting Trees with Few Leaves
(
- Contribution to journal › Article