Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 73
Volume 73, Number 1, September 2015
- Yuichi Yoshida, Hiro Ito:
Testing Outerplanarity of Bounded Degree Graphs. 1-20 - Yuren Zhou, Jun Zhang
, Yong Wang:
Performance Analysis of the (1+1) Evolutionary Algorithm for the Multiprocessor Scheduling Problem. 21-41 - Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao:
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. 42-62 - Yixin Cao, Jianer Chen, Yang Liu:
On Feedback Vertex Set: New Measure and New Structures. 63-86 - Martin Farach-Colton, Miguel A. Mosteiro:
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model. 87-114 - Aparna Das, Claire Mathieu:
A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing. 115-142 - Babak Behsaz, Mohammad R. Salavatipour:
On Minimum Sum of Radii and Diameters Clustering. 143-165 - Swan Dubois, Toshimitsu Masuzawa, Sébastien Tixeuil:
Maximum Metric Spanning Tree Made Byzantine Tolerant. 166-201 - Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk:
Computing Tree-Depth Faster Than 2n. 202-216 - Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Fast Algorithm for Partial Covers in Words. 217-233
Volume 73, Number 2, October 2015
- Srikanta Tirthapura, David P. Woodruff:
A General Method for Estimating Correlated Aggregates Over a Data Stream. 235-260 - Petros Boufounos, Volkan Cevher, Anna C. Gilbert, Yi Li, Martin J. Strauss:
What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid. 261-288 - Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon:
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs. 289-305 - Tanja Hartmann, Jonathan Rollin, Ignaz Rutter:
Regular Augmentation of Planar Graphs. 306-370 - Anna Adamaszek, Alexandru Popa:
Algorithmic and Hardness Results for the Colorful Components Problems. 371-388 - Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation Problems in Scheduling. 389-409
- Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Christiane Schmidt:
Facets for Art Gallery Problems. 411-440 - Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani:
On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets. 441-459 - Yu Li, Donglei Du, Naihua Xiu, Dachuan Xu:
Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties. 460-482
Volume 73, Number 3, November 2015
- Radu Curticapean, Marvin Künnemann:
A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems. 483-510 - Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano:
Logit Dynamics with Concurrent Updates for Local Interaction Potential Games. 511-546 - Davide Bilò, Luciano Gualà, Guido Proietti:
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. 547-570 - Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann:
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. 571-588 - Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin:
Computing the Greedy Spanner in Linear Space. 589-606 - Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria:
The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology. 607-619
Volume 73, Number 4, December 2015
- Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam:
Guest Editors Foreword. 621-622 - Lars Arge, Mikkel Thorup:
RAM-Efficient External Memory Sorting. 623-636 - Martin Farach-Colton, Meng-Tsung Tsai:
Exact Sublinear Binomial Sampling. 637-651 - Moni Naor, Eylon Yogev:
Tight Bounds for Sliding Bloom Filters. 652-672 - Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim:
On the Number of Edges of Fan-Crossing Free Graphs. 673-695 - René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Myhill-Nerode Methods for Hypergraphs. 696-729 - Kyle Klein, Subhash Suri:
Pursuit Evasion on Polyhedral Surfaces. 730-747 - Hans L. Bodlaender, MohammadTaghi Hajiaghayi, Giuseppe F. Italiano:
Editorial. 748-749 - Hans L. Bodlaender, Mohammad Taghi Hajiaghayi, Giuseppe F. Italiano:
Erratum to: Editorial. 750
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-30 20:51 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:
