default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing Systems, Volume 62
Volume 62, Number 1, January 2018
- Christoph Dürr, Heribert Vollmer
:
Preface of STACS 2016 Special Issue. 1-3 - Clément L. Canonne, Ilias Diakonikolas, Themis Gouleakis, Ronitt Rubinfeld:
Testing Shape Restrictions of Discrete Distributions. 4-62 - Eva-Maria C. Hols, Stefan Kratsch:
A Randomized Polynomial Kernel for Subset Feedback Vertex Set. 63-92 - Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar:
Faster Algorithms for the Constrained k-means Problem. 93-115 - Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman:
Catalytic Space: Non-determinism and Hierarchy. 116-135 - Mateus de Oliveira Oliveira:
Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function. 136-161 - Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea:
Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets. 162-191 - Markus Lohrey, Georg Zetzsche:
Knapsack in Graph Groups. 192-246
Volume 62, Number 2, February 2018
- Laura Sanità, Martin Skutella:
WAOA 2015 Special Issue on TOCS. 247-248 - Yishay Mansour, Boaz Patt-Shamir, Shai Vardi:
Constant-Time Local Computation Algorithms. 249-267 - Sándor P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips:
Geometric Hitting Set for Segments of Few Orientations. 268-303 - Roozbeh Ebrahimi, Samuel McCauley, Benjamin Moseley:
Scheduling Parallel Jobs Online with Convex and Concave Parallelizability. 304-318 - Katarzyna E. Paluch:
Maximum ATSP with Weights Zero and One via Half-Edges. 319-336 - Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz:
Shortest Augmenting Paths for Online Matchings on Trees. 337-348 - Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs:
Tight Bounds for Double Coverage Against Weak Adversaries. 349-365 - Jan Reineke, Alejandro Salinger:
On the Smoothness of Paging Algorithms. 366-418 - Shay Mozes, Eyal E. Skop:
Efficient Vertex-Label Distance Oracles for Planar Graphs. 419-440 - Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul, Marten Waanders:
Approximation Algorithms for Connected Graph Factors of Minimum Weight. 441-464
Volume 62, Number 3, April 2018
- Alexander S. Kulikov, Gerhard J. Woeginger:
Preface to the Special Issue on Computer Science in Russia 2016. 465-466 - Manfred Kufleitner, Tobias Walter:
Level Two of the Quantifier Alternation Hierarchy Over Infinite Words. 467-480 - Manuel Bodirsky, Marcello Mamino:
Tropically Convex Constraint Satisfaction. 481-509 - Zeev Nutov:
Improved Approximation Algorithms for Minimum Cost Node-Connectivity Augmentation Problems. 510-532 - Toshihiro Fujito, Tomoaki Shimoda:
On Approximating (Connected) 2-Edge Dominating Set by a Tree. 533-556 - Arno Pauly, Florian Steinberg:
Comparing Representations for Function Spaces in Computable Analysis. 557-582 - Alexander Kozachinskiy:
On Slepian-Wolf Theorem with Interaction. 583-599 - Katerina Böhmová, Luca Häfliger, Matús Mihalák, Tobias Pröger, Gustavo Sacomoto, Marie-France Sagot:
Computing and Listing st-Paths in Public Transportation Networks. 600-621 - Meena Mahajan, Nitin Saurabh:
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory. 622-652 - Tim Smith:
Prediction of Infinite Words with Automata. 653-681 - Manfred Kufleitner, Jan Philipp Wächter:
The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy. 682-738 - René van Bevern, Vincent Froese, Christian Komusiewicz:
Parameterizing Edge Modification Problems Above Lower Bounds. 739-770
Volume 62, Number 4, May 2018
- Wim Martens:
Foreword: Special Issue on Database Theory. 771 - Mark Kaminski, Egor V. Kostylev:
Complexity and Expressive Power of Weakly Well-Designed SPARQL. 772-809 - Manas Joglekar, Christopher Ré:
It's All a Matter of Degree - Using Degree Information to Optimize Multiway Joins. 810-853 - Dominik D. Freydenberger, Mario Holldack:
Document Spanners: From Expressive Power to Decision Problems. 854-898 - Phokion G. Kolaitis, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
Limits of Schema Mappings. 899-940 - Wojciech Czerwinski, Claire David, Filip Murlak, Pawel Parys:
Reasoning about integrity constraints for tree-structured data. 941-976
Volume 62, Number 5, July 2018
- Ajoy K. Datta, Lawrence L. Larmore:
Self-Stabilizing Leader Election in Dynamic Networks. 977-1047 - Michael Hecht:
Exact Localisations of Feedback Sets. 1048-1084 - Gadi Taubenfeld:
A Closer Look at Fault Tolerance. 1085-1108 - Zvonko Iljazovic, Bojan Pazek:
Co-c.e. Sets with Disconnected Complements. 1109-1124 - Patrick Scharpfenecker:
Bounded-Depth Succinct Encodings and the Structure they Imply on Graphs. 1125-1143 - David Ilcinkas, Ahmed Mouhamadou Wade:
Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring. 1144-1160 - Marcus Schaefer, Daniel Stefankovic:
The Complexity of Tensor Rank. 1161-1174 - Janusz A. Brzozowski, Marek Szykula, Yuli Ye:
Syntactic Complexity of Regular Ideals. 1175-1202 - Younes Guellouma, Hadda Cherroun, Djelloul Ziadi, Bruce W. Watson:
From Tree Automata to String Automata Minimization. 1203-1222 - Shantanu Das, Dariusz Dereniowski, Christina Karousatou:
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots. 1223-1240 - Michaël Cadilhac, Andreas Krebs, Pierre McKenzie:
The Algebraic Theory of Parikh Automata. 1241-1268 - Nikita Moriakov:
On Effective Birkhoff's Ergodic Theorem for Computable Actions of Amenable Groups. 1269-1287 - Vittorio Bilò:
A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games. 1288-1317 - Olivier Bournez, Johanne Cohen, Mikaël Rabie:
Homonym Population Protocols. 1318-1346
Volume 62, Number 6, August 2018
- Veli Mäkinen, Simon J. Puglisi:
Editorial: Special Issue on "Combinatorial Algorithms" (IWOCA 2016). 1349-1350 - Pawel Gawrychowski, Lukasz Zatorski:
Speeding up dynamic programming in the line-constrained k-median. 1351-1365 - Martin Böhm, Pavel Veselý:
Online Chromatic Number is PSPACE-Complete. 1366-1391 - Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi:
Minimax Regret 1-Median Problem in Dynamic Path Networks. 1392-1408 - Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
Finding Cactus Roots in Polynomial Time. 1409-1426 - Peter Damaschke:
The Solution Space of Sorting with Recurring Comparison Faults. 1427-1442 - Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen:
Weighted Online Problems with Advice. 1443-1469 - Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro:
Partial Covering Arrays: Algorithms and Asymptotics. 1470-1489 - Adrian Dumitrescu, Ritankar Mandal, Csaba D. Tóth:
Monotone Paths in Geometric Triangulations. 1490-1524 - Xujin Chen, Zhuo Diao, Xiaodong Hu, Zhongzheng Tang:
Covering Triangles in Edge-Weighted Graphs. 1525-1552
Volume 62, Number 7, October 2018
- Rod Downey, Denis R. Hirschfeldt, Bjørn Kjos-Hanssen:
Preface. 1553-1554 - Verónica Becher, Olivier Carton, Pablo Ariel Heiber:
Finite-State Independence. 1555-1572 - Cristian S. Calude, Ludwig Staiger:
Liouville, Computable, Borel Normal and Martin-Löf Random Numbers. 1573-1585 - Adam Case:
Bounded Turing Reductions and Data Processing Inequalities for Sequences. 1586-1598 - Kenshi Miyabe:
Coherence of Reducibilities with Randomness Notions. 1599-1619 - Elvira Mayordomo:
Effective Hausdorff Dimension in General Metric Spaces. 1620-1636 - Douglas Cenzer, Christopher P. Porter:
The Random Members of a Π10 Class. 1637-1671
Volume 62, Number 8, November 2018
- Faisal N. Abu-Khzam, Christine Markarian, Friedhelm Meyer auf der Heide, Michael Schubert:
Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. 1673-1689 - R. Krithika, Diptapriyo Majumdar, Venkatesh Raman:
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. 1690-1714 - Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz:
Finger Search in Grammar-Compressed Strings. 1715-1735 - Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti:
Space Efficient Linear Time Algorithms for BFS, DFS and Applications. 1736-1762 - Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambudha Roy, Yogish Sabharwal:
Set Cover Problems with Small Neighborhood Covers. 1763-1797 - Yongjie Yang, Jiong Guo:
Parameterized Complexity of Voter Control in Multi-Peaked Elections. 1798-1825 - Matthias Niewerth, Thomas Schwentick:
Reasoning About XML Constraints Based on XML-to-Relational Mappings. 1826-1879 - Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Parameterised Algorithms for Deletion to Classes of DAGs. 1880-1909 - Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh:
Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators. 1910-1951 - Sylvie Davies:
Primitivity, Uniform Minimality, and State Complexity of Boolean Operations. 1952-2005 - Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault, Adi Rosén:
Online Bin Packing with Advice of Small Size. 2006-2034 - Sanaz Soltani, Mohammadreza Razzazi, Hossein Ghasemalizadeh:
The Most Points Connected-Covering Problem with Two Disks. 2035-2047
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-10-31 20:03 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:
