![](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/HarrelsonHR03
@inproceedings{DBLP:conf/spaa/HarrelsonHR03, author = {Chris Harrelson and Kirsten Hildrum and Satish Rao}, editor = {Arnold L. Rosenberg and Friedhelm Meyer auf der Heide}, title = {A polynomial-time tree decomposition to minimize congestion}, booktitle = {{SPAA} 2003: Proceedings of the Fifteenth Annual {ACM} Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, {USA} (part of {FCRC} 2003)}, pages = {34--43}, publisher = {{ACM}}, year = {2003}, url = {https://doi.org/10.1145/777412.777419}, doi = {10.1145/777412.777419}, timestamp = {Wed, 21 Nov 2018 11:11:22 +0100}, biburl = {https://dblp.org/rec/conf/spaa/HarrelsonHR03.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.