Journal: Algorithmica

Volume 86, Issue 3

695 -- 696Cristina Bazgan, Henning Fernau. Preface of the Special Issue Dedicated to Selected Papers from IWOCA 2022
697 -- 716Oswin Aichholzer, Ruy Fabila Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber. Perfect Matchings with Crossings
717 -- 734Stepan Artamonov, Maxim A. Babenko. Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings
735 -- 756Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi. Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
757 -- 781Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant. 1-Extendability of Independent Sets
782 -- 807Jan Bok, Jirí Fiala 0001, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski. List Covering of Regular Multigraphs with Semi-edges
808 -- 824Tesshu Hanaka, Hironori Kiya, Hirotaka Ono 0001, Kanae Yoshiwatari. Winner Determination Algorithms for Graph Games with Matching Structures
825 -- 851Felicia Lucke, Felix Mann. Reducing Graph Parameters by Contractions and Deletions
852 -- 873Takuya Mieno, Mitsuru Funakoshi. Data Structures for Computing Unique Palindromes in Static and Non-Static Strings
874 -- 906Charis Papadopoulos, Spyridon Tzimas. Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage