Остановите войну!
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 70 matches
- 2003
- Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi:
I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. ESA 2003: 7-18 - Pankaj K. Agarwal, Shankar Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian:
Streaming Geometric Optimization Using Graphics Hardware. ESA 2003: 544-555 - Mansoor Alicherry, Randeep Bhatia:
Line System Design and a Generalized Coloring Problem. ESA 2003: 19-30 - Aaron Archer, Ranjithkumar Rajagopalan, David B. Shmoys:
Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties. ESA 2003: 31-42 - Nikhil Bansal, Avrim Blum, Shuchi Chawla, Kedar Dhamdhere:
Scheduling for Flow-Time with Admission Control. ESA 2003: 43-54 - Reuven Bar-Yehuda, Guy Even, Shimon Shahar:
On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows: Extended Abstract. ESA 2003: 55-66 - Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Semi-clairvoyant Scheduling. ESA 2003: 67-77 - Mark de Berg:
Kinetic Dictionaries: How to Shoot a Moving Target. ESA 2003: 172-183 - Alex R. Berg, Tibor Jordán:
Algorithms for Graph Rigidity and Scene Analysis. ESA 2003: 78-89 - Therese C. Biedl, Erik D. Demaine, Alexander Golynski, Joseph Douglas Horton, Alejandro López-Ortiz, Guillaume Poirier, Claude-Guy Quimper:
Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting. ESA 2003: 90-101 - Liad Blumrosen, Noam Nisan, Ilya Segal:
Multi-player and Multi-round Auctions with Severely Bounded Communication. ESA 2003: 102-113 - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals. ESA 2003: 556-567 - Ulrik Brandes, Marco Gaertler, Dorothea Wagner:
Experiments on Graph Clustering Algorithms. ESA 2003: 568-579 - Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsky, Alexander Zelikovsky:
Network Lifetime and Power Assignment in ad hoc Wireless Networks. ESA 2003: 114-126 - Bernard Chazelle:
Sublinear Computing. ESA 2003: 1 - Zhi-Zhong Chen, Tao Jiang, Guohui Lin, Romeo Rizzi, Jianjun Wen, Dong Xu, Ying Xu:
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. ESA 2003: 580-592 - Otfried Cheong, Xavier Goaoc, Hyeon-Suk Na:
Disjoint Unit Spheres admit at Most Two Line Transversals. ESA 2003: 127-135 - Kai-Min Chung, Hsueh-I Lu:
An Optimal Algorithm for the Maximum-Density Segment Problem. ESA 2003: 136-147 - Graham Cormode, S. Muthukrishnan:
Estimating Dominance Norms of Multiple Data Streams. ESA 2003: 148-160 - Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler:
Smoothed Motion Complexity. ESA 2003: 161-171 - Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc:
Deterministic Rendezvous in Graphs. ESA 2003: 184-195 - Marianne Durand, Philippe Flajolet:
Loglog Counting of Large Cardinalities (Extended Abstract). ESA 2003: 605-617 - Friedrich Eisenbrand:
Fast Integer Programming in Fixed Dimension. ESA 2003: 196-207 - Friedrich Eisenbrand, Stefan Funke, Joachim Reichel, Elmar Schömer:
Packing a Trunk. ESA 2003: 618-629 - Dotan Emanuel, Amos Fiat:
Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs. ESA 2003: 208-220 - Kaspar Fischer, Bernd Gärtner, Martin Kutz:
Fast Smallest-Enclosing-Ball Computation in High Dimensions. ESA 2003: 630-641 - Fedor V. Fomin, Dimitrios M. Thilikos:
Dominating Sets and Local Treewidth. ESA 2003: 221-229 - Stefan Funke, Domagoj Matijevic, Peter Sanders:
Approximating Energy Efficient Paths in Wireless Multi-hop Networks. ESA 2003: 230-241 - Naveen Garg, Rohit Khandekar, Keshav Kunal, Vinayaka Pandit:
Bandwidth Maximization in Multicasting. ESA 2003: 242-253 - Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany:
The Minimum Shift Design Problem: Theory and Practice. ESA 2003: 593-604
skipping 40 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-10 16:17 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