Abstract is missing.
- The Information Extraction Framework of Document Spanners - A Very Informal SurveyMarkus L. Schmid. 3-22 [doi]
- Generalized Distance Polymatrix GamesAlessandro Aloisio, Michele Flammini, Cosimo Vinci. 25-39 [doi]
- Relaxed Agreement ForestsVirginia Ardévol Martínez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis. 40-54 [doi]
- On the Computational Complexity of Generalized Common Shape PuzzlesMutsunori Banbara, Shin-ichi Minato, Hirotaka Ono 0001, Ryuhei Uehara. 55-68 [doi]
- Fractional Bamboo Trimming and Distributed Windows SchedulingArash Beikmohammadi, William S. Evans, Seyed Ali Tabatabaee. 69-81 [doi]
- New Support Size Bounds and Proximity Bounds for Integer Linear ProgrammingSebastian Berndt 0001, Matthias Mnich, Tobias Stamm. 82-95 [doi]
- On the Parameterized Complexity of Minus DominationSriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh 0001. 96-110 [doi]
- Exact and Parameterized Algorithms for ChoosabilityIvan Bliznets, Jesper Nederlof. 111-124 [doi]
- Parameterized Algorithms for Covering by Arithmetic ProgressionsIvan Bliznets, Jesper Nedelof, Krisztina Szilágyi. 125-138 [doi]
- Row-Column Combination of Dyck WordsStefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro. 139-153 [doi]
- Group Testing in Arbitrary Hypergraphs and Related Combinatorial StructuresAnnalisa De Bonis. 154-168 [doi]
- On the Parameterized Complexity of the Perfect Phylogeny ProblemJorke M. de Vlas. 169-182 [doi]
- Data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced CyclesJona Dirks, Enna Gerhard, Mario Grobler, Amer E. Mouawad, Sebastian Siebertz. 183-197 [doi]
- Visualization of Bipartite Graphs in Limited Window SizeWilliam Evans, Kassian Köck, Stephen G. Kobourov. 198-210 [doi]
- Outerplanar and Forest StoryplansJirí Fiala 0001, Oksana Firman, Giuseppe Liotta, Alexander Wolff 0001, Johannes Zink 0001. 211-225 [doi]
- The Complexity of Cluster Vertex Splitting and CompanyAlexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann. 226-239 [doi]
- Morphing Graph Drawings in the Presence of Point ObstaclesOksana Firman, Tim Hegemann, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff 0001, Johannes Zink 0001. 240-254 [doi]
- Word-Representable Graphs from a Word's PerspectivePamela Fleischmann, Lukas Haschke, Tim Löck, Dirk Nowotka. 255-268 [doi]
- The Complexity of Online Graph GamesJanosch Fuchs, Christoph Grüne, Tom Janßen. 269-282 [doi]
- Removable Online Knapsack with Bounded Size ItemsLaurent Gourvès, Aris Pagourtzis. 283-296 [doi]
- Faster Winner Determination Algorithms for (Colored) Arc KaylesTesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono 0001, Kanae Yoshiwatari. 297-310 [doi]
- Automata Classes Accepting Languages Whose Commutative Closure is RegularStefan Hoffmann 0001. 311-325 [doi]
- Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set MatchingJan Janousek, Stepán Plachý. 326-339 [doi]
- Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular LanguagesYoshito Kawasaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara. 340-354 [doi]
- Apportionment with Thresholds: Strategic Campaigns are Easy in the Top-Choice but Hard in the Second-Chance ModeChristian Laußmann, Jörg Rothe, Tessa Seeger. 355-368 [doi]
- Local Certification of Majority DynamicsDiego Maldonado, Pedro Montealegre 0001, Martín Ríos Wilson, Guillaume Theyssier. 369-382 [doi]
- Complexity of Spherical Equations in Finite GroupsCaroline Mattes, Alexander Ushakov, Armin Weiß. 383-397 [doi]
- Positive Characteristic Sets for Relational Pattern LanguagesS. Mahmoud Mousawi, Sandra Zilles. 398-412 [doi]
- Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk GraphsJesper Nederlof, Krisztina Szilágyi. 413-426 [doi]
- The Weighted HOM-Problem Over FieldsAndreea-Teodora Nász. 427-441 [doi]
- Combinatorics of Block-Parallel Automata NetworksKévin Perrot, Sylvain Sené, Léah Tapin. 442-455 [doi]
- On the Piecewise Complexity of Words and Periodic WordsM. Praveen, Philippe Schnoebelen, Julien Veron, Isa Vialard. 456-470 [doi]
- Distance Labeling for Families of CyclesArseny M. Shur, Mikhail Rubinchik. 471-484 [doi]
- On the Induced Problem for Fixed-Template CSPsRustem Takhanov. 485-499 [doi]