default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabrizio Frati
Person information
- affiliation: Roma Tre University, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j70]Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths. Eur. J. Comb. 119: 103806 (2024)- [j69]Carlos Alegría, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso
, Maurizio Patrignani:
Unit-length Rectangular Drawings of Graphs. J. Graph Algorithms Appl. 28(1): 403-437 (2024) - [j68]Fabrizio Frati:
Upward planarity testing of biconnected outerplanar DAGs solves partition. Theor. Comput. Sci. 998: 114541 (2024) - [c89]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis:
Weakly Leveled Planarity with Bounded Span. GD 2024: 19:1-19:19 - [c88]Carlos Alegría, Susanna Caroppo, Giordano Da Lozzo, Marco D'Elia, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Upward Pointset Embeddings of Planar st-Graphs. GD 2024: 24:1-24:18 - [c87]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. WALCOM 2024: 350-364 - [i50]Carlos Alegría, Susanna Caroppo, Giordano Da Lozzo, Marco D'Elia, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Upward Pointset Embeddings of Planar st-Graphs. CoRR abs/2408.17369 (2024) - [i49]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis:
Weakly Leveled Planarity with Bounded Span. CoRR abs/2409.01889 (2024) - [i48]Marco D'Elia, Fabrizio Frati:
Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs. CoRR abs/2412.14784 (2024) - 2023
- [j67]Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. Comput. Geom. Topol. 2(1): 5:1-5:18 (2023) - [j66]Fabrizio Frati, Michael Hoffmann, Csaba D. Tóth:
Universal geometric graphs. Comb. Probab. Comput. 32(5): 742-761 (2023) - [j65]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou:
Recognizing DAGs with page-number 2 is NP-complete. Theor. Comput. Sci. 946: 113689 (2023) - [c86]Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. SOFSEM 2023: 80-95 - [i47]Fabrizio Frati:
Upward Planarity Testing of Biconnected Outerplanar DAGs Solves Partition. CoRR abs/2307.13799 (2023) - [i46]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. CoRR abs/2310.02247 (2023) - 2022
- [j64]Fabrizio Frati:
Planar rectilinear drawings of outerplanar graphs in linear time. Comput. Geom. 103: 101854 (2022) - [j63]Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
How to Morph a Tree on a Small Grid. Discret. Comput. Geom. 67(3): 743-786 (2022) - [j62]Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber:
Drawing Graphs as Spanners. Discret. Comput. Geom. 68(3): 774-795 (2022) - [c85]Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov:
Parameterized Algorithms for Upward Planarity. SoCG 2022: 26:1-26:16 - [c84]Carlos Alegría, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Unit-length Rectangular Drawings of Graphs. GD 2022: 127-143 - [c83]Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov:
Testing Upward Planarity of Partial 2-Trees. GD 2022: 175-187 - [c82]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou:
Recognizing DAGs with Page-Number 2 Is NP-complete. GD 2022: 361-370 - [i45]Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov:
Parameterized Algorithms for Upward Planarity. CoRR abs/2203.05364 (2022) - [i44]Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov:
Testing Upward Planarity of Partial 2-Trees. CoRR abs/2208.12548 (2022) - [i43]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou:
Recognizing DAGs with Page-Number 2 is NP-complete. CoRR abs/2208.13615 (2022) - [i42]Carlos Alegría, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Unit-length Rectangular Drawings of Graphs. CoRR abs/2208.14142 (2022) - [i41]Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. CoRR abs/2210.05384 (2022) - 2021
- [j61]Vida Dujmovic, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote:
Every Collinear Set in a Planar Graph is Free. Discret. Comput. Geom. 65(4): 999-1027 (2021) - [j60]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais:
Schematic Representation of Large Biconnected Graphs. J. Graph Algorithms Appl. 25(1): 311-352 (2021) - [j59]Barbara Covella, Fabrizio Frati, Maurizio Patrignani:
On the area requirements of planar straight-line orthogonal drawings of ternary trees. Theor. Comput. Sci. 852: 197-211 (2021) - [c81]Giuseppe Di Battista, Fabrizio Frati:
From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-Line Drawings and Morphs. GD 2021: 109-122 - [c80]Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths. GD 2021: 166-183 - [c79]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees. SODA 2021: 2779-2798 - [i40]Giuseppe Di Battista, Fabrizio Frati:
From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs. CoRR abs/2108.09483 (2021) - [i39]Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Planar Straight-line Realizations of 2-Trees with Prescribed Edge Lengths. CoRR abs/2108.12628 (2021) - 2020
- [j58]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Upward Planar Morphs. Algorithmica 82(10): 2985-3017 (2020) - [j57]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Extending upward planar graph drawings. Comput. Geom. 91: 101668 (2020) - [j56]Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati:
On Planar Greedy Drawings of 3-Connected Planar Graphs. Discret. Comput. Geom. 63(1): 114-157 (2020) - [j55]Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs. J. Comput. Syst. Sci. 107: 28-53 (2020) - [j54]Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Graph Stories in Small Area. J. Graph Algorithms Appl. 24(3): 269-292 (2020) - [j53]Manuel Borrazzo, Fabrizio Frati:
On the planar edge-length ratio of planar graphs. J. Comput. Geom. 11(1): 137-155 (2020) - [j52]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Beyond level planarity: Cyclic, torus, and simultaneous level planarity. Theor. Comput. Sci. 804: 161-170 (2020) - [c78]Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati:
On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs. COCOON 2020: 435-447 - [c77]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais:
Schematic Representation of Biconnected Graphs. GD 2020: 160-172 - [c76]Fabrizio Frati:
Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time. GD 2020: 423-435 - [c75]Fabrizio Frati, Michael Hoffmann, Csaba D. Tóth:
Universal Geometric Graphs. WG 2020: 174-186 - [c74]Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber:
Drawing Graphs as Spanners. WG 2020: 310-324 - [i38]Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber:
Drawing Graphs as Spanners. CoRR abs/2002.05580 (2020) - [i37]Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati:
On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs. CoRR abs/2003.00556 (2020) - [i36]Fabrizio Frati:
Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time. CoRR abs/2006.06951 (2020) - [i35]Fabrizio Frati, Michael Hoffmann, Csaba D. Tóth:
Universal Geometric Graphs. CoRR abs/2006.11262 (2020) - [i34]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais:
Schematic Representation of Large Biconnected Graphs. CoRR abs/2008.09414 (2020) - [i33]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees. CoRR abs/2011.02431 (2020)
2010 – 2019
- 2019
- [j51]Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein:
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. Int. J. Found. Comput. Sci. 30(2): 197-230 (2019) - [j50]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) - [j49]Fabrizio Frati, Michael Hoffmann, Vincent Kusters:
Simultaneous Embeddings with Few Bends and Crossings. J. Graph Algorithms Appl. 23(4): 683-713 (2019) - [c73]Manuel Borrazzo, Fabrizio Frati:
On the Edge-Length Ratio of Planar Graphs. GD 2019: 165-178 - [c72]Manuel Borrazzo, Giordano Da Lozzo, Fabrizio Frati, Maurizio Patrignani:
Graph Stories in Small Area. GD 2019: 545-558 - [c71]Vida Dujmovic, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote:
Every Collinear Set in a Planar Graph Is Free. SODA 2019: 1521-1538 - [c70]Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
How to Morph a Tree on a Small Grid. WADS 2019: 57-70 - [c69]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Extending Upward Planar Graph Drawings. WADS 2019: 339-352 - [i32]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Extending Upward Planar Graph Drawings. CoRR abs/1902.06575 (2019) - [i31]Barbara Covella, Fabrizio Frati, Maurizio Patrignani:
On the Area Requirements of Planar Straight-Line Orthogonal Drawings of Ternary Trees. CoRR abs/1902.11044 (2019) - [i30]Manuel Borrazzo, Fabrizio Frati:
On the Edge-Length Ratio of Planar Graphs. CoRR abs/1908.03586 (2019) - [i29]Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Graph Stories in Small Area. CoRR abs/1908.09318 (2019) - [i28]Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
How to Morph a Tree on a Small Grid. CoRR abs/1909.07093 (2019) - 2018
- [j48]Vida Dujmovic, Fabrizio Frati:
Stack and Queue Layouts via Layered Separators. J. Graph Algorithms Appl. 22(1): 89-99 (2018) - [j47]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Computing NodeTrix Representations of Clustered Graphs. J. Graph Algorithms Appl. 22(2): 139-176 (2018) - [j46]Fabrizio Frati, Kwan-Liu Ma:
Guest editors' foreword. J. Graph Algorithms Appl. 22(3): 397-399 (2018) - [j45]Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli:
Drawing planar graphs with many collinear vertices. J. Comput. Geom. 9(1): 94-130 (2018) - [c68]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Upward Planar Morphs. GD 2018: 92-105 - [c67]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 - [c66]Barbara Covella, Fabrizio Frati, Maurizio Patrignani:
On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees. IWOCA 2018: 128-140 - [e1]Fabrizio Frati, Kwan-Liu Ma:
Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10692, Springer 2018, ISBN 978-3-319-73914-4 [contents] - [i27]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) - [i26]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Upward Planar Morphs. CoRR abs/1808.10826 (2018) - 2017
- [j44]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Strip Planarity Testing for Embedded Planar Graphs. Algorithmica 77(4): 1022-1059 (2017) - [j43]Fabrizio Frati:
A Lower Bound on the Diameter of the Flip Graph. Electron. J. Comb. 24(1): 1 (2017) - [j42]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. J. Graph Algorithms Appl. 21(4): 731-755 (2017) - [j41]Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
How to Morph Planar Graph Drawings. SIAM J. Comput. 46(2): 824-852 (2017) - [c65]Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati:
On Planar Greedy Drawings of 3-Connected Planar Graphs. SoCG 2017: 33:1-33:16 - [c64]Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs. SODA 2017: 1980-1999 - [i25]Fabrizio Frati, Kwan-Liu Ma:
Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017). CoRR abs/1709.04228 (2017) - 2016
- [j40]Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson:
SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs. J. Graph Theory 82(1): 45-64 (2016) - [c63]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Computing NodeTrix Representations of Clustered Graphs. GD 2016: 107-120 - [c62]Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli:
Drawing Planar Graphs with Many Collinear Vertices. GD 2016: 152-165 - [c61]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Beyond Level Planarity. GD 2016: 482-495 - [c60]Vida Dujmovic, Fabrizio Frati:
Stack and Queue Layouts via Layered Separators. GD 2016: 511-518 - [r1]Fabrizio Frati:
Clustered Graph Drawing. Encyclopedia of Algorithms 2016: 326-331 - [i24]Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
How to morph planar graph drawings. CoRR abs/1606.00425 (2016) - [i23]Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli:
Drawing Planar Graphs with Many Collinear Vertices. CoRR abs/1606.03890 (2016) - [i22]Vida Dujmovic, Fabrizio Frati:
Stack and Queue Layouts via Layered Separators. CoRR abs/1608.06458 (2016) - [i21]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Computing NodeTrix Representations of Clustered Graphs. CoRR abs/1608.08952 (2016) - [i20]Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs. CoRR abs/1610.02841 (2016) - [i19]Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati:
On Planar Greedy Drawings of 3-Connected Planar Graphs. CoRR abs/1612.09277 (2016) - 2015
- [j39]Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson:
Augmenting Graphs to Minimize the Diameter. Algorithmica 72(4): 995-1010 (2015) - [j38]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Relaxing the constraints of clustered planarity. Comput. Geom. 48(2): 42-75 (2015) - [j37]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin:
Compatible Connectivity Augmentation of Planar Disconnected Graphs. Discret. Comput. Geom. 54(2): 459-480 (2015) - [j36]Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. J. Graph Algorithms Appl. 19(2): 681-706 (2015) - [j35]Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson:
Increasing-Chord Graphs On Point Sets. J. Graph Algorithms Appl. 19(2): 761-778 (2015) - [j34]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter:
Testing Planarity of Partially Embedded Graphs. ACM Trans. Algorithms 11(4): 32:1-32:42 (2015) - [j33]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli:
The importance of being proper: (In clustered-level planarity and T-level planarity). Theor. Comput. Sci. 571: 1-9 (2015) - [c59]Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli:
Optimal Morphs of Convex Drawings. SoCG 2015: 126-140 - [c58]Fabrizio Frati, Michael Hoffmann, Vincent Kusters:
Simultaneous Embeddings with Few Bends and Crossings. GD 2015: 166-179 - [c57]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. GD 2015: 217-230 - [c56]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
On the Relationship Between Map Graphs and Clique Planar Graphs. GD 2015: 548-550 - [c55]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin:
Compatible Connectivity-Augmentation of Planar Disconnected Graphs. SODA 2015: 1602-1615 - [i18]Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli:
Optimal Morphs of Convex Drawings. CoRR abs/1503.09021 (2015) - [i17]Fabrizio Frati:
A Lower Bound on the Diameter of the Flip Graph. CoRR abs/1508.03473 (2015) - [i16]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. CoRR abs/1508.07557 (2015) - [i15]Fabrizio Frati, Michael Hoffmann, Vincent Kusters:
Simultaneous Embeddings with Few Bends and Crossings. CoRR abs/1508.07921 (2015) - [i14]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Testing Cyclic Level and Simultaneous Level Planarity. CoRR abs/1510.08274 (2015) - 2014
- [j32]Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella:
On the area requirements of Euclidean minimum spanning trees. Comput. Geom. 47(2): 200-213 (2014) - [j31]Fabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, David R. Wood:
On the Upward Planarity of Mixed Plane Graphs. J. Graph Algorithms Appl. 18(2): 253-279 (2014) - [j30]Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
Universal Point Sets for Drawing Planar Graphs with Circular Arcs. J. Graph Algorithms Appl. 18(3): 313-324 (2014) - [j29]Fabrizio Frati:
Multilayer Drawings of Clustered Graphs. J. Graph Algorithms Appl. 18(5): 633-675 (2014) - [j28]Fabrizio Frati, Joachim Gudmundsson, Emo Welzl:
On the number of upward planar orientations of maximal planar graphs. Theor. Comput. Sci. 544: 32-59 (2014) - [c54]Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. GD 2014: 25-39 - [c53]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli:
The Importance of Being Proper - (In Clustered-Level Planarity and T-Level Planarity). GD 2014: 246-258 - [c52]Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein:
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. GD 2014: 416-427 - [c51]Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson:
Increasing-Chord Graphs On Point Sets. GD 2014: 464-475 - [c50]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Optimally. ICALP (1) 2014: 126-137 - [i13]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Optimally. CoRR abs/1402.4364 (2014) - [i12]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli:
On the Complexity of Clustered-Level Planarity and T-Level Planarity. CoRR abs/1406.6533 (2014) - [i11]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin:
Compatible Connectivity-Augmentation of Planar Disconnected Graphs. CoRR abs/1408.2436 (2014) - [i10]Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson:
Increasing-Chord Graphs On Point Sets. CoRR abs/1408.2592 (2014) - [i9]Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein:
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. CoRR abs/1408.2595 (2014) - [i8]Giuseppe Di Battista, Fabrizio Frati:
A Survey on Small-Area Planar Graph Drawing. CoRR abs/1410.1006 (2014) - [i7]Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. CoRR abs/1410.8205 (2014) - 2013
- [j27]Vida Dujmovic, Gwenaël Joret, Fabrizio Frati, David R. Wood:
Nonrepetitive Colourings of Planar Graphs with O(log n) Colours. Electron. J. Comb. 20(1): 51 (2013) - [j26]Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug:
Orthogeodesic point-set embedding of trees. Comput. Geom. 46(8): 929-944 (2013) - [j25]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati:
Simultaneous Embedding of Embedded Planar graphs. Int. J. Comput. Geom. Appl. 23(2): 93-126 (2013) - [j24]Fabrizio Frati, Radoslav Fulek, Andres J. Ruiz-Vargas:
On the Page Number of Upward Planar Directed Acyclic Graphs. J. Graph Algorithms Appl. 17(3): 221-244 (2013) - [j23]Giuseppe Di Battista, Fabrizio Frati, János Pach:
On the Queue Number of Planar Graphs. SIAM J. Comput. 42(6): 2243-2285 (2013) - [c49]Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
Universal Point Sets for Planar Graph Drawings with Circular Arcs. CCCG 2013 - [c48]Fabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, David R. Wood:
On the Upward Planarity of Mixed Plane Graphs. GD 2013: 1-12 - [c47]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Strip Planarity Testing. GD 2013: 37-48 - [c46]Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Efficiently. GD 2013: 49-60 - [c45]Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson:
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. ISAAC 2013: 185-195 - [c44]Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson:
Augmenting Graphs to Minimize the Diameter. ISAAC 2013: 383-393 - [c43]Soroush Alamdari, Patrizio Angelini, Timothy M. Chan, Giuseppe Di Battista, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
Morphing Planar Graph Drawings with a Polynomial Number of Steps. SODA 2013: 1656-1667 - [i6]Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graphs Drawings Efficiently. CoRR abs/1308.4291 (2013) - [i5]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Strip Planarity Testing of Embedded Planar Graphs. CoRR abs/1309.0683 (2013) - [i4]Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson:
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. CoRR abs/1309.4713 (2013) - [i3]Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson:
Augmenting graphs to minimize the diameter. CoRR abs/1309.5172 (2013) - 2012
- [j22]Fabrizio Frati:
Straight-line drawings of outerplanar graphs in O(dn log n) area. Comput. Geom. 45(9): 524-533 (2012) - [j21]Patrizio Angelini, Fabrizio Frati:
Acyclically 3-colorable planar graphs. J. Comb. Optim. 24(2): 116-130 (2012) - [j20]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. J. Discrete Algorithms 14: 150-172 (2012) - [j19]Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Monotone Drawings of Graphs. J. Graph Algorithms Appl. 16(1): 5-35 (2012) - [j18]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati:
Succinct greedy drawings do not always exist. Networks 59(3): 267-274 (2012) - [j17]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Nonconvex Representations of Plane Graphs. SIAM J. Discret. Math. 26(4): 1670-1681 (2012) - [c42]Fabrizio Frati:
Multilevel Drawings of Clustered Graphs. COCOON 2012: 311-322 - [c41]David Bremner, William S. Evans, Fabrizio Frati, Laurie J. Heyer, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, David Rappaport, Sue Whitesides:
On Representing Graphs by Touching Cuboids. GD 2012: 187-198 - [c40]Fabrizio Frati, Marc Glisse, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Rahnuma Islam Nishat:
Point-Set Embeddability of 2-Colored Trees. GD 2012: 291-302 - [c39]Tim Dwyer, Fabrizio Frati, Seok-Hee Hong, Karsten Klein:
Theory and Practice of Graph Drawing. GD 2012: 571-574 - [c38]Fabrizio Frati, Joachim Gudmundsson, Emo Welzl:
On the Number of Upward Planar Orientations of Maximal Planar Graphs. ISAAC 2012: 413-422 - [i2]Vida Dujmovic, Fabrizio Frati, Gwenaël Joret, David R. Wood:
Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours. CoRR abs/1202.1569 (2012) - [i1]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli:
Beyond Clustered Planarity. CoRR abs/1207.3934 (2012) - 2011
- [j16]Ulrik Brandes, Cesim Erten, Alejandro Estrella-Balderrama, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis:
Colored Simultaneous Geometric Embeddings and Universal Pointsets. Algorithmica 60(3): 569-592 (2011) - [j15]Fabrizio Frati, Michael Kaufmann:
Polynomial area bounds for MST embeddings of trees. Comput. Geom. 44(9): 529-543 (2011) - [j14]Patrizio Angelini, Fabrizio Frati, Michael Kaufmann:
Straight-Line Rectangular Drawings of Clustered Graphs. Discret. Comput. Geom. 45(1): 88-140 (2011) - [j13]Patrizio Angelini, Luca Cittadini, Walter Didimo, Fabrizio Frati, Giuseppe Di Battista, Michael Kaufmann, Antonios Symvonis:
On the Perspectives Opened by Right Angle Crossing Drawings. J. Graph Algorithms Appl. 15(1): 53-78 (2011) - [c37]Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug:
Orthogeodesic Point-Set Embedding of Trees. GD 2011: 52-63 - [c36]Fabrizio Frati, Radoslav Fulek, Andres J. Ruiz-Vargas:
On the Page Number of Upward Planar Directed Acyclic Graphs. GD 2011: 391-402 - [c35]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati:
Simultaneous Embedding of Embedded Planar Graphs. ISAAC 2011: 271-280 - [c34]Patrizio Angelini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Anna Lubiw:
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area. EGC 2011: 200-209 - [c33]Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella:
On the Area Requirements of Euclidean Minimum Spanning Trees. WADS 2011: 25-36 - 2010
- [j12]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov, Giuseppe Liotta:
Upward straight-line embeddings of directed graphs into point sets. Comput. Geom. 43(2): 219-232 (2010) - [j11]Fabrizio Frati:
Lower Bounds on the Area Requirements of Series-Parallel Graphs. Discret. Math. Theor. Comput. Sci. 12(5): 139-174 (2010) - [j10]Fabrizio Frati:
A note on isosceles planar graph drawing. Inf. Process. Lett. 110(12-13): 507-509 (2010) - [j9]Patrizio Angelini, Fabrizio Frati, Luca Grilli:
An Algorithm to Construct Greedy Drawings of Triangulations. J. Graph Algorithms Appl. 14(1): 19-51 (2010) - [c32]Giuseppe Di Battista, Fabrizio Frati, János Pach:
On the Queue Number of Planar Graphs. FOCS 2010: 365-374 - [c31]Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Monotone Drawings of Graphs. GD 2010: 13-24 - [c30]Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis:
Upward Geometric Graph Embeddings into Point Sets. GD 2010: 25-37 - [c29]Fabrizio Frati:
Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs. GD 2010: 220-225 - [c28]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree. IWOCA 2010: 212-225 - [c27]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter:
Testing Planarity of Partially Embedded Graphs. SODA 2010: 202-221 - [c26]Jacob Fox, Fabrizio Frati, János Pach, Rom Pinchasi:
Crossings between Curves with Many Tangencies. WALCOM 2010: 1-8 - [c25]Patrizio Angelini, Fabrizio Frati:
Acyclically 3-Colorable Planar Graphs. WALCOM 2010: 113-124
2000 – 2009
- 2009
- [j8]Giuseppe Di Battista, Fabrizio Frati:
Small Area Drawings of Outerplanar Graphs. Algorithmica 54(1): 25-53 (2009) - [j7]Fabrizio Frati, Markus Geyer, Michael Kaufmann:
Planar packing of trees and spider trees. Inf. Process. Lett. 109(6): 301-307 (2009) - [j6]Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati:
How to draw a clustered tree. J. Discrete Algorithms 7(4): 479-499 (2009) - [j5]Giuseppe Di Battista, Fabrizio Frati:
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. J. Graph Algorithms Appl. 13(3): 349-378 (2009) - [j4]Fabrizio Frati, Michael Kaufmann, Stephen G. Kobourov:
Constrained Simultaneous and Near-Simultaneous Embeddings. J. Graph Algorithms Appl. 13(3): 447-465 (2009) - [j3]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. Theory Comput. Syst. 44(2): 143-159 (2009) - [c24]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov, Giuseppe Liotta:
On Directed Graphs with an Upward Straight-line. CCCG 2009: 21-24 - [c23]Fabrizio Frati:
Planar Packing of Diameter-Four Trees. CCCG 2009: 95-98 - [c22]Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann, Antonios Symvonis:
On the Perspectives Opened by Right Angle Crossing Drawings. GD 2009: 21-32 - [c21]Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani:
Splitting Clusters to Get C-Planarity. GD 2009: 57-68 - [c20]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati:
Succinct Greedy Drawings Do Not Always Exist. GD 2009: 171-182 - [c19]Patrizio Angelini, Fabrizio Frati, Michael Kaufmann:
Straight-Line Rectangular Drawings of Clustered Graphs. WADS 2009: 25-36 - 2008
- [j2]Fabrizio Frati:
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. Int. J. Comput. Geom. Appl. 18(3): 251-271 (2008) - [j1]Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Maurizio Pizzonia:
C-Planarity of C-Connected Clustered Graphs. J. Graph Algorithms Appl. 12(2): 225-262 (2008) - [c18]Patrizio Angelini, Fabrizio Frati, Luca Grilli:
An Algorithm to Construct Greedy Drawings of Triangulations. GD 2008: 26-37 - [c17]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Non-convex Representations of Graphs. GD 2008: 390-395 - [c16]Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov:
Upward Straight-Line Embeddings of Directed Graphs into Point Sets. WG 2008: 122-133 - [c15]Fabrizio Frati:
A Lower Bound on the Area Requirements of Series-Parallel Graphs. WG 2008: 159-170 - 2007
- [c14]Fabrizio Frati:
Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area. CCCG 2007: 225-228 - [c13]Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis:
Colored Simultaneous Geometric Embeddings. COCOON 2007: 254-263 - [c12]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. FUN 2007: 1-13 - [c11]Fabrizio Frati:
Straight-Line Orthogonal Drawings of Binary and Ternary Trees. GD 2007: 76-87 - [c10]Fabrizio Frati, Michael Kaufmann, Stephen G. Kobourov:
Constrained Simultaneous and Near-Simultaneous Embeddings. GD 2007: 268-279 - [c9]Giuseppe Di Battista, Fabrizio Frati:
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. GD 2007: 291-302 - [c8]Fabrizio Frati, Maurizio Patrignani:
A Note on Minimum-Area Straight-Line Drawings of Planar Graphs. GD 2007: 339-344 - [c7]Fabrizio Frati, Markus Geyer, Michael Kaufmann:
Packing and Squeezing Subgraphs into Planar Graphs. MFCS 2007: 394-405 - [c6]Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati:
How to Draw a Clustered Tree. WADS 2007: 89-101 - [c5]Fabrizio Frati:
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. WG 2007: 133-144 - 2006
- [c4]Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta:
On the Topologies of Local Minimum Spanning Trees. CAAN 2006: 31-44 - [c3]Fabrizio Frati, Giuseppe Di Battista:
Three-Dimensional Drawings of Bounded Degree Trees. GD 2006: 89-94 - [c2]Fabrizio Frati:
Embedding Graphs Simultaneously with Fixed Edges. GD 2006: 108-113 - 2005
- [c1]Giuseppe Di Battista, Fabrizio Frati:
Small Area Drawings of Outerplanar Graphs. GD 2005: 89-100
Coauthor Index
[c79] [j52] [i33] [j44] [j42] [j41] [j40] [c61] [i24] [j38] [j34] [j33] [c59] [c57] [c56] [i18] [i16] [i14] [j32] [j30] [c53] [c50] [i13] [i12] [j25] [c49] [c47] [c46] [c45] [c43] [i6] [i5] [i4] [j21] [j20] [j19] [j18] [i1] [j14] [j13] [c35] [c34] [c33] [j9] [c31] [c30] [c28] [c27] [c25] [c22] [c21] [c20] [c19] [c18]
[j70] [j69] [c88] [c87] [i50] [i46] [j63] [c84] [i42] [j60] [c81] [c80] [c79] [i40] [i39] [j58] [j57] [j54] [j52] [c77] [i34] [i33] [j51] [c70] [c69] [i32] [i29] [i28] [j47] [c68] [i26] [j44] [j42] [j41] [c63] [c61] [i24] [i21] [j38] [j34] [j33] [c57] [c56] [i16] [i14] [c53] [c52] [c50] [i13] [i12] [i9] [i8] [j25] [j23] [c47] [c43] [i5] [j20] [j19] [j18] [j17] [i1] [j13] [c35] [c34] [c32] [c31] [c28] [c27] [j8] [j6] [j5] [j3] [c22] [c20] [j1] [c17] [c12] [c9] [c6] [c4] [c3] [c1]
[j70] [j69] [c89] [c88] [c87] [i50] [i49] [j65] [i46] [j63] [c84] [c82] [i43] [i42] [c80] [c79] [i39] [j58] [j57] [j56] [j54] [j52] [c78] [i37] [i33] [c72] [c70] [c69] [i32] [i29] [i28] [j47] [j45] [c68] [i26] [j44] [j42] [j41] [c65] [c63] [c62] [c61] [i24] [i23] [i21] [i19] [j38] [j33] [c59] [c57] [c56] [i18] [i16] [i14] [c53] [c50] [i13] [i12] [c47] [i5] [i1]
[j70] [j69] [c88] [c87] [i50] [i46] [j63] [c84] [i42] [j60] [j59] [c80] [c79] [i39] [j58] [j55] [j54] [j52] [c77] [i34] [i33] [c72] [c70] [i31] [i29] [i28] [j47] [c68] [c66] [i26] [j42] [j41] [c64] [c63] [c61] [i24] [i21] [i20] [j38] [j34] [c59] [c57] [c56] [i18] [i16] [i14] [c50] [i13] [c46] [c43] [i6] [j20] [j19] [j17] [c31] [c28] [c27] [j3] [c21] [j1] [c17] [c12] [c8] [c4]
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 2025-03-04 21:19 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:
