52 citations · 224 across the 34 of their papers we have counts for
Showing 2018 · math.COShow all
2 papers · 2 filters
math.CO2018★ 2 cited
Satisfiability Thresholds for Regular Occupation Problems
Konstantinos Panagiotou, Matija Pasch
In the last two decades the study of random instances of constraint satisfaction problems (CSPs) has flourished across several disciplines, including computer science, mathematics…
math.CO2018★ 1 cited
Asymptotic Enumeration of Graph Classes with Many Components
Konstantinos Panagiotou, Leon Ramzews
We consider graph classes in which every graph has components in a class of connected graphs. We provide a framework for the asymptotic study of $\lvert\…