![](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/spaa/RackeSS18
@inproceedings{DBLP:conf/spaa/RackeSS18, author = {Harald R{\"{a}}cke and Roy Schwartz and Richard Stotz}, editor = {Christian Scheideler and Jeremy T. Fineman}, title = {Trees for Vertex Cuts, Hypergraph Cuts and Minimum Hypergraph Bisection}, booktitle = {Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, {SPAA} 2018, Vienna, Austria, July 16-18, 2018}, pages = {23--32}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3210377.3210398}, doi = {10.1145/3210377.3210398}, timestamp = {Wed, 23 Dec 2020 10:18:11 +0100}, biburl = {https://dblp.org/rec/conf/spaa/RackeSS18.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.