Abstract is missing.
- Collision-Free Routing Problem with Restricted L-PathJammigumpula Ajay, Sasanka Roy. 1-13 [doi]
- Linear Clique-Width of Bi-complement Reducible GraphsBogdan Alecu, Vadim V. Lozin, Viktor Zamaraev. 14-25 [doi]
- Linear Ramsey NumbersAistis Atminas, Vadim V. Lozin, Viktor Zamaraev. 26-38 [doi]
- Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract)Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi. 39-51 [doi]
- Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free FamiliesThaís Bardini Idalino, Lucia Moura. 52-64 [doi]
- Minimum Polygons for Fixed Visibility VC-DimensionMoritz Beck, Sabine Storandt. 65-77 [doi]
- Minsum k-Sink Problem on Dynamic Flow Path NetworksRobert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh. 78-89 [doi]
- Fully Leafed Induced SubtreesAlexandre Blondin Massé, Julien de Carufel, Alain Goupil, Mélodie Lapointe, Émile Nadeau, Élise Vandomme. 90-101 [doi]
- Pattern Matching for k-Track PermutationsLaurent Bulteau, Romeo Rizzi, Stéphane Vialette. 102-114 [doi]
- Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric GraphsLi-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing. 115-127 [doi]
- On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary TreesBarbara Covella, Fabrizio Frati, Maurizio Patrignani. 128-140 [doi]
- A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar GraphsChristine Dahn, Nils M. Kriege, Petra Mutzel. 141-152 [doi]
- Covering with Clubs: Complexity and ApproximabilityRiccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis. 153-164 [doi]
- On the Expected Number of Distinct Gapped Palindromic FactorsPhilippe Duchon, Cyril Nicaud. 165-176 [doi]
- Computational Complexity of Robot Arm Simulation ProblemsTianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara. 177-188 [doi]
- Evaluation of Tie-Breaking and Parameter Ordering for the IPO Family of Algorithms Used in Covering Array GenerationKristoffer Kleine, Ilias S. Kotsireas, Dimitris E. Simos. 189-200 [doi]
- Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded GirthKazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura. 201-213 [doi]
- An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner ForestChristine Markarian. 214-223 [doi]
- Median of 3 Permutations, 3-Cycles and 3-Hitting Set ProblemRobin Milosz, Sylvie Hamel, Adeline Pierrot. 224-236 [doi]
- On the Parameterized Complexity of Colorful Components and Related ProblemsNeeldhara Misra. 237-249 [doi]
- Analysis of Information Leakage Due to Operative Errors in Card-Based ProtocolsTakaaki Mizuki, Yuichi Komano. 250-262 [doi]
- Zero-Suppression and Computation ModelsHiroki Morizumi. 263-272 [doi]
- The Crossing Number of Seq-Shellable Drawings of Complete GraphsPetra Mutzel, Lutz Oettershagen. 273-284 [doi]
- Cryptographic Limitations on Polynomial-Time a Posteriori Query LearningMikito Nanashima. 285-297 [doi]
- Placing Segments on Parallel ArcsYen Kaow Ng, Wenlong Jia, Shuai Cheng Li. 298-310 [doi]
- Branch-and-Bound Algorithm for Symmetric Travelling Salesman ProblemAlexey Nikolaev, Mikhail Batsyn. 311-322 [doi]
- LZ-ABT: A Practical Algorithm for α-Balanced Grammar CompressionTatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto. 323-335 [doi]
- Faster Coreset Construction for Projective Clustering via Low-Rank ApproximationRameshwar Pratap, Sandeep Sen. 336-348 [doi]
- Separating Interaction Effects Using Locating and Detecting ArraysStephen A. Seidel, Kaushik Sarkar, Charles J. Colbourn, Violet R. Syrotiuk. 349-360 [doi]
- An Efficient Representation of Partitions of IntegersKentaro Sumigawa, Kunihiko Sadakane. 361-373 [doi]
- How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be?Jean-François Culus, Sophie Toulouse. 374-386 [doi]