OPAC

検索結果一覧に戻る

SOFSEM 2023: Theory and Practice of Computer Science : 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15–18, 2023, Proceedings / edited by Leszek Gąsieniec
(Lecture Notes in Computer Science. ISSN:16113349 ; 13878)

データ種別	電子ブック
版	1st ed. 2023.
出版者	(Cham : Springer International Publishing : Imprint: Springer)
出版年	2023
大きさ	XI, 402 p. 113 illus., 85 illus. in color : online resource
著者標目	Gąsieniec, Leszek editor SpringerLink (Online service)

所蔵情報を非表示

URL	巻　次	配架場所	請求記号	登録番号	コメント	刷　年	状　態	利用注記	ISBN	予約	請求メモ
URL		射水-電子	007	EB0001897	Computer Scinece R0 2005-6,2022-3				9783031231018

書誌詳細を非表示

一般注記	The Complexity of Finding Tangles -- A spectral algorithm for finding maximum cliques in dense random intersection graphs -- Solving Cut-Problems in Quadratic Time for Graphs With Bounded Treewidth -- More Effort Towards Multiagent Knapsack -- Dominance Drawings for DAGs with Bounded Modular Width -- Morphing Planar Graph Drawings Through 3D -- Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees -- Parameterized Approaches to Orthogonal Compaction -- Hardness of bounding influence via graph modification -- On the Parameterized Complexity of $s$-club Cluster Deletion Problems -- Balanced Substructures in Bicolored Graphs -- On the Complexity of Scheduling Problems With a Fixed Number of Parallel Identical Machines -- On the 2-Layer Window Width Minimization Problem -- Sequentially Swapping Tokens: Further on Graph Classes -- On the Preservation of Properties when Changing Communication Models -- Introduction to Routing Problems with Mandatory Transitions -- Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs -- Lower Bounds for Monotone $q$-Multilinear Boolean Circuits -- A faster algorithm for determining the linear feasibility of systems of BTVPI constraints -- Quantum complexity for vector domination problem -- Learning through Imitation by using Formal Verification -- Delivery to Safety with Two Cooperating Robots -- Space-Efficient STR-IC-LCS Computation -- The k-center Problem for Classes of Cyclic Words This book constitutes the conference proceedings of the 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, held in Nový Smokovec, Slovakia, during January 15–18, 2023. The 22 full papers presented together with 2 best papers and 2 best students papers in this book were carefully reviewed and selected from 43 submissions. This workshop focuses on graphs problems and optimization; graph drawing and visualization; NP-hardness and fixed parameter tractability; communication and temporal graphs; complexity and learning; and robots and strings. HTTP:URL=https://doi.org/10.1007/978-3-031-23101-8
件　名	LCSH:Computer science LCSH:Numerical analysis LCSH:Computer science—Mathematics LCSH:Discrete mathematics LCSH:Artificial intelligence LCSH:Computer engineering LCSH:Computer networks FREE:Theory of Computation FREE:Numerical Analysis FREE:Discrete Mathematics in Computer Science FREE:Symbolic and Algebraic Manipulation FREE:Artificial Intelligence FREE:Computer Engineering and Networks
分　類	LCC:QA75.5-76.95 DC23:004.0151
書誌ID	EB00001285
ISBN	9783031231018