![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 28 matches
- 2016
- Zihe Chen, Danyang Chen, Xiangyu Wang, Jianping Xiang, Hui Meng, Jinhui Xu:
How to Block Blood Flow by Using Elastic Coil. FAW 2016: 29-40 - Zhi-Zhong Chen, Youta Harada, Eita Machida, Fei Guo, Lusheng Wang:
Better Approximation Algorithms for Scaffolding Problems. FAW 2016: 17-28 - Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Linear Time Algorithm for 1-Center in Rd Under Convex Polyhedral Distance Function. FAW 2016: 41-52 - Thomas Erlebach:
Algorithms for Queryable Uncertainty. FAW 2016: 1-7 - Shaun M. Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang:
Positive Zero Forcing and Edge Clique Coverings. FAW 2016: 53-64 - Qilong Feng, Xiong Jiang, Jianxin Wang:
Improved Algorithms for Several Parameterized Problems Based on Random Methods. FAW 2016: 65-74 - Qilong Feng, Zeyang Zhou, Jianxin Wang:
Parameterized Algorithms for Maximum Edge Biclique and Related Problems. FAW 2016: 75-83 - He Hong, Cao Boyan:
The Scheduling Strategy of Virtual Machine Migration Based on the Gray Forecasting Model. FAW 2016: 84-91 - Xingfu Li, Haodi Feng, Haitao Jiang, Binhai Zhu:
A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs. FAW 2016: 92-101 - Tian Liu:
Fractional Edge Cover Number of Model RB. FAW 2016: 102-110 - Yanli Liu, Chumin Li, Kun He, Yi Fan:
Breaking Cycle Structure to Improve Lower Bound for Max-SAT. FAW 2016: 111-124 - Yunlong Liu, Jianxin Wang:
On Counting Parameterized Matching and Packing. FAW 2016: 125-134 - Kelin Luo
, Yin-Feng Xu, Xin Feng
:
Online Scheduling with Increasing Subsequence Serving Constraint. FAW 2016: 135-144 - Yuzhe Ma, Kun He, John E. Hopcroft, Pan Shi:
Nonlinear Dimension Reduction by Local Multidimensional Scaling. FAW 2016: 158-171 - Jingjing Ma, Haitao Jiang:
Notes on the 6/5-Approximation Algorithm for One-Sided Scaffold Filling. FAW 2016: 145-157 - Lili Mei, Deshi Ye, Guochuan Zhang
:
Mechanism Design for One-Facility Location Game with Obnoxious Effects. FAW 2016: 172-182 - Li Ning, Zhongying Zhao
, Rong Zhou, Yong Zhang, Shengzhong Feng:
Realtime Channel Recommendation: Switch Smartly While Watching TV. FAW 2016: 183-193 - Wei Peng, Dongxia Wang, Xinwen Jiang:
Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One. FAW 2016: 194-204 - Lianrong Pu, Haitao Jiang:
Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles? FAW 2016: 205-214 - Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao
, Hiro Ito, Mitsuo Wakatsuki:
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. FAW 2016: 215-226 - Weitian Tong
, Eiji Miyano
, Randy Goebel, Guohui Lin:
A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan. FAW 2016: 227-237 - Yongjie Yang
, Yash Raj Shrestha
, Wenjun Li, Jiong Guo:
Kernelization of Two Path Searching Problems on Split Graphs. FAW 2016: 238-249 - Hongluan Zhao, Guoyong Han, Gongwen Xu:
The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs. FAW 2016: 250-256 - Cheng Zhong, Jing Zhang, Bei Hua, Feng Yang, Zhengping Liu:
Parallel Identifying (l, d)-Motifs in Biosequences Using CPU and GPU Computing. FAW 2016: 257-268 - Guangyan Zhou:
On the Lower Bounds of Random Max 3 and 4-SAT. FAW 2016: 269-278 - Binhai Zhu:
Genomic Scaffold Filling: A Progress Report. FAW 2016: 8-16 - Peng Zou, Hui Li, Chunlin Xin, Wencheng Wang, Binhai Zhu:
Finding Disjoint Dense Clubs in an Undirected Graph. FAW 2016: 279-288 - Daming Zhu, Sergey Bereg:
Frontiers in Algorithmics, 10th International Workshop, FAW 2016, Qingdao, China, June 30- July 2, 2016, Proceedings. Lecture Notes in Computer Science 9711, Springer 2016, ISBN 978-3-319-39816-7 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.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-06-30 04:21 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