DATE |
FILE |
TYPE |
TITLE |
LOCATION |
2006-07-13 |
|
Seminar |
on the paper "On the Single-Source Unsplittable Flow Problem"
authored by Yefim Dinitz, Naveen Garg, and Michel X. Goemans
|
for the Ph.D. course Networking Algorithmics, Computer Science, Third University of Rome. |
2005-09-14 |
|
Talk |
on extending a partial straight-line drawing |
13th International Symposium on Graph Drawing, Limerick, Ireland. |
2005-09-12 |
|
Talk |
complexity results for three-dimensional orthogonal graph drawing |
13th International Symposium on Graph Drawing, Limerick, Ireland. |
2005-05-20 |
|
Seminar |
The Complexity of Orthogonal Drawings |
for the course Interfacce Grafiche e Tecniche di Visualizzazione for the Laurea Magistrale in Ingegneria Informatica e delle Telecomunicazioni, Facoltà di Ingegneria dell'Università degli Studi di Perugia |
2005-05-10 |
|
Seminar |
Complexity Results for Three-Dimensional Orthogonal Graph Drawing |
Graph Drawing Dagstuhl Seminar 05191 |
2004-11-19 |
|
Talk |
Inter-Domain Routing, IPv6, and Network Visualization |
1st NaMeX Meeting, Rome, Italy. |
2004-10-01 |
|
Talk |
A Note on the Self-Similarity of some Orthogonal Drawings |
12th International Symposium on Graph Drawing, New York City, USA. |
2003-04-24 |
|
Seminar |
Computing the Relationships between Autonomous Systems |
Dipartimento di Informatica e Automazione, Università degli Studi Roma Tre, Roma. |
2003-04-01 |
|
Talk |
Computing the Relationships between Autonomous Systems |
INFOCOM 2003 - The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Francisco, USA. |
2003-03-17 |
|
Seminar |
Computing the Relationships between Autonomous Systems |
SIA - Seminario Interdipartimentale di Algoritmica, Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", Roma. |
2002-10-11 |
|
Presentation |
Computing the Relationships between Autonomous Systems |
ISMA (Internet Statistics Metrics and Analysis) 2002: Multiresolution and correlation analysis of global Internet measurements, Lorenz Center, Leiden University,
The Netherlands. |
2002-09-10 |
|
Presentation |
A RIS-based System for the Visualization of the Routing Flaps |
RIPE 43 Meeting, Rodos Palace, Rhodes, Greece. |
2002-08-27 |
|
Talk |
Orthogonal 3D Shapes of Theta Graphs |
10th International Symposium on Graph Drawing,
Irvine, California, USA.
|
2001-06-16 |
|
Talk |
The Complexity of the Matching-cut Problem |
Graph-Theoretic Concepts in Computer Science (WG 2001), Boltenhagen, Germany.
|
2000-09-21 |
|
Talk |
Interactive Partitioning |
Graph Drawing (Proc. GD '00), Colonial Williamsburg, Virginia, USA.
|
1999-08-12 |
|
Talk |
On the Complexity of Orthogonal Compaction |
6th International Workshop on Algorithms and
Data Structures (WADS '99), Harbour Center, Simon Fraser University,
Vancouver, BC, Canada.
|
1998 |
|
Seminar |
on the paper "On the Single-Source Unsplittable Flow Problem"
authored by Yefim Dinitz, Naveen Garg, and Michel X. Goemans (it was part of
a Ph.D. examination).
|
1998-08-14 |
|
Talk |
A Split&Push Approach to 3D Orthogonal Drawings |
Graph Drawing '98,
the Sixth Symposium on Graph Drawing, August 13-15, 1998, Montréal, Canada.
|
|
|
Seminar |
Learning:
alberi di decisione e algoritmi genetici. |