LEADER 05965nam 22007695 450 001 996465956903316 005 20230223040654.0 010 $a1-280-39030-1 010 $a9786613568229 010 $a3-642-16926-0 024 7 $a10.1007/978-3-642-16926-7 035 $a(CKB)2670000000056663 035 $a(SSID)ssj0000446500 035 $a(PQKBManifestationID)11318359 035 $a(PQKBTitleCode)TC0000446500 035 $a(PQKBWorkID)10504201 035 $a(PQKB)10883692 035 $a(DE-He213)978-3-642-16926-7 035 $a(MiAaPQ)EBC3066095 035 $a(PPN)149890524 035 $a(EXLCZ)992670000000056663 100 $a20101110d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph-Theoretic Concepts in Computer Science$b[electronic resource] $e36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010, Revised Papers /$fedited by Dimitrios M. Thilikos 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XIII, 338 p. 62 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6410 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-16925-2 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Algorithmic Barriers from Phase Transitions in Graphs -- Algorithmic Graph Minors and Bidimensionality -- Regular Talks -- Complexity Results for the Spanning Tree Congestion Problem -- max-cut and Containment Relations in Graphs -- The Longest Path Problem is Polynomial on Cocomparability Graphs -- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds -- On Stable Matchings and Flows -- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs -- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time -- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching -- Efficient Algorithms for Eulerian Extension -- On the Small Cycle Transversal of Planar Graphs -- Milling a Graph with Turn Costs: A Parameterized Complexity Perspective -- Graphs that Admit Right Angle Crossing Drawings -- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs -- On the Boolean-Width of a Graph: Structure and Applications -- Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs -- Colouring Vertices of Triangle-Free Graphs -- A Quartic Kernel for Pathwidth-One Vertex Deletion -- Network Exploration by Silent and Oblivious Robots -- Uniform Sampling of Digraphs with a Fixed Degree Sequence -- Measuring Indifference: Unit Interval Vertex Deletion -- Parameterized Complexity of the Arc-Preserving Subsequence Problem -- From Path Graphs to Directed Path Graphs -- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces -- Efficient Broadcasting in Random Power Law Networks -- Graphs with Large Obstacle Numbers -- The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree -- The Number of Bits Needed to Represent a Unit Disk Graph -- Lattices and Maximum Flow Algorithms in Planar Graphs. 330 $aThe 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2010) took place in Zar´ os, Crete, Greece, June 28?30, 2010. About 60 mathematicians and computer scientists from all over the world (Australia, Canada, Czech Republic, France, Germany, Greece, Hungary, Israel, Japan, The Netherlands, Norway, Poland, Switzerland, the UK, and the USA) attended the conference. WG has a long tradition. Since 1975, WG has taken place 21 times in Germany, four times in The Netherlands, twice in Austria, twice in France and once in the Czech Republic, Greece, Italy, Norway, Slovakia, Switzerland, and the UK. WG aims at merging theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science, or by extracting new graph theoretic problems from applications. The goal is to presentemergingresearchresultsand to identify and exploredirections of future research.The conference is well-balanced with respect to established researchers and young scientists. There were 94 submissions, two of which where withdrawn before entering the review process. Each submission was carefully reviewed by at least 3, and on average 4.5, members of the Program Committee. The Committee accepted 28 papers, which makes an acceptance ratio of around 30%. I should stress that, due to the high competition and the limited schedule, there were papers that were not accepted while they deserved to be. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6410 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aGeometry 606 $aComputer networks 606 $aArtificial intelligence?Data processing 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aGeometry 606 $aComputer Communication Networks 606 $aData Science 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aGeometry. 615 0$aComputer networks. 615 0$aArtificial intelligence?Data processing. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aGeometry. 615 24$aComputer Communication Networks. 615 24$aData Science. 676 $a004.0151 702 $aThilikos$b Dimitrios M$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Workshop WG 906 $aBOOK 912 $a996465956903316 996 $aGraph-Theoretic Concepts in Computer Science$92569248 997 $aUNISA LEADER 02836nam 2200697Ia 450 001 9910959755903321 005 20251116145849.0 010 $a1-134-95322-4 010 $a1-86057-035-6 010 $a1-280-14851-9 010 $a9786610148516 010 $a0-203-99217-2 035 $a(CKB)1000000000009231 035 $a(EBL)237239 035 $a(OCoLC)62118179 035 $a(SSID)ssj0000232788 035 $a(PQKBManifestationID)12075827 035 $a(PQKBTitleCode)TC0000232788 035 $a(PQKBWorkID)10214542 035 $a(PQKB)10165481 035 $a(SSID)ssj0000307673 035 $a(PQKBManifestationID)11212513 035 $a(PQKBTitleCode)TC0000307673 035 $a(PQKBWorkID)10244688 035 $a(PQKB)10946605 035 $a(Au-PeEL)EBL237239 035 $a(CaPaEBR)ebr10100705 035 $a(CaONFJC)MIL14851 035 $a(MiAaPQ)EBC237239 035 $a(OCoLC)28711484 035 $a(FINmELB)ELB155875 035 $a(EXLCZ)991000000000009231 100 $a19930806d1994 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aRaymond Williams $emaking connections /$fJohn Eldridge and Lizzie Eldridge 205 $a1st ed. 210 $aLondon ;$aNew York $cRoutledge$d1994 215 $a1 online resource (245 p.) 300 $aDescription based upon print version of record. 311 08$a0-415-04087-6 311 08$a0-415-04088-4 320 $aIncludes bibliographical references and index. 327 $aBook Cover; Half-Title; Title; Copyright; Contents; Acknowledgements; Chapter 1 Introduction; Chapter 2 Perspectives on Williams; Chapter 3 Culture-and society; Chapter 4 The Long Revolution; Chapter 5 The critique of media culture; Chapter 6 Drama and literature Williams' analytical and theoretical approach; Chapter 7 The trilogy; Chapter 8 The Volunteers and Loyalties; Chapter 9 The Country and the City; Chapter 10 Politics; Bibliography; Index 330 $aThis book provides a critical introduction to the full range of Williams' work - fiction and non-fiction. It assesses the significance of his contribution in understanding culture, politics and society. Fair-minded, accurate and sensitive, the book makes crucial connections between the different aspects of Williams' work and the underlying concern for a democratic polity which informed it. 606 $aEnglish literature$y20th century 615 0$aEnglish literature 676 $a828.91409 676 $a828/.91409 700 $aEldridge$b J. E. T$g(John Eric Thomas)$0850614 701 $aEldridge$b Lizzie$f1967-$0169103 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910959755903321 996 $aRaymond Williams$94486518 997 $aUNINA