Остановите войну!
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 87 matches
- 2015
- Johannes Fischer, Travis Gagie, Pawel Gawrychowski, Tomasz Kociumaka:
Approximating LZ77 via Small-Space Multiple-Pattern Matching. ESA 2015: 533-544 - Spyros Angelopoulos, Giorgio Lucarelli, Kim Thang Nguyen:
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems. ESA 2015: 35-46 - George Christodoulou, Alkmini Sgouritsa, Bo Tang:
On the Efficiency of All-Pay Mechanisms. ESA 2015: 349-360 - Oliver Göbel, Thomas Kesselheim, Andreas Tönnis:
Online Appointment Scheduling in the Random Order Model. ESA 2015: 680-692 - Marek Adamczyk, Fabrizio Grandoni, Joydeep Mukherjee:
Improved Approximation Algorithms for Stochastic Matching. ESA 2015: 1-12 - Peyman Afshani, Nodari Sitchinava:
Sorting and Permuting without Bank Conflicts on GPUs. ESA 2015: 13-24 - Helmut Alt, Mark de Berg, Christian Knauer:
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. ESA 2015: 25-34 - Yossi Azar, Oren Gilon:
Buffer Management for Packets with Processing Times. ESA 2015: 47-58 - Davaatseren Baatar, Mohan Krishnamoorthy, Andreas T. Ernst:
A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem. ESA 2015: 59-70 - Amotz Bar-Noy, David Peleg, George Rabanca, Ivo Vigan:
Improved Approximation Algorithms for Weighted 2-Path Partitions. ESA 2015: 953-964 - Alon Baram, Efi Fogel, Dan Halperin, Michael Hemmer, Sebastian Morr:
Exact Minkowski Sums of Polygons With Holes. ESA 2015: 71-82 - Gill Barequet, Günter Rote, Mira Shalah:
λ > 4. ESA 2015: 83-94 - MohammadHossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Revenue Maximization for Selling Multiple Correlated Items. ESA 2015: 95-105 - Niklas Baumstark, Guy E. Blelloch, Julian Shun:
Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm. ESA 2015: 106-117 - Abbas Bazzi, Ashkan Norouzi-Fard:
Towards Tight Lower Bounds for Scheduling Problems. ESA 2015: 118-129 - Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Chrysanthi N. Raftopoulou:
1-Planar Graphs have Constant Book Thickness. ESA 2015: 130-141 - Djamal Belazzougui, Patrick Hagge Cording, Simon J. Puglisi, Yasuo Tabei:
Access, Rank, and Select in Grammar-compressed Strings. ESA 2015: 142-154 - Elisabetta Bergamini, Henning Meyerhenke:
Fully-Dynamic Approximation of Betweenness Centrality. ESA 2015: 155-166 - Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti:
Improved Purely Additive Fault-Tolerant Spanners. ESA 2015: 167-178 - Hans L. Bodlaender, Jesper Nederlof:
Subexponential Time Algorithms for Finding Small Tree and Path Decompositions. ESA 2015: 179-190 - Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich:
Enumeration of 2-Level Polytopes. ESA 2015: 191-202 - Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh:
A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations. ESA 2015: 595-606 - Fritz Bökler, Petra Mutzel:
Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems. ESA 2015: 288-299 - Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen:
Upper and Lower Bounds for Online Routing on Delaunay Triangulations. ESA 2015: 203-214 - Michele Borassi, David Coudert, Pierluigi Crescenzi, Andrea Marino:
On Computing the Hyperbolicity of Real-World Graphs. ESA 2015: 215-226 - Glencora Borradaile, Amir Nayyeri, Farzad Zafarani:
Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs. ESA 2015: 227-238 - Christina Boucher, Christine Lo, Daniel Lokshtanov:
Consensus Patterns (Probably) Has no EPTAS. ESA 2015: 239-250 - Ulrik Brandes, Michael Hamann, Ben Strasser, Dorothea Wagner:
Fast Quasi-Threshold Editing. ESA 2015: 251-262 - Kevin Buchin, Tim Ophelders, Bettina Speckmann:
Computing the Similarity Between Moving Curves. ESA 2015: 928-940 - Marc Bury, Chris Schwiegelshohn:
Sublinear Estimation of Weighted Matchings in Dynamic Data Streams. ESA 2015: 263-274
skipping 57 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 13:08 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