LATIN 2008: Theoretical Informatics
Eduardo Sany Laber
Sold by buchversandmimpf2000, Emtmannsberg, BAYE, Germany
AbeBooks Seller since 23 January 2017
New - Soft cover
Condition: New
Ships from Germany to U.S.A.
Quantity: 1 available
Add to basketSold by buchversandmimpf2000, Emtmannsberg, BAYE, Germany
AbeBooks Seller since 23 January 2017
Condition: New
Quantity: 1 available
Add to basketThis item is printed on demand - Print on Demand Titel. Neuware -Profile of Tries.- Random 2-XORSAT at the Satisfiability Threshold.- On Dissemination Thresholds in Regular and Irregular Graph Classes.- How to Complete a Doubling Metric.- Sorting and Selection with Random Costs.- Guided Search and a Faster Deterministic Algorithm for 3-SAT.- Comparing and Aggregating Partially Resolved Trees.- Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices.- On Stateless Multihead Automata: Hierarchies and the Emptiness Problem.- Myhill-Nerode Theorem for Recognizable Tree Series Revisited.- The View Selection Problem for Regular Path Queries.- Optimal Higher Order Delaunay Triangulations of Polygons.- Coloring Geometric Range Spaces.- Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes.- Spanners of Complete k-Partite Geometric Graphs.- Minimum Cost Homomorphisms to Reflexive Digraphs.- On the Complexity of Reconstructing H-free Graphs from Their Star Systems.- Optimization and Recognition for K 5-minor Free Graphs in Linear Time.- Bandwidth of Bipartite Permutation Graphs in Polynomial Time.- The Online Transportation Problem: On the Exponential Boost of One Extra Server.- Average Rate Speed Scaling.- Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers.- Maximizing the Minimum Load for Selfish Agents.- Approximate Polynomial gcd: Small Degree and Small Height Perturbations.- Pseudorandom Graphs from Elliptic Curves.- Speeding-Up Lattice Reduction with Random Projections (Extended Abstract).- Sparse Approximate Solutions to Semidefinite Programs.- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints.- A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant.- Competitive Cost Sharing with Economies of Scale.- Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes.- Fully-Compressed Suffix Trees.- Improved Dynamic Rank-Select Entropy-Bound Structures.- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees.- List Update with Locality of Reference.- Approximating Steiner Networks with Node Weights.- Approximating Minimum-Power Degree and Connectivity Problems.- Energy Efficient Monitoring in Sensor Networks.- Approximation Algorithms for k-Hurdle Problems.- Approximating Crossing Minimization in Radial Layouts.- New Upper Bound on Vertex Folkman Numbers.- Ptolemaic Graphs and Interval Graphs Are Leaf Powers.- A Representation Theorem for Union-Difference Families and Application.- Algorithms to Locate Errors Using Covering Arrays.- On Injective Colourings of Chordal Graphs.- Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms.- On 2-Subcolourings of Chordal Graphs.- Collective Additive Tree Spanners of Homogeneously Orderable Graphs.- The Generalized Median Stable Matchings: Finding Them Is Not That Easy.- Stateless Near Optimal Flow Control with Poly-logarithmic Convergence.- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences.- Randomized Rendez-Vous with Limited Memory.- Origami Embedding of Piecewise-Linear Two-Manifolds.- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance.- Weighted Rectilinear Approximation of Points in the Plane.- Paths with no Small Angles.- Simpler Constant-Seed Condensers.- Parallel Repetition of the Odd Cycle Game.- I/O-Efficient Point Location in a Set of Rectangles.- Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream.- Fixed-Parameter Algorithms for Cluster VertexDeletion.- Paths and Trails in Edge-Colored Graphs.- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs.- Domination in Geometric Intersection Graphs.- An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups.- Quantum Property Testing of Group Solvability.- Solving NP-Complete Problems with Q.
Seller Inventory # 9783540787723
"About this title" may belong to another edition of this title.
Widerrufsbelehrung/ Muster-Widerrufsformular/
Allgemeine Geschäftsbedingungen und Kundeninformationen/ Datenschutzerklärung
Widerrufsrecht für Verbraucher
(Verbraucher ist jede natürliche Person, die ein Rechtsgeschäft zu Zwecken abschließt, die überwiegend weder ihrer gewerblichen noch ihrer selbstständigen beruflichen Tätigkeit zugerechnet werden können.)
Widerrufsbelehrung
Widerrufsrecht
Sie haben das Recht, binnen 14 Tagen ohne Angabe von Gründen diesen Vertrag zu widerrufen.
Die Widerrufsfr...
If you are a consumer you can withdraw from the contract in accordance with the following. Consumer means any natural person who is acting for purposes which are outside his trade, business, craft or profession.
Information regarding the right of withdrawal
Statutory right to withdraw
You have the right to withdraw from this contract within 14 days without giving any reason.
The withdrawal period will expire after 14 days from the day on which you acquire, or a third party other than the carrier and indicated by you acquires, physical possession of the last good or the last lot or piece.
To exercise the right of withdrawal, electronically fill in and submit a clear statement on our website, under "My Purchases" in "My Account". We will communicate to you an acknowledgement of receipt of such a withdrawal on a durable medium (e.g. by e-mail) without delay.
To meet the withdrawal deadline, it is sufficient for you to send your communication concerning your exercise of the right of withdrawal before the withdrawal period has expired.
Effects of withdrawal
If you withdraw from this contract, we will reimburse to you all payments received from you, including the costs of delivery (except for the supplementary costs arising if you chose a type of delivery other than the least expensive type of standard delivery offered by us).
We may make a deduction from the reimbursement for loss in value of any goods supplied, if the loss is the result of unnecessary handling by you.
We will make the reimbursement without undue delay, and not later than 14 days after the day on which we are informed about your decision to withdraw from this contract.
We will make the reimbursement using the same means of payment as you used for the initial transaction, unless you have expressly agreed otherwise; in any event, you will not incur any fees as a result of such reimbursement.
We may withhold reimbursement until we have received the goods back, or you have supplied evidence of having sent back the goods, whichever is the earliest.
You shall send back the goods or hand them over to buchversandmimpf2000, Emtmannsberg, BAYE, Germany, +49 09209-2023188, without undue delay and in any event not later than 14 days from the day on which you communicate your withdrawal from this contract to us. The deadline is met if you send back the goods before the period of 14 days has expired. You will have to bear the direct cost of returning the goods. You are only liable for any diminished value of the goods resulting from the handling other than what is necessary to establish the nature, characteristics and functioning of the goods.
Exceptions to the right of withdrawal
The right of withdrawal does not apply to:
Soweit in der Artikelbeschreibung keine andere Frist angegeben ist, erfolgt die Lieferung der Ware innerhalb von 3-5 Werktagen nach Vertragsschluss, bei Vorauszahlung erst nach Eingang des vollständigen Kaufpreises und der Versandkosten. Alle Preise inkl. MwSt.
| Order quantity | 60 to 60 business days | 60 to 60 business days |
|---|---|---|
| First item | £ 51.55 | £ 64.44 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.