|
Conferences in DBLP
- David J. Abraham, Péter Biró, David Manlove
"Almost Stable" Matchings in the Roommates Problem. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:1-14 [Conf]
- Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav
On the Minimum Load Coloring Problem. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:15-26 [Conf]
- Adi Avidor, Ido Berkovitch, Uri Zwick
Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:27-40 [Conf]
- Yossi Azar, Amir Epstein
The Hardness of Network Design for Unsplittable Flow with Selfish Users. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:41-54 [Conf]
- Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz
Improved Approximation Algorithm for Convex Recoloring of Trees. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:55-68 [Conf]
- Reuven Bar-Yehuda, Jonathan Laserson
Exploiting Locality: Approximating Sorting Buffers. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:69-81 [Conf]
- Markus Bläser, L. Shankar Ram
Approximate Fair Cost Allocation in Metric Traveling Salesman Games. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:82-95 [Conf]
- Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
Rounding of Sequences and Matrices, with Applications. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:96-109 [Conf]
- Tomás Ebenlendr, John Noga, Jiri Sgall, Gerhard J. Woeginger
A Note on Semi-online Machine Covering. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:110-118 [Conf]
- Leah Epstein, Asaf Levin
SONET ADMs Minimization with Divisible Paths. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:119-132 [Conf]
- Leah Epstein, Asaf Levin
The Conference Call Search Problem in Wireless Networks. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:133-146 [Conf]
- Alessandro Ferrante, Gennaro Parlato, Francesco Sorrentino, Carmine Ventre
Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:147-160 [Conf]
- Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:161-175 [Conf]
- Toshihiro Fujito, Hidekazu Kurahashi
A Better-Than-Greedy Algorithm for k-Set Multicover. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:176-189 [Conf]
- Elisabeth Gassner, Sven Oliver Krumke
Deterministic Online Optical Call Admission Revisited. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:190-202 [Conf]
- Alexander Grigoriev, Marc Uetz
Scheduling Parallel Jobs with Linear Speedup. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:203-215 [Conf]
- Xin Han, Kazuo Iwama, Guochuan Zhang
Online Removable Square Packing. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:216-229 [Conf]
- Stefan Heinz, Sven Oliver Krumke, Nicole Megow, Jörg Rambau, Andreas Tuchscherer, Tjark Vredeveld
The Online Target Date Assignment Problem. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:230-243 [Conf]
- Ronald Koch, Martin Skutella, Ines Spenke
Approximation and Complexity of k-Splittable Flows. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:244-257 [Conf]
- Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Maarten Lipmann, Alberto Marchetti-Spaccamela, Leen Stougie
On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:258-269 [Conf]
- Zvi Gotthilf, Moshe Lewenstein
Tighter Approximations for Maximum Induced Matchings in Regular Graphs. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:270-281 [Conf]
- Bodo Manthey
On Approximating Restricted Cycle Covers. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:282-295 [Conf]
- Tim Nieberg, Johann Hurink
A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:296-306 [Conf]
- Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut
Speed Scaling of Tasks with Precedence Constraints. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:307-319 [Conf]
- Asaf Levin, Danny Segev
Partial Multicuts in Trees. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:320-333 [Conf]
- Hadas Shachnai, Tami Tamir, Omer Yehezkely
Approximation Schemes for Packing with Item Fragmentation. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:334-347 [Conf]
|