000 05205nam a22006255i 4500
001 978-3-031-52113-3
003 DE-He213
005 20240423130309.0
007 cr nn 008mamaa
008 240121s2024 sz | s |||| 0|eng d
020 _a9783031521133
_9978-3-031-52113-3
024 7 _a10.1007/978-3-031-52113-3
_2doi
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 2024: Theory and Practice of Computer Science
_h[electronic resource] :
_b49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19–23, 2024, Proceedings /
_cedited by Henning Fernau, Serge Gaspers, Ralf Klasing.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2024.
300 _aXV, 502 p. 82 illus., 39 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 ;
_v14519
505 0 _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 andCounting 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.
520 _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.
650 0 _aComputer science.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aArtificial intelligence.
650 0 _aComputer networks .
650 1 4 _aTheory of Computation.
650 2 4 _aMathematics of Computing.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aArtificial Intelligence.
650 2 4 _aComputer Communication Networks.
700 1 _aFernau, Henning.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aGaspers, Serge.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKlasing, Ralf.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031521126
776 0 8 _iPrinted edition:
_z9783031521140
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14519
856 4 0 _uhttps://doi.org/10.1007/978-3-031-52113-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c187104
_d187104