Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 45 matches
- 2007
- Zareen Alamgir, Sarmad Abbasi:
Combinatorial Algorithms for Listing Paths in Minimal Change Order. CAAN 2007: 112-130 - Anthony Bonato, Pawel Pralat, Changping Wang:
Vertex Pursuit Games in Stochastic Network Models. CAAN 2007: 46-56 - Leah Epstein, Rob van Stee:
Preemptive Scheduling on Selfish Machines. CAAN 2007: 57-70 - Tobias Harks, László A. Végh:
Nonadaptive Selfish Routing with Online Demands. CAAN 2007: 27-45 - Guillermo De Ita Luna, Aurelio López-López:
A Worst-Case Time Upper Bound for Counting the Number of Independent Sets. CAAN 2007: 85-98 - Alejandro López-Ortiz:
Valiant Load Balancing, Benes Networks and Resilient Backbone Design. CAAN 2007: 2 - Alejandro López-Ortiz:
Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design. CAAN 2007: 3-12 - José M. Gutiérrez López, Rubén Cuevas Rumín, Jens Myrup Pedersen, Ole Brun Madsen:
Improving Topological Routing in N2R Networks. CAAN 2007: 131-148 - Margaret-Ellen Messinger, Pawel Pralat, Richard J. Nowakowski, Nicholas C. Wormald:
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm. CAAN 2007: 13-26 - Ioannis Milis, Aris Pagourtzis, Katerina Potika:
Selfish Routing and Path Coloring in All-Optical Networks. CAAN 2007: 71-84 - Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor:
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP. CAAN 2007: 99-111 - Peter Winkler:
Luck vs. Skill. CAAN 2007: 1 - Jeannette C. M. Janssen, Pawel Pralat:
Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers. Lecture Notes in Computer Science 4852, Springer 2007, ISBN 978-3-540-77293-4 [contents] - 2006
- Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav:
The Price of Anarchy in Selfish Multicast Routing. CAAN 2006: 5-18 - Davide Bilò, Luciano Gualà, Guido Proietti:
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. CAAN 2006: 19-30 - Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta:
On the Topologies of Local Minimum Spanning Trees. CAAN 2006: 31-44 - Ioannis Z. Emiris, Euripides Markou, Aris Pagourtzis:
Distributed Routing in Tree Networks with Few Landmarks. CAAN 2006: 45-57 - Guy Even, Shimon Shahar:
Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs. CAAN 2006: 58-71 - Michele Flammini, Mordechai Shalom, Shmuel Zaks:
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing. CAAN 2006: 72-85 - Boris Goldengorin, Gerold Jäger, Paul Molitor:
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. CAAN 2006: 86-97 - Sven Kosub, Moritz G. Maaß, Hanjo Täubig:
Acyclic Type-of-Relationship Problems on the Internet. CAAN 2006: 98-111 - Andrzej Lingas, Mia Persson, Martin Wahlen:
Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The alpha<=d Case). CAAN 2006: 112-124 - Fredrik Manne, Qin Xin:
Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks. CAAN 2006: 125-134 - David Peleg:
Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks. CAAN 2006: 1-4 - Thomas Erlebach:
Combinatorial and Algorithmic Aspects of Networking, Third Workshop, CAAN 2006, Chester, UK, July 2, 2006. Revised Papers. Lecture Notes in Computer Science 4235, Springer 2006, ISBN 3-540-48822-7 [contents] - 2005
- Alejandro López-Ortiz, Angèle M. Hamel:
Combinatorial and Algorithmic Aspects of Networking, First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3405, Springer 2005, ISBN 3-540-27873-7 [contents] - 2004
- Claus Bauer:
Stable Local Scheduling Algorithms With Low Complexity and Without Speedup for a Network of Input-Buffered Switches. CAAN 2004: 102-113 - Anthony Bonato:
A Survey of Models of the Web Graph. CAAN 2004: 159-172 - Anthony Bonato, Jeannette C. M. Janssen:
Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces. CAAN 2004: 42-48 - Andrei Z. Broder:
Invited Talk: The Many Wonders of the Web Graph. CAAN 2004: 154-154
skipping 15 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-24 08:43 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint