{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"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":18,"n_cols":5,"rows_kept":18,"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],[4,2,4,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[12,2,12,3],[16,2,16,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910827452303321"]
[null,null,"Titolo",null,"Graphs and algorithms : proceedings of the AMS-IMS-SIAM joint summer research conference held June 28-July 4, 1987 with support from the National Science Foundation / / R. Bruce Richter, editor"]
[null,null,"Pubbl/distr/stampa",null,"Providence, Rhode Island : , : American Mathematical Society, , [1989]"]
[{"$nulls":4},"©1989"]
[null,null,"ISBN",null,"0-8218-7677-5"]
[{"$nulls":4},"0-8218-5095-4"]
[null,null,"Descrizione fisica",null,"1 online resource (216 p.)"]
[null,null,"Collana",null,"Contemporary mathematics, , 0271-4132 ; ; volume 89"]
[null,null,"Disciplina",null,"511/.5"]
[null,null,"Soggetti",null,"Graph theory"]
[{"$nulls":4},"Computer algorithms"]
[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","\"The AMS-IMS-SIAM Joint Summer Research Conference in the Mathematical Sciences on Graphs and Algorithms was held at the University of Colorado, Boulder, Colorado\"--T.p. verso."]
[null,null,null,"Nota di bibliografia","Includes bibliographies."]
[null,null,"Nota di contenuto",null,"\"\"Contents\"\"; \"\"Foreword\"\"; \"\"Organizing Committee\"\"; \"\"List of Participants\"\"; \"\"The Robertson-Seymour theorems: A survey of applications\"\"; \"\"On genus-reducing and planarizing algorithms for embedded graphs\"\"; \"\"Interval hypergraphs\"\"; \"\"Competitive algorithms for on-line problems\"\"; \"\"On recognizability of planar graphs\"\"; \"\"Combinatorial computation of moduli dimension of Nielsen classes of covers\"\"; \"\"Labeled trees and the algebra of differential operators\"\"; \"\"Computing edge-toughness and fractional arboricity\"\"; \"\"Directed graphs and the compaction of IC designs\"\""]
[{"$nulls":4},"\"\"Parallelism, preprocessing, and reachability\"\"\"\"A summary of results on pair-connected reliability\"\"; \"\"On minimum cuts of cycles and maximum disjoint cycles\"\"; \"\"Graphs and finitely presented groups\"\"; \"\"Problem corner\"\""]