Algorithms and Discrete Applied Mathematics : 6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings /: 6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings. (2020)
- Record Type:
- Book
- Title:
- Algorithms and Discrete Applied Mathematics : 6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings /: 6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings. (2020)
- Main Title:
- Algorithms and Discrete Applied Mathematics : 6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings
- Further Information:
- Note: Manoj Changat, Sandip Das.
- Editors:
- Changat, Manoj
Das, Sandip - Contents:
- 0-1 Timed Matching in Bipartite Temporal Graphs.- Partitioning cographs into two forests and one independent set.- Monitoring the edges of a graph using distances.- Forbidden structure characterization of graphs having a threshold cover of size two: a simpler proof using the lexicographic method.- Approximating Modular Decomposition is Hard.- Vertex Edge Dominating Set in Unit Disk Graphs.- Geometric Planar Networks on Bichromatic Points.- Algorithmic Aspects of Global Total k-Domination in Graphs.- Hardness and approximation for the geodetic set problem in some graph classes.- Maximum Weighted Edge Biclique Problem on Bipartite Graphs.- Determining Number of Generalized and Double Generalized Petersen Graph.- Self-centeredness of generalized Petersen Graphs.- Weak Roman Bondage Number of a Graph.- On the geodetic and hull numbers of shadow Graphs.- Indicated coloring of complete expansion and lexicographic product of graphs.- Smallest C2l+1-critical graphs of odd-girth 2k + 1.- Ramsey Numbers for Line Graphs.- On Cartesian products of signed graphs.- List distinguishing number of pth power of hypercube and Cartesian powers of a graph.- On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs.- On the relative oriented clique number of planar graphs.- On the minimmum satisfiability problem.- Waiting for Trains: Complexity Results.- Oriented Diameter of Star Graphs.- Gathering over Meeting Nodes of Infinite Grid.- 0-1 Timed Matching in Bipartite Temporal Graphs.-0-1 Timed Matching in Bipartite Temporal Graphs.- Partitioning cographs into two forests and one independent set.- Monitoring the edges of a graph using distances.- Forbidden structure characterization of graphs having a threshold cover of size two: a simpler proof using the lexicographic method.- Approximating Modular Decomposition is Hard.- Vertex Edge Dominating Set in Unit Disk Graphs.- Geometric Planar Networks on Bichromatic Points.- Algorithmic Aspects of Global Total k-Domination in Graphs.- Hardness and approximation for the geodetic set problem in some graph classes.- Maximum Weighted Edge Biclique Problem on Bipartite Graphs.- Determining Number of Generalized and Double Generalized Petersen Graph.- Self-centeredness of generalized Petersen Graphs.- Weak Roman Bondage Number of a Graph.- On the geodetic and hull numbers of shadow Graphs.- Indicated coloring of complete expansion and lexicographic product of graphs.- Smallest C2l+1-critical graphs of odd-girth 2k + 1.- Ramsey Numbers for Line Graphs.- On Cartesian products of signed graphs.- List distinguishing number of pth power of hypercube and Cartesian powers of a graph.- On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs.- On the relative oriented clique number of planar graphs.- On the minimmum satisfiability problem.- Waiting for Trains: Complexity Results.- Oriented Diameter of Star Graphs.- Gathering over Meeting Nodes of Infinite Grid.- 0-1 Timed Matching in Bipartite Temporal Graphs.- Arbitrary Pattern Formation by Opaque Fat Robots with Lights.- Greedy universal cycle constructions for weak orders.- A New Model in Firefighting Theory.- An Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties.- Overlaying a hypergraph with a graph with bounded maximum degree.- Parameterized Algorithms for Directed Modular Width.- On the Complexity of Spanning Trees with a Small Vertex Cover.- Minimum Conflict free Colouring Parameterized by Treewidth.- Planar projections of graphs.- New Algorithms and Bounds for Halving Pseudolines.- Algorithms for Radon Partitions with Tolerance. … (more)
- Publisher Details:
- Cham : Springer
- Publication Date:
- 2020
- Copyright Date:
- 2020
- Extent:
- 1 online resource (490 pages)
- Subjects:
- Mathematics
Computer mathematics
Computers
Data structures (Computer science)
Computers -- Data Processing
Computers -- Computer Science
Computers -- Information Theory
Mathematical theory of computation
Computer science
Algorithms & data structures
Mathematics -- Counting & Numeration
Numerical analysis
Computer science--Mathematics - Languages:
- English
- ISBNs:
- 9783030392192
- Related ISBNs:
- 9783030392185
- Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.486699
- Ingest File:
- 03_044.xml