12. SWAT 2010: Bergen, Norway
Haim Kaplan (Ed.): Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings. Springer 2010 Lecture Notes in Computer Science ISBN 978-3-642-13730-3- Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc: Optimal Exploration of Terrains with Obstacles. 1-12
- Sanjeev Arora: Semidefinite Programming and Approximation Algorithms: A Survey. 25
- Amr Elmasry, Claus Jensen, Jyrki Katajainen: Strictly-Regular Number System and Data Structures. 26-37
- Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg: An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. 38-49
- Jie Gao, Dengpan Zhou: The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition. 50-61
- Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij: A Bottom-Up Method and Fast Algorithms for max independent set. 62-73
- Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk: Capacitated Domination Faster Than O(2n). 74-80
- Stefan Kratsch, Pascal Schweitzer: Isomorphism for Graphs of Bounded Feedback Vertex Set Number. 81-92
- Zhou Xu, Brian Rodrigues: A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem. 127-138
- Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein: Minimum and Maximum against k Lies. 139-149
- Garud Iyengar, David J. Phillips, Clifford Stein: Feasible and Accurate Algorithms for Covering Semidefinite Programs. 150-162
- Prabhakar Raghavan: The Quantitative Analysis of User Behavior Online - Data, Models and Algorithms. 163
- Robert Crowston, Gregory Gutin, Mark Jones, Eun Jung Kim, Imre Z. Ruzsa: Systems of Linear Equations over F2 and Problems Parameterized above Average. 164-175
- Tim Nonner: Capacitated max -Batching with Interval Graph Compatibilities. 176-187
- Imran A. Pirwani, Mohammad R. Salavatipour: A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs. 188-199
- Danny Z. Chen, Chao Wang, Haitao Wang: Representing a Functional Curve by Curves with Fewer Peaks. 200-211
- Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Improved Methods For Generating Quasi-gray Codes. 224-235
- A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz: The MST of Symmetric Disk Graphs Is Light. 236-247
- Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter: Bin Packing with Fixed Number of Bins Revisited. 260-272
- Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Cops and Robber Game without Recharging. 273-284
- Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor: Path Schematization for Route Sketches. 285-296
- Dana Randall: Phase Transitions in Sampling Algorithms and the Underlying Random Structures. 309
- Bart M. P. Jansen: Polynomial Kernels for Hard Problems on Disk Graphs. 310-321
- Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Faster Parameterized Algorithms for Minor Containment. 322-333
- Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. 334-345
- David P. Bunde, Michael H. Goldwasser: Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput. 346-358
- Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai: Online Selection of Intervals and t-Intervals. 383-394
- Marcin Kaminski, Lukasz Kowalik: Approximating the Maximum 3- and 4-Edge-Colorable Subgraph. 395-407
- Anand Louis, Nisheeth K. Vishnoi: Improved Algorithm for Degree Bounded Survivable Network Design Problem. 408-419
- Erik D. Demaine, Morteza Zadimoghaddam: Minimizing the Diameter of a Network Using Shortcut Edges. 420-431
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team