LEADER 00887cam2 22002773 450 001 SOB007291 005 20210628085739.0 010 $a9722002171 100 $a20040211d2000 |||||ita|0103 ba 101 $apor 102 $aPT 200 1 $a<<4: A >>costa dos murmùrios$eRomance$fLìdia Jorge 205 $a11. ediçao 210 $aLisboa$cPublicaçoes Dom Quixote$d2000 215 $a260 p.$d21 cm 461 1$1001SOBE00045624$12001 $aObras completas / Lídia Jorge$v4 700 1$aJorge$b, Lìdia$3AF00007074$4070$0544296 801 0$aIT$bUNISOB$c20210628$gRICA 850 $aUNISOB 852 $aUNISOB$j869$m107528 912 $aSOB007291 940 $aM 102 Monografia moderna SBN 941 $aM 957 $a869$b000162$gSI$d107528$rACQUISTO$1rovito$2UNISOB$3UNISOB$420140102152131.0$520210628085657.0$6Alfano 996 $aCosta dos murmúrios$91363643 997 $aUNISOB LEADER 05138nam 2200589 a 450 001 9910438154003321 005 20200520144314.0 010 $a1-283-93349-7 010 $a1-4614-0110-0 024 7 $a10.1007/978-1-4614-0110-0 035 $a(CKB)2670000000317164 035 $a(EBL)994468 035 $a(OCoLC)823388154 035 $a(SSID)ssj0000879841 035 $a(PQKBManifestationID)11559183 035 $a(PQKBTitleCode)TC0000879841 035 $a(PQKBWorkID)10853536 035 $a(PQKB)10349685 035 $a(DE-He213)978-1-4614-0110-0 035 $a(MiAaPQ)EBC994468 035 $a(PPN)168294648 035 $a(EXLCZ)992670000000317164 100 $a20121019d2013 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aThirty essays on geometric graph theory /$fJanos Pach, editor 205 $a1st ed. 2013. 210 $aNew York $cSpringer$d2013 215 $a1 online resource (610 p.) 225 1 $aAlgorithms and Combinatorics 300 $aDescription based upon print version of record. 311 $a1-4939-0253-9 311 $a1-4614-0109-7 320 $aIncludes bibliographical references. 327 $aIntroduction -- 1) B. Ábrego - S. Fernández-Merchant - G. Salazar: The rectilinear crossing number of K_n: closing in (or are we?) -- 2) E. Ackerman: The maximum number of tangencies among convex regions with a triangle-free intersection graph -- 3) G. Aloupis - B. Ballinger - S. Collette - S. Langerman - A. Pór - D.R.Wood: Blocking coloured point sets -- 4) M. Al-Jubeh - G. Barequet - M. Ishaque - D. Souvaine - Cs. D. Tóth - A. Winslow: Constrained tri-connected planar straight line graphs -- 5) S. Buzaglo - R. Pinchasi - G. Rote: Topological hypergraphs -- 6) J. Cano Vila - L. F. Barba - J. Urrutia - T. Sakai:  On edge-disjoint empty triangles of point sets -- 7) J. Cibulka - J. Kyn?l - V. Mészáros - R. Stola? - P. Valtr: Universal sets for straight-line embeddings of bicolored graphs -- 8) G. Di Battista - F. Frati: Drawing trees, outerplanar graphs, series-parallel graphs, and planar graphs in small area -- 9) W. Didimo - G. Liotta: The crossing angle resolution in graph drawing -- 10) A. Dumitrescu: Mover problems -- 11) S. Felsner: Rectangle and square representations of planar graphs -- 12) R. Fulek - N. Saeedi - D. Sariöz: Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs -- 13) R. Fulek - M. Pelsmajer - M. Schaefer - D. ?tefankovi?: Hanani-Tutte, monotone drawings, and level-planarity -- 14) R. Fulek - A. Suk: On disjoint crossing families in geometric graphs -- 15) M. Hoffmann - A. Schulz - M. Sharir - A. Sheffer - Cs. D. Tóth - E. Welzl: Counting plane graphs: flippability and its applications -- 16) F. Hurtado - Cs. D. Tóth: Geometric graph augmentation: a generic perspective -- 17) M. Kano - K. Suzuki: Discrete geometry on red and blue points in the plane lattice -- 18) Gy. Károlyi: Ramsey-type problems for geometric graphs -- 19) Ch. Keller - M. Perles - E. Rivera-Campo - V. Urrutia-Galicia: Blockers for non-crossing spanning trees in complete geometric graphs -- 20) A. V. Kostochka - K. G. Milans: Coloring clean and K_4-free circle graphs -- 21) F. Mori? - D. Pritchard: Counting large distances in convex polygons: a computational approach -- 22) A. Raigorodskii: Coloring distance graphs and graphs of diameters -- 23) M. Schaefer: Realizability of graphs and linkages -- 24) C. Smyth: Equilateral sets in l_dp -- 25) A. Suk: A note on geometric 3-hypergraphs -- 26) K. Swanepoel: Favourite distances in high dimensions -- 27) M. Tancer: Intersection patterns of convex sets via simplicial complexes, a survey -- 28) G. Tardos: Construction of locally plane graphs with many edges -- 29) G. Tóth: A better bound for the pair-crossing number -- 30) U. Wagner: Minors, embeddability, and extremal problems for hypergraphs. 330 $aIn many applications of graph theory, graphs are regarded as geometric objects drawn in the plane or in some other surface. The traditional methods of "abstract" graph theory are often incapable of providing satisfactory answers to questions arising in such applications. In the past couple of decades, many powerful new combinatorial and topological techniques have been developed to tackle these problems. Today geometric graph theory is a burgeoning field with many striking results and appealing open questions. This contributed volume contains thirty original survey and research papers on important recent developments in geometric graph theory.  The contributions were thoroughly reviewed and written by excellent researchers in this field. 410 0$aAlgorithms and combinatorics,$x0937-5511 517 3 $a30 essays on geometric graph theory 606 $aGraph theory 615 0$aGraph theory. 676 $a511.5 701 $aPach$b Janos$0421811 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910438154003321 996 $aThirty essays on geometric graph theory$94186928 997 $aUNINA