LEADER 00809nam0-22002771i-450- 001 990005015200403321 005 20080310154614.0 010 $a0-521-22458-6 035 $a000501520 035 $aFED01000501520 035 $a(Aleph)000501520FED01 035 $a000501520 100 $a19990604g19799999km-y0itay50------ba 101 0 $aita 105 $ay-------001yy 200 1 $aIrony in the medieval romance$fD.H. Green 210 $aCambridge [etc.]$cCambridge University Press$d1979. 215 $aX, 431 p.$d23 cm 700 1$aGreen$bD. H.$g$0326386 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990005015200403321 952 $aALPHA 2136$bFil.Mod. 32270$fFLFBC 959 $aFLFBC 996 $aIrony in the medieval romance$9529528 997 $aUNINA LEADER 05197nam 22007335 450 001 996647868403316 005 20250206115234.0 010 $a9783031826702 010 $a3031826701 024 7 $a10.1007/978-3-031-82670-2 035 $a(MiAaPQ)EBC31899663 035 $a(Au-PeEL)EBL31899663 035 $a(CKB)37476337800041 035 $a(DE-He213)978-3-031-82670-2 035 $a(OCoLC)1500772314 035 $a(EXLCZ)9937476337800041 100 $a20250206d2025 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aSOFSEM 2025: Theory and Practice of Computer Science $e50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20?23, 2025, Proceedings, Part I /$fedited by Rastislav Královi?, V?ra K?rková 205 $a1st ed. 2025. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2025. 215 $a1 online resource (736 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v15538 311 08$a9783031826696 311 08$a3031826698 327 $aInvited talks -- Distributed Computing by Mobile Robots: Exploring the Computational Landscape -- Open Problems and Recent Developments on a Complexity Framework for Forbidden Subgraphs -- Contributed Papers -- Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints -- Online b-Matching with Stochastic Rewards -- Shortest Longest-Path Graph Orientations for Trees -- Parameterized Complexity of Generalizations of Edge Dominating Set -- Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking -- On the Complexity of Minimum Membership Dominating Set -- On the Structural Parameterized Complexity of Defective Coloring -- Dynamic Range Minimum Queries on the Ultra-Wide Word RAM -- Fast Practical Compression of Deterministic Finite Automata -- Orienteering (with Time Windows) on Restricted Graph Classes -- Massively Parallel Maximum Coverage Revisited -- Distance Vector Domination -- Sufficient conditions for polynomial-time detection of induced minors -- Pathways to Tractability for Geometric Thickness -- Minimum Monotone Spanning Trees -- Symvonis and Alexander Wol Representing Hypergraphs by Point-Line Incidences -- Reachability in temporal graphs under perturbation -- On Computational Completeness of Semi-Conditional Matrix Grammars -- Outer-(ap)RAC Graphs -- Forest Covers and Bounded Forest Covers -- Multi-Agent Search-Type Problems on Polygons -- Generation of Cycle Permutation Graphs and Permutation Snarks -- Expected Density of Random Minimizers. 330 $aThis book constitutes the proceedings of the 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, held in Bratislava, Slovak Republic, during January 20-23, 2025. The 48 full papers presented in this book were carefully reviewed and selected from 109 submissions. They include original research from all areas of foundations of computer science and artificial intelligence focusing on AI-based algorithms and techniques, nature-inspired computing, machine learning theory, multi-agent algorithms and games, neural network theory, parallel and distributed computing, quantum computing, computability, decidability, classical and non-classical models of computation, computational complexity, computational learning, cryptographic techniques and security, data compression, data and pattern mining methods, discrete combinatorial optimization, automata, languages, machine models, rewriting systems, efficient data structures, graph structure and algorithms, logics of computation, robotics, and other relevant theory topics in computing and AI. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v15538 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.0151 700 $aKrálovi?$b Rastislav$01762326 701 $aK?rková$b V?ra$01784961 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996647868403316 996 $aSOFSEM 2025: Theory and Practice of Computer Science$94316559 997 $aUNISA