@InProceedings{amanatidis_et_al:LIPIcs.STACS.2023.7,
author = {Amanatidis, Georgios and Kleer, Pieter},
title = {{Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals}},
booktitle = {40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)},
pages = {7:1--7:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-266-2},
ISSN = {1868-8969},
year = {2023},
volume = {254},
editor = {Berenbrink, Petra and Bouyer, Patricia and Dawar, Anuj and Kant\'{e}, Mamadou Moustapha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.7},
URN = {urn:nbn:de:0030-drops-176596},
doi = {10.4230/LIPIcs.STACS.2023.7},
annote = {Keywords: graph sampling, degree interval, degree sequence, Markov Chain Monte Carlo method, switch Markov chain}
}