{"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":43,"n_cols":5,"rows_kept":43,"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],[5,2,5,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],[18,2,18,3],[18,4,18,5],[19,2,19,3],[19,4,19,5],[20,2,20,3],[20,4,20,5],[21,2,21,3],[22,2,22,3],[23,2,23,3],[24,2,24,3],[38,2,38,3],[39,2,39,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466369203316"]
[null,null,"Titolo",null,"Algorithms and computations : 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 proceedings / / Alok Aggarwal, C. Pandu Rangan (Eds.)"]
[null,null,"Pubbl/distr/stampa",null,"Berlin ; ; Heidelberg : , : Springer, , [1999]"]
[{"$nulls":4},"Â©1999"]
[null,null,"ISBN",null,"3-540-46632-0"]
[null,null,"Edizione",null,"[1st ed. 1999.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIV, 454 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science ; ; 1741"]
[null,null,"Disciplina",null,"004"]
[null,null,"Soggetti",null,"Computer science"]
[{"$nulls":4},"Computer software"]
[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","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references at the end of each chapters and index."]
[null,null,"Nota di contenuto",null,"Invited Talk -- The Engineering of Some Bipartite Matching Programs -- Session 1(a) - Data Structure I -- General Splay: A Basic Theory and Calculus -- Static Dictionaries Supporting Rank -- Session 1(b) - Parallel & Distributed Computing I -- Multiple Spin-Block Decisions -- Asynchronous Random Polling Dynamic Load Balancing -- Session 2(a) - Approximate Algorithm I -- Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colarability -- Hardness of Approximating Independent Domination in Circle Graphs -- Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs -- Session 2(b) - Computational Intelligence -- Ordered Binary Decision Diagrams as Knowledge-Bases -- Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots -- Session 3(a) - Online Algorithm -- On-Line Load Balancing of Temporary Tasks Revisited -- Online Routing in Triangulations -- Session 3(b) - Complexity Theory I -- The Query Complexity of Program Checking by Constant-Depth Circuits -- Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle -- Session 4(a) - Approximate Algorithm II -- Efficient Approximation Algorithms for Multi-label Map Labeling -- Approximation Algorithms in Batch Processing -- Session 4(b) - Graph Algorithm I -- LexBFS-Ordering in Asteroidal Triple-Free Graphs -- Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs -- Invited Talk -- Approximation Algorithms for "]
[{"$nulls":4},"Some Clustering and Classification Problems -- Session 5(a) - Computational Geometry I -- How Many People Can Hide in a Terrain? -- Carrying Umbrellas: An Online Relocation Problem on Graphs -- Session 5(b) - Parallel & Distributed Computing II -- Survivable Networks with Bounded Delay: The Edge Failure Case -- Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks -- Session 6(a) - Data Structure II -- Constructing the Suffix Tree of a Tree with a Large Alphabet -- An O(1) Time Algorithm for Generating Multiset Permutations -- Session 6(b) - Complexity Theory II -- Upper Bounds for MaxSat: Further Improved -- A Linear Time Algorithm for Recognizing Regular Boolean Functions -- Session 7(a) - Computational Geometry II -- Station Layouts in the Presence of Location Constraints -- Reverse Center Location Problem -- Session 7(b) - Algorithms in Practice -- Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields -- External Memory Algorithms for Outerplanar Graphs -- Session 8(a) - Approximate Algorithm III -- A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree -- Approximation Algorithms for Channel Assignment with Constraints -- Session 8(b) - Graph Algorithm II -- Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs -- A Linear Algorithm for Finding Total Colorings of Partial k-Trees -- Invited Talk -- Topology-Oriented Approach to Robust Geometric Computation -- Session 9(a) - Approximate Algorithm IV -- Approximating Multicast Congestion -- Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts -- Session 9(b) - Parallel & Distributed Computing III -- Online Scheduling of Parallel Communications with Individual Deadlines -- A Faster Algorithm for Finding Disjoint Paths in Grids -- Session 10(a) - Computational Geometry III -- Output-Sensitive Algorithms for Uniform Partitions of Points -- Convexifying Monotone Polygons -- Session 10(b) - Graph Algorithm III -- Bisecting Two Subsets in 3-Connected Graphs -- Generalized Maximum Independent Sets for Trees in Subquadratic Time."]
[null,"2.","Record Nr.",null,"UNINA9910495789403321"]
[null,null,"Autore",null,"Kolly Maryam"]
[null,null,"Titolo",null,"De la religion que l’on voit à la religion que l’on ne voit pas : Les jeunes, le religieux et le travail social / Maryam Kolly"]
[null,null,"Pubbl/distr/stampa",null,"Bruxelles, : Presses de l’Université Saint-Louis, 2018"]
[null,null,"ISBN",null,"2-8028-0369-7"]
[null,null,"Descrizione fisica",null,"1 online resource (186 p.)"]
[null,null,"Soggetti",null,"Religion"]
[{"$nulls":4},"Sociology"]
[{"$nulls":4},"assistant social"]
[{"$nulls":4},"identité"]
[{"$nulls":4},"migration"]
[{"$nulls":4},"Islam"]
[{"$nulls":4},"disqualification"]
[{"$nulls":4},"parole"]
[{"$nulls":4},"Afrique"]
[{"$nulls":4},"minorité"]
[{"$nulls":4},"Brussels (Belgium) Social conditions 21st century"]
[{"$nulls":4},"Brussels (Belgium) Religion 21st century"]
[{"$nulls":4},"Brussels (Belgium) Emigration and immigration Social aspects History 21st century"]
[{"$nulls":4},"Brussels (Belgium) Emigration and immigration Religious aspects History 21st century"]
[null,null,"Lingua di pubblicazione",null,"Francese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Sommario/riassunto","Comment les jeunes Bruxellois en cursus d'assistant social se projettent-ils dans le métier ? Qui sont ces intervenants sociaux - et surtout intervenantes sociales - de demain (dans un secteur fortement féminisé) ?  La ville de Bruxelles est le théâtre de violentes disparités socio-économiques et d'un enseignement que l'on peut qualifier d'ethnoségrégé. Les liens entre jeunes s'y construisent dès lors avec force sur des bases identitaires - en référence tant au local (commune, quartier) qu'à l'histoire migratoire ou, encore, à la religion.  À partir d'entretiens, Maryam Kolly relaie ici une « parole minoritaire » portée "]
[{"$nulls":4},"par de futurs travailleurs sociaux qui se disent catholiques ou musulmans, descendants de migrants venant du Maghreb ou d'Afrique subsaharienne. Érigée contre les logiques de disqualification (modernité/islam, Europe/Afrique, jeunesses d'en haut/d'en bas, non croyants/croyants), cette parole nous invite à un décentrement par rapport à l'expérience euro-occidentale."]