Остановите войну!
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 34 matches
- 2010
- Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten:
Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems. COCOA (1) 2010: 237-251 - Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti:
Feasibility-Based Bounds Tightening via Fixed Points. COCOA (1) 2010: 65-76 - Wlodzimierz Bielecki, Tomasz Klimek, Marek Palkowski, Anna Beletska:
An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations. COCOA (1) 2010: 104-113 - Zhixiang Chen, Bin Fu:
Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials. COCOA (1) 2010: 309-323 - Danny Z. Chen, Ewa Misiolek:
Computing Toolpaths for 5-Axis NC Machines. COCOA (1) 2010: 270-284 - Eddie Cheng, Ke Qiu, Zhizhang Shen:
The Number of Shortest Paths in the (n, k)-Star Graphs. COCOA (1) 2010: 222-236 - Ovidiu Daescu, Wenqi Ju, Jun Luo:
NP-Completeness of Spreading Colored Points. COCOA (1) 2010: 41-50 - Hongwei Du, Qiang Ye, Jiaofei Zhong, Yuexuan Wang, Wonjun Lee, Haesun Park:
PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks. COCOA (1) 2010: 252-259 - David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott:
Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures. COCOA (1) 2010: 128-141 - Neng Fan, Panos M. Pardalos:
Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks. COCOA (1) 2010: 170-183 - Sándor P. Fekete, Chris Gray, Alexander Kröller:
Evacuation of Rectilinear Polygons. COCOA (1) 2010: 21-30 - Andreas Emil Feldmann, Shantanu Das, Peter Widmayer:
Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. COCOA (1) 2010: 11-20 - Loreto Gonzalez-Hernandez, Nelson Rangel-Valdez, Jose Torres-Jimenez:
Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach. COCOA (1) 2010: 51-64 - Ararat Harutyunyan:
A Fast Algorithm for Powerful Alliances in Trees. COCOA (1) 2010: 31-40 - Xin He, Jiun-Jie Wang, Huaming Zhang:
Compact Visibility Representation of 4-Connected Plane Graphs. COCOA (1) 2010: 339-353 - Giuseppe F. Italiano, Luigi Laura, Federico Santaroni:
Finding Strong Bridges and Strong Articulation Points in Linear Time. COCOA (1) 2010: 157-169 - Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya:
Some Variations on Constrained Minimum Enclosing Circle Problem. COCOA (1) 2010: 354-368 - Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich:
Transporting Jobs through a Processing Center with Two Parallel Machines. COCOA (1) 2010: 408-422 - Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho:
Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs. COCOA (1) 2010: 385-397 - Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh:
An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs. COCOA (1) 2010: 184-196 - Elmar Langetepe:
Searching for an Axis-Parallel Shoreline. COCOA (1) 2010: 369-384 - Matthieu Latapy, Thi Ha Duong Phan, Christophe Crespelle, Thanh Qui Nguyen:
Termination of Multipartite Graph Series Arising from Complex Network Modelling. COCOA (1) 2010: 1-10 - Fei Li:
Scheduling Packets with Values and Deadlines in Size-Bounded Buffers. COCOA (1) 2010: 398-407 - Jin-Yi Liu:
A Randomized Algorithm for Weighted Approximation of Points by a Step Function. COCOA (1) 2010: 300-308 - Takashi Matsuhisa:
A Characterisation of Stable Sets in Games with Transitive Preference. COCOA (1) 2010: 77-84 - Viet Hung Nguyen:
A Primal-Dual Approximation Algorithm for the Asymmetric Prize-Collecting TSP. COCOA (1) 2010: 260-269 - André Schulz, Csaba D. Tóth:
The Union of Colorful Simplices Spanned by a Colored Point Set. COCOA (1) 2010: 324-338 - Yilin Shen, Dung T. Nguyen, My T. Thai:
On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs. COCOA (1) 2010: 197-211 - Yi Shi, Maryam Hasan, Zhipeng Cai, Guohui Lin, Dale Schuurmans:
Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering. COCOA (1) 2010: 85-103 - Tomoyuki Yamakami:
A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs. COCOA (1) 2010: 285-299
skipping 4 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 21:46 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