%0 Journal Article %1 journals/rsa/JenssenPP23 %A Jenssen, Matthew %A Perkins, Will %A Potukuchi, Aditya %D 2023 %J Random Struct. Algorithms %K dblp %N 1 %P 215-241 %T Approximately counting independent sets in bipartite graphs via graph containers. %U http://dblp.uni-trier.de/db/journals/rsa/rsa63.html#JenssenPP23 %V 63

@article{journals/rsa/JenssenPP23, added-at = {2024-01-15T00:00:00.000+0100}, author = {Jenssen, Matthew and Perkins, Will and Potukuchi, Aditya}, biburl = {https://www.bibsonomy.org/bibtex/2c6435bb5d9d1115a24b829b28d72c197/dblp}, ee = {https://doi.org/10.1002/rsa.21145}, interhash = {020ae7a276b6f3ceaf77b36d9800c5e7}, intrahash = {c6435bb5d9d1115a24b829b28d72c197}, journal = {Random Struct. Algorithms}, keywords = {dblp}, month = {August}, number = 1, pages = {215-241}, timestamp = {2024-04-09T05:08:24.000+0200}, title = {Approximately counting independent sets in bipartite graphs via graph containers.}, url = {http://dblp.uni-trier.de/db/journals/rsa/rsa63.html#JenssenPP23}, volume = 63, year = 2023 }