LEADER 01219nam a2200265 i 4500 001 991001275739707536 005 20020507113740.0 008 000502s1998 it ||| | ita 020 $c38000 035 $ab10197928-39ule_inst 035 $aLE00645066$9ExL 040 $aDip.to Fisica$bita 100 1 $aMiglietta, Mario$0464123 245 10$aStudio di flussi stratificati umidi su una topografia isolata tridimensionale con un modello a mesoscala. Tesi di dottorato /$cdottorando Mario Miglietta ; relatori Livio Ruggiero e Andrea Buzzi ; coordinatore Marco Boiti 260 $aLecce :$bUniversitŕ degli Studi, Lecce. Dottorato di ricerca in Fisica XII Ciclo,$ca.a. 1998-99 300 $aiv, 190 p. :$bill. ;$c30 cm. 700 1 $aRuggiero, Livio 700 1 $aBuzzi, Andrea 700 1 $aBoiti, Marco 907 $a.b10197928$b02-04-14$c27-06-02 912 $a991001275739707536 945 $aLE006 TD10$g1$i2006000080569$lle006$og$pE0.00$q-$rn$so $t1$u0$v0$w0$x0$y.i10244517$z27-06-02 996 $aStudio di flussi stratificati umidi su una topografia isolata tridimensionale con un modello a mesoscala. Tesi di dottorato$9191264 997 $aUNISALENTO 998 $ale006$b01-01-00$cm$da $e-$fita$git $h0$i1 LEADER 02330oam 2200709 450 001 9910716023403321 005 20220307170834.0 035 $a(CKB)5470000002517874 035 $a(OCoLC)881475477 035 $a(EXLCZ)995470000002517874 100 $a20140618d2013 ua 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aEnhancement of degraded shrub-steppe habitats with an emphasis on potential applicability in eastern Washington /$fPeter Dunwiddie, Pam Camp 210 1$a[Washington, D.C.] :$cU.S. Department of the Interior, Bureau of Land Management,$d2013. 215 $a1 online resource (vii, 86 pages) $ccolor illustrations, one color map, forms 225 1 $aTechnical note ;$v443 300 $a"December 2013." 300 $a"BLM/OC/ST-14/001+6711"--Page 2 of cover. 320 $aIncludes bibliographical references (pages 69-76). 606 $aRestoration ecology$zWashington (State), Eastern 606 $aShrubland ecology$zWashington (State), Eastern 606 $aHabitat (Ecology)$zWashington (State), Eastern 606 $aSagebrush$zWashington (State), Eastern 606 $aSteppe ecology$zWashington (State), Eastern 606 $aRestoration ecology$2fast 606 $aSagebrush$2fast 606 $aShrubland ecology$2fast 606 $aSteppe ecology$2fast 615 0$aRestoration ecology 615 0$aShrubland ecology 615 0$aHabitat (Ecology) 615 0$aSagebrush 615 0$aSteppe ecology 615 7$aRestoration ecology. 615 7$aSagebrush. 615 7$aShrubland ecology. 615 7$aSteppe ecology. 700 $aDunwiddie$b Peter$01400211 702 $aCamp$b Pamela 712 02$aUnited States.$bBureau of Land Management, 801 0$bUDD 801 1$bUDD 801 2$bOCLCO 801 2$bUDD 801 2$bOCLCQ 801 2$bOCLCA 801 2$bOCLCF 801 2$bUDD 801 2$bOCL 801 2$bINARC 801 2$bOCLCA 801 2$bGPO 801 2$bOCLCO 801 2$bGPO 906 $aBOOK 912 $a9910716023403321 996 $aEnhancement of degraded shrub-steppe habitats with an emphasis on potential applicability in eastern Washington$93466699 997 $aUNINA 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