Titlebook: SOFSEM 2016: Theory and Practice of Computer Science; 42nd International C Rūsiņš Mārtiņš Freivalds,Gregor Engels,Barbara Cat Conference pr

信条

Orthogonal Layout with Optimal Face Complexityt-orthogonal drawing with at most . reflex angles per face? For . the problem is equivalent to realizing each face as a rectangle. The problem can be reduced to a max-flow problem in some linear-size nonplanar network, but the best solutions require . time. We describe a graph matching approach that

Spirometry

控制

A Combinatorial Model of Two-Sided Search, we can test (or query) a subset of the nodes to learn whether the target occupies any of such nodes. Unlike the case of conventional group testing problems on graphs, the target in our model can move immediately after each test to any node adjacent to each present location. The search finishes whe

Entreaty

galley

atopic-rhinitis

A Natural Counting of Lambda Termsates also two families of binary trees, i.e. black-white and zigzag-free ones. We provide a constructive proof of this fact by exhibiting appropriate bijections. Moreover, we investigate the asymptotic density of .-terms containing an arbitrary fixed subterm, showing that strongly normalizing terms

Fracture

0302-9743 ractice of Computer Science, SOFSEM 2016, held inHarrachov, Czech Republic, in January 2016..The 43 fullpapers presented in this volume were carefully reviewed and selected from 116submissions. They are organized in topical sections named: foundations ofcomputer science; software engineering: method

chance

EXCEL

allergy