Journal: Algorithmica

Volume 87, Issue 9

1223 -- 1246Cléophée Robin, Eileen Robinson. Coloring Bridge-Free Antiprismatic Graphs
1247 -- 1273Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa. Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
1274 -- 1310Mario Alejandro Hevia Fajardo, Per Kristian Lehre. How Fitness Aggregation Methods Affect the Performance of Competitive CoEAs on Bilinear Problems
1311 -- 1339Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono 0001. Reallocation Problems with Minimum Completion Time
1340 -- 1368Klaus Heeger, Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay. Fair Repetitive Interval Scheduling

Volume 87, Issue 8

1111 -- 1144Daniel Funke, Demian Hespe, Peter Sanders 0001, Sabine Storandt, Carina Truschel. Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
1145 -- 0. Editor's Note: Special Issue on GECCO 2023
1146 -- 1177Tatsuya Gima, Eun Jung Kim 0002, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis. Bandwidth Parameterized by Cluster Vertex Deletion Number
1178 -- 1198Ragesh Jaiswal, Amit Kumar 0001. Clustering What Matters in Constrained Settings
1199 -- 1221Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries. Matching Cuts in Graphs of High Girth and H-Free Graphs

Volume 87, Issue 7

983 -- 1007Jonas Lill, Kalina Petrova, Simon Weber 0001. Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound
1008 -- 1039Bodo Manthey, Jesse van Rhijn. Improved Smoothed Analysis of 2-Opt for the Euclidean TSP
1040 -- 1059Yusuke Kobayashi 0001, Ryoga Mahara, Tamás Schwarcz. Reconfiguration of the Union of Arborescences
1060 -- 1080André van Renssen, Yuan Sha, Yucheng Sun, Sampson Wong. The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
1081 -- 1110Per Kristian Lehre, Andrew M. Sutton. Runtime Analysis with Variable Cost

Volume 87, Issue 6

813 -- 841Nicole Megow, Lukas Nölke. Online Metric Matching on the Line with Recourse
842 -- 907Yongjie Yang 0001. On the Parameterized Complexity of Controlling Amendment and Successive Winners
908 -- 929Haitao Wang, Yiming Zhao. Improved Algorithms for Distance Selection and Related Problems
930 -- 960Carlos Alegría-Galicia, Susanna Caroppo, Giordano Da Lozzo, Marco D'Elia, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani. Upward Pointset Embeddings of Planar st-Graphs
961 -- 981Giuseppe F. Italiano, Athanasios L. Konstantinidis, Charis Papadopoulos. Structural Parameterization of Cluster Deletion

Volume 87, Issue 5

621 -- 660Michal Wlodarczyk 0001. Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
661 -- 689Tobias Friedrich 0001, Timo Kötzing, Aneta Neumann, Frank Neumann 0001, Aishwarya Radhakrishnan. Analysis of the (1+1) EA on LeadingOnes with Constraints
690 -- 711Eric Rivals, Michelle Sweering, Pengfei Wang 0014. Convergence of the Number of Period sets in Strings
712 -- 735Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney. Enumerating Minimal Solution Sets for Metric Graph Problems
736 -- 782Jessica A. Enright, Kitty Meeks, Hendrik Molter. Counting Temporal Paths
783 -- 811Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer 0001. Simultaneous Representation of Proper and Unit Interval Graphs
812 -- 0Elahe Ghasemi, Vincent Jugé, Ghazal Khalighinejad, Helia Yazdanyar. Correction: Galloping in Fast-Growth Natural Merge Sorts

Volume 87, Issue 4

465 -- 506Hans L. Bodlaender, Carla Groenland, Hugo Jacob 0001, Lars Jaffke, Paloma T. Lima. XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure
507 -- 536Frank Neumann 0001, Dirk Sudholt, Carsten Witt. The Compact Genetic Algorithm Struggles on Cliff Functions
537 -- 571Samuel Baguley, Tobias Friedrich 0001, Aneta Neumann, Frank Neumann 0001, Marcus Pappik, Ziena Zeif. Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem
572 -- 593Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt 0001. Guarding Polyominoes Under k-Hop Visibility
594 -- 620Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki. Reforming an Envy-Free Matching

Volume 87, Issue 3

321 -- 343Jurek Czyzowicz, Leszek Gasieniec, Ryan Killick, Evangelos Kranakis. Symmetry Breaking in the Plane
344 -- 376Thomas Bläsius, Max Göttlicher. An Efficient Algorithm for Power Dominating Set
377 -- 404Pedro Montealegre 0001, Diego Ramírez-Romero, Ivan Rapaport. Shared Versus Private Randomness in Distributed Interactive Proofs
405 -- 428Kamal Eyubov, Marcelo Fonseca Faraj, Christian Schulz 0003. FREIGHT: Fast Streaming Hypergraph Partitioning
429 -- 464Matthew Johnson 0002, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen. Complexity Framework for Forbidden Subgraphs I: The Framework

Volume 87, Issue 2

167 -- 190Susanne Albers, Sebastian Schubert. Optimal Algorithms for Online b-Matching with Variable Vertex Capacities
191 -- 222Guillaume Bagan, Éric Duchêne, Valentin Gledel, Tuomo Lehtilä, Aline Parreau. Partition Strategies for the Maker-Breaker Domination Game
223 -- 241Pankaj K. Agarwal, Esther Ezra. Line Intersection Searching Amid Unit Balls in 3-Space
242 -- 291Elahe Ghasemi, Vincent Jugé, Ghazal Khalighinejad, Helia Yazdanyar. Galloping in Fast-Growth Natural Merge Sorts
292 -- 320Telikepalli Kavitha. Popular Roommates in Simply Exponential Time

Volume 87, Issue 12

1711 -- 1731Karthik C. S. 0001, Euiwoong Lee, Pasin Manurangsi. On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
1732 -- 1803Minglong Qin, Penghui Yao. Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States
1804 -- 1863Joost Jorritsma, Johannes Lengler, Dirk Sudholt. Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima
1864 -- 1898N. R. Aravind, Roopam Saxena. Parameterized Complexity of Path Set Packing
1899 -- 1932Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee 0001. Log-Diameter MST Verification and Sensitivity in MPC
1933 -- 1996Jeffrey Kam, Shahin Kamali, Avery Miller, Naomi Nishimura. Reconfiguration of Multisets with Applications to Bin Packing
1997 -- 2017Boris Aronov, Mark de Berg, Leonidas Theocharous. A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb {R}^2$

Volume 87, Issue 11

1477 -- 1517Alexander Lindermayr, Nicole Megow, Bertrand Simon 0001. Boosting Double Coverage for k-Server via Imperfect Predictions
1518 -- 1563Marvin Künnemann, Bodo Manthey, Rianne Veenstra. Smoothed Analysis of the 2-Opt Heuristic for the TSP under Gaussian Noise
1564 -- 1619Andre Opris, Johannes Lengler, Dirk Sudholt. k by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
1620 -- 1668Hans-Peter Lehmann, Peter Sanders 0001, Stefan Walzer. ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
1669 -- 1709Václav Blazej, Satyabrata Jana, M. S. Ramanujan 0001, Peter Strulo. On the Parameterized Complexity of Eulerian Strong Component Arc Deletion

Volume 87, Issue 10

1369 -- 1392Seungbum Jo, Geunho Kim. Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries
1393 -- 1419Ioannis Mantas, Evanthia Papadopoulou, Rodrigo I. Silveira, Zeyu Wang. The Farthest Color Voronoi Diagram in the Plane
1420 -- 1452Anna Arutyunova, Heiko Röglin. The Price of Hierarchical Clustering
1453 -- 1473Baruch Schieber, Bhargav Samineni, Soroush Vahidi. Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput
1474 -- 1475Yongjie Yang. Correction: On the Parameterized Complexity of Controlling Amendment and Successive Winners

Volume 87, Issue 1

1 -- 21Yansong Gao, Jie Zhang 0008. On Scheduling Mechanisms Beyond the Worst Case
22 -- 88Dániel Marx, Govind S. Sankar, Philipp Schepper. Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
89 -- 131Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young. Online Paging with Heterogeneous Cache Slots
132 -- 147Ahmad Biniaz, Anil Maheshwari, Michiel Smid. Euclidean Maximum Matchings in the Plane - Local to Global
148 -- 165Huong Luu 0001, Marek Chrobak. Better Hardness Results for the Minimum Spanning Tree Congestion Problem