Isbn: 9783030678982 - algorithms and discrete applied mathematics: 7th international conference, caldam 2021, rupnagar, india, february 11–13, 2021, proceedings: 12601 (15 risultati)

Condizione: New. In English.

Condizione: New.

paperback. Condizione: Sehr gut. 532 Seiten; 9783030678982.2 Gewicht in Gramm: 1.

Condizione: New. 1st ed. 2021 edition NO-PA16APR2015-KAP.

Paperback. Condizione: Brand New. 532 pages. 9.25x6.10x1.14 inches. In Stock.

Condizione: New.

Taschenbuch. Condizione: 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 die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Taschenbuch. Condizione: 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 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.…

Condizione: gut. 2021. Algorithms and Discrete Applied Mathematics: 7th International Conference, CALDAM 2021, Rupnagar, India, February 11?13, 2021, Proceedings (Theoretical Computer Science and General Issues, Band 12601) In deutscher Sprache. pages.

Condizione: new. Questo è un articolo print on demand.

Taschenbuch. Condizione: 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 volume 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.…

Condizione: 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.&nbspThe 39 papers presented in this volume were care.…

Condizione: New. Print on Demand.

Condizione: New. PRINT ON DEMAND.

Taschenbuch. Condizione: 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.…