![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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
- 2015
- Toshihiro Akagi, Shin-Ichi Nakano:
On r-Gatherings on the Line. FAW 2015: 25-32 - Jie Cheng, Daming Zhu, Binhai Zhu:
A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow. FAW 2015: 33-44 - Fedor V. Fomin
, Saket Saurabh, Neeldhara Misra:
Graph Modification Problems: A Modern Perspective. FAW 2015: 3-6 - Martin Fürer
:
Efficient Computation of the Characteristic Polynomial of a Threshold Graph. FAW 2015: 45-51 - Cunjing Ge, Feifei Ma:
A Fast and Practical Method to Estimate Volumes of Convex Polytopes. FAW 2015: 52-65 - Chengwei Guo, Chenglong Ma, Shengyu Zhang:
Social Models and Algorithms for Optimization of Contact Immunity of Oral Polio Vaccine. FAW 2015: 66-77 - Yusupjan Habibulla, Jin Hua Zhao, Hai-Jun Zhou:
The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation. FAW 2015: 78-88 - Yijie Han:
A Linear Time Algorithm for Ordered Partition. FAW 2015: 89-103 - Jueliang Hu, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong
, Randy Goebel, Yinfeng Xu, Guohui Lin:
Machine Scheduling with a Maintenance Interval and Job Delivery Coordination. FAW 2015: 104-114 - Ping Huang, Kaile Su
:
Lower and Upper Bounds for Random Mimimum Satisfiability Problem. FAW 2015: 115-124 - Gábor Ivanyos
, Miklos Santha:
On Solving Systems of Diagonal Polynomial Equations Over Finite Fields. FAW 2015: 125-137 - Daniel Karapetyan
, Andrei V. Gagarin, Gregory Z. Gutin:
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints. FAW 2015: 138-149 - Christian Komusiewicz, Andreea Radulescu:
On the Sound Covering Cycle Problem in Paired de Bruijn Graphs. FAW 2015: 150-161 - Wenjun Li, Shuai Hu:
Smaller Kernels for Several FPT Problems Based on Simple Observations. FAW 2015: 170-179 - Gaidi Li, Dachuan Xu
, Donglei Du
, Chenchen Wu:
Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties. FAW 2015: 162-169 - Mugang Lin
, Wenjun Li, Qilong Feng:
Parameterized Minimum Cost Partition of a Tree with Supply and Demand. FAW 2015: 180-189 - Henan Liu, Yinfeng Xu:
The Online Storage Strategy for Automated Storage and Retrieval System with Single Open in One Dimension. FAW 2015: 190-197 - Tian Liu, Ke Xu:
Union Closed Tree Convex Sets. FAW 2015: 198-203 - Yang Liu, Shengyu Zhang:
Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores. FAW 2015: 204-216 - Photchchara Pisantechakool
, Xuehou Tan:
A New Distributed Algorithm for Computing a Dominating Set on Grids. FAW 2015: 217-228 - Maoning Wang, Mingjie Liu:
Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory. FAW 2015: 241-258 - Jinyan Wang, Minghao Yin
, Jingli Wu:
Approximate Model Counting via Extension Rule. FAW 2015: 229-240 - Youshi Wang, Fa Zhang, Zhiyong Liu:
Truthful Strategy and Resource Integration for Multi-tenant Data Center Demand Response. FAW 2015: 259-270 - Aiyong Xian, Kaiyuan Zhu, Daming Zhu, Lianrong Pu:
Local Search to Approximate Max NAE- k k -Sat Tightly. FAW 2015: 271-281 - Mingyu Xiao, Shaowei Kou:
Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs. FAW 2015: 282-293 - Katsuhisa Yamanaka, Shin-Ichi Nakano:
Enumeration, Counting, and Random Generation of Ladder Lotteries. FAW 2015: 294-303 - Chee-Keng Yap:
Soft Subdivision Search in Motion Planning, II: Axiomatics. FAW 2015: 7-22 - Haibo Yu, Guoqiang Bai, Huikang Hao:
Efficient Modular Reduction Algorithm Without Correction Phase. FAW 2015: 304-313 - Peng Zhang, Yong Gao:
Super Solutions of Random Instances of Satisfiability. FAW 2015: 314-325 - Fengquan Zhou, Xin Song, Yinghua Han, Jing Gao:
A Data Streams Analysis Strategy Based on Hadoop Scheduling Optimization for Smart Grid Application. FAW 2015: 326-333
skipping 1 more match
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-18 15:07 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