책 이미지
책 정보
· 분류 : 외국도서 > 컴퓨터 > 컴퓨터 공학
· ISBN : 9783031521126
· 쪽수 : 502쪽
· 출판일 : 2024-01-21
목차
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 and Counting 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.














