ebook img

Algorithms and Discrete Applied Mathematics: Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings PDF

380 Pages·2016·8.625 MB·English
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview Algorithms and Discrete Applied Mathematics: Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings

Sathish Govindarajan Anil Maheshwari (Eds.) Algorithms 2 0 and Discrete Applied 6 9 S C Mathematics N L Second International Conference, CALDAM 2016 Thiruvananthapuram, India, February 18–20, 2016 Proceedings 123 Lecture Notes in Computer Science 9602 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, Lancaster, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Zürich, Switzerland John C. Mitchell Stanford University, Stanford, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Dortmund, Germany Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbrücken, Germany More information about this series at http://www.springer.com/series/7407 Sathish Govindarajan Anil Maheshwari (Eds.) (cid:129) Algorithms and Discrete Applied Mathematics Second International Conference, CALDAM 2016 – Thiruvananthapuram, India, February 18 20, 2016 Proceedings 123 Editors Sathish Govindarajan Anil Maheshwari Indian Institute of Science Carleton University Bangalore Ottawa, ON India Canada ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notesin Computer Science ISBN 978-3-319-29220-5 ISBN978-3-319-29221-2 (eBook) DOI 10.1007/978-3-319-29221-2 LibraryofCongressControlNumber:2015960217 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ©SpringerInternationalPublishingSwitzerland2016 Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodologynow knownorhereafterdeveloped. Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant protectivelawsandregulationsandthereforefreeforgeneraluse. Thepublisher,theauthorsandtheeditorsaresafetoassumethattheadviceandinformationinthisbookare believedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsortheeditors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissionsthatmayhavebeenmade. Printedonacid-freepaper ThisSpringerimprintispublishedbySpringerNature TheregisteredcompanyisSpringerInternationalPublishingAGSwitzerland Preface ThisvolumecontainsthepaperspresentedatCALDAM2016:theSecondConference on AlgorithmsandDiscrete Applied Mathematics, held duringFebruary 18–20, 2016, in Thiruvanthapuram (Trivandrum), India. This conference was organized by the Department of Future Studies, University of Kerala, Thiruvananthapuram. The con- ference covered a diverse range of topics on algorithms and discrete applied mathe- matics. There were 91 submissions from 13 countries. Each submission was carefully reviewed by at least one, and on average three, Program Committee members. In addition, comments of several external reviewers were also sought. The committee decided to accept 30 papers. The conference program also included invited talks by Victor Chepoi and Surender Baswana. The first Conference on Algorithms and Discrete Applied Mathematics was held at the Indian Institute of Technology, Kanpur, during February 8–10, 2015, and the proceedingswerepublishedintheLectureNotesinComputerScience(volume8959). The first conference accepted 26 papers out of 58 submissions from 10 countries. Wewouldliketothankalltheauthorsforcontributinghigh-qualityresearchpapers to the conference. We express our sincere thanks to the Program Committee members andtheexternalreviewersforreviewingthepaperswithinaveryshortperiodoftime. We thank Springer for publishing the proceedings in the Lecture Notes in Computer Scienceseries.WethanktheinvitedspeakersVictorChepoiandSurenderBaswanafor accepting our invitation. We thank the Organizing Committee chaired by Manoj Changat from the University of Kerala for the smooth functioning of the conference. We thank the chair of the Steering Committee, Subir Ghosh, for his active help, support, and guidance throughout. We thank our sponsors Google Inc., University of Kerala, KSCSTE (Kerala State Council for Science, Technology and Environment, Government of Kerala), and CDC-IMU (Commission for Developing Countries of International Mathematical Union) for their financial support. Finally, we thank the EasyChair conference management system, which was very effective in handling the entire reviewing process. December 2015 Sathish Govindarajan Anil Maheshwari Organization Program Committee V. Aravind Institute of Mathematical Sciences, India John Augustine Indian Institute of Technology Madras, India Amitabha Bagchi Indian Institute of Technology Delhi, India Amitava Bhattacharya Tata Institute of Fundamental Research, India Boštjan Brešar University of Maribor, Slovenia Sunil Chandran Indian Institute of Science, India Manoj Changat University of Kerala, India Sandip Das Indian Statistical Institute, India Vida Dujmovic University of Ottawa, Canada Fabrizio Frati Roma Tre University, Italy Sumit Ganguly Indian Institute of Technology Kanpur, India Daya Gaur University of Lethbridge, Canada Partha Goswami University of Calcutta, India Sathish Govindarajan Indian Institute of Science, India (Co-chair) R. Inkulu Indian Institute of Technology Guwahati, India Gwenaël Joret Université Libre de Bruxelles, Belgium Shuji Kijima Kyushu University, Japan Sandi Klavzar University of Ljubljana, Slovenia Ramesh Krishnamurti Simon Fraser University, Canada Andrzej Lingas Lund University, Sweden Meena Mahajan Institute of Mathematical Sciences, India Anil Maheshwari Carleton University, Canada (Co-chair) Bojan Mohar Simon Fraser University, Canada N.S. Narayanaswamy Indian Institute of Technology Madras, India Sudebkumar Pal Indian Institute of Technology Kharagpur, India B.S. Panda Indian Institute of Technology Delhi, India Abhiram Ranade Indian Institute of Technology Bombay, India Michiel Smid Carleton University, Canada Shakhar Smorodinsky Ben Gurion University, Israel C.R. Subramanian Institute of Mathematical Sciences, India Dorothea Wagner Karlsruhe Institute of Technology, Germany David Wood Monash University, Australia VIII Organization Steering and Organizing Committee Steering Committee Subir Kumar Ghosh (Chair) Ramakrishna Mission Vivekananda University, India János Pach École Polytechnique Fédérale De Lausanne (EPFL), Switzerland Nicola Santoro Carleton University, Canada Swami Sarvattomananda Ramakrishna Mission Vivekananda University, India Peter Widmayer ETH Zürich, Switzerland Chee Yap New York University, USA Organizing Committee P.K.Radhakrishnan(Patron, University of Kerala, India Hon. Vice Chancellor) ManojChangat(Conference University of Kerala, India Chair) M. Wilcsy University of Kerala, India Achuthsankar S. Nair University of Kerala, India V.P. Mahadevan Pillai University of Kerala, India K.S. Chandrasekhar University of Kerala, India Ambat Vijayakumar Cochin University of Science and Technology, India R. Balakrishnan Bharathidasan University, India B. Kannan Cochin University of Science and Technology, India G. Santhosh Kumar Cochin University of Science and Technology, India N. Narayanan Indian Institute of Technology Madras, India S.P. Sanal Kumar University of Kerala, India Christabell P.J. University of Kerala, India Thara Prabhakaran University of Kerala, India K. Satheesh Kumar University of Kerala, India Additional Reviewers Acharya, Mukti Broersma, Hajo Angelini, Patrizio Cabello, Sergio Baixeries, Jaume Chakraborty, Dibyayan Banik, Aritra Choudhary, Aruni Basavaraju, Manu Da Lozzo, Giordano Baswana, Surender Datta, Samir Baum, Moritz Diwan, Ajit Bergamini, Elisabetta Dorbec, Paul Bhattacharya, Pritam Duong, Dung Hoang Biniaz, Ahmad Erlebach, Thomas Boucher, Delphine Floderus, Peter Organization IX Francis, Mathew Narasimhan, Sadagopan Gaertner, Bernd Nasre, Meghana Garg, Ankit Natarajan, Aravind Gologranc, Tanja Niedermann, Benjamin Hamann, Michael O., Suil Hegde, Suresh Manjanath Pal, Arindam Hinz, Andreas Pandey, Arti Iranmanesh, Ehsan Panigrahi, Pratima Issac, Davis Paul, Subhabrata Jansson, Jesper Peterin, Iztok Kalyanasundaram, Subrahmanyam Philip, Geevarghese Khodamoradi, Kamyar Pinlou, Alexandre Kizhakkepallathu, Ashik Mathew Powers, Robert Kowaluk, Miroslaw Pradhan, D. Krithika, R. Prutkin, Roman Kuziak, Dorota Radermacher, Marcel Levcopoulos, Christos Rao B.V., Raghavendra Limaye, Nutan Rebeiro, Chester Linhares Sales, Claudia Rok, Alexandre Liu, Daphne Rollova, Edita Lugosi, Gabor Roselli, Vincenzo M.S., Ramanujan Roy, Bodhayan Mathew, Rogers Sahoo, Uma Kant Mehta, Shashank Sarma, Jayalal Menezes, Bernard Sen, Sagnik Milanic, Martin Shah, Chintan Mishra, Tapas Kumar Singh, Tarkeshwar Miyano, Eiji Sivadasan, Naveen Moses Jr., William K. Sivasubramaniam, Sumathi Mukherjee, Joydeep Sledneu, Dzmitry Mukhopadhyay, Sagnik Strasser, Ben Mulder, Henry Martyn Sundararajan, R. Muthu, Rahul Sury, B. Nandakumar, Satyadev Tewari, Raghunath Nandi, Soumen Contents Randomization for Efficient Dynamic Graph Algorithms (Invited Talk). . . . . 1 Surender Baswana Algorithms for Problems on Maximum Density Segment. . . . . . . . . . . . . . . 14 Md. Shafiul Alam and Asish Mukhopadhyay Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26 Fouzul Atik and Pratima Panigrahi Color Spanning Objects: Algorithms and Hardness Results. . . . . . . . . . . . . . 37 Sandip Banerjee, Neeldhara Misra, and Subhas C. Nandy On Hamiltonian Colorings of Trees. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 Devsi Bantva On the Complexity Landscape of the Domination Chain . . . . . . . . . . . . . . . 61 CristinaBazgan,LjiljanaBrankovic,KatrinCasel,andHenningFernau On the Probability of Being Synchronizable. . . . . . . . . . . . . . . . . . . . . . . . 73 Mikhail V. Berlinkov Linear-Time Fitting of a k-Step Function . . . . . . . . . . . . . . . . . . . . . . . . . . 85 Binay Bhattacharya, Sandip Das, and Tsunehiko Kameda Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications. . . . . . . . . . . . . . . . . . . . . . . 97 Olivier Bodini, Julien David, and Philippe Marchal Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115 Manoj Changat, Ferdoos Hossein Nezhad, and Narayanan Narayanan Linear Time Algorithms for Euclidean 1-Center in Rd with Non-linear Convex Constraints. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126 Sandip Das, Ayan Nandy, and Swami Sarvottamananda Lower Bounds on the Dilation of Plane Spanners . . . . . . . . . . . . . . . . . . . . 139 Adrian Dumitrescu and Anirban Ghosh Lattice Spanners of Low Degree. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 152 Adrian Dumitrescu and Anirban Ghosh

See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.