Cantitate/Preț
Produs
Total produse
Vezi coșul
SOFSEM 2023: Theory and Practice of Computer Science: 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15–18, 2023, Proceedings de Leszek Gąsieniec

SOFSEM 2023: Theory and Practice of Computer Science: 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15–18, 2023, Proceedings: Lecture Notes in Computer Science, cartea 13878

Editat de Leszek Gąsieniec
en Limba Engleză Paperback – 21 dec 2022
This book constitutes the conference proceedings of the 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, held in Nový Smokovec, Slovakia, during January 15–18, 2023. The 22 full papers presented together with 2 best papers and 2 best students papers in this book were carefully reviewed and selected from 43 submissions.
This workshop focuses on graphs problems and optimization; graph drawing and visualization; NP-hardness and fixed parameter tractability; communication and temporal graphs; complexity and learning; and robots and strings. 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 49457 lei

Preț vechi: 61821 lei
-20% Nou

Puncte Express: 742
Preț estimativ în valută:
9466€ • 9866$ • 7880£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031231001
ISBN-10: 3031231007
Pagini: 402
Ilustrații: XI, 402 p. 113 illus., 85 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.58 kg
Ediția:1st ed. 2023
Editura: Springer International Publishing
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

The Complexity of Finding Tangles.- A spectral algorithm for finding maximum cliques in dense random intersection graphs.- Solving Cut-Problems in Quadratic Time for Graphs With Bounded Treewidth.- More Effort Towards Multiagent Knapsack.- Dominance Drawings for DAGs with Bounded Modular Width.- Morphing Planar Graph Drawings Through 3D.- Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees.- Parameterized Approaches to Orthogonal Compaction.- Hardness of bounding influence via graph modification.- On the Parameterized Complexity of $s$-club Cluster Deletion Problems.- Balanced Substructures in Bicolored Graphs.- On the Complexity of Scheduling Problems With a Fixed Number of Parallel Identical Machines.- On the 2-Layer Window Width Minimization Problem.- Sequentially Swapping Tokens: Further on Graph Classes.- On the Preservation of Properties when Changing Communication Models.- Introduction to Routing Problems with Mandatory Transitions   .- Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs.- Lower Bounds for Monotone $q$-Multilinear Boolean Circuits.- A faster algorithm for determining the linear feasibility of systems of BTVPI constraints.- Quantum complexity for vector domination problem.- Learning through Imitation by using Formal Verification.- Delivery to Safety with Two Cooperating Robots.- Space-Efficient STR-IC-LCS Computation.- The k-center Problem for Classes of Cyclic Words.