![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 41 matches
- 2000
- Pankaj K. Agarwal, Eyal Flato, Dan Halperin:
Polygon Decomposition for Efficient Construction of Minkowski Sums. ESA 2000: 20-31 - Alexander A. Ageev, Maxim Sviridenko:
An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts. ESA 2000: 32-41 - Marjan van den Akker, Han Hoogeveen, Nodari Vakhania:
Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine. ESA 2000: 427-436 - Christoph Ambühl:
Offline List Update is NP-Hard. ESA 2000: 42-51 - Christoph Ambühl, Samarjit Chakraborty, Bernd Gärtner:
Computing Largest Common Point Sets under Approximate Congruence. ESA 2000: 52-63 - Matthew Andrews, Kamesh Munagala
:
Online Algorithms for Caching Multimedia Streams. ESA 2000: 64-75 - Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans
, John Michael Robson:
On Recognizing Cayley Graphs. ESA 2000: 76-87 - András A. Benczúr, Ottilia Fülöp:
Fast Algorithms for Even/Odd Minimum Cuts and Generalizations. ESA 2000: 88-99 - Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars:
On R-trees with Low Stabbing Number. ESA 2000: 167-178 - Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal
:
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. ESA 2000: 100-111 - Peter Brass:
Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset. ESA 2000: 112-119 - Adam L. Buchsbaum, Michael T. Goodrich, Jeffery R. Westbrook:
Range Searching Over Tree Cross Products. ESA 2000: 120-131 - Robert D. Carr, Toshihiro Fujito, Goran Konjevod
, Ojas Parekh:
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. ESA 2000: 132-142 - Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri:
The Minimum Range Assignment Problem on Linear Radio Networks. ESA 2000: 143-154 - Artur Czumaj, Christian Sohler, Martin Ziegler:
Property Testing in Computational Geometry. ESA 2000: 155-166 - Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich:
K-D Trees Are Better when Cut on the Longest Side. ESA 2000: 179-190 - Michele Flammini, Gaia Nicosia:
On Multicriteria Online Problems. ESA 2000: 191-201 - Rudolf Fleischer, Michaela Wahl:
Online Scheduling Revisited. ESA 2000: 202-210 - Daya Ram Gaur
, Toshihide Ibaraki, Ramesh Krishnamurti:
Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. ESA 2000: 211-219 - Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Well-Separated Pair Decomposition and Its Applications. ESA 2000: 220-231 - Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld:
Higher Order Delaunay Triangulations. ESA 2000: 232-243 - Venkatesan Guruswami, Madhu Sudan:
On Representations of Algebraic-Geometric Codes for List Decoding. ESA 2000: 244-255 - Monika Henzinger:
Web Information Retrieval - an Algorithmic Perspective. ESA 2000: 1-8 - Dorit S. Hochbaum, Maurice Queyranne:
Minimizing a Convex Cost Closure Set. ESA 2000: 256-267 - Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger:
Preemptive Scheduling with Rejection. ESA 2000: 268-277 - Tsan-sheng Hsu:
Simpler and Faster Vertex-Connectivity Augmentation Algorithms. ESA 2000: 278-289 - Bala Kalyanasundaram, Kirk Pruhs, Mahendran Velauthapillai:
Scheduling Broadcasts in Wireless Networks. ESA 2000: 290-301 - Hisashi Koga:
Jitter Regulation in an Internet Router with Delay Consideration. ESA 2000: 302-313 - Jae-Ha Lee, Otfried Cheong, Woo-Cheol Kwon, Sung Yong Shin, Kyung-Yong Chwa:
Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points. ESA 2000: 314-325 - Thomas Lengauer:
Computational Biology - Algorithms and More. ESA 2000: 9-19
skipping 11 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-20 13: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