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 17 matches
- 2023
- Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh:
Parameterized algorithms for finding highly connected solution. Theor. Comput. Sci. 942: 47-56 (2023) - Abdullah Almethen, Othon Michail, Igor Potapov:
Distributed transformations of Hamiltonian shapes based on line moves. Theor. Comput. Sci. 942: 142-168 (2023) - Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, Sébastien Tixeuil:
Optimal self-stabilizing mobile byzantine-tolerant regular register with bounded timestamps. Theor. Comput. Sci. 942: 123-141 (2023) - Jinmian Chen, Yukun Cheng, Zhiqi Xu, Yan Cao:
Decision on block size in blockchain systems by evolutionary equilibrium analysis. Theor. Comput. Sci. 942: 93-106 (2023) - Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
Arbitrary pattern formation on infinite regular tessellation graphs. Theor. Comput. Sci. 942: 1-20 (2023) - Ioannis Z. Emiris, Vasilis Margonis, Ioannis Psarros:
Near-neighbor preserving dimension reduction via coverings for doubling subsets of ℓ1. Theor. Comput. Sci. 942: 169-179 (2023) - Leah Epstein:
Several methods of analysis for cardinality constrained bin packing. Theor. Comput. Sci. 942: 213-229 (2023) - Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik:
Polymer dynamics via cliques: New conditions for approximations. Theor. Comput. Sci. 942: 230-252 (2023) - Juha Kärkkäinen, Marcin Piatkowski, Simon J. Puglisi:
String inference from longest-common-prefix array. Theor. Comput. Sci. 942: 180-199 (2023) - Matthias Lanzinger:
Tractability beyond β-acyclicity for conjunctive queries with negation and SAT. Theor. Comput. Sci. 942: 276-296 (2023) - Xiaoqing Liu, Shuming Zhou, Eddie Cheng, Hong Zhang:
Reliability analysis of the generalized balanced hypercube. Theor. Comput. Sci. 942: 297-311 (2023) - Louis Penet de Monterno, Bernadette Charron-Bost, Stephan Merz:
Synchronization modulo P in dynamic networks. Theor. Comput. Sci. 942: 200-212 (2023) - Naoto Ohsaka:
On reconfigurability of target sets. Theor. Comput. Sci. 942: 253-275 (2023) - Zhiyong Pan, Baolei Cheng, Jianxi Fan, Yan Wang, Xiajing Li:
A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks. Theor. Comput. Sci. 942: 33-46 (2023) - Raveena, Krishnendra Shekhawat:
A theory of L-shaped floor-plans. Theor. Comput. Sci. 942: 57-92 (2023) - Santiago Valdés Ravelo, Cristina G. Fernandes:
Complexity and approximability of Minimum Path-Collection Exact Covers. Theor. Comput. Sci. 942: 21-32 (2023) - Zhen Zhang, Qilong Feng, Junyu Huang, Jianxin Wang:
Improved approximation algorithms for solving the squared metric k-facility location problem. Theor. Comput. Sci. 942: 107-122 (2023)
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-09-27 23:35 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