![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 25 matches
- 2004
- Klaus Jansen, Roberto Solis-Oba:
Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers. Lecture Notes in Computer Science 2909, Springer 2004, ISBN 3-540-21079-2 [contents] - 2003
- Udo Adamy, Thomas Erlebach:
Online Coloring of Intervals with Bandwidth. WAOA 2003: 1-12 - Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov
, Sergey V. Sevastianov:
Open Block Scheduling in Optical Communication Networks. WAOA 2003: 13-26 - Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri:
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. WAOA 2003: 248-251 - Spyros Angelopoulos:
Randomized Priority Algorithms: (Extended Abstract). WAOA 2003: 27-40 - Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur:
Tradeoffs in Worst-Case Equilibria. WAOA 2003: 41-52 - Yossi Azar, Amir Epstein, Leah Epstein:
Load Balancing of Temporary Tasks in the lp Norm. WAOA 2003: 53-66 - Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
Power Consumption Problems in Ad-Hoc Wireless Networks. WAOA 2003: 252-255 - Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
Simple On-Line Algorithms for Call Control in Cellular Networks. WAOA 2003: 67-80 - Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, Anastasios Sidiropoulos:
Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees. WAOA 2003: 81-94 - David Coudert, Hervé Rivano, Xavier Roche:
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem. WAOA 2003: 256-259 - Thomas Decker, Thomas Lücking, Burkhard Monien:
A 5/4-Approximation Algorithm for Scheduling Identical Malleable Tasks. WAOA 2003: 95-108 - Leah Epstein, Arik Ganot:
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation. WAOA 2003: 109-122 - Thomas Erlebach, Vanessa Kääb, Rolf H. Möhring:
Scheduling AND/OR-Networks on Identical Parallel Machines. WAOA 2003: 123-136 - Aleksei V. Fishkin:
Disk Graphs: A Short Survey. WAOA 2003: 260-264 - Ari Freund, Dror Rawitz:
Combinatorial Interpretations of Dual Fitting and Primal Fitting. WAOA 2003: 137-150 - Giulia Galbiati, Edoardo Amaldi:
On the Approximability of the Minimum Fundamental Cycle Basis Problem. WAOA 2003: 151-164 - Thomas Kamphans, Elmar Langetepe:
The Pledge Algorithm Reconsidered under Errors in Sensors and Motion. WAOA 2003: 165-178 - Elias Koutsoupias, Akash Nanavati:
The Online Matching Problem on a Line. WAOA 2003: 179-191 - Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld:
How to Whack Moles. WAOA 2003: 192-205 - Jae-Ha Lee:
Online Deadline Scheduling: Team Adversary and Restart. WAOA 2003: 206-213 - Dániel Marx:
Minimum Sum Multicoloring on the Edges of Trees: (Extended Abstract). WAOA 2003: 214-226 - Nicole Megow, Andreas S. Schulz:
Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms. WAOA 2003: 227-234 - Claude Tadonki, Mitali Singh, José D. P. Rolim, Viktor K. Prasanna:
Combinatorial Techniques for Memory Power State Scheduling in Energy-Constrained Systems. WAOA 2003: 265-268 - Deshi Ye, Guochuan Zhang
:
On-Line Extensible Bin Packing with Unequal Bin Sizes. WAOA 2003: 235-247
loading more results
failed to load more results, please try again later
![](https://dblp1.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-09-02 00:24 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