Остановите войну!
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 55 matches
- 1992
- Pankaj K. Agarwal, Jirí Matousek:
Relative Neighborhood Graphs in Three Dimensions. SODA 1992: 58-65 - Pankaj K. Agarwal, Micha Sharir, Sivan Toledo:
Applications of Parametric Searching in Geometric Optimization. SODA 1992: 72-82 - Eran Aharonson, Hagit Attiya:
Counting Networks with Arbitrary Fan-Out. SODA 1992: 104-113 - Susanne Albers, Torben Hagerup:
Improved Parallel Integer Sorting Without Concurrent Writing. SODA 1992: 463-472 - Noga Alon, Yossi Azar:
Comparison-Sorting and Selecting in Totally Monotone Matrices. SODA 1992: 403-408 - Nina Amenta:
Finding a Line Transversal of Axial Objects in Three Dimensions. SODA 1992: 66-71 - Amihood Amir, Gary Benson:
Two-Dimensional Periodicity and Its Applications. SODA 1992: 440-452 - Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri:
Optimal Link Path Queries in a Simple Polygon. SODA 1992: 269-279 - Yossi Azar, Joseph Naor, Raphael Rom:
The Competitiveness of On-Line Assignments. SODA 1992: 203-210 - László Babai:
Deciding Finiteness of Matrix Groups in Las Vegas Polynomial Time. SODA 1992: 33-40 - Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan:
On-Line Navigation in a Room. SODA 1992: 237-249 - Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn:
Dynamic Point Location in General Subdivisions. SODA 1992: 250-258 - Piotr Berman, Viswanathan Ramaiyer:
Improved Approximations for the Steiner Tree Problem. SODA 1992: 325-334 - Svante Carlsson, Jingsen Chen:
The Complexity of Heaps. SODA 1992: 393-402 - Joseph Cheriyan, John H. Reif:
Directed s-t Bumberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. SODA 1992: 335-344 - Marek Chrobak, Lawrence L. Larmore:
Generosity Helps, or an 11-Competitive Algorithm for Three Servers. SODA 1992: 196-202 - Aditi Dhagat, Péter Gács, Peter Winkler:
On Playing "Twenty Questions" with a Liar. SODA 1992: 16-22 - David Eppstein:
Approximating the Minimum Weight Triangulation. SODA 1992: 48-57 - David Eppstein:
New Algorithms for Minimum Area k-gons. SODA 1992: 83-88 - Martin Fürer, Balaji Raghavachari:
Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree. SODA 1992: 317-324 - Michel X. Goemans, David P. Williamson:
A General Approximation Technique for Constrained Forest Problems. SODA 1992: 307-316 - Teofilo F. Gonzalez:
The On-Line d-Dimensional Dictionary Problem. SODA 1992: 376-385 - Martin Grötschel:
Theoretical and Practical Aspects of Combinatorial Problem Solving. SODA 1992: 195 - Leonidas J. Guibas, Rajeev Motwani, Prabhakar Raghavan:
The Robot Localization Problem in Two Dimensions. SODA 1992: 259-268 - Dan Gusfield, K. Balasubramanian, Dalit Naor:
Parametric Optimization of Sequence Alignment. SODA 1992: 432-439 - Magnús M. Halldórsson, Mario Szegedy:
Lower Bounds for On-Line Graph Coloring. SODA 1992: 211-216 - Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan:
Computing Minimal Spanning Subgraphs in Linear Time. SODA 1992: 146-156 - Jianxiu Hao, James B. Orlin:
A Faster Algorithm for Finding the Minimum Cut in a Graph. SODA 1992: 165-174 - Lucas Chi Kwong Hui, Charles U. Martel:
On Efficient Unsuccessful Search. SODA 1992: 217-227 - Sandy Irani, Anna R. Karlin, Steven J. Phillips:
Strongly Competitive Algorithms for Paging with Locality of Reference. SODA 1992: 228-236
skipping 25 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-06-03 21:56 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