default search action
Theory of Computing Systems, Volume 64
Volume 64, Number 1, January 2020
- Fedor V. Fomin
, Vladimir V. Podolskii
CSR 2018 Special Issue on TOCS. 1-2 - Alexander Kozachinskiy
Recognizing Read-Once Functions from Depth-Three Formulas. 3-16 - Laurent Bulteau
The Clever Shopper Problem. 17-34 - Emmanuel Jeandel, Etienne Moutot
Slopes of Multidimensional Subshifts. 35-61 - Jayakrishnan Madathil
Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree. 62-100 - Rahul Jain
Quadratically Tight Relations for Randomized Query Complexity. 101-119 - Sören Henning
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. 120-140 - Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber:
Grammar-Based Compression of Unranked Trees. 141-176 - Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
Periodicity in Data Streams with Wildcards. 177-197
Volume 64, Number 2, February 2020
- Olga Kuryatnikova
New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines. 199-226 - Christopher Thraves Caro
Optimal Path Discovery Problem with Homogeneous Knowledge. 227-250 - Fedor V. Fomin
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties. 251-271 - Ragavendran Gopalakrishnan, Dimitrios Kanoulas
Cache Me if You Can: Capacitated Selfish Replication Games in Networks. 272-310 - Mordechai Shalom
Profit Maximization in Flex-Grid All-Optical Networks. 311-326 - Yubai Zhang, Zhao Zhang, Yishuo Shi, Xianyue Li:
Algorithm for Online 3-Path Vertex Cover. 327-338 - Dimitris Fotakis, Dimitris Kalimeris, Thanasis Lianeas
Improving Selfish Routing for Risk-Averse Players. 339-370
Volume 64, Number 3, April 2020
- Rolf Niedermeier, Brigitte Vallée:
Preface of the Special Issue on Theoretical Aspects of Computer Science (2018). 371-373 - Max Bannach, Till Tantau
Computing Hitting Set Kernels By AC0-Circuits. 374-399 - Olaf Beyersdorff
Lower Bound Techniques for QBF Expansion. 400-421 - Davide Bilò, Pascal Lenzner
On the Tree Conjecture for the Network Creation Game. 422-443 - Marco Bressan
On Approximating the Stationary Distribution of Time-Reversible Markov Chains. 444-466 - Patrick Gardy, Patricia Bouyer, Nicolas Markey
Dependences in Strategy Logic. 467-507 - Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
Optimal Dislocation with Persistent Errors in Subquadratic Time. 508-521 - Masashi Kiyomi
Space-Efficient Algorithms for Longest Increasing Subsequence. 522-541 - Aayush Rajasekaran, Jeffrey O. Shallit
Additive Number Theory via Automata Theory. 542-567
Volume 64, Number 4, May 2020
- Leah Epstein, Thomas Erlebach:
Special Issue on Approximation and Online Algorithms. 569-570 - Leah Epstein, Thomas Erlebach:
Correction to: Special Issue on Approximation and Online Algorithms. 571 - Yossi Azar
Deterministic Min-Cost Matching with Delays. 572-592 - Allan Borodin, Joan Boyar
Advice Complexity of Priority Algorithms. 593-625 - Jaroslaw Byrka
Approximating Node-Weighted k-MST on Planar Graphs. 626-644 - Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky
An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. 645-661 - Barbara Geissmann
Longest Increasing Subsequence under Persistent Comparison Errors. 662-680
Volume 64, Number 5, July 2020
- Dibyayan Chakraborty
On the Stab Number of Rectangle Intersection Graphs. 681-734 - Hans Raj Tiwary
Extension Complexity of Formal Languages. 735-753 - Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos, Vasilis Vassalos, Georgios Zois:
Scheduling MapReduce Jobs on Identical and Unrelated Processors. 754-782 - Nicolás Alvarez, Olivier Carton
On Normality in Shifts of Finite Type. 783-798 - Beate Bollig
On Limitations of Structured (Deterministic) DNNFs. 799-825 - Benny Kimelfeld:
Special Issue on the 2018 International Conference on Database Theory. 826-827 - Nofar Carmeli
Enumeration Complexity of Conjunctive Queries with Functional Dependencies. 828-860 - Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
Connecting Knowledge Compilation Classes and Width Parameters. 861-914 - Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
Correction to: Connecting Knowledge Compilation Classes and Width Parameters. 915 - Pablo Barceló
A More General Theory of Static Approximations for Conjunctive Queries. 916-964 - Bas Ketsman
Distribution Policies for Datalog. 965-998
Volume 64, Number 6, August 2020
- T.-H. Hubert Chan
Optimizing Social Welfare for Network Bargaining Games in the Face of Instability, Greed and Idealism. 999-1027 - Raffaello Carosi, Gianpiero Monaco
Generalized Graph k-Coloring Games. 1028-1041 - Ilkka Törmä
Countable Sofic Shifts with a Periodic Direction. 1042-1066 - Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra:
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. 1067-1093 - Federico Corò
On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem. 1094-1109 - Jacob Carson, Douglas Cenzer
Effective Categoricity of Automatic Equivalence and Nested Equivalence Structures. 1110-1139 - Dmitry Gavinsky, Pavel Pudlák:
Santha-Vazirani sources, deterministic condensers and very strong extractors. 1140-1154
Volume 64, Number 7, October 2020
- Nadia Pisanti, Charles J. Colbourn, Roberto Grossi:
Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019). 1155-1157 - Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein:
Parameterized Complexity of Min-Power Asymmetric Connectivity. 1158-1182 - Juho Lauri, Christodoulos Mitillos
Complexity of Fall Coloring for Restricted Graph Classes. 1183-1196 - Florian Stober
On the Average Case of MergeInsertion. 1197-1224 - Michael A. Henning, Arti Pandey, Vikash Tripathi
Complexity and Algorithms for Semipaired Domination in Graphs. 1225-1241 - Zola Donovan, K. Subramani
Analyzing Clustering and Partitioning Problems in Selected VLSI Models. 1242-1272 - Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings. 1273-1291 - Yeganeh Bahoo
Computing the k-Visibility Region of a Point in a Polygon. 1292-1306 - Aritra Banik, Ashwin Jacob
Fixed-Parameter Tractability of (n - k) List Coloring. 1307-1316
Volume 64, Number 8, November 2020
- Shaohua Li
An Improved FPT Algorithm for Independent Feedback Vertex Set. 1317-1330 - David Barina
Multiplication Algorithm Based on Collatz Function. 1331-1337 - Evangelos Markakis, Apostolos Ntokos, Orestis Telelis:
On Envy-Free Revenue Approximation for Combinatorial Buyers with Budgets. 1338-1361 - Jin-Yi Cai, Pinyan Lu
Dichotomy for Holant∗ Problems on the Boolean Domain. 1362-1391 - Atsuki Nagao
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs. 1392-1407
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 2025-01-03 23:17 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: