Applied Algorithms

1. Front Matter

   PDF

2. Invited Talks

   1. Algorithmic Challenges in Digital Microfluidic Biochips: Protocols, Design, and Test

      • Bhargab B. Bhattacharya, Sudip Roy, Sukanta Bhattacharjee

      Pages 1-16

   2. Monitoring Distributed, Heterogeneous Data Streams: The Emergence of Safe Zones

      • Daniel Keren, Guy Sagy, Amir Abboud, David Ben-David, Assaf Schuster, Izchak Sharfman et al.

      Pages 17-28

   3. Exploiting Heterogeneous Data Sources: A Computing Paradigm for Live Web and Sustainability Applications

      • Dimitrios Gunopulos

      Pages 29-36

3. Contributed Talks

   1. Constructing an n-dimensional Cell Complex from a Soup of (n − 1)-Dimensional Faces

      • Ken Arroyo Ohori, Guillaume Damiand, Hugo Ledoux

      Pages 37-48

   2. A Digital-Geometric Algorithm for Generating a Complete Spherical Surface in ℤ3

      • Sahadev Bera, Partha Bhowmick, Bhargab B. Bhattacharya

      Pages 49-61

   3. Bar 1-Visibility Drawings of 1-Planar Graphs

      • Shaheena Sultana, Md. Saidur Rahman, Arpita Roy, Suraiya Tairin

      Pages 62-76

   4. Search Strategies for Subgraph Isomorphism Algorithms

      • Uroš Čibej, Jurij Mihelič

      Pages 77-88

   5. Analysis of Concentration Errors in Sample Dilution Algorithms on a Digital Microfluidic Biochip

      • Nilina Bera, Subhashis Majumder, Bhargab B. Bhattacharya

      Pages 89-100

   6. Choosing and Working of an Anonymous Leader

      • M. R. Rajeevalochana, Kannan Srinathan

      Pages 101-109

   7. An Efficient ID Based Security Algorithm for Mutual Node Authentication and Key Management: An Elliptic Curve Cryptography Based Approach

      • Nilanjan Sen

      Pages 110-121

   8. Automata for Modeling the Distributed Probabilistic Reversible Processes

      • Arpit, Afza Shafie, Wan Fatimah Wan Ahmad

      Pages 122-136

   9. Finding Influential Nodes in Social Networks Using Minimum k-Hop Dominating Set

      • Partha Basuchowdhuri, Subhashis Majumder

      Pages 137-151

   10. Efficient Heuristics for the Time Dependent Team Orienteering Problem with Time Windows

       • Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati Pantziou, Nikolaos Vathis

       Pages 152-163

   11. Color Texture Image Segmentation Based on Neutrosophic Set and Nonsubsampled Contourlet Transformation

       • Jeethu Mary Mathew, Philomina Simon

       Pages 164-173

   12. An Experimental Analysis of Vertex Coloring Algorithms on Sparse Random Graphs

       • Patrick Healy, Andrew Ju

       Pages 174-186

   13. An Experimental Study of a Novel Move-to-Front-or-Middle (MFM) List Update Algorithm

       • Rakesh Mohanty, Tirtharaj Dash, Biswadeep Khan, Shiba Prasad Dash

       Pages 187-197

   14. Too Long-Didn’t Read: A Practical Web Based Approach towards Text Summarization

       • Arjun Datt Sharma, Shaleen Deep

       Pages 198-208

   15. A Comparative Study of Tag SNP Selection Using Clustering

       • Sujay Saha, Riddhiman Dasgupta, Anirban Ghose, Koustav Mullick, Kashi Nath Dey

       Pages 209-222

   16. Application of Spectral Unmixing Algorithm on Hyperspectral Data for Mangrove Species Classification

       • Somdatta Chakravortty, Ekta Shah, Arpita Saha Chowdhury

       Pages 223-236

This book constitutes the refereed proceedings of the First International Conference on Applied Algorithms, ICAA 2014, held in Kolkata, India, in January 2014. ICAA is a new conference series with a mission to provide a quality forum for researchers working in applied algorithms. Papers presenting original contributions related to the design, analysis, implementation and experimental evaluation of efficient algorithms and data structures for problems with relevant real-world applications were sought, ideally bridging the gap between academia and industry. The 21 revised full papers presented together with 7 short papers were carefully reviewed and selected from 122 submissions.

• elliptic curve cryptography
• fuzzy clustering
• multi-path interaction
• self organising map
• social networks
• algorithm analysis and problem complexity

• Computer Science and Engineering, Heritage Institute of Technology, Kolkata, India

  Prosenjit Gupta

• Department of Computer Engineering and Informatics, University of Patras, Patras, Greece

  Christos Zaroliagis

Policies and ethics