000 04625nam a22006495i 4500
001 978-3-031-23101-8
003 DE-He213
005 20240207153513.0
007 cr nn 008mamaa
008 221219s2023 sz | s |||| 0|eng d
020 _a9783031231018
_9978-3-031-23101-8
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aSOFSEM 2023: Theory and Practice of Computer Science
_h[electronic resource] :
_b48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15-18, 2023, Proceedings /
_cedited by Leszek Gąsieniec.
250 _a1st ed. 2023.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2023.
300 _aXI, 402 p. 113 illus., 85 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13878
500 _aAcceso multiusuario
505 0 _aThe 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 _aThis 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. .
541 _fUABC ;
_cPerpetuidad
650 0 _aComputer science.
650 0 _aNumerical analysis.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aArtificial intelligence.
650 0 _aComputer engineering.
650 0 _aComputer networks .
650 1 4 _aTheory of Computation.
650 2 4 _aNumerical Analysis.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aArtificial Intelligence.
650 2 4 _aComputer Engineering and Networks.
700 1 _aGąsieniec, Leszek.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031231001
776 0 8 _iPrinted edition:
_z9783031231025
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13878
856 4 0 _zLibro electrónico
_uhttp://libcon.rec.uabc.mx:2048/login?url=https://doi.org/10.1007/978-3-031-23101-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cLIBRO_ELEC
999 _c260843
_d260842