default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing Systems, Volume 58
Volume 58, Number 1, January 2016
- Christos Kaklamanis, Kirk Pruhs:
Foreword of the Special Issue Dedicated to the 2013 Workshop on Approximation and Online Algorithms. 1-3 - MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
On Fixed Cost k-Flow Problems. 4-18 - Jaroslaw Byrka
, Shanfei Li, Bartosz Rybicki:
Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties). 19-44 - Matús Mihalák, Rastislav Srámek, Peter Widmayer:
Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs. 45-59 - Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. 60-93 - Trevor I. Fenner, Oded Lachish, Alexandru Popa:
Min-Sum 2-Paths Problems. 94-110 - Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau:
Approximating the Sparsest k-Subgraph in Chordal Graphs. 111-132 - Ofer Neiman:
Low Dimensional Embeddings of Doubling Metrics. 133-152 - Marek Cygan, Lukasz Jez, Jirí Sgall:
Online Knapsack Revisited. 153-190 - Hemant Tyagi, Sebastian U. Stich, Bernd Gärtner:
On Two Continuum Armed Bandit Problems in High Dimensions. 191-222
Volume 58, Number 2, February 2016
- Charles E. Leiserson, Tao B. Schardl, Warut Suksompong:
Upper Bounds on Number of Steals in Rooted Trees. 223-240 - Mingyu Xiao, Hiroshi Nagamochi:
An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4. 241-272 - Hans L. Bodlaender, Johan M. M. van Rooij:
Exact Algorithms for Intervalizing Coloured Graphs. 273-286 - Ali Mashreghi, Alireza Zarei:
When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem. 287-303 - Evripidis Bampis, Dimitrios Letsios, Ioannis Milis, Georgios Zois:
Speed Scaling for Maximum Lateness. 304-321 - Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Alexander V. Sirotkin:
Online Scheduling FIFO Policies with Admission and Push-Out. 322-344 - Shun-Chieh Chang, Jia Jie Liu, Yue-Li Wang:
The Outer-connected Domination Number of Sierpiński-like Graphs. 345-356 - Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk:
A Fast Branching Algorithm for Cluster Vertex Deletion. 357-376 - Joost Engelfriet:
Erratum to: "Top-down Tree Transducers with Regular Look-ahead". 377-379
Volume 58, Number 3, April 2016
- Noam Greenberg:
Editorial: Special Issue on Computability, Complexity and Randomness. 381-382 - Svetlana N. Selezneva, Anton V. Bukhman:
Polynomial-Time Algorithms for Checking Some Properties of Boolean Functions Given by Polynomials. 383-391 - Satyadev Nandakumar, Santhosh Kumar Vangapelli:
Normality and Finite-State Dimension of Liouville Numbers. 392-402 - Vladimir V. V'yugin:
On Stability of Probability Laws with Respect to Small Violations of Algorithmic Randomness. 403-423 - Mikhail Andreev, Akim Kumok:
The Sum 2 KM(x)-K(x) Over All Prefixes x of Some Binary Sequence Can be Infinite. 424-440 - Kenshi Miyabe:
Reducibilities Relating to Schnorr Randomness. 441-462 - Nikolay K. Vereshchagin:
Algorithmic Minimal Sufficient Statistics: a New Approach. 463-481 - Bruno Bauwens:
Relating and Contrasting Plain and Prefix Kolmogorov Complexity. 482-501
Volume 58, Number 4, May 2016
- Anca Muscholl, Martin Dietzfelbinger:
Preface of STACS 2013 Special Issue. 503-505 - Florent Capelli, Arnaud Durand, Stefan Mengel:
The Arithmetic Complexity of Tensor Contraction. 506-527 - Julien Clément, James Allen Fill, Thu Hien Nguyen Thi, Brigitte Vallée:
Towards a Realistic Analysis of the QuickSelect Algorithm. 528-578 - Thomas Colcombet, Laure Daviaud:
Approximate Comparison of Functions Computed by Distance Automata. 579-613 - Tomasz Idziaszek, Michal Skrzypczak, Mikolaj Bojanczyk:
Regular Languages of Thin Trees. 614-663 - Ines Klimann:
Automaton Semigroups: The Two-state Case. 664-680 - Tengyu Ma, Bo Tang, Yajun Wang:
The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems. 681-706
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-12-19 22:16 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:
