Literatura académica sobre el tema "Geometric Intersection Graphs"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Geometric Intersection Graphs".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Geometric Intersection Graphs"
Fekete, Sándor P. y Phillip Keldenich. "Conflict-Free Coloring of Intersection Graphs". International Journal of Computational Geometry & Applications 28, n.º 03 (septiembre de 2018): 289–307. http://dx.doi.org/10.1142/s0218195918500085.
Texto completoBaste, Julien y Dimitrios M. Thilikos. "Contraction Bidimensionality of Geometric Intersection Graphs". Algorithmica 84, n.º 2 (24 de enero de 2022): 510–31. http://dx.doi.org/10.1007/s00453-021-00912-w.
Texto completoEppstein, David. "Testing bipartiteness of geometric intersection graphs". ACM Transactions on Algorithms 5, n.º 2 (marzo de 2009): 1–35. http://dx.doi.org/10.1145/1497290.1497291.
Texto completoCabello, Sergio y Wolfgang Mulzer. "Minimum cuts in geometric intersection graphs". Computational Geometry 94 (marzo de 2021): 101720. http://dx.doi.org/10.1016/j.comgeo.2020.101720.
Texto completoUehara, Ryuhei. "Tractabilities and Intractabilities on Geometric Intersection Graphs". Algorithms 6, n.º 1 (25 de enero de 2013): 60–83. http://dx.doi.org/10.3390/a6010060.
Texto completoErlebach, Thomas y Jiri Fiala. "On-line coloring of geometric intersection graphs". Computational Geometry 23, n.º 2 (septiembre de 2002): 243–55. http://dx.doi.org/10.1016/s0925-7721(02)00089-5.
Texto completoTokunaga, Shin-ichi. "Intersection number of two connected geometric graphs". Information Processing Letters 59, n.º 6 (septiembre de 1996): 331–33. http://dx.doi.org/10.1016/0020-0190(96)00124-x.
Texto completoErlebach, Thomas, Klaus Jansen y Eike Seidel. "Polynomial-Time Approximation Schemes for Geometric Intersection Graphs". SIAM Journal on Computing 34, n.º 6 (enero de 2005): 1302–23. http://dx.doi.org/10.1137/s0097539702402676.
Texto completoAgnarsson, Geir, Peter Damaschke y Magnús M. Halldórsson. "Powers of geometric intersection graphs and dispersion algorithms". Discrete Applied Mathematics 132, n.º 1-3 (octubre de 2003): 3–16. http://dx.doi.org/10.1016/s0166-218x(03)00386-x.
Texto completode Berg, Mark, Sándor Kisfaludi-Bak y Gerhard Woeginger. "The complexity of Dominating Set in geometric intersection graphs". Theoretical Computer Science 769 (mayo de 2019): 18–31. http://dx.doi.org/10.1016/j.tcs.2018.10.007.
Texto completoTesis sobre el tema "Geometric Intersection Graphs"
Hoffmann, Udo [Verfasser], Stefan [Akademischer Betreuer] Felsner, Stefan [Gutachter] Felsner, Wolfgang [Gutachter] Mulzer y Jean [Gutachter] Cardinal. "Intersection graphs and geometric objects in the plane / Udo Hoffmann ; Gutachter: Stefan Felsner, Wolfgang Mulzer, Jean Cardinal ; Betreuer: Stefan Felsner". Berlin : Technische Universität Berlin, 2016. http://d-nb.info/1156014530/34.
Texto completoKim, Minho. "Finding intersection curves using subdividable linear efficient function enclosures". [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0005702.
Texto completoVodah, Sunday. "On the primarity of some block intersection graphs". University of the Western Cape, 2018. http://hdl.handle.net/11394/6735.
Texto completoA tactical con guration consists of a nite set V of points, a nite set B of blocks and an incidence relation between them, so that all blocks are incident with the same number k points, and all points are incident with the same number r of blocks (See [14] for example ). If v := jV j and b := jBj; then v; k; b; r are known as the parameters of the con guration. Counting incident point-block pairs, one sees that vr = bk: In this thesis, we generalize tactical con gurations on Steiner triple systems obtained from projective geometry. Our objects are subgeometries as blocks. These subgeometries are collected into systems and we study them as designs and graphs. Considered recursively is a further tactical con guration on some of the designs obtained and in what follows, we obtain similar structures as the Steiner triple systems from projective geometry. We also study these subgeometries as factorizations and examine the automorphism group of the new structures. These tactical con gurations at rst sight do not form interesting structures. However, as will be shown, they o er some level of intriguing symmetries. It will be shown that they inherit the automorphism group of the parent geometry.
Jia, Jinyuan. "Revolute quadric decomposition of special surfaces and its application to their intersection problems /". View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20JIA.
Texto completoIncludes bibliographical references (leaves 156-168). Also available in electronic version. Access restricted to campus users.
Burkhart, Craig. "Approval Voting Theory with Multiple Levels of Approval". Scholarship @ Claremont, 2012. https://scholarship.claremont.edu/hmc_theses/26.
Texto completoJoshi, Utkarsh. "Fast Algorithms for Max Cut on Geometric Intersection Graphs". Thesis, 2022. https://etd.iisc.ac.in/handle/2005/5883.
Texto completoJedličková, Nikola. "Algoritmické otázky průnikových tříd grafů". Master's thesis, 2019. http://www.nusl.cz/ntk/nusl-405305.
Texto completoZeman, Peter. "Algebraické, strukturální a výpočetní vlastnosti geometrických reprezentací grafů". Master's thesis, 2016. http://www.nusl.cz/ntk/nusl-352783.
Texto completoLafreniere, Benjamin J. "Packing Unit Disks". Thesis, 2008. http://hdl.handle.net/10012/3907.
Texto completoLibros sobre el tema "Geometric Intersection Graphs"
Alberto, Corso y Polini Claudia 1966-, eds. Commutative algebra and its connections to geometry: Pan-American Advanced Studies Institute, August 3--14, 2009, Universidade Federal de Pernambuco, Olinda, Brazil. Providence, R.I: American Mathematical Society, 2011.
Buscar texto completoCapítulos de libros sobre el tema "Geometric Intersection Graphs"
Grigoriev, Alexander, Athanassios Koutsonas y Dimitrios M. Thilikos. "Bidimensionality of Geometric Intersection Graphs". En SOFSEM 2014: Theory and Practice of Computer Science, 293–305. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04298-5_26.
Texto completoErlebach, Thomas y Erik Jan van Leeuwen. "Domination in Geometric Intersection Graphs". En Lecture Notes in Computer Science, 747–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-78773-0_64.
Texto completoDamaschke, Peter. "Efficient Dispersion Algorithms for Geometric Intersection Graphs". En Graph-Theoretic Concepts in Computer Science, 107–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-40064-8_11.
Texto completoJana, Satyabrata, Anil Maheshwari, Saeed Mehrabi y Sasanka Roy. "Maximum Bipartite Subgraph of Geometric Intersection Graphs". En WALCOM: Algorithms and Computation, 158–69. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39881-1_14.
Texto completoKisfaludi-Bak, Sándor, Karolina Okrasa y Paweł Rzążewski. "Computing List Homomorphisms in Geometric Intersection Graphs". En Graph-Theoretic Concepts in Computer Science, 313–27. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-15914-5_23.
Texto completoKratochvíl, Jan y Martin Pergel. "Geometric Intersection Graphs: Do Short Cycles Help?" En Lecture Notes in Computer Science, 118–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-73545-8_14.
Texto completoBhore, Sujoy, Satyabrata Jana, Supantha Pandit y Sasanka Roy. "Balanced Connected Subgraph Problem in Geometric Intersection Graphs". En Combinatorial Optimization and Applications, 56–68. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-36412-0_5.
Texto completoChan, Timothy M. y Dimitrios Skrepetos. "All-Pairs Shortest Paths in Geometric Intersection Graphs". En Lecture Notes in Computer Science, 253–64. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62127-2_22.
Texto completoAgnarsson, Geir, Peter Damaschke y Magnús M. Halldórsson. "Powers of Geometric Intersection Graphs and Dispersion Algorithms". En Algorithm Theory — SWAT 2002, 140–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45471-3_15.
Texto completoKeller, Chaya y Shakhar Smorodinsky. "Conflict-Free Coloring of Intersection Graphs of Geometric Objects". En Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2397–411. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2018. http://dx.doi.org/10.1137/1.9781611975031.154.
Texto completoActas de conferencias sobre el tema "Geometric Intersection Graphs"
Kumar, Rajeev, P. K. Singh y Bhargab B. Bhattacharya. "Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs". En the 8th annual conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1143997.1144274.
Texto completoFox, Jacob y János Pach. "Coloring kk-free intersection graphs of geometric objects in the plane". En the twenty-fourth annual symposium. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1377676.1377735.
Texto completode Berg, Mark, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx y Tom C. van der Zanden. "A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs". En STOC '18: Symposium on Theory of Computing. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3188745.3188854.
Texto completoKumar, Rajeev, P. K. Singh y Bhargab B. Bhattacharya. "A Local Search Heuristic for Biobjective Intersecting Geometric Graphs". En 2007 International Conference on Computing: Theory and Applications (ICCTA'07). IEEE, 2007. http://dx.doi.org/10.1109/iccta.2007.10.
Texto completoShah, Jami J. y Bing-Chun Zhang. "Attributed Graph Model for Geometric Tolerancing". En ASME 1992 Design Technical Conferences. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/detc1992-0158.
Texto completoLesnova, Elena y Denis Voloshinov. "The Algorithm for Crossing the N-dimensional Hyperquadric with N-1-dimensional Hyperspace". En 31th International Conference on Computer Graphics and Vision. Keldysh Institute of Applied Mathematics, 2021. http://dx.doi.org/10.20948/graphicon-2021-3027-739-744.
Texto completoPeng, Xiaobo y Derek Yip-Hoi. "R*-Tree Localization for Polyhedral Model Based Cutter/Workpiece Engagements Calculations in Milling". En ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-34367.
Texto completoShyamsundar, N. y Rajit Gadh. "Geometric Abstractions to Support Contact Based Disassembly Evaluation". En ASME 1997 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1997. http://dx.doi.org/10.1115/detc97/dac-3972.
Texto completoMasoudi, Nafiseh y Georges Fadel. "A Geometric Path-Planning Algorithm in Cluttered Planar Environments Using Convex Hulls". En ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/detc2018-85384.
Texto completoErdim, Hu¨seyin y Horea Ilies¸. "A Point Membership Classification for Sweeping Solids". En ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-34827.
Texto completo