LEADER 05155nam 22007095 450 001 9910835057103321 005 20240121003407.0 010 $a3-031-52113-7 024 7 $a10.1007/978-3-031-52113-3 035 $a(CKB)30313959200041 035 $a(MiAaPQ)EBC31131994 035 $a(Au-PeEL)EBL31131994 035 $a(OCoLC)1420630495 035 $a(DE-He213)978-3-031-52113-3 035 $a(EXLCZ)9930313959200041 100 $a20240121d2024 u| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aSOFSEM 2024: Theory and Practice of Computer Science$b[electronic resource] $e49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19?23, 2024, Proceedings /$fedited by Henning Fernau, Serge Gaspers, Ralf Klasing 205 $a1st ed. 2024. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2024. 215 $a1 online resource (513 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14519 311 08$a9783031521126 327 $aThe Information Extraction Framework of Document Spanners - A Very Informal Survey -- Generalized Distance Polymatrix Games -- Relaxed agreement forests -- On the Computational Complexity of Generalized Common Shape Puzzles -- Fractional Bamboo Trimming and Distributed Windows Scheduling -- New support size bounds and proximity bounds for integer linear programming -- On the Parameterized Complexity of Minus Domination -- Exact and Parameterized Algorithms for Choosability -- Parameterized Algorithms for Covering by Arithmetic Progressions -- Row-column combination of Dyck words -- Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures -- On the parameterized complexity of the Perfect Phylogeny problem -- Data reduction for directed feedback vertex set on graphs without long induced cycles -- Visualization of Bipartite Graphs in Limited Window Size -- Outerplanar and Forest Storyplans -- The Complexity of Cluster Vertex Splitting and Company -- Morphing Graph Drawings in the Presence of Point Obstacles -- Word-Representable Graphs from a Word?s Perspective -- Removable Online Knapsack with Bounded Size Items -- The Complexity of Online Graph Games -- Faster Winner Determination Algorithms for (Colored) Arc Kayles -- Automata Classes Accepting Languages Whose Commutative Closure is Regular -- Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching -- Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages -- Apportionment with Thresholds: Strategic Campaigns Are Easy in the Top-Choice But Hard in the Second-Chance Mode -- Local Certification of Majority Dynamics -- Complexity of Spherical Equations in Finite Groups -- Positive Characteristic Sets for Relational Pattern Languages -- Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs -- The Weighted HOM-Problem over Fields -- Combinatorics of block-parallel automata networks -- On the piecewise complexity of words and periodic words -- Distance Labeling for Families of Cycles -- On the induced problem for fixed-template CSPs. 330 $aThis book constitutes the proceedings of the 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, held in Cochem, Germany, in February 2024. The 33 full papers presented in this book were carefully reviewed and selected from 81 submissions. The book also contains one invited talk in full paper length. They focus on original research and challenges in foundations of computer science including algorithms, AI-based methods, computational complexity, and formal models. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v14519 606 $aComputer science 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence 606 $aComputer networks 606 $aTheory of Computation 606 $aMathematics of Computing 606 $aDiscrete Mathematics in Computer Science 606 $aSymbolic and Algebraic Manipulation 606 $aArtificial Intelligence 606 $aComputer Communication Networks 615 0$aComputer science. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence. 615 0$aComputer networks. 615 14$aTheory of Computation. 615 24$aMathematics of Computing. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aArtificial Intelligence. 615 24$aComputer Communication Networks. 676 $a004 700 $aFernau$b Henning 701 $aGaspers$b Serge 701 $aKlasing$b Ralf 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910835057103321 997 $aUNINA