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 42 matches
- 1991
- Arne Andersson, Tony W. Lai:
Comparison-Efficient And Write-Optimal Searching and Sorting. ISA 1991: 273-282 - Takao Asano:
Dynamic Programming on Intervals. ISA 1991: 199-207 - Tetsuo Asano, Takeshi Tokuyama:
Circuit Partitioning Algorithms: Graph Model versus Geometry Model. ISA 1991: 94-103 - A. Benkouar, Yannis Manoussakis, Vangelis Th. Paschos, Rachid Saad:
On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs. ISA 1991: 190-198 - Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami:
Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time. ISA 1991: 104-115 - Mee Yee Chan, Francis Y. L. Chin, Chung Keung Poon:
Optimal Specified Root Embedding of Full Binary Trees in Faulty Hypercubes. ISA 1991: 241-250 - Ip-Wang Chan, Donald K. Friesen:
Parallel Algorithms for Some Dominance Problems Based on a CREW PRAM. ISA 1991: 375-384 - Kwong-fai Chan, Tak Wah Lam:
An On-Line Algorithm for Navigating in Unknown Terrain. ISA 1991: 127-136 - Krzysztof Diks, Oscar Garrido, Andrzej Lingas:
Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. ISA 1991: 385-395 - Herbert Edelsbrunner:
Optimal Triangulations by Retriangulating. ISA 1991: 150 - Vladimir Estivill-Castro, Murray Sherk:
Competitiveness and Response Time in On-Line Algorithms. ISA 1991: 284-293 - Rudolf Fleischer:
A Tight Lower Bound for the Worst Case of Bottom-Up Heapsort. ISA 1991: 251-262 - Satoshi Fujita, Masafumi Yamashita, Tadashi Ae:
Distributed k-Mutual Exclusion Problem and k-Coteries. ISA 1991: 22-31 - Leonidas J. Guibas:
Combinatorics and Algorithms of Geometric Arrangements. ISA 1991: 218 - Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink:
Approximating Polygons and Subdivisions with Minimum Link Paths. ISA 1991: 151-162 - Susumu Hasegawa, Hiroshi Imai, Koji Hakata:
An Analysis of Randomized Shear Sort on the Mesh Computer. ISA 1991: 219-228 - Jan-Ming Ho:
A Linear Time Optimal Via Assignment Algorithm for Three-Dimensional Channel Routing. ISA 1991: 294-307 - Lih-Hsing Hsu, Jeng-Yan Hwang, Tung-Yang Ho, Chang-Hsiung Tsai:
A Linear Time Algorithm to Recognize the Double Euler Trail for Series-Parallel Networks. ISA 1991: 316-325 - Wen-Lian Hsu, Tze-Heng Ma:
Substitution Decomposition on Chordal Graphs and Applications. ISA 1991: 52-60 - Tsan-sheng Hsu, Vijaya Ramachandran:
On Finding a Smallest Augmentation to Biconnect a Graph. ISA 1991: 326-335 - T. H. Hu, Chuan Yi Tang, Richard C. T. Lee:
An Average Case Analysis of Monien and Speckenmeyer's Mechanical Theorem Proving Algorithm. ISA 1991: 116-126 - Ravi Janardan:
On Maintaining the Width and Diameter of a Planar Point-Set Online. ISA 1991: 137-149 - Michael Kaufmann, Gerhard Klär:
A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs. ISA 1991: 336-348 - H. S. Lee, Ruei-Chuan Chang:
On Hitting Grid Points in a Convex Polygon with Straight Lines. ISA 1991: 176-189 - D. T. Lee, Majid Sarrafzadeh:
Maximum Independent Set of a Permutation Graph in k Tracks. ISA 1991: 2-11 - Hans-Peter Lenhof, Michiel H. M. Smid:
An Optimal Construction Method for Generalized Convex Layers. ISA 1991: 349-363 - Yaw-Ling Lin, Steven Skiena:
Algorithms for Square Roots of Graphs. ISA 1991: 12-21 - Luc Longpré, Sarah Mocas:
Symmetry of Information and One-Way Functions. ISA 1991: 308-315 - Alistair Moffat, Ola Petersson:
Historical Searching and Sorting. ISA 1991: 263-272 - Shin-Ichi Nakano, Takao Nishizeki:
Scheduling File Transfers under Port and Channel Constraints. ISA 1991: 43-51
skipping 12 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-13 13:03 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