Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding workshop has been reviewed (see Zbl 1156.68004).
Indexed articles:
Fox, Jacob; Frati, Fabrizio; Pach, János; Pinchasi, Rom, Crossings between curves with many tangencies, 1-8 [Zbl 1274.68626]
Asano, Tetsuo; Mulzer, Wolfgang; Wang, Yajun, Constant-work-space algorithm for a shortest path in a simple polygon, 9-20 [Zbl 1274.68669]
Ghosh, Subir Kumar, Approximation algorithms for art gallery problems in polygons and terrains, 21-34 [Zbl 1274.68627]
Di Giacomo, Emilio; Liotta, Giuseppe, The Hamiltonian augmentation problem and its applications to graph drawing, 35-46 [Zbl 1274.05328]
Zhou, Xiao; Hikino, Takashi; Nishizeki, Takao, Small grid drawings of planar graphs with balanced bipartition, 47-57 [Zbl 1274.68641]
Binucci, Carla; Di Giacomo, Emilio; Didimo, Walter; Rextin, Aimal, Switch-regular upward planar embeddings of trees, 58-69 [Zbl 1274.68619]
Bachmaier, Christian; Brandenburg, Franz J.; Brunner, Wolfgang; Hübner, Ferdinand, A global \(k\)-level crossing reduction algorithm, 70-81 [Zbl 1274.68615]
Bhattacharya, Binay; Bishnu, Arijit; Cheong, Otfried; Das, Sandip; Karmakar, Arindam; Snoeyink, Jack, Computation of non-dominated points using compact Voronoi diagrams, 82-93 [Zbl 1274.68617]
Ahmed, Syed Ishtiaque; Hasan, Masud; Islam, Md. Ariful, Cutting a convex polyhedron out of a sphere (extended abstract), 94-101 [Zbl 1274.68613]
Bishnu, Arijit; Das, Sandip; Nandy, Subhas C.; Bhattacharya, Bhargab B., A simple algorithm for approximate partial point set pattern matching under rigid motion, 102-112 [Zbl 1274.68620]
Angelini, Patrizio; Frati, Fabrizio, Acyclically 3-colorable planar graphs, 113-124 [Zbl 1274.05142]
Kiyomi, Masashi; Saitoh, Toshiki; Uehara, Ryuhei, Reconstruction algorithm for permutation graphs, 125-135 [Zbl 1274.05451]
Ioannidou, Kyriaki; Nikolopoulos, Stavros D., Harmonious coloring on subclasses of colinear graphs, 136-148 [Zbl 1274.05163]
Blin, Guillaume; Hamel, Sylvie; Vialette, Stéphane, Comparing RNA structures with biologically relevant operations cannot be done without strong combinatorial restrictions, 149-160 [Zbl 1274.92041]
Firoz, Jesun S.; Hasan, Masud; Khan, Ashik Z.; Rahman, M. Sohel, The 1.375 approximation algorithm for sorting by transpositions can run in \(O(n\log n)\) time, 161-166 [Zbl 1274.68686]
Caminiti, Saverio; Petreschi, Rossella, Parallel algorithms for encoding and decoding Blob code, 167-178 [Zbl 1274.68679]
Katoh, Naoki; Tanigawa, Shin-ichi, A rooted-forest partition with uniform vertex demand, 179-190 [Zbl 1274.05381]
Tomita, Etsuji; Sutani, Yoichi; Higashi, Takanori; Takahashi, Shinya; Wakatsuki, Mitsuo, A simple and faster branch-and-bound algorithm for finding a maximum clique, 191-203 [Zbl 1274.05455]
Hung, Ling-Ju; Kloks, Ton, On some simple widths, 204-215 [Zbl 1274.05380]
Shigezumi, Takeya; Uno, Yushi; Watanabe, Osamu, A new model for a scale-free hierarchical structure of isolated cliques, 216-227 [Zbl 1274.68275]
Sen, Sandeep; Muralidhara, V. N., The covert set-cover problem with application to network discovery, 228-239 [Zbl 1274.68688]
Thirumala Reddy, T. V.; Sai Krishna, D.; Pandu Rangan, C., Variants of spreading messages, 240-251 [Zbl 1274.68689]
Ahmed, Syed Ishtiaque; Bhuiyan, Md. Mansurul Alam; Hasan, Masud; Khan, Ishita Kamal, On finding a better position of a convex polygon inside a circle to minimize the cutting cost, 252-262 [Zbl 1274.68612]
Xu, Ming; Chen, Liangyu; Zeng, Zhenbing; Li, Zhi-bin, Real root isolation of multi-exponential polynomials with application, 263-268 [Zbl 1274.68691]
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath, FPT algorithms for connected feedback vertex set, 269-280 [Zbl 1274.68674]
Xiao, Mingyu, A simple and fast algorithm for Maximum Independent Set in 3-degree graphs (extended abstract), 281-292 [Zbl 1274.68678]
Krishna, D. Sai; Reddy, T. V. Thirumala; Shashank, B. Sai; Rangan, C. Pandu, Pathwidth and searching in parameterized threshold graphs, 293-304 [Zbl 1274.68673]