Journal: Algorithmica

Volume 79, Issue 4

985 -- 986Juan A. Garay, Rafail Ostrovsky. Special Issue: Algorithmic Tools in Cryptography
987 -- 1013Oriol Farràs, Torben Brandt Hansen, Tarik Kaced, Carles Padró. On the Information Ratio of Non-perfect Secret Sharing Schemes
1014 -- 1051Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth. On Virtual Grey Box Obfuscation for General Circuits
1052 -- 1101Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth. On the Impossibility of Cryptography with Tamperable Randomness
1102 -- 1160Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza. Scalable Zero Knowledge Via Cycles of Elliptic Curves
1161 -- 1195Itai Dinur, Gaëtan Leurent. Improved Generic Attacks Against Hash-Based MACs and HAIFA
1196 -- 1232Yevgeniy Dodis, Adi Shamir, Noah Stephens-Davidowitz, Daniel Wichs. How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs
1233 -- 1285Dan Boneh, Mark Zhandry. Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
1286 -- 1317Takashi Yamakawa, Shota Yamada, Goichiro Hanaoka, Noboru Kunihiro. Self-Bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications
1318 -- 1352San Ling, Duong Hieu Phan, Damien Stehlé, Ron Steinfeld. Hardness of k-LWE and Applications in Traitor Tracing
1353 -- 1373Sanjam Garg, Craig Gentry, Shai Halevi, Daniel Wichs. On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input

Volume 79, Issue 3

625 -- 644Chia-Chen Wei, Sun-Yuan Hsieh. Random and Conditional (t, k)-Diagnosis of Hypercubes
645 -- 653Lior Kamma, Robert Krauthgamer. Metric Decompositions of Path-Separable Graphs
654 -- 666N. R. Aravind, R. B. Sandeep, Naveen Sivadasan. On Polynomial Kernelization of H-free Edge Deletion
667 -- 697Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh. Multivariate Complexity Analysis of Geometric Red Blue Set Cover
698 -- 707Jaroslaw Blasiok, Marcin Jakub Kaminski. Chain Minors are FPT
708 -- 741Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg. Secluded Connectivity Problems
742 -- 762Stephen Desalvo. Exact Sampling Algorithms for Latin Squares and Sudoku Matrices via Probabilistic Divide-and-Conquer
763 -- 796Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler. Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost
797 -- 0. Editor's Note: Special Issue on Combinatorial Pattern Matching
798 -- 813Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh. Parameterized Complexity of Superstring Problems
814 -- 834Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. String Powers in Trees
835 -- 856Jozef Hales, Alice Héliou, Ján Manuch, Yann Ponty, Ladislav Stacho. Combinatorial RNA Design: Designability and Structure-Approximating Algorithm in Watson-Crick and Nussinov-Jacobson Energy Models
857 -- 883Djamal Belazzougui, Fabio Cunial. A Framework for Space-Efficient String Kernels
884 -- 885Khaled M. Elbassioni, Kazuhisa Makino. Guest Editors' Foreword
886 -- 908Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese. Trading Off Worst and Expected Cost in Decision Tree Problems
909 -- 924Sumedh Tirodkar, Sundar Vishwanathan. On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems
925 -- 940Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Danny Krizanc, Najmeh Taleb. When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots
941 -- 959François Le Gall, Shogo Nakajima. Quantum Algorithm for Triangle Finding in Sparse Graphs
960 -- 983Qin Huang, Xingwu Liu, Xiaoming Sun, Jialin Zhang. Partial Sorting Problem on Evolving Data

Volume 79, Issue 2

291 -- 318Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Efficient Computation of Substring Equivalence Classes with Suffix Arrays
319 -- 339Lukas Folwarczny, Jirí Sgall. General Caching Is Hard: Even with Small Pages
340 -- 367Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang. Convex Hulls Under Uncertainty
368 -- 386Amotz Bar-Noy, Ben Baumer, Dror Rawitz. Set It and Forget It: Approximating the Set Once Strip Cover Problem
387 -- 400Gregory Kucherov, Yakov Nekrich. Full-Fledged Real-Time Indexing for Constant Size Alphabets
401 -- 427Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann 0001. On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
428 -- 443Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama. Efficiently Correcting Matrix Products
444 -- 465Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann 0001, Chrysanthi N. Raftopoulou. The Book Thickness of 1-Planar Graphs is Constant
466 -- 483Surender Baswana, Shahbaz Khan. Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs
484 -- 508Karl Bringmann, Konstantinos Panagiotou. Efficient Sampling Methods for Discrete Distributions
509 -- 529Stacey Jeffery, Frédéric Magniez, Ronald de Wolf. Optimal Parallel Quantum Query Algorithms
530 -- 567Jean-Daniel Boissonnat, Karthik C. S., Sébastien Tavenas. Building Efficient and Compact Data Structures for Simplicial Complexes
568 -- 597Antonios Antoniadis, Neal Barcelo, Mario E. Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato. Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules
598 -- 623Susanne Albers, Matthias Hellwig. On the Value of Job Migration in Online Makespan Minimization

Volume 79, Issue 1

1 -- 2Thore Husfeldt, Iyad A. Kanj. Guest Editorial: Special Issue on Parameterized and Exact Computation
3 -- 28Bart M. P. Jansen, Astrid Pieterse. Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT
29 -- 41Ilario Bonacina, Navid Talebanfard. Strong ETH and Resolution via Games and the Multiplicity of Strategies
42 -- 65Hanna Sumita, Naonori Kakimura, Kazuhisa Makino. Parameterized Complexity of Sparse Linear Complementarity Problems
66 -- 95Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Christophe Paul. An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
96 -- 138Stefan Kratsch, Manuel Sorge. On Kernelization and Approximation for the Vector Connectivity Problem
139 -- 158Jannis Bulian, Anuj Dawar. Fixed-Parameter Tractable Distances to Sparse Graph Classes
159 -- 188Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala. Linear Kernels for Outbranching Problems in Sparse Digraphs
189 -- 210Ondrej Suchý. Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices
211 -- 229Florian Barbero, Gregory Gutin, Mark Jones, Bin Sheng. Parameterized and Approximation Algorithms for the Load Coloring Problem
230 -- 250Holger Dell, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Tobias Mömke. Complexity and Approximability of Parameterized MAX-CSPs
251 -- 270Eun Jung Kim 0002, O-joung Kwon. A Polynomial Kernel for Block Graph Deletion
271 -- 290Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh. Quick but Odd Growth of Cacti