Search the dblp DataBase
Paola Bertolazzi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Alessandro Avenali, Paola Bertolazzi, Carlo Batini, Paolo Missier
A formulation of the Data Quality Optimization Problem in Cooperative Information Systems. [Citation Graph (0, 0)][DBLP]
CAiSE Workshops (2), 2004, pp:49-63 [Conf] - Paola Bertolazzi, Giuseppe Di Battista
On Upward Drawing Testing of Triconnected Digraphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1991, pp:272-280 [Conf] - Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis, Paola Bertolazzi
A Framework for Dynamic Graph Drawing. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1992, pp:261-270 [Conf] - Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia
Optimal Upward Planarity Testing of Single-Source Digraphs. [Citation Graph (0, 0)][DBLP]
ESA, 1993, pp:37-48 [Conf] - Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo
Quasi-Upward Planarity. [Citation Graph (0, 0)][DBLP]
Graph Drawing, 1998, pp:15-29 [Conf] - Paola Bertolazzi, Monica Scannapieco
Introducing Data Quality in a Cooperative Context. [Citation Graph (0, 0)][DBLP]
IQ, 2001, pp:431-444 [Conf] - Paola Bertolazzi, Michele Missikoff, Mario Terranova
CID: A VLSI Device for Lists Intersection. [Citation Graph (0, 0)][DBLP]
IWDM, 1983, pp:188-204 [Conf] - Paola Bertolazzi, Concettina Guerra, Silvio Salza
A parallel Algorithm for the visibility problem inside a simple polygon. [Citation Graph (0, 0)][DBLP]
Recent Issues in Pattern Analysis and Recognition, 1989, pp:65-71 [Conf] - Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
How to Draw a Series-Parallel Digraph (Extended Abstract). [Citation Graph (0, 0)][DBLP]
SWAT, 1992, pp:272-283 [Conf] - Massimiliano Beccaria, Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta
A Tailorable and Extensible Automatic Layout Facility. [Citation Graph (0, 0)][DBLP]
VL, 1991, pp:68-73 [Conf] - Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo
Computing Orthogonal Drawings with the Minimum Number of Bends. [Citation Graph (0, 0)][DBLP]
WADS, 1997, pp:331-344 [Conf] - Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo
Quasi-Upward Planarity. [Citation Graph (0, 0)][DBLP]
Algorithmica, 2002, v:32, n:3, pp:474-506 [Journal] - Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta, Carlo Mannino
Upward Drawings of Triconnected Digraphs. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1994, v:12, n:6, pp:476-497 [Journal] - Paola Bertolazzi, Lucio Bianco, Salvatore Ricciardelli
A method for determining the optimal districting in urban emergency services. [Citation Graph (0, 0)][DBLP]
Computers & OR, 1977, v:4, n:1, pp:1-12 [Journal] - Paola Bertolazzi, Caterina De Simone, Anna Galluccio
A Nice Class for the Vertex Packing Problem. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:76, n:1-3, pp:3-19 [Journal] - Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
How to Draw a Series-Parallel Digraph. [Citation Graph (0, 0)][DBLP]
Int. J. Comput. Geometry Appl., 1994, v:4, n:4, pp:385-402 [Journal] - Paola Bertolazzi, Antonio Sassano
A Decomposition Strategy for the Vertex Cover Problem. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1989, v:31, n:6, pp:299-304 [Journal] - Paola Bertolazzi, M. Lucertini, Alberto Marchetti-Spaccamela
Analysis of a Class of Graph Partitioning Problems. [Citation Graph (0, 0)][DBLP]
ITA, 1982, v:16, n:3, pp:255-261 [Journal] - Paola Bertolazzi, Silvio Salza, Concettina Guerra
A Parallel Algorithm for the Visibility Problem from a Point. [Citation Graph (0, 0)][DBLP]
J. Parallel Distrib. Comput., 1990, v:9, n:1, pp:11-14 [Journal] - Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia
Optimal Upward Planarity Testing of Single-Source Digraphs. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1998, v:27, n:1, pp:132-169 [Journal] - Paola Bertolazzi, Antonio Sassano
A Class of Polynomially Solvable Set-Covering Problems. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1988, v:1, n:3, pp:306-316 [Journal] - Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo
Computing Orthogonal Drawings with the Minimum Number of Bends. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Computers, 2000, v:49, n:8, pp:826-840 [Journal] - Luca Becchetti, Paola Bertolazzi, Carlo Gaibisso, Giorgio Gambosi
On the design of efficient ATM routing schemes. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2002, v:270, n:1-2, pp:341-359 [Journal] - Paola Bertolazzi, Antonio Sassano
An O(mn) Algorithm for Regular Set-Covering Problems. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1987, v:54, n:, pp:237-247 [Journal] - Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta
Parametric Graph Drawing. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Software Eng., 1995, v:21, n:8, pp:662-673 [Journal]
Learning to classify species with barcodes. [Citation Graph (, )][DBLP]
Logic based methods for SNPs tagging and reconstruction. [Citation Graph (, )][DBLP]
Brokering infrastructure for minimum cost data procurement based on quality-quantity models. [Citation Graph (, )][DBLP]
Search in 0.007secs, Finished in 0.009secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002