default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 60
Volume 60, Number 1, May 2011
- Dan Halperin, Kurt Mehlhorn:
Guest Editorial: Selected Papers from European Symposium on Algorithms. 1-2 - Zoltán Király
:
Better and Simpler Approximation Algorithms for the Stable Marriage Problem. 3-20 - Andreas Bley:
An Integer Programming Algorithm for Routing Optimization in IP Networks. 21-45 - Hamid Zarrabi-Zadeh:
An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions. 46-59 - Daniel Delling:
Time-Dependent SHARC-Routing. 60-94 - Hervé Fournier, Antoine Vigneron:
Fitting a Step Function to a Point Set. 95-109 - Anke van Zuylen:
Deterministic Sampling Algorithms for Network Design. 110-151 - Danny Z. Chen, Shuang Luan, Chao Wang:
Coupled Path Planning, Region Optimization, and Applications in Intensity-modulated Radiation Therapy. 152-174
Volume 60, Number 2, June 2011
- Steffen Heber, Richard Mayr, Jens Stoye:
Common Intervals of Multiple Permutations. 175-206 - Leo van Iersel, Steven Kelk:
Constructing the Simplest Possible Phylogenetic Network from Triplets. 207-235 - Michel Barbeau, Prosenjit Bose, Paz Carmi, Mathieu Couture, Evangelos Kranakis:
Location-Oblivious Distributed Unit Disk Graph Coloring. 236-249 - Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu:
Out-of-Order Event Processing in Kinetic Data Structures. 250-273 - Mong-Jen Kao, Chung-Shou Liao, D. T. Lee:
Capacitated Domination Problem. 274-300 - Srikrishnan Divakaran, Michael E. Saks:
An Online Algorithm for a Problem in Scheduling with Set-ups and Release Times. 301-315 - Sebastian Böcker, Sebastian Briesemeister, Gunnar W. Klau:
Exact Algorithms for Cluster Editing: Evaluation and Experiments. 316-334 - Ohad Lipsky, Ely Porat:
Approximate Pattern Matching with the L1, L2 and L∞ Metrics. 335-348 - Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira:
Peeling Meshed Potatoes. 349-367 - Leah Epstein, Elena Kleiman:
Selfish Bin Packing. 368-394 - Zachary Friggstad, Mohammad R. Salavatipour:
Approximability of Packing Disjoint Cycles. 395-400 - Oded Lachish, Ilan Newman:
Testing Periodicity. 401-420 - Nikhil Bansal, Danny Z. Chen, Don Coppersmith, Xiaobo Sharon Hu, Shuang Luan, Ewa Misiolek, Baruch Schieber, Chao Wang:
Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy. 421-450 - Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija:
Improved Approximations for Guarding 1.5-Dimensional Terrains. 451-463 - Ami Litman, Shiri Moran-Schein:
On Centralized Smooth Scheduling. 464-480
Volume 60, Number 3, July 2011
- Farhad Shahrokhi:
Guest Editor's Foreword: Algorithms, Combinatorics, & Geometry. 481-483 - Sergio Cabello, Bojan Mohar:
Crossing Number and Weighted Crossing Number of Near-Planar Graphs. 484-504 - Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos:
Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems. 505-552 - Daniel W. Cranston, Seog-Jin Kim, Gexin Yu:
Injective Colorings of Graphs with Low Average Degree. 553-568 - Ulrik Brandes, Cesim Erten, Alejandro Estrella-Balderrama, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis:
Colored Simultaneous Geometric Embeddings and Universal Pointsets. 569-592 - Fenghui Zhang, Anxiao Jiang, Jianer Chen:
On the Planarization of Wireless Sensor Networks. 593-608 - Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Spiraling and Folding: The Word View. 609-626 - Adrian Dumitrescu, Csaba D. Tóth:
Minimum Weight Convex Steiner Partitions. 627-652 - Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk:
Knowledge State Algorithms. 653-678 - Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Crossing Numbers of Graphs with Rotation Systems. 679-702 - Adrian Dumitrescu, Minghui Jiang:
Sweeping Points. 703-717
Volume 60, Number 4, August 2011
- Emanuele G. Fusco, Andrzej Pelc:
Trade-offs Between the Size of Advice and Broadcasting Time in Trees. 719-734 - Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko:
Approximating Minimum-Power Degree and Connectivity Problems. 735-742 - Martin Hoefer:
Competitive Cost Sharing with Economies of Scale. 743-765 - Eldar Fischer, Orly Yahalom:
Testing Convexity Properties of Tree Colorings. 766-805 - Michael Arnold, Enno Ohlebusch:
Linear Time Algorithms for Generalizations of the Longest Common Substring Problem. 806-818 - Robert Dabrowski, Wojciech Plandowski:
On Word Equations in One Variable. 819-828 - Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle:
Detecting Regular Visit Patterns. 829-852 - Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Permutation Betting Markets: Singleton Betting with Extra Information. 853-876 - Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs:
Average Rate Speed Scaling. 877-889 - Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani:
Finding a Minimum-depth Embedding of a Planar Graph in O(n4) Time. 890-937 - Joshua Buresh-Oppenheim, Sashka Davis, Russell Impagliazzo:
A Stronger Model of Dynamic Programming Algorithms. 938-968 - Zhi-Zhong Chen, Guohui Lin, Lusheng Wang:
An Approximation Algorithm for the Minimum Co-Path Set Problem. 969-986 - Athanassios Koutsonas, Dimitrios M. Thilikos:
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms. 987-1003 - Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid:
Algorithms for Marketing-Mix Optimization. 1004-1016 - Viswanath Nagarajan, R. Ravi:
The Directed Orienteering Problem. 1017-1030
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-10-22 02:16 CEST 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:
