LEADER 00788nam a2200205 i 4500 001 991004323533307536 005 20240523160212.0 008 240523s1987 it e 000 0 ita d 040 $aBibl. Dip.le Aggr. Scienze Giuridiche - Sez. Centro Studi sul Rischio$bita 082 0 $a338.456873094528 100 1 $aCipolla, Costantino<1946- >$01737277 245 03$aIl modello Castel Goffredo /$cCostantino Cipolla ; fotografie Andrea Dal Prato ; progettazione grafica Claudia Dal Prato 260 $aCastel Goffredo :$bCassa rurale ed artigiana,$c1987 300 $a246 p.$bill.$c25 cm 650 4$aCalze$xProduzione$yCastel Goffredo 700 1 $aDal Prato, Claudia 700 1 $aDal Prato, Andrea 912 $a991004323533307536 996 $aModello Castel Goffredo$94158718 997 $aUNISALENTO LEADER 05061nam 22006615 450 001 9910373928303321 005 20251230065236.0 010 $a3-030-39219-8 024 7 $a10.1007/978-3-030-39219-2 035 $a(CKB)4100000010121594 035 $a(DE-He213)978-3-030-39219-2 035 $a(MiAaPQ)EBC6114573 035 $a(PPN)242844995 035 $a(EXLCZ)994100000010121594 100 $a20200125d2020 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms and Discrete Applied Mathematics $e6th International Conference, CALDAM 2020, Hyderabad, India, February 13?15, 2020, Proceedings /$fedited by Manoj Changat, Sandip Das 205 $a1st ed. 2020. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020. 215 $a1 online resource (XX, 490 p. 151 illus., 36 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12016 300 $aIncludes index. 311 08$a3-030-39218-X 327 $a0-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. . 330 $aThis book constitutes the proceedings of the 6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020, held in Hyderabad, India, in February 2020. The 38 papers presented together with 2 invited talks in this volume were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on graph algorithms, graph theory, combinatorial optimization, distributed algorithms, combinatorial algorithms, and computational complexity. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12016 606 $aMathematics$xData processing 606 $aComputer science$xMathematics 606 $aComputer science 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputational Mathematics and Numerical Analysis 606 $aMathematics of Computing 606 $aTheory of Computation 606 $aData Structures and Information Theory 615 0$aMathematics$xData processing. 615 0$aComputer science$xMathematics. 615 0$aComputer science. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 14$aComputational Mathematics and Numerical Analysis. 615 24$aMathematics of Computing. 615 24$aTheory of Computation. 615 24$aData Structures and Information Theory. 676 $a518 702 $aChangat$b Manoj$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aDas$b Sandip$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910373928303321 996 $aAlgorithms and Discrete Applied Mathematics$93004624 997 $aUNINA