1 – 10 of 27
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2023
-
Mark
Clique Is Hard on Average for Unary Sherali-Adams
2023) 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS p.12-25(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Finding Small Complete Subgraphs Efficiently
2023) 34th International Workshop on Combinatorial Algorithms, IWOCA 2023 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 13889 LNCS. p.185-196(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Online and Approximate Network Construction from Bounded Connectivity Constraints
2023) In International Journal of Foundations of Computer Science(
- Contribution to journal › Article
-
Mark
Minimal H-factors and covers
2023)(
- Working paper/Preprint › Preprint in preprint archive
- 2022
-
Mark
Polarised random k-SAT
2022)(
- Working paper/Preprint › Preprint in preprint archive
-
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
-
Mark
Graphical modeling of stochastic processes driven by correlated noise
(
- Contribution to journal › Article
- 2021
-
Mark
Entire functions arising from trees
(
- Contribution to journal › Article
-
Mark
Clique Is Hard on Average for Regular Resolution
(
- Contribution to journal › Article
- 2020
-
Mark
Multivariate Analysis of Orthogonal Range Searching and Graph Distances
(
- Contribution to journal › Article