Borrow it
 African Studies Library
 Alumni Medical Library
 Astronomy Library
 Fineman and Pappas Law Libraries
 Frederick S. Pardee Management Library
 Howard Gotlieb Archival Research Center
 Mugar Memorial Library
 Music Library
 Pikering Educational Resources Library
 School of Theology Library
 Science & Engineering Library
 Stone Science Library
The Resource Algorithms and Discrete Applied Mathematics : Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 1618, 2017, Proceedings, edited by Daya Gaur, N.S. Narayanaswamy, (electronic resource)
Algorithms and Discrete Applied Mathematics : Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 1618, 2017, Proceedings, edited by Daya Gaur, N.S. Narayanaswamy, (electronic resource)
Resource Information
The item Algorithms and Discrete Applied Mathematics : Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 1618, 2017, Proceedings, edited by Daya Gaur, N.S. Narayanaswamy, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Algorithms and Discrete Applied Mathematics : Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 1618, 2017, Proceedings, edited by Daya Gaur, N.S. Narayanaswamy, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
 Summary
 This book constitutes the proceedings of the Third International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2017, held in Goa, India, in February 2017. The 32 papers presented in this volume were carefully reviewed and selected from 103 submissions. They deal with the following areas: algorithms, graph theory, codes, polyhedral combinatorics, computational geometry, and discrete geometry.
 Language
 eng
 Extent
 XIX, 372 p. 72 illus.
 Contents

 Optimal embedding of locally twisted cubes into grids
 Polynomial Time Algorithms for Bichromatic Problems
 Voronoi Diagram for Convex Polygonal Sites with Convex PolygonOffset Distance Function
 Optimum Gathering of Asynchronous Robots
 Improved bounds for poset sorting in the forbiddencomparison regime
 Positional Dominance: Concepts and Algorithms
 Accurate LowSpace Approximation of Metric kMedian for InsertionOnly Streams
 Querying Relational Event Graphs using Colored Range Searching Data Structures
 Axiomatic Characterization of the Interval Function of a Bipartite Graph
 Analysis of 2Opt Heuristic for the Winner Determination Problem under the ChamberlinCourant System
 On Structural Parameterizations of Graph Motif and Chromatic Number
 On chromatic number of colored mixed graphs
 Optimizing movement in a convex pathnetwork to establish connectivity
 On colouring point visibility graphs
 Decomposing semicomplete multigraphs and directed graphs into paths of length two
 On Rank and MDR Cyclic codes of length 2k over Z8
 Group Distance Magic Labeling of Crn
 Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs
 Incremental algorithms to update visibility polygons
 Liar's Domination in 2D
 Structured Instances of Restricted Assignment with Two Processing Times
 Elusiveness of finding degrees
 Maximum weighted independent sets with a budget
 Demand hitting and covering of intervals
 Exact And Parameterized Algorithms For (k; i)coloring
 The Graph of the Pedigree Polytope is Asymptotically Almost Complete. – Induced matching in some subclasses of bipartite graphs
 Hamiltonicity in Split Graphs  a dichotomy
 Finding Large Independent Sets in Line of Sight Networks
 A lower bound of the cdchromatic number and its complexity
 Stability number and kHamiltonian [a,b]factors
 Subgraphs with orthogonal [0; ki]n1factorizations in graphs
 Isbn
 9783319530079
 Label
 Algorithms and Discrete Applied Mathematics : Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 1618, 2017, Proceedings
 Title
 Algorithms and Discrete Applied Mathematics
 Title remainder
 Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 1618, 2017, Proceedings
 Statement of responsibility
 edited by Daya Gaur, N.S. Narayanaswamy
 Subject

 Computer graphics
 Data structures (Computer science)
 Computer Graphics
 Computer science
 Computer science
 Algorithm Analysis and Problem Complexity
 Computer Science
 Computer Science
 Data Structures
 Algorithms
 Discrete Mathematics in Computer Science
 Computer science  Mathematics
 Data structures (Computer science)
 Numeric Computing
 Numerical analysis
 Electronic resources
 Algorithms
 Numerical analysis
 Computer graphics
 Algorithms
 Computer science  Mathematics
 Computer Science
 Computer Graphics
 Computer science
 Language
 eng
 Summary
 This book constitutes the proceedings of the Third International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2017, held in Goa, India, in February 2017. The 32 papers presented in this volume were carefully reviewed and selected from 103 submissions. They deal with the following areas: algorithms, graph theory, codes, polyhedral combinatorics, computational geometry, and discrete geometry.
 Image bit depth
 0
 LC call number
 QA76.9.A43
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName

 Gaur, Daya.
 Narayanaswamy, N.S.
 SpringerLink
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 10156
 http://library.link/vocab/subjectName

 Computer science
 Data structures (Computer science)
 Algorithms
 Numerical analysis
 Computer science
 Computer graphics
 Computer Science
 Algorithm Analysis and Problem Complexity
 Data Structures
 Discrete Mathematics in Computer Science
 Numeric Computing
 Computer Graphics
 Algorithms
 Label
 Algorithms and Discrete Applied Mathematics : Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 1618, 2017, Proceedings, edited by Daya Gaur, N.S. Narayanaswamy, (electronic resource)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents
 Optimal embedding of locally twisted cubes into grids  Polynomial Time Algorithms for Bichromatic Problems  Voronoi Diagram for Convex Polygonal Sites with Convex PolygonOffset Distance Function  Optimum Gathering of Asynchronous Robots  Improved bounds for poset sorting in the forbiddencomparison regime  Positional Dominance: Concepts and Algorithms  Accurate LowSpace Approximation of Metric kMedian for InsertionOnly Streams  Querying Relational Event Graphs using Colored Range Searching Data Structures  Axiomatic Characterization of the Interval Function of a Bipartite Graph  Analysis of 2Opt Heuristic for the Winner Determination Problem under the ChamberlinCourant System  On Structural Parameterizations of Graph Motif and Chromatic Number  On chromatic number of colored mixed graphs  Optimizing movement in a convex pathnetwork to establish connectivity  On colouring point visibility graphs  Decomposing semicomplete multigraphs and directed graphs into paths of length two  On Rank and MDR Cyclic codes of length 2k over Z8  Group Distance Magic Labeling of Crn  Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs  Incremental algorithms to update visibility polygons  Liar's Domination in 2D  Structured Instances of Restricted Assignment with Two Processing Times  Elusiveness of finding degrees  Maximum weighted independent sets with a budget  Demand hitting and covering of intervals  Exact And Parameterized Algorithms For (k; i)coloring  The Graph of the Pedigree Polytope is Asymptotically Almost Complete. – Induced matching in some subclasses of bipartite graphs  Hamiltonicity in Split Graphs  a dichotomy  Finding Large Independent Sets in Line of Sight Networks  A lower bound of the cdchromatic number and its complexity  Stability number and kHamiltonian [a,b]factors  Subgraphs with orthogonal [0; ki]n1factorizations in graphs
 Dimensions
 unknown
 Extent
 XIX, 372 p. 72 illus.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783319530079
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/9783319530079
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783319530079
 Label
 Algorithms and Discrete Applied Mathematics : Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 1618, 2017, Proceedings, edited by Daya Gaur, N.S. Narayanaswamy, (electronic resource)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents
 Optimal embedding of locally twisted cubes into grids  Polynomial Time Algorithms for Bichromatic Problems  Voronoi Diagram for Convex Polygonal Sites with Convex PolygonOffset Distance Function  Optimum Gathering of Asynchronous Robots  Improved bounds for poset sorting in the forbiddencomparison regime  Positional Dominance: Concepts and Algorithms  Accurate LowSpace Approximation of Metric kMedian for InsertionOnly Streams  Querying Relational Event Graphs using Colored Range Searching Data Structures  Axiomatic Characterization of the Interval Function of a Bipartite Graph  Analysis of 2Opt Heuristic for the Winner Determination Problem under the ChamberlinCourant System  On Structural Parameterizations of Graph Motif and Chromatic Number  On chromatic number of colored mixed graphs  Optimizing movement in a convex pathnetwork to establish connectivity  On colouring point visibility graphs  Decomposing semicomplete multigraphs and directed graphs into paths of length two  On Rank and MDR Cyclic codes of length 2k over Z8  Group Distance Magic Labeling of Crn  Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs  Incremental algorithms to update visibility polygons  Liar's Domination in 2D  Structured Instances of Restricted Assignment with Two Processing Times  Elusiveness of finding degrees  Maximum weighted independent sets with a budget  Demand hitting and covering of intervals  Exact And Parameterized Algorithms For (k; i)coloring  The Graph of the Pedigree Polytope is Asymptotically Almost Complete. – Induced matching in some subclasses of bipartite graphs  Hamiltonicity in Split Graphs  a dichotomy  Finding Large Independent Sets in Line of Sight Networks  A lower bound of the cdchromatic number and its complexity  Stability number and kHamiltonian [a,b]factors  Subgraphs with orthogonal [0; ki]n1factorizations in graphs
 Dimensions
 unknown
 Extent
 XIX, 372 p. 72 illus.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783319530079
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/9783319530079
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783319530079
Subject
 Algorithm Analysis and Problem Complexity
 Algorithms
 Algorithms
 Algorithms
 Computer Graphics
 Computer Graphics
 Computer Science
 Computer Science
 Computer Science
 Computer graphics
 Computer graphics
 Computer science
 Computer science
 Computer science
 Computer science  Mathematics
 Computer science  Mathematics
 Data Structures
 Data structures (Computer science)
 Data structures (Computer science)
 Discrete Mathematics in Computer Science
 Electronic resources
 Numeric Computing
 Numerical analysis
 Numerical analysis
Member of
Library Locations

African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 71.108227


Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 71.105717

Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 71.107023

Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 71.099547

Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 71.108227


Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 71.108227

Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 71.101425

School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 71.107235

Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 71.102257

Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/AlgorithmsandDiscreteAppliedMathematics/aQw04fuFEL4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsandDiscreteAppliedMathematics/aQw04fuFEL4/">Algorithms and Discrete Applied Mathematics : Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 1618, 2017, Proceedings, edited by Daya Gaur, N.S. Narayanaswamy, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Algorithms and Discrete Applied Mathematics : Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 1618, 2017, Proceedings, edited by Daya Gaur, N.S. Narayanaswamy, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/AlgorithmsandDiscreteAppliedMathematics/aQw04fuFEL4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsandDiscreteAppliedMathematics/aQw04fuFEL4/">Algorithms and Discrete Applied Mathematics : Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 1618, 2017, Proceedings, edited by Daya Gaur, N.S. Narayanaswamy, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>