Journal: Algorithmica

Volume 85, Issue 9

2529 -- 2553Vlady Ravelomanana, Ny Aina Andriambolamalala. Transmitting Once to Elect a Leader on Wireless Networks
2554 -- 2579Balagopal Komarath, Anurag Pandey 0001, Chengot Sankaramenon Rahul. Monotone Arithmetic Complexity of Graph Homomorphism Polynomials
2580 -- 2604Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen. Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
2605 -- 2666Walter Didimo, Michael Kaufmann 0001, Giuseppe Liotta, Giacomo Ortali. Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time
2667 -- 2692Patrizio Angelini, Michael A. Bekos, Henry Förster, Martin Gronemann. Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario
2693 -- 2734Amey Bhangale, Aleksa Stankovic. Max-3-Lin Over Non-abelian Groups with Universal Factor Graphs
2735 -- 2778Arindam Khan 0001, Eklavya Sharma. Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items
2779 -- 2816Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi 0001, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa. Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints
2817 -- 2842Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis. MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems
2843 -- 2884Shunhua Jiang, Bento Natura, Omri Weinstein. A Faster Interior-Point Method for Sum-of-Squares Optimization
2885 -- 2921Matteo Castiglioni, Andrea Celli, Nicola Gatti 0001. Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive

Volume 85, Issue 8

2189 -- 2213Alberto Del Pia, Silvia Di Gregorio. On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs
2214 -- 2237Mincheol Kim, Chanyang Seo, Taehoon Ahn 0001, Hee-Kap Ahn. Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles
2238 -- 2259Asaf Levin. Online Minimization of the Maximum Starting Time: Migration Helps
2260 -- 2317Shyan Akmal, Ce Jin 0001. Near-Optimal Quantum Algorithms for String Problems
2318 -- 2347Felix Reidl, Blair D. Sullivan. A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes
2348 -- 2362Muhammad Faisal Nadeem, Hamza Iqbal, Hafiz Muhammad Afzal Siddiqui, Muhammad Azeem 0002. Intersecting Longest Cycles in Archimedean Tilings
2363 -- 2394Yiqin Gao, Yves Robert, Frédéric Vivien. Resource-Constrained Scheduling Algorithms for Stochastic Independent Tasks With Unknown Probability Distribution
2395 -- 2426Shyan Akmal, Lijie Chen 0001, Ce Jin 0001, Malvika Raj, R. Ryan Williams. Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity
2427 -- 2453David Caballero, Timothy Gomez, Robert T. Schweller, Tim Wylie. Unique Assembly Verification in Two-Handed Self-Assembly
2454 -- 2481Jesse Beisegel, Ekkehard Köhler, Robert Scheffler 0001, Martin Strehler 0001. Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs
2482 -- 2484Yoshiharu Kohayakawa, Flávio Keidi Miyazawa. Guest Editorial: Special Issue on Theoretical Informatics
2485 -- 2514Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Pawel Pralat. Algorithms for p-Faulty Search on a Half-Line
2515 -- 2528Sergey Bereg. Computing Balanced Convex Partitions of Lines

Volume 85, Issue 7

1825 -- 1849Sayan Bandyapadhyay. Improved Bounds for Metric Capacitated Covering Problems
1850 -- 1882Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen. Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups
1883 -- 1911Kangsan Kim, Yongho Shin, Hyung-Chan An. Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center
1912 -- 1947Guilherme C. M. Gomes, Matheus R. Guedes, Vinícius Fernandes dos Santos. Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization
1948 -- 2000Di Chen, Mordecai J. Golin. Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows
2001 -- 2027Yossi Azar, Chay Machluf, Boaz Patt-Shamir, Noam Touitou. Competitive Vertex Recoloring
2028 -- 2064Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche. Multistage s-t Path: Confronting Similarity with Dissimilarity
2065 -- 2086Pranabendu Misra, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi. Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
2087 -- 2130Tobias Friedrich 0001, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko. Social Distancing Network Creation
2131 -- 2155Bruno Pasqualotto Cavalar, Zhenjian Lu. Algorithms and Lower Bounds for Comparator Circuits from Shrinkage
2156 -- 2187Tomohiro Koana, Christian Komusiewicz, Frank Sommer. Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

Volume 85, Issue 6

1521 -- 0. Special Issue on Algorithms and Computation (ISAAC 2021)
1522 -- 1559Mathew C. Francis, Pavol Hell, Dalu Jacob. On the Kernel and Related Problems in Interval Digraphs
1560 -- 1585Susanne Albers, Waldo Gálvez, Maximilian Janke. Machine Covering in the Random-Order Model
1586 -- 1623Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen. Algorithms and Complexity on Indexing Founder Graphs
1624 -- 1651Luciano Gualà, Stefano Leucci 0001, Isabella Ziccardi. Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees
1652 -- 1678Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous. Clique-Based Separators for Geometric Intersection Graphs
1679 -- 1705Joyce Bacic, Saeed Mehrabi 0001, Michiel Smid. Shortest Beer Path Queries in Outerplanar Graphs
1706 -- 1735Tomohiro Koana, Christian Komusiewicz, Frank Sommer. Essentially Tight Kernels for (Weakly) Closed Graphs
1736 -- 1737Meng He, Anna Lubiw, Mohammad R. Salavatipour. Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021)
1738 -- 1753David Eppstein. A Stronger Lower Bound on Parametric Minimum Spanning Trees
1754 -- 1785Joe Sawada, Aaron Williams. Constructing the first (and coolest) fixed-content universal cycle
1786 -- 1804Ioana O. Bercea, Guy Even. Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations
1805 -- 1823Pawel Gawrychowski, Przemyslaw Uznanski. Better Distance Labeling for Unweighted Planar Graphs

Volume 85, Issue 5

1111 -- 1155Robert Ganian, Sebastian Ordyniak, C. S. Rahul. Group Activity Selection with Few Agent Types
1156 -- 1175William J. Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat. Drawing Partial 2-Trees with Few Slopes
1176 -- 1201Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann 0001, Sergey Pupyrev. Lazy Queue Layouts of Posets
1202 -- 1250Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge. The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs
1251 -- 1286François Le Gall, Saeed Seddighin. Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems
1287 -- 1331Abolfazl Asudeh, Tanya Y. Berger-Wolf, Bhaskar DasGupta, Anastasios Sidiropoulos. Maximizing Coverage While Ensuring Fairness: A Tale of Conflicting Objectives
1332 -- 1371Moran Feldman, Zeev Nutov, Elad Shoham. Practical Budgeted Submodular Maximization
1372 -- 1414Alexander Birx, Yann Disser, Kevin Schewior. Improved Bounds for Open Online Dial-a-Ride on the Line
1415 -- 1458Leah Epstein, Loay Mualem. Online Bin Packing of Squares and Cubes
1459 -- 1489Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer. Fair Allocation of Indivisible Items with Conflict Graphs
1490 -- 1519Arnold Filtser, Omrit Filtser, Matthew J. Katz. Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic

Volume 85, Issue 4

831 -- 853Alberto Rojas Anríquez, Maya Stein. t-Free Graphs Without Short Odd Cycles
854 -- 878Manas Jyoti Kashyop, N. S. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri. Trade-Offs in Dynamic Coloring for Bipartite and General Graphs
879 -- 901Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner. Gapped Indexing for Consecutive Occurrences
902 -- 928Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai 0001, Pawel Rzazewski. Parameterized Inapproximability of Independent Set in H-Free Graphs
929 -- 964Sebastian Forster, Tijn de Vos. Faster Cut Sparsification of Weighted Graphs
965 -- 975Sariel Har-Peled, Mitchell Jones. Few Cuts Meet Many Point Sets
976 -- 991Miroslaw Kowaluk, Andrzej Lingas. Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs
992 -- 1028Riccardo Dondi, Manuel Lafond. On the Tractability of Covering a Graph with 2-Clubs
1029 -- 1066Seth Gilbert, Peter Robinson 0002, Suman Sourav. Leader Election in Well-Connected Graphs
1067 -- 1090Stephan Dominique Andres, François Dross, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski. The Complexity of Two Colouring Games
1091 -- 1110Maël Dumas, Anthony Perez 0001, Ioan Todinca. A Cubic Vertex-Kernel for Trivially Perfect Editing

Volume 85, Issue 3

639 -- 641Paola Flocchini, Lucia Moura. Selected Papers of the 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021
642 -- 664Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev. Combinatorics and Algorithms for Quasi-Chain Graphs
665 -- 687Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz. Composed Degree-Distance Realizations of Graphs
688 -- 716Benjamin Merlin Bumpus, Kitty Meeks. Edge Exploration of Temporal Graphs
717 -- 744Ben Cameron, Joe Sawada, Wei Therese, Aaron Williams. Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality
745 -- 761Niccolò Di Marco, Andrea Frosini, William Lawrence Kocay, Elisa Pergola, Lama Tarsissi. Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs
762 -- 782Martin Kucera, Ondrej Suchý. Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters
783 -- 804Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf. Non-Preemptive Tree Packing
805 -- 830Andrea Marino, Ana Silva 0001. Eulerian Walks in Temporal Graphs

Volume 85, Issue 2

325 -- 351Matthias Bentert, André Nichterlein. Parameterized Complexity of Diameter
352 -- 383Deniz Agaoglu Çagirici, Petr Hlinený. d-Graphs and T-Graphs
384 -- 405Ivan Bliznets, Danil Sagunov. n
406 -- 443Thomas Erlebach, Michael Hoffmann 0002, Murilo Santos de Lima. Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries
444 -- 491Júlio Araújo 0001, Marin Bougeret, Victor A. Campos, Ignasi Sau. Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets
492 -- 508Vincent Froese, Brijnesh J. Jain, Maciej Rymar, Mathias Weller. Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series
509 -- 543Konstantinos Tsakalidis, Sebastian Wild, Viktor Zamaraev. Succinct Permutation Graphs
544 -- 562Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou. An Improved Upper Bound on the Queue Number of Planar Graphs
563 -- 583Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman. Improved Algorithms for Scheduling Unsplittable Flows on Paths
584 -- 609Serge Gaspers, Edward J. Lee. Faster Graph Coloring in Polynomial Space
610 -- 637K. Subramani, Piotr Wojciechowski 0002. Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling

Volume 85, Issue 12

3487 -- 3520Thomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann. Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
3521 -- 3571Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani. Upward Book Embeddability of st-Graphs: Complexity and Algorithms
3572 -- 3601Eyal Nussbaum, Michael Segal 0001, Oles Holembovskyy. Finding Geometric Facilities with Location Privacy
3602 -- 3648Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski. Algebraic Restriction Codes and Their Applications
3649 -- 3679Max A. Deppert, Klaus Jansen, Arindam Khan 0001, Malin Rau, Malte Tutas. Peak Demand Minimization via Sliced Strip Packing
3680 -- 3716Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson. A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems
3717 -- 3740Sushmita Gupta, Pallavi Jain 0001, Saket Saurabh 0001, Nimrod Talmon. Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules
3741 -- 3765Peter Kiss. Deterministic Dynamic Matching in Worst-Case Update Time
3766 -- 3792Spyros Angelopoulos 0001, Christoph Dürr, Shendan Jin. Best-of-Both-Worlds Analysis of Online Search
3793 -- 3815Stefan Klootwijk, Bodo Manthey. Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics
3816 -- 3827Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore. On Colorful Vertex and Edge Cover Problems
3828 -- 3854Alexander Meiburg. Inapproximability of Positive Semidefinite Permanents and Quantum State Tomography
3855 -- 3888Dimitris Fotakis 0001, Anthimos Vardis Kandiros, Vasilis Kontonis, Stratis Skoulakis. Opinion Dynamics with Limited Information
3889 -- 3927Sumanta Banerjee, Juhi Chaudhary, Dinabandhu Pradhan. Unique Response Roman Domination: Complexity and Algorithms
3928 -- 3956Mark de Berg, Aleksandar Markovic 0001, Seeun William Umboh. The Online Broadcast Range-Assignment Problem
3957 -- 3972Robert Krauthgamer, Shay Sapir. Comparison of Matrix Norm Sparsification
3973 -- 3995Félix Hernández, Gerardo Vega. The Subfield and Extended Codes of a Subclass of Optimal Three-Weight Cyclic Codes

Volume 85, Issue 11

3325 -- 3326Md. Saidur Rahman 0001, Petra Mutzel, Slamin. Special Issue Dedicated to 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022
3327 -- 3347Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura. Happy Set Problem on Subclasses of Co-comparability Graphs
3348 -- 3375Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita. Path Cover Problems with Length Cost
3376 -- 3405Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno. Immunization in the Threshold Model: A Parameterized Complexity Study
3406 -- 3429Gaétan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith. The Complexity of L(p, q)-Edge-Labelling
3430 -- 3452Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi. Parameterized Complexity of Minimum Membership Dominating Set
3453 -- 3486Joshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch. Traversability, Reconfiguration, and Reachability in the Gadget Framework

Volume 85, Issue 10

2923 -- 2961Anselm Haak, Arne Meier, Om Prakash 0002, B. V. Raghavendra Rao. Parameterised Counting in Logspace
2962 -- 3002Júlio Araújo 0001, Julien Bensmail, Victor A. Campos, Frédéric Havet, Ana Karolinna Maia, Nicolas Nisse, Ana Silva 0001. On Finding the Best and Worst Orientations for the Metric Dimension
3003 -- 3023Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri. A General Framework for Enumerating Equivalence Classes of Solutions
3024 -- 3057Philip N. Klein, Claire Mathieu, Hang Zhou 0001. Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs
3058 -- 3087Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum. A Polynomial Kernel for 3-Leaf Power Deletion
3088 -- 3109Waldo Gálvez, Fabrizio Grandoni 0001, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan 0001, Malin Rau. A Tight (3/2+ε )-Approximation for Skewed Strip Packing
3110 -- 3143Yoann Dieudonné, Andrzej Pelc, Franck Petit. Almost Universal Anonymous Rendezvous in the Plane
3144 -- 3167Amit Deshpande 0001, Rameshwar Pratap. p Subspace Approximation and (k, p)-Clustering
3168 -- 3213Harold N. Gabow. Blocking Trails for f-factors of Multigraphs
3214 -- 3289Harold N. Gabow. A Weight-Scaling Algorithm for f-Factors of Multigraphs
3290 -- 3322Felicia Lucke, Daniël Paulusma, Bernard Ries. Finding Matching Cuts in H-Free Graphs
3323 -- 0Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya. Publisher Correction: Longest Common Substring with Approximately k Mismatches

Volume 85, Issue 1

1 -- 28Pierre Aboulker, Édouard Bonnet, Eun Jung Kim 0002, Florian Sikora. Grundy Coloring and Friends, Half-Graphs, Bicliques
29 -- 74Sang Won Bae, Sang Duk Yoon. Empty Squares in Arbitrary Orientation Among Points
75 -- 99Gill Barequet, Gil Ben-Shachar. Algorithms for Counting Minimum-Perimeter Lattice Animals
100 -- 132Raghunath Reddy Madireddy, Apurva Mudgal. A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks
133 -- 152Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi. Parameterized Study of Steiner Tree on Unit Disk Graphs
153 -- 169Gruia Calinescu, Xiaolang Wang. Combination Algorithms for Steiner Tree Variants
170 -- 187Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol. Double String Tandem Repeats
188 -- 215Peter Jonsson, Victor Lagerkvist. General Lower Bounds and Improved Algorithms for Infinite-Domain CSPs
216 -- 276Shlomi Dolev, Thomas Petig, Elad Michael Schiller. Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing Networks
277 -- 295Herbert Edelsbrunner, Georg Osang. A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes
296 -- 323Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, Arne Schmidt 0001. Parallel Online Algorithms for the Bin Packing Problem