LEADER 03133nam 2200625Ia 450 001 9910455875003321 005 20211027234553.0 010 $a9786612357541 010 $a1-282-35754-9 010 $a0-520-93121-1 010 $a1-59734-572-5 024 7 $a10.1525/9780520931213 035 $a(CKB)111087027171460 035 $a(EBL)223923 035 $a(OCoLC)70771492 035 $a(SSID)ssj0000134781 035 $a(PQKBManifestationID)11143434 035 $a(PQKBTitleCode)TC0000134781 035 $a(PQKBWorkID)10055516 035 $a(PQKB)10810952 035 $a(MiAaPQ)EBC223923 035 $a(DE-B1597)520610 035 $a(DE-B1597)9780520931213 035 $a(Au-PeEL)EBL223923 035 $a(CaPaEBR)ebr10048950 035 $a(CaONFJC)MIL235754 035 $a(EXLCZ)99111087027171460 100 $a20040405d2001 my 0 101 0 $aeng 135 $aurnn#---|u||u 181 $ctxt 182 $cc 183 $acr 200 10$aDao de jing$b[electronic resource] $ethe book of the way /$ftranslation and commentary by Moss Roberts 210 $aBerkeley $cUniversity of California Press$dc2001 215 $a1 online resource (239 p.) 300 $aDescription based upon print version of record. 311 0 $a0-520-24221-1 311 0 $a0-520-20555-3 320 $aIncludes bibliographical references. 327 $tFront matter --$tDedication and Acknowledgments --$tContents --$tIntroduction --$tDao De Jing --$tNotes --$tSelected Bibliography 330 $aDao De Jing is one of the richest, most suggestive, and most popular works of philosophy and literature. Composed in China between the late sixth and the late fourth centuries B.C., its enigmatic verses have inspired artists, philosophers, poets, religious thinkers, and general readers down to our own times. This new translation, both revelatory and authentic, captures much of the beauty and nuance of the original work. In an extensive and accessible commentary to his translation, Moss Roberts reveals new depths of Dao De Jing. This edition is distinguished by the literary quality of the translation, its new renderings for a number of the stanzas, and by Roberts's knowledgeable contextualizations. Utilizing recently discovered manuscripts and Chinese scholarship based on them, he is able to shed new light on the work's historical and philosophical contexts. This translation shows that Dao De Jing is far more than a work of personal inspiration; it is also a work of universal scope that makes penetrating comments on politics, statecraft, cosmology, aesthetics, and ethics. Roberts brings these themes to our attention, shows how they are integrated into the work as a whole, and demonstrates the relevance of these topics for our own times. 606 $aTaoism 608 $aElectronic books. 615 0$aTaoism. 676 $a299.51482 676 $a299/.51482 700 $aRoberts$b Moss$f1937-$0223964 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910455875003321 996 $aDao de jing$92487082 997 $aUNINA LEADER 01023nam0 22002891i 450 001 UON00454071 005 20231205105055.635 010 $a96-287-1106-7 100 $a20150511d1999 |0itac50 ba 101 $aeng 102 $aCN 105 $a|||| 1|||| 200 1 $aPakistan$fIsobel Shaw 205 $aRev. ed.$b5th ed. 210 $a[China]$cLocal Colour$d1999 215 $a340 p.$cill., c. geogr.$d21 cm 517 1$3UON00454076$aLocal Colour illustrated guide to Pakistan 606 $aPAKISTAN$xGUIDE$3UONC008011$2FI 686 $aSI I$cSUBCONT. INDIANO - GENERALIA$2A 700 1$aSHAW$bIsobel$3UONV226930$0714142 712 $aLocal Colour$3UONV281680$4650 801 $aIT$bSOL$c20240220$gRICA 899 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$2UONSI 912 $aUON00454071 950 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$dSI SI I 221 N $eSI 13687 7 221 N 996 $aPakistan$91323388 997 $aUNIOR LEADER 06099nam 2200601 a 450 001 9910483967503321 005 20200520144314.0 010 $a3-540-30559-9 024 7 $a10.1007/b104584 035 $a(CKB)1000000000212674 035 $a(SSID)ssj0000165117 035 $a(PQKBManifestationID)11162858 035 $a(PQKBTitleCode)TC0000165117 035 $a(PQKBWorkID)10125785 035 $a(PQKB)10371982 035 $a(DE-He213)978-3-540-30559-0 035 $a(MiAaPQ)EBC3068303 035 $a(PPN)134123700 035 $a(EXLCZ)991000000000212674 100 $a20120224d2004 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph-theoretic concepts in computer science $e30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004 : revised papers /$fJuraj Hromkovic, Manfred Nagl, Bernhard Westfechtel (eds.) 205 $a1st ed. 2005. 210 $aBerlin $cSpringer$d2004 215 $a1 online resource (XI, 404 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v3353 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-24132-9 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Lexicographic Breadth First Search ? A Survey -- Wireless Networking: Graph Theory Unplugged -- Graph Algorithms: Trees -- Constant Time Generation of Trees with Specified Diameter -- Treelike Comparability Graphs: Characterization, Recognition, and Applications -- Elegant Distance Constrained Labelings of Trees -- Collective Tree Spanners and Routing in AT-free Related Graphs -- Graph Algorithms: Recognition and Decomposition -- On the Maximum Cardinality Search Lower Bound for Treewidth -- Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs -- Recognizing HHD-free and Welsh-Powell Opposition Graphs -- Bimodular Decomposition of Bipartite Graphs -- Coloring a Graph Using Split Decomposition -- Graph Algorithms: Various Problems -- Decremental Clique Problem -- A Symbolic Approach to the All-Pairs Shortest-Paths Problem -- Minimal de Bruijn Sequence in a Language with Forbidden Substrings -- A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic -- Optimization and Approximation Algorithms -- The Computational Complexity of the Minimum Weight Processor Assignment Problem -- A Stochastic Location Problem with Applications to Tele-diagnostic -- A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs -- Tolerance Based Algorithms for the ATSP -- Parameterized Complexity and Exponential Algorithms -- Finding k Disjoint Triangles in an Arbitrary Graph -- Exact (Exponential) Algorithms for the Dominating Set Problem -- Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) Steps -- Counting, Combinatorics, and Optimization -- Planar Graphs, via Well-Orderly Maps and Trees -- Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs -- Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters -- Applications (Biology, Graph Drawing) -- Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs -- Octagonal Drawings of Plane Graphs with Prescribed Face Areas -- Crossing Reduction in Circular Layouts -- Graph Classes and NP Hardness -- Characterization and Recognition of Generalized Clique-Helly Graphs -- Edge-Connectivity Augmentation and Network Matrices -- Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size -- The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small -- Core Stability of Minimum Coloring Games. 330 $aDuring its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer science event. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can successfully be applied to v- ious areas of computer science and by exposing new theories emerging from applications. In this way, WG provides a common ground for the exchange of information among people dealing with several graph problems and working in various disciplines. Thereby, the workshop contributes to forming an interdis- plinary research community. The original idea of the Workshop on Graph-Theoretic Concepts in C- puter Science was ingenuity in all theoretical aspects and applications of graph concepts, wherever applied. Within the last ten years, the development has strengthened in particular the topic of structural graph properties in relation to computational complexity. This workshop has become pivotal for the c- munity interested in these areas.An aimspeci?c to the 30thWG was to support the central role of WG in both of the prementioned areas on the one hand and on the other hand to promote its originally broader scope. The 30th WG was held at the Physikzentrum Bad Honnef, which serves as the main meeting point of the German Physical Society. It o?ers a secluded setting for research conferences, seminars, and workshops, and has proved to be especiallystimulatingforfruitful discussions.Talksweregiveninthenewlecture hall with a modern double rear projection, interactive electronic board, and full video conferencing equipment. 410 0$aLecture notes in computer science ;$v3353. 606 $aGraph theory$vCongresses 606 $aComputer science$vCongresses 606 $aComputer algorithms$vCongresses 615 0$aGraph theory 615 0$aComputer science 615 0$aComputer algorithms 676 $a004.0151 701 $aHromkovic$b Juraj$f1958-$0285089 701 $aNagl$b Manfred$01737787 701 $aWestfechtel$b Bernhard$01737788 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483967503321 996 $aGraph-theoretic concepts in computer science$94200355 997 $aUNINA