Abstract is missing.
- Speeding Up Cover Time of Sparse Graphs Using Local KnowledgeMohammed Amin Abdullah, Colin Cooper, Moez Draief. 1-12 [doi]
- Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-WidthHasna Mohsen Alqahtani, Thomas Erlebach. 13-24 [doi]
- A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching ProblemStepan Artamonov, Maxim A. Babenko. 25-37 [doi]
- 1-Page and 2-Page Drawings with Bounded Number of Crossings per EdgeCarla Binucci, Emilio Di Giacomo, Md. Iqbal Hossain, Giuseppe Liotta. 38-51 [doi]
- Longest Common Extensions in Partial WordsFrancine Blanchet-Sadri, Rachel Harred, Justin Lazarow. 52-64 [doi]
- Adding Isolated Vertices Makes Some Online Algorithms OptimalJoan Boyar, Christian Kudahl. 65-76 [doi]
- Gray Codes for AT-Free Orders via AntimatroidsJou-Ming Chang, Ton Kloks, Hung-Lung Wang. 77-87 [doi]
- Enumerating Cyclic Orientations of a GraphAlessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi. 88-99 [doi]
- Filling the Complexity Gaps for Colouring Planar and Bounded Degree GraphsKonrad Kazimierz Dabrowski, François Dross, Matthew Johnson 0002, Daniël Paulusma. 100-111 [doi]
- Combinatorial Properties of Full-Flag Johnson GraphsIrving Dai. 112-123 [doi]
- List Colouring and Partial List Colouring of Graphs On-lineMartin Derka, Alejandro López-Ortiz, Daniela Maftuleac. 124-135 [doi]
- About Ungatherability of Oblivious and Asynchronous Robots on Anonymous RingsGabriele Di Stefano, Pietro Montanari, Alfredo Navarra. 136-147 [doi]
- Dynamic Subtrees Queries Revisited: The Depth First Tour TreeGabriele Farina, Luigi Laura. 148-160 [doi]
- Schröder Partitions and Schröder TableauxLuca Ferrari. 161-172 [doi]
- Algorithmic Aspects of the S-Labeling ProblemGuillaume Fertin, Irena Rusu, Stéphane Vialette. 173-184 [doi]
- Contagious Sets in Dense GraphsDaniel Freund 0001, Matthias Poloczek, Daniel Reichman. 185-196 [doi]
- Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic TimePhilippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang. 197-208 [doi]
- On the Complexity of Rainbow Coloring ProblemsEduard Eiben, Robert Ganian, Juho Lauri. 209-220 [doi]
- How to Design Graphs with Low Forwarding Index and Limited Number of EdgesFrédéric Giroire, Stéphane Pérennes, Issam Tahiri. 221-234 [doi]
- Fast Multiple Order-Preserving Matching AlgorithmsMyoungji Han, Munseong Kang, Sukhyeun Cho, Geonmo Gu, Jeong Seop Sim, Kunsoo Park. 248-259 [doi]
- Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning TreesToru Hasunuma. 260-273 [doi]
- A Faster FPTAS for the Unbounded Knapsack ProblemKlaus Jansen, Stefan Erich Julius Kraft. 274-286 [doi]
- Computational Complexity of Distance Edge LabelingDusan Knop, Tomás Masarík. 287-298 [doi]
- 1.5-Approximation Algorithm for the 2-Convex Recoloring ProblemReuven Bar-Yehuda, Gilad Kutiel, Dror Rawitz. 299-311 [doi]
- Computing the BWT and the LCP Array in Constant SpaceFelipe Alves da Louza, Guilherme P. Telles. 312-320 [doi]
- EERTREE: An Efficient Data Structure for Processing Palindromes in StringsMikhail Rubinchik, Arseny M. Shur. 321-333 [doi]
- On the Zero Forcing Number of Bijection GraphsDenys Shcherbak, Gerold Jäger, Lars-Daniel Öhman. 334-345 [doi]
- The k-Leaf Spanning Tree Problem Admits a Klam Value of 39Meirav Zehavi. 346-357 [doi]