Остановите войну!
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 16 matches
- 2019
- Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P.:
Graph Orientation with Edge Modifications. FAW 2019: 38-50 - Pradeesha Ashok, Meghana M. Reddy:
Efficient Guarding of Polygons and Terrains. FAW 2019: 26-37 - Subhash Bhagat, Krishnendu Mukhopadhyaya:
Mutual Visibility by Robots with Persistent Memory. FAW 2019: 144-155 - Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
Read-Once Resolutions in Horn Formulas. FAW 2019: 100-110 - Qingqiong Cai, Shenwei Huang, Tao Li, Yongtang Shi:
Vertex-Critical ( P_5 P 5 , banner)-Free Graphs. FAW 2019: 111-120 - Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang:
A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem. FAW 2019: 14-25 - Yukun Cheng, Xiaotie Deng, Mengqian Zhang:
A Novel Business Model for Electric Car Sharing. FAW 2019: 76-87 - Qilong Feng, Zhen Zhang, Feng Shi, Jianxin Wang:
An Improved Approximation Algorithm for the k-Means Problem with Penalties. FAW 2019: 170-181 - Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson:
Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases. FAW 2019: 156-169 - Zhihao Jiang, Haoyu Zhao:
An FPTAS for Stochastic Unbounded Min-Knapsack Problem. FAW 2019: 121-132 - Wenxing Lai:
The Inapproximability of k-DominatingSet for Parameterized \mathsf AC0 AC 0 Circuits. FAW 2019: 133-143 - Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang, Ro-Yu Wu:
Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes. FAW 2019: 88-99 - Kazumasa Shinagawa, Takaaki Mizuki:
Secure Computation of Any Boolean Function Based on Any Deck of Cards. FAW 2019: 63-75 - Xiang Yan, Wei Zhu:
A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange. FAW 2019: 1-13 - Jie You, Yixin Cao, Jianxin Wang:
Local Coloring: New Observations and New Reductions. FAW 2019: 51-62 - Yijia Chen, Xiaotie Deng, Mei Lu:
Frontiers in Algorithmics - 13th International Workshop, FAW 2019, Sanya, China, April 29 - May 3, 2019, Proceedings. Lecture Notes in Computer Science 11458, Springer 2019, ISBN 978-3-030-18125-3 [contents]
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-08-06 01:25 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