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 14 matches
- 2019
- Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon:
Minimum-width annulus with outliers: Circular, square, and rectangular cases. Inf. Process. Lett. 145: 16-23 (2019) - Frank Ban, Kamal Jain, Christos H. Papadimitriou, Christos-Alexandros Psomas, Aviad Rubinstein:
Reductions in PPP. Inf. Process. Lett. 145: 48-52 (2019) - Simon Halfon, Philippe Schnoebelen:
On shuffle products, acyclic automata and piecewise-testable languages. Inf. Process. Lett. 145: 68-73 (2019) - Anupriya Jha, Dinabandhu Pradhan, S. Banerjee:
The secure domination problem in cographs. Inf. Process. Lett. 145: 30-38 (2019) - Naoyuki Kamiyama:
A note on balanced flows in equality networks. Inf. Process. Lett. 145: 74-76 (2019) - Ziwen Liu, Chao Yang:
Hanano Puzzle is NP-hard. Inf. Process. Lett. 145: 6-10 (2019) - John M. Machacek:
Partial words with a unique position starting a square. Inf. Process. Lett. 145: 44-47 (2019) - Pasin Manurangsi:
A note on degree vs gap of Min-Rep Label Cover and improved inapproximability for connectivity problems. Inf. Process. Lett. 145: 24-29 (2019) - Lena Schlipf, Jens M. Schmidt:
Simple computation of st-edge- and st-numberings from ear decompositions. Inf. Process. Lett. 145: 58-63 (2019) - Sebastian Siebertz:
Greedy domination on biclique-free graphs. Inf. Process. Lett. 145: 64-67 (2019) - Dekel Tsur:
The effective entropy of next/previous larger/smaller value queries. Inf. Process. Lett. 145: 39-43 (2019) - Yuxing Yang, Lingling Zhang:
Fault-tolerant-prescribed hamiltonian laceability of balanced hypercubes. Inf. Process. Lett. 145: 11-15 (2019) - Marwa Yusuf, Ahmed El-Mahdy, Erven Rohou:
Towards automatic binary runtime loop de-parallelization using on-stack replacement. Inf. Process. Lett. 145: 53-57 (2019) - Chun Jiang Zhu, Kam-yiu Lam, Joseph Kee-Yin Ng, Jinbo Bi:
On the VC-dimension of unique round-trip shortest path systems. Inf. Process. Lett. 145: 1-5 (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-09-24 12:10 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