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 48 matches
- 2008
- Peyman Afshani, Hamed Hatami:
Approximation and inapproximability results for maximum clique of disc graphs in high dimensions. Inf. Process. Lett. 105(3): 83-87 (2008) - Dror Aiger, Klara Kedem:
Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space. Inf. Process. Lett. 105(6): 224-230 (2008) - Angel Alvarez, Sergio Arévalo, Vicent Cholvi, Antonio Fernández, Ernesto Jiménez:
On the interconnection of message passing systems. Inf. Process. Lett. 105(6): 249-254 (2008) - Gabriela Araujo, József Balogh, Ruy Fabila Monroy, Gelasio Salazar, Jorge Urrutia:
A note on harmonic subgraphs in labelled geometric graphs. Inf. Process. Lett. 105(3): 98-102 (2008) - Nattapat Attiratanasunthron, Jittat Fakcharoenphol:
A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs. Inf. Process. Lett. 105(3): 88-92 (2008) - Markus Bläser, Thomas Heynen, Bodo Manthey:
Adding cardinality constraints to integer programs with applications to maximum satisfiability. Inf. Process. Lett. 105(5): 194-198 (2008) - Yuri Breitbart, Hassan Gobjuka:
Characterization of layer-2 unique topologies. Inf. Process. Lett. 105(2): 52-57 (2008) - Tian-Ming Bu, Xiaotie Deng, Qi Qi:
Forward looking Nash equilibrium for keyword auction. Inf. Process. Lett. 105(2): 41-46 (2008) - Sergio Cabello, Panos Giannopoulos, Christian Knauer:
On the parameterized complexity of d-dimensional point set pattern matching. Inf. Process. Lett. 105(2): 73-77 (2008) - Xingjuan Cai, Zhihua Cui, Jianchao Zeng, Ying Tan:
Dispersed particle swarm optimization. Inf. Process. Lett. 105(6): 231-235 (2008) - Stefano Crespi-Reghizzi, Matteo Pradella:
A CKY parser for picture grammars. Inf. Process. Lett. 105(6): 213-217 (2008) - Jana Dietel, Hans-Dietrich Hecker, Andreas Spillner:
A note on optimal floodlight illumination of stages. Inf. Process. Lett. 105(4): 121-123 (2008) - Robert L. Scot Drysdale, Asish Mukhopadhyay:
An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points. Inf. Process. Lett. 105(2): 47-51 (2008) - Pavlos S. Efraimidis:
The complexity of linear programming in (gamma, kappa)-form. Inf. Process. Lett. 105(5): 199-201 (2008) - Graham Farr, Johannes Schmidt:
On the number of Go positions on lattice graphs. Inf. Process. Lett. 105(4): 124-130 (2008) - Guillaume Fertin, André Raspaud:
Acyclic coloring of graphs of maximum degree five: Nine colors are enough. Inf. Process. Lett. 105(2): 65-72 (2008) - Amy Glen, Aaron Lauve, Franco V. Saliola:
A note on the Markoff condition and central words. Inf. Process. Lett. 105(6): 241-244 (2008) - Inge Li Gørtz:
Asymmetric k-center with minimum coverage. Inf. Process. Lett. 105(4): 144-149 (2008) - Szymon Grabowski, Kimmo Fredriksson:
Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time. Inf. Process. Lett. 105(5): 182-187 (2008) - Sushmita Gupta:
Feedback arc set problem in bipartite tournaments. Inf. Process. Lett. 105(4): 150-154 (2008) - Frank Gurski:
Polynomial algorithms for protein similarity search for restricted mRNA structures. Inf. Process. Lett. 105(5): 170-176 (2008) - Chris H. Hamilton, Andrew Rau-Chaplin:
Compact Hilbert indices: Space-filling curves for domains with unequal side lengths. Inf. Process. Lett. 105(5): 155-163 (2008) - Yijie Han:
A note of an O(n3/logn) time algorithm for all pairs shortest paths. Inf. Process. Lett. 105(3): 114-116 (2008) - Sun-Yuan Hsieh, Chih-Sheng Cheng:
Finding a maximum-density path in a tree under the weight and length constraints. Inf. Process. Lett. 105(5): 202-205 (2008) - Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hsing-Yen Ann, Yung-Hsing Peng:
Efficient algorithms for finding interleaving relationship between sequences. Inf. Process. Lett. 105(5): 188-193 (2008) - Costas S. Iliopoulos, Mohammad Sohel Rahman:
Faster index for property matching. Inf. Process. Lett. 105(6): 218-223 (2008) - Sreyash Kenkre, Sundar Vishwanathan:
The common prefix problem on trees. Inf. Process. Lett. 105(6): 245-248 (2008) - Ali Kooshesh, B. Ravikumar:
Efficient implementation of algorithms for approximate exponentiation. Inf. Process. Lett. 105(4): 131-137 (2008) - Ulrich Kühn:
Breaking the Shin-Shin-Rhee remotely keyed encryption schemes. Inf. Process. Lett. 105(6): 236-240 (2008) - Hsin-Hao Lai, Gerard J. Chang, Ko-Wei Lih:
On fully orientability of 2-degenerate graphs. Inf. Process. Lett. 105(5): 177-181 (2008)
skipping 18 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-10-02 04:05 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