ALMCA - 2022 - volume 84 论文列表 |
| 点击这里查看 Algorithmica 的JCR分区、影响因子等信息 |
Volume 84, Number 4, April 2022
Yusuke Kobayashi Yoshio Okamoto Yota Otachi Yushi Uno
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates.
Swapnam Bajpai Vaibhav Krishan Deepanshu Kush Nutan Limaye Srikanth Srinivasan
Posimodular Function Optimization.Magnús M. Halldórsson Toshimasa Ishii Kazuhisa Makino Kenjiro Takazawa
Fast and Longest Rollercoasters.Pawel Gawrychowski Florin Manea Radoslaw Serafin
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs. On Proper Labellings of Graphs with Minimum Label Sum.Julien Bensmail Foivos Fioravantes Nicolas Nisse
Dynamic Averaging Load Balancing on Cycles.Dan Alistarh Giorgi Nadiradze Amirmojtaba Sabour
A Refined Branching Algorithm for the Maximum Satisfiability Problem.Wenjun Li Chao Xu Yongjie Yang Jianer Chen Jianxin Wang
Parameter Analysis for Guarding Terrains.Akanksha Agrawal Sudeshna Kolay Meirav Zehavi
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees.Leo van Iersel Remie Janssen Mark Jones Yukihiro Murakami Norbert Zeh
Streaming Dictionary Matching with Mismatches.Pawel Gawrychowski Tatiana Starikovskaya
Parameterized Complexity of (A, ℓ )-Path Packing.Rémy Belmonte Tesshu Hanaka Masaaki Kanzaki Masashi Kiyomi Yasuaki Kobayashi Yusuke Kobayashi Michael Lampis Hirotaka Ono Yota Otachi
Volume 84, Number 3, March 2022
Spyros C. Kontogiannis Dorothea Wagner Christos D. Zaroliagis
On the Complexity of Recognizing Wheeler Graphs.Daniel Gibney Sharma V. Thankachan
Enumeration of Maximal Common Subsequences Between Two Strings.Alessio Conte Roberto Grossi Giulia Punzi Takeaki Uno
Computing The Maximum Exponent in a Stream. Safety in s-t Paths, Trails and Walks.Massimo Cairo Shahbaz Khan Romeo Rizzi Sebastian S. Schmidt Alexandru I. Tomescu
Adaptive Succinctness. Computing Minimal Unique Substrings for a Sliding Window.Takuya Mieno Yuta Fujishige Yuto Nakashima Shunsuke Inenaga Hideo Bannai Masayuki Takeda
Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs.Lavinia Egidi Felipe A. Louza Giovanni Manzini
A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges. k-Approximate Quasiperiodicity Under Hamming and Edit Distance.Aleksander Kedzierski Jakub Radoszewski
Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW).Mai Alzamel Costas S. Iliopoulos Dimitrios Letsios Nicola Prezza
Volume 84, Number 2, February 2022
José Arturo Gil Simone Santini
Contraction Bidimensionality of Geometric Intersection Graphs.Julien Baste Dimitrios M. Thilikos
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets.Daniel Lokshtanov Amer E. Mouawad Fahad Panolan Sebastian Siebertz
Additive Approximation of Generalized Turán Questions. Fast Exact Algorithms Using Hadamard Product of Polynomials.Vikraman Arvind Abhranil Chatterjee Rajit Datta Partha Mukhopadhyay
On the Parameterized Complexity of Maximum Degree Contraction Problem.Saket Saurabh Prafullkumar Tale
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness.Julian Dörfler Marc Roth Johannes Schmitt Philip Wellnitz
Mechanisms for (Mis)allocating Scientific Credit. Approximation Schemes for the Generalized Extensible Bin Packing Problem. Tight Bounds for Online Weighted Tree Augmentation. Structural Parameterizations of Clique Coloring.Volume 84, Number 1, January 2022
Ioannis Caragiannis Panagiotis Kanellopoulos Alexandros A. Voudouris
Agglomerative Clustering of Growing Squares.Thom Castermans Bettina Speckmann Frank Staals Kevin Verbeek
A Polynomial Kernel for Diamond-Free Editing.Yixin Cao Ashutosh Rai R. B. Sandeep Junjie Ye
Level-Planar Drawings with Few Slopes.Guido Brückner Nadine Davina Krisam Tamara Mchedlidze
Bounded-Angle Minimum Spanning Trees.Ahmad Biniaz Prosenjit Bose Anna Lubiw Anil Maheshwari
Approximating Dynamic Weighted Vertex Cover with Soft Capacities.Hao-Ting Wei Wing-Kai Hon Paul Horn Chung-Shou Liao Kunihiko Sadakane
Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions.Stéphane Devismes David Ilcinkas Colette Johnen
Approximate Minimum Selection with Unreliable Comparisons. Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. On Perturbation Resilience of Non-uniform k-Center. Approximation Algorithm for Vertex Cover with Multiple Covering Constraints.