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 259 matches
- 2009
- Mohamed Abdo:
Efficient generation of the ideals of a poset in Gray code order. Inf. Process. Lett. 109(13): 687-689 (2009) - Manuel Abellanas, António Leslie Bajuelos, Inês Matos:
2-Covered paths by a set of antennas with minimum power transmission range. Inf. Process. Lett. 109(14): 768-773 (2009) - Manuel Abellanas, Santiago Canales, Gregorio Hernández-Peñalver:
An "Art Gallery Theorem" for pyramids. Inf. Process. Lett. 109(13): 719-721 (2009) - Shimon Abravaya, Daniel Berend:
Multi-dimensional dynamic facility location and fast computation at query points. Inf. Process. Lett. 109(8): 386-390 (2009) - A. Karim Abu-Affash, Matthew J. Katz:
Improved bounds on the average distance to the Fermat-Weber center of a convex object. Inf. Process. Lett. 109(6): 329-333 (2009) - Woo Hyun Ahn, Kyungjae Lee, Jaewon Oh, Kyungsub Min, Joon Sung Hong:
A multiple-file write scheme for improving write performance of small files in Fast File System. Inf. Process. Lett. 109(18): 1021-1026 (2009) - Dror Aiger, Klara Kedem:
Geometric pattern matching for point sets in the plane under similarity transformations. Inf. Process. Lett. 109(16): 935-940 (2009) - Elvira Albert, John P. Gallagher, Miguel Gómez-Zamalloa, Germán Puebla:
Type-based homeomorphic embedding for online termination. Inf. Process. Lett. 109(15): 879-886 (2009) - Brian Alspach, Matthew Dean:
Honeycomb toroidal graphs are Cayley graphs. Inf. Process. Lett. 109(13): 705-708 (2009) - Amihood Amir, Gonzalo Navarro:
Parameterized matching on non-linear structures. Inf. Process. Lett. 109(15): 864-867 (2009) - Daniel Andersson:
Hashiwokakero is NP-complete. Inf. Process. Lett. 109(19): 1145-1146 (2009) - Panagiotis Antonellis, Christos Makris, Nikos Tsirakis:
Algorithms for clustering clickstream data. Inf. Process. Lett. 109(8): 381-385 (2009) - Mustapha Arfi, Bedine Ould M. Lemine, Carla Selmi:
Strategical languages of infinite words. Inf. Process. Lett. 109(13): 749-753 (2009) - Esther M. Arkin, Sang Won Bae, Alon Efrat, Kazuya Okamoto, Joseph S. B. Mitchell, Valentin Polishchuk:
Geometric stable roommates. Inf. Process. Lett. 109(4): 219-224 (2009) - Satyajit Banerjee, Atish Datta Chowdhury, Subhas Kumar Ghosh:
Distributed approximation for maximum weight matching on bounded degree bounded integer weight graphs. Inf. Process. Lett. 109(14): 790-794 (2009) - Bernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo:
On the intrinsic complexity of point finding in real singular hypersurfaces. Inf. Process. Lett. 109(19): 1141-1144 (2009) - Mukul S. Bansal, David Fernández-Baca:
Computing distances between partial rankings. Inf. Process. Lett. 109(4): 238-241 (2009) - Jean-Luc Baril:
More restrictive Gray codes for some classes of pattern avoiding permutations. Inf. Process. Lett. 109(14): 799-804 (2009) - Joanna Bauer, Dag Haugland, Di Yuan:
New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm. Inf. Process. Lett. 109(12): 615-619 (2009) - Kristóf Bérczi, Satoru Fujishige, Naoyuki Kamiyama:
A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph. Inf. Process. Lett. 109(23-24): 1227-1231 (2009) - Gilles Bertrand, Michel Couprie, Nicolas Passat:
A note on 3-D simple points and simple-equivalence. Inf. Process. Lett. 109(13): 700-704 (2009) - Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The complexity of propositional implication. Inf. Process. Lett. 109(18): 1071-1077 (2009) - Zhengbing Bian, Qian-Ping Gu:
1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings. Inf. Process. Lett. 109(8): 400-404 (2009) - Etienne Birmelé, François Delbot, Christian Laforest:
Mean analysis of an online algorithm for the vertex cover problem. Inf. Process. Lett. 109(9): 436-439 (2009) - Steven Bitner, Ovidiu Daescu:
Farthest segments and extremal triangles spanned by points in R3. Inf. Process. Lett. 109(20): 1167-1171 (2009) - Markus Bläser, Moritz Hardt, Richard J. Lipton, Nisheeth K. Vishnoi:
Deterministically testing sparse polynomial identities of unbounded degree. Inf. Process. Lett. 109(3): 187-192 (2009) - Manuel Bodirsky, Gustav Nordh, Timo von Oertzen:
Integer programming with 2-variable equations and 1-variable inequalities. Inf. Process. Lett. 109(11): 572-575 (2009) - Beate Bollig:
On the size of (generalized) OBDDs for threshold functions. Inf. Process. Lett. 109(10): 499-503 (2009) - Tommaso Bolognesi:
A pseudo-random network mobile automaton with linear growth. Inf. Process. Lett. 109(13): 668-674 (2009) - Miklós Bóna, Ryan Flynn:
The average number of block interchanges needed to sort a permutation and a recent result of Stanley. Inf. Process. Lett. 109(16): 927-931 (2009)
skipping 229 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-09-26 03:41 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