{"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":48,"n_cols":5,"rows_kept":48,"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],[8,2,8,3],[15,2,15,3],[16,2,16,3],[19,2,19,3],[22,2,22,3],[22,4,22,5],[23,2,23,3],[23,4,23,5],[24,2,24,3],[24,4,24,5],[25,2,25,3],[26,2,26,3],[31,2,31,3],[32,2,32,3],[33,2,33,3],[35,2,35,3],[36,2,36,3],[37,2,37,3],[41,2,41,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465641303316"]
[null,null,"Titolo",null,"Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers / / edited by Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013"]
[null,null,"ISBN",null,"3-642-45043-1"]
[null,null,"Edizione",null,"[1st ed. 2013.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XX, 430 p. 114 illus.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 8165"]
[null,null,"Disciplina",null,"004.0151"]
[null,null,"Soggetti",null,"Computer science—Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Artificial intelligence—Data processing"]
[{"$nulls":4},"Geometry"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Data Science"]
[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,"Nota di contenuto",null,"Tree-Like Structures in Graphs: A Metric Point of View -- Overview of New Approaches for Approximating TSP -- Linear Rank-Width and Linear Clique-Width of Trees -- Threshold-Coloring and Unit-Cube Contact Representation of Graphs -- Rolling Upward Planarity Testing of Strongly Connected Graphs -- Towards a Provably Resilient Scheme for Graph-Based Watermarking -- The Normal Graph Conjecture for Classes of Sparse Graphs -- On the Parameterized Complexity of Computing Graph Bisections -- Fixed-Parameter Tractability and Characterizations of Small Special Treewidth -- The θ5-Graph is a Spanner -- Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations (Extended Abstract) -- Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs -- Equilateral L-Contact Graphs -- Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees -- Linear Separation of Total Dominating Sets in Graphs -- Sparse Square Roots -- Completing Colored Graphs to Meet a Target Property -- Colouring of Graphs with Ramsey-Type Forbidden Subgraphs -- "]
[{"$nulls":4},"Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs -- Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time -- Thickness and Colorability of Geometric Graphs -- The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube -- FPT Is Characterized by Useful Obstruction Sets -- Excluding Graphs as Immersions in Surface Embedded -- OBDD-Based Representation of Interval Graphs -- Tight Upper Bounds for Minimum Feedback Arc Sets of Regular -- A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem -- On Retracts, Absolute Retracts, and Folds in Cographs -- Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(log log n) Colors -- On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs -- Certifying 3-Edge-Connectivity -- Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs -- Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs -- Beyond Knights and Knaves -- Drawing Graphs with Few Arcs -- Connecting Terminals and 2-Disjoint Connected Subgraphs."]
[null,null,null,"Sommario/riassunto","This book constitutes the thoroughly refereed proceedings of the 39th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2013, held in Lübeck, Germany, in June 2013. The 34 revised full papers presented were carefully reviewed and selected from 61 submissions. The book also includes two abstracts. The papers cover a wide range of topics in graph theory related to computer science, such as structural graph theory with algorithmic or complexity applications; design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; computational complexity of graph and network problems; computational geometry; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications."]
[null,"2.","Record Nr.",null,"UNINA9910829945803321"]
[null,null,"Autore",null,"WorldatWork"]
[null,null,"Titolo",null,"The WorldatWork handbook of compensation, benefits & total rewards [[electronic resource] ] : a comprehensive guide for HR professionals / / Worldatwork"]
[null,null,"Pubbl/distr/stampa",null,"Hoboken, N.J., : John Wiley & Sons, c2007"]
[null,null,"ISBN",null,"1-119-10433-5"]
[{"$nulls":4},"1-119-19660-4"]
[{"$nulls":4},"1-280-85528-2"]
[{"$nulls":4},"9786610855285"]
[{"$nulls":4},"0-470-14098-4"]
[null,null,"Edizione",null,"[1st edition]"]
[null,null,"Descrizione fisica",null,"1 online resource (866 p.)"]
[null,null,"Disciplina",null,"658.32"]
[{"$nulls":4},"658.322"]
[null,null,"Soggetti",null,"Compensation management"]
[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","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (p. 821-825) and index."]
[null,null,"Nota di contenuto",null,"The WorldatWork Handbook of Compensation, Benefits & Total Rewards; Contents; Introduction: Redefi ning Employee Rewards; THE EVOLUTION OF REWARDS; About the Author; Chapter 1: Total Rewards: That Employees Value in the Employment Relationship; BROADENING THE DEFINITION OF TOTAL REWARDS; EVOLUTION OF THE WORLDATWORK TOTAL REWARDS MODEL; EXPLORING THE KEY AREAS; Chapter 2: Why the Total Rewards Approach Works; THE TOP FIVE ADVATAGES OF A TOTAL REWARDS APPROACH; REFERENCE; Chapter 3: Developing a Total Rewards Strategy; THE TOTAL REWARDS BLUEPRINT"]
[{"$nulls":4},"FIVE COMMON WAYS A TOTAL REWARDS STRATEGY CAN GO ASTRAYCRYSTALLIZING THE SPIRIT OF YOUR TOTAL REWARDS PLAN; ISSUES THAT A TOTAL REWARDS STRATEGY SHOULD ADDRESS; THE BOTTOM LINE; Chapter 4: Designing a Total Rewards Program; STEP 1: ANALYZE AND ASSESS; STEP 2: DESIGN; STEP 3: DEVELOP; STEP 4: IMPLEMENT; STEP 5: COMMUNICATE; STEP 6: EVALUATE AND REVISE; Chapter 5: Communicating Total Rewards; A COMMUNICATIONS APPROACH WITH OOMPH; THE POWER OF COMMUNICATION; TOP MANAGEMENT BUY-IN; THE BOTTOM LINE; COMMUNICATION FUNDAMENTALS; MODELS OF COMMUNICATION; THE COMMUNICATION PROCESS"]
[{"$nulls":4},"COMMUNICATING THE PROGRAM'S RICHNESSSPECIAL SITUATIONS; MEDIA CONSIDERATIONS; A CASE STUDY: SOUTHERN COMPANY; TOTAL REWARDS BRANDING; MEDIA CHOICES; IMPLEMENTATION; PLANNING A CAMPAIGN; MANAGING A CAMPAIGN; MEASURING RETURN ON INVESTMENT; CRITICAL OUTCOMES; Chapter 6: Compensation Fundamentals; THE FOUNDATION: A COMPENSATION PHILOSOPHY; CHARACTERISTICS OF COMPENSATION PROGRAMS; ELEMENTS OF COMPENSATION; THE BASICS: BASE PAY; JOB ANALYSIS; JOB EVALUATION; MARKET ANALYSIS; SALARY RANGES; COMPETENCIES; INCENTIVE PAY; DESIGN ELEMENTS; REASONS FOR FAILURE; MANAGEMENT OF PAY FOR PERFORMANCE"]
[{"$nulls":4},"EFFECTIVE COMPENSATION MANAGEMENTChapter 7: Regulatory Environment: The FLSA and Other Laws That Affect Compensation Practices; FAIR LABOR STANDARDS ACT OF 1938; SHERMAN ANTITRUST ACT OF 1890; DAVIS-BACON ACT OF 1931; NATIONAL LABOR RELATIONS ACT; WALSH-HEALEY ACT; SERVICE CONTRACT ACT; ANTI-DISCRIMINATION LAWS; Chapter 8: Market Pricing; WHERE DO YOU BEGIN?; JOB ANALYSIS; JOB DOCUMENTATION AND JOB DESCRIPTIONS; JOB EVALUATION; BENCHMARK JOBS; COLLECTING THE RIGHT DATA; DECISION FACTORS IN COLLECTING MARKET DATA; KNOW THE MARKET: HALF THE BATTLE; GATHERING VALID DATA; DATA SOURCES"]
[{"$nulls":4},"CAPTURING COMPETITIVE MARKET DATA FOR HIGH-DEMAND JOBSCRUNCHING NUMBERS; OPTIONS FOR MEASURING CENTRAL TENDENCY; PERCENTILES; AGING DATA TO A COMMON POINT IN TIME; WEIGHTING MARKET DATA ACRESS SURVEY SOURCES; DEVELOPING MARKET INDEX OF COMPETITIVENESS; MARKET BLIPS-A WORD OF CAUTION; APPROACHES TO PROGRAM COSTS; HOW TO KEEP EMPLOYEES IN THE LOOP; OPENING THE PAY DIALOGUE; Chapter 9: Salary Surveys: A Snapshot; THE BIG PICTURE; DEFINITION AND PURPOSES; BENCHMARK SURVEYS; JOB MATCHING; JOB TITLE AND CHARACTERISTICS; SURVEY FREQUENCY; STRETCHING THE SALARY SURVEY BUDGET; BEHIND THE SCENES"]
[{"$nulls":4},"THE COMPENSATION PRACTITIONER'S ROLE"]
[null,null,null,"Sommario/riassunto","Praise for The WorldatWork Handbook of Compensation, Benefits & Total Rewards This is the definitive guide to compensation and benefits for modern HR professionals who must attract, motivate, and retain quality employees. Technical enough for specialists but broad in scope for generalists, this well-rounded resource belongs on the desk of every recruiter and HR executive. An indispensable tool for understanding and implementing the total rewards concept, the WorldatWork Handbook of Compensation, Benefits, and Total Rewards is the key to designing compensation practices t"]