External Links

    Journal: Algorithmica

    Volume 83, Issue 9

    2651 -- 2677Florent Foucaud, Benjamin Gras 0002, Anthony Perez 0001, Florian Sikora. On the Complexity of Broadcast Domination and Multipacking in Digraphs
    2678 -- 2696Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto. Strongly Stable and Maximum Weakly Stable Noncrossing Matchings
    2697 -- 2718Toru Hasunuma. Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
    2719 -- 2753Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith. Online Node- and Edge-Deletion Problems with Advice
    2754 -- 2802Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche. Finding Temporal Paths Under Waiting Time Constraints
    2803 -- 2832Susanne Albers, Maximilian Janke. Scheduling in the Random-Order Model
    2833 -- 2858Susanne Albers, Arindam Khan 0001, Leon Ladewig. Best Fit Bin Packing with Random Order Revisited
    2859 -- 2894Iqra Altaf Gillani, Amitabha Bagchi. A Queueing Network-Based Distributed Laplacian Solver
    2895 -- 2913Yiannis Giannakopoulos, Alexander Hammerl, Diogo Poças. A New Lower Bound for Deterministic Truthful Scheduling
    2914 -- 2951Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad. On Girth and the Parameterized Complexity of Token Sliding and Token Jumping
    2952 -- 2988Leah Epstein, Elena Kleiman. Selfish Vector Packing
    2989 -- 3014Dror Rawitz, Adi Rosén. Online Budgeted Maximum Coverage

    Volume 83, Issue 8

    2333 -- 2350Florian Hörsch, Zoltán Szigeti. The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects
    2351 -- 2373Rémy Belmonte, Ignasi Sau. On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings
    2374 -- 2399Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller. Online Multistage Subset Maximization Problems
    2400 -- 2426Douglas Soares Gonçalves, Carlile Lavor, Leo Liberti, Michael Souza 0001. KDMDGP Subclass of Distance Geometry Problems with Exact Distances
    2427 -- 2468Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu. The Maximum Binary Tree Problem
    2469 -- 2470Bart M. P. Jansen, Jan Arne Telle. Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation
    2471 -- 2502Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta 0002. C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width
    2503 -- 2520Yoichi Iwata, Yusuke Kobayashi 0001. Improved Analysis of Highest-Degree Branching for Feedback Vertex Set
    2521 -- 2551Gregory Rosenthal. Beating Treewidth for Average-Case Subgraph Isomorphism
    2552 -- 2577Benjamin Aram Berendsohn, László Kozma 0002, Dániel Marx. Finding and Counting Permutations via CSPs
    2578 -- 2605Marco Bressan 0002. Faster algorithms for counting subgraphs in sparse graphs
    2606 -- 2633Édouard Bonnet, Nidhi Purohit. Metric Dimension Parameterized By Treewidth
    2634 -- 2650Jana Novotná 0001, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs

    Volume 83, Issue 7

    1953 -- 1979Shu Zhang, Daming Zhu, Haitao Jiang, Jiong Guo, Haodi Feng, Xiaowen Liu. Sorting a Permutation by Best Short Swaps
    1980 -- 2017Kook Jin Ahn, Graham Cormode, Sudipto Guha, Andrew McGregor 0001, Anthony Wirth. Correlation Clustering in Data Streams
    2018 -- 2046Athanasios L. Konstantinidis, Charis Papadopoulos. Cluster Deletion on Interval Graphs and Split Related Graphs
    2047 -- 2062János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin. A New Lower Bound for Classic Online Bin Packing
    2063 -- 2095Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller, Dorine Tabary. Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds
    2096 -- 2141Eun Jung Kim 0002, O-joung Kwon. A Polynomial Kernel for Distance-Hereditary Vertex Deletion
    2142 -- 2169Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. Internal Dictionary Matching
    2170 -- 2214Fedor V. Fomin, Petr A. Golovach. Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
    2215 -- 2244Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre 0001, Ivan Rapaport, Éric Rémila, Ioan Todinca. Compact Distributed Certification of Planar Graphs
    2245 -- 2272Gill Barequet, Minati De, Michael T. Goodrich. Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
    2273 -- 2302Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi 0001, Michiel Smid. On the Minimum Consistent Subset Problem
    2303 -- 2331Arindam Biswas 0001, Venkatesh Raman 0001, Saket Saurabh 0001. Approximation in (Poly-) Logarithmic Space

    Volume 83, Issue 6

    1605 -- 1637Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan 0001. On Structural Parameterizations of the Edge Disjoint Paths Problem
    1638 -- 1652Jie Zhang 0008. Average-Case Approximation Ratio of Scheduling without Payments
    1653 -- 1676Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita. Optimal Matroid Partitioning Problems
    1677 -- 1706Guilherme de C. M. Gomes, Ignasi Sau. Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
    1707 -- 1733Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich. Range Majorities and Minorities in Arrays
    1734 -- 1749Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger. Dispersing Obnoxious Facilities on a Graph
    1750 -- 1785Susanne Albers, Arindam Khan 0001, Leon Ladewig. Improved Online Algorithms for Knapsack and GAP in the Random Order Model
    1786 -- 1828Jesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby, Wing-Kin Sung. Computing the Rooted Triplet Distance Between Phylogenetic Networks
    1829 -- 1860Marc Roth. Parameterized Counting of Partially Injective Homomorphisms
    1861 -- 1884Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi. A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs
    1885 -- 1917Sariel Har-Peled, Mitchell Jones, Saladi Rahul. Active-Learning a Convex Body in Low Dimensions
    1918 -- 1952José A. Soto, Claudio Telha. Independent Sets and Hitting Sets of Bicolored Rectangular Families

    Volume 83, Issue 5

    1165 -- 1200Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés. The Inverse Voronoi Problem in Graphs II: Trees
    1201 -- 1221Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan 0001. Towards a Polynomial Kernel for Directed Feedback Vertex Set
    1222 -- 1237Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang. Budget Feasible Mechanisms on Matroids
    1238 -- 1255Chi-Yeh Chen, Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng. Matching Cut in Graphs with Large Minimum Degree
    1256 -- 1315Marios Mavronicolas, Loizos Michael, Vicky Papadopoulou Lesta, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis. The Price of Defense
    1316 -- 1351Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán. Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
    1352 -- 1370Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann. Travelling on Graphs with Small Highway Dimension
    1371 -- 1392Marc Bury, Michele Gentili, Chris Schwiegelshohn, Mara Sorella. Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities
    1393 -- 1420Stéphane Bessy, Marin Bougeret, R. Krithika 0001, Abhishek Sahu, Saket Saurabh 0001, Jocelyn Thiebaut, Meirav Zehavi. Packing Arc-Disjoint Cycles in Tournaments
    1421 -- 1458Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza. Computing the Largest Bond and the Maximum Connected Cut of a Graph
    1459 -- 1492Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes. Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between
    1493 -- 1523Ágnes Cseh, Telikepalli Kavitha. Popular Matchings in Complete Graphs
    1524 -- 1543Erik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane. Approximating the Canadian Traveller Problem with Online Randomization
    1544 -- 1558Pat Morin. A Fast Algorithm for the Product Structure of Planar Graphs
    1559 -- 1603Britta Dorn, Ronald de Haan, Ildikó Schlotter. Obtaining a Proportional Allocation by Deleting Items

    Volume 83, Issue 4

    903 -- 905Anne Auger, Per Kristian Lehre. Preface to the Special Issue on Theory of Genetic and Evolutionary Computation
    906 -- 939Feng Shi 0003, Frank Neumann 0001, Jianxin Wang 0001. Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem
    940 -- 975Chao Qian 0001, Chao Bian, Yang Yu 0001, Ke Tang, Xin Yao 0001. Analysis of Noisy Evolutionary Optimization When Sampling Fails
    976 -- 1011Dirk Sudholt. Analysing the Robustness of Evolutionary Algorithms to Noise: Refined Runtime Bounds and an Example Where Noise is Beneficial
    1012 -- 1053Benjamin Doerr, Carsten Witt, Jing Yang 0016. Runtime Analysis for Self-adaptive Mutation Rates
    1054 -- 1095Denis Antipov, Benjamin Doerr. A Tight Runtime Analysis for the (μ + λ ) EA
    1096 -- 1137Johannes Lengler, Dirk Sudholt, Carsten Witt. The Complex Parameter Landscape of the Compact Genetic Algorithm
    1138 -- 1163Andrew M. Sutton. Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem

    Volume 83, Issue 3

    775 -- 0Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour. Special Issue on Algorithms and Data Structures (WADS 2019)
    776 -- 794Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti. Succinct Encodings for Families of Interval Graphs
    795 -- 821Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen. Online Bin Covering with Advice
    822 -- 852Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson 0002, Daniël Paulusma, Théo Pierron. 2)-Free Graphs: An Almost Complete Dichotomy
    853 -- 878Moran Feldman. Guess Free Maximization of Submodular and Linear Sums
    879 -- 902Chien-Chung Huang, Naonori Kakimura. Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint

    Volume 83, Issue 2

    413 -- 446Santanu Bhowmick, Tanmay Inamdar 0002, Kasturi R. Varadarajan. Fault-Tolerant Covering Problems in Metric Spaces
    447 -- 530Vittorio Bilò, Marios Mavronicolas. The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games
    531 -- 552Angel A. Cantu, Austin Luchsinger, Robert T. Schweller, Tim Wylie. Covert Computation in Self-Assembled Circuits
    553 -- 575Zeev Nutov. On the Tree Augmentation Problem
    576 -- 588Ghurumuruhan Ganesan. Constrained Minimum Passage Time in Random Geometric Graphs
    589 -- 612Myriam Preissmann, Cléophée Robin, Nicolas Trotignon. On the Complexity of Colouring Antiprismatic Graphs
    613 -- 640Akira Matsubayashi. Non-Greedy Online Steiner Trees on Outerplanar Graphs
    641 -- 666Therese C. Biedl, Saeed Mehrabi 0001. On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth
    667 -- 694Harry Buhrman, Matthias Christandl, Michal Koucký 0001, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin. High Entropy Random Selection Protocols
    695 -- 725Diodato Ferraioli, Carmine Ventre. Approximation Guarantee of OSP Mechanisms: The Case of Machine Scheduling and Facility Location
    726 -- 752Robert Ganian, Sebastian Ordyniak. The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths
    753 -- 774Akanksha Agrawal, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. Simultaneous Feedback Edge Set: A Parameterized Perspective

    Volume 83, Issue 12

    3537 -- 3566Matthias Englert, David Mezlaf, Matthias Westermann. Online Makespan Scheduling with Job Migration on Uniform Machines
    3567 -- 3601Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán. Parameterized Complexity of Small Weight Automorphisms and Isomorphisms
    3602 -- 3628Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann. Top Tree Compression of Tries
    3629 -- 3648Mohammad Ali Abam, Mohammad Sadegh Borouny. Local Geometric Spanners
    3649 -- 3680Jan Kratochvíl, Tomás Masarík, Jana Novotná 0001. U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited
    3681 -- 3714Yuya Masumura, Taihei Oki, Yutaro Yamaguchi 0001. Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem
    3715 -- 3740Yong Chen 0002, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang. Approximation Algorithms for Maximally Balanced Connected Graph Partition
    3741 -- 3765Luis Evaristo Caraballo, Pablo Pérez-Lantero, Carlos Seara, Inmaculada Ventura. Maximum Box Problem on Stochastic Points

    Volume 83, Issue 11

    3281 -- 3318Steven Chaplick, Martin Töpfer 0002, Jan Voborník, Peter Zeman 0001. On H-Topological Intersection Graphs
    3319 -- 3337Michael Elkin, Ofer Neiman. Near Isometric Terminal Embeddings for Doubling Metrics
    3338 -- 3362Mathew C. Francis, Rian Neogi, Venkatesh Raman 0001. Recognizing k-Clique Extendible Orderings
    3363 -- 3378Arnold T. Saunders. A Class of Random Recursive Tree Algorithms with Deletion
    3379 -- 3402Seungbum Jo, Rahul Lingala, Srinivasa Rao Satti. Encoding Two-Dimensional Range Top-k Queries
    3403 -- 3431Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis. Connected Subgraph Defense Games
    3432 -- 3468José Fuentes Sepúlveda, Diego Seco, Raquel Viaña. Succinct Encoding of Binary Strings Representing Triangulations
    3469 -- 3490Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan. Network Design under General Wireless Interference
    3491 -- 3513Jongmin Choi, Sergio Cabello, Hee-Kap Ahn. Maximizing Dominance in the Plane and its Applications
    3514 -- 3533Joachim Gudmundsson, André van Renssen, Zeinab Saeidi, Sampson Wong. Translation Invariant Fréchet Distance Queries

    Volume 83, Issue 10

    3015 -- 3016. Editor's Note: Special Issue on Genetic and Evolutionary Computation
    3017 -- 3058Benjamin Doerr, Timo Kötzing. Multiplicative Up-Drift
    3059 -- 3107Benjamin Doerr. The Runtime of the Compact Genetic Algorithm on Jump Functions
    3108 -- 3147Benjamin Doerr, Carola Doerr, Johannes Lengler. Self-Adjusting Mutation Rates with Provably Optimal Success Rules
    3148 -- 3179Jakob Bossek, Frank Neumann 0001, Pan Peng 0001, Dirk Sudholt. Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem
    3180 -- 3208Andrew M. Sutton, Carsten Witt. Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs
    3209 -- 3237Frank Neumann 0001, Mojgan Pourhassan, Carsten Witt. Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint
    3238 -- 3280Per Kristian Lehre, Phan Trung Hai Nguyen. Runtime Analyses of the Population-Based Univariate Estimation of Distribution Algorithms on LeadingOnes

    Volume 83, Issue 1

    1 -- 44Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier. Parameterized Dynamic Cluster Editing
    45 -- 71Mong-Jen Kao. Iterative Partial Rounding for Vertex Cover with Hard Capacities
    72 -- 115Céline Chevalier, Fabien Laguillaumie, Damien Vergnaud. Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions
    116 -- 143Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber. Flip Distances Between Graph Orientations
    144 -- 176Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc. Building a Nest by an Automaton
    177 -- 215Amos Beimel, Kobbi Nissim, Uri Stemmer. Learning Privately with Labeled and Unlabeled Examples
    216 -- 251Maria Chudnovsky, Shenwei Huang, Sophie Spirkl, Mingxian Zhong. 3
    252 -- 296Victor Chepoi, Arnaud Labourel, Sébastien Ratel. Distance and Routing Labeling Schemes for Cube-Free Median Graphs
    297 -- 336Robert Ganian, Fabian Klute, Sebastian Ordyniak. On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
    337 -- 360Susanne Albers, Sebastian Schraink. Tight Bounds for Online Coloring of Basic Graph Classes
    361 -- 386Jeremy Kun, Michael P. O'Brien, Marcin Pilipczuk, Blair D. Sullivan. Polynomial Treedepth Bounds in Linear Colorings
    387 -- 412Sándor P. Fekete, Robert Gmyr, Sabrina Hugo, Phillip Keldenich, Christian Scheffer, Arne Schmidt 0001. CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata
    runs on