Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 72
Volume 72, Number 1, May 2015
- Mong-Jen Kao, Han-Lin Chen, D. T. Lee:
Capacitated Domination: Problem Complexity and Approximation Algorithms. 1-43 - John Augustine, Ioannis Caragiannis
, Angelo Fanelli, Christos Kalaitzis:
Enforcing Efficient Equilibria in Network Design Games via Subsidies. 44-82 - Pankaj K. Agarwal, R. Sharathkumar:
Streaming Algorithms for Extent Problems in High Dimensions. 83-98 - Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk:
Modifying a Graph Using Vertex Elimination. 99-125 - Joseph Cheriyan, Zachary Friggstad, Zhihan Gao:
Approximating Minimum-Cost Connected T-Joins. 126-147 - Amotz Bar-Noy, Ben Baumer:
Average Case Network Lifetime on an Interval with Adjustable Sensing Ranges. 148-166 - Niv Buchbinder, Rica Gonen:
Incentive Compatible Mulit-Unit Combinatorial Auctions: A Primal Dual Approach. 167-190 - Avrim Blum, Philip M. Long:
Special Issue on New Theoretical Challenges in Machine Learning. 191-192 - Anima Anandkumar, Dean P. Foster, Daniel J. Hsu, Sham M. Kakade, Yi-Kai Liu:
A Spectral Algorithm for Latent Dirichlet Allocation. 193-214 - Sanjeev Arora, Rong Ge, Ankur Moitra, Sushant Sachdeva:
Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian Mixtures and Autoencoders. 215-236 - Sanjoy Dasgupta, Kaushik Sinha:
Randomized Partition Trees for Nearest Neighbor Search. 237-263 - Rafi Witten, Emmanuel J. Candès:
Randomized Algorithms for Low-Rank Matrix Factorizations: Sharp Performance Bounds. 264-281 - Maria-Florina Balcan, Vitaly Feldman:
Statistical Active Learning Algorithms for Noise Tolerance and Differential Privacy. 282-315 - Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio:
Learning Poisson Binomial Distributions. 316-357
Volume 72, Number 2, June 2015
- Jean Cardinal, Gwenaël Joret:
Hitting All Maximal Independent Sets of a Bipartite Graph. 359-368 - Erik D. Demaine, John Iacono, Stefan Langerman:
Worst-Case Optimal Tree Layout in External Memory. 369-378 - Danny Ziyi Chen, Xuehou Tan, Haitao Wang, Gangshan Wu:
Optimal Point Movement for Covering Circular Regions. 379-399 - Dana Ron, Rocco A. Servedio:
Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities. 400-429 - Chih-En Kuo, Yue-Li Wang, Jia Jie Liu, Ming-Tat Ko:
Resequencing a Set of Strings Based on a Target String. 430-449 - Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein:
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. 450-466 - Petra Berenbrink, Robert Elsässer, Thomas Sauerwald:
Communication Complexity of Quasirandom Rumor Spreading. 467-492 - Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula:
Approximability of Capacitated Network Design. 493-514 - Wing-Kai Hon, Tsung-Han Ku, Tak Wah Lam, Rahul Shah, Siu-Lung Tam, Sharma V. Thankachan, Jeffrey Scott Vitter:
Compressing Dictionary Matching Index via Sparsification Technique. 515-538 - Ittai Abraham, Yair Bartal, Ofer Neiman:
Local Embeddings of Metric Spaces. 539-606 - Andrzej Lingas, Mia Persson:
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows. 607-619 - Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer:
The Approximate Rectangle of Influence Drawability Problem. 620-655 - Kevin Buchin, Bettina Speckmann, Kevin Verbeek:
Angle-Restricted Steiner Arborescences for Flow Map Layout. 656-685
Volume 72, Number 3, July 2015
- Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger:
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. 687-713 - Bundit Laekhanukit:
An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem. 714-733 - Robert Crowston, Mark Jones, Matthias Mnich:
Max-Cut Parameterized Above the Edwards-Erdős Bound. 734-757 - Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan:
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. 758-777 - Yasuaki Kobayashi, Hisao Tamaki:
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization. 778-790 - Djamal Belazzougui:
Improved Space-Time Tradeoffs for Approximate Full-Text Indexing with One Edit Error. 791-817 - Bang Ye Wu, Li-Hsuan Chen:
Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions. 818-835 - Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger:
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. 836-859 - Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis:
D2-Tree: A New Overlay with Deterministic Bounds. 860-883 - Ho-Lin Chen, David Doty, Shinnosuke Seki:
Program Size and Temperature in Self-Assembly. 884-899
Volume 72, Number 4, August 2015
- Timothy M. Chan, Stephane Durocher, Matthew Skala, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Minority Query in Arrays. 901-913 - Paola Bonizzoni, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective. 914-939 - Keith Edwards, Eric McDermid:
A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP. 940-968 - Joan Boyar, Sandy Irani, Kim S. Larsen:
A Comparison of Performance Measures for Online Algorithms. 969-994 - Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson:
Augmenting Graphs to Minimize the Diameter. 995-1010 - Gruia Calinescu, Minming Li:
Register Loading via Linear Programming. 1011-1032 - Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
A Linear-Time Algorithm for Testing Outer-1-Planarity. 1033-1054 - Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan:
Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks. 1055-1096 - Luis Barba, Matias Korman, Stefan Langerman, Kunihiko Sadakane, Rodrigo I. Silveira:
Space-Time Trade-offs for Stack-Based Algorithms. 1097-1129 - Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. 1130-1171
a service of 
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-04-26 18:25 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:
