default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaurizio Patrignani
Person information
- affiliation: Roma Tre University, Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j53]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)- [j52]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) - [c91]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. GD 2024: 13:1-13:20 - [c90]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 - [c89]Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Münch, Maurizio Patrignani, Ignaz Rutter:
Simple Realizability of Abstract Topological Graphs. ISAAC 2024: 23:1-23:15 - [c88]Giuseppe Di Battista, Fabrizio Grosso, Silvia Montorselli, Maurizio Patrignani:
Treebar Maps: Schematic Representation of Networks at Scale. PacificVis 2024: 132-141 - [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 - [i39]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) - [i38]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. CoRR abs/2409.01475 (2024) - [i37]Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Münch, Maurizio Patrignani, Ignaz Rutter:
Simple Realizability of Abstract Topological Graphs. CoRR abs/2409.20108 (2024) - 2023
- [j51]Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo
, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddability of st-Graphs: Complexity and Algorithms. Algorithmica 85(12): 3521-3571 (2023) - [j50]Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. Comput. Geom. Topol. 2(1): 7:1-7:15 (2023) - [j49]Carla Binucci, Walter Didimo, Maurizio Patrignani:
st-Orientations with Few Transitive Edges. J. Graph Algorithms Appl. 27(8): 625-650 (2023) - [j48]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) - [c86]Marco D'Elia, Irene Finocchi, Maurizio Patrignani:
Clique-TF-IDF: A New Partitioning Framework Based on Dense Substructures. AI*IA 2023: 396-410 - [c85]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
Rectilinear-Upward Planarity Testing of Digraphs. ISAAC 2023: 26:1-26:20 - [c84]Tommaso Caiazzi, Mariano Scazzariello, Samuele Quinzi, Lorenzo Ariemma, Maurizio Patrignani, Giuseppe Di Battista:
Nesting Containers for Faithful Datacenters Emulations. NOMS 2023: 1-4 - [i36]Giuseppe Di Battista, Fabrizio Grosso, Silvia Montorselli, Maurizio Patrignani:
Treebar Maps: Schematic Representation of Networks at Scale. CoRR abs/2307.12393 (2023) - [i35]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
- [j47]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) - [j46]Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. J. Graph Algorithms Appl. 26(3): 285-306 (2022) - [c83]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 - [c82]Carla Binucci, Walter Didimo, Maurizio Patrignani:
st-Orientations with Few Transitive Edges. GD 2022: 201-216 - [c81]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 - [i34]Carla Binucci, Walter Didimo, Maurizio Patrignani:
st-Orientations with Few Transitive Edges. CoRR abs/2208.11414 (2022) - [i33]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) - [i32]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) - 2021
- [j45]Mariano Scazzariello, Lorenzo Ariemma, Giuseppe Di Battista, Maurizio Patrignani:
Megalos: A Scalable Architecture for the Virtualization of Large Network Scenarios. Future Internet 13(9): 227 (2021) - [j44]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais:
Schematic Representation of Large Biconnected Graphs. J. Graph Algorithms Appl. 25(1): 311-352 (2021) - [j43]Alessio Conte, Donatella Firmani, Maurizio Patrignani, Riccardo Torlone:
A meta-algorithm for finding large k-plexes. Knowl. Inf. Syst. 63(7): 1745-1769 (2021) - [j42]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) - [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 - [i31]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
- [j41]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Upward Planar Morphs. Algorithmica 82(10): 2985-3017 (2020) - [j40]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) - [j39]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) - [j38]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) - [j37]Tiziana Calamoneri, Valentino Di Donato, Diego Mariottini, Maurizio Patrignani:
Visualizing co-phylogenetic reconciliations. Theor. Comput. Sci. 815: 228-245 (2020) - [c78]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais:
Schematic Representation of Biconnected Graphs. GD 2020: 160-172 - [c77]Emanuele Balloni, Giuseppe Di Battista, Maurizio Patrignani:
A Tipping Point for the Planarity of Small and Medium Sized Graphs. GD 2020: 181-188 - [c76]Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. GD 2020: 250-264 - [c75]Mariano Scazzariello, Lorenzo Ariemma, Giuseppe Di Battista, Maurizio Patrignani:
Megalos: A Scalable Architecture for the Virtualization of Network Scenarios. NOMS 2020: 1-7 - [c74]Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. SODA 2020: 806-825 - [i30]Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. CoRR abs/2008.09002 (2020) - [i29]Emanuele Balloni, Giuseppe Di Battista, Maurizio Patrignani:
A Tipping Point for the Planarity of Small and Medium Sized Graphs. CoRR abs/2008.09405 (2020) - [i28]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais:
Schematic Representation of Large Biconnected Graphs. CoRR abs/2008.09414 (2020) - [i27]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
- [j36]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Ignaz Rutter, Alessandra Tappini:
NodeTrix Planarity Testing with Small Clusters. Algorithmica 81(9): 3464-3493 (2019) - [j35]Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
HV-planarity: Algorithms and complexity. J. Comput. Syst. Sci. 99: 72-90 (2019) - [c73]Alessio Conte, Donatella Firmani, Maurizio Patrignani, Riccardo Torlone:
Shared-Nothing Distributed Enumeration of 2-Plexes. CIKM 2019: 2469-2472 - [c72]Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddings of st-Graphs. SoCG 2019: 13:1-13:22 - [c71]Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani:
The QuaSEFE Problem. GD 2019: 268-275 - [c70]Manuel Borrazzo, Giordano Da Lozzo, Fabrizio Frati, Maurizio Patrignani:
Graph Stories in Small Area. GD 2019: 545-558 - [c69]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 - [i26]Barbara Covella, Fabrizio Frati, Maurizio Patrignani:
On the Area Requirements of Planar Straight-Line Orthogonal Drawings of Ternary Trees. CoRR abs/1902.11044 (2019) - [i25]Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddings of st-Graphs. CoRR abs/1903.07966 (2019) - [i24]Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani:
The QuaSEFE Problem. CoRR abs/1908.08708 (2019) - [i23]Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Graph Stories in Small Area. CoRR abs/1908.09318 (2019) - [i22]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) - [i21]Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. CoRR abs/1910.11782 (2019) - 2018
- [j34]Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis:
Algorithms and Bounds for L-Drawings of Directed Graphs. Int. J. Found. Comput. Sci. 29(4): 461-480 (2018) - [j33]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) - [c68]Pier Francesco Cortese, Maurizio Patrignani:
Clustered Planarity = Flat Clustered Planarity. GD 2018: 23-38 - [c67]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Upward Planar Morphs. GD 2018: 92-105 - [c66]Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
Bend-Minimum Orthogonal Drawings in Quadratic Time. GD 2018: 481-494 - [c65]Valentino Di Donato, Maurizio Patrignani, Claudio Squarcella:
Exploring Flow Metrics in Dense Geographical Networks. VISIGRAPP (3: IVAPP) 2018: 52-61 - [c64]Barbara Covella, Fabrizio Frati, Maurizio Patrignani:
On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees. IWOCA 2018: 128-140 - [c63]Alessio Conte, Donatella Firmani, Caterina Mordente, Maurizio Patrignani, Riccardo Torlone:
Cliques are Too Strict for Representing Communities: Finding Large k-plexes in Real Networks. SEBD 2018 - [i20]Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
Efficient Algorithms for Bend-minimum Orthogonal Drawings of Planar 3-Graphs. CoRR abs/1804.05813 (2018) - [i19]Pier Francesco Cortese, Maurizio Patrignani:
Clustered Planarity = Flat Clustered Planarity. CoRR abs/1808.07437 (2018) - [i18]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Upward Planar Morphs. CoRR abs/1808.10826 (2018) - 2017
- [j32]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) - [j31]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) - [c62]Alessandro Baroni, Alessio Conte, Maurizio Patrignani, Salvatore Ruggieri:
Efficiently Clustering Very Large Attributed Graphs. ASONAM 2017: 369-376 - [c61]Tiziana Calamoneri, Valentino Di Donato, Diego Mariottini, Maurizio Patrignani:
Visualizing Co-phylogenetic Reconciliations. GD 2017: 334-347 - [c60]Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. GD 2017: 465-478 - [c59]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Alessandra Tappini:
NodeTrix Planarity Testing with Small Clusters. GD 2017: 479-491 - [c58]Alessio Conte, Donatella Firmani, Caterina Mordente, Maurizio Patrignani, Riccardo Torlone:
Fast Enumeration of Large k-Plexes. KDD 2017: 115-124 - [c57]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 - [i17]Alessandro Baroni, Alessio Conte, Maurizio Patrignani, Salvatore Ruggieri:
Efficiently Clustering Very Large Attributed Graphs. CoRR abs/1703.08590 (2017) - [i16]Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. CoRR abs/1708.09107 (2017) - [i15]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Alessandra Tappini:
NodeTrix Planarity Testing with Small Clusters. CoRR abs/1708.09281 (2017) - [i14]Tiziana Calamoneri, Valentino Di Donato, Diego Mariottini, Maurizio Patrignani:
Visualizing Co-Phylogenetic Reconciliations. CoRR abs/1708.09691 (2017) - 2016
- [c56]Valentino Di Donato, Maurizio Patrignani, Claudio Squarcella:
NetFork: Mapping Time to Space in Network Visualization. AVI 2016: 92-99 - [c55]Alessio Conte, Roberto De Virgilio, Antonio Maccioni, Maurizio Patrignani, Riccardo Torlone:
Finding All Maximal Cliques in Very Large Social Networks. EDBT 2016: 173-184 - [c54]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Computing NodeTrix Representations of Clustered Graphs. GD 2016: 107-120 - [c53]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Beyond Level Planarity. GD 2016: 482-495 - [c52]Davide Ceneda, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini:
RoutingWatch: Visual exploration and analysis of routing events. NOMS 2016: 591-597 - [c51]Alessio Conte, Roberto De Virgilio, Antonio Maccioni, Maurizio Patrignani, Riccardo Torlone:
Community Detection in Social Networks: Breaking the Taboos. SEBD 2016: 118-125 - [c50]Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis:
L-Drawings of Directed Graphs. SOFSEM 2016: 134-147 - [r2]Maurizio Patrignani:
Bend Minimization for Orthogonal Drawings of Plane Graphs. Encyclopedia of Algorithms 2016: 177-181 - [i13]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) - [i12]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Computing NodeTrix Representations of Clustered Graphs. CoRR abs/1608.08952 (2016) - [i11]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) - 2015
- [j30]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) - [j29]Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs. Comput. Geom. 50: 34-48 (2015) - [j28]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) - [j27]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Antonios Symvonis, Ioannis G. Tollis:
Fan-planarity: Properties and complexity. Theor. Comput. Sci. 589: 76-86 (2015) - [j26]Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani:
Computational complexity of traffic hijacking under BGP and S-BGP. Theor. Comput. Sci. 600: 143-154 (2015) - [c49]Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli:
Optimal Morphs of Convex Drawings. SoCG 2015: 126-140 - [c48]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. GD 2015: 217-230 - [c47]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 - [c46]Giordano Da Lozzo, Marco Di Bartolomeo, Maurizio Patrignani, Giuseppe Di Battista, Davide Cannone, Sergio Tortora:
Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data. IVAPP 2015: 109-116 - [c45]Giuseppe Di Battista, Valentino Di Donato, Maurizio Patrignani, Maurizio Pizzonia, Vincenzo Roselli, Roberto Tamassia:
Bitconeview: visualization of flows in the bitcoin transaction graph. VizSEC 2015: 1-8 - [i10]Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli:
Optimal Morphs of Convex Drawings. CoRR abs/1503.09021 (2015) - [i9]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. CoRR abs/1508.07557 (2015) - [i8]Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis:
L-Drawings of Directed Graphs. CoRR abs/1509.00684 (2015) - [i7]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
- [j25]Carla Binucci, Walter Didimo, Maurizio Patrignani:
Upward and quasi-upward planarity testing of embedded mixed graphs. Theor. Comput. Sci. 526: 75-89 (2014) - [c44]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Fan-Planar Graphs: Combinatorial Properties and Complexity Results. GD 2014: 186-197 - [c43]Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
On the Complexity of HV-rectilinear Planarity Testing. GD 2014: 343-354 - [c42]Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Giuseppe Di Battista, Seok-Hee Hong, Maurizio Patrignani, Vincenzo Roselli:
Anchored Drawings of Planar Graphs. GD 2014: 404-415 - [c41]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Optimally. ICALP (1) 2014: 126-137 - [i6]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Optimally. CoRR abs/1402.4364 (2014) - [i5]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Properties and Complexity of Fan-Planarity. CoRR abs/1406.5299 (2014) - 2013
- [j24]Walter Didimo, Maurizio Patrignani:
Guest Editors' Foreword. J. Graph Algorithms Appl. 17(4): 363-365 (2013) - [j23]Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani:
Topological morphing of planar graphs. Theor. Comput. Sci. 514: 2-20 (2013) - [c40]Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Efficiently. GD 2013: 49-60 - [c39]Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Drawing Non-Planar Graphs with Crossing-Free Subgraphs. GD 2013: 292-303 - [c38]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 - [e2]Walter Didimo, Maurizio Patrignani:
Graph Drawing - 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7704, Springer 2013, ISBN 978-3-642-36762-5 [contents] - [r1]Maurizio Patrignani:
Planarity Testing and Embedding. Handbook of Graph Drawing and Visualization 2013: 1-42 - [i4]Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graphs Drawings Efficiently. CoRR abs/1308.4291 (2013) - [i3]Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Drawings of Non-planar Graphs with Crossing-free Subgraphs. CoRR abs/1308.6706 (2013) - 2012
- [j22]Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig:
Drawing trees in a streaming model. Inf. Process. Lett. 112(11): 418-422 (2012) - [j21]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) - [j20]Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Monotone Drawings of Graphs. J. Graph Algorithms Appl. 16(1): 5-35 (2012) - [j19]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Nonconvex Representations of Plane Graphs. SIAM J. Discret. Math. 26(4): 1670-1681 (2012) - [c37]Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani:
Computational Complexity of Traffic Hijacking under BGP and S-BGP. ICALP (2) 2012: 476-487 - [i2]Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani:
Computational Complexity of Traffic Hijacking under BGP and S-BGP. CoRR abs/1205.4564 (2012) - 2011
- [j18]Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani:
Finding a Minimum-depth Embedding of a Planar Graph in O(n4) Time. Algorithmica 60(4): 890-937 (2011) - [j17]Vladimir Batagelj, Franz-Josef Brandenburg, Walter Didimo, Giuseppe Liotta, Pietro Palladino, Maurizio Patrignani:
Visual Analysis of Large Graphs Using (X, Y)-Clustering and Hybrid Visualizations. IEEE Trans. Vis. Comput. Graph. 17(11): 1587-1598 (2011) - 2010
- [j16]Ioannis G. Tollis, Maurizio Patrignani:
Guest Editor's Foreword. J. Graph Algorithms Appl. 14(1): 3-4 (2010) - [c36]Vladimir Batagelj, Walter Didimo, Giuseppe Liotta, Pietro Palladino, Maurizio Patrignani:
Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations. PacificVis 2010: 209-216 - [c35]Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Monotone Drawings of Graphs. GD 2010: 13-24 - [c34]Luca Cittadini, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani, Massimo Rimondini:
Assigning AS relationships to satisfy the Gao-Rexford conditions. ICNP 2010: 113-123 - [c33]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 - [c32]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
2000 – 2009
- 2009
- [j15]Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia:
On embedding a cycle in a plane graph. Discret. Math. 309(7): 1856-1869 (2009) - [j14]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) - [c31]Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani:
Splitting Clusters to Get C-Planarity. GD 2009: 57-68 - [c30]Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig:
Drawing Trees in a Streaming Model. GD 2009: 292-303 - [c29]Mario Cola, Giorgio De Lucia, Daria Mazza, Maurizio Patrignani, Massimo Rimondini:
Covert Channel for One-Way Delay Measurements. ICCCN 2009: 1-6 - [e1]Ioannis G. Tollis, Maurizio Patrignani:
Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers. Lecture Notes in Computer Science 5417, Springer 2009, ISBN 978-3-642-00218-2 [contents] - 2008
- [j13]Maurizio Patrignani:
Complexity results for three-dimensional orthogonal graph drawing. J. Discrete Algorithms 6(1): 140-161 (2008) - [j12]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) - [c28]Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani:
Topological Morphing of Planar Graphs. GD 2008: 145-156 - [c27]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Non-convex Representations of Graphs. GD 2008: 390-395 - [i1]Vladimir Batagelj, Franz J. Brandenburg, Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
08191 Working Group Report - X-graphs of Y-graphs and their Representations. Graph Drawing with Applications to Bioinformatics and Social Sciences 2008 - 2007
- [j11]Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini:
Investigating prefix propagation through active BGP probing. Microprocess. Microsystems 31(7): 460-474 (2007) - [j10]Giuseppe Di Battista, Thomas Erlebach, Alexander Hall, Maurizio Patrignani, Maurizio Pizzonia, Thomas Schank:
Computing the types of the relationships between autonomous systems. IEEE/ACM Trans. Netw. 15(2): 267-280 (2007) - [c26]Melanie Badent, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Stefan Felsner, Francesco Giordano, Jan Kratochvíl, Pietro Palladino, Maurizio Patrignani, Francesco Trotta:
Homothetic Triangle Contact Representations of Planar Graphs. CCCG 2007: 233-236 - [c25]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 - [c24]Fabrizio Frati, Maurizio Patrignani:
A Note on Minimum-Area Straight-Line Drawings of Planar Graphs. GD 2007: 339-344 - [c23]Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani:
Computing a Minimum-Depth Planar Graph Embedding in O ( n 4) Time. WADS 2007: 287-299 - 2006
- [j9]Maurizio Patrignani:
On Extending a Partial Straight-line Drawing. Int. J. Found. Comput. Sci. 17(5): 1061-1070 (2006) - [j8]Pier Francesco Cortese, Giuseppe Di Battista, Antonello Moneta, Maurizio Patrignani, Maurizio Pizzonia:
Topographic Visualization of Prefix Propagation in the Internet. IEEE Trans. Vis. Comput. Graph. 12(5): 725-732 (2006) - [c22]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 - [c21]Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini:
Investigating Prefix Propagation through Active BGP Probing. ISCC 2006: 497-504 - 2005
- [j7]Lorenzo Colitti, Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia:
Visualizing Interdomain Routing with BGPlay. J. Graph Algorithms Appl. 9(1): 117-148 (2005) - [j6]Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia:
Clustering Cycles into Cycles of Clusters. J. Graph Algorithms Appl. 9(3): 391-413 (2005) - [c20]Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia:
On Embedding a Cycle in a Plane Graph. GD 2005: 49-60 - [c19]Maurizio Patrignani:
Complexity Results for Three-Dimensional Orthogonal Graph Drawing. GD 2005: 368-379 - [c18]Maurizio Patrignani:
On Extending a Partial Straight-Line Drawing. GD 2005: 380-385 - 2004
- [j5]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani:
A note on 3D orthogonal drawings with direction constrained edges. Inf. Process. Lett. 90(2): 97-101 (2004) - [j4]Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani:
IPv6-in-IPv4 Tunnel Discovery: Methods and Experimental Results. IEEE Trans. Netw. Serv. Manag. 1(1): 30-38 (2004) - [c17]Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia:
Clustering Cycles into Cycles of Clusters. GD 2004: 100-110 - [c16]Maurizio Patrignani:
A Note on the Self-similarity of Some Orthogonal Drawings. GD 2004: 389-394 - [c15]Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani:
Discovering IPv6-in-IPv4 tunnels in the Internet. NOMS (1) 2004: 613-626 - [p1]Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
DBdraw - Automatic Layout of Relational Database Schemas. Graph Drawing Software 2004: 237-256 - 2003
- [c14]John M. Boyer, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista:
Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm. GD 2003: 25-36 - [c13]Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia:
BGPlay: A System for Visualizing the Interdomain Routing Evolution. GD 2003: 295-306 - [c12]Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia:
Computing the Types of the Relationships between Autonomous Systems. INFOCOM 2003: 156-165 - 2002
- [j3]Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
Drawing database schemas. Softw. Pract. Exp. 32(11): 1065-1098 (2002) - [c11]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani:
Orthogonal 3D Shapes of Theta Graphs. GD 2002: 142-149 - 2001
- [j2]Maurizio Patrignani:
On the complexity of orthogonal compaction. Comput. Geom. 19(1): 47-67 (2001) - [c10]Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
Drawing Database Schemas with DBdraw. GD 2001: 451-452 - [c9]Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
Industrial Plant Drawer. GD 2001: 475-476 - [c8]Maurizio Patrignani, Maurizio Pizzonia:
The Complexity of the Matching-Cut Problem. WG 2001: 284-295 - 2000
- [j1]Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu:
A Split & Push Approach to 3D Orthogonal Drawing. J. Graph Algorithms Appl. 4(3): 105-133 (2000) - [c7]Neal Lesh, Joe Marks, Maurizio Patrignani:
Interactive Partitioning (System Demonstration, Short). GD 2000: 31-36 - [c6]Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
Drawing Relational Schemas. VisSym 2000: 53-62
1990 – 1999
- 1999
- [c5]Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size. GD 1999: 297-310 - [c4]Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia:
Infinite Trees and the Future. GD 1999: 379-391 - [c3]Maurizio Patrignani:
On the Complexity of Orthogonal Compaction. WADS 1999: 56-61 - 1998
- [c2]Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu:
A Split&Push Approach to 3D Orthogonal Drawing. GD 1998: 87-101 - 1997
- [c1]Maurizio Patrignani, Francesco Vargiu:
3DCube: A Tool for Three Dimensional Graph Drawing. GD 1997: 284-290
Coauthor Index
[j53] [j52] [c90] [c88] [c87] [i39] [j48] [c84] [i36] [i35] [j47] [j46] [c83] [c81] [i33] [i32] [j45] [j44] [c80] [c79] [i31] [j41] [j39] [j38] [c78] [c77] [c76] [c75] [i30] [i29] [i28] [i27] [c69] [i23] [i22] [j33] [c67] [i18] [j32] [j31] [c54] [c53] [i13] [i12] [j30] [j28] [j26] [c48] [c47] [c46] [c45] [i9] [i7] [c42] [c41] [i6] [j23] [c38] [j22] [j21] [j20] [j19] [c37] [i2] [j18] [c35] [c34] [c33] [c32] [j15] [j14] [c30] [j12] [c28] [c27] [j11] [j10] [c25] [c23] [j8] [c22] [c21] [j7] [j6] [c20] [j4] [c17] [c15] [p1] [c14] [c13] [c12] [j3] [c10] [j1] [c6] [c5] [c4] [c2]
[j53] [j52] [c90] [c87] [i39] [i35] [j47] [c83] [i32] [j44] [j42] [c80] [c79] [i31] [j41] [j40] [j39] [j38] [c78] [i28] [i27] [c70] [c69] [i26] [i23] [i22] [j33] [c67] [c64] [i18] [j32] [j31] [c57] [c54] [c53] [i13] [i12] [i11] [j30] [j28] [c49] [c48] [c47] [i10] [i9] [i7] [c41] [i6] [c40] [c38] [i4] [j21] [j20] [j19] [c35] [c33] [c32] [j14] [c31] [j12] [c27] [c25] [c24] [c22]
[j53] [j52] [c91] [c90] [c89] [c87] [i39] [i38] [i37] [j51] [j50] [i35] [j47] [c83] [i32] [c80] [c79] [i31] [j41] [j39] [j38] [i27] [c72] [c70] [c69] [i25] [i23] [i22] [j34] [j33] [c67] [i18] [j32] [j31] [c60] [i16] [c54] [c53] [c50] [i13] [i12] [j30] [j29] [c49] [c48] [c47] [c46] [i10] [i9] [i8] [i7] [c42] [c41] [i6] [c39] [i3]
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-12-10 20:47 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:
