Skip to main content
It looks like you're using Internet Explorer 11 or older. This website works best with modern browsers such as the latest versions of Chrome, Firefox, Safari, and Edge. If you continue with this browser, you may see unexpected results.

JCU Authors Bibliography

Patrizio Angelini

Publications from 2012 on

Angelini, Patrizio, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, et al. 2020. “Simple K-Planar Graphs Are Simple (K + 1)-Quasiplanar.” Journal of Combinatorial Theory, Series B 142: 1–35. https://doi.org/10.1016/j.jctb.2019.08.006.

Angelini, Patrizio, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, and Ignaz Rutter. 2020. “Beyond Level Planarity: Cyclic, Torus, and Simultaneous Level Planarity.” Theoretical Computer Science 804 (12): 161–70. https://doi.org/10.1016/j.tcs.2019.11.024.

Ahmed, Reyan, Patrizio Angelini, Faryad Darabi Sahneh, Alon Efrat, David Glickenstein, Martin Gronemann, Niklas Heinsohn, et al. 2019. “Multi-Level Steiner Trees.” ACM Journal of Experimental Algorithmics 24 (1): 2.5:1–2.5:22. https://doi.org/10.1145/3368621.

Angelini, Patrizio, and Michael A. Bekos. 2019. “Hierarchical Partial Planarity.” Algorithmica 81 (6): 2196–2221. https://doi.org/10.1007/s00453-018-0530-6.

Angelini, Patrizio, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, and Alessandra Tappini. 2019. “Greedy Rectilinear Drawings.” Theoretical Computer Science 795: 375–97. https://doi.org/10.1016/j.tcs.2019.07.019.

Angelini, Patrizio, Michael A. Bekos, Michael Kaufmann, and Fabrizio Montecchiani. 2019. “On 3D Visibility Representations of Graphs with Few Crossings Per Edge.” Theoretical Computer Science 784: 11–20. https://doi.org/10.1016/j.tcs.2019.03.029.

Angelini, Patrizio, Michael A. Bekos, Giuseppe Liotta, and Fabrizio Montecchiani. 2019. “Universal Slope Sets for 1-Bend Planar Drawings.” Algorithmica 81 (6): 2527–56. https://doi.org/10.1007/s00453-018-00542-9.

Angelini, Patrizio, and Giordano Da Lozzo. 2019. “Clustered Planarity with Pipes.” Algorithmica 81 (6): 2484–2526. https://doi.org/10.1007/s00453-018-00541-w.

Angelini, Patrizio, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, and Thomas Schneck. 2018. “1-Fan-Bundle-Planar Drawings of Graphs.” Theoretical Computer Science 723: 23–50. https://doi.org/10.1016/j.tcs.2018.03.005.

Angelini, Patrizio, and Giordano Da Lozzo. 2018. “3-Coloring Arrangements of Line Segments with 4 Slopes Is Hard.” Information Processing Letters 137: 47–50. https://doi.org/10.1016/j.ipl.2018.05.002.

Angelini, Patrizio, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, and Ioannis G. Tollis. 2018. “Algorithms and Bounds for L-Drawings of Directed Graphs.” International Journal of Foundations of Computer Science 29 (04): 461–80. https://doi.org/10.1142/S0129054118410010.

Angelini, Patrizio, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, and Ignaz Rutter. 2018. “Windrose Planarity: Embedding Graphs with Direction-Constrained Edges.” ACM Transactions on Algorithms 14 (4): 1–24. https://doi.org/10.1145/3239561.

Angelini, Patrizio, Till Bruckdorfer, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, and Claudio Squarcella. 2018. “Small Universal Point Sets for K-Outerplanar Graphs.” Discrete & Computational Geometry 60 (2): 430–70. https://doi.org/10.1007/s00454-018-0009-x.

Alamdari, Soroush., Patrizio. Angelini, Fidel. Barrera-Cruz, Timothy M. Chan, Giordano Da. Lozzo, Giuseppe Di. Battista, Fabrizio. Frati, et al. 2017. “How to Morph Planar Graph Drawings.” SIAM Journal on Computing 46 (2): 824–52. https://doi.org/10.1137/16M1069171.

Angelini, Patrizio. 2017. “Monotone Drawings of Graphs with Few Directions.” Information Processing Letters 120: 16–22. https://doi.org/10.1016/j.ipl.2016.12.004.

Angelini, Patrizio, Giordano Da Lozzo, Giuseppe Di Battista, and Fabrizio Frati. 2017. “Strip Planarity Testing for Embedded Planar Graphs.” Algorithmica 77 (4): 1022–59. https://doi.org/10.1007/s00453-016-0128-9.

Angelini, Patrizio, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, and Ignaz Rutter. 2017. “Intersection-Link Representations of Graphs.” Journal of Graph Algorithms and Applications 21 (4): 731–55. https://doi.org/10.7155/jgaa.00437.

Angelini, Patrizio, Michael A. Bekos, Felice De Luca, Walter Didimo, Michael Kaufmann, Stephen Kobourov, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Vincenzo Roselli, and Antonios Symvonis. 2017. “Vertex-Coloring with Defects.” Journal of Graph Algorithms and Applications 21 (3): 313–40. https://doi.org/10.7155/jgaa.00418.

Angelini, Patrizio, and G. Da Lozzo. 2016. “SEFE = C-Planarity?” The Computer Journal 59 (12): 1831–38. https://doi.org/10.1093/comjnl/bxw035.

Angelini, Patrizio, William Evans, Fabrizio Frati, and Joachim Gudmundsson. 2016. “SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs.” Journal of Graph Theory 82 (1): 45–64. https://doi.org/10.1002/jgt.21884.

Angelini, Patrizio, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, and Ioannis G. Tollis. 2015. “Algorithms and Bounds for Drawing Non-Planar Graphs with Crossing-Free Subgraphs.” Computational Geometry 50 (1): 34–48. https://doi.org/10.1016/j.comgeo.2015.07.002.

Angelini, Patrizio, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, and Vincenzo Roselli. 2015. “Relaxing the Constraints of Clustered Planarity.” Computational Geometry 48 (2): 42–75. https://doi.org/10.1016/j.comgeo.2014.08.001.

Angelini, Patrizio, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, and Vincenzo Roselli. 2015. “The Importance of Being Proper: (In Clustered-Level Planarity and T-Level Planarity).” Theoretical Computer Science 571: 1–9. https://doi.org/10.1016/j.tcs.2014.12.019.

Angelini, Patrizio, Giordano Da Lozzo, and Daniel Neuwirth. 2015. “Advancements on SEFE and Partitioned Book Embedding Problems.” Theoretical Computer Science, Special Issue on Algorithms and Computation, 575: 71–89. https://doi.org/10.1016/j.tcs.2014.11.016.

Angelini, Patrizio, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, and Ignaz Rutter. 2015. “Testing Planarity of Partially Embedded Graphs.” ACM Transactions on Algorithms 11 (4): 32:1–32:42. https://doi.org/10.1145/2629341.

Angelini, Patrizio, Walter Didimo, Stephen Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, and Stephen Wismath. 2015. “Monotone Drawings of Graphs with Fixed Embedding.” Algorithmica 71 (2): 233–57. https://doi.org/10.1007/s00453-013-9790-3.

Angelini, Patrizio, Thomas Bläsius, and Ignaz Rutter. 2014. “Testing Mutual Duality of Planar Graphs.” International Journal of Computational Geometry & Applications 24 (04): 325–46. https://doi.org/10.1142/S0218195914600103.

Angelini, Patrizio, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, and Claudio Squarcella. 2014. “On the Area Requirements of Euclidean Minimum Spanning Trees.” Computational Geometry, The 12th International Symposium on Algorithms and Data Structures (WADS2011), 47 (2): 200–213. https://doi.org/10.1016/j.comgeo.2012.10.011.

Angelini, Patrizio, Giordano Da Lozzo, and Daniel Neuwirth. 2014. “On Some $\mathcal{NP}$-Complete SEFE Problems.” In Algorithms and Computation, edited by Sudebkumar Prasant Pal and Kunihiko Sadakane, 200–212. https://doi.org/10.1007/978-3-319-04657-0_20.

Angelini, Patrizio, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, and Vincenzo Roselli. 2014. “Morphing Planar Graph Drawings Optimally.” In Automata, Languages, and Programming, edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias, 126–37. https://doi.org/10.1007/978-3-662-43948-7_11.

Angelini, Patrizio, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, and Alexander Wolff. 2014. “Universal Point Sets for Drawing Planar Graphs with Circular Arcs.” Journal of Graph Algorithms and Applications 18 (3): 313–24. https://doi.org/10.7155/jgaa.00324.

Angelini, Patrizio, Pier Francesco Cortese, Giuseppe Di Battista, and Maurizio Patrignani. 2013. “Topological Morphing of Planar Graphs.” Theoretical Computer Science, Graph Algorithms and Applications: in Honor of Professor Giorgio Ausiello, 514: 2–20. https://doi.org/10.1016/j.tcs.2013.08.018.

Angelini, Patrizio, Giuseppe Di Battista, and Fabrizio Frati. 2013. “Simultaneous Embedding of Embedded Planar Graphs.” International Journal of Computational Geometry and Applications 23 (2): 93–126. https://doi.org/10.1142/S0218195913600029.

Angelini, Patrizio, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, and Maurizio Patrignani. 2012. “Monotone Drawings of Graphs.” Journal of Graph Algorithms and Applications 16 (1): 5–35.

Angelini, Patrizio, Giuseppe Di Battista, and Fabrizio Frati. 2012. “Succinct Greedy Drawings Do Not Always Exist.” Networks 59 (3): 267–74. https://doi.org/10.1002/net.21449.

Angelini, Patrizio, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, and Ignaz Rutter. 2012. “Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected or a Connected Graph.” Journal of Discrete Algorithms 14: 150–72. https://doi.org/10.1016/j.jda.2011.12.015.

Angelini, Patrizio, and Fabrizio Frati. 2012. “Acyclically 3-Colorable Planar Graphs.” Journal of Combinatorial Optimization 24 (2): 116–30. https://doi.org/10.1007/s10878-011-9385-3.

Angelini, Patrizio, Markus Geyer, Michael Kaufmann, and Daniel Neuwirth. 2012. “On a Tree and a Path with No Geometric Simultaneous Embedding.” Journal of Graph Algorithms and Applications 16 (1): 37–83. https://doi.org/10.7155/jgaa.00250.