Journal: Algorithmica

Volume 82, Issue 9

2395 -- 2414Manouchehr Zaker. A New Vertex Coloring Heuristic and Corresponding Chromatic Number
2415 -- 2431Ziyun Huang, Jinhui Xu 0001. An Efficient Sum Query Algorithm for Distance-Based Locally Dominating Functions
2432 -- 2473Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond. On the Tractability of Optimization Problems on H-Graphs
2474 -- 2501Refael Hassin, R. Ravi 0001, F. Sibel Salman, Danny Segev. The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures
2502 -- 2534Yuichi Nagata, Shinji Imahori. An Efficient Exhaustive Search Algorithm for the Escherization Problem
2535 -- 2563Akira Matsubayashi. A $3+\varOmega (1)$ Lower Bound for Page Migration
2564 -- 2585Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann 0001, Sergey Pupyrev. Queue Layouts of Planar 3-Trees
2586 -- 2605Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi. Independent Set Reconfiguration Parameterized by Modular-Width
2606 -- 2643Zhao An, Qilong Feng, Iyad Kanj, Ge Xia. The Complexity of Tree Partitioning
2644 -- 2667Danny Hermelin, George Manoussakis, Michael Pinedo, Dvir Shabtay, Liron Yedidsion. Parameterized Multi-Scenario Single-Machine Scheduling Problems
2668 -- 2686Robert Chiang, Kanstantsin Pashkovich. On the Approximability of the Stable Matching Problem with Ties of Size Two
2687 -- 2707Krzysztof Turowski, Abram Magner, Wojciech Szpankowski. Compression of Dynamic Graphs Generated by a Duplication Model

Volume 82, Issue 8

2133 -- 2134Christophe Paul, Michal Pilipczuk. Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation
2135 -- 2155Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström. Multi-budgeted Directed Cuts
2156 -- 2173Kustaa Kangas, Mikko Koivisto, Sami Salonen. A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
2174 -- 2199Kitty Meeks, Fiona Skerman. The Parameterised Complexity of Computing the Maximum Modularity of a Graph
2200 -- 2242Hubie Chen, Bart M. P. Jansen, Astrid Pieterse. Best-Case and Worst-Case Sparsifiability of Boolean CSPs
2243 -- 2266Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut. On the Distance Identifying Set Meta-problem and Applications to the Complexity of Identifying Problems on Graphs
2267 -- 2291Marc Roth, Johannes Schmitt 0002. Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness
2292 -- 2315Karl Bringmann, Thore Husfeldt, Måns Magnusson. Multivariate Analysis of Orthogonal Range Searching and Graph Distances
2316 -- 2336Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Ana Silva. Dual Parameterization of Weighted Coloring
2337 -- 2359David Eppstein, Elham Havvaei. Parameterized Leaf Power Recognition via Embedding into Graph Products
2360 -- 2394Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant. Parameterized Complexity of Independent Set in H-Free Graphs

Volume 82, Issue 7

1741 -- 1783Bhaskar DasGupta, Mano Vikash Janardhanan, Farzane Yahyanejad. Why Did the Shape of Your Network Change? (On Detecting Network Anomalies via Non-local Curvatures)
1784 -- 1812Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid 0001. Walking Through Waypoints
1813 -- 1832John Hershberger 0001, Neeraj Kumar 0004, Subhash Suri. Shortest Paths in the Plane with Obstacle Violations
1833 -- 1858Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová. s)-Free Graphs
1859 -- 1880Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos. Subgraph Complementation
1881 -- 1908Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg. Placing Labels in Road Maps: Algorithms and Complexity
1909 -- 1938Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora. Parameterized Orientable Deletion
1939 -- 1965Akanksha Agrawal, Pallavi Jain 0001, Lawqueen Kanesh, Saket Saurabh 0001. Parameterized Complexity of Conflict-Free Matchings and Paths
1966 -- 1988Keshav Goyal, Tobias Mömke. Robust Reoptimization of Steiner Trees
1989 -- 2005Andreas Emil Feldmann, Dániel Marx. The Parameterized Hardness of the k-Center Problem in Transportation Networks
2006 -- 2038Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos. Parameterized Aspects of Strong Subgraph Closure
2039 -- 2062Huang-Ting Chan, Hsuan-Tsung Chiu, Chang-Biau Yang, Yung-Hsing Peng. The Generalized Definitions of the Two-Dimensional Largest Common Substructure Problems
2063 -- 2086Travis Gagie, Meng He 0001, Gonzalo Navarro. Compressed Dynamic Range Majority and Minority Data Structures
2087 -- 2106Naoyuki Kamiyama. The Distance-Constrained Matroid Median Problem
2107 -- 2132Qian Li 0012, Xiaoming Sun, Jialin Zhang. On the Optimality of Tape Merge of Two Lists with Similar Size

Volume 82, Issue 6

1547 -- 1573Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari. Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs
1574 -- 1600Guillaume Ducoffe , Sylvain Legay, Nicolas Nisse. On the Complexity of Computing Treebreadth
1601 -- 1615Charles Maske, Jaime Cohen, Elias P. Duarte. Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions
1616 -- 1639Júlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva. On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths
1640 -- 1653Nikhil Bansal, Martin Böhm, Marek Eliás 0001, Grigorios Koumoutsos, Seeun William Umboh. Nested Convex Bodies are Chaseable
1654 -- 1674Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon. An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width
1675 -- 1702Zeta Avarikioti, Ioannis Z. Emiris, Loukas Kavouras, Ioannis Psarros. High-Dimensional Approximate r-Nets
1703 -- 1739Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese. Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs

Volume 82, Issue 5

1081 -- 1100Boris Aronov, Mark de Berg, Aleksandar Markovic 0001, Gerhard J. Woeginger. Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces
1101 -- 1135Spyros Angelopoulos 0001, Marc P. Renault, Pascal Schweitzer. Stochastic Dominance and the Bijective Ratio of Online Algorithms
1136 -- 1188Matthias Mnich, Ildikó Schlotter. Stable Matchings with Covering Constraints: A Complete Computational Trichotomy
1189 -- 1238Stefano Coniglio, Nicola Gatti 0001, Alberto Marchesi. Computing a Pessimistic Stackelberg Equilibrium with Multiple Followers: The Mixed-Pure Case
1239 -- 1258Torsten Mütze, Jerri Nummenpalo. A Constant-Time Algorithm for Middle Levels Gray Codes
1259 -- 1276Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth. Reachability Oracles for Directed Transmission Graphs
1277 -- 1297Kohei Hayashi, Yuichi Yoshida. ∞ Minimization in Constant Time
1298 -- 1328Peter Damaschke. Dividing Splittable Goods Evenly and With Limited Fragmentation
1329 -- 1345David Avis, Luc Devroye. An Analysis of Budgeted Parallel Search on Conditional Galton-Watson Trees
1346 -- 1377Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura, Dany Breslauer, Diptarama Hendrian. Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts
1378 -- 1409Laurent Bulteau, Markus L. Schmid. Consensus Strings with Small Maximum Distance and Small Distance Sum
1410 -- 1433Haris Aziz 0001, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari. Stable Matching with Uncertain Linear Preferences
1434 -- 1473Eunjin Oh 0001, Luis Barba, Hee-Kap Ahn. The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon
1474 -- 1489Jean Cardinal, Jerri Nummenpalo, Emo Welzl. Solving and Sampling with Many Solutions
1490 -- 1546Moritz Baum, Julian Dibbelt, Thomas Pajor, Jonas Sauer, Dorothea Wagner, Tobias Zündorf. Energy-Optimal Routes for Battery Electric Vehicles

Volume 82, Issue 4

681 -- 720Gerardo Berbeglia, Gwenaël Joret. Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments
721 -- 746Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho. Weak Coverage of a Rectangular Barrier
747 -- 786Reut Levi, Dana Ron, Ronitt Rubinfeld. Local Algorithms for Sparse Spanning Graphs
787 -- 807Tatsuya Matsuoka, Shun Sato 0001. Making Bidirected Graphs Strongly Connected
808 -- 852Hu Ding, Jinhui Xu 0001. A Unified Framework for Clustering Constrained Data Without Locality Property
853 -- 880Niels Grüttemeier, Christian Komusiewicz. On the Relation of Strong Triadic Closure and Cluster Deletion
881 -- 897Sushmita Gupta, Sanjukta Roy, Saket Saurabh 0001, Meirav Zehavi. Quadratic Vertex Kernel for Rainbow Matching
898 -- 914Vicente Acuña, Roberto Grossi, Giuseppe Francesco Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri. On Bubble Generators in Directed Graphs
915 -- 937Chih-Hung Liu. A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon
938 -- 965Marek Chrobak, Christoph Dürr, Aleksander Fabijan, Bengt J. Nilsson. Online Clique Clustering
966 -- 978Yijie Han. Sorting Real Numbers in $O\big (n\sqrt{\log n}\big )$ Time and Linear Space
979 -- 0Yijie Han. Correction to: Sorting Real Numbers in $O(n\sqrt{\log n})$ Time and Linear Space
980 -- 1005Titouan Carette, Mathieu Laurière, Frédéric Magniez. Extended Learning Graphs for Triangle Finding
1006 -- 1032Chien-Chung Huang, Naonori Kakimura, Yuichi Yoshida. Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint
1033 -- 1056Torben Hagerup. Space-Efficient DFS and Applications to Connectivity Problems: Simpler, Leaner, Faster
1057 -- 1080Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger. Deterministic Dynamic Matching in O(1) Update Time

Volume 82, Issue 3

385 -- 0James Allen Fill, Mark Daniel Ward. Special Issue on Analysis of Algorithms
386 -- 428Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger. Analytic Combinatorics of Lattice Paths with Forbidden Patterns, the Vectorial Kernel Method, and Generating Functions for Pushdown Automata
429 -- 508Clemens Heuberger, Daniel Krenn. Asymptotic Analysis of Regular Sequences
509 -- 588Stefan Edelkamp, Armin Weiß, Sebastian Wild. QuickXsort: A Fast Sorting Scheme in Theory and Practice
589 -- 615Michael Albert, Cecilia Holmgren, Tony Johansson, Fiona Skerman. Embedding Small Digraphs and Permutations in Binary Trees and Split Trees
616 -- 641Svante Janson. Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns
642 -- 679Dimbinaina Ralaivaosaona, Matas Sileikis, Stephan G. Wagner. A Central Limit Theorem for Almost Local Additive Tree Functionals

Volume 82, Issue 2

163 -- 164Yoshio Okamoto. Guest Editorial: Selected Papers from ISAAC 2017
165 -- 187Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Christian Rieck, Christian Scheffer, Arne Schmidt 0001. Tilt Assembly: Algorithms for Micro-factories That Build Objects with Uniform External Forces
188 -- 211Yu Yokoi. Envy-Free Matchings with Lower Quotas
212 -- 244Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes. Study of a Combinatorial Game in Graphs Through Linear Programming
245 -- 259Edvin Berglin, Gerth Stølting Brodal. A Simple Greedy Algorithm for Dynamic Graph Orientation
260 -- 278Michel Habib, Lalla Mouatadid. Maximum Induced Matching Algorithms via Vertex Ordering Characterizations
279 -- 299Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci 0001, Guido Proietti. An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
300 -- 315Vincenzo Bonifaci. On the Convergence Time of a Natural Dynamics for Linear Programming
316 -- 337J. Ian Munro, Gonzalo Navarro, Yakov Nekrich. Fast Compressed Self-indexes with Deterministic Linear-Time Construction
338 -- 354Casper Benjamin Freksen, Kasper Green Larsen. On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms
355 -- 384Therese C. Biedl, Markus Chimani, Martin Derka, Petra Mutzel. Crossing Number for Graphs with Bounded Pathwidth

Volume 82, Issue 12

3415 -- 3457Fu-Hong Liu, Hsiang Hsuan Liu, Prudence W. H. Wong. Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization
3458 -- 3491Merav Parter, David Peleg. Fault Tolerant Approximate BFS Structures with Additive Stretch
3492 -- 3520Gregor Matl, Stanislav Zivný. Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs
3521 -- 3565George B. Mertzios, André Nichterlein, Rolf Niedermeier. The Power of Linear-Time Data Reduction for Maximum Matching
3566 -- 3587Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden. Subgraph Isomorphism on Graph Classes that Exclude a Substructure
3588 -- 3603Sarah Blind, Kolja Knauer, Petru Valicov. Enumerating k-Arc-Connected Orientations
3604 -- 3629Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang. On Scheduling Coflows
3630 -- 3675Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner. An Adversarial Model for Scheduling with Testing
3676 -- 3706Dogan Corus, Pietro S. Oliveto. On the Benefits of Populations for the Exploitation Speed of Standard Steady-State Genetic Algorithms
3707 -- 3743Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski. Dynamic and Internal Longest Common Substring

Volume 82, Issue 11

3125 -- 3164Yoad Zur, Michael Segal 0001. Improved Solution to Data Gathering with Mobile Mule
3165 -- 3182Gilad Kutiel, Dror Rawitz. Local Search Algorithms for the Maximum Carpool Matching Problem
3183 -- 3194Monika Henzinger, Dariusz Leniowski, Claire Mathieu. Dynamic Clustering to Minimize the Sum of Radii
3195 -- 3215Dmitry Kosolobov, Daniel Valenzuela 0001, Gonzalo Navarro, Simon J. Puglisi. Lempel-Ziv-Like Parsing in Small Space
3216 -- 3249Paulina Grzegorek, Janusz Januszewski, Lukasz Zielonka. Efficient 1-Space Bounded Hypercube Packing Algorithm
3250 -- 3281Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit. Deterministic Treasure Hunt in the Plane with Angular Hints
3282 -- 3305Radoslav Fulek. Embedding Graphs into Embedded Graphs
3306 -- 3337Matti Karppa, Petteri Kaski, Jukka Kohonen, Padraig Ó Catháin. Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time
3338 -- 3389Ankit Chauhan, Tobias Friedrich 0001, Ralf Rothenberger. Greed is Good for Deterministic Scale-Free Networks
3390 -- 3412Simone Faro, Francesco Pio Marino, Arianna Pavone. Efficient Online String Matching Based on Characters Distance Text Sampling
3413 -- 0Zengfeng Huang, Ke Yi 0001, Qin Zhang 0001. Correction to: Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks

Volume 82, Issue 10

2709 -- 2736Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg. A Unified Model and Algorithms for Temporal Map Labeling
2737 -- 2783Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu 0001. Online Stochastic Matching: New Algorithms and Bounds
2784 -- 2808Harel Yedidsion, Stav Ashur, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal 0001. Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule
2809 -- 2840Ching-Chi Lin, Keng-Chu Ku, Chan-Hung Hsu. Paired-Domination Problem on Distance-Hereditary Graphs
2841 -- 2866Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski. On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
2867 -- 2901Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes. Sequential Metric Dimension
2902 -- 2926Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh 0001. On the Approximate Compressibility of Connected Vertex Cover
2927 -- 2954Argyrios Deligkas, John Fearnley, Paul G. Spirakis. Lipschitz Continuity and Approximate Equilibria
2955 -- 2984Roland Glück, Dominik Köppl. Computational Aspects of Ordered Integer Partitions with Bounds
2985 -- 3017Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. Upward Planar Morphs
3018 -- 3040Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés. The Inverse Voronoi Problem in Graphs I: Hardness
3041 -- 3064An Zhang, Yong Chen 0002, Zhi-Zhong Chen, Guohui Lin. Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs
3065 -- 0. Special Issue on Computing and Combinatorics
3066 -- 3090Mingyu Xiao, Hiroshi Nagamochi. Characterizing Star-PCGs
3091 -- 3116Shi Li, Jinhui Xu 0001, Minwei Ye. Approximating Global Optimum for Probabilistic Truth Discovery
3117 -- 3123Feng Shi 0003, Martin Schirneck, Tobias Friedrich 0001, Timo Kötzing, Frank Neumann 0001. Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints

Volume 82, Issue 1

1 -- 19Aritra Banik, Fahad Panolan, Venkatesh Raman 0001, Vibha Sahlot, Saket Saurabh 0001. Parameterized Complexity of Geometric Covering Problems Having Conflicts
20 -- 40Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma. 5)-Free Graphs
41 -- 63Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman 0001, Saket Saurabh 0001. A Polynomial Sized Kernel for Tracking Paths Problem
64 -- 87Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu 0001. Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts
88 -- 106Siu-Wing Cheng, Kai Jin, Lie Yan. Extensions of Self-Improving Sorters
107 -- 117Arnab Ganguly 0002, Rahul Shah, Sharma V. Thankachan. Succinct Non-overlapping Indexing
118 -- 145Lars Jaffke, O-joung Kwon, Jan Arne Telle. Mim-Width II. The Feedback Vertex Set Problem
146 -- 162Johanna E. Preißer, Jens M. Schmidt. Computing Vertex-Disjoint Paths in Large Graphs Using MAOs