Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{davies_et_al:LIPIcs.ICALP.2021.62, author = {Davies, Ewan and Perkins, Will}, title = {{Approximately Counting Independent Sets of a Given Size in BoundedDegree Graphs}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {62:162:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771955}, ISSN = {18688969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14131}, URN = {urn:nbn:de:0030drops141310}, doi = {10.4230/LIPIcs.ICALP.2021.62}, annote = {Keywords: approximate counting, independent sets, Markov chains} }
Keywords:  approximate counting, independent sets, Markov chains  
Collection:  48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)  
Issue Date:  2021  
Date of publication:  02.07.2021 