東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

SOFSEM 2025 = theory and practice of...

SOFSEM (Conference) (2025 :)

Linked to FindBook

Google Book

Amazon

博客來

SOFSEM 2025 = theory and practice of computer science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20-23, 2025 : proceedings.. Part I /

Record Type:	Electronic resources : Monograph/item
Title/Author:	SOFSEM 2025/ edited by Rastislav Královič, Věra Kůrková.
Reminder of title:	theory and practice of computer science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20-23, 2025 : proceedings.
remainder title:	SOFSEM 2025
other author:	Královič, Rastislav.
corporate name:	SOFSEM (Conference)
Published:	Cham :Springer Nature Switzerland : : 2025.,
Description:	xxv, 363 p. :ill. (some col.), digital ;24 cm.
[NT 15003449]:	Invited 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.
Contained By:	Springer Nature eBook
Subject:	Computer science - Congresses. -
Online resource:	https://doi.org/10.1007/978-3-031-82670-2
ISBN:	9783031826702

SOFSEM 2025 = theory and practice of computer science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20-23, 2025 : proceedings.. Part I /
SOFSEM 2025theory and practice of computer science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20-23, 2025 : proceedings.Part I /[electronic resource] :SOFSEM 2025edited by Rastislav Královič, Věra Kůrková. - Cham :Springer Nature Switzerland :2025. - xxv, 363 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,155381611-3349 ;. - Lecture notes in computer science ;15538..

Invited 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.

This 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.

ISBN: 9783031826702

Standard No.: 10.1007/978-3-031-82670-2doiSubjects--Topical Terms:

606819
Computer science
--Congresses.

LC Class. No.: QA75.5

Dewey Class. No.: 004

SOFSEM 2025 = theory and practice of computer science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20-23, 2025 : proceedings.. Part I /
LDR:03909nmm a2200349 a 4500 001 2408698
003 DE-He213
005 20250206115234.0
006 m d
007 cr nn 008maaau
008 260204s2025 sz s 0 eng d
020 $a 9783031826702 $q (electronic bk.)
020 $a 9783031826696 $q (paper)
024 7 $a 10.1007/978-3-031-82670-2 $2 doi
035 $a 978-3-031-82670-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA75.5
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 004 $2 23
090 $a QA75.5 $b .S681 2025
111 2 $a SOFSEM (Conference) $n (50th : $d 2025 : $c Bratislava, Slovakia) $3 3781401
245 1 0 $a SOFSEM 2025 $h [electronic resource] : $b theory and practice of computer science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20-23, 2025 : proceedings. $n Part I / $c edited by Rastislav Královič, Věra Kůrková.
246 3 $a SOFSEM 2025
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2025.
300 $a xxv, 363 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 1611-3349 ; $v 15538
505 0 $a Invited 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.
520 $a This 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.
650 0 $a Computer science $v Congresses. $3 606819
650 1 4 $a Theory of Computation. $3 892514
650 2 4 $a Mathematics of Computing. $3 891213
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Symbolic and Algebraic Manipulation. $3 891222
650 2 4 $a Artificial Intelligence. $3 769149
650 2 4 $a Computer Communication Networks. $3 775497
700 1 $a Královič, Rastislav. $3 3781402
700 1 $a Kůrková, Věra. $3 3781403
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 15538. $3 3781404
856 4 0 $u https://doi.org/10.1007/978-3-031-82670-2
950 $a Computer Science (SpringerNature-11645)