![](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 11 matches
- 2021
- Garima Agrawal, Soumen Maity:
The Small Set Vertex Expansion Problem. Theor. Comput. Sci. 886: 84-93 (2021) - Bapi Chatterjee
, Ivan Walulya, Philippas Tsigas
:
Concurrent linearizable nearest neighbour search in LockFree-kD-tree. Theor. Comput. Sci. 886: 27-48 (2021) - Hua Chen, Lin Chen, Guochuan Zhang
, Vincent Chau:
Scheduling with variable-length calibrations: Two agreeable variants. Theor. Comput. Sci. 886: 94-105 (2021) - Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Giuliano Losa:
The assignment problem. Theor. Comput. Sci. 886: 13-26 (2021) - Yunyun Deng, Longkun Guo, Kewen Liao
, Yi Chen:
On finding maximum disjoint paths with different colors: Computational complexity and practical LP-based algorithms. Theor. Comput. Sci. 886: 157-168 (2021) - Xiaozhou He
, Wenfeng Lai, Binhai Zhu, Peng Zou:
Dispersing and grouping points on planar segments. Theor. Comput. Sci. 886: 169-177 (2021) - Damien Imbs, Achour Mostéfaoui, Matthieu Perrin
, Michel Raynal:
Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects. Theor. Comput. Sci. 886: 49-68 (2021) - Timothée Martinod, Valentin Pollet, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König:
Complexity and inapproximability results for balanced connected subgraph problem. Theor. Comput. Sci. 886: 69-83 (2021) - Vipin Singh Sehrawat
, Foo Yee Yeo, Yvo Desmedt:
Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification. Theor. Comput. Sci. 886: 106-138 (2021) - Feng Shi, Jie You, Zhen Zhang, Jingyi Liu, Jianxin Wang:
Fixed-parameter tractability for the Tree Assembly problem. Theor. Comput. Sci. 886: 3-12 (2021) - Boting Yang, Tanzina Akter:
One-visibility cops and robber on trees. Theor. Comput. Sci. 886: 139-156 (2021)
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-07-10 16:31 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