Остановите войну!
for scientists:
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 46 matches
- 1995
- Susanne Albers, Hisashi Koga:
Page Migration with Limited Local Memory Capacity. WADS 1995: 147-158 - Arne Andersson, Kurt Swanson:
On the Difficulty of Range Searching. WADS 1995: 473-481 - Fred S. Annexstein, Eugene A. Kuchko:
A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs. WADS 1995: 263-269 - Lars Arge:
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract). WADS 1995: 334-345 - Chris Armen, Clifford Stein:
Improved Length Bounds for the Shortest Superstring Problem (Extended Abstract). WADS 1995: 494-505 - Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo:
Competitive Algorithms for the On-line Traveling Salesman. WADS 1995: 206-217 - Vineet Bafna, Babu O. Narayanan, R. Ravi:
Non-Overlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles). WADS 1995: 506-517 - Piotr Berman, Toshihiro Fujito:
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs. WADS 1995: 449-460 - Gianfranco Bilardi, Franco P. Preparata:
Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. WADS 1995: 1-12 - Joan Boyar, Rolf Fagerberg, Kim S. Larsen:
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. WADS 1995: 270-281 - Gerth Stølting Brodal:
Fast Meldable Priority Queues. WADS 1995: 282-290 - Paul B. Callahan, Michael T. Goodrich, Kumar Ramaiyer:
Topology B-Trees and Their Applications. WADS 1995: 381-392 - Svante Carlsson, Håkan Jonsson:
Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time. WADS 1995: 122-134 - Kevin Cattell, Michael J. Dinneen, Michael R. Fellows:
Obstructions to Within a Few Vertices or Edges of Acyclic. WADS 1995: 415-427 - Yi-Jen Chiang:
Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep. WADS 1995: 346-357 - Derek G. Corneil, Stephan Olariu, Lorna Stewart:
Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time. WADS 1995: 358-368 - Gautam Das, Michael T. Goodrich:
On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version). WADS 1995: 74-85 - Hristo N. Djidjev:
A Linear Algorithm for the Maximal Planar Subgraph Problem. WADS 1995: 369-380 - Vladimir Estivill-Castro, Jorge Urrutia:
Two-Floodlight Illumination of Convex Polygons. WADS 1995: 62-73 - Faith E. Fich, Peter Bro Miltersen:
Tables Should Be Sorted (On Random Access Machines). WADS 1995: 482-493 - Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum:
Dynamic Algorithms for the Dyck Languages. WADS 1995: 98-108 - Alex Glozman, Klara Kedem, Gregory Shpitalnik:
On Some Geometric Selection and Optimization Problems via Sorted Matrices. WADS 1995: 26-37 - Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter:
Online Perfect Matching and Mobile Computing. WADS 1995: 194-205 - Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo:
Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC-Machining. WADS 1995: 171-182 - Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar:
Faster Enumeration of All Spanning Trees of a Directed Graph. WADS 1995: 428-439 - Ron Holzman, Yosi Marcus, David Peleg:
Load Balancing in Quorum Systems (Extended Abstract). WADS 1995: 38-49 - Sandy Irani, Steven S. Seiden:
Randomized Algorithms for Metrical Task Systems. WADS 1995: 159-170 - Jerzy W. Jaromczyk, Miroslaw Kowaluk:
The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure. WADS 1995: 13-25 - Dimitrios Kagaris, Spyros Tragoudas, Grammati E. Pantziou, Christos D. Zaroliagis:
On the Computation of Fast Data Transmissions in Networks with Capacities and Delays. WADS 1995: 291-302 - Damon Kaller, Arvind Gupta, Thomas C. Shermer:
Regular-Factors In The Complements Of Partial k-Trees. WADS 1995: 403-414
skipping 16 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-05-26 11:48 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