Остановите войну!
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 50 matches
- 1998
- Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong:
Casting with Skewed Ejection Direction. ISAAC 1998: 139-148 - Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote:
Generalized Self-Approaching Curves. ISAAC 1998: 317-326 - Tatsuya Akutsu:
Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-Free Languages. ISAAC 1998: 337-346 - Hiroki Arimura, Shinichi Shimozono:
Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words. ISAAC 1998: 39-48 - Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang:
Visibility Queries in Simple Polygons and Applications. ISAAC 1998: 357-366 - Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan:
Facility Location on Terrains. ISAAC 1998: 19-28 - Tetsuo Asano, Hiro Ito, Souichi Kimura, Shigeaki Shimazu:
Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image. ISAAC 1998: 149-158 - Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
Convertibility among Grid Filling Curves. ISAAC 1998: 307-316 - Stefan Bischof, Ernst W. Mayr:
On-Line Scheduling of Parallel Jobs with Runtime Restrictions. ISAAC 1998: 119-128 - Prosenjit Bose, Pat Morin:
Testing the Quality of Manufactured Disks and Cylinders. ISAAC 1998: 129-138 - Ulrik Brandes, Dorothea Wagner:
Dynamic Grid Embedding with Few Bends and Changes. ISAAC 1998: 89-98 - Liming Cai, David W. Juedes, Iyad A. Kanj:
The Inapproximability of Non NP-hard Optimization Problems. ISAAC 1998: 437-446 - Bernard Chazelle:
The Discrepancy Method. ISAAC 1998: 1-3 - Siu-Wing Cheng, Kam-Hing Lee:
Quadtree Decomposition, Steiner Triangulation, and Ray Shooting. ISAAC 1998: 367-376 - Joonsoo Choi, Chan-Su Shin, Sung Kwon Kim:
Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles. ISAAC 1998: 29-38 - Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung:
Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently while Concealing it. ISAAC 1998: 59-68 - Josep Díaz, Jordi Petit, Panagiotis Psycharis, Maria J. Serna:
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution. ISAAC 1998: 457-466 - Walter Didimo, Giuseppe Liotta:
Computing Orthogonal Drawings in a Variable Embedding Setting. ISAAC 1998: 79-88 - Amalia Duch, Vladimir Estivill-Castro, Conrado Martínez:
Randomized K-Dimensional Binary Search Trees. ISAAC 1998: 199-208 - Stephan J. Eidenbenz:
Inapproximability Results for Guarding Polygons without Holes. ISAAC 1998: 427-436 - Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Disjunctions of Horn Theories and Their Cores. ISAAC 1998: 49-58 - Thomas Erlebach, Klaus Jansen:
Maximizing the Number of Connections in Optical Tree Networks. ISAAC 1998: 179-188 - Michael R. Fellows, Michael T. Hallett, Ulrike Stege:
On the Multiple Gene Duplication Problem. ISAAC 1998: 347-356 - Andreas Goerdt:
Random Regular Graphs with Edge Faults: Expansion through Cores. ISAAC 1998: 219-228 - Shin-ya Hamaguchi, Naoki Katoh:
A Capacitated Vehicle Routing Problem on a Tree. ISAAC 1998: 397-406 - Seok-Hee Hong, Peter Eades, Sang Ho Lee:
Finding Planar Geometric Automorphisms in Planar Graphs. ISAAC 1998: 277-286 - Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen:
Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs. ISAAC 1998: 257-266 - Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. ISAAC 1998: 159-168 - Philip N. Klein, Hsueh-I Lu:
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs. ISAAC 1998: 387-396 - Tak Wah Lam, Hing-Fung Ting:
Selecting the k Largest Elements with Parity Tests. ISAAC 1998: 189-198
skipping 20 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-20 20:06 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