Остановите войну!
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 31 matches
- 2014
- Tamal Biswas, Kenneth W. Regan:
Efficient Memoization for Approximate Function Evaluation over Sequence Arguments. AAIM 2014: 185-196 - Peter Brass, Hyeon-Suk Na, Chan-Su Shin:
Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme. AAIM 2014: 1-12 - Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Degree Anonymization by Vertex Addition. AAIM 2014: 44-55 - Leizhen Cai, Junjie Ye:
Parameterized Complexity of Connected Induced Subgraph Problems. AAIM 2014: 219-230 - Francis Y. L. Chin, Bin Fu, Minghui Jiang, Hing-Fung Ting, Yong Zhang:
Competitive Algorithms for Unbounded One-Way Trading. AAIM 2014: 32-43 - Well Y. Chiu, Mario Szegedy, Chengu Wang, Yixin Xu:
The Garden Hose Complexity for the Equality Function. AAIM 2014: 112-123 - H. K. Dai, H. C. Su:
Clustering Performance of 3-Dimensional Hilbert Curves. AAIM 2014: 299-311 - Sandip Das, Anil Maheshwari, Ayan Nandy, Michiel H. M. Smid:
A Facility Coloring Problem in 1-D. AAIM 2014: 88-99 - Wei Ding, Guohui Lin:
Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights. AAIM 2014: 197-207 - Lili Ding, Xiaoling Wang, Wanglin Kang:
An Auction-Bargaining Model for Initial Emission Permits. AAIM 2014: 331-340 - Barbara Geissmann, Rastislav Srámek:
Finding Robust Minimum Cuts. AAIM 2014: 124-136 - Hayk Grigoryan, Hovhannes A. Harutyunyan:
New Lower Bounds on Broadcast Function. AAIM 2014: 174-184 - Chengwei Guo, Leizhen Cai:
Obtaining Split Graphs by Edge Contraction. AAIM 2014: 208-218 - Hovhannes A. Harutyunyan:
Broadcast Networks with Near Optimal Cost. AAIM 2014: 312-322 - Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Multiple Sink Location Problems in Dynamic Path Networks. AAIM 2014: 149-161 - Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Yue-Li Wang:
Edge-Clique Covers of the Tensor Product. AAIM 2014: 66-74 - Daiki Hoshika, Eiji Miyano:
Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes. AAIM 2014: 100-111 - Shenwei Huang, Matthew Johnson, Daniël Paulusma:
Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs. AAIM 2014: 162-173 - Yumei Huo:
Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Time Constraints. AAIM 2014: 56-65 - Haitao Jiang, Bing Su, Mingyu Xiao, Yinfeng Xu, Farong Zhong, Binhai Zhu:
On the Exact Block Cover Problem. AAIM 2014: 13-22 - Shian-Hua Lin, Shao-Hong Ding, Wei-Sheng Zeng:
Protein Name Recognition Based on Dictionary Mining and Heuristics. AAIM 2014: 75-87 - Tian Liu:
Restricted Bipartite Graphs: Comparison and Hardness Results. AAIM 2014: 241-252 - Taibo Luo, Yinfeng Xu:
Semi-online Hierarchical Load Balancing Problem with Bounded Processing Times. AAIM 2014: 231-240 - Fengmao Lv, Guowu Yang, Shuangbao Wang, Fuyou Fan:
The Research on Controlling the Iteration of Quantum-Inspired Evolutionary Algorithms for Artificial Neural Networks. AAIM 2014: 253-262 - Hela Masri, Saoussen Krichen, Adel Guitouni:
A Hybrid Genetic Algorithm for Solving the Unsplittable Multicommodity Flow Problem: The Maritime Surveillance Case. AAIM 2014: 137-148 - Rabeb Mbarek, Mohamed Tmar, Hawete Hattab:
An Optimal Context for Information Retrieval. AAIM 2014: 323-330 - Guanqun Ni, Yinfeng Xu, Yucheng Dong:
Minimax Regret k-sink Location Problem in Dynamic Path Networks. AAIM 2014: 23-31 - Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza:
On P 3-Convexity of Graphs with Bounded Degree. AAIM 2014: 263-274 - Elham Roshanbin:
The Competitive Diffusion Game in Classes of Graphs. AAIM 2014: 275-287 - Mingyu Xiao:
A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler. AAIM 2014: 288-298
skipping 1 more match
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-11 18:38 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