![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record conf/sigecom/EzraFGT22
@inproceedings{DBLP:conf/sigecom/EzraFGT22, author = {Tomer Ezra and Michal Feldman and Nick Gravin and Zhihao Gavin Tang}, editor = {David M. Pennock and Ilya Segal and Sven Seuken}, title = {General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching}, booktitle = {{EC} '22: The 23rd {ACM} Conference on Economics and Computation, Boulder, CO, USA, July 11 - 15, 2022}, pages = {1148--1177}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3490486.3538290}, doi = {10.1145/3490486.3538290}, timestamp = {Sat, 30 Sep 2023 09:56:23 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/EzraFGT22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.