Abstract is missing.
- Correction to: Weighted Upper Edge Cover: Complexity and ApproximabilityKaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora. [doi]
- Graph Profile Realizations and Applications to Social NetworksAmotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz. 3-14 [doi]
- Parameterized Computational Geometry via Decomposition TheoremsFahad Panolan, Saket Saurabh 0001, Meirav Zehavi. 15-27 [doi]
- r-Gatherings on a StarShareef Ahmed, Shin-Ichi Nakano, Md. Saidur Rahman 0001. 31-42 [doi]
- Topological Stability of Kinetic k-centersIvor van der Hoog, Marc J. van Kreveld, Wouter Meulemans, Kevin Verbeek, Jules Wulms. 43-55 [doi]
- A Linear Time Algorithm for the r-Gathering Problem on the Line (Extended Abstract)Anik Sarker, Wing-Kin Sung, M. Sohel Rahman. 56-66 [doi]
- Maximum-Width Empty Square and Rectangular AnnulusSang Won Bae, Arpita Baral, Priya Ranjan Sinha Mahapatra. 69-81 [doi]
- Hard and Easy Instances of L-Tromino TilingsJavier T. Akagi, Carlos F. Gaona, Fabricio Mendoza, Manjil P. Saikia, Marcos Villagra. 82-95 [doi]
- The Prefix Fréchet SimilarityChristian Scheffer. 96-107 [doi]
- Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path MetricsStefan Klootwijk, Bodo Manthey, Sander K. Visser. 108-120 [doi]
- Optimal Partition of a Tree with Social DistanceMasahiro Okubo, Tesshu Hanaka, Hirotaka Ono. 121-132 [doi]
- Flat-Foldability for 1 × n Maps with Square/Diagonal Grid PatternsYiyang Jia, Yoshihiro Kanamori, Jun Mitani. 135-147 [doi]
- (k, p)-Planarity: A Relaxation of Hybrid PlanarityEmilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini. 148-159 [doi]
- Drawing Clustered Graphs on Disk ArrangementsTamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel. 160-171 [doi]
- Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components - (Extended Abstract)Duygu Vietz, Stefan Hoffmann 0002, Egon Wanke. 175-187 [doi]
- On the Algorithmic Complexity of Double Vertex-Edge Domination in GraphsYanamandram B. Venkatakrishnan, H. Naresh Kumar. 188-198 [doi]
- The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP SolverShuji Jimbo, Akira Maruoka. 199-208 [doi]
- A Fast Algorithm for Unbounded Monotone Integer Linear Systems with Two Variables per Inequality via Graph DecompositionTakuya Tamori, Kei Kimura. 209-218 [doi]
- Multilevel PlanarityLukas Barth, Guido Brückner, Paul Jungeblut, Marcel Radermacher. 219-231 [doi]
- Weighted Upper Edge Cover: Complexity and ApproximabilityKaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora. 235-247 [doi]
- Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack ProblemSoh Kumabe, Takanori Maehara, Ryoma Sin'ya. 248-260 [doi]
- Matching Sets of Line SegmentsHyeyun Yang, Antoine Vigneron. 261-273 [doi]
- Efficient Algorithm for Box FoldingKoichi Mizunashi, Takashi Horiyama, Ryuhei Uehara. 277-288 [doi]
- Analyzing the Quantum Annealing Approach for Solving Linear Least Squares ProblemsAjinkya Borle, Samuel J. Lomonaco. 289-301 [doi]
- Greedy Consensus Tree and Maximum Greedy Consensus Tree ProblemsWing-Kin Sung. 305-316 [doi]
- A Two Query Adaptive Bitprobe Scheme Storing Five ElementsMirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani. 317-328 [doi]
- Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-indexAli Alatabbi, Jacqueline W. Daykin, Neerja Mhaskar, M. Sohel Rahman, W. F. Smyth. 329-338 [doi]
- Towards Work-Efficient Parallel Parameterized AlgorithmsMax Bannach, Malte Skambath, Till Tantau. 341-353 [doi]
- Arbitrary Pattern Formation on Infinite Grid by Asynchronous Oblivious RobotsKaustav Bose, Ranendu Adhikary, Manash Kumar Kundu, Buddhadeb Sau. 354-366 [doi]
- Packing 2D Disks into a 3D ContainerHelmut Alt, Otfried Cheong, Ji-Won Park, Nadja Scharf. 369-380 [doi]
- Covering and Packing of Rectilinear SubdivisionSatyabrata Jana, Supantha Pandit. 381-393 [doi]
- Minimum Membership Covering and HittingJoseph S. B. Mitchell, Supantha Pandit. 394-406 [doi]
- Capacitated Discrete Unit Disk CoverPawan K. Mishra, Sangram K. Jena, Gautam K. Das, S. V. Rao. 407-418 [doi]