國立高雄大學圖資館 |

登入

回首頁

SOFSEM 2024theory and practice of computer science : 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19-23, 2024 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	SOFSEM 2024edited by Henning Fernau, Serge Gaspers, Ralf Klasing.
其他題名:	theory and practice of computer science : 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19-23, 2024 : proceedings /
其他作者:	Fernau, Henning.
團體作者:
出版者:	Cham :Springer Nature Switzerland :2024.
面頁冊數:	xv, 502 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Computer science
電子資源:	https://doi.org/10.1007/978-3-031-52113-3
ISBN:	9783031521133$q(electronic bk.)

SOFSEM 2024theory and practice of computer science : 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19-23, 2024 : proceedings /
SOFSEM 2024theory and practice of computer science : 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19-23, 2024 : proceedings /[electronic resource] :edited by Henning Fernau, Serge Gaspers, Ralf Klasing. - Cham :Springer Nature Switzerland :2024. - xv, 502 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,145191611-3349 ;. - Lecture notes in computer science ;4891..

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

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

ISBN: 9783031521133$q(electronic bk.)

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

252805
Computer science

LC Class. No.: QA75.5

Dewey Class. No.: 004

SOFSEM 2024theory and practice of computer science : 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19-23, 2024 : proceedings /
LDR:03938nmm a2200337 a 4500 001 676119
003 DE-He213
005 20240627175619.0
006 m d
007 cr nn 008maaau
008 250825s2024 sz s 0 eng d
020 $a 9783031521133$q(electronic bk.)
020 $a 9783031521126$q(paper)
024 7 $a 10.1007/978-3-031-52113-3 $2 doi
035 $a 978-3-031-52113-3
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 2024
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a SOFSEM 2024 $h [electronic resource] : $b theory and practice of computer science : 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19-23, 2024 : proceedings / $c edited by Henning Fernau, Serge Gaspers, Ralf Klasing.
260 $a Cham : $c 2024. $b Springer Nature Switzerland : $b Imprint: Springer,
300 $a xv, 502 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 1611-3349 ; $v 14519
505 0 $a The 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 $a This 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 $a Computer science $3 252805
650 1 4 $a Theory of Computation. $3 274475
650 2 4 $a Mathematics of Computing. $3 273710
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Symbolic and Algebraic Manipulation. $3 273720
650 2 4 $a Artificial Intelligence. $3 212515
650 2 4 $a Computer Communication Networks. $3 218087
700 1 $a Fernau, Henning. $3 469465
700 1 $a Gaspers, Serge. $3 790921
700 1 $a Klasing, Ralf. $3 563402
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u https://doi.org/10.1007/978-3-031-52113-3
950 $a Computer Science (SpringerNature-11645)