Abstract is missing.
- Mobility and Computations: Some Open Research DirectionsNicola Santoro. 1-3 [doi]
- Adversarial Prediction: Lossless Predictors and Fractal Like AdversariesRina Panigrahy. 4 [doi]
- A Novel Efficient Approach for Solving the Art Gallery ProblemAlexander Kröller, Mahdi Moeini, Christiane Schmidt. 5-16 [doi]
- Fixed-Orientation Equilateral Triangle Matching of Point SetsJasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid. 17-28 [doi]
- Online Exploration and Triangulation in Orthogonal Polygonal RegionsSándor P. Fekete, Sophia Rex, Christiane Schmidt. 29-40 [doi]
- A Competitive Strategy for Distance-Aware Online Shape AllocationSándor P. Fekete, Nils Schweer, Jan-Marc Reinhardt. 41-52 [doi]
- Base Location Problems for Base-Monotone RegionsJinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno. 53-64 [doi]
- Counting Maximal Points in a Query Orthogonal RectangleAnanda Swarup Das, Prosenjit Gupta, Kannan Srinathan. 65-76 [doi]
- Voronoi Game on GraphsSayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar. 77-88 [doi]
- Approximation Schemes for Covering and PackingRom Aschner, Matthew J. Katz, Gila Morgenstern, Yelena Yuditsky. 89-100 [doi]
- A Randomised Approximation Algorithm for the Hitting Set ProblemMourad El Ouali, Helena Fohlin, Anand Srivastav. 101-113 [doi]
- k-SubgraphNicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos. 114-125 [doi]
- Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of CographsChristophe Crespelle, Philippe Gambette. 126-136 [doi]
- Approximation Algorithms for the Partition Vertex Cover ProblemSuman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy. 137-145 [doi]
- Daemon Conversions in Distributed Self-stabilizing AlgorithmsWayne Goddard, Pradip K. Srimani. 146-157 [doi]
- Broadcasting in Conflict-Aware Multi-channel NetworksFrancisco Claude, Reza Dorrigiv, Shahin Kamali, Alejandro López-Ortiz, Pawel Pralat, Jazmín Romero, Alejandro Salinger, Diego Seco. 158-169 [doi]
- Shared-Memory Parallel Frontier-Based SearchShogo Takeuchi, Jun Kawahara, Akihiro Kishimoto, Shin-ichi Minato. 170-181 [doi]
- Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and MatchingTobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin. 182-193 [doi]
- k-Planar GraphsJiawei Gao, Ton Kloks, Sheung-Hung Poon. 194-205 [doi]
- Alliances and Bisection Width for Planar GraphsMartin Olsen, Morten Revsbæk. 206-216 [doi]
- The Cyclical Scheduling ProblemBinay Bhattacharya, Soudipta Chakraborty, Ehsan Iranmanesh, Ramesh Krishnamurti. 217-232 [doi]
- Generalized Rainbow Connectivity of GraphsKei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou. 233-244 [doi]
- Fixed-Parameter Tractability of Error Correction in Graphical Linear SystemsPeter Damaschke, Ömer Egecioglu, Leonid Molokov. 245-256 [doi]
- Lower Bounds for Ramsey Numbers for Complete Bipartite and 3-Uniform Tripartite SubgraphsTapas Kumar Mishra, Sudebkumar Prasant Pal. 257-264 [doi]
- Improved Fixed-Parameter Algorithm for the Minimum Weight 3-SAT ProblemVenkatesh Raman, Bal Sri Shankar. 265-273 [doi]
- On Directed Tree Realizations of Degree SetsPrasun Kumar, Jayalal Sarma M. N., Saurabh Sawlani. 274-285 [doi]
- An FPT Algorithm for Tree Deletion SetVenkatesh Raman, Saket Saurabh, Ondrej Suchý. 286-297 [doi]
- Circular Graph Drawings with Large Crossing AnglesHooman Reisi Dehkordi, Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong. 298-309 [doi]
- On Graphs That Are Not PCGsStephane Durocher, Debajyoti Mondal, Md. Saidur Rahman 0001. 310-321 [doi]
- On Embedding of Certain Recursive Trees and Stars into HypercubeRaman Indhumathi. 322-333 [doi]
- Box-Rectangular Drawings of Planar GraphsMd. Manzurul Hasan, Md. Saidur Rahman 0001, Md. Rezaul Karim. 334-345 [doi]