{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":46,"n_cols":5,"rows_kept":46,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[10,2,10,3],[11,2,11,3],[21,2,21,3],[22,2,22,3],[26,2,26,3],[29,2,29,3],[29,4,29,5],[30,2,30,3],[30,4,30,5],[31,2,31,3],[31,4,31,5],[32,2,32,3],[34,2,34,3],[35,2,35,3],[36,2,36,3],[37,2,37,3],[38,2,38,3],[39,2,39,3],[40,2,40,3],[43,2,43,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466367903316"]
[null,null,"Titolo",null,"Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers / / edited by Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniel Paulusma"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008"]
[null,null,"ISBN",null,"3-540-92248-2"]
[null,null,"Edizione",null,"[1st ed. 2008.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIII, 386 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 5344"]
[null,null,"Classificazione",null,"DAT 537f"]
[{"$nulls":4},"MAT 055f"]
[{"$nulls":4},"SS 4800"]
[null,null,"Disciplina",null,"004.015115"]
[null,null,"Soggetti",null,"Algorithms"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Artificial intelligence—Data processing"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Numerical Analysis"]
[{"$nulls":4},"Data Science"]
[{"$nulls":4},"Computer Graphics"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Proceedings of the \"34th International Workshop, WG 2008, Durham, UK, June 30-July 2, 2008\"."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Invited Contributions -- (Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective -- Memory Efficient Anonymous Graph Exploration -- Algorithmic Meta Theorems -- Regular Papers -- A Most General Edge Elimination Polynomial -- Approximating the Metric TSP in Linear Time -- The Valve Location Problem in Simple Network Topologies -- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs -- On the Pseudo-achromatic Number Problem -- Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings -- Faster Exact Bandwidth -- Additive Spanners for Circle Graphs and "]
[{"$nulls":4},"Polygonal Graphs -- Upward Straight-Line Embeddings of Directed Graphs into Point Sets -- Complexity of the Packing Coloring Problem for Trees -- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges -- A Lower Bound on the Area Requirements of Series-Parallel Graphs -- On Independent Sets and Bicliques in Graphs -- Evaluations of Graph Polynomials -- Parameterized Complexity for Domination Problems on Degenerate Graphs -- An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph -- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs -- The Rank-Width of the Square Grid -- Improved Upper Bounds for Partial Vertex Cover -- On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width -- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms -- What Is between Chordal and Weakly Chordal Graphs? -- Parameterized Graph Cleaning Problems -- Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph -- Fast Robber in Planar Graphs -- From a Circular-Arc Model to a Proper Circular-Arc Model -- Digraph Decompositions and Monotonicity in Digraph Searching -- Searching for a Visible, Lazy Fugitive -- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes -- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs."]
[null,null,null,"Sommario/riassunto","This book constitutes the thoroughly refereed post-conference proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2008, held in Durham, UK, in June/July 2008. The 30 revised full papers presented together with 3 invited paper were carefully reviewed and selected from 76 submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, diagram methods, and support of these concepts by suitable implementations."]
[null,"2.","Record Nr.",null,"UNINA9910817699503321"]
[null,null,"Autore",null,"Steels Luc"]
[null,null,"Titolo",null,"Case studies in fluid construction grammar : the verb phase / / edited by Luc Steels, Katrien Beuls"]
[null,null,"Pubbl/distr/stampa",null,"Amsterdam ; ; Philadelphia : , : John Benjamins Publishing Company, , [2019]"]
[{"$nulls":4},"©2019"]
[null,null,"ISBN",null,"90-272-6189-X"]
[null,null,"Descrizione fisica",null,"1 online resource (158 pages)"]
[null,null,"Collana",null,"Benjamins current topics ; ; Volume 106"]
[null,null,"Disciplina",null,"415.02836"]
[null,null,"Soggetti",null,"Construction grammar"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Introduction -- Approaches to the verb phrase in Fluid Construction Grammar /  Katrien Beuls and Luc Steels -- Basics of Fluid Construction Grammar /  Luc Steels -- Robust processing of the Dutch verb phrase /  Paul Van Eecke -- How a Construction Grammar account solves the auxiliary controversy /  Remi van Trijp -- An open-ended computational construction grammar for Spanish verb conjugation / Katrien Beuls -- Russian verbs of motion and their aspectual partners in Fluid  Construction Grammar /  Katrien Beuls, Yana Knight and Michael Spranger."]
[null,null,null,"Sommario/riassunto","\"Construction grammar enjoys great popularity among empirical linguists, typologists, psycholinguists, and language educators, because it puts meaning and function of language at the forefront of linguistic analysis. This book shows that construction grammar gives us also a powerful new way to conceive and implement operational parsing and production systems, which could be used as a basic component of a wide range of Artificial Intelligence applications, such as dialog systems, language tutoring applications, or translation assistants. The book focuses on a particular formalism, Fluid Construction Grammar (FCG), that has emerged recently as a solid platform for writing and testing grammars from a constructional point of view. It introduces the basics of FCG and illustrates its use through a number of case studies all centering around the verb phrase. The case studies consider the verb phrase in different languages (Dutch, English, Spanish, Russian) and examine different challenging linguistic phenomena, ranging from word order flexibility, language change, and "]
[{"$nulls":4},"language acquisition, to the complex semantics of the verb phrase, particularly for aspect. The book is intended for those who want a first contact with FCG and see how different non-trivial analyses of language phenomena can be expressed. It is also an excellent first step for those who want to explore FCG to build language applications. Originally published as special issue of Constructions and Frames 9:2 (2017)\"--"]