Upward Book Embeddability of st-Graphs: Complexity and Algorithms Carla BinucciGiordano Da LozzoMaurizio Patrignani OriginalPaper Open access 14 July 2023 Pages: 3521 - 3571
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage Charis PapadopoulosSpyridon Tzimas OriginalPaper Open access 13 July 2023 Pages: 874 - 906
Reducing Graph Parameters by Contractions and Deletions Felicia LuckeFelix Mann OriginalPaper Open access 09 July 2023 Pages: 825 - 851
On the d-Claw Vertex Deletion Problem Sun-Yuan HsiehHoang-Oanh LeSheng-Lung Peng OriginalPaper 07 July 2023 Pages: 505 - 525
Traversability, Reconfiguration, and Reachability in the Gadget Framework Joshua AniErik D. DemaineJayson Lynch OriginalPaper Open access 05 July 2023 Pages: 3453 - 3486
Special Issue Dedicated to 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022 Md. Saidur RahmanPetra MutzelSlamin Editorial 05 July 2023 Pages: 3325 - 3326
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry Thomas BläsiusTobias FriedrichMaximilian Katzmann OriginalPaper Open access 27 June 2023 Pages: 3487 - 3520
Parameterized Complexity of Minimum Membership Dominating Set Akanksha AgrawalPratibha ChoudharyVijayaragunathan Ramamoorthi OriginalPaper 13 June 2023 Pages: 3430 - 3452
Winner Determination Algorithms for Graph Games with Matching Structures Tesshu HanakaHironori KiyaKanae Yoshiwatari OriginalPaper 08 June 2023 Pages: 808 - 824
1-Extendability of Independent Sets Pierre BergéAnthony BussonRémi Watrigant OriginalPaper 08 June 2023 Pages: 757 - 781
Finding Matching Cuts in H-Free Graphs Felicia LuckeDaniël PaulusmaBernard Ries OriginalPaper Open access 07 June 2023 Pages: 3290 - 3322
A Weight-Scaling Algorithm for f-Factors of Multigraphs Harold N. Gabow OriginalPaper 18 May 2023 Pages: 3214 - 3289
Special Issue on Algorithms and Computation (ISAAC 2021) Editor’s Note 16 May 2023 Pages: 1521 - 1521
Better Distance Labeling for Unweighted Planar Graphs Paweł GawrychowskiPrzemysław Uznański OriginalPaper Open access 15 May 2023 Pages: 1805 - 1823
Blocking Trails for f-factors of Multigraphs Harold N. Gabow OriginalPaper 13 May 2023 Pages: 3168 - 3213
One-Pass Additive-Error Subset Selection for \(\ell _{p}\) Subspace Approximation and (k, p)-Clustering Amit DeshpandeRameshwar Pratap OriginalPaper 11 May 2023 Pages: 3144 - 3167
Almost Universal Anonymous Rendezvous in the Plane Yoann DieudonnéAndrzej PelcFranck Petit OriginalPaper 11 May 2023 Pages: 3110 - 3143
A Tight \((3/2+\varepsilon )\)-Approximation for Skewed Strip Packing Waldo GálvezFabrizio GrandoniMalin Rau OriginalPaper 10 May 2023 Pages: 3088 - 3109
A Polynomial Kernel for 3-Leaf Power Deletion Jungho AhnEduard EibenSang-il Oum OriginalPaper 09 May 2023 Pages: 3058 - 3087
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences Hideo BannaiTomohiro I.Simon J. Puglisi OriginalPaper Open access 06 May 2023 Pages: 735 - 756
Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs Philip N. KleinClaire MathieuHang Zhou OriginalPaper 05 May 2023 Pages: 3024 - 3057
A General Framework for Enumerating Equivalence Classes of Solutions Yishu WangArnaud MaryBlerina Sinaimeri OriginalPaper 04 May 2023 Pages: 3003 - 3023
On Finding the Best and Worst Orientations for the Metric Dimension Julio AraujoJulien BensmailAna Silva OriginalPaper 03 May 2023 Pages: 2962 - 3002
Parameterised Counting in Logspace Anselm HaakArne MeierB. V. Raghavendra Rao OriginalPaper Open access 21 April 2023 Pages: 2923 - 2961
Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive Matteo CastiglioniAndrea CelliNicola Gatti OriginalPaper Open access 19 April 2023 Pages: 2885 - 2921
The Complexity of L(p, q)-Edge-Labelling Gaétan BertheBarnaby MartinSiani Smith OriginalPaper 13 April 2023 Pages: 3406 - 3429
A Faster Interior-Point Method for Sum-of-Squares Optimization Shunhua JiangBento NaturaOmri Weinstein OriginalPaper 11 April 2023 Pages: 2843 - 2884
Publisher Correction: Longest Common Substring with Approximately k Mismatches Tomasz KociumakaJakub RadoszewskiTatiana Starikovskaya Publisher Correction Open access 10 April 2023 Pages: 3323 - 3323
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems Sotiris NikoletseasChristoforos RaptopoulosPaul Spirakis OriginalPaper Open access 10 April 2023 Pages: 2817 - 2842
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints Nicolas BousquetTakehiro ItoKunihiro Wasa OriginalPaper 10 April 2023 Pages: 2779 - 2816
Immunization in the Threshold Model: A Parameterized Complexity Study Gennaro CordascoLuisa GarganoAdele A. Rescigno OriginalPaper Open access 07 April 2023 Pages: 3376 - 3405
Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items Arindam KhanEklavya Sharma OriginalPaper 28 March 2023 Pages: 2735 - 2778
Max-3-Lin Over Non-abelian Groups with Universal Factor Graphs Amey BhangaleAleksa Stanković OriginalPaper Open access 27 March 2023 Pages: 2693 - 2734
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021) Meng HeAnna LubiwMohammad Salavatipour EditorialNotes 16 March 2023 Pages: 1736 - 1737
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario Patrizio AngeliniMichael A. BekosMartin Gronemann OriginalPaper Open access 11 March 2023 Pages: 2667 - 2692
Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time Walter DidimoMichael KaufmannGiacomo Ortali OriginalPaper Open access 11 March 2023 Pages: 2605 - 2666
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs Barnaby MartinDaniël PaulusmaErik Jan van Leeuwen OriginalPaper Open access 11 March 2023 Pages: 2580 - 2604
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials Balagopal KomarathAnurag PandeyC. S. Rahul OriginalPaper 11 March 2023 Pages: 2554 - 2579
Path Cover Problems with Length Cost Kenya KobayashiGuohui LinTsuyoshi Yagita OriginalPaper 06 March 2023 Pages: 3348 - 3375
Transmitting Once to Elect a Leader on Wireless Networks Vlady RavelomananaNy Aina Andriambolamalala OriginalPaper 06 March 2023 Pages: 2529 - 2553
Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs Jesse BeisegelEkkehard KöhlerMartin Strehler OriginalPaper Open access 28 February 2023 Pages: 2454 - 2481
Polynomial-time Combinatorial Algorithm for General Max–Min Fair Allocation Sheng-Yen KoHo-Lin ChenChung-Shou Liao OriginalPaper 27 February 2023 Pages: 485 - 504
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution Denis AntipovMaxim BuzdalovBenjamin Doerr OriginalPaper Open access 22 February 2023 Pages: 442 - 484
Unique Assembly Verification in Two-Handed Self-Assembly David CaballeroTimothy GomezTim Wylie OriginalPaper 17 February 2023 Pages: 2427 - 2453
Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity Shyan AkmalLijie ChenRyan Williams OriginalPaper Open access 17 February 2023 Pages: 2395 - 2426
Resource-Constrained Scheduling Algorithms for Stochastic Independent Tasks With Unknown Probability Distribution Yiqin GaoYves RobertFrédéric Vivien OriginalPaper 17 February 2023 Pages: 2363 - 2394
Intersecting Longest Cycles in Archimedean Tilings Muhammad Faisal NadeemHamza IqbalMuhammad Azeem OriginalPaper 10 February 2023 Pages: 2348 - 2362
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes Felix ReidlBlair D. Sullivan OriginalPaper 03 February 2023 Pages: 2318 - 2347
Guest Editorial: Special Issue on Theoretical Informatics Yoshiharu KohayakawaFlávio K. Miyazawa EditorialNotes 01 February 2023 Pages: 2482 - 2484
Near-Optimal Quantum Algorithms for String Problems Shyan AkmalCe Jin OriginalPaper Open access 27 January 2023 Pages: 2260 - 2317
