Algorithms Computation 13th International (13 results)

- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
£ 53.28
£ 2.00 shippingShips within U.S.A.Quantity: 15 available
Condition: New.

- Softcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller5-star sellerCondition: New
£ 53.01
£ 2.27 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.

- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
£ 54.34
£ 2.00 shippingShips within U.S.A.Quantity: 15 available
Condition: As New. Unread book in perfect condition.

- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 55.95
£ 11.21 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In English.

- Softcover
Seller: Books Puddle, Woodside, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 78.08
£ 3.02 shippingShips within U.S.A.Quantity: 4 available
Condition: New. 1st ed. 2019 edition NO-PA16APR2015-KAP.

- Softcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 68.79
£ 12.50 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Paperback. Condition: Brand New. 436 pages. 9.25x6.10x1.18 inches. In Stock.

- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 57.77
£ 29.20 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the proceedings of the 13th International Conference and Workshop on Algorithms and Computation, WALCOM 2019, held in Guwahati, India, in February/ March 2019.The 30 full papers presented were carefully reviewed and selected from 100 submissions. The papers are organized in topical headings on the facility location problem; computational geometry; graph drawing; graph algorithms; approximation algorithms; miscellaneous; data structures; parallel and distributed algorithms; and packing and covering.…

- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 57.77
£ 35.08 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Session 1A.- Biased Skip Lists.- Space-Efficient Data Structures for Flexible Text Retrieval Systems.- Key Independent Optimality.- On the Comparison-Addition Complexity of All-Pairs Shortest Paths.- On the Comparison-Addition Complexity of All-Pairs Shortest Paths.- On the Clique-Width of Graphs in Hereditary Classes.- On the Clique-Width of Graphs in Hereditary Classes.- The Probability of a Rendezvous Is Minimal in Complete Graphs.- The Probability of a Rendezvous Is Minimal in Complete Graphs.- On the Minimum Volume of a Perturbed Unit Cube.- On the Minimum Volume of a Perturbed Unit Cube.- Non-Delaunay-Based Curve Reconstruction.- Non-Delaunay-Based Curve Reconstruction.- Cutting a Country for Smallest Square Fit.- Cutting a Country for Smallest Square Fit.- On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter.- On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter.- Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement.- Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement.- Some Remarks on the L-Conjecture.- Some Remarks on the L-Conjecture.- Session 3A.- A Framework for Network Reliability Problems on Graphs of Bounded Treewidth.- A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation.- Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems.- Session 3B.- An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering.- Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint.- A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage.- Session 4A.- Queaps.- Funnel Heap-A Cache Oblivious Priority Queue.- Characterizing History Independent Data Structures.- Session4B.- Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set.- An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover.- Exponential Speedup of Fixed-Parameter Algorithms on K 3,3-Minor-Free or K 5-Minor-Free Graphs.- Session 5A.- Casting a Polyhedron with Directional Uncertainty.- Hierarchy of Surface Models and Irreducible Triangulation.- Algorithms and Complexity for Tetrahedralization Detections.- Session 5B.- Average-Case Communication-Optimal Parallel Parenthesis Matching.- Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks.- New Results for Energy-Efficient Broadcasting in Wireless Networks.- Session 6A.- An Improved Algorithm for the Minimum Manhattan Network Problem.- Approximate Distance Oracles Revisited.- Flat-State Connectivity of Linkages under Dihedral Motions.- Session 6B.- Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms.- Scheduling of Independent Dedicated Multiprocessor Tasks.- On the Approximability of Multiprocessor Task Scheduling Problems.- Session 7A.- Bounded-Degree Independent Sets in Planar Graphs.- Minimum Edge Ranking Spanning Trees of Threshold Graphs.- File Transfer Tree Problems.- Session 7B.- Approximation Algorithms for Some Parameterized Counting Problems.- Approximating MIN k-SAT.- Average-Case Competitive Analyses for Ski-Rental Problems.- Session 8A.- On the Clique Problem in Intersection Graphs of Ellipses.- A Geometric Approach to Boolean Matrix Multiplication.- The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing.- Session 8B.- Improved Distance Oracles for Avoiding Link-Failure.- Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks.- A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm.- Session 9A.- Crossing Minimization for Symmetries.- Simultaneous Embedding of a Planar Graph and Its Dual on the Grid.- Meaningful Information.- Session 9B.- Optimal Clearing of Supply/Demand Curves.- Partitioning Trees of Supply and Demand.- Maximizing a Voronoi Region: The Convex Case.- Invited Talks.- Random Tries.- Expected Acceptance Count.…

- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 43.52
£ 58.39 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. WALCOM: Algorithms and Computation | 13th International Conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings | Gautam K. Das (u. a.) | Taschenbuch | Lecture Notes in Computer Science | xvi | Englisch | 2018 | Springer | EAN 9783030105631 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

- Softcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: New
£ 108.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

- Softcover
- Print on Demand
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
£ 47.90
£ 6.49 shippingShips from United Kingdom to U.S.A.Quantity: 20 available
PF. Condition: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
£ 77.34
£ 6.50 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand.

- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
£ 79.04
£ 8.30 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND.