LEADER 02588nam 2200529 450 001 9910540047503321 005 20230809230521.0 010 $a3-11-046921-9 010 $a3-11-046889-1 024 7 $a10.1515/9783110468892 035 $a(CKB)3850000000001211 035 $a(MiAaPQ)EBC4911718 035 $a(DE-B1597)462993 035 $a(OCoLC)987888777 035 $a(DE-B1597)9783110468892 035 $a(Au-PeEL)EBL4911718 035 $a(CaPaEBR)ebr11497547 035 $a(EXLCZ)993850000000001211 100 $a20180206h20172017 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $2rdacontent 182 $2rdamedia 183 $2rdacarrier 200 10$aScientific leadership /$fJ. W. Niemantsverdriet, J. P. K. Felderhof 210 1$aBerlin, [Germany] ;$aBoston, [Massachusetts] :$cDe Gruyter,$d2017. 210 4$d©2017 215 $a1 online resource (188 pages) $cillustrations 225 0 $aDe Gruyter Textbook 300 $aIncludes index. 311 $a3-11-046888-3 327 $tFrontmatter -- $tForeword -- $tAcknowledgments -- $tSpecial foreword -- $tContents -- $t1. Creating success in your own scientific world -- $t2. Leading yourself and others in research -- $t3. Presenting science: talks, publications, posters, and some ideas on conferences -- $t4. Management skills for researchers -- $t5. Planning the road to your future in science: strategy and comprehensive plans -- $t6. Understanding how to build successful teams: creating synergy between people who trust each other -- $t7. On the road to scientific (self) leadership -- $t8. Post scriptum - implementation -- $tWorksheets -- $tIndex 330 $aModern Science is teamwork. But how can young academics go from being a productive member of a scientific team to leading their own? Entry level positions for PhDs in Science often require the infamous "people skills". The authors aim to equip young academics with the right ideas and strategies for their scientific leadership development. Become a successful leader not with tricks, but with an inspiring and straightforward vision and mission, the correct mindset, and effective teamwork. 606 $aLeadership$vCongresses 606 $aLeadership$zGermany 615 0$aLeadership 615 0$aLeadership 676 $a303.34 700 $aNiemantsverdriet$b J. W.$0845795 702 $aFelderhof$b J. P. K. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910540047503321 996 $aScientific leadership$92707568 997 $aUNINA LEADER 07855nam 22007695 450 001 9910865278503321 005 20251215132845.0 010 $a3-031-52969-3 024 7 $a10.1007/978-3-031-52969-6 035 $a(CKB)32323163100041 035 $a(MiAaPQ)EBC31505999 035 $a(Au-PeEL)EBL31505999 035 $a(DE-He213)978-3-031-52969-6 035 $a(EXLCZ)9932323163100041 100 $a20240615d2024 u| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aCombinatorics, Graph Theory and Computing $eSEICCGTC 2021, Boca Raton, USA, March 8?12 /$fedited by Frederick Hoffman, Sarah Holliday, Zvi Rosen, Farhad Shahrokhi, John Wierman 205 $a1st ed. 2024. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2024. 215 $a1 online resource (491 pages) 225 1 $aSpringer Proceedings in Mathematics & Statistics,$x2194-1017 ;$v448 311 08$a3-031-52968-5 320 $aIncludes bibliographical references. 327 $a1.The es-Splitting Operation for Matroids Representable over Prime Felds GF(p) (P. Malavadkar, S. Gunjal, U. Jagadale, M.M. Shikare, and B.N. Waphare) -- 2.The Existence Problem for Strong Complete Mappings of Finite Groups(A.B. Evans) -- 3.Differences of Functions with the Same Value Multiset(D. Cruz, A. Ramos, and I. Rubio) -- 4.Mixed-Level Covering, Locating, and Detecting Arrays via Cyclotomy(Y. Akhtar, C.J. Colbourrn, and V.R. Syrotiuk) -- 5.Resolutions for an Infinite Family of Bose Triple Systems(D. Lusi and C.J. Colbourn) -- 6.Decomposition of the Johnson Graphs into Graph-Pairs of Order 4(A. Abueida and M. Daven) -- 7.Some New Strongly Regular Graphs from Quadrics(L. Lane-Harvard and T. Panttila) -- 8.Nonexistence of a Subfamily of a Family of Edge-Regular Graphs(R. McNeilis, T. Parker, and K. Roblee) -- 9.On a Convex Geometric Connection to Threshold Logic(M.R. Emamy-K, G.A.M. Rios) -- 10.Multicore Graphs: Characterization and Properties (L. Markenzon and N. Paciornik) -- 11.Cospanning Characterizations of Violator and Co-Violator Spaces(Y. Kempner and V.E. Levit) -- 12.(2, 3)-Cordial Trees and Paths(M. Santana, J. Mousley, D. Brown, and L.B. Beasley) -- 13.(2, 3)-Cordial Oriented Hypercubes(J. Mousley, L.B. Beasley, M. Santana, and D. Brown) -- 14.Structural Properties of m-ary n-dimensional Hypercubes(S. Anantapantula, E. Cheng, and L. Liptak) -- 15.Graph Constructions Derived from Interconnection Networks(R. Draper) -- 16.On the Target Pebbling Conjecture(G. Hurlbert and E. Seddiq) -- 17.C_4-Face-Magic Labelings on Even Order Projective Grid Graphs(S.J. Curran and S.C. Locke) -- 18.On the Locating Rainbow Connection Number of the Comb Product with complete Graphs or Trees(M.Imrona, A.N.M. Salmar, S. Uttunggadewa, and P.E. Patry) -- 19.Cycle-Compelling Colorings of Graphs(A. Bachstein, W. Goddard, and J. Xue) -- 20.Harmonious Colorings of Graphs(A. Byers, A.Adams, E.B. Calderon, O.Bindas, M. Cope, A. Summers, and R. Thapa) -- 21. A Note on the Immersion Number of Generalized Mycielski Graphs(K.L. Collins, M.E. Heenehan, and J. McDonald) -- 22. Recent Developments of Star-Critical Ramsey Numbers(J. Hook) -- 23. The Zero Forcing Span of a Graph(B. Jacob) -- 24. DNA Self-Assembly: Complete Tripartite Graphs and Cocktail Party Graphs(L. Almodovar, J.H. Lee, M. Neal, H. Todt, and J. Williams) -- 25. Inverse of Hermitian Adjacency Matrix of Mixed Bipartite Graphs(O. Alomari and M. Abudayeh) -- 26. Properties of Sierpinski Triangle Graphs(A. Bickle) -- 27. Counting Vertices in Iterated Line Graphs(Z. King, L. Lane-Harvard, and T. Milligan) -- 28. On 2-Factorizations of the Complete 3-Uniform Hypergraph of Order 12 Minus a 1-Factor(P. Adams, S.I. El-Zanati, P. Florido, and W. Turner) -- 29. On Decompositions of Complete 3-Uniform Hypergraphs into a Linear Forest with 4 Edges(R.C. Bunge, E. Dawson, and M. Donovan) -- 30. Exterior Corners on Bargraphs of Motzkin Words(T. Mansour and J.L. Ramirez) -- 31. Some Connections between Restricted Dyck Paths, Polyominoes, and Non-Crossing Partitions(R. Florez, J.L. Ramirez, F.A. Velandia, and D. Vilamizar) -- 32. Powers of Two as Sums of Two Balancing Numbers(J. Bartz, B. Dearden, J. Iiams, and J. Peterson) -- 33. Sprague-Grundy Functions for Certain Infinite Acyclic Graphs(A. Meyerowitz) -- 34. New Absolute Irreducibility Testing Criteria and Factorization of Multivariate Polynomials(C. Agrinsoni, H. Janwa, and M. Delgado) -- 35. Resolution of a Conjecture on the Covering Radius of Linear Codes(J.C. Orosco and H. Janwa) -- 36. Quantum Error-Correcting Codes over Small Fields from AG Codes(H. Janwa and F.L. Pinero-Gonzalez) -- 37. A Go-Up Code Construction from Linear Codes Yielding Additive Codes from Quantum Stabilizer Codes(E.A. Arrieta and H. Janwa) -- 38. Bent and Near-Bent Function Construction and 2-Error-Correcting Codes(J.W. Velazquez and H. Janwa). . 330 $aThis proceedings volume convenes selected, revised papers presented at the 52nd Southeastern International Conference on Combinatorics, Graph Theory and Computing (SEICCGTC 2021), virtually held at Florida Atlantic University in Boca Raton, USA, on March 8-12, 2021. As has been a tradition since its inception in 1970, this edition once more brought together mathematicians, practitioners, and scientists around novel findings in combinatorics, graph theory and computing, and their interactions. The lectures and works presented at the Conference have proven to be of great interest to other scientists and analysts employing these mathematical sciences in their professional activities in business, industry, and government. Such an environment promotes a better understanding of the roles of modern applied mathematics, combinatorics, and computer science. Many works have demonstrated that disciplines have increasingly contributed to each other. With this series of Conferences, the gaps between the fields tend to decrease even further. This volume is of particular interest for the community of pure and applied mathematicians in academia, industry, and government, working in combinatorics and graph theory, as well as related areas of computer science and the interactions among these fields. Its findings can also benefit a general audience of practitioners and students from related fields. 410 0$aSpringer Proceedings in Mathematics & Statistics,$x2194-1017 ;$v448 606 $aDiscrete mathematics 606 $aComputer science$xMathematics 606 $aGraph theory 606 $aCryptography 606 $aData encryption (Computer science) 606 $aDiscrete Mathematics 606 $aDiscrete Mathematics in Computer Science 606 $aGraph Theory 606 $aMathematical Applications in Computer Science 606 $aCryptology 606 $aAnàlisi combinatòria$2thub 606 $aTeoria de grafs$2thub 606 $aMatemàtica discreta$2thub 608 $aCongressos$2thub 608 $aLlibres electrònics$2thub 615 0$aDiscrete mathematics. 615 0$aComputer science$xMathematics. 615 0$aGraph theory. 615 0$aCryptography. 615 0$aData encryption (Computer science) 615 14$aDiscrete Mathematics. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aGraph Theory. 615 24$aMathematical Applications in Computer Science. 615 24$aCryptology. 615 7$aAnàlisi combinatòria 615 7$aTeoria de grafs 615 7$aMatemàtica discreta 676 $a511.6 702 $aHoffman$b Frederick 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910865278503321 996 $aCombinatorics, graph theory and computing$93008866 997 $aUNINA