Francesco Trotta

k-colored Point-set Embeddability of Outerplanar Graphs (2009)

Emilio Di, Giacomo Walter, Henk Meijer, Francesco Trotta, Stephen K. Wismath

This paper addresses the problem of designing drawing algorithms that receive as input a planar graph G, a partitioning of the vertices of G into k different semantic categories V0, · · · ,...

The soluble terminal complement complex (SC5b-9) up-regulates osteoprotegerin expression and release by endothelial cells: implications in rheumatoid arthritis (2009)

Corallini, Federica, Bossi, Fleur, Gonelli, Arianna, Tripodo, Claudio, Castellino, Gabriella, Mollnes, Tom E., ...

Objective. Complement activation products contribute to a large number of inflammatory diseases, including RA. We have investigated whether osteoprotegerin (OPG) may concur with the soluble terminal...

Dysfunctional inflammasome in Schnitzler's syndrome (2009)

Pizzirani, Cinzia, Falzoni, Simonetta, Govoni, Marcello, Corte, Renato La, Donadei, Simona, Virgilio, Francesco Di, ...

Objective. IL-1β plays a key role in the pathogenesis of Schnitzler's syndrome (SS). We have investigated inflammasome activity in peripheral blood mononuclear cells (PBMCs) from a patient affected...

Drawing Colored Graphs with Contrained Vertex Positions and Few Bends per Edge (2008)

Di Giacomo, Emilio, Liotta, Giuseppe, Trotta, Francesco

Hamiltonicity, book embeddability, and point-set embeddability of planar graphs are strictly related concepts. We exploit the interplay between these notions to describe colored sets of points and to...

Drawing Colored Graphs with Contrained Vertex Positions and Few Bends per Edge (2008)

Di Giacomo, Emilio, Liotta, Giuseppe, Trotta, Francesco

Hamiltonicity, book embeddability, and point-set embeddability of planar graphs are strictly related concepts. We exploit the interplay between these notions to describe colored sets of points and to...

k-colored point-set embeddability of outerplanar graphs (2007)

Wismath, Stephen K., Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk, Trotta, Francesco

This paper addresses the problem of designing drawing algorithms that receive as input a planar graph $G$, a partitioning of the vertices of $G$ into $k$ different semantic categories $V_0, \cdots,...

k-colored point-set embeddability of outerplanar graphs (2007)

Wismath, Stephen K., Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk, Trotta, Francesco

This paper addresses the problem of designing drawing algorithms that receive as input a planar graph $G$, a partitioning of the vertices of $G$ into $k$ different semantic categories $V_0, \cdots,...

Homothetic triangle contact representations of planar graphs (2007)

Melanie Badent, Carla Binucci, Emilio Di, Giacomo Walter, Didimo Stefan Felsner, Francesco Giordano, ...

In this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentrate on meaningful...

How to Embed a Path onto Two Sets of Points (2006)

Di Giacomo, Emilio, Liotta, Giuseppe, Trotta, Francesco

Let R and B be two sets of points such that the points of R are colored red and the points of B are colored blue. Let P be a path such that |R| vertices of P are red and |B| vertices of P are blue....

How to Embed a Path onto Two Sets of Points (2006)

Di Giacomo, Emilio, Liotta, Giuseppe, Trotta, Francesco

Let R and B be two sets of points such that the points of R are colored red and the points of B are colored blue. Let P be a path such that |R| vertices of P are red and |B| vertices of P are blue....

How to Embed a Path onto Two Sets of Points (2006)

Di Giacomo, Emilio, Liotta, Giuseppe, Trotta, Francesco

Let R and B be two sets of points such that the points of R are colored red and the points of B are colored blue. Let P be a path such that |R| vertices of P are red and |B| vertices of P are blue....

On embedding a graph on two sets of points (2005)

Emilio Di Giacomo, Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta, Francesco Trotta

Let R and B be two sets of points such that the points of R are colored red and the points of B are colored blue. Let G be a planar graph such that |R | vertices of G are red and |B | vertices of G...