Остановите войну!
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 54 matches
- 2016
- Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Masafumi Yamashita:
Autonomous mobile robots with lights. Theor. Comput. Sci. 609: 171-184 (2016) - Takuya Akiba, Yoichi Iwata:
Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover. Theor. Comput. Sci. 609: 211-225 (2016) - Emily Allen, Francine Blanchet-Sadri, Michelle Bodnar, Brian Bowers, Joe Hidakatsu, John Lensmire:
Combinatorics on partial word borders. Theor. Comput. Sci. 609: 469-493 (2016) - Richard Beal, Donald A. Adjeroh:
Compressed parameterized pattern matching. Theor. Comput. Sci. 609: 129-142 (2016) - Marie-Pierre Béal, Michel Blockelet, Catalin Dima:
Sofic-Dyck shifts. Theor. Comput. Sci. 609: 226-244 (2016) - Fabrício Benevides, Victor A. Campos, Mitre Costa Dourado, Rudini Menezes Sampaio, Ana Silva:
The maximum infection time in the geodesic and monophonic convexities. Theor. Comput. Sci. 609: 287-295 (2016) - Suman Kalyan Bera, Syamantak Das, Amit Kumar:
Minimizing average flow-time under knapsack constraint. Theor. Comput. Sci. 609: 516-525 (2016) - Thomas Bläsius, Ignaz Rutter:
A new perspective on clustered planarity as a combinatorial embedding problem. Theor. Comput. Sci. 609: 306-315 (2016) - François Bonnet, Xavier Défago, Thanh Dang Nguyen, Maria Potop-Butucaru:
Tight bound on mobile Byzantine Agreement. Theor. Comput. Sci. 609: 361-373 (2016) - Ljiljana Brankovic, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Solon P. Pissis, Fatima Vayani:
Linear-time superbubble identification algorithm for genome assembly. Theor. Comput. Sci. 609: 374-383 (2016) - Zhipeng Cai, Alexander Zelikovsky:
Special issue on Computing and Combinatorics Conference. Theor. Comput. Sci. 609: 515 (2016) - Christopher Hanrui Chak, Rusins Freivalds, Frank Stephan, Henrietta Tan Wan Yik:
On block pumpable languages. Theor. Comput. Sci. 609: 272-285 (2016) - Fei-Huang Chang, Ma-Lian Chia, David Kuo, Sheng-Chyang Liaw, Jen-Chun Ling:
All-to-all broadcast problems on Cartesian product graphs. Theor. Comput. Sci. 609: 262-271 (2016) - Xie-Bin Chen:
Paired 2-disjoint path covers of faulty k-ary n-cubes. Theor. Comput. Sci. 609: 494-499 (2016) - Xujin Chen, Xiao-Dong Hu, Changjun Wang:
Approximation for the minimum cost doubly resolving set problem. Theor. Comput. Sci. 609: 526-543 (2016) - Kun-Tze Chen, Chi-Long Li, Hsien-Tai Chiu, Chin Lung Lu:
An efficient algorithm for one-sided block ordering problem under block-interchange distance. Theor. Comput. Sci. 609: 296-305 (2016) - Wenbin Chen, Nagiza F. Samatova, Matthias F. Stallmann, William Hendrix, Weiqin Ying:
On size-constrained minimum s-t cut problems and size-constrained dense subgraph problems. Theor. Comput. Sci. 609: 434-442 (2016) - James D. Currie, Narad Rampersad:
Growth rate of binary words avoiding xxxR. Theor. Comput. Sci. 609: 456-468 (2016) - Zhenhua Duan, Cong Tian, Nan Zhang:
A canonical form based decision procedure and model checking approach for propositional projection temporal logic. Theor. Comput. Sci. 609: 544-560 (2016) - Jessica A. Enright, Lorna Stewart:
Games on interval and permutation graph representations. Theor. Comput. Sci. 609: 87-103 (2016) - Qizhi Fang, Bo Li, Xiaoming Sun, Jia Zhang, Jialin Zhang:
Computing the least-core and nucleolus for threshold cardinality matching games. Theor. Comput. Sci. 609: 500-510 (2016) - Ken C. K. Fong, Minming Li, Hongyu Liang, Linji Yang, Hao Yuan:
Average-case complexity of the min-sum matrix product problem. Theor. Comput. Sci. 609: 76-86 (2016) - François Le Gall, Harumichi Nishimura, Seiichiro Tani:
Quantum algorithms for finding constant-sized sub-hypergraphs. Theor. Comput. Sci. 609: 569-582 (2016) - Eric Goles, Pedro Montealegre, Ville Salo, Ilkka Törmä:
PSPACE-completeness of majority automata networks. Theor. Comput. Sci. 609: 118-128 (2016) - Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, Srinivasa Rao Satti, Sunil M. Shende:
Encoding 2D range maximum queries. Theor. Comput. Sci. 609: 316-327 (2016) - Linming Gong, Shundong Li, Qing Mao, Daoshun Wang, Jiawei Dou:
A homomorphic encryption scheme with adaptive chosen ciphertext security but without random oracle. Theor. Comput. Sci. 609: 253-261 (2016) - Luciano N. Grippo, Martín Matamala, Martín Darío Safe, Maya J. Stein:
Convex p-partitions of bipartite graphs. Theor. Comput. Sci. 609: 511-514 (2016) - Ran Gu, Xueliang Li, Zhongmei Qin:
Proper connection number of random graphs. Theor. Comput. Sci. 609: 336-343 (2016) - Xin Han, Kazuhisa Makino:
Online minimization knapsack problem. Theor. Comput. Sci. 609: 185-196 (2016) - Rong-Xia Hao, Mei-Mei Gu, Yan-Quan Feng:
The pessimistic diagnosabilities of some general regular graphs. Theor. Comput. Sci. 609: 413-420 (2016)
skipping 24 more matches
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-04-25 15:00 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