|
Search the dblp DataBase
Emilio Di Giacomo:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Emilio Di Giacomo, Giuseppe Liotta, Stephen K. Wismath
Drawing series-parallel graphs on a box. [Citation Graph (0, 0)][DBLP] CCCG, 2002, pp:149-153 [Conf]
- Emilio Di Giacomo
Drawing Series-Parallel Graphs on Restricted Integer 3D Grids. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2003, pp:238-246 [Conf]
- Emilio Di Giacomo, Walter Didimo
Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2003, pp:419-424 [Conf]
- Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta
WhatsOnWeb: Using Graph Drawing to Search the Web. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2005, pp:480-491 [Conf]
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
Computing Radial Drawings on the Minimum Number of Circles. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2004, pp:251-261 [Conf]
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman
Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2004, pp:262-272 [Conf]
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2002, pp:162-173 [Conf]
- Emilio Di Giacomo, Giuseppe Liotta
WAVE. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2001, pp:440-441 [Conf]
- Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
Volume Requirements of 3D Upward Drawings. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2005, pp:101-110 [Conf]
- Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani
Orthogonal 3D Shapes of Theta Graphs. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2002, pp:142-149 [Conf]
- Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta
How to Embed a Path onto Two Sets of Points. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2005, pp:111-116 [Conf]
- Emilio Di Giacomo, Henk Meijer
Track Drawings of Graphs with Constant Queue Number. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2003, pp:214-225 [Conf]
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath
k -Colored Point-Set Embeddability of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2006, pp:318-329 [Conf]
- Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta
Drawing Bipartite Graphs on Two Curves. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2006, pp:380-385 [Conf]
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta
Radial Drawings of Graphs: Geometric Constraints and Trade-Offs. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2006, pp:355-366 [Conf]
- Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta
A Topology-Driven Approach to the Design of Web Meta-search Clustering Engines. [Citation Graph (0, 0)][DBLP] SOFSEM, 2005, pp:106-116 [Conf]
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath
Drawing Planar Graphs on a Curve. [Citation Graph (0, 0)][DBLP] WG, 2003, pp:192-204 [Conf]
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath
Book Embeddability of Series-Parallel Digraphs. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:45, n:4, pp:531-547 [Journal]
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath
Curve-constrained drawings of planar graphs. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2005, v:30, n:1, pp:1-23 [Journal]
- Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer
Computing straight-line 3D grid drawings of graphs in linear volume. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2005, v:32, n:1, pp:26-58 [Journal]
- Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta
On Embedding a Graph on Two Sets of Points. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2006, v:17, n:5, pp:1071-1094 [Journal]
- Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani
A note on 3D orthogonal drawings with direction constrained edges. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:90, n:2, pp:97-101 [Journal]
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman
k-Spine, 1-bend planarity. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:359, n:1-3, pp:148-175 [Journal]
- Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta
Graph Visualization Techniques for Web Clustering Engines. [Citation Graph (0, 0)][DBLP] IEEE Trans. Vis. Comput. Graph., 2007, v:13, n:2, pp:294-304 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] CCCG, 2007, pp:233-236 [Conf]
- Melanie Badent, Emilio Di Giacomo, Giuseppe Liotta
Drawing Colored Graphs on Colored Points. [Citation Graph (0, 0)][DBLP] WADS, 2007, pp:102-113 [Conf]
WhatsOnWeb+ : An Enhanced Visual Search Clustering Engine. [Citation Graph (, )][DBLP]
Visual analysis of financial crimes: [system paper]. [Citation Graph (, )][DBLP]
On Directed Graphs with an Upward Straight-line. [Citation Graph (, )][DBLP]
A note on simultaneous embedding of planar graphs. [Citation Graph (, )][DBLP]
Matched Drawings of Planar Graphs. [Citation Graph (, )][DBLP]
Point-Set Embedding of Trees with Edge Constraints. [Citation Graph (, )][DBLP]
Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge. [Citation Graph (, )][DBLP]
Visual Analysis of One-to-Many Matched Graphs. [Citation Graph (, )][DBLP]
Constrained Point-Set Embeddability of Planar Graphs. [Citation Graph (, )][DBLP]
Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. [Citation Graph (, )][DBLP]
The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing. [Citation Graph (, )][DBLP]
Switch-Regular Upward Planar Embeddings of Trees. [Citation Graph (, )][DBLP]
Point-set embeddings of trees with given partial drawings. [Citation Graph (, )][DBLP]
Upward straight-line embeddings of directed graphs into point sets. [Citation Graph (, )][DBLP]
Volume requirements of 3D upward drawings. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.306secs
|