Остановите войну!
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
- 2008
- Andrew Baker, Joe Sawada:
Magic Labelings on Cycles and Wheels. COCOA 2008: 361-373 - Lichen Bao, Sergey Bereg:
Clustered SplitsNetworks. COCOA 2008: 469-478 - Nadja Betzler, Johannes Uhlmann:
Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems. COCOA 2008: 43-53 - Binay K. Bhattacharya, Mike Burmester, Yuzhuang Hu, Evangelos Kranakis, Qiaosheng Shi, Andreas Wiese:
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region. COCOA 2008: 103-115 - Sebastian Böcker, Sebastian Briesemeister, Quang Bao Anh Bui, Anke Truß:
Going Weighted: Parameterized Algorithms for Cluster Editing. COCOA 2008: 1-12 - René Brandenberg, Lucia Roth:
New Algorithms for k-Center and Extensions. COCOA 2008: 64-78 - Andreas Brandstädt, Van Bang Le:
Simplicial Powers of Graphs. COCOA 2008: 160-170 - Andreas Brandstädt, Peter Wagner:
On k-Versus (k+1)-Leaf Powers. COCOA 2008: 171-179 - Véronique Bruyère, Hadrien Mélot:
Turán Graphs, Stability Number, and Fibonacci Index. COCOA 2008: 127-138 - Zhipeng Cai, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang:
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem. COCOA 2008: 286-295 - Rhonda Chaytor, Patricia A. Evans, Todd Wareham:
Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries. COCOA 2008: 23-31 - Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu:
On Recovering Syntenic Blocks from Comparative Maps. COCOA 2008: 319-327 - Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Strong Formulations for 2-Node-Connected Steiner Network Problems. COCOA 2008: 190-200 - Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Delay Management Problem: Complexity Results and Robust Algorithms. COCOA 2008: 458-468 - Peter Damaschke:
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets. COCOA 2008: 32-42 - Peter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens:
Covering Arrays Avoiding Forbidden Edges. COCOA 2008: 296-308 - Karine Deschinkel, Sid Ahmed Ali Touati:
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization. COCOA 2008: 438-447 - Hongbing Fan, Christian Hundt, Yu-Liang Wu, Jason Ernst:
Algorithms and Implementation for Interconnection Graph Problem. COCOA 2008: 201-210 - Henning Fernau, Daniel Raible:
A Parameterized Perspective on Packing Paths of Length Two. COCOA 2008: 54-63 - Bin Fu, Zhiyu Zhao:
Separating Sublinear Time Computations by Approximate Diameter. COCOA 2008: 79-88 - Anna Galluccio, Claudio Gentile, Paolo Ventura:
On the Stable Set Polytope of Claw-Free Graphs. COCOA 2008: 339-350 - Arvind Gupta, Mehdi Karimi, Eun Jung Kim, Arash Rafiey:
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. COCOA 2008: 374-383 - Shai Gutner:
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems. COCOA 2008: 246-254 - Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Enumerating Isolated Cliques in Synthetic and Financial Networks. COCOA 2008: 405-416 - Yumei Huo, Haibing Li, Hairong Zhao:
Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays. COCOA 2008: 427-437 - Gerold Jäger, Paul Molitor:
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order. COCOA 2008: 211-224 - Hyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong Chwa:
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem. COCOA 2008: 265-277 - Vadim E. Levit, Eugen Mandrescu:
The Clique Corona Operation and Greedoids. COCOA 2008: 384-392 - Xiangyong Li, Yash P. Aneja, Md. Fazle Baki:
Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks. COCOA 2008: 235-245 - Leo Liberti:
Automatic Generation of Symmetry-Breaking Constraints. COCOA 2008: 328-338
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-06-16 15:49 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