Arge Lars (40 results)

Paperback. Condition: Wie neu. XV, 769 S.; Ill. Like new. Shrink wrapped. Sprache: Englisch Gewicht in Gramm: 1175.

Condition: 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.…

Softcover/Paperback. Condition: Wie neu. 975 p. Like new. Shrink wrapped. / Neuwertiger Zustand. In Folie verschweißt. Sprache: Englisch Gewicht in Gramm: 1280.

Paperback. Condition: Very Good. Sorry, No international shipping on this item.Ex-library paperback in very nice condition with the usual markings and attachments.

Condition: New.

Condition: New.

Condition: New. pp. 452.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Invited Papers.- Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily).- Results and Problems on Self-adjusting Search Trees and Related Data Structures.- Classic and Quantum Network Coding.- Contributed Papers.- Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers.- Scheduling Jobs on Grid Processors.- Variable Sized Online Interval Coloring with Bandwidth.- A Simpler Linear-Time Recognition of Circular-Arc Graphs.- An Algorithm for Online Topological Ordering.- Dynamic Matching Markets and Voting Paths.- Sorting by Merging or Merging by Sorting .- Finding the Position of the k-Mismatch and Approximate Tandem Repeats.- Unbiased Matrix Rounding.- Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines.- Paging with Request Sets.- Decentralization and Mechanism Design for Online Machine Scheduling.- Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes.- Exact Computation of Maximum Induced Forest.- Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus.- On the Approximation Hardness of Some Generalizations of TSP.- Reoptimization of Minimum and Maximum Traveling Salesman's Tours.- The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights.- On Guarding Rectilinear Domains.- Approximation Algorithms for the Minimum Convex Partition Problem.- Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles.- Simultaneous Embedding with Two Bends per Edge in Polynomial Area.- Acyclic Orientation of Drawings.- Improved Algorithms for Quantum Identification of Boolean Oracles.- Approximability of Minimum AND-Circuits.- Triangles, 4-Cycles and Parameterized (In-)Tractability.- Better ApproximationSchemes for Disk Graphs.- An Approximation Algorithm for the Wireless Gathering Problem.- Minimum Membership Set Covering and the Consecutive Ones Property.- Approximating Rational Objectives Is as Easy as Approximating Linear Ones.- In-Place Algorithms for Computing (Layers of) Maxima.- Largest and Smallest Tours and Convex Hulls for Imprecise Points.- On Spanners of Geometric Graphs.- The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems.- Linear-Time Algorithms for Tree Root Problems.- Generalized Powers of Graphs and Their Algorithmic Use.…

Taschenbuch. Condition: Neu. Algorithm Theory - SWAT 2006 | 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings | Lars Arge (u. a.) | Taschenbuch | xii | Englisch | 2006 | Springer | EAN 9783540357537 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Condition: New.

Condition: New.

Condition: Gut. Zustand: Gut | Seiten: 452 | Sprache: Englisch | Produktart: Bücher | This book constitutes the refereed proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, held in Riga, Latvia, in July 2006. The proceedings includes 36 revised full papers presented together with 3 invited papers, addressing issues of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, combinatorics, sorting, searching, online algorithms, optimization, amd more.…

Taschenbuch. Condition: Neu. Algorithms - ESA 2007 | 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings | Lars Arge (u. a.) | Taschenbuch | xv | Englisch | 2007 | Springer | EAN 9783540755197 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Taschenbuch. Condition: Neu. Automata, Languages and Programming | 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings | Lars Arge (u. a.) | Taschenbuch | xvii | Englisch | 2007 | Springer | EAN 9783540734192 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 15th Annual European Symposium on Algorithms, ESA 2007, held in Eilat, Israel, in October 2007 in the context of the combined conference ALGO 2007.The 63 revised full papers presented together with abstracts of three invited lectures address all current subjects in algorithmics reaching from design and analysis issues of algorithms over to real-world applications and engineering of algorithms in various fields.…

Condition: As New. Unread book in perfect condition.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume features the refereed proceedings from the 34th International Colloquium on Automata, Languages and Programming, held in Wroclaw, Poland in July 2007. Seventy-six full papers are presented, together with four invited lectures. The papers are grouped into three major tracks covering algorithms, automata, complexity, and games; logic, semantics, and theory of programming; and security and cryptography foundations.…

Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condition: As New. Unread book in perfect condition.

Condition: New. pp. 790.

Paperback. Condition: Brand New. 1st edition. 769 pages. 9.20x6.20x1.10 inches. In Stock.

Paperback. Condition: Brand New. 1st edition. 953 pages. 9.25x6.25x1.50 inches. In Stock.

Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condition: As New. Unread book in perfect condition.

Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condition: As New. Unread book in perfect condition.

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.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book constitutes the refereed proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, held in Riga, Latvia, in July 2006. The proceedings includes 36 revised full papers presented together with 3 invited papers, addressing issues of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, combinatorics, sorting, searching, online algorithms, optimization, amd more. 452 pp. Englisch.…

Condition: New. Print on Demand pp. 452 Illus.

Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006Includes 36 revised full papers presented together with 3 invited papersAddresses issues of theoretical algorithmics and applications in various fieldsTh.…