Abstract is missing.
- Entire H-irregularity Strength of Plane GraphsMartin Baca, Nurdin Hinding, Aisha Javed, Andrea Semanicová-Fenovcíková. 3-12 [doi]
- Combinatorial Questions: How Can Graph Labelling Help?Diane Donovan, Thomas A. McCourt. 13-23 [doi]
- Extremal Kernelization: A Commemorative PaperHenning Fernau. 24-36 [doi]
- Recent Advances of Palindromic FactorizationMai Alzamel, Costas S. Iliopoulos. 37-46 [doi]
- A Construction for 0, 1, -1 Orthogonal Matrices VisualizedN. A. Balonin, Jennifer Seberry. 47-57 [doi]
- On the Maximum Crossing NumberMarkus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff. 61-74 [doi]
- Approximation Results for the Incremental Knapsack ProblemFederico Della Croce, Ulrich Pferschy, Rosario Scatamacchia. 75-87 [doi]
- Derandomization for k-Submodular MaximizationHiroki Oshima. 88-99 [doi]
- On the Parameterized Complexity of Happy Vertex ColoringAkanksha Agrawal. 103-115 [doi]
- Complexity Dichotomies for the Minimum ℱ -Overlay ProblemNathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant. 116-127 [doi]
- Improved Complexity for Power Edge Set ProblemBenoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. 128-141 [doi]
- The Parameterized Complexity of Happy ColoringsNeeldhara Misra, I. Vinod Reddy. 142-153 [doi]
- Computational Complexity Relationship between Compaction, Vertex-Compaction, and RetractionNarayan Vikas. 154-166 [doi]
- Holes in 2-Convex Point SetsOswin Aichholzer, Martin Balko, Thomas Hackl, Alexander Pilz, Pedro Ramos 0001, Pavel Valtr, Birgit Vogtenhuber. 169-181 [doi]
- Graph Parameters and Ramsey TheoryVadim V. Lozin. 185-194 [doi]
- Letter Graphs and Geometric Grid Classes of Permutations: Characterization and RecognitionBogdan Alecu, Vadim V. Lozin, Viktor Zamaraev, Dominique de Werra. 195-205 [doi]
- Fully Leafed Tree-Like Polyominoes and PolycubesAlexandre Blondin Massé, Julien de Carufel, Alain Goupil, Maxime Samson. 206-218 [doi]
- Improved Lower Bound on Broadcast Function Based on Graph PartitionHovhannes A. Harutyunyan, Zhiyuan Li. 219-230 [doi]
- Orientations of 1-Factors and the List Edge Coloring ConjectureUwe Schauz. 233-243 [doi]
- On Solving the Queen Graph Coloring ProblemMichel Vasquez, Yannick Vimont. 244-251 [doi]
- Minimal Sum Labeling of GraphsMatej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer 0002. 252-263 [doi]
- On the Power Domination Number of de Bruijn and Kautz DigraphsCyriac Grigorious, Thomas Kalinowski, Sudeep Stephen. 264-272 [doi]
- A Multi-start Heuristic for Multiplicative Depth Minimization of Boolean CircuitsSergiu Carpov, Pascal Aubry, Renaud Sirdey. 275-286 [doi]
- The School Bus Routing Problem: An Analysis and AlgorithmRhydian Lewis, Kate Smith-Miles, Kyle Phillips. 287-298 [doi]
- Heuristic, Branch-and-Bound Solver and Improved Space Reduction for the Median of Permutations ProblemRobin Milosz, Sylvie Hamel. 299-311 [doi]
- Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependent Buffer RequirementsHanyu Gu, Julia Memar, Yakov Zinder. 312-324 [doi]
- Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth ProblemSven Mallach. 327-340 [doi]
- How to Answer a Small Batch of RMQs or LCA Queries in PracticeMai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis. 343-355 [doi]
- Computing Asymmetric Median Tree of Two Trees via Better Bipartite Matching AlgorithmRamesh Rajaby, Wing-Kin Sung. 356-367 [doi]
- Privacy-Preserving and Co-utile Distributed Social CreditJosep Domingo-Ferrer. 371-382 [doi]
- Combinatorial Algorithms and Methods for Security of Statistical Databases Related to the Work of Mirka MillerAndrei Kelarev, Jennifer Seberry, Leanne Rylands, Xun Yi. 383-394 [doi]
- Shortest Unique Palindromic Substring Queries in Optimal TimeYuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 397-408 [doi]
- A Faster Implementation of Online Run-Length Burrows-Wheeler TransformTatsuya Ohno, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto. 409-419 [doi]
- Computing Abelian String Regularities Based on RLEShiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 420-431 [doi]