Остановите войну!
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 49 matches
- 2000
- Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda:
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. ISAAC 2000: 204-215 - Jean-Daniel Boissonnat:
Voronoi-Based Systems of Coordinates and Surface Reconstruction. ISAAC 2000: 1 - Prosenjit Bose, Evangelos Kranakis, Danny Krizanc, Miguel Vargas Martin, Jurek Czyzowicz, Andrzej Pelc, Leszek Gasieniec:
Strategies for Hotlink Assignments. ISAAC 2000: 23-34 - Prosenjit Bose, Pat Morin:
An Improved Algorithm for Subdivision Traversal without Extra Storage. ISAAC 2000: 444-455 - Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz:
Online Routing in Convex Subdivisions. ISAAC 2000: 47-59 - Jin-yi Cai:
Essentially Every Unimodular Matrix Defines and Expander. ISAAC 2000: 2-22 - Danny Z. Chen, Xiaobo Hu, Xiaodong Wu:
Optimal Polygon Cover Problems and Applcations. ISAAC 2000: 564-576 - Danny Z. Chen, Xiaobo Hu, Jinhui Xu:
Optimal Beam Penetrations in Two and Three Dimensions. ISAAC 2000: 491-502 - Jianer Chen, Iyad A. Kanj:
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching. ISAAC 2000: 132-143 - Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu:
Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets. ISAAC 2000: 84-95 - Jianer Chen, Lihua Liu, Songqiao Chen, Weijia Jia:
An Intuitive and Effective New Representation for Interconnection Network Structures. ISAAC 2000: 350-361 - Zhixiang Chen, Binhai Zhu:
Some Formal Analysis of Roccio's Similarity-Based Relvance Feedback Algorithm. ISAAC 2000: 108-119 - Ferdinando Cicalese, Ugo Vaccaro:
coping with Delays and Time-Outs in Binary Search Procedures. ISAAC 2000: 96-107 - Xiaotie Deng, Yi Zhou, Guojun Li, Wenan Zang:
A 2-Approximation Algorithm for Path Coloring on Trees of Rings. ISAAC 2000: 144-155 - Thomas Erlebach, Frits C. R. Spieksma:
Simple Algorithms for a Weighted Interval Selection Problem. ISAAC 2000: 228-240 - Wing-Kai Hon, Ming-Yang Kao, Tak Wah Lam:
Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers. ISAAC 2000: 527-538 - Seok-Hee Hong, Peter Eades:
An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs. ISAAC 2000: 266-277 - Takashi Horiyama, Toshihide Ibaraki:
Reasoning with Ordered Binary Decision Diagrams. ISAAC 2000: 120-131 - Jingui Huang, Jianer Chen, Songqiao Chen:
A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors. ISAAC 2000: 60-71 - Toshimasa Ishii, Hiroshi Nagamochi:
Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph. ISAAC 2000: 326-337 - Hiro Ito, Yuichiro Itatsu, Hideyuki Uehara, Mitsuo Yokoyama, Motoyasu Ito:
Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets. ISAAC 2000: 338-349 - Bill Jackson, Tibor Jordán:
A Near Optimal Algorithm for Vertex Connectivity Augmentation. ISAAC 2000: 312-325 - Klaus Jansen, Lorant Porkolab:
Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time. ISAAC 2000: 398-409 - Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison. ISAAC 2000: 479-490 - Masashi Katsura, Yuji Kobayashi, Friedrich Otto:
Undecidability Results for Monoids with Linear-Time Decidable Word Problems. ISAAC 2000: 278-289 - Matthew J. Katz, Frank Nielsen, Michael Segal:
Maintenance of a Percing Set for Intervals with Applications. ISAAC 2000: 552-563 - Deok-Soo Kim, Donguk Kim, Kokichi Sugihara:
Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set. ISAAC 2000: 432-443 - Petter Kristiansen, Jan Arne Telle:
Generalized H-Coloring of Graphs. ISAAC 2000: 456-466 - Norihiro Kubo, Shinichi Shimozono, Katsuhiro Muramoto:
A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane. ISAAC 2000: 216-227 - Ching Law, Charles E. Leiserson:
A New Competitive Analysis of Randomized Caching. ISAAC 2000: 35-46
skipping 19 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-04-25 10:59 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