![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.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 24 matches
- 2018
- Ke Chen, Adrian Dumitrescu:
On the Longest Spanning Tree with Neighborhoods. FAW 2018: 15-28 - Wei Yu, Zhaohui Liu, Xiaoguang Bao:
New Approximation Algorithms for the Minimum Cycle Cover Problem. FAW 2018: 81-95 - Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi
, Toshiki Saitoh
, Ryuhei Uehara
, Takeaki Uno, Kunihiro Wasa
:
Exact Algorithms for the Max-Min Dispersion Problem. FAW 2018: 263-272 - Sundar Annamalai
, N. S. Narayanaswamy:
Exact Algorithms for Allocation Problems. FAW 2018: 251-262 - Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman:
Some (in)tractable Parameterizations of Coloring and List-Coloring. FAW 2018: 126-139 - Jou-Ming Chang
, Kung-Jui Pai, Jinn-Shyong Yang, Ro-Yu Wu:
Two Kinds of Generalized 3-Connectivities of Alternating Group Networks. FAW 2018: 3-14 - Xiaotie Deng
, Keyu Zhu:
On Bayesian Epistemology of Myerson Auction. FAW 2018: 183-196 - Qilong Feng, Beilin Zhuo, Guanlan Tan, Neng Huang, Jianxin Wang:
Improved Kernels for Several Problems on Planar Graphs. FAW 2018: 169-180 - Luisa Gargano
, Adele A. Rescigno
, Ugo Vaccaro
:
Low-Weight Superimposed Codes and Their Applications. FAW 2018: 197-211 - Sangram Kishor Jena
, Ramesh K. Jallu
, Gautam K. Das, Subhas C. Nandy:
The Maximum Distance-d Independent Set Problem on Unit Disk Graphs. FAW 2018: 68-80 - Songhua Li, Yinfeng Xu:
Single Vehicle's Package Delivery Strategy with Online Traffic Congestion of Certain Delay Time. FAW 2018: 212-223 - Wenjun Li, Junjie Ye
, Yixin Cao
:
Kernelization for P2-Packing: A Gerrymandering Approach. FAW 2018: 140-153 - Gaoang Liu
, Xiuying Liu:
The Complexity of Weak Consistency. FAW 2018: 224-237 - Tian Liu
, Chaoyi Wang, Wei Xu:
Balanced Random Constraint Satisfaction: Phase Transition and Hardness. FAW 2018: 238-250 - M. R. Rani
, Mohith Jagalmohanan
, R. Subashini
:
Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems. FAW 2018: 154-168 - Koki Takayama, Yusuke Kobayashi:
A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees. FAW 2018: 54-67 - Yuan Tang, Haibin Kan:
Non-orthogonal Homothetic Range Partial-Sum Query on Integer Grids - [Extended Abstract]. FAW 2018: 273-285 - Nitesh Tripathi, Manjish Pal, Minati De
, Gautam K. Das, Subhas C. Nandy:
Guarding Polyhedral Terrain by k-Watchtowers. FAW 2018: 112-125 - S. Vaishali
, M. S. Atulya
, Nidhi Purohit:
Efficient Algorithms for a Graph Partitioning Problem. FAW 2018: 29-42 - Yong Wang, Jeffrey B. Remmel:
A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals. FAW 2018: 286-299 - Biing-Feng Wang, Jhih-Hong Ye, Chih-Yu Li:
On the Minmax Regret Path Center Problem on Trees. FAW 2018: 43-53 - Piotr Wojciechowski, K. Subramani, Matthew D. Williamson:
Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints. FAW 2018: 300-314 - Jie You, Jianxin Wang, Qilong Feng:
Parameterized Algorithms for Minimum Tree Cut/Paste Distance and Minimum Common Integer Partition. FAW 2018: 99-111 - Jianer Chen, Pinyan Lu:
Frontiers in Algorithmics - 12th International Workshop, FAW 2018, Guangzhou, China, May 8-10, 2018, Proceedings. Lecture Notes in Computer Science 10823, Springer 2018, ISBN 978-3-319-78454-0 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.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-01 18:01 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