Остановите войну!
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 23 matches
- 1993
- Pankaj K. Agarwal, Alon Efrat, Micha Sharir, Sivan Toledo:
Computing a Segment Center for a Planar Point Set. J. Algorithms 15(2): 314-323 (1993) - Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars:
Intersection Queries in Curved Objects. J. Algorithms 15(2): 229-266 (1993) - Ingo Althöfer:
A Parallel Game Tree Search Algorithm with a Linear Speedup. J. Algorithms 15(2): 175-198 (1993) - Eric Bach, James R. Driscoll, Jeffrey O. Shallit:
Factor Refinement. J. Algorithms 15(2): 199-222 (1993) - Judit Bar-Ilan, Guy Kortsarz, David Peleg:
How to Allocate Network Centers. J. Algorithms 15(3): 385-415 (1993) - Hans L. Bodlaender, Ton Kloks:
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. J. Algorithms 15(1): 160-172 (1993) - Heather Booth, Robert Endre Tarjan:
Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network. J. Algorithms 15(3): 416-446 (1993) - János Csirik:
The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm. J. Algorithms 15(1): 1-28 (1993) - Elias Dahlhaus, Péter Hajnal, Marek Karpinski:
On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs. J. Algorithms 15(3): 367-384 (1993) - David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung:
Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 15(1): 173 (1993) - Michael Formann, Dorothea Wagner, Frank Wagner:
Routing through a Dense Channel with Minimum Total Wire Length. J. Algorithms 15(2): 267-283 (1993) - Greg N. Frederickson, D. J. Guan:
Nonpreemptive Ensemble Motion Planning on a Tree. J. Algorithms 15(1): 29-60 (1993) - David Hartvigsen:
Minimum Path Bases. J. Algorithms 15(1): 125-142 (1993) - Xin He:
Parallel Algorithm for Cograph Recognition with Applications. J. Algorithms 15(2): 284-313 (1993) - Lucas Chi Kwong Hui, Charles U. Martel:
Unsuccessful Search in Self-Adjusting Data Structures. J. Algorithms 15(3): 447-481 (1993) - Jim Joichi, Dennis Stanton:
An Algorithmic Involution for p(n). J. Algorithms 15(2): 223-228 (1993) - Yasunori Koda, Frank Ruskey:
A Gray Code for the Ideals of a Forest Poset. J. Algorithms 15(2): 324-340 (1993) - Joan M. Lucas, Dominique Roelants van Baronaigien, Frank Ruskey:
On Rotations and the Generation of Binary Trees. J. Algorithms 15(3): 343-366 (1993) - Bojan Mohar:
Projective Planarity in Linear Time. J. Algorithms 15(3): 482-502 (1993) - Shietung Peng, A. B. Stephens, Yelena Yesha:
Algorithms for a Core and k-Tree Core of a Tree. J. Algorithms 15(1): 143-159 (1993) - Bjorn Poonen:
The Worst Case in Shellsort and Related Algorithms. J. Algorithms 15(1): 101-124 (1993) - Russel Schaffer, Robert Sedgewick:
The Analysis of Heapsort. J. Algorithms 15(1): 76-100 (1993) - Carsten Thomassen:
The Even Cycle Problem for Planar Digraphs. J. Algorithms 15(1): 61-75 (1993)
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-04-25 13:22 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