![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Dagstuhl Seminar Proceedings: Algorithmic Aspects of Large and Complex Networks 2005
- Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner:
Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005. Dagstuhl Seminar Proceedings 05361, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 - Sándor P. Fekete, Alexander Kröller, Dennis Pfisterer, Stefan Fischer:
Deterministic boundary recongnition and topology extraction for large sensor networks. - Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis:
A Cost Mechanism for Fair Pricing of Resource Usage. - David Hales, Stefano Arteconi:
Friends for Free: Self-Organizing Artificial Social Networks for Trust and Cooperation. - Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis:
Cost Sharing Mechanisms for Fair Pricing of Resources Usage. - Nadine Baumann, Martin Skutella:
Computing earliest arrival flows with multiple sources. - Marco Gaertler, Dorothea Wagner:
A Hybrid Model for Drawing Dynamic and Evolving Graphs. - Stephen G. Kobourov, Alon Efrat, David Forrester, Anand Iyer:
Force-Directed Approaches to Sensor Network Localization. - Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner:
05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks.
![](https://dblp.dagstuhl.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.