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ț: 1053.72 lei
- 20% Preț: 337.82 lei
- 20% Preț: 339.43 lei
- 20% Preț: 449.99 lei
- 20% Preț: 238.01 lei
- 20% Preț: 337.82 lei
- 20% Preț: 438.69 lei
- Preț: 446.28 lei
- 20% Preț: 341.10 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 640.52 lei
- 17% Preț: 427.22 lei
- 20% Preț: 650.20 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1067.33 lei
- 20% Preț: 587.17 lei
- Preț: 378.43 lei
- 20% Preț: 334.54 lei
- 15% Preț: 435.36 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1404.34 lei
- 20% Preț: 1016.88 lei
- 20% Preț: 575.04 lei
- 20% Preț: 575.48 lei
- 20% Preț: 579.12 lei
- 20% Preț: 757.61 lei
- 15% Preț: 576.20 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 350.92 lei
- 20% Preț: 581.57 lei
- Preț: 407.85 lei
- 20% Preț: 592.06 lei
- 20% Preț: 757.61 lei
- 20% Preț: 819.86 lei
- 20% Preț: 649.49 lei
- 20% Preț: 347.62 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 480.04 lei
Preț vechi: 600.05 lei
-20% Nou
Puncte Express: 720
Preț estimativ în valută:
91.94€ • 94.72$ • 77.01£
91.94€ • 94.72$ • 77.01£
Carte tipărită la comandă
Livrare economică 24 februarie-10 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.