default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1st TAPAS 2011: Rome, Italy
- Alberto Marchetti-Spaccamela
, Michael Segal:
Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Rome, Italy, April 18-20, 2011. Proceedings. Lecture Notes in Computer Science 6595, Springer 2011, ISBN 978-3-642-19753-6 - Shay Kutten:
Distributed Decision Problems: The Locality Angle. 1-5 - Kirk Pruhs:
Managing Power Heterogeneity. 6-7 - Paolo Santi:
The Mathematics of Mobility. 8 - Leon Atkins, Guillaume Aupy, Daniel Cole, Kirk Pruhs:
Speed Scaling to Manage Temperature. 9-20 - Roland Bader, Jonathan Dees, Robert Geisberger, Peter Sanders:
Alternative Route Graphs in Road Networks. 21-32 - Apostolos Bessas, Spyros C. Kontogiannis, Christos D. Zaroliagis:
Robust Line Planning in Case of Multiple Pools and Disruptions. 33-44 - Hans L. Bodlaender, Johan M. M. van Rooij:
Exact Algorithms for Intervalizing Colored Graphs. 45-56 - Tiziana Calamoneri, Rossella Petreschi:
L(2, 1)-Labeling of Unigraphs - (Extended Abstract). 57-68 - Ho-Leung Chan, Tak Wah Lam, Rongbin Li:
Energy-Efficient Due Date Scheduling. 69-80 - Mark de Berg, Atlas F. Cook:
Go with the Flow: The Direction-Based Fréchet Distance of Polygonal Curves. 81-91 - Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino:
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs. 92-103 - Britta Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann:
Exploiting Bounded Signal Flow for Graph Orientation Based on Cause-Effect Pairs. 104-115 - Ulrich Faigle, Walter Kern, Britta Peis:
On Greedy and Submodular Matrices. 116-126 - Janick V. Frasch, Sven Oliver Krumke, Stephan Westphal:
MIP Formulations for Flowshop Scheduling with Limited Buffers. 127-138 - Marc Goerigk, Anita Schöbel:
A Scenario-Based Approach for Robust Linear Optimization. 139-150 - Tommi A. Junttila, Petteri Kaski:
Conflict Propagation and Component Recursion for Canonical Labeling. 151-162 - Iyad A. Kanj, Fenghui Zhang:
3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size. 163-174 - Walter Kern, Xian Qiu:
Improved Taxation Rate for Bin Packing Games. 175-180 - Dariusz R. Kowalski, Mariusz A. Rokicki:
Multi-channel Assignment for Communication in Radio Networks. 181-192 - Luigi Laura, Federico Santaroni:
Computing Strongly Connected Components in the Streaming Model. 193-205 - Giorgio Lucarelli, Ioannis Milis:
Improved Approximation Algorithms for the Max-Edge Coloring Problem. 206-216 - Ulrich Meyer, Andrei Negoescu, Volker Weichert:
New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches. 217-228 - Timo Berthold, Stefan Heinz, Jens Schulz:
An Approximative Criterion for the Potential of Energetic Reasoning. 229-239 - Hongyang Sun, Yuxiong He, Wen-Jing Hsu:
Speed Scaling for Energy and Performance with Instantaneous Parallelism. 240-251 - Tigran Tonoyan:
Algorithms for Scheduling with Power Control in Wireless Networks. 252-263
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.
last updated on 2025-12-24 23:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
