|Listed in category:
Have one to sell?

WALCOM: Algorithms and Computation: 14th International Conference, WALCOM 2020,

Condition:
Like New
Item will come in original packaging and includes all accessories. Item has been tested and is in ... Read moreabout condition
Price:
US $49.99
ApproximatelyS$ 67.41
Postage:
Free Standard Shipping. See detailsfor shipping
Located in: Tyrone, Georgia, United States
Delivery:
Estimated between Fri, 31 May and Mon, 3 Jun to 43230
Delivery time is estimated using our proprietary method which is based on the buyer's proximity to the item location, the postage service selected, the seller's postage history, and other factors. Delivery times may vary, especially during peak periods.
Returns:
30 days return. Buyer pays for return shipping. See details- for more information about returns
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)

Seller information

Registered as a Business Seller
Seller assumes all responsibility for this listing.
eBay item number:155531187401

Item specifics

Condition
Like New
A book in excellent condition. Cover is shiny and undamaged, and the dust jacket is included for hard covers. No missing or damaged pages, no creases or tears, and no underlining/highlighting of text or writing in the margins. May be very minimal identifying marks on the inside cover. Very minimal wear and tear. See all condition definitionsopens in a new window or tab
Seller Notes
“Item will come in original packaging and includes all accessories. Item has been tested and is in ...
Brand
Springer
Style
ABIS_BOOK
UPC
9783030398804
ISBN
9783030398804
EAN
9783030398804
Series
Lecture Notes in Computer Science Ser.
Publication Year
2020
Type
Textbook
Format
Trade Paperback
Language
English
Publication Name
Algorithms and Computation : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 - April 2, 2020, Proceedings
Author
Kunihiko Sadakane
Item Length
9.3in
Publisher
Springer International Publishing A&G
Item Width
6.1in
Item Weight
19.6 Oz
Number of Pages
Xiii, 350 Pages

About this product

Product Information

Drawing Planar Graphs.- Space Efficient Separator Algorithms for Planar Graphs.- Recent progresses in the combinatorial and algorithmic study of phylogenetic networks.- Optimum Algorithm for the Mutual Visibility Problem.- Routing in Histograms.- A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Micro uidic Chips.- Shortest Covers of All Cyclic Shifts of a String.- Packing Trees into 1-planar Graphs.- Angle Covers: Algorithms and Complexity.- Fast Multiple Pattern Cartesian Tree Matching.- Generalized Dictionary Matching under Substring Consistent Equivalence Relations.- Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons.- Maximum Bipartite Subgraph of Geometric Intersection Graphs.- The Stub Resolution of 1-planar Graphs.- Dispersion of Mobile Robots on Grids.- Packing and Covering with Segments.- Implicit Enumeration of Topological-Minor-Embeddings and Ist Application to Planar Subgraph Enumeration.- Partitioning a graph into complementary subgraphs.- On the Maximum Edge-Pair Embedding Bipartite Matching.- Packing Arc-Disjoint Cycles in Bipartite Tournaments.- Matching random colored points with rectangles.- Designing Survivable Networks with Zero-suppressed Binary Decision Diagrams.- Approximability of the Independent Fedback Vertex Set Problem for Bipartite Graphs.- Efficient Enumeration of Non-isomorphic Ptolemaic Graphs.- Faster Privacy-Preserving Computation of Edit Distance with Moves.- Parameterized Algorithms for the Happy Set Problem.- An Experimental Study of a 1-planarity Testing and Embedding Algorithm.- Trichotomy for the recon guration problem of integer linear systems.- Train Scheduling: Hardness and Algorithms.

Product Identifiers

Publisher
Springer International Publishing A&G
ISBN-10
3030398803
ISBN-13
9783030398804
eBay Product ID (ePID)
3038580708

Product Key Features

Author
Kunihiko Sadakane
Publication Name
Algorithms and Computation : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 - April 2, 2020, Proceedings
Format
Trade Paperback
Language
English
Series
Lecture Notes in Computer Science Ser.
Publication Year
2020
Type
Textbook
Number of Pages
Xiii, 350 Pages

Dimensions

Item Length
9.3in
Item Width
6.1in
Item Weight
19.6 Oz

Additional Product Features

Series Volume Number
12049
Number of Volumes
1 Vol.
Lc Classification Number
Qa76.9.A43
Table of Content
Drawing Planar Graphs.- Space Efficient Separator Algorithms for Planar Graphs.- Recent progresses in the combinatorial and algorithmic study of phylogenetic networks.- Optimum Algorithm for the Mutual Visibility Problem.- Routing in Histograms.- A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Micro uidic Chips.- Shortest Covers of All Cyclic Shifts of a String.- Packing Trees into 1-planar Graphs.- Angle Covers: Algorithms and Complexity.- Fast Multiple Pattern Cartesian Tree Matching.- Generalized Dictionary Matching under Substring Consistent Equivalence Relations.- Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons.- Maximum Bipartite Subgraph of Geometric Intersection Graphs.- The Stub Resolution of 1-planar Graphs.- Dispersion of Mobile Robots on Grids.- Packing and Covering with Segments.- Implicit Enumeration of Topological-Minor-Embeddings and Ist Application to Planar Subgraph Enumeration.- Partitioning a graph into complementary subgraphs.- On the Maximum Edge-Pair Embedding Bipartite Matching.- Packing Arc-Disjoint Cycles in Bipartite Tournaments.- Matching random colored points with rectangles.- Designing Survivable Networks with Zero-suppressed Binary Decision Diagrams.- Approximability of the Independent Fedback Vertex Set Problem for Bipartite Graphs.- Efficient Enumeration of Non-isomorphic Ptolemaic Graphs.- Faster Privacy-Preserving Computation of Edit Distance with Moves.- Parameterized Algorithms for the Happy Set Problem.- An Experimental Study of a 1-planarity Testing and Embedding Algorithm.- Trichotomy for the recon guration problem of integer linear systems.- Train Scheduling: Hardness and Algorithms.
Copyright Date
2020
Topic
Programming / Algorithms, Information Theory, Databases / General
Illustrated
Yes
Genre
Computers

Item description from the seller

hhprimesolutions

hhprimesolutions

98.4% positive feedback
3.1K items sold
Usually responds within 24 hours

Detailed Seller Ratings

Average for the last 12 months

Accurate description
4.9
Reasonable shipping cost
4.9
Shipping speed
5.0
Communication
5.0

Seller feedback (741)

v***v (414)- Feedback left by buyer.
Past month
Verified purchase
very nice
s***t (1019)- Feedback left by buyer.
Past month
Verified purchase
Thank
n***n (240)- Feedback left by buyer.
Past month
Verified purchase
Just as described. would buy again