Остановите войну!
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 33 matches
- 2010
- Balasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro:
Time Optimal Algorithms for Black Hole Search in Rings. COCOA (2) 2010: 58-71 - Brad Ballinger, Nadia M. Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara:
Coverage with k-Transmitters in the Presence of Obstacles. COCOA (2) 2010: 1-15 - Beate Bollig:
On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem. COCOA (2) 2010: 16-30 - Arthur H. Busch, Feodor F. Dragan, R. Sritharan:
New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs. COCOA (2) 2010: 207-218 - Artem Chebotko, Bin Fu:
XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme. COCOA (2) 2010: 97-106 - Xujin Chen, Xiaodong Hu, Weidong Ma:
Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations. COCOA (2) 2010: 31-45 - Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks. COCOA (2) 2010: 254-267 - Peter Damaschke, Azam Sheikh Muhammad:
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives. COCOA (2) 2010: 117-130 - Mirela Damian, Kristin Raudonis:
Yao Graphs Span Theta Graphs. COCOA (2) 2010: 181-194 - Wei Ding, Guohui Lin, Guoliang Xue:
Diameter-Constrained Steiner Tree. COCOA (2) 2010: 243-253 - Wei Ding, Guoliang Xue:
A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree. COCOA (2) 2010: 268-280 - Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Jaroslav Opatrny, Oscar Morales-Ponce, Ladislav Stacho:
Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle. COCOA (2) 2010: 72-86 - Hongbing Fan, Yu-Liang Wu:
Structured Overlay Network for File Distribution. COCOA (2) 2010: 292-302 - Jing He, Hongyu Liang:
An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs. COCOA (2) 2010: 160-169 - Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Bipartite Permutation Graphs Are Reconstructible. COCOA (2) 2010: 362-373 - Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny:
Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations. COCOA (2) 2010: 303-316 - Deying Li, Zheng Li, Wenkai Ma, Hong Chen:
Constrained Surface-Level Gateway Placement for Underwater Acoustic Wireless Sensor Networks. COCOA (2) 2010: 46-57 - Deying Li, Zheng Li, Wenkai Ma, Wenping Chen:
Constrained Low-Interference Relay Node Deployment for Underwater Acoustic Wireless Sensor Networks. COCOA (2) 2010: 281-291 - Guizhen Liu, Xuejun Pan, Jonathan Z. Sun:
A New Result on [k, k + 1]-Factors Containing Given Hamiltonian Cycles. COCOA (2) 2010: 170-180 - Marjan Marzban, Qian-Ping Gu, Xiaohua Jia:
Computational Study for Planar Connected Dominating Set Problem. COCOA (2) 2010: 107-116 - Asish Mukhopadhyay, Animesh Sarker, Tom Switzer:
Approximate Ellipsoid in the Streaming Model. COCOA (2) 2010: 401-413 - James Nastos, Yong Gao:
A Novel Branching Strategy for Parameterized Graph Modification Problems. COCOA (2) 2010: 332-346 - Viet Hung Nguyen:
Approximation Algorithm for the Minimum Directed Tree Cover. COCOA (2) 2010: 144-159 - Martin Olsen, Anastasios Viglas, Ilia Zvedeniouk:
A Constant-Factor Approximation Algorithm for the Link Building Problem. COCOA (2) 2010: 87-96 - Tomoshi Otsuki, Hideyuki Aisu, Toshiaki Tanaka:
A Search-Based Approach to the Railway Rolling Stock Allocation Problem. COCOA (2) 2010: 131-143 - Tadao Takaoka, Mashitoh Hashim:
A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n2logn) Expected Time. COCOA (2) 2010: 195-206 - Jinsong Tan:
The Networked Common Goods Game. COCOA (2) 2010: 317-331 - Cong Tian, Zhenhua Duan:
A Transformation from PPTL to S1S. COCOA (2) 2010: 374-386 - Bang Ye Wu:
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem. COCOA (2) 2010: 219-227 - Mingyu Xiao:
Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs. COCOA (2) 2010: 387-400
skipping 3 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-30 05:40 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