Liebe Besucherinnen und Besucher,
aufgrund unseres Sommerfestes sind wir am 03. September 2026 bis 14 Uhr erreichbar. Am 04. September 2026 sind wir wieder wie gewohnt für Sie da. Vielen Dank für Ihr Verständnis.
Ihr Team von Sack Fachmedien
Buch, Englisch, Band 13878, 402 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 628 g
48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15-18, 2023, Proceedings
Buch, Englisch, Band 13878, 402 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 628 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-031-23100-1
Verlag: Springer
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.Zielgruppe
Research
Autoren/Hrsg.
Weitere Infos & Material
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.
