default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 84
Volume 84, Number 1, January 2022
- Eunpyeong Hung, Mong-Jen Kao
:
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints. 1-12 - Sayan Bandyapadhyay:
On Perturbation Resilience of Non-uniform k-Center. 13-36 - Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. 37-59 - Stefano Leucci, Chih-Hung Liu:
Approximate Minimum Selection with Unreliable Comparisons. 60-84 - Stéphane Devismes, David Ilcinkas, Colette Johnen:
Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions. 85-123 - Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane:
Approximating Dynamic Weighted Vertex Cover with Soft Capacities. 124-149 - Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari:
Bounded-Angle Minimum Spanning Trees. 150-175 - Guido Brückner, Nadine Davina Krisam, Tamara Mchedlidze:
Level-Planar Drawings with Few Slopes. 176-196 - Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye:
A Polynomial Kernel for Diamond-Free Editing. 197-215 - Thom Castermans, Bettina Speckmann, Frank Staals, Kevin Verbeek:
Agglomerative Clustering of Growing Squares. 216-233 - Ioannis Caragiannis, Panagiotis Kanellopoulos, Alexandros A. Voudouris:
Bounding the Inefficiency of Compromise in Opinion Formation. 234-271
Volume 84, Number 2, February 2022
- Lars Jaffke, Paloma T. Lima, Geevarghese Philip:
Structural Parameterizations of Clique Coloring. 273-303 - Joseph (Seffi) Naor, Seeun William Umboh, David P. Williamson:
Tight Bounds for Online Weighted Tree Augmentation. 304-324 - Asaf Levin:
Approximation Schemes for the Generalized Extensible Bin Packing Problem. 325-343 - Jon M. Kleinberg, Sigal Oren:
Mechanisms for (Mis)allocating Scientific Credit. 344-378 - Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz:
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness. 379-404 - Saket Saurabh, Prafullkumar Tale:
On the Parameterized Complexity of Maximum Degree Contraction Problem. 405-435 - Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Fast Exact Algorithms Using Hadamard Product of Polynomials. 436-463 - Noga Alon, Clara Shikhelman:
Additive Approximation of Generalized Turán Questions. 464-481 - Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. 482-509 - Julien Baste, Dimitrios M. Thilikos:
Contraction Bidimensionality of Geometric Intersection Graphs. 510-531 - José Arturo Gil, Simone Santini:
Matching Regular Expressions on uncertain data. 532-564
Volume 84, Number 3, March 2022
- Mai Alzamel, Costas S. Iliopoulos, Dimitrios Letsios, Nicola Prezza:
Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW). 565 - Aleksander Kedzierski, Jakub Radoszewski:
k-Approximate Quasiperiodicity Under Hamming and Edit Distance. 566-589 - Avivit Levy, B. Riva Shalom:
A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges. 590-638 - Lavinia Egidi, Felipe A. Louza, Giovanni Manzini:
Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs. 639-669 - Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Minimal Unique Substrings for a Sliding Window. 670-693 - Diego Arroyuelo, Rajeev Raman:
Adaptive Succinctness. 694-718 - Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu:
Safety in s-t Paths, Trails and Walks. 719-741 - Oleg Merkurev, Arseny M. Shur:
Computing The Maximum Exponent in a Stream. 742-756 - Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno:
Enumeration of Maximal Common Subsequences Between Two Strings. 757-783 - Daniel Gibney, Sharma V. Thankachan:
On the Complexity of Recognizing Wheeler Graphs. 784-814 - Spyros C. Kontogiannis, Dorothea Wagner, Christos D. Zaroliagis:
An Axiomatic Approach to Time-Dependent Shortest Path Oracles. 815-870
Volume 84, Number 4, April 2022
- Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of (A, ℓ )-Path Packing. 871-895 - Pawel Gawrychowski, Tatiana Starikovskaya:
Streaming Dictionary Matching with Mismatches. 896-916 - Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh:
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees. 917-960 - Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi:
Parameter Analysis for Guarding Terrains. 961-981 - Wenjun Li, Chao Xu, Yongjie Yang, Jianer Chen, Jianxin Wang:
A Refined Branching Algorithm for the Maximum Satisfiability Problem. 982-1006 - Dan Alistarh, Giorgi Nadiradze, Amirmojtaba Sabour:
Dynamic Averaging Load Balancing on Cycles. 1007-1029 - Julien Bensmail, Foivos Fioravantes, Nicolas Nisse:
On Proper Labellings of Graphs with Minimum Label Sum. 1030-1063 - Boris Klemz, Günter Rote:
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs. 1064-1080 - Pawel Gawrychowski, Florin Manea, Radoslaw Serafin:
Fast and Longest Rollercoasters. 1081-1106 - Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa:
Posimodular Function Optimization. 1107-1131 - Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan:
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. 1132-1162 - Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno:
Linear-Time Recognition of Double-Threshold Graphs. 1163-1181
Volume 84, Number 5, May 2022
- Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron:
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. 1183-1212 - Adrian Dumitrescu, Csaba D. Tóth:
Online Unit Clustering and Unit Covering in Higher Dimensions. 1213-1231 - Yaqiao Li, Vishnu V. Narayan, Denis Pankratov:
Online Coloring and a New Type of Adversary for Online Graph Problems. 1232-1251 - Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian:
On Approximating Degree-Bounded Network Design Problems. 1252-1278 - Kazuya Haraguchi, Hiroshi Nagamochi:
Enumeration of Support-Closed Subsets in Confluent Systems. 1279-1315 - Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen:
Local Routing in Sparse and Lightweight Geometric Graphs. 1316-1340 - Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz:
Faster Minimization of Tardy Processing Time on a Single Machine. 1341-1356 - Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
Randomized Online Computation with High Probability Guarantees. 1357-1384 - Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle:
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width. 1385-1417 - Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski:
Efficient Computation of Sequence Mappability. 1418-1440 - Chenglin Fan, Benjamin Raichel, Gregory Van Buskirk:
Metric Violation Distance: Hardness and Approximation. 1441-1465
Volume 84, Number 6, June 2022
- Mohammad Ali Abam, Mark de Berg, Sina Farahzad, Mir Omid Haji Mirsadeghi, Morteza Saghafian:
Preclustering Algorithms for Imprecise Points. 1467-1489 - Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol:
Multidimensional Period Recovery. 1490-1510 - Zeev Nutov:
Approximating k-Connected m-Dominating Sets. 1511-1525 - Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná:
On 3-Coloring of (2P4, C5)-Free Graphs. 1526-1547 - Pratibha Choudhary:
Polynomial Time Algorithms for Tracking Path Problems. 1548-1570 - Johannes Lengler, Frank Neumann:
Editorial. 1571-1572 - Denis Antipov, Benjamin Doerr, Vitalii Karavaev:
A Rigorous Runtime Analysis of the (1 + (λ , λ )) GA on Jump Functions. 1573-1602 - Pietro S. Oliveto, Dirk Sudholt, Carsten Witt:
Tight Bounds on the Expected Runtime of a Standard Steady State Genetic Algorithm. 1603-1658 - Benjamin Doerr:
Does Comma Selection Help to Cope with Local Optima? 1659-1693 - Amirhossein Rajabi, Carsten Witt:
Self-Adjusting Evolutionary Algorithms for Multimodal Optimization. 1694-1723 - Denis Antipov, Maxim Buzdalov, Benjamin Doerr:
Fast Mutation in Crossover-Based Algorithms. 1724-1761 - Maxim Buzdalov, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov:
Fixed-Target Runtime Analysis. 1762-1793
Volume 84, Number 7, July 2022
- Daryl Funk, Dillon Mayhew, Mike Newman:
Tree Automata and Pigeonhole Classes of Matroids: I. 1795-1834 - Siu-Wing Cheng, Yuchen Mao:
Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm. 1835-1874 - Hiroshi Hirai, Yuni Iwamasa:
Reconstructing Phylogenetic Trees from Multipartite Quartet Systems. 1875-1896 - Mario Ullrich, Jan Vybíral:
Deterministic Constructions of High-Dimensional Sets with Small Dispersion. 1897-1915 - Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen:
Relaxing the Irrevocability Requirement for Online Graph Algorithms. 1916-1951 - Dawei Huang, Seth Pettie:
Approximate Generalized Matching: f-Matchings and f-Edge Covers. 1952-1992 - Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing:
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality. 1993-2027 - Surender Baswana, Shiv Kumar Gupta, Ayush Tulsyan:
Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient. 2028-2049 - Sander Borst, Leo van Iersel, Mark Jones, Steven Kelk:
New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees. 2050-2087 - Paniz Abedin, Sahar Hooshmand, Arnab Ganguly, Sharma V. Thankachan:
The Heaviest Induced Ancestors Problem: Better Data Structures and Applications. 2088-2105 - Jungho Ahn, Eun Jung Kim, Euiwoong Lee:
Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion. 2106-2133
Volume 84, Number 8, August 2022
- Markus Chimani, Niklas Troost, Tilo Wiedera:
Approximating Multistage Matching Problems. 2135-2153 - Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew:
Conflict-Free Coloring Bounds on Open Neighborhoods. 2154-2185 - Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos:
Efficient Parameter Estimation of Truncated Boolean Product Distributions. 2186-2221 - Marinus Gottschau, Marilena Leichter:
Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability. 2222-2239 - Yixin Cao, Marcin Pilipczuk:
Preface to the Special Issue on Parameterized and Exact Computation. 2240-2241 - Tuukka Korhonen:
Finding Optimal Triangulations Parameterized by Edge Clique Cover. 2242-2270 - Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa:
Vertex Deletion into Bipartite Permutation Graphs. 2271-2291 - Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma:
Parameterized Complexity of Directed Spanner Problems. 2292-2308 - Jesper Nederlof, Céline M. F. Swennenhuis:
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. 2309-2334 - Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot:
Structural Parameterizations with Modulator Oblivion. 2335-2357 - Marcelo Garlet Milani:
A Polynomial Kernel for Funnel Arc Deletion Set. 2358-2378 - Yasuaki Kobayashi, Yota Otachi:
Parameterized Complexity of Graph Burning. 2379-2393
Volume 84, Number 9, September 2022
- Kyle Fox, Xinyi Li:
Approximating the Geometric Edit Distance. 2395-2413 - Frank Kammer, Johannes Meintrup, Andrej Sajenko:
Space-Efficient Vertex Separators for Treewidth. 2414-2461 - Mirmahdi Rahgoshay, Mohammad R. Salavatipour:
Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment. 2462-2479 - Clemens Heuberger, Daniel Krenn, Gabriel F. Lipnik:
Asymptotic Analysis of q-Recursive Sequences. 2480-2532 - Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse:
The Largest Connected Subgraph Game. 2533-2555 - Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Universal Slope Sets for Upward Planar Drawings. 2556-2580 - Yoshifumi Sakai, Shunsuke Inenaga:
A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. 2581-2596 - Thomas Bosman, Martijn van Ee, Yang Jiao, Alberto Marchetti-Spaccamela, R. Ravi, Leen Stougie:
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times. 2597-2621 - Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh:
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. 2622-2641 - Guozhen Rong, Yixin Cao, Jian-xin Wang, Zhifeng Wang:
Graph Searches and Their End Vertices. 2642-2666 - Karthekeyan Chandrasekaran, Weihang Wang:
ℓ p-Norm Multiway Cut. 2667-2701 - Surender Baswana, Shiv Kumar Gupta, Till Knollmann:
Mincut Sensitivity Data Structures for the Insertion of an Edge. 2702-2734 - Dominik Köppl, Simon J. Puglisi, Rajeev Raman:
Fast and Simple Compact Hashing via Bucketing. 2735-2766 - Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Component Order Connectivity in Directed Graphs. 2767-2784
Volume 84, Number 10, October 2022
- Tzvi Alon, Nir Halman:
Strongly Polynomial FPTASes for Monotone Dynamic Programs. 2785-2819 - Shinwoo An, Eunjin Oh:
Reachability Problems for Transmission Graphs. 2820-2841 - Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini:
On Subgraph Complementation to H-free Graphs. 2842-2870 - Jakob Keller, Christian Rieck, Christian Scheffer, Arne Schmidt:
Particle-Based Assembly Using Precise Global Control. 2871-2897 - Bart de Keijzer, Dominik Wojtczak:
Facility Reallocation on the Line. 2898-2925 - Robert Krauthgamer, David Reitblat:
Almost-Smooth Histograms and Sliding-Window Graph Algorithms. 2926-2953 - Sándor P. Fekete, Eike Niehs, Christian Scheffer, Arne Schmidt:
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots. 2954-2986 - Arnold Filtser, Ofer Neiman:
Light Spanners for High Dimensional Norms via Stochastic Decompositions. 2987-3007 - Nicola Rizzo, Alexandru I. Tomescu, Alberto Policriti:
Solving String Problems on Graphs Using the Labeled Direct Product. 3008-3033 - Ziyun Huang, Qilong Feng, Jianxin Wang, Jinhui Xu:
Small Candidate Set for Translational Pattern Search. 3034-3053 - Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Naifeng Liu:
Algorithms for the Unit-Cost Stochastic Score Classification Problem. 3054-3074 - Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Parameterized Complexity of Maximum Edge Colorable Subgraph. 3075-3100 - Moran Feldman:
Correction to: Guess Free Maximization of Submodular and Linear Sums. 3101-3102 - Leszek Gasieniec, Ralf Klasing, Tomasz Radzik:
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. 3103-3106
Volume 84, Number 11, November 2022
- Petr A. Golovach, Meirav Zehavi:
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. 3107-3109 - Shaohua Li, Marcin Pilipczuk:
Hardness of Metric Dimension in Graphs of Constant Treewidth. 3110-3155 - Haozhe An, Mohit Gurumukhani, Russell Impagliazzo, Michael Jaber, Marvin Künnemann, Maria Paula Parga Nina:
The Fine-Grained Complexity of Multi-Dimensional Ordering Properties. 3156-3191 - Guillaume Ducoffe:
Optimal Centrality Computations Within Bounded Clique-Width Graphs. 3192-3222 - Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros:
Dynamic Data Structures for Timed Automata Acceptance. 3223-3245 - Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma:
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. 3246-3275 - Vikraman Arvind, Venkatesan Guruswami:
CNF Satisfiability in a Subspace and Related Problems. 3276-3299 - Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant:
Twin-width and Polynomial Kernels. 3300-3337 - Gabriel Bathie, Nicolas Bousquet, Yixin Cao, Yuping Ke, Théo Pierron:
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes. 3338-3364 - Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau:
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds. 3365-3406 - Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk:
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. 3407-3458 - Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau:
Dynamic Kernels for Hitting Sets and Set Packing. 3459-3488 - Guillaume Ducoffe:
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width. 3489-3520
Volume 84, Number 12, December 2022
- Editor's Note: Special Issue Dedicated to the 14th Latin American Theoretical Informatics Symposium. 3521
- Lehilton Lelis Chaves Pedrosa, Hugo Kooki Kasuya Rosado:
A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem. 3522-3558 - Gill Barequet, Mira Shalah:
Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes. 3559-3586 - Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov:
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. 3587-3602 - Kazuya Shimizu, Ryuhei Mori:
Exponential-Time Quantum Algorithms for Graph Coloring Problems. 3603-3621 - Khaled M. Elbassioni:
Approximation Algorithms for Cost-robust Discrete Minimization Problems Based on their LP-Relaxations. 3622-3654 - Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman:
Monotone Circuit Lower Bounds from Robust Sunflowers. 3655-3685 - Louisa Seelbach Benkner, Stephan G. Wagner:
Distinct Fringe Subtrees in Random Trees. 3686-3728
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-10-29 01:28 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:
