default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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
- 2025
- Michael C. Chavrimootoo
:
Defying gravity and gadget numerosity: The complexity of the Hanano Puzzle and beyond. Inf. Process. Lett. 187: 106520 (2025) - Jie Chen, Yi-Ping Liang, Cai-Xia Wang, Shou-Jun Xu:
Algorithmic aspects of {P}-isolation in graphs and extremal graphs for a {P3}-isolation bound. Inf. Process. Lett. 187: 106521 (2025) - Michael B. Dillencourt, Michael T. Goodrich, Michael Mitzenmacher:
Leveraging parameterized Chernoff bounds for simplified algorithm analyses. Inf. Process. Lett. 187: 106516 (2025) - Laurent Doyen:
Top-down complementation of automata on finite trees. Inf. Process. Lett. 187: 106499 (2025) - Tsuri Farhana, Matthew J. Katz:
Spanners under the Hausdorff and Fréchet distances. Inf. Process. Lett. 187: 106513 (2025) - Amir Hossein Ghodrati, Mohammad Ali Hosseinzadeh:
Lower and upper bounds on graph communicabilities. Inf. Process. Lett. 187: 106501 (2025) - Katharina T. Huber, Leo van Iersel, Vincent Moulton, Guillaume E. Scholz:
Is this network proper forest-based? Inf. Process. Lett. 187: 106500 (2025) - Fuki Ito:
Optimal randomized algorithms of weakly-balanced multi-branching AND-OR trees. Inf. Process. Lett. 187: 106512 (2025) - Ting Lan, Huazhong Lü:
Hamiltonian cycles of balanced hypercube with disjoint faulty edges. Inf. Process. Lett. 187: 106518 (2025) - Jing-You Lin, Shi-Chun Tsai:
A note on the k-restriction problem. Inf. Process. Lett. 187: 106515 (2025) - Théodore Lopez, Benjamin Monmege, Jean-Marc Talbot:
Regular D-length: A tool for improved prefix-stable forward Ramsey factorisations. Inf. Process. Lett. 187: 106497 (2025) - Pasin Manurangsi:
Improved lower bound for differentially private facility location. Inf. Process. Lett. 187: 106502 (2025) - Pawan K. Mishra, S. V. Rao, Gautam K. Das:
Dispersion problem on a convex polygon. Inf. Process. Lett. 187: 106498 (2025) - Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza:
On conflict-free cuts: Algorithms and complexity. Inf. Process. Lett. 187: 106503 (2025) - Warut Suksompong:
Weighted fair division of indivisible items: A review. Inf. Process. Lett. 187: 106519 (2025) - Lixing Tan, Zhaohui Zhu, Jinjin Zhang:
Reduced meet over labelling-based semantics in abstract argumentation. Inf. Process. Lett. 187: 106514 (2025) - Bhisham Dev Verma, Punit Pankaj Dubey, Rameshwar Pratap, Manoj Thakur:
Improving compressed matrix multiplication using control variate method. Inf. Process. Lett. 187: 106517 (2025)
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-12-03 06:05 CET 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
