Остановите войну!
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
- 2009
- Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid:
Geometric Spanners for Weighted Point Sets. ESA 2009: 190-202 - Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg:
On Inducing Polygons and Related Problems. ESA 2009: 47-58 - Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi:
Breaking the O(m2n) Barrier for Minimum Cycle Bases. ESA 2009: 301-312 - Elliot Anshelevich, Bugra Çaskurlu:
Exact and Approximate Equilibria for Optimal Group Network Formation. ESA 2009: 239-250 - Martin Aumüller, Martin Dietzfelbinger, Michael Rink:
Experimental Variations of a Theoretically Good Retrieval Data Structure. ESA 2009: 742-751 - Chen Avin, Zvi Lotker, Yvonne-Anne Pignolet:
On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources. ESA 2009: 373-384 - Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, C. Thach Nguyen:
On Revenue Maximization in Second-Price Ad Auctions. ESA 2009: 155-166 - Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhang, Jiajie Zhu:
Bounded Budget Betweenness Centrality Game for Strategic Network Formations. ESA 2009: 227-238 - Djamal Belazzougui, Fabiano C. Botelho, Martin Dietzfelbinger:
Hash, Displace, and Compress. ESA 2009: 682-693 - Therese C. Biedl, Burkay Genç:
Cauchy's Theorem for Orthogonal Polyhedra of Genus 0. ESA 2009: 71-82 - Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Counting Paths and Packings in Halves. ESA 2009: 578-586 - Markus Bläser, Christian Hoffmann:
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth. ESA 2009: 623-634 - Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo:
Kernel Bounds for Disjoint Cycles and Disjoint Paths. ESA 2009: 635-646 - Kevin Buchin:
Constructing Delaunay Triangulations along Space-Filling Curves. ESA 2009: 119-130 - Manuel Caroli, Monique Teillaud:
Computing 3D Periodic Triangulations. ESA 2009: 59-70 - Jakub Chaloupka:
Parallel Algorithms for Mean-Payoff Games: An Experimental Evaluation. ESA 2009: 599-610 - Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff:
Improved Approximation Algorithms for Label Cover Problems. ESA 2009: 23-34 - Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. ESA 2009: 444-455 - George Christodoulou, Elias Koutsoupias, Paul G. Spirakis:
On the Performance of Approximate Equilibria in Congestion Games. ESA 2009: 251-262 - Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc:
Optimality and Competitiveness of Exploring Polygons by Mobile Robots. ESA 2009: 263-274 - Claudia D'Ambrosio, Jon Lee, Andreas Wächter:
A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity. ESA 2009: 107-118 - Daniel Delling, Thomas Pajor, Dorothea Wagner:
Accelerating Multi-modal Route Planning by Access-Nodes. ESA 2009: 587-598 - Erik D. Demaine:
Algorithms Meet Art, Puzzles, and Magic. ESA 2009: 289 - Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx:
Minimizing Movement: Fixed-Parameter Tractability. ESA 2009: 718-729 - György Dósa, Leah Epstein:
Preemptive Online Scheduling with Reordering. ESA 2009: 456-467 - Adrian Dumitrescu, Minghui Jiang:
Piercing Translates and Homothets of a Convex Body. ESA 2009: 131-142 - Christoph Dürr, Flavio Guiñez, Martín Matamala:
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard. ESA 2009: 776-787 - Sebastian Eggert, Lasse Kliemann, Anand Srivastav:
Bipartite Graph Matchings in the Semi-streaming Model. ESA 2009: 492-503 - Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf:
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs. ESA 2009: 143-154 - Michael Elkin, Shay Solomon:
Narrow-Shallow-Low-Light Trees with and without Steiner Points. ESA 2009: 215-226
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-23 23:25 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