ACCEPTED PAPERS
- Alexander Kroeller, Mahdi Moeini and Christiane Schmidt. A Novel Exact and Efficient Approach for Solving the Art Gallery Problem.
- Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey and Heiko Röglin. Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching.
- Jasine Babu, Ahmad Biniaz, Anil Maheshwari and Michiel Smid. Fixed-Orientation Equilateral Triangle Matching of Point Sets.
- Stephane Durocher, Debajyoti Mondal and Md. Saidur Rahman. On Graphs that are not PCGs.
- Kei Uchizawa, Takanori Aoki, Takehiro Ito and Xiao Zhou. Generalized Rainbow Connectivity of Graphs.
- Rom Aschner, Matthew Katz, Gila Morgenstern and Yelena Yuditsky. Approximation Schemes for Covering and Packing.
- Sandor Fekete, Sophia Rex and Christiane Schmidt. Online Exploration and Triangulation in Orthogonal Polygonal Regions.
- Sandor Fekete, Jan-Marc Reinhardt and Nils Schweer. A Competitive Strategy for Distance-Aware Online Shape Allocation.
- Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara and Takeaki Uno. Base location problems for base-monotone regions.
- Venkatesh Raman and Balsri Shankar. Improved fixed-parameter algorithm for the minimum weight 3-SAT problem.
- Ananda Swarup Das, Prosenjit Gupta and Kannan Srinathan. Counting Maximal Points in a Query Orthogonal Rectangle.
- Peter Damaschke, Ömer Eǧecioǧlu and Leonid Molokov. Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems.
- Pradip Srimani and Wayne Goddard. Daemon Conversions in Distributed Self-Stabilizing Algorithms.
- Jiawei Gao, Ton Kloks and Sheung-Hung Poon. Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs.
- Venkatesh Raman, Saket Saurabh and Ondrej Suchy. An FPT Algorithm for Tree Deletion Set.
- Indhumathi Raman. On embedding of certain recursive trees and stars into hypercube.
- Bourgeois Nicolas, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis and Vangelis Paschos. Exact and approximation algorithms for densest k-subgraph.
- Christophe Crespelle and Philippe Gambette. Linear-time Constant-ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs.
- Md. Manzurul Hasan, Md. Saidur Rahman and Md. Rezaul Karim. Box-Rectangular Drawings of Planar Graphs.
- Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar and Sambuddha Roy. Approximation Algorithms for the Partition Vertex Cover Problem.
- Tapas Mishra and Sudebkumar Pal. Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs.
- Sayan Bandyapadhyay, Aritra Banik, Sandip Das and Hirak Sarkar. Voronoi Game on Graphs.
- Martin Olsen and Morten Revsbaek. Alliances and Bisection Width for Planar Graphs.
- Mourad El Ouali, Anand Srivastav and Helena Fohlin. A Randomised Approximation Algorithm for the Hitting Set Problem.
- Francisco Claude, Reza Dorrigiv, Shahin Kamali, Alejandro López-Ortiz, Pawel Pralat, Jazmin Romero, Alejandro Salinger and Diego Seco. Broadcasting in Conflict-Aware Multi-Channel Networks.
- Prasun Kumar, Jayalal M.N. Sarma and Saurabh Sawlani. On Directed Tree Realizations of Degree Sets.
- Hooman Reisi Dehkordi, Quan Nguyen, Peter Eades and Seokhee Hong. Circular Graph Drawings with Large Crossing Angles.
- Shogo Takeuchi, Jun Kawahara, Akihiro Kishimoto and Shin-Ichi Minato. Shared-Memory Parallel Frontier-Based Search.
- Binay Bhattacharya, Soudipta Chakraborty, Ehsan Iranmanesh and Ramesh Krishnamurti. The Cyclical Scheduling Problem.