LEADER 05712nam 22006975 450 001 996465641303316 005 20230329142837.0 010 $a3-642-45043-1 024 7 $a10.1007/978-3-642-45043-3 035 $a(CKB)3710000000031312 035 $a(DE-He213)978-3-642-45043-3 035 $a(SSID)ssj0001067492 035 $a(PQKBManifestationID)11596133 035 $a(PQKBTitleCode)TC0001067492 035 $a(PQKBWorkID)11081113 035 $a(PQKB)10909935 035 $a(MiAaPQ)EBC3093581 035 $a(PPN)176117679 035 $a(EXLCZ)993710000000031312 100 $a20131112d2013 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aGraph-Theoretic Concepts in Computer Science$b[electronic resource] $e39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers /$fedited by Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk 205 $a1st ed. 2013. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013. 215 $a1 online resource (XX, 430 p. 114 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8165 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-45042-3 327 $aTree-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 -- 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8165 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aArtificial intelligence?Data processing 606 $aGeometry 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aData Science 606 $aGeometry 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aArtificial intelligence?Data processing. 615 0$aGeometry. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aData Science. 615 24$aGeometry. 676 $a004.0151 702 $aBrandstädt$b Andreas$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJansen$b Klaus$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aReischuk$b Rüdiger$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465641303316 996 $aGraph-Theoretic Concepts in Computer Science$92569248 997 $aUNISA LEADER 00946cam a22002534a 4500 001 991000598709707536 008 100216s 000 0 eng d 020 $a9780521648325 035 $ab13882041-39ule_inst 040 $aDip.to Filologia Ling. e Lett.$bita 082 00$a492.7/82421 100 1 $aAlosh, Mahdi$0472631 245 10$aUsing Arabic :$ba guide to contemporary usage /$cMahdi Alosh 250 $aRistampa della 1. ed. 2005 260 $aNew York :$bCambridge University Press,$c2008 300 $axvii, 338 p. ;$c24 cm. 504 $aInclude bibliografia (p. 308-311) e indice 650 0 $aLingua araba$xGrammatica 907 $a.b13882041$b28-01-14$c16-02-10 912 $a991000598709707536 945 $aLE008 FL.M. (arabo) I A 92$g1$i2008000422363$lle008$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i15076040$z16-02-10 996 $aUsing Arabic$9225525 997 $aUNISALENTO 998 $ale008$b16-02-10$cm$da $e-$feng$gnyu$h0$i0 LEADER 05367nam 2200637 a 450 001 9910829945803321 005 20170809164635.0 010 $a1-119-10433-5 010 $a1-119-19660-4 010 $a1-280-85528-2 010 $a9786610855285 010 $a0-470-14098-4 035 $a(CKB)1000000000356604 035 $a(EBL)292442 035 $a(SSID)ssj0000274746 035 $a(PQKBManifestationID)12078616 035 $a(PQKBTitleCode)TC0000274746 035 $a(PQKBWorkID)10340502 035 $a(PQKB)11265676 035 $a(MiAaPQ)EBC292442 035 $a(OCoLC)163575479 035 $a(CaSebORM)9780470085806 035 $a(EXLCZ)991000000000356604 100 $a20070123d2007 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 04$aThe WorldatWork handbook of compensation, benefits & total rewards$b[electronic resource] $ea comprehensive guide for HR professionals /$fWorldatwork 205 $a1st edition 210 $aHoboken, N.J. $cJohn Wiley & Sons$dc2007 215 $a1 online resource (866 p.) 300 $aDescription based upon print version of record. 311 $a0-470-08580-0 320 $aIncludes bibliographical references (p. 821-825) and index. 327 $aThe 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 327 $aFIVE 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 327 $aCOMMUNICATING 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 327 $aEFFECTIVE 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 327 $aCAPTURING 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 327 $aTHE COMPENSATION PRACTITIONER'S ROLE 330 $aPraise 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 606 $aCompensation management$vHandbooks, manuals, etc 615 0$aCompensation management 676 $a658.32 676 $a658.322 700 $aWorldatWork$01634242 712 02$aWorldatWork (Organization) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910829945803321 996 $aThe WorldatWork handbook of compensation, benefits & total rewards$93974370 997 $aUNINA