المؤلفون: Firman, Oksana, Gutowski, Grzegorz, Kryven, Myroslav, Okada, Yuto, Wolff, Alexander

المساهمون: Oksana Firman and Grzegorz Gutowski and Myroslav Kryven and Yuto Okada and Alexander Wolff

مصطلحات موضوعية: treewidth, outerplanar graphs, outer k-planar graphs, outer min-k-planar graphs, cop number, separation number

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.14

الاتاحة: https://doi.org/10.4230/LIPIcs.GD.2024.14
https://nbn-resolving.org/urn:nbn:de:0030-drops-212988
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.14

المؤلفون: Bekos, Michael A., Bose, Prosenjit, Büngener, Aaron, Dujmović, Vida, Hoffmann, Michael, id_orcid:0 000-0001-5307-7106, Kaufmann, Michael, Morin, Pat, Odak, Saeed, Weinberger, Alexandra

المساهمون: Felsner, Stefan, Klein, Karsten

المصدر: Leibniz International Proceedings in Informatics (LIPIcs), 320 ; 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)

مصطلحات موضوعية: Beyond-planar Graphs, k-planar Graphs, Local Crossing Number, Crossing Number, Discharging Method, Crossing Lemma

وصف الملف: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-343-0; http://hdl.handle.net/20.500.11850/705752

الاتاحة: https://hdl.handle.net/20.500.11850/705752
https://doi.org/10.3929/ethz-b-000705752

المؤلفون: Büngener, Aaron, Kaufmann, Michael

المساهمون: Aaron Büngener and Michael Kaufmann

مصطلحات موضوعية: Crossing Lemma, k-planar graphs, discharging method

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.29

الاتاحة: https://doi.org/10.4230/LIPIcs.GD.2024.29
https://nbn-resolving.org/urn:nbn:de:0030-drops-213136
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.29

المؤلفون: Chaplick, Steven, Klute, Fabian Maximilian, Parada Muñoz, Irene María de, Rollin, Jonathan, Ueckerdt, Torsten

المساهمون: Universitat Politècnica de Catalunya. Departament de Matemàtiques, Universitat Politècnica de Catalunya. DCCG - Discrete, Combinational, and Computational Geometry

مصطلحات موضوعية: Àrees temàtiques de la UPC::Matemàtiques i estadística, Discrete geometry, Graph theory, K-planar graphs, Multigraphs, Saturated drawings, Geometria discreta, Grafs, Teoria de

وصف الملف: application/pdf

Relation: info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-104129GB-I00/ES/TEORIA Y APLICACIONES DE CONFIGURACIONES DE PUNTOS Y REDES/; Chaplick, S. [et al.]. Edge-minimum saturated k-planar drawings. "Journal of graph theory", 28 Març 2024; https://publikationen.bibliothek.kit.edu/1000170071; http://hdl.handle.net/2117/406975

الاتاحة: http://hdl.handle.net/2117/406975
https://publikationen.bibliothek.kit.edu/1000170071
https://doi.org/10.1002/jgt.23097

المؤلفون: Hoffmann, Michael, id_orcid:0 000-0001-5307-7106, Reddy, Meghana M.

المساهمون: Chambers, Erin W., Gudmundsson, Joachim

المصدر: 39th International Symposium on Computational Geometry

مصطلحات موضوعية: k-planar graphs, local crossing number, saturated graphs, beyond-planar graphs

وصف الملف: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-273-0; info:eu-repo/grantAgreement/SNF/Projekte MINT/171681; http://hdl.handle.net/20.500.11850/621956; urn:isbn:978-3-95977-273-0

الاتاحة: https://hdl.handle.net/20.500.11850/621956
https://doi.org/10.3929/ethz-b-000621956

المؤلفون: Di Giacomo, Emilio, Eades, Peter, Liotta, Giuseppe, Meijer, Henk, Montecchiani, Fabrizio

المساهمون: Emilio Di Giacomo and Peter Eades and Giuseppe Liotta and Henk Meijer and Fabrizio Montecchiani

مصطلحات موضوعية: Topological graphs, graph drawing, curve complexity, skewness-k graphs, k-planar graphs

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.39

الاتاحة: https://doi.org/10.4230/LIPIcs.ISAAC.2018.39
https://nbn-resolving.org/urn:nbn:de:0030-drops-99871
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.39

المؤلفون: Bekos, Michael A., Kaufmann, Michael, Raftopoulou, Chrysanthi N.

المساهمون: Michael A. Bekos and Michael Kaufmann and Chrysanthi N. Raftopoulou

مصطلحات موضوعية: topological graphs, optimal k-planar graphs, characterization

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.16

الاتاحة: https://doi.org/10.4230/LIPIcs.SoCG.2017.16
https://nbn-resolving.org/urn:nbn:de:0030-drops-72307
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.16

المؤلفون: Bae, Sang Won, Baffier, Jean Francois, Chun, Jinhee, Eades, Peter, Eickmeyer, Kord, Grilli, Luca, Hong, Seok Hee, Korman, Matias, Montecchiani, Fabrizio, Rutter, Ignaz, Tóth, Csaba D., Frati, F., Ma, K-L.

المساهمون: Algorithms, Geometry and Applications, Applied Geometric Algorithms

المصدر: Graph Drawing and Network Visualization-25th International Symposium, GD 2017, Revised Selected Papers, 531-545
STARTPAGE=531;ENDPAGE=545;TITLE=Graph Drawing and Network Visualization-25th International Symposium, GD 2017, Revised Selected Papers
arXiv. Cornell University Library
Lecture Notes in Computer Science ISBN: 9783319739144
Graph Drawing

مصطلحات موضوعية: Computational Geometry (cs.CG), FOS: Computer and information sciences, General Computer Science, Theoretical Computer Science, Computer Science (all), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Combinatorics, symbols.namesake, Indifference graph, Pathwidth, Chordal graph, k-quasiplanar graphs, 0202 electrical engineering, electronic engineering, information engineering, Cograph, Mathematics, Discrete mathematics, Clique-sum, Beyond planarity k-gap-planar graphs, Density results, Trapezoid graph, Recognition problem, 1-planar graph, Graph, Planar graph, cs.CG, k-planar graphs, Complete graphs, 010201 computation theory & mathematics, symbols, Maximum density, Computer Science - Computational Geometry, 020201 artificial intelligence & image processing, Maximal independent set, Casing

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de5502620f8c3423469ea3c5046f7fb0
https://doi.org/10.1007/978-3-319-73915-1_41

المؤلفون: Meghana M. Reddy, Michael Hoffmann, Csaba D. Tóth, Chih-Hung Liu

المساهمون: Auber, David, Valtr, Pavel

المصدر: Lecture Notes in Computer Science, 12590
Graph Drawing and Network Visualization
Lecture Notes in Computer Science ISBN: 9783030687656
Graph Drawing

مصطلحات موضوعية: Computational Geometry (cs.CG), FOS: Computer and information sciences, 050101 languages & linguistics, Discrete Mathematics (cs.DM), Existential quantification, 02 engineering and technology, Edge (geometry), Topology, Topological graphs, Local crossing number, k-planar graphs, symbols.namesake, Simple (abstract algebra), FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Combinatorics, 0501 psychology and cognitive sciences, Point (geometry), Mathematics, Image (category theory), 05 social sciences, Function (mathematics), Planar graph, Finite graph, symbols, Computer Science - Computational Geometry, 020201 artificial intelligence & image processing, Combinatorics (math.CO), Computer Science - Discrete Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9c2f744d9e7d1c7ad6ba2d03c6c8d4d
https://hdl.handle.net/20.500.11850/465025

المؤلفون: Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani, Patrizio Angelini

مصطلحات موضوعية: General Computer Science, Graph Drawing, 0102 computer and information sciences, 02 engineering and technology, Disjoint sets, Computer Science::Computational Geometry, 01 natural sciences, Theoretical Computer Science, Combinatorics, symbols.namesake, Intersection, k-Planar Graphs, Visibility Representations, Computer Science (all), Graph drawing, 0202 electrical engineering, electronic engineering, information engineering, Representation (mathematics), Mathematics, Plane (geometry), Visibility (geometry), Planarity testing, Planar graph, 010201 computation theory & mathematics, symbols, 020201 artificial intelligence & image processing

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::568471671f829e80241192265c139152
http://hdl.handle.net/11391/1448954

المؤلفون: Michael Hoffmann, Walter Didimo, Csaba D. Tóth, Ignaz Rutter, Franz J. Brandenburg, Giuseppe Di Battista, Giuseppe Liotta, Michael A. Bekos, Patrizio Angelini, Giordano Da Lozzo, Fabrizio Montecchiani

المساهمون: Angelini, Patrizio, Bekos, Michael A., Brandenburg, Franz J., Da Lozzo, Giordano, Di Battista, Giuseppe, Didimo, Walter, Hoffmann, Michael, Liotta, Giuseppe, Montecchiani, Fabrizio, Rutter, Ignaz, Tóth, Csaba D.

المصدر: Journal of Combinatorial Theory. Series B, 142

مصطلحات موضوعية: Beyond planarity, Computational Geometry (cs.CG), FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0102 computer and information sciences, Edge (geometry), 01 natural sciences, Theoretical Computer Science, Combinatorics, Topological graphs, symbols.namesake, Simple (abstract algebra), FOS: Mathematics, Mathematics - Combinatorics, Discrete Mathematics and Combinatorics, 0101 mathematics, Mathematics, Graph drawing, k-Planar graphs, k-Quasiplanar graphs, 010102 general mathematics, Topological graph, Planar graph, Computational Theory and Mathematics, 010201 computation theory & mathematics, symbols, Computer Science - Computational Geometry, Pairwise comparison, Combinatorics (math.CO), Computer Science - Discrete Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::77940d67d9214d91a677268db6fdbb2c

المؤلفون: Giordano Da Lozzo, Ignaz Rutter, Giuseppe Di Battista, Fabrizio Montecchiani, Giuseppe Liotta, Michael A. Bekos, Patrizio Angelini, Walter Didimo, Franz J. Brandenburg

المساهمون: H.Bodlaender and G.Woeginger, Angelini, Patrizio, Bekos, Michael A., Brandenburg, Franz J., Da Lozzo, Giordano, Di Battista, Giuseppe, Didimo, Walter, Liotta, Giuseppe, Montecchiani, Fabrizio, Rutter, Ignaz

المصدر: Graph-Theoretic Concepts in Computer Science ISBN: 9783319687049
WG

مصطلحات موضوعية: Dense graph, Planar straight-line graph, Computer science, Doubly connected edge list, 0102 computer and information sciences, 02 engineering and technology, Computer Science::Computational Geometry, 01 natural sciences, Theoretical Computer Science, Combinatorics, symbols.namesake, Pathwidth, Apollonian network, Chordal graph, Outerplanar graph, 0202 electrical engineering, electronic engineering, information engineering, Beyond-planarity, k-planar graphs, k-quasi planar graphs, Book embedding, Clique-sum, Two-graph, Nowhere-zero flow, 1-planar graph, Graph, Planar graph, 010201 computation theory & mathematics, symbols, 020201 artificial intelligence & image processing

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c39c5e2206321d056ebaa9e3a73ab1ac
https://doi.org/10.1007/978-3-319-68705-6_5

المؤلفون: Universitat Politècnica de Catalunya. Departament de Matemàtiques, Universitat Politècnica de Catalunya. DCCG - Discrete, Combinational, and Computational Geometry, Chaplick, Steven, Klute, Fabian Maximilian, Parada Muñoz, Irene María de, Rollin, Jonathan, Ueckerdt, Torsten

مصطلحات الفهرس: Àrees temàtiques de la UPC::Matemàtiques i estadística, Discrete geometry, Graph theory, K-planar graphs, Multigraphs, Saturated drawings, Geometria discreta, Grafs, Teoria de, Article

URL: https://publikationen.bibliothek.kit.edu/1000170071
http://hdl.handle.net/2117/406975
https://onlinelibrary.wiley.com/doi/10.1002/jgt.23097
https://onlinelibrary.wiley.com/doi/10.1002/jgt.23097
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-104129GB-I00/ES/TEORIA Y APLICACIONES DE CONFIGURACIONES DE PUNTOS Y REDES

المؤلفون: Michael Hoffmann and Meghana M. Reddy, Hoffmann, Michael, M. Reddy, Meghana

مصطلحات الفهرس: k-planar graphs, local crossing number, saturated graphs, beyond-planar graphs, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.39
Is Part Of LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023)