Extremal results on feedback arc sets in digraphs.
Random Struct. Algorithms, March, 2024
Fast Sampling of Satisfying Assignments from Random \(\boldsymbol{k}\)-SAT with Applications to Connectivity.
SIAM J. Discret. Math., 2024
Turán problems for mixed graphs.
J. Comb. Theory B, 2024
On sum-intersecting families of positive integers.
Eur. J. Comb., 2024
Counterexamples to a Weitz-Style Reduction for Multispin Systems.
CoRR, 2024
Random local access for sampling k-SAT solutions.
CoRR, 2024
A fourth-moment phenomenon for asymptotic normality of monochromatic subgraphs.
Random Struct. Algorithms, December, 2023
On the number of error correcting codes.
Comb. Probab. Comput., September, 2023
Making an H $H$ -free graph k $k$ -colorable.
J. Graph Theory, 2023
Nearly All k-SAT Functions Are Unate.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
From Algorithms to Connectivity and Back: Finding a Giant Component in Random <i>k</i>-SAT.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Strong Spatial Mixing for Colorings on Trees and its Algorithmic Applications.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
From algorithms to connectivity and back: finding a giant component in random k-SAT.
CoRR, 2022
Enumerating k-SAT functions.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming.
SIAM J. Discret. Math., 2021
Making an $H$-Free Graph $k$-Colorable.
CoRR, 2021
An Interpretable Approach to Hateful Meme Detection.
Proceedings of the ICMI '21: International Conference on Multimodal Interaction, 2021
Lower Bounds for Max-Cut via Semidefinite Programming.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020