Mudgal Apurva (15 results)

Language: English
Published by Springer 2021
Series: Lecture Notes in Computer Science, Book 265 of 300. Book 265 of 300 - Lecture Notes in Computer Science
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 86.64
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.

Language: English
Published by Springer 2021
Series: Lecture Notes in Computer Science, Book 265 of 300. Book 265 of 300 - Lecture Notes in Computer Science
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
£ 102.72
£ 2.00 shippingShips within U.S.A.Quantity: 15 available
Condition: New.

Language: English
Published by Springer 2021
Series: Lecture Notes in Computer Science, Book 265 of 300. Book 265 of 300 - Lecture Notes in Computer Science
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
£ 110.26
£ 2.00 shippingShips within U.S.A.Quantity: 15 available
Condition: As New. Unread book in perfect condition.

Language: English
Published by Springer 2021
Series: Lecture Notes in Computer Science, Book 265 of 300. Book 265 of 300 - Lecture Notes in Computer Science
- Softcover
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrelandKennys Bookshop and Art Galleries Ltd.
Contact seller5-star sellerCondition: New
£ 107.88
£ 9.11 shippingShips from Ireland to U.S.A.Quantity: 15 available
Condition: New.

Language: English
Published by Springer 2021
Series: Lecture Notes in Computer Science, Book 265 of 300. Book 265 of 300 - Lecture Notes in Computer Science
- Softcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 120.20
£ 3.02 shippingShips within U.S.A.Quantity: 4 available
Condition: New. 1st ed. 2021 edition NO-PA16APR2015-KAP.

Language: English
Published by Springer-Nature New York Inc 2021
Series: Lecture Notes in Computer Science, Book 265 of 300. Book 265 of 300 - Lecture Notes in Computer Science
- Softcover
Seller: Revaluation Books, Exeter, , United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 121.36
£ 12.50 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Paperback. Condition: Brand New. 532 pages. 9.25x6.10x1.14 inches. In Stock.

Language: English
Published by Springer 2021
Series: Lecture Notes in Computer Science, Book 265 of 300. Book 265 of 300 - Lecture Notes in Computer Science
- Softcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contact seller5-star sellerCondition: New
£ 131.71
£ 7.93 shippingShips within U.S.A.Quantity: 15 available
Condition: New.

Language: English
Published by Springer 2021
Series: Lecture Notes in Computer Science, Book 265 of 300. Book 265 of 300 - Lecture Notes in Computer Science
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 77.00
£ 60.70 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Algorithms and Discrete Applied Mathematics | 7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings | Apurva Mudgal (u. a.) | Taschenbuch | Lecture Notes in Computer Science | xviii | Englisch | 2021 | Springer | EAN 9783030678982 | Verantwortliche Person für d…ie EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Language: English
Published by Springer International Publishing 2021
Series: Lecture Notes in Computer Science, Book 265 of 300. Book 265 of 300 - Lecture Notes in Computer Science
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 86.01
£ 55.49 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 7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021, which was held in Rupnagar, India, during February 11-13, 2021.The 39 papers presented in this volume were carefu…lly reviewed and selected from 82 submissions. The papers were organized in topical sections named: approximation algorithms; parameterized algorithms; computational geometry; graph theory; combinatorics and algorithms; graph algorithms; and computational complexity.

Language: English
Published by Springer 2021
Series: Lecture Notes in Computer Science, Book 265 of 300. Book 265 of 300 - Lecture Notes in Computer Science
- Softcover
- Print on Demand
Seller: Brook Bookstore On Demand, Napoli, NA, ItalyBrook Bookstore On Demand
Contact seller3-star sellerCondition: New
£ 69.89
£ 6.94 shippingShips from Italy to U.S.A.Quantity: Over 20 available
Condition: new. Questo è un articolo print on demand.

Language: English
Published by Springer International Publishing Jan 2021 2021
Series: Lecture Notes in Computer Science, Book 265 of 300. Book 265 of 300 - Lecture Notes in Computer Science
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 86.01
£ 19.95 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book constitutes the proceedings of the 7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021, which was held in Rupnagar, India, during February 11-13, 2021.The 39 papers presented in this vo…lume were carefully reviewed and selected from 82 submissions. The papers were organized in topical sections named: approximation algorithms; parameterized algorithms; computational geometry; graph theory; combinatorics and algorithms; graph algorithms; and computational complexity. 532 pp. Englisch.

Language: English
Published by Springer International Publishing 2021
Series: Lecture Notes in Computer Science, Book 265 of 300. Book 265 of 300 - Lecture Notes in Computer Science
- Softcover
- Print on Demand
Seller: moluna, Greven, , Germanymoluna
Contact seller5-star sellerCondition: New
£ 74.59
£ 42.48 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book constitutes the proceedings of the 7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021, which was held in Rupnagar, India, during February 11-13, 2021. The 39 papers…presented in this volume were care.

Language: English
Published by Springer 2021
Series: Lecture Notes in Computer Science, Book 265 of 300. Book 265 of 300 - Lecture Notes in Computer Science
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, , United KingdomMajestic Books
Contact seller4-star sellerCondition: New
£ 122.92
£ 6.50 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand.

Language: English
Published by Springer 2021
Series: Lecture Notes in Computer Science, Book 265 of 300. Book 265 of 300 - Lecture Notes in Computer Science
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
£ 125.74
£ 8.63 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND.

Language: English
Published by Springer, Springer Jan 2021 2021
Series: Lecture Notes in Computer Science, Book 265 of 300. Book 265 of 300 - Lecture Notes in Computer Science
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
£ 86.01
£ 52.03 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Approximation Algorithms.- Online bin packing with overload cost.- Scheduling Trains with Small Stretch on a Unidirectional Line.- Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs.- Approximation Algorithms… for Orthogonal Line Centers.- Semitotal Domination on AT-free Graphs and Circle Graphs.- Burning Grids and Intervals.- Parameterized Algorithms.- On Parameterized Complexity of Liquid Democracy.- Acyclic coloring parameterized by directed clique-width. - On Structural Parameterizations of Load Coloring.- One-Sided Discrete Terrain Guarding and Chordal Graphs.- Parameterized Complexity of Locally Minimal Defensive Alliances.- Computational Geometry.- New variants of Perfect Non-crossing Matchings.- Cause I'm a Genial Imprecise Point: Outlier Detection for Uncertain Data.- A Worst-case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes.- On the Intersections of Non-homotopic Loops.- Graph Theory.- On cd-coloring of trees and co-bipartite graphs.- Cut Vertex Transit Functions of Hypergraphs.- Lexicographic Product of Digraphs and Related Boundary-Type Sets.- The Connected Domination Number of Grids.- On degree sequences and eccentricities in pseudoline arrangement graphs. - Cops and Robber on Butterflies and Solid Grids.- b-Coloring of Some Powers of Hypercubes.- Chromatic Bounds for the Subclasses of $pK_2$ -Free Graphs.- Axiomatic characterization of the median function of a block graph.- On Coupon Coloring of Cartesian Product of Some Graphs.- On the Connectivity and the Diameter of Betweenness-Uniform Graphs. -Combinatorics and Algorithms.- On algorithms to find p-ordering.- Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem.- Algorithmic analysis of priority-based bin packing.- Recursive methods for some problems in coding and random permutations.- Achieving positive rates with predetermined dictionaries.- Characterization of Dense Patterns Having Distinct Squares.- Graph Algorithms.- Failure and communication in a synchronized multi-drone system.- Memory Optimal Dispersion by Anonymous Mobile Robots.- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products. -Template-driven Rainbow Coloring of Proper Interval Graphs.- Minimum Consistent Subset of Simple Graph Classes. - Computational Complexity.- Balanced Connected Graph Partition.- Hardness Results of Global Roman Domination in Graphs.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 532 pp. Englisch.