Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{yokoi:LIPIcs.ISAAC.2021.71, author = {Yokoi, Yu}, title = {{An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {71:171:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772143}, ISSN = {18688969}, year = {2021}, volume = {212}, editor = {Ahn, HeeKap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/15504}, URN = {urn:nbn:de:0030drops155047}, doi = {10.4230/LIPIcs.ISAAC.2021.71}, annote = {Keywords: Stable matching, Approximation algorithm, Matroid, Strategyproofness} }
Keywords:  Stable matching, Approximation algorithm, Matroid, Strategyproofness  
Collection:  32nd International Symposium on Algorithms and Computation (ISAAC 2021)  
Issue Date:  2021  
Date of publication:  30.11.2021 