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 /

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 p...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Autor Corporativo: SpringerLink (Online service)
Outros Autores: Gąsieniec, Leszek (Editor)
Formato: Recurso Eletrônico livro eletrônico
Idioma:inglês
Publicado em: Cham : Springer International Publishing : Imprint: Springer, 2023.
Edição:1st ed. 2023.
coleção:Lecture Notes in Computer Science, 13878
Assuntos:
Acesso em linha:https://doi.org/10.1007/978-3-031-23101-8
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!

MARC

LEADER 00000nam a22000005i 4500
001 978-3-031-23101-8
003 DE-He213
005 20260810170031.0
007 cr nn 008mamaa
008 221219s2023 sz | o |||| 0|eng d
020 |a 9783031231018  |9 978-3-031-23101-8 
024 7 |a 10.1007/978-3-031-23101-8  |2 doi 
050 4 |a QA75.5-76.95 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a SOFSEM 2023: Theory and Practice of Computer Science  |h [electronic resource] :  |b 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15–18, 2023, Proceedings /  |c edited by Leszek Gąsieniec. 
250 |a 1st ed. 2023. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2023. 
300 |a 1 online resource (XI, 402 p. 113 illus.).  |b 85 illus. in color. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 1611-3349 ;  |v 13878 
505 0 |a 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. 
520 |a 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. . 
588 |a Print version record. 
650 0 |a Computer science. 
650 0 |a Numerical analysis. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Discrete mathematics. 
650 0 |a Artificial intelligence. 
650 0 |a Computer engineering. 
650 0 |a Computer networks . 
650 1 4 |a Theory of Computation. 
650 2 4 |a Numerical Analysis. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Symbolic and Algebraic Manipulation. 
650 2 4 |a Artificial Intelligence. 
650 2 4 |a Computer Engineering and Networks. 
700 1 |a Gąsieniec, Leszek.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783031231001 
776 0 8 |i Printed edition:  |z 9783031231025 
830 0 |a Lecture Notes in Computer Science,  |x 1611-3349 ;  |v 13878 
856 4 0 |u https://doi.org/10.1007/978-3-031-23101-8 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-SXPS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710) 
950 |a Springer Nature Proceedings Computer Science (SpringerNature-85344)