LEADER 01167nam2 22002893i 450 001 VAN0115219 005 20180226115518.390 010 $a31-10-07612-8 100 $a20180226d1978 |0itac50 ba 101 $ager$aMUL 102 $aDE 105 $a|||| ||||| 200 1 $aˆ<<‰Principat>> 16.2$fherausgegeben von Wolfgang Haase 210 $aBerlin$cNew York$cDe Gruyter$d1978 215 $a VII, 834-1773, [29] p. di tav.$cill.$d25 cm. 316 $aESTERNO SALA BLU - SCAFFALE 3$5IT-IT-CE0105 CONSXVIII.RR.316.2 461 1$1001VAN0108365$12001 $aˆ2: ‰Principat.$v16.2 606 $aRoma antica$xStoria (Sec. 8.-1.a.c.)$3VANC012243$2FI 620 $dBerlin$3VANL000066 702 1$aHaase$bWolfgang$3VANV026691 712 $aDe Gruyter $3VANV109804$4650 801 $aIT$bSOL$c20240802$gRICA 899 $aBIBLIOTECA DEL DIPARTIMENTO DI GIURISPRUDENZA$1IT-CE0105$2VAN00 912 $aVAN0115219 950 $aBIBLIOTECA DEL DIPARTIMENTO DI GIURISPRUDENZA$d00CONS XVIII.RR.3 16.2 $e00 16194 20180226 ESTERNO SALA BLU - SCAFFALE 3 996 $aPrincipat 16.2$91521197 997 $aUNICAMPANIA LEADER 05117nam 22007095 450 001 9910349281803321 005 20251230065512.0 010 $a3-030-30786-7 024 7 $a10.1007/978-3-030-30786-8 035 $a(CKB)4100000009273621 035 $a(DE-He213)978-3-030-30786-8 035 $a(MiAaPQ)EBC5926442 035 $a(PPN)255585039 035 $a(EXLCZ)994100000009273621 100 $a20190911d2019 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aGraph-Theoretic Concepts in Computer Science $e45th International Workshop, WG 2019, Vall de Núria, Spain, June 19?21, 2019, Revised Papers /$fedited by Ignasi Sau, Dimitrios M. Thilikos 205 $a1st ed. 2019. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2019. 215 $a1 online resource (XXI, 394 p. 304 illus., 41 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11789 311 08$a3-030-30785-9 327 $aLogic and Random Graphs -- Unavoidability and universality of digraphs -- Parameterized algorithms for geometric graphs via decomposition theorems -- Subexponential algorithms for variants of homomorphism problem in string graphs -- The 4-Steiner Root Problem -- Hamiltonicity below Dirac?s condition -- Maximum Independent Sets in Subcubic Graphs: New Results -- Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs -- Local approximation of the Maximum Cut in regular graphs -- Fixed-parameter tractability of counting small minimum (S,T)-cuts -- Fast Breadth-First Search in Still Less Space -- A Turing Kernelization Dichotomy for Structural Parameterizations of F-Minor-Free Deletion -- Flip distances between graph orientations -- Graph functionality -- On Happy Colorings, Cuts, and Structural Parameterizations -- Shortest Reconfiguration of Matchings -- Travelling on Graphs with Small Highway Dimension -- The Power of Cut-Based Parameters for Computing Edge Disjoint Paths -- Geometric Representations of Dichotomous Ordinal Data -- Linear MIM-width of Trees -- Approximating Minimum Dominating Set on String graphs -- Classified Rank-Maximal Matchings and Popular Matchings -- Algorithms and Hardness -- Maximum Matchings and Minimum Blocking Sets in Theta-6 Graphs -- A polynomial-time algorithm for the independent set problem in $\{P_{10},C_4,C_6\}$-free graphs -- Independent Set Reconfiguration Parameterized by Modular-Width -- Counting independent sets in graphs with bounded bipartite pathwidth -- Intersection Graphs of Non-Crossing Paths -- Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs -- Color Refinement, Homomorphisms, and Hypergraphs -- 3-colorable planar graphs have an intersection segment representation using 3 slopes -- The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms -- Minimal separators in graph classes defined by small forbidden induced subgraphs. 330 $aThis book constitutes the revised papers of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019, held in Vall de Núria, Spain, in June 2019. The 29 full papers presented in this volume were carefully reviewed and selected from 87 submissions. They cover a wide range of areas, aiming at connecting theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. Another focus is on presenting recent results and on identifying and exploring promising directions of future research. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11789 606 $aMathematics$xData processing 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence$xData processing 606 $aAlgorithms 606 $aComputer arithmetic and logic units 606 $aComputational Mathematics and Numerical Analysis 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 606 $aAlgorithms 606 $aArithmetic and Logic Structures 615 0$aMathematics$xData processing. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence$xData processing. 615 0$aAlgorithms. 615 0$aComputer arithmetic and logic units. 615 14$aComputational Mathematics and Numerical Analysis. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 615 24$aAlgorithms. 615 24$aArithmetic and Logic Structures. 676 $a511.5 676 $a004.0151 702 $aSau$b Ignasi$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aThilikos$b Dimitrios M$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910349281803321 996 $aGraph-Theoretic Concepts in Computer Science$92569248 997 $aUNINA