Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 70
Volume 70, Number 1, September 2014
- Joachim Gudmundsson
, Julián Mestre, Taso Viglas:
Editorial: COCOON 2012 Special Issue. 1 - Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song:
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network. 2-21 - Ragesh Jaiswal, Amit Kumar, Sandeep Sen:
A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems. 22-46 - Ruiwen Chen, Valentine Kabanets, Jeff Kinne:
Lower Bounds Against Weakly-Uniform Threshold Circuits. 47-75 - Xin Han, Yasushi Kawase, Kazuhisa Makino:
Online Unweighted Knapsack Problem with Removal Cost. 76-91 - Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller:
Online Coloring of Bipartite Graphs with and without Advice. 92-111 - Oswin Aichholzer, Matias Korman, Alexander Pilz, Birgit Vogtenhuber:
Geodesic Order Types. 112-128 - René van Bevern:
Towards Optimal and Expressive Kernelization for d-Hitting Set. 129-147
Volume 70, Number 2, October 2014
- David Fernández-Baca:
Editorial. 149-151 - Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron:
A Generalization of the Convex Kakeya Problem. 152-170 - Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum:
An Equivariance Theorem with Applications to Renaming. 171-194 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n. 195-207 - Daniel Dadush:
A Randomized Sieving Algorithm for Approximate Integer Programming. 208-244 - Michel Habib, Antoine Mamcarz, Fabien de Montgolfier:
Computing H-Joins with Application to 2-Modular Decomposition. 245-266 - Ahmed Helmi, Conrado Martínez, Alois Panholzer:
Analysis of the Strategy "Hiring Above the $$m$$ m -th Best Candidate". 267-300 - Bernard Mans, Igor E. Shparlinski:
Random Walks, Bisections and Gossiping in Circulant Graphs. 301-325 - Monaldo Mastrolilli:
The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem. 326-339 - Zeev Nutov:
Degree Constrained Node-Connectivity Problems. 340-364
Volume 70, Number 3, November 2014
- Leah Epstein, Paolo Ferragina:
Guest Editorial: Selected Papers of European Symposium of Algorithms. 365-367 - Jessica Chang, Harold N. Gabow, Samir Khuller:
A Model for Minimizing Active Processor Time. 368-405 - Jean-Daniel Boissonnat, Clément Maria:
The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes. 406-427 - Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel:
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. 428-456 - Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. 457-492 - Tobias Harks, Britta Peis:
Resource Buying Games. 493-512 - Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. 513-560 - Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong:
Routing Regardless of Network Stability. 561-593
Volume 70, Number 4, December 2014
- Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder, Marek Karpinski:
On the Computational Complexity of Measuring Global Stability of Banking Networks. 595-647 - Christos Koufogiannakis, Neal E. Young:
A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs. 648-674 - George Christodoulou, Katrina Ligett, Evangelia Pyrga:
Contention Resolution under Selfishness. 675-693 - Kun-Mao Chao, Tsan-sheng Hsu, D. T. Lee:
Preface Algorithms and Computation (ISAAC 2012). 694-695 - Meng He, J. Ian Munro, Gelin Zhou:
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. 696-717 - Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh:
The Minimum Vulnerability Problem. 718-731 - Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky:
Strong Conflict-Free Coloring for Intervals. 732-749
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:
