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 39 matches
- 1997
- Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis:
Scheduling Independent Multiprocessor Tasks. ESA 1997: 1-12 - Esther M. Arkin, Refael Hassin:
On Local Search for Weighted k-Set Packing. ESA 1997: 13-22 - Yossi Azar, Leah Epstein:
On-Line Machine Covering. ESA 1997: 23-36 - Therese C. Biedl, Michael Kaufmann:
Area-Efficient Static and Incremental Graph Drawings. ESA 1997: 37-52 - Johannes Blömer:
Denesting by Bounded Degree Radicals. ESA 1997: 53-63 - Ulrik Brandes, Dorothea Wagner:
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract). ESA 1997: 64-77 - Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). ESA 1997: 78-91 - Gérard Cornuéjols, Regina Urbaniak, Robert Weismantel, Laurence A. Wolsey:
Decomposition of Integer Programs and of Generating Sets. ESA 1997: 92-102 - Artur Czumaj, Willy-Bernhard Strothmann:
Bounded Degree Spanning Trees (Extended Abstract). ESA 1997: 104-117 - Krzysztof Diks, Andrzej Pelc:
Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes (Extended Abstract). ESA 1997: 118-129 - Hristo N. Djidjev:
Weighted Graph Separators and Their Applications. ESA 1997: 130-143 - Sándor P. Fekete, Jörg Schepers:
A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems. ESA 1997: 144-156 - Matthias Fischer, Friedhelm Meyer auf der Heide, Willy-Bernhard Strothmann:
Dynamic Data Structures for Realtime Management of Large Geormetric Scences (Extended Abstract). ESA 1997: 157-170 - Ulrich Fößmeier, Michael Kaufmann:
Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice. ESA 1997: 171-185 - Daniele Frigioni, Giuseppe F. Italiano:
Dynamically Switching Vertices in Planar Graphs (Extended Abstract). ESA 1997: 186-199 - Theodoulos Garefalakis:
A New Family of Randomized Algorithms for List Accessing. ESA 1997: 200-216 - Raffaele Giancarlo, Daniela Guaiana:
On-Line Construction of Two-Dimensional Suffix Trees. ESA 1997: 217-231 - Kevin D. Glazebrook, José Niño-Mora:
Scheduling Multiclass Queueing Networks on Parallel Servers: Approximate and Heavy-Traffic Optimality of Klimov's Priority Rule. ESA 1997: 232-245 - Vladimir Grebinski, Gregory Kucherov:
Optimal Reconstruction of Graphs Under the Additive Model. ESA 1997: 246-258 - Christoph Helmberg:
Fixing Variables in Semidefinite Relaxations. ESA 1997: 259-270 - Martin Henk, Robert Weismantel:
Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations. ESA 1997: 271-283 - Kazuo Iwama, Eiji Miyano:
Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing. ESA 1997: 284-295 - Bala Kalyanasundaram, Kirk Pruhs:
Fault-Tolerant Real-Time Scheduling. ESA 1997: 296-307 - Dmitry Kogan, Assaf Schuster:
Collecting Garbage Pages in a Distributed Shared Memory with Reduced Memory and Communication Overhead. ESA 1997: 308-325 - Madhukar R. Korupolu, Vijaya Ramachandran:
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems. ESA 1997: 326-340 - Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson:
Minimum Spanning Trees in d Dimensions. ESA 1997: 341-349 - Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen:
Relaxed Balance for Search Trees with Local Rebalancing. ESA 1997: 350-363 - Matthias Müller-Hannemann, Karsten Weihe:
Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes. ESA 1997: 364-377 - Joseph Naor, Ariel Orda, Yael Petruschka:
Dynamic Storage Allocation with Known Durations. ESA 1997: 378-387 - Andreas Nolte, Rainer Schrader:
Coloring in Sublinear Time. ESA 1997: 388-401
skipping 9 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-12-04 01:19 CET 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