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 18 matches
- 2019
- Khaled A. S. Abdel-Ghaffar:
Sets of binary sequences with small total Hamming distances. Inf. Process. Lett. 142: 27-29 (2019) - A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty:
Bottleneck bichromatic full Steiner trees. Inf. Process. Lett. 142: 14-19 (2019) - Hans L. Bodlaender, Tom C. van der Zanden:
On exploring always-connected temporal graphs of small pathwidth. Inf. Process. Lett. 142: 68-71 (2019) - Andreas Brandstädt, Martin Milanic:
A dichotomy for weighted efficient dominating sets with bounded degree vertices. Inf. Process. Lett. 142: 30-34 (2019) - Xuepeng Cai, Elkin Vumar:
The super connectivity of folded crossed cubes. Inf. Process. Lett. 142: 52-56 (2019) - Shlomi Dolev, Anat Eyal, Danny Hendler, Philip Derbeko, Marina Sadetsky:
Upper bounds for multi-level multi-server paging. Inf. Process. Lett. 142: 72-76 (2019) - Michitaka Furuya, Naoki Matsumoto:
A note on domination 3-edge-critical planar graphs. Inf. Process. Lett. 142: 64-67 (2019) - Shang-En Huang, Seth Pettie:
Thorup-Zwick emulators are universally optimal hopsets. Inf. Process. Lett. 142: 9-13 (2019) - Stasys Jukna, Hannes Seiwert:
Greedy can beat pure dynamic programming. Inf. Process. Lett. 142: 90-95 (2019) - Weibo Lin, Mingyu Xiao:
A (3 + ϵ)k-vertex kernel for edge-disjoint triangle packing. Inf. Process. Lett. 142: 20-26 (2019) - Huazhong Lü:
On the conjecture of vertex-transitivity of DCell. Inf. Process. Lett. 142: 80-83 (2019) - Alexey Milovanov:
#P-completeness of counting roots of a sparse polynomial. Inf. Process. Lett. 142: 77-79 (2019) - Guanqun Ni, Feifeng Zheng, Yinfeng Xu:
Competitive analysis of online revenue management with hierarchical resources. Inf. Process. Lett. 142: 41-45 (2019) - Jung-Heum Park, Insung Ihm:
A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph. Inf. Process. Lett. 142: 57-63 (2019) - Eminjan Sabir, Jixiang Meng:
Parallel routing in regular networks with faults. Inf. Process. Lett. 142: 84-89 (2019) - Nikolaj Tatti:
Strongly polynomial efficient approximation scheme for segmentation. Inf. Process. Lett. 142: 1-8 (2019) - Lin Xiao, Kenli Li, Zhiguo Tan, Zhijun Zhang, Bolin Liao, Ke Chen, Long Jin, Shuai Li:
Nonlinear gradient neural network for solving system of linear equations. Inf. Process. Lett. 142: 35-40 (2019) - E. Zhang, Ming Liu, Feifeng Zheng, Yinfeng Xu:
Single machine lot scheduling to minimize the total weighted (discounted) completion time. Inf. Process. Lett. 142: 46-51 (2019)
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-10-09 18: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