المؤلفون: Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani

المساهمون: Satoru Iwata and Naonori Kakimura, Didimo, Walter, Kaufmann, Michael, Liotta, Giuseppe, Ortali, Giacomo, Patrignani, Maurizio

مصطلحات موضوعية: Graph drawing, orthogonal drawings, upward drawings, rectilinear planarity, upward planarity

Relation: ispartofbook:34th International Symposium on Algorithms and Computation, {ISAAC} 2023; 34th International Symposium on Algorithms and Computation, {ISAAC} 2023; volume:283; firstpage:1; lastpage:20; numberofpages:20; https://hdl.handle.net/11590/460703; https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.26

الاتاحة: https://hdl.handle.net/11590/460703
https://doi.org/10.4230/lipics.isaac.2023.26
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.26

المؤلفون: Didimo, Walter, Kaufmann, Michael, Liotta, Giuseppe, Ortali, Giacomo, Patrignani, Maurizio

المساهمون: Walter Didimo and Michael Kaufmann and Giuseppe Liotta and Giacomo Ortali and Maurizio Patrignani

مصطلحات موضوعية: Graph drawing, orthogonal drawings, upward drawings, rectilinear planarity, upward planarity

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

Relation: Is Part Of LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.26

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

المؤلفون: Bhore, Sujoy, Ganian, Robert, Khazaliya, Liana, Montecchiani, Fabrizio, Nöllenburg, Martin

المساهمون: Sujoy Bhore and Robert Ganian and Liana Khazaliya and Fabrizio Montecchiani and Martin Nöllenburg

مصطلحات موضوعية: orthogonal drawings, bend minimization, extension problems, parameterized complexity

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

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

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

المؤلفون: DÎNTU, Sergiu, ȘULETEA, Angela, BOTEZ, Alexei, JANDÎC, Tudor

المصدر: Journal of Social Sciences, Vol V, Iss 2, Pp 104-112 (2022)

مصطلحات موضوعية: engineering graphics, orthogonal drawings, staggered teaching method of 3d modeling, Social Sciences

وصف الملف: electronic resource

Relation: https://jss.utm.md/wp-content/uploads/sites/21/2022/06/JSS-2-2022_104-112.pdf; https://doaj.org/toc/2587-3490; https://doaj.org/toc/2587-3504

URL الوصول: https://doaj.org/article/31c8e75dc00143f6a0f6cc61bae18d9a

المؤلفون: Eades P., Hong S., Liotta G., Montecchiani F., Nollenburg M., Piselli T., Wismath S.

المساهمون: Eades, P., Hong, S., Liotta, G., Montecchiani, F., Nollenburg, M., Piselli, T., Wismath, S.

مصطلحات موضوعية: Fairness, Network visualization, Orthogonal drawings, Stress minimization

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001370060300001; volume:691; journal:INFORMATION SCIENCES; https://hdl.handle.net/11391/1588428

الاتاحة: https://hdl.handle.net/11391/1588428
https://doi.org/10.1016/j.ins.2024.121642

المؤلفون: Didimo W., Kaufmann M., Liotta G., Ortali G.

المساهمون: Didimo, W., Kaufmann, M., Liotta, G., Ortali, G.

مصطلحات موضوعية: Orthogonal drawings, Partial 2-trees, Rectilinear planarity testing, Series-parallel graphs, Variable embedding

وصف الملف: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-031-22202-3; info:eu-repo/semantics/altIdentifier/isbn/978-3-031-22203-0; info:eu-repo/semantics/altIdentifier/wos/WOS:000964584300012; ispartofbook:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 30th International Symposium on Graph Drawing and Network Visualization, GD 2022; volume:13764; firstpage:157; lastpage:172; numberofpages:16; serie:LECTURE NOTES IN COMPUTER SCIENCE; https://hdl.handle.net/11391/1553149; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85148689396

الاتاحة: https://hdl.handle.net/11391/1553149
https://doi.org/10.1007/978-3-031-22203-0_12

المؤلفون: Di Giacomo E., Didimo W., Liotta G., Montecchiani F., Ortali G.

المساهمون: Di Giacomo, E., Didimo, W., Liotta, G., Montecchiani, F., Ortali, G.

مصطلحات موضوعية: bend-minimization, Orthogonal drawings, parameterized complexity

Relation: info:eu-repo/semantics/altIdentifier/isbn/9783031492747; info:eu-repo/semantics/altIdentifier/isbn/9783031492754; ispartofbook:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 31st International Symposium on Graph Drawing and Network Visualization, GD 2023; volume:14466; firstpage:53; lastpage:65; numberofpages:13; serie:LECTURE NOTES IN COMPUTER SCIENCE; https://hdl.handle.net/11391/1569590; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85182595133

الاتاحة: https://hdl.handle.net/11391/1569590
https://doi.org/10.1007/978-3-031-49275-4_4

المؤلفون: Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali

المصدر: Algorithmica.

مصطلحات موضوعية: Linear-time algorithms, Plane graphs, Bend minimization, General Computer Science, Series–parallel graphs, Applied Mathematics, Orthogonal drawings, Computer Science Applications

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab252d841f1cb03873ded9e71eacaa8c
https://doi.org/10.1007/s00453-023-01110-6

المؤلفون: Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali

المصدر: Lecture Notes in Computer Science ISBN: 9783031222023

مصطلحات موضوعية: Series-parallel graphs, Partial 2-trees, Orthogonal drawings, Variable embedding, Rectilinear planarity testing

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f59733809a7a48fe474e290e42951e9c
https://hdl.handle.net/11391/1553149

المؤلفون: Ignaz Rutter, Karsten Klein, Carla Binucci, Maurizio Patrignani, Giuseppe Di Battista, Michael A. Bekos, Martin Gronemann, Walter Didimo

المساهمون: Bekos, Michael A., Binucci, Carla, DI BATTISTA, Giuseppe, Didimo, Walter, Gronemann, Martin, Klein, Karsten, Patrignani, Maurizio, Rutter, Ignaz, David Auber and Pavel Valtr, Bekos, M. A., Binucci, C., Di Battista, G, Didimo, W., Gronemann, M., Klein, K., Patrignani, M., Rutter, I.

المصدر: Lecture Notes in Computer Science ISBN: 9783030687656
Graph Drawing

مصطلحات موضوعية: Vertex (graph theory), Computational Geometry (cs.CG), FOS: Computer and information sciences, 050101 languages & linguistics, Class (set theory), General Computer Science, Computer science, Compaction, Orthogonal drawings, 02 engineering and technology, Orthogonal drawing, Theoretical Computer Science, Combinatorics, symbols.namesake, Turn-regularity, Turn (geometry), 0202 electrical engineering, electronic engineering, information engineering, 0501 psychology and cognitive sciences, Representation (mathematics), Time complexity, 05 social sciences, Contrast (statistics), Planar graph, Computer Science Applications, Computational Theory and Mathematics, Face (geometry), symbols, Computer Science - Computational Geometry, 020201 artificial intelligence & image processing, Geometry and Topology, MathematicsofComputing_DISCRETEMATHEMATICS

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::260355b0b96171754d58fa10b7489c2d
http://jgaa.info/getPaper?id=595

المؤلفون: Konstantinos Kakoulis, Ioannis Tollis

المصدر: Algorithms; Volume 9; Issue 2; Pages: 22

مصطلحات موضوعية: automated label placement, edge labeling, graph labeling, orthogonal drawings, graph drawing, NP-hard

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

Relation: https://dx.doi.org/10.3390/a9020022

الاتاحة: https://doi.org/10.3390/a9020022

المؤلفون: Bekos M. A., Binucci C., Battista G. D., Didimo W., Gronemann M., Klein K., Patrignani M., Rutter I.

المساهمون: Bekos, M. A., Binucci, C., Battista, G. D., Didimo, W., Gronemann, M., Klein, K., Patrignani, M., Rutter, I.

مصطلحات موضوعية: Compaction, Orthogonal drawings, Turn-regularity

وصف الملف: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-030-68765-6; info:eu-repo/semantics/altIdentifier/isbn/978-3-030-68766-3; ispartofbook:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 28th International Symposium on Graph Drawing and Network Visualization, GD 2020; volume:12590; firstpage:250; lastpage:264; numberofpages:15; serie:LECTURE NOTES IN ARTIFICIAL INTELLIGENCE; http://hdl.handle.net/11391/1498488; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85102774785; https://link.springer.com/chapter/10.1007/978-3-030-68766-3_20

الاتاحة: http://hdl.handle.net/11391/1498488
https://doi.org/10.1007/978-3-030-68766-3_20
https://link.springer.com/chapter/10.1007/978-3-030-68766-3_20

المؤلفون: Di Giacomo E, Didimo W., Kaufmann M., Liotta G.

المساهمون: Di Giacomo, E, Didimo, W., Kaufmann, M., Liotta, G.

مصطلحات موضوعية: arc diagrams, clustering visualization, connected components, drawing stability, Dynamic graph visualization, orthogonal drawings

وصف الملف: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000599209900001; volume:20; issue:1; firstpage:3; lastpage:19; numberofpages:17; journal:INFORMATION VISUALIZATION; http://hdl.handle.net/11391/1481592; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85096624714

الاتاحة: http://hdl.handle.net/11391/1481592
https://doi.org/10.1177/1473871620972339

المؤلفون: Giuseppe Liotta, Michael Kaufmann, Emilio Di Giacomo, Walter Didimo

مصطلحات موضوعية: Connected component, Dynamic graph visualization, Theoretical computer science, Computer science, 020207 software engineering, drawing stability, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Graph, arc diagrams, Visualization, clustering visualization, connected components, 010201 computation theory & mathematics, orthogonal drawings, 0202 electrical engineering, electronic engineering, information engineering, Computer Vision and Pattern Recognition

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

المؤلفون: Maurizio Patrignani, Walter Didimo, Giuseppe Liotta

المساهمون: Didimo, Walter, Liotta, Giuseppe, Patrignani, Maurizio

المصدر: Journal of Computer and System Sciences. 99:72-90

مصطلحات موضوعية: General Computer Science, Computer Networks and Communications, Graph Drawing, Orthogonal drawings, 0102 computer and information sciences, 02 engineering and technology, Computer Science::Computational Geometry, Edge (geometry), Orthogonal drawing, 01 natural sciences, Theoretical Computer Science, Combinatorics, symbols.namesake, Planar, Graph drawing, Computational Theory and Mathematic, 020204 information systems, Testing algorithms, 0202 electrical engineering, electronic engineering, information engineering, Complexity, HV-planarity, Computational Theory and Mathematics, Applied Mathematics, Mathematics, Testing algorithm, Planarity testing, Planar graph, Computer Networks and Communication, 010201 computation theory & mathematics, symbols, Vertical segment

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee5e8da2888858b31f29a4c44f34fa4b
https://doi.org/10.1016/j.jcss.2018.08.003

المؤلفون: Patrizio Angelini, Roman Prutkin, Alessandra Tappini, Luca Grilli, Antonios Symvonis, Philipp Kindermann, Michael A. Bekos, Tamara Mchedlidze, Walter Didimo

المصدر: Lecture Notes in Computer Science ISBN: 9783030044138
Graph Drawing

مصطلحات موضوعية: Computational Geometry (cs.CG), FOS: Computer and information sciences, General Computer Science, Computer science, Vertex angle, Orthogonal Drawings, Graph Drawing, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Convexity, Theoretical Computer Science, Combinatorics, symbols.namesake, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, 0202 electrical engineering, electronic engineering, information engineering, Greedy Drawings, Graph, Planarity testing, Planar graph, Vertex (geometry), Euclidean distance, Greedy drawings, Orthogonal drawings, Succinctness, 010201 computation theory & mathematics, Ordered pair, symbols, Computer Science - Computational Geometry, 020201 artificial intelligence & image processing, MathematicsofComputing_DISCRETEMATHEMATICS

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::47976ca7ce6b7ce38e214a218669d7bd
http://arxiv.org/abs/1808.09063

المؤلفون: Emilio Di Giacomo, Walter Didimo, Henk Meijer, William S. Evans, Fabrizio Montecchiani, Stephen K. Wismath, Giuseppe Liotta

المصدر: Lecture Notes in Computer Science ISBN: 9783319501055
Graph Drawing

مصطلحات موضوعية: Computational Geometry (cs.CG), FOS: Computer and information sciences, Non-planar graphs, Visibility representations, Vertex (graph theory), General Computer Science, Orthogonal Drawings, Vertex cover, Graph Drawing, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Edge cover, Theoretical Computer Science, Computer Science (all), Visibility Representations, 1-planarity, Combinatorics, Graph drawing, 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, Time complexity, Mathematics, Orthogonal polygons, Discrete mathematics, Applied Mathematics, 010102 general mathematics, Vertex separator, Neighbourhood (graph theory), Computer Science Applications1707 Computer Vision and Pattern Recognition, 1-Planarity, Graph, Computer Science Applications, 010201 computation theory & mathematics, Bounded function, Robbins' theorem, Computer Science - Computational Geometry, Embedding, Testing and drawing algorithms, 020201 artificial intelligence & image processing, Bound graph, Feedback vertex set

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b6b4ed728e99eb9a62ef0413167df0f9
https://doi.org/10.1007/s00453-017-0324-2

المؤلفون: Angelini P., Bekos M. A., Didimo W., Grilli L., Kindermann P., Mchedlidze T., Prutkin R., Symvonis A., Tappini A.

المساهمون: Angelini, P., Bekos, M. A., Didimo, W., Grilli, L., Kindermann, P., Mchedlidze, T., Prutkin, R., Symvonis, A., Tappini, A.

مصطلحات موضوعية: Graph Drawing, Greedy drawing, Orthogonal drawings

وصف الملف: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000494887800031; volume:795; firstpage:375; lastpage:397; numberofpages:23; journal:THEORETICAL COMPUTER SCIENCE; http://hdl.handle.net/11391/1459665; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85070186665; http://www.journals.elsevier.com/theoretical-computer-science/

الاتاحة: http://hdl.handle.net/11391/1459665
https://doi.org/10.1016/j.tcs.2019.07.019
http://www.journals.elsevier.com/theoretical-computer-science/

المؤلفون: Maurizio Patrignani, Walter Didimo, Giuseppe Liotta

المصدر: Lecture Notes in Computer Science ISBN: 9783030044138
Graph Drawing

مصطلحات موضوعية: FOS: Computer and information sciences, Orthogonal Drawings, Graph Drawing, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, Combinatorics, symbols.namesake, Planar, Graph drawing, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Time complexity, Mathematics, Vertex (geometry), Planar graph, 010201 computation theory & mathematics, symbols, Embedding, 020201 artificial intelligence & image processing, Minimum-cost flow problem, Algorithms, MathematicsofComputing_DISCRETEMATHEMATICS

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb2e2c622c6be18abed60b2189eba29a
https://doi.org/10.1007/978-3-030-04414-5_34

المؤلفون: PATRIGNANI, Maurizio

المساهمون: Ming-Yang Kao, Patrignani, Maurizio

مصطلحات موضوعية: Planar embedding, Grid embedding, Bends, Orthogonal drawings, Network flow

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-642-27848-8; ispartofbook:Encyclopedia of Algorithms, 2nd Edition; firstpage:1; lastpage:5; numberofpages:5; http://hdl.handle.net/11590/298090

الاتاحة: http://hdl.handle.net/11590/298090
https://doi.org/10.1007/978-3-642-27848-8_651-1