default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 63
Volume 63, Numbers 1-2, June 2012
- Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Near-Linear Approximation Algorithms for Geometric Hitting Sets. 1-25 - Adrian Kosowski, Alfredo Navarra
:
Graph Decomposition for Memoryless Periodic Exploration. 26-38 - Raphael Yuster:
Almost Exact Matchings. 39-50 - Elliot Anshelevich, Martin Hoefer:
Contribution Games in Networks. 51-90 - Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha:
On the Hitting Times of Quantum Versus Random Walks. 91-116 - Scott M. Summers:
Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming. 117-136 - Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul, Alexander Zelikovsky:
Maximum Series-Parallel Subgraph. 137-157 - David Coudert, Florian Huc, Dorian Mazauric:
A Distributed Algorithm for Computing the Node Search Number in Trees. 158-190 - Donglei Du, Ruixing Lu, Dachuan Xu:
A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties. 191-200 - Craig Dillabaugh, Meng He, Anil Maheshwari:
Succinct and I/O Efficient Data Structures for Traversal in Trees. 201-223 - Telikepalli Kavitha:
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. 224-245 - Leah Epstein, Asaf Levin:
On Equilibria for ADM Minimization Games. 246-273 - Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Minimize the Maximum Duty in Multi-interface Networks. 274-295 - Gokarna Sharma, Costas Busch:
A Competitive Analysis for Balanced Transactional Memory Workloads. 296-322 - Daniel Binkele-Raible, Henning Fernau:
An Exact Exponential Time Algorithm for Power Dominating Set. 323-346 - Samir Khuller, Yoo-Ah Kim, Azarakhsh Malekian:
Improved Approximation Algorithms for Data Migration. 347-362 - Joachim von zur Gathen, Daniel Panario, L. Bruce Richmond:
Interval Partitions and Polynomial Factorization. 363-397 - Zeev Nutov:
Approximating Node-Connectivity Augmentation Problems. 398-410 - Alexander Kesselman, Kirill Kogan, Michael Segal:
Improved Competitive Performance Bounds for CIOQ Switches. 411-424 - Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani:
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. 425-456 - Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao:
External Memory Planar Point Location with Logarithmic Updates. 457-475 - Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat:
Layered Working-Set Trees. 476-489 - Sebastian Eggert, Lasse Kliemann, Peter Munstermann, Anand Srivastav:
Bipartite Matching in the Semi-streaming Model. 490-508 - Frédérique Bassino, Julien David, Cyril Nicaud:
Average Case Analysis of Moore's State Minimization Algorithm. 509-531 - Stefan Kratsch:
Polynomial Kernelizations for MIN F+Π1 and MAX NP. 532-550 - Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm. 551-567
Volume 63, Number 3, July 2012
- Alejandro López-Ortiz:
Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN). 569-570 - Viliam Geffert, Giovanni Pighizzini:
Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. 571-587 - Qi Ge, Daniel Stefankovic:
The Complexity of Counting Eulerian Tours in 4-regular Graphs. 588-601 - Adrian Dumitrescu, Minghui Jiang:
Minimum-Perimeter Intersecting Polygons. 602-615 - Mark van Hoeij, Andrew Novocin:
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials. 616-633 - Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth:
The Power of Fair Pricing Mechanisms. 634-644 - Paul S. Bonsma, Felix Breuer:
Counting Hexagonal Patches and Independent Sets in Circle Graphs. 645-671 - Christian A. Duncan, Emden R. Gansner, Yifan Hu, Michael Kaufmann, Stephen G. Kobourov:
Optimal Polygonal Representation of Planar Graphs. 672-691 - Fedor V. Fomin, Fabrizio Grandoni, Daniel Lokshtanov, Saket Saurabh:
Sharp Separation and Applications to Exact and Parameterized Algorithms. 692-706 - Paolo Ferragina, Travis Gagie, Giovanni Manzini:
Lightweight Data Indexing and Compression in External Memory. 707-730
Volume 63, Number 4, August 2012
- Mark de Berg:
Guest Editorial. 731-732 - Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra:
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. 733-762 - Vincenzo Bonifaci, Alberto Marchetti-Spaccamela:
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems. 763-780 - Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu:
Caching Is Hard - Even in the Fault Model. 781-794 - MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Local Search Algorithms for the Red-Blue Median Problem. 795-814 - Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao:
On Space Efficient Two Dimensional Range Minimum Data Structures. 815-830 - Emmanouil Pountourakis, Angelina Vidali:
A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing. 831-860 - Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
f-Sensitivity Distance Oracles and Routing Schemes. 861-882
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 2024-11-06 20:36 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:
