The 13th International Conference and Workshops on Algorithms and Computation
February 27 - March 02, 2019 | Indian Institute of Technology Guwahati (IIT Guwahati)
Chrome CSS Drop Down Menu
Accepted Papers
Paper No. Authors Paper Title
14 Sang Won Bae, Arpita Baral and Priya Ranjan Sinha Mahapatra Maximum-Width Empty Square and Rectangular Annulus
20 Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jerome Monnot and Florian Sikora Weighted Upper Edge Cover: complexity and approximability
21 Yiyang Jia, Yoshihiro Kanamori and Jun Mitani Flat-foldability for 1×n maps with square/diagonal grid patterns
22 Javier T. Akagi, Carlos F. Gaona, Fabricio Mendoza, Manjil P. Saikia and Marcos Villagra Hard and Easy Instances of L-Tromino Tilings
26 Christian Scheffer The Prefix Fréchet Similarity
27 Emilio Di Giacomo, William Lenhart, Giuseppe Liotta, Timothy Randolph and Alessandra Tappini (k,p)-Planarity: A Relaxation of Hybrid Planarity
30 Duygu Vietz, Stefan Hoffmann and Egon Wanke Computing the metric dimension by decomposing graphs into extended biconnected components
33 Max Bannach, Malte Skambath and Till Tantau Towards Work-Efficient Parallel Parameterized Algorithms
34 Koichi Mizunashi, Takashi Horiyama and Ryuhei Uehara Efficient algorithm for box folding
37 Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu and Buddhadeb Sau Arbitrary Pattern Formation on Infinite Grid by Asynchronous Oblivious Robots
44 Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter and Nina Zimbel Drawing Clustered Graphs on Disk Arrangements
45 Stefan Klootwijk, Bodo Manthey and Sander Visser Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics
51 Shareef Ahmed, Shin-Ichi Nakano and Md. Saidur Rahman r-Gatherings on a Star
53 Ajinkya Borle and Samuel Lomonaco Analyzing the Quantum Annealing Approach for Solving Linear Least Squares Problems
60 Venkatakrishnan Y B and Naresh Kumar H On the Algorithmic Complexity of Double vertex-edge domination in graphs
61 Hyeyun Yang and Antoine Vigneron Matching Sets of Line Segments
63 Wing-Kin Sung Greedy consensus tree and maximum greedy consensus tree problems
67 Mirza Galib Anwarul Husain Baig, Deepanjan Kesh and Chirag Sodani A Two Query Adaptive Bitprobe Scheme Storing Five Elements
68 Takuya Tamori and Kei Kimura A Fast Algorithm for Unbounded Monotone Integer Linear Systems with Two Variables per Inequality via Graph Decomposition
71 Soh Kumabe, Takanori Maehara and Ryoma Sin'Ya Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem
85 Ivor Hoog V.D., Marc Van Kreveld, Wouter Meulemans, Kevin Verbeek and Jules Wulms Topological stability of kinetic k-centers
87 Anik Sarker, Wing-Kin Sung and M. Sohel Rahman A linear time algorithm for the $r$-gathering problem on line (Extended Abstract)
88 Shuji Jimbo and Akira Maruoka The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP Solver
89 Lukas Barth, Guido Brückner, Paul Jungeblut and Marcel Radermacher Multilevel Planarity
90 Helmut Alt, Otfried Cheong, Ji-Won Park and Nadja Scharf 3D-disk-packing
92 Satyabrata Jana and Supantha Pandit Covering and Packing of Rectilinear Subdivision
93 Joseph S. B. Mitchell and Supantha Pandit Minimum Membership Covering and Hitting
95 Ali Alatabbi, Jackie Daykin, Neerja Mhaskar, M. Sohel Rahman and William F. Smyth Applications of V-Order: Suffix arrays, the Burrows-Wheeler transform & the FM-index
97 Pawan Kumar Mishra, Sangram Kishor Jena, Gautam K Das and S V Rao Capacitated Discrete Unit Disk Cover
100 Masahiro Okubo, Tesshu Hanaka and Hirotaka Ono Optimal Partition of a Tree with Social Distance
© 2019 WALCOM 2019: The 13th International Conference and Workshops on Algorithms and Computation