![](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/approx/BraunFP14
@inproceedings{DBLP:conf/approx/BraunFP14, author = {G{\'{a}}bor Braun and Samuel Fiorini and Sebastian Pokutta}, editor = {Klaus Jansen and Jos{\'{e}} D. P. Rolim and Nikhil R. Devanur and Cristopher Moore}, title = {Average Case Polyhedral Complexity of the Maximum Stable Set Problem}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona, Spain}, series = {LIPIcs}, volume = {28}, pages = {515--530}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.515}, doi = {10.4230/LIPICS.APPROX-RANDOM.2014.515}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/BraunFP14.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.