Table of Contents

• Crossings between Curves with Many TangenciesJacob Fox, Fabrizio Frati, János Pach, Rom Pinchasi. 1-8 [doi]
• Constant-Work-Space Algorithm for a Shortest Path in a Simple PolygonTetsuo Asano, Wolfgang Mulzer, Yajun Wang. 9-20 [doi]
• Approximation Algorithms for Art Gallery Problems in Polygons and TerrainsSubir Kumar Ghosh. 21-34 [doi]
• The Hamiltonian Augmentation Problem and Its Applications to Graph DrawingEmilio Di Giacomo, Giuseppe Liotta. 35-46 [doi]
• Small Grid Drawings of Planar Graphs with Balanced BipartitionXiao Zhou, Takashi Hikino, Takao Nishizeki. 47-57 [doi]
• Switch-Regular Upward Planar Embeddings of TreesCarla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin. 58-69 [doi]
• A Global ::::k::::-Level Crossing Reduction AlgorithmChristian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Ferdinand Hübner. 70-81 [doi]
• Computation of Non-dominated Points Using Compact Voronoi DiagramsBinay Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink. 82-93 [doi]
• Cutting a Convex Polyhedron Out of a SphereSyed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam. 94-101 [doi]
• A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid MotionArijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya. 102-112 [doi]
• Acyclically 3-Colorable Planar GraphsPatrizio Angelini, Fabrizio Frati. 113-124 [doi]
• Reconstruction Algorithm for Permutation GraphsMasashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara. 125-135 [doi]
• Harmonious Coloring on Subclasses of Colinear GraphsKyriaki Ioannidou, Stavros D. Nikolopoulos. 136-148 [doi]
• Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial RestrictionsGuillaume Blin, Sylvie Hamel, Stéphane Vialette. 149-160 [doi]
• The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in ::::O::::(::::n::::log::::n::::) TimeJesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman. 161-166 [doi]
• Parallel Algorithms for Encoding and Decoding Blob CodeSaverio Caminiti, Rossella Petreschi. 167-178 [doi]
• A Rooted-Forest Partition with Uniform Vertex DemandNaoki Katoh, Shin-ichi Tanigawa. 179-190 [doi]
• A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum CliqueEtsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki. 191-203 [doi]
• On Some Simple WidthsLing-Ju Hung, Ton Kloks. 204-215 [doi]
• A New Model for a Scale-Free Hierarchical Structure of Isolated CliquesTakeya Shigezumi, Yushi Uno, Osamu Watanabe. 216-227 [doi]
• The Covert Set-Cover Problem with Application to Network DiscoverySandeep Sen, V. N. Muralidhara. 228-239 [doi]
• Variants of Spreading MessagesT. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan. 240-251 [doi]
• On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting CostSyed Ishtiaque Ahmed, Md. Mansurul Alam Bhuiyan, Masud Hasan, Ishita Kamal Khan. 252-262 [doi]
• Real Root Isolation of Multi-Exponential Polynomials with ApplicationMing Xu, Liangyu Chen, Zhenbing Zeng, Zhi-Bin Li. 263-268 [doi]
• FPT Algorithms for Connected Feedback Vertex SetNeeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar. 269-280 [doi]
• A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree GraphsMingyu Xiao. 281-292 [doi]
• Pathwidth and Searching in Parameterized Threshold GraphsD. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shashank, C. Pandu Rangan. 293-304 [doi]