Combinatorial Algorithms: 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings: Lecture Notes in Computer Science, cartea 11638
Editat de Charles J. Colbourn, Roberto Grossi, Nadia Pisantien Limba Engleză Paperback – 11 iul 2019
Din seria Lecture Notes in Computer Science
- 20%
Preț: 323.14 lei - 20%
Preț: 461.32 lei - 20%
Preț: 460.98 lei - 20%
Preț: 390.41 lei - 20%
Preț: 526.98 lei - 15%
Preț: 388.21 lei - 20%
Preț: 461.21 lei - 20%
Preț: 390.08 lei - 20%
Preț: 496.30 lei - 20%
Preț: 461.21 lei - 20%
Preț: 389.45 lei - 15%
Preț: 461.53 lei - 20%
Preț: 389.63 lei - 20%
Preț: 496.68 lei - 20%
Preț: 461.70 lei - 20%
Preț: 251.97 lei - 20%
Preț: 390.86 lei - 20%
Preț: 532.16 lei - 20%
Preț: 461.52 lei - 20%
Preț: 255.72 lei - 20%
Preț: 498.10 lei - 20%
Preț: 497.19 lei - 20%
Preț: 499.02 lei - 20%
Preț: 389.82 lei - 20%
Preț: 390.92 lei - 20%
Preț: 390.86 lei - 20%
Preț: 390.92 lei - 20%
Preț: 390.08 lei - 20%
Preț: 461.45 lei - 20%
Preț: 392.36 lei - 20%
Preț: 460.75 lei - 20%
Preț: 461.32 lei - 20%
Preț: 389.90 lei - 20%
Preț: 639.26 lei - 20%
Preț: 390.66 lei - 20%
Preț: 391.57 lei - 20%
Preț: 389.57 lei - 20%
Preț: 497.97 lei - 20%
Preț: 462.36 lei - 20%
Preț: 460.67 lei - 20%
Preț: 423.95 lei - 5%
Preț: 515.91 lei - 15%
Preț: 535.55 lei - 20%
Preț: 531.90 lei - 20%
Preț: 403.00 lei - 20%
Preț: 535.41 lei - 20%
Preț: 461.25 lei - 20%
Preț: 498.17 lei - 20%
Preț: 461.52 lei - 20%
Preț: 249.77 lei
Preț: 465.01 lei
Preț vechi: 581.26 lei
-20%
Puncte Express: 698
Preț estimativ în valută:
82.30€ • 96.18$ • 71.45£
82.30€ • 96.18$ • 71.45£
Carte tipărită la comandă
Livrare economică 20 februarie-06 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030250041
ISBN-10: 3030250040
Pagini: 410
Ilustrații: XIX, 456 p. 335 illus., 47 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.66 kg
Ediția:1st ed. 2019
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Cham, Switzerland
ISBN-10: 3030250040
Pagini: 410
Ilustrații: XIX, 456 p. 335 illus., 47 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.66 kg
Ediția:1st ed. 2019
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Cham, Switzerland
Cuprins
A note on handicap incomplete tournaments.- Computing the k-Crossing Visibility Region of a Point in a Polygon.- An Improved Scheme in the Two Query Adaptive Bitprobe Model.- On Erdős‒Szekeres-type problems for k-convex point sets.- Algorithms and Hardness results on Liar's Dominating Set and k-tuple Dominating Set.- Fixed-parameter tractability of (n-k) List Coloring.- Finding Periods in Cartesian Tree Matching.- Parameterized Complexity of Min-Power Asymmetric Connectivity.- Solving Group Interval Scheduling Efficiently.- Call Admission on Trees with Advice (Extended Abstract).- Power Edge Set and Zero Forcing Set remain difficult in cubic graphs.- Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs.- Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs.- Dual Domination.- Reaching 3-Connectivity via Edge-edge Additions.- Cops and robber on some families of oriented graphs.- Disjoint clustering in combinatorial circuits.- The hull number in the convexity of induced paths of order 3.- Supermagic graphs with many odd degrees.- Incremental algorithm for minimum cut and edge connectivity in Hypergraph.- A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications.- Shortest-Path-Preserving Rounding.- Complexity and Algorithms for Semipaired Domination in Graphs.- Computing the Rooted Triplet Distance between Phylogenetic Networks.- Parameterized Algorithms for Graph Burning Problem.- Extension and its price for the connected vertex cover problem.- An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number.- An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs.- Complexity of fall coloring for restricted graph classes.- Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling under Precedence Constraints.- Maximum clique exhaustive search in circulant k-hypergraphs.- Burrows-Wheeler transform of words defined by morphisms.- Stable Noncrossing Matchings.- On the Average Case of MergeInsertion.- Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings.- A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber.