logo
logo
x
바코드검색
BOOKPRICE.co.kr
책, 도서 가격비교 사이트
바코드검색

인기 검색어

실시간 검색어

검색가능 서점

도서목록 제공

Sofsem 2024: Theory and Practice of Computer Science: 49th International Conference on Current Trends in Theory and Practice of Computer Science, Sofs

Sofsem 2024: Theory and Practice of Computer Science: 49th International Conference on Current Trends in Theory and Practice of Computer Science, Sofs (Paperback, 2024)

Ralf Klasing, Henning Fernau, Serge Gaspers (엮은이)
Springer
166,480원

일반도서

검색중
서점 할인가 할인률 배송비 혜택/추가 실질최저가 구매하기
158,150원 -5% 0원
4,750원
153,400원 >
yes24 로딩중
교보문고 로딩중
notice_icon 검색 결과 내에 다른 책이 포함되어 있을 수 있습니다.

중고도서

검색중
서점 유형 등록개수 최저가 구매하기
로딩중

eBook

검색중
서점 정가 할인가 마일리지 실질최저가 구매하기
로딩중

책 이미지

Sofsem 2024: Theory and Practice of Computer Science: 49th International Conference on Current Trends in Theory and Practice of Computer Science, Sofs
eBook 미리보기

책 정보

· 제목 : Sofsem 2024: Theory and Practice of Computer Science: 49th International Conference on Current Trends in Theory and Practice of Computer Science, Sofs (Paperback, 2024) 
· 분류 : 외국도서 > 컴퓨터 > 컴퓨터 공학
· 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.

이 포스팅은 쿠팡 파트너스 활동의 일환으로,
이에 따른 일정액의 수수료를 제공받습니다.
이 포스팅은 제휴마케팅이 포함된 광고로 커미션을 지급 받습니다.
도서 DB 제공 : 알라딘 서점(www.aladin.co.kr)
최근 본 책