Остановите войну!
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 27 matches
- 1997
- Sergio De Agostino, Rossella Petreschi, Andrea Sterbini:
An O(n³) Recognition Algorithm for Bithreshold Graphs. Algorithmica 17(4): 416-425 (1997) - Noga Alon, Aravind Srinivasan:
Improved Parallel Approximation of a Class of Integer Programming Problems. Algorithmica 17(4): 449-462 (1997) - Noga Alon, Raphael Yuster, Uri Zwick:
Finding and Counting Given Length Cycles. Algorithmica 17(3): 209-223 (1997) - Laurent Alonso, Jean-Luc Rémy, René Schott:
A Linear-Time Algorithm for the Generation of Trees. Algorithmica 17(2): 162-183 (1997) - Sunil Arya, Michiel H. M. Smid:
Efficient Construction of a Bounded-Degree Spanner with Low Weight. Algorithmica 17(1): 33-54 (1997) - Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata, Mariette Yvinec:
Evaluating Signs of Determinants Using Single-Precision Arithmetic. Algorithmica 17(2): 111-132 (1997) - Jørgen Bang-Jensen, Mohamed El Haddad, Yannis Manoussakis, Teresa M. Przytycka:
Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs. Algorithmica 17(1): 67-87 (1997) - Rida A. Bazzi, Gil Neiger:
The Complexity of Almost-Optimal Simultaneous Coordination. Algorithmica 17(3): 308-321 (1997) - Piotr Berman, Bhaskar DasGupta:
Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems. Algorithmica 17(4): 331-356 (1997) - Jay N. Bhuyan, Jitender S. Deogun, Vijay V. Raghavan:
Algorithms for the Boundary Selection Problem. Algorithmica 17(2): 133-161 (1997) - Bernard Chazelle, Leonidas Palios:
Decomposing the Boundary of a Nonconvex Polyhedron. Algorithmica 17(3): 245-265 (1997) - Lin Chen:
Efficient Parallel Recognition of Some Circular Arc Graphs, II. Algorithmica 17(3): 266-280 (1997) - Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey:
Three-Dimensional Graph Drawing. Algorithmica 17(2): 199-208 (1997) - Frank K. H. A. Dehne, Rolf Klein:
"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. Algorithmica 17(1): 19-32 (1997) - Brandon Dixon, Robert Endre Tarjan:
Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time. Algorithmica 17(1): 11-18 (1997) - Frieda Granot, Jadranka Skorin-Kapov, Amir Tamir:
Using Quadratic Programming to Solve High Multiplicity Scheduling Problems on Parallel Machines. Algorithmica 17(2): 100-110 (1997) - Ronald I. Greenberg, Jau-Der Shih:
Minimizing Channel Density with Movable Terminals. Algorithmica 17(2): 89-99 (1997) - Sumanta Guha, Ichiro Suzuki:
Proximity Problems for Points on a Rectilinear Plane with Rectangular Obstacles. Algorithmica 17(3): 281-307 (1997) - Torben Hagerup, Miroslaw Kutylowski:
Fast Integer Merging on the EREW PRAM. Algorithmica 17(1): 55-66 (1997) - Susanne E. Hambrusch, Hung-Yi Tu:
New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction. Algorithmica 17(4): 426-448 (1997) - Yijie Han, Victor Y. Pan, John H. Reif:
Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs. Algorithmica 17(4): 399-415 (1997) - Michael Kaufmann, Jop F. Sibeyn:
Randomized Multipacket Routing and Sorting on Meshes. Algorithmica 17(3): 224-244 (1997) - Kurt Mehlhorn, R. Sundar, Christian Uhrig:
Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time. Algorithmica 17(2): 183-198 (1997) - Marco Pellegrini:
On Counting Pairs of Intersecting Segments and Off-Line Triangle Range Searching. Algorithmica 17(4): 380-398 (1997) - Elon Rimon:
Construction of C-Space Roadmaps from Local Sensory Data. What Should the Sensors Look For? Algorithmica 17(4): 357-379 (1997) - Theodore H. Romer, Louis E. Rosier:
An Algorithm Reminiscent of Euclidean-gcd Computing a Function Related to Pinwheel Scheduling. Algorithmica 17(1): 1-10 (1997) - Rephael Wenger:
Randomized Quickhull. Algorithmica 17(3): 322-329 (1997)
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-07 07:37 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