LEADER 06488nam 22007455 450 001 996464385703316 005 20230329180703.0 010 $a3-030-67731-1 024 7 $a10.1007/978-3-030-67731-2 035 $a(CKB)4100000011728516 035 $a(DE-He213)978-3-030-67731-2 035 $a(MiAaPQ)EBC6460936 035 $a(PPN)253253098 035 $a(EXLCZ)994100000011728516 100 $a20210120d2021 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aSOFSEM 2021: Theory and Practice of Computer Science$b[electronic resource] $e47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25?29, 2021, Proceedings /$fedited by Tomá? Bure?, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdzi?ski, Claus Pahl, Florian Sikora, Prudence W.H. Wong 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (XVI, 624 p. 116 illus., 65 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12607 300 $aIncludes index. 311 $a3-030-67730-3 327 $aInvited Papers -- Algorithms that Access the Input via Queries -- Towards Knowledge Exchange: State-of-the-Art and Open Problems -- Invited Talk: Resilient Distributed Algorithms -- Towards Minimally Conscious Finite-State Controlled Cyber-Physical Systems ? A Manifesto -- Reconstructing Phylogenetic Networks from Sequences: Where we Stand and What to do Next -- Foundations of Computer Science ? Full Papers -- Amnesiac Flooding: Synchronous Stateless Information Dissemination -- Asymptotic Approximation by Regular Languages -- Balanced Independent and Dominating Sets on Colored Interval Graphs -- Bike Assisted Evacuation on a Line -- Blocksequences of k-local Words -- Complexity of limit-cycle problems in Boolean networks -- Concatenation Operations and Restricted Variants of Two-Dimensional Automata -- Distance Hedonic Games -- Distributed Independent Set in Interval and Segment Intersection Graphs -- Hierarchical b-Matching -- Improved algorithms for online load balancing -- Iterated Uniform Finite-State Transducers on Unary Languages -- New bounds on the half-duplex communication complexity -- Novel Results on the Number of Runs of the Burrows-Wheeler-Transform -- On the Redundancy of D-ary Fano Codes -- On the Terminal Connection Problem -- Parameterized Complexity of d-Hitting Set with Quotas -- Parameterizing Role Coloring on Forests -- The Balanced Satisfactory Partition Problem -- The Multiple Traveling Salesman Problem on Spiders -- Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs -- Using the Metro-Map Metaphor for Drawing Hypergraphs -- Weighted Microscopic Image Reconstruction -- Foundations of Computer Science ? Short Papers -- A Normal Sequence Compressed by PPM* but not by Lempel-Ziv 78 -- Clusters of repetition roots: single chains -- Drawing Two Posets -- Fair Division is Hard even for Amicable Agents -- The Complexity of Flow Expansion and Electrical Flow Expansion -- Foundations of Software Engineering ? Full papers -- An Infrastructure for Platform-Independent Experimentation of Software Changes -- Using Process Models to understand Security Standards -- Web Test Automation: Insights from the Grey Literature -- Foundations of Data Science and Engineering ? Full Papers -- A Pipeline for Measuring Brand Loyalty through Social Media Mining -- Predicting Tennis Match Outcomes With Network Analysis and Machine Learning -- Role-Based Access Control on Graph Databases -- Semi-Automatic Column Type Inference for CSV Table Understanding -- Foundations of Data Science and Engineering ? Short papers -- Metadata Management on Data Processing in Data Lakes -- S2CFT: A new approach for paper submission recommendation -- Foundations of Algorithmic Computational Biology ? Full Papers -- Adding Matrix Control: Insertion-Deletion Systems With Substitutions III -- Sorting by Multi-Cut Rearrangements -- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. 330 $aThis book contains the invited and contributed papers selected for presentation at SOFSEM 2021, the 47th International Conference on Current Trends in Theory and Practice of Computer Science, which was held online during January 25?28, 2021, hosted by the Free University of Bozen-Bolzano, Italy. The 33 full and 7 short papers included in the volume were carefully reviewed and selected from 100 submissions. They were organized in topical sections on: foundations of computer science; foundations of software engineering; foundations of data science and engineering; and foundations of algorithmic computational biology. The book also contains 5 invited papers. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12607 606 $aComputer science 606 $aData structures (Computer science) 606 $aInformation theory 606 $aImage processing?Digital techniques 606 $aComputer vision 606 $aSoftware engineering 606 $aComputer engineering 606 $aComputer networks 606 $aTheory of Computation 606 $aData Structures and Information Theory 606 $aComputer Imaging, Vision, Pattern Recognition and Graphics 606 $aSoftware Engineering 606 $aComputer Engineering and Networks 615 0$aComputer science. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aImage processing?Digital techniques. 615 0$aComputer vision. 615 0$aSoftware engineering. 615 0$aComputer engineering. 615 0$aComputer networks. 615 14$aTheory of Computation. 615 24$aData Structures and Information Theory. 615 24$aComputer Imaging, Vision, Pattern Recognition and Graphics. 615 24$aSoftware Engineering. 615 24$aComputer Engineering and Networks. 676 $a004 702 $aBures$b Tomas 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a996464385703316 996 $aSOFSEM 2021, theory and practice of computer science$92814380 997 $aUNISA