Остановите войну!
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 61 matches
- 2016
- Lin Chen, Klaus Jansen, Wenchang Luo, Guochuan Zhang:
An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints. COCOA 2016: 608-623 - Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan:
On the Parameterized Parallel Complexity and the Vertex Cover Problem. COCOA 2016: 477-488 - Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu:
Safe Sets in Graphs: Graph Classes and Structural Parameters. COCOA 2016: 241-253 - Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza:
On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs. COCOA 2016: 423-437 - Gustavo Angulo:
Relaxations of Discrete Sets with Semicontinuous Variables. COCOA 2016: 754-762 - Pawan Aurora, Monalisa Jena, Rajiv Raman:
Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem. COCOA 2016: 187-201 - Abhishek Awasthi, Jörg Lässig, Thomas Weise, Oliver Kramer:
Tackling Common Due Window Problem with a Two-Layered Approach. COCOA 2016: 772-781 - Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka:
Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound. COCOA 2016: 326-339 - Chunsong Bai, Liying Kang, Erfang Shan:
The Connected p-Center Problem on Cactus Graphs. COCOA 2016: 718-725 - Neal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs:
Optimal Speed Scaling with a Solar Cell - (Extended Abstract). COCOA 2016: 521-535 - Carl Barton, Chang Liu, Solon P. Pissis:
On-Line Pattern Matching on Uncertain Sequences and Applications. COCOA 2016: 547-562 - Cristina Bazgan, Florent Foucaud, Florian Sikora:
On the Approximability of Partial VC Dimension. COCOA 2016: 92-106 - Sergey Bereg:
On the 2-Center Problem Under Convex Polyhedral Distance Function. COCOA 2016: 365-377 - Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen:
On Local Structures of Cubicity 2 Graphs. COCOA 2016: 254-269 - Etienne Birmelé, Fabien de Montgolfier, Léo Planche:
Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem. COCOA 2016: 216-229 - Ulrik Brandes, Eugenia Holm, Andreas Karrenbauer:
Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks. COCOA 2016: 175-186 - Xujin Chen, Zhuo Diao, Xiao-Dong Hu, Zhongzheng Tang:
Total Dual Integrality of Triangle Covering. COCOA 2016: 128-143 - Clément Dallard, Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. COCOA 2016: 294-308 - Wei Ding, Ke Qiu:
A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract). COCOA 2016: 408-420 - Riccardo Dondi, Florian Sikora:
Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis. COCOA 2016: 113-127 - Maximilian Drees, Björn Feldkord, Alexander Skopalik:
Strategic Online Facility Location. COCOA 2016: 593-607 - Braulio Dumba, Zhi-Li Zhang:
Unfolding the Core Structure of the Reciprocal Graph of a Massive Online Social Network. COCOA 2016: 763-771 - Sourour Elloumi, Amélie Lambert:
Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem. COCOA 2016: 726-734 - Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano:
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. COCOA 2016: 270-284 - Matthias Feldotto, Lennart Leder, Alexander Skopalik:
Congestion Games with Mixed Objectives. COCOA 2016: 655-669 - Noriyuki Fujimoto:
A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space. COCOA 2016: 624-638 - Takuro Fukunaga, Takanori Maehara:
Computing a Tree Having a Small Vertex Cover. COCOA 2016: 77-91 - Shamik Ghosh, Raibatak Sen Gupta, Malay K. Sen:
An Introduction to Coding Sequences of Graphs. COCOA 2016: 202-215 - Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model. COCOA 2016: 144-158 - Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang:
Algorithmic Analysis for Ridesharing of Personal Vehicles. COCOA 2016: 438-452
skipping 31 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-10 14:41 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