LEADER 01056nam0 2200289 450 001 000014565 005 20080721113551.0 010 $a88-15-05645-9 100 $a20080721d1996----km-y0itay50------ba 101 0 $aita 102 $aIT 105 $ay-------001yy 200 1 $aEconomia e pianificazione della cittą sostenibile$fa cura di Roberto Camagni$gcontributi di M. Bricocoli ... [et al.] 210 $aBologna$cIl Mulino$d1996 215 $a350 p.$d21 cm 300 $aIn cop.: Politecnico di Milano, Dipartimento di economia e produzione 610 1 $aPianificazione urbanistica 610 1 $aEconomia$aZone urbane 676 $a330.91732$v20$9Situazioni e condizioni economiche. Regioni urbane 702 1$aCamagni,$bRoberto 702 1$aBricocoli,$bMassimo 712 02$aPolitecnico$c :$bDipartimento di economia e produzione 801 0$aIT$bUNIPARTHENOPE$c20080721$gRICA$2UNIMARC 912 $a000014565 951 $a931/69$b8155$cNAVA2 996 $aEconomia e pianificazione della cittą sostenibile$963243 997 $aUNIPARTHENOPE LEADER 00948cam0 2200253 450 001 E600200057674 005 20200706094504.0 010 $a3511090830 100 $a20091214d1979 |||||ita|0103 ba 101 $ager 102 $aDE 200 1 $aSchellings Philosophisches System$e(Leipzig 1897). Schellings Positive Philosophie als Einheit von Hegel und Schopenhauer$e(Berlin 1869)$eNeudruck beider Werke in einem Band$fEduard von Hartmann 210 $aAalen$cScientia$d1979 215 $aXII,62 p.$d22 cm 700 1$aHartmann$b, Eduard : von$3A600200056860$4070$0482300 801 0$aIT$bUNISOB$c20200706$gRICA 850 $aUNISOB 852 $aUNISOB$j100$m72454 912 $aE600200057674 940 $aM 102 Monografia moderna SBN 941 $aM 957 $a100$b008195$gSi$d72454$racquisto$1pregresso2$2UNISOB$3UNISOB$420091214091022.0$520200706094448.0$6Alfano 996 $aSchellings Philosophisches System$91634125 997 $aUNISOB LEADER 04692nam 22007335 450 001 9910502645303321 005 20251225173540.0 010 $a3-030-86838-9 024 7 $a10.1007/978-3-030-86838-3 035 $a(CKB)4940000000612418 035 $a(MiAaPQ)EBC6730139 035 $a(Au-PeEL)EBL6730139 035 $a(OCoLC)1268984006 035 $a(DE-He213)978-3-030-86838-3 035 $a(PPN)258051515 035 $a(iGPub)SPNA0084125 035 $a(EXLCZ)994940000000612418 100 $a20210919d2021 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aGraph-Theoretic Concepts in Computer Science $e47th International Workshop, WG 2021, Warsaw, Poland, June 23?25, 2021, Revised Selected Papers /$fedited by ?ukasz Kowalik, Micha? Pilipczuk, Pawe? Rz??ewski 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (417 pages) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12911 311 08$a3-030-86837-0 320 $aIncludes bibliographical references and index. 327 $aPreprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set -- Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation -- Block Elimination Distance -- On Fair Covering and Hitting Problems -- On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem -- FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More -- Disjoint Stable Matchings in Linear Time -- Complementation in T-perfect Graphs -- On subgraph complementation to H-free graphs -- Odd Cycle Transversal in Mixed Graphs -- Preventing Small $(s, t)$-Cuts by Protecting Edges -- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel -- A heuristic approach to the treedepth decomposition problem for large graphs -- The Perfect Matching Cut Problem Revisited -- The Complexity of Gerrymandering Over Graphs: Paths and Trees -- Feedback Vertex Set on Hamiltonian Graphs -- Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality -- The Dynamic Complexity of Acyclic Hypergraph Homomorphisms -- Linearizable special cases of the quadratic shortest path problem -- A Linear-time Parameterized Algorithm for Computing the Width of a DAG -- On Morphing 1-Planar Drawings -- Bears with Hats and Independence Polynomials -- The Largest Connected Subgraph Game -- Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries -- Beyond Helly graphs: the diameter problem on absolute retracts -- Acyclic, Star, and Injective Colouring: Bounding the Diameter -- The Graphs of Stably Matchable Pairs -- On additive spanners in weighted graphs with local error -- Labeling Schemes for Deterministic Radio Multi-Broadcast -- On 3-Coloring of (2P_4, C_5)-Free Graphs. 330 $aChapter ?Bears with Hats and Independence Polynomials? is are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com. Chapters 1, 6, and 22 are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12911 606 $aMathematics$xData processing 606 $aData structures (Computer science) 606 $aInformation theory 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aComputational Mathematics and Numerical Analysis 606 $aData Structures and Information Theory 606 $aDesign and Analysis of Algorithms 606 $aDiscrete Mathematics in Computer Science 615 0$aMathematics$xData processing. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aComputational Mathematics and Numerical Analysis. 615 24$aData Structures and Information Theory. 615 24$aDesign and Analysis of Algorithms. 615 24$aDiscrete Mathematics in Computer Science. 676 $a511.5 702 $aKowalik$b ?ukasz 702 $aPilipczuk$b Micha? 702 $aRza?z?ewski$b Pawe? 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910502645303321 996 $aGraph-Theoretic Concepts in Computer Science$92569248 997 $aUNINA