1 – 6 of 6
- 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
- 2021
-
Mark
Clique Is Hard on Average for Regular Resolution
(
- Contribution to journal › Article
- 2020
-
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
- 2015
-
Mark
On the proper orientation number of bipartite graphs
(
- Contribution to journal › Article
- 2013
-
Mark
Intersecting longest paths
(
- Contribution to journal › Article
- 2011
-
Mark
Intersection of Longest Paths in a Graph
2011) Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011 In Electronic Notes in Discrete Mathematics 38. p.743-748(
- Contribution to journal › Article