Journal: Algorithmica

Volume 88, Issue 3

36 -- 0Tamal K. Dey, Tao Hou 0002, Dmitriy Morozov. A Fast Algorithm for Computing Zigzag Representatives
37 -- 0Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono. A General Technique for Searching in Implicit Sets via Function Inversion
38 -- 0Elena Grigorescu, Nithish Kumar, Young-San Lin. Approximation Algorithms for Directed Weighted Spanners
39 -- 0Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis. Parameterized Complexities of Dominating and Independent Set Reconfiguration
40 -- 0Ofek Gila, Michael T. Goodrich, Robert E. Tarjan. Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent
41 -- 0Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek. Fast and Simple Sorting Using Partial Information
42 -- 0Panagiotis Kanellopoulos, Alexandros A. Voudouris. Constrained Truthful Obnoxious Two-Facility Location with Optional Preferences
43 -- 0Tomer Ezra, Stefano Leonardi 0001, Michal Pawlowski, Matteo Russo, Seeun William Umboh. Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment
44 -- 0Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis, Hilde Verbeek 0001. Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast
45 -- 0Haris Aziz 0001, Péter Biró 0001, Gergely Csáji, Ali Pourmiri. Ex-post Stability under Two-Sided Matching: Complexity and Characterization
46 -- 0Marten Folkertsma, Ian Mertz, Florian Speelman, Quinten Tupker. Fully Characterizing Lossy Catalytic Computation
47 -- 0Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma. Computing Pivot-Minors

Volume 88, Issue 2

20 -- 0Alexander Dobler, Martin Nöllenburg. Block Crossings in One-Sided Tanglegrams
21 -- 0Sharmila Duppala, George Z. Li, Juan Luque, Aravind Srinivasan, Renata Valieva. Concentration of Submodular Functions and Read-k Families Under Negative Dependence
22 -- 0Gabriel Ponte, Marcia Fampa, Jon Lee 0001. Convex relaxation for the generalized maximum-entropy sampling problem
23 -- 0Vijay V. Vazirani. Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem Under Small Bids
24 -- 0Stéphane Devismes, Yoann Dieudonné, Arnaud Labourel. Graph Exploration: The Impact of a Distance Constraint
25 -- 0Daniel Hathcock, Guy Kortsarz, R. Ravi 0001. The Telephone k-Multicast Problem
26 -- 0Théo Boury, Laurent Bulteau, Bertrand Marchand, Yann Ponty. Bipartite Independent Set Reconfiguration: General and RNA-Inspired Parameterized Algorithms
27 -- 0Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savic, Carlos Seara, Martin Suderland. The Voronoi Diagram of Rotating Rays with Applications to Floodlight Illumination
28 -- 0Dominique Attali, André Lieutier. 1-Norm Minimization
29 -- 0Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman 0001. Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable
30 -- 0Telikepalli Kavitha. Max-Utility Matchings with Popularity via Critical Vertices
31 -- 0Ildikó Schlotter. Shortest Two Disjoint Paths in Conservative Graphs
32 -- 0Duc-Cuong Dang, Per Kristian Lehre. The SLO Hierarchy of Pseudo-Boolean Functions and Runtime of Evolutionary Algorithms
33 -- 0Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman 0001, Saurabh Ray. Sweeping Arrangements of Non-Piercing Regions in the Plane
34 -- 0Zachary Friggstad, Mahya Jamshidian. Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii
35 -- 0Feodor F. Dragan, Guillaume Ducoffe , Michel Habib, Laurent Viennot. Correction: Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs

Volume 88, Issue 1

1 -- 0Michaela Borzechowski, Patrick Schnider, Simon Weber 0001. An FPT Algorithm for Splitting a Necklace Among Two Thieves
2 -- 0Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev. Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
3 -- 0Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber. Geometric Thickness of Multigraphs is $\exists \mathbb {R}$-Complete
4 -- 0Therese Biedl, Karthik Murali 0001. On computing vertex connectivity of 1-planar graphs
5 -- 0Martin S. Krejca, Carsten Witt. A Flexible Evolutionary Algorithm with Dynamic Mutation Rate Archive
6 -- 0Haitao Wang 0001, Yiming Zhao. Computing the Minimum Bottleneck Moving Spanning Tree
7 -- 0Felicia Lucke, Ali Momeni 0003, Daniël Paulusma, Siani Smith. Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
8 -- 0Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider. From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
9 -- 0Katrin Casel, Tobias Friedrich 0001, Aikaterini Niklanovits, Kirill Simonov, Ziena Zeif. Combining Crown Structures for Vulnerability Measures
10 -- 0Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre 0001, Ivan Rapaport, Ioan Todinca. Distributed Model Checking on Graphs of Bounded Treedepth
11 -- 0Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt. Recognition Complexity of Subgraphs of bf k-Connected Planar Cubic Graphs
12 -- 0Andreas Emil Feldmann, Tung Anh Vu. Generalized k-Center: Distinguishing Doubling and Highway Dimension
13 -- 0Feodor F. Dragan, Guillaume Ducoffe , Michel Habib, Laurent Viennot. Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
14 -- 0Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov 0001, Carolin Rehs, André van Renssen, Sampson Wong. Oriented Spanners
15 -- 0Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Akira Suzuki 0001. Reconfiguration of Time-Respecting Arborescences
16 -- 0Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek. 2 and $tC_3 \uplus C_4$
17 -- 0Johannes Lengler, Leon Schiller, Oliver Sieberling. Plus Strategies are Exponentially Slower for Planted Optima of Random Height
18 -- 0Florent Becker, Daniel Hader, Matthew J. Patitz. Strict Self-Assembly of Discrete Self-Similar Fractals in the Abstract Tile Assembly Model
19 -- 0Antonio Blanca, Xusheng Zhang. Rapid Mixing of Global Markov Chains via Spectral Independence: The Unbounded Degree Case