default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 79
Volume 79, Number 1, September 2017
- Thore Husfeldt, Iyad A. Kanj:
Guest Editorial: Special Issue on Parameterized and Exact Computation. 1-2 - Bart M. P. Jansen, Astrid Pieterse
:
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT. 3-28 - Ilario Bonacina, Navid Talebanfard:
Strong ETH and Resolution via Games and the Multiplicity of Strategies. 29-41 - Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
Parameterized Complexity of Sparse Linear Complementarity Problems. 42-65 - Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul:
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. 66-95 - Stefan Kratsch, Manuel Sorge:
On Kernelization and Approximation for the Vector Connectivity Problem. 96-138 - Jannis Bulian, Anuj Dawar:
Fixed-Parameter Tractable Distances to Sparse Graph Classes. 139-158 - Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala:
Linear Kernels for Outbranching Problems in Sparse Digraphs. 159-188 - Ondrej Suchý:
Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices. 189-210 - Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized and Approximation Algorithms for the Load Coloring Problem. 211-229 - Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. 230-250 - Eun Jung Kim, O-joung Kwon:
A Polynomial Kernel for Block Graph Deletion. 251-270 - Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Quick but Odd Growth of Cacti. 271-290
Volume 79, Number 2, October 2017
- Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Computation of Substring Equivalence Classes with Suffix Arrays. 291-318 - Lukás Folwarczný, Jirí Sgall:
General Caching Is Hard: Even with Small Pages. 319-339 - Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang:
Convex Hulls Under Uncertainty. 340-367 - Amotz Bar-Noy, Ben Baumer, Dror Rawitz:
Set It and Forget It: Approximating the Set Once Strip Cover Problem. 368-386 - Gregory Kucherov, Yakov Nekrich:
Full-Fledged Real-Time Indexing for Constant Size Alphabets. 387-400 - Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann:
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. 401-427 - Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama:
Efficiently Correcting Matrix Products. 428-443 - Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Chrysanthi N. Raftopoulou:
The Book Thickness of 1-Planar Graphs is Constant. 444-465 - Surender Baswana, Shahbaz Khan:
Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs. 466-483 - Karl Bringmann, Konstantinos Panagiotou:
Efficient Sampling Methods for Discrete Distributions. 484-508 - Stacey Jeffery, Frédéric Magniez, Ronald de Wolf:
Optimal Parallel Quantum Query Algorithms. 509-529 - Jean-Daniel Boissonnat, Karthik C. S., Sébastien Tavenas:
Building Efficient and Compact Data Structures for Simplicial Complexes. 530-567 - Antonios 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. 568-597 - Susanne Albers, Matthias Hellwig:
On the Value of Job Migration in Online Makespan Minimization. 598-623
Volume 79, Number 3, November 2017
- Chia-Chen Wei, Sun-Yuan Hsieh:
Random and Conditional (t, k)-Diagnosis of Hypercubes. 625-644 - Lior Kamma, Robert Krauthgamer:
Metric Decompositions of Path-Separable Graphs. 645-653 - N. R. Aravind, R. B. Sandeep, Naveen Sivadasan:
On Polynomial Kernelization of H-free Edge Deletion. 654-666 - Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh:
Multivariate Complexity Analysis of Geometric Red Blue Set Cover. 667-697 - Jaroslaw Blasiok, Marcin Jakub Kaminski:
Chain Minors are FPT. 698-707 - Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg:
Secluded Connectivity Problems. 708-741 - Stephen Desalvo:
Exact Sampling Algorithms for Latin Squares and Sudoku Matrices via Probabilistic Divide-and-Conquer. 742-762 - Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler:
Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost. 763-796 - Editor's Note: Special Issue on Combinatorial Pattern Matching. 797
- Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh:
Parameterized Complexity of Superstring Problems. 798-813 - Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
String Powers in Trees. 814-834 - Jozef 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. 835-856 - Djamal Belazzougui, Fabio Cunial:
A Framework for Space-Efficient String Kernels. 857-883 - Khaled M. Elbassioni, Kazuhisa Makino:
Guest Editors' Foreword. 884-885 - Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese:
Trading Off Worst and Expected Cost in Decision Tree Problems. 886-908 - Sumedh Tirodkar, Sundar Vishwanathan:
On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems. 909-924 - Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Danny Krizanc, Najmeh Taleb:
When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots. 925-940 - François Le Gall, Shogo Nakajima:
Quantum Algorithm for Triangle Finding in Sparse Graphs. 941-959 - Qin Huang, Xingwu Liu, Xiaoming Sun, Jialin Zhang:
Partial Sorting Problem on Evolving Data. 960-983
Volume 79, Number 4, December 2017
- Juan A. Garay, Rafail Ostrovsky:
Special Issue: Algorithmic Tools in Cryptography. 985-986 - Oriol Farràs, Torben Brandt Hansen, Tarik Kaced, Carles Padró:
On the Information Ratio of Non-perfect Secret Sharing Schemes. 987-1013 - Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Virtual Grey Box Obfuscation for General Circuits. 1014-1051 - Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth:
On the Impossibility of Cryptography with Tamperable Randomness. 1052-1101 - Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza:
Scalable Zero Knowledge Via Cycles of Elliptic Curves. 1102-1160 - Itai Dinur, Gaëtan Leurent:
Improved Generic Attacks Against Hash-Based MACs and HAIFA. 1161-1195 - Yevgeniy Dodis, Adi Shamir, Noah Stephens-Davidowitz, Daniel Wichs:
How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs. 1196-1232 - Dan Boneh, Mark Zhandry:
Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation. 1233-1285 - Takashi Yamakawa, Shota Yamada, Goichiro Hanaoka, Noboru Kunihiro:
Self-Bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications. 1286-1317 - San Ling, Duong Hieu Phan, Damien Stehlé, Ron Steinfeld:
Hardness of k-LWE and Applications in Traitor Tracing. 1318-1352 - Sanjam Garg, Craig Gentry, Shai Halevi, Daniel Wichs:
On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input. 1353-1373
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-11-16 00:29 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:
