![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 21 matches
- 1999
- Anurag Acharya, Huican Zhu, Kai Shen:
Adaptive Algorithms for Cache-Efficient Trie Search. ALENEX 1999: 296-311 - Lars Arge, Klaus H. Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter:
Efficient Bulk Operations on Dynamic R-trees. ALENEX 1999: 328-348 - Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov:
Design and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning. ALENEX 1999: 177-193 - János Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber:
A Self Organizing Bin Packing Heuristic. ALENEX 1999: 246-265 - Sebastian Cwilich, Mei Deng, David F. Lynch, S. J. Philips, Jeffery R. Westbrook:
Algorithms for Restoration Planning in a Telecommunications Network. ALENEX 1999: 194-209 - Michael T. Goodrich, Mark Handy, Benoît Hudson, Roberto Tamassia:
Accessing the Internal Organization of Data Structures in the JDSL Library. ALENEX 1999: 124-139 - Gregory L. Heileman, Carlos E. Pizano, Chaouki T. Abdallah:
Image Watermarking for Copyright Protection. ALENEX 1999: 226-245 - David R. Helman, Joseph F. JáJá:
Designing Practical Efficient Algorithms for Symmetric Multiprocessors. ALENEX 1999: 37-56 - Matthew S. Levine:
Finding the Right Cutting Planes for the TSP. ALENEX 1999: 266-281 - Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes. ALENEX 1999: 1-17 - David M. Mount, Fan-Tao Pu:
Binary Space Partitions in Plücker Space. ALENEX 1999: 94-113 - Matthias Müller-Hannemann
, Alexander Schwartz:
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. ALENEX 1999: 18-36 - Maurizio Pizzonia, Giuseppe Di Battista:
Object-Oriented Design of Graph Oriented Data Structures. ALENEX 1999: 140-155 - Peter Sanders:
Fast Priority Queues for Cached Memory. ALENEX 1999: 312-327 - Stefan Schirra:
A Case Study on the Cost of Geometric Computing. ALENEX 1999: 156-176 - Tetsuo Shibuya:
Computing the n × m Shortest Paths Efficently. ALENEX 1999: 210-225 - Janet M. Six, Ioannis G. Tollis:
Circular Drawings of Biconnected Graphs. ALENEX 1999: 57-73 - Matthias F. M. Stallmann
, Franc Brglez, Debabrata Ghosh:
Heuristics and Experimental Design for Bigraph Crossing Number Minimization. ALENEX 1999: 74-93 - Robert J. Walker, Jack Snoeyink:
Practical Point-in-Polygon Tests Using CSG Representations of Polygons. ALENEX 1999: 114-123 - Martin Zachariasen, Pawel Winter:
Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm. ALENEX 1999: 282-295 - Michael T. Goodrich
, Catherine C. McGeoch:
Algorithm Engineering and Experimentation, International Workshop ALENEX '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers. Lecture Notes in Computer Science 1619, Springer 1999, ISBN 3-540-66227-8 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-06-25 08:50 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