Finocchi irene (63 risultati)

Condizione: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

paperback. Condizione: Good. Good reading copy. May have light wear on cover/edges, otherwise good. Established Seller, We Ship Daily.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Condizione: New.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Condizione: New. In English.

Condizione: As New. Unread book in perfect condition.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New. pp. 412.

Condizione: As New. Unread book in perfect condition.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Invited Talks.- Reliable and Efficient Geometric Computing.- Beware of the Model: Reflections on Algorithmic Research.- On Search Problems in Complexity Theory and in Logic (Abstract).- Session 1.- Covering a Set of Points with a Minimum Number of Lines.- Approximation Algorithms for Capacitated Rectangle Stabbing.- In-Place Randomized Slope Selection.- Session 2.- Quadratic Programming and Combinatorial Minimum Weight Product Problems.- Counting All Solutions of Minimum Weight Exact Satisfiability.- Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms.- Session 3.- Network Discovery and Verification with Distance Queries.- Deciding the FIFO Stability of Networks in Polynomial Time.- Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates.- Session 4.- Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups.- Gathering Algorithms on Paths Under Interference Constraints.- On the Hardness of Range Assignment Problems.- Session 5.- Black Hole Search in Asynchronous Rings Using Tokens.- On Broadcast Scheduling with Limited Energy.- A Near Optimal Scheduler for On-Demand Data Broadcasts.- Session 6.- Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines.- Tighter Approximation Bounds for LPT Scheduling in Two Special Cases.- Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations.- Session 7.- Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems.- An Approximation Algorithm for a Bottleneck Traveling Salesman Problem.- On the Minimum Common Integer Partition Problem.- Session 8.- Matching Subsequences in Trees.- Distance Approximating Trees: Complexity and Algorithms.- How to PackDirected Acyclic Graphs into Small Blocks.- Session 9.- On-Line Coloring of H-Free Bipartite Graphs.- Distributed Approximation Algorithms for Planar Graphs.- A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small.- Session 10.- Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments.- Parameterized Algorithms for Hitting Set: The Weighted Case.- Fixed-Parameter Tractable Generalizations of Cluster Editing.- Session 11.- The Linear Arrangement Problem Parameterized Above Guaranteed Value.- Universal Relations and #P-Completeness.- Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes.…

Condizione: New. Refereed proceedings of the 6th Italian Conference on Algorithms and Computation, CIAC 2006Presents 33 revised full papers together with 3 invited papersCovers a broad range of algorithms and complex data structuresHere are the r.

Taschenbuch. Condizione: Neu. Neuware -The two-volume set LNCS 15679 and 15680 constitutes the refereed proceedings of the 14th International Conference on Algorithms and Complexity, CIAC 2025, held in Rome, Italy, during June 10 12, 2025.The 44 full papers included in these proceedings were carefully reviewed and selected from 110 submissions. They focus on all aspects of important venue for researchers working on computational complexity and the design, analysis, experimentation, and application of efficient algorithms and data structures. 376 pp. Englisch.…

Taschenbuch. Condizione: Neu. Neuware -.- Exact and Approximate High-Multiplicity Scheduling on Identical Machines.- Unit refutations in Horn constraint systems.- On Exact Learning of $d$-Monotone Functions.- Computational Complexity of Combinatorial Distance Matrix Realisation.- Online Range Assignment Problems.- General Position Subset Selection in Line Arrangements.- Branching Programs with Extended Memory: New Insights.- Tatami Printer: Physical ZKPs for Tatami Puzzles.- On the Price of Anarchy in Packet Routing Games with FIFO.- On the Computational Complexity of Graph Reconstruction.- Efficient Certifying Algorithms for Linear Classification.- Improved Sublinear-time Moment Estimation using Weighted Sampling.- Structural Parameterizations of Locating-Dominating Set and Test Cover.- Improved bounds for group testing in arbitrary hypergraphs.- A Parameterized Perspective of All-Colors.- On the Discrete and Semi-Continuous Versions of the Two Watchtowers Problem in the Plane.- Degree Realization by Bipartite Cactus Graphs.- On Two Simple[st] Learning Tasks.- Dynamic Filter and Retrieval with One Access to Modifiable Memory.- Longest path transversals in claw-free and $P 5$-free graphs.- Realizing Graphs with Cut Constraints.- On The Computational Complexity of Games with Uncertainty.…

Condizione: As New. Unread book in perfect condition.

Taschenbuch. Condizione: Neu. Algorithms and Complexity | 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings | Tiziana Calamoneri (u. a.) | Taschenbuch | xii | Englisch | 2006 | Springer | EAN 9783540343752 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Condizione: New.

Condizione: New.

Condizione: New.

Taschenbuch. Condizione: Neu. Neuware - The two-volume set LNCS 15679 and 15680 constitutes the refereed proceedings of the 14th International Conference on Algorithms and Complexity, CIAC 2025, held in Rome, Italy, during June 10 12, 2025.The 44 full papers included in these proceedings were carefully reviewed and selected from 110 submissions. They focus on all aspects of important venue for researchers working on computational complexity and the design, analysis, experimentation, and application of efficient algorithms and data structures.…

Condizione: New.

Paperback. Condizione: Brand New. 376 pages. 9.25x6.10x9.21 inches. In Stock.

Condizione: New.

Taschenbuch. Condizione: Neu. Algorithms and Complexity | 14th International Conference, CIAC 2025, Rome, Italy, June 10-12, 2025, Proceedings, Part I | Irene Finocchi (u. a.) | Taschenbuch | Lecture Notes in Computer Science | xiv | Englisch | 2025 | Springer | EAN 9783031929311 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Condizione: New. In English.

Condizione: New.