Go to the corresponding LIPIcs Volume Portal 
Esperet, Louis ; Harms, Nathaniel ; Kupavskii, Andrey
pdfformat: 

@InProceedings{esperet_et_al:LIPIcs.APPROX/RANDOM.2022.18, author = {Esperet, Louis and Harms, Nathaniel and Kupavskii, Andrey}, title = {{Sketching Distances in Monotone Graph Classes}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)}, pages = {18:118:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772495}, ISSN = {18688969}, year = {2022}, volume = {245}, editor = {Chakrabarti, Amit and Swamy, Chaitanya}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/17140}, URN = {urn:nbn:de:0030drops171406}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.18}, annote = {Keywords: adjacency labelling, informative labelling, distance sketching, adjacency sketching, communication complexity} }
Keywords:  adjacency labelling, informative labelling, distance sketching, adjacency sketching, communication complexity  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)  
Issue Date:  2022  
Date of publication:  15.09.2022 