default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlessandra Tappini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Carla Binucci
, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Graphs Drawn With Some Vertices per Face: Density and Relationships. IEEE Access 12: 68828-68846 (2024)- [j16]Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini:
Recognizing Map Graphs of Bounded Treewidth. Algorithmica 86(2): 613-637 (2024) - [j15]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. J. Graph Algorithms Appl. 28(2): 1-35 (2024) - [j14]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Comparative Study and Evaluation of Hybrid Visualizations of Graphs. IEEE Trans. Vis. Comput. Graph. 30(7): 3503-3515 (2024) - [c24]Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, Markus Wallinger:
Bundling-Aware Graph Drawing. GD 2024: 15:1-15:19 - [c23]Riccardo Dondi, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
Partial Temporal Vertex Cover with Bounded Activity Intervals. SAND 2024: 11:1-11:14 - 2023
- [j13]Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini:
k-Planar Placement and Packing of Δ-Regular Caterpillars. Int. J. Found. Comput. Sci. 34(7): 875-902 (2023) - [j12]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Parameterized complexity of graph planarity with restricted cyclic orders. J. Comput. Syst. Sci. 135: 125-144 (2023) - [j11]Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini:
Small Point-Sets Supporting Graph Stories. J. Graph Algorithms Appl. 27(8): 651-677 (2023) - [j10]Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
On the parameterized complexity of s-club cluster deletion problems. Theor. Comput. Sci. 969: 114041 (2023) - [c22]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. GD (1) 2023: 39-52 - [c21]Carla Binucci, Henry Förster, Julia Katheder, Alessandra Tappini:
Evaluating Animation Parameters for Morphing Edge Drawings. GD (1) 2023: 246-262 - [c20]Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
On the Parameterized Complexity of s-club Cluster Deletion Problems. SOFSEM 2023: 159-173 - [c19]Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Nonplanar Graph Drawings with k Vertices per Face. WG 2023: 86-100 - [i21]Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini:
k-planar Placement and Packing of Δ-regular Caterpillars. CoRR abs/2301.01226 (2023) - [i20]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. CoRR abs/2308.13401 (2023) - [i19]Carla Binucci, Henry Förster, Julia Katheder, Alessandra Tappini:
Evaluating Animation Parameters for Morphing Edge Drawings. CoRR abs/2309.00456 (2023) - 2022
- [j9]Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, Alessandra Tappini:
Hybrid Graph Visualizations With ChordLink: Algorithms, Experiments, and Applications. IEEE Trans. Vis. Comput. Graph. 28(2): 1288-1300 (2022) - [c18]Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini:
Small Point-Sets Supporting Graph Stories. GD 2022: 289-303 - [c17]Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem. ICTCS 2022: 14-20 - [c16]Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini:
Recognizing Map Graphs of Bounded Treewidth. SWAT 2022: 8:1-8:18 - [c15]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders. WG 2022: 383-397 - [i18]Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
On the Parameterized Complexity of the s-Club Cluster Edge Deletion Problem. CoRR abs/2205.10834 (2022) - [i17]Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini:
Recognizing Map Graphs of Bounded Treewidth. CoRR abs/2206.14898 (2022) - [i16]Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini:
Small Point-Sets Supporting Graph Stories. CoRR abs/2208.14126 (2022) - 2021
- [j8]Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath:
Packing Trees into 1-planar Graphs. J. Graph Algorithms Appl. 25(2): 605-624 (2021) - [j7]Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Ortho-polygon visibility representations of 3-connected 1-plane graphs. Theor. Comput. Sci. 863: 40-52 (2021) - [j6]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Simultaneous FPQ-ordering and hybrid planarity testing. Theor. Comput. Sci. 874: 59-79 (2021) - [j5]Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini:
(k, p)-planarity: A relaxation of hybrid planarity. Theor. Comput. Sci. 896: 19-30 (2021) - [c14]Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Alessandra Tappini:
A User Study on Hybrid Graph Visualizations. GD 2021: 21-38 - [c13]Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta, Alessandra Tappini:
Quasi-upward Planar Drawings with Minimum Curve Complexity. GD 2021: 195-209 - [i15]Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Alessandra Tappini:
A User Study on Hybrid Graph Visualizations. CoRR abs/2108.10270 (2021) - [i14]Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta, Alessandra Tappini:
Quasi-upward Planar Drawings with Minimum Curve Complexity. CoRR abs/2108.10784 (2021) - 2020
- [j4]Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini:
Graph Planarity by Replacing Cliques with Paths. Algorithms 13(8): 194 (2020) - [c12]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Storyline Visualizations with Ubiquitous Actors. GD 2020: 324-332 - [c11]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Simultaneous FPQ-Ordering and Hybrid Planarity Testing. SOFSEM 2020: 617-626 - [c10]Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath:
Packing Trees into 1-Planar Graphs. WALCOM 2020: 81-93 - [i13]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Storyline Visualizations with Ubiquitous Actors. CoRR abs/2008.04125 (2020)
2010 – 2019
- 2019
- [j3]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Ignaz Rutter, Alessandra Tappini:
NodeTrix Planarity Testing with Small Clusters. Algorithmica 81(9): 3464-3493 (2019) - [j2]Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati, Stefan Langerman, Alessandra Tappini:
Pole Dancing: 3D Morphs for Tree Drawings. J. Graph Algorithms Appl. 23(3): 579-602 (2019) - [j1]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy rectilinear drawings. Theor. Comput. Sci. 795: 375-397 (2019) - [c9]Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, Alessandra Tappini:
ChordLink: A New Hybrid Visualization Model. GD 2019: 276-290 - [c8]Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini:
(k, p)-Planarity: A Relaxation of Hybrid Planarity. WALCOM 2019: 148-159 - [i12]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Graph Planarity Testing with Hierarchical Embedding Constraints. CoRR abs/1904.12596 (2019) - [i11]Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, Alessandra Tappini:
ChordLink: A New Hybrid Visualization Model. CoRR abs/1908.08412 (2019) - [i10]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Simultaneous FPQ-Ordering and Hybrid Planarity Testing. CoRR abs/1910.10113 (2019) - [i9]Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath:
Packing Trees into 1-planar Graphs. CoRR abs/1911.01761 (2019) - [i8]Michael A. Bekos, Carla Binucci, Michael Kaufmann, Chrysanthi N. Raftopoulou, Antonios Symvonis, Alessandra Tappini:
Coloring outerplanar graphs and planar 3-trees with small monochromatic components. CoRR abs/1911.10863 (2019) - 2018
- [c7]Stefano Bistarelli, Alessandra Tappini, Carlo Taticchi:
A Matrix Approach for Weighted Argumentation Frameworks. FLAIRS 2018: 507-512 - [c6]Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini:
Turning Cliques into Paths to Achieve Planarity. GD 2018: 67-74 - [c5]Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati, Stefan Langerman, Alessandra Tappini:
Pole Dancing: 3D Morphs for Tree Drawings. GD 2018: 371-384 - [c4]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy Rectilinear Drawings. GD 2018: 495-508 - [c3]Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Ortho-Polygon Visibility Representations of 3-Connected 1-Plane Graphs. GD 2018: 524-537 - [i7]Stefano Bistarelli, Alessandra Tappini, Carlo Taticchi:
A Matrix Approach for Weighted Argumentation Frameworks: a Preliminary Report. CoRR abs/1802.08445 (2018) - [i6]Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini:
(k, p)-Planarity: A Generalization of Hybrid Planarity. CoRR abs/1806.11413 (2018) - [i5]Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs. CoRR abs/1807.01247 (2018) - [i4]Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini:
Turning Cliques into Paths to Achieve Planarity. CoRR abs/1808.08925 (2018) - [i3]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy Rectilinear Drawings. CoRR abs/1808.09063 (2018) - [i2]Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati, Stefan Langerman, Alessandra Tappini:
Pole Dancing: 3D Morphs for Tree Drawings. CoRR abs/1808.10738 (2018) - 2017
- [c2]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Alessandra Tappini:
NodeTrix Planarity Testing with Small Clusters. GD 2017: 479-491 - [i1]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Alessandra Tappini:
NodeTrix Planarity Testing with Small Clusters. CoRR abs/1708.09281 (2017) - 2016
- [c1]Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Partial edge drawing: Homogeneity is more important than crossings and ink. IISA 2016: 1-6
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
