1 option
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 / edited by Leszek Gąsieniec.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Lecture Notes in Computer Science, 1611-3349 ; 13878
- Language:
- English
- Subjects (All):
- Computer science.
- Numerical analysis.
- Computer science--Mathematics.
- Discrete mathematics.
- Artificial intelligence.
- Computer engineering.
- Computer networks.
- Theory of Computation.
- Numerical Analysis.
- Discrete Mathematics in Computer Science.
- Symbolic and Algebraic Manipulation.
- Artificial Intelligence.
- Computer Engineering and Networks.
- Local Subjects:
- Theory of Computation.
- Numerical Analysis.
- Discrete Mathematics in Computer Science.
- Symbolic and Algebraic Manipulation.
- Artificial Intelligence.
- Computer Engineering and Networks.
- Physical Description:
- 1 online resource (401 pages)
- Edition:
- 1st ed. 2023.
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2023.
- Summary:
- 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. .
- Contents:
- 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.
- Notes:
- Includes bibliographical references and index.
- Other Format:
- Print version: Gąsieniec, Leszek SOFSEM 2023: Theory and Practice of Computer Science
- ISBN:
- 9783031231018
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.