Result 1 to 20 of 43 total
Query racing: fast completeness certification of query results. (English)
Foresti, Sara (ed.) et al., Data and applications security and privacy XXIV. 24th annual IFIP WG 11.3 working conference, Rome, Italy, June 21‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13738-9/pbk). Lecture Notes in Computer Science 6166, 177-192 (2010).
1
Query racing: fast completeness certification of query results (English)
DBSec, 177-192 (2010).
2
On embedding a cycle in a plane graph. (English)
Discrete Math. 309, No. 7, 1856-1869 (2009).
3
C-planarity of C-connected clustered graphs. (English)
J. Graph Algorithms Appl. 12, No. 2, 225-262 (2008).
4
Netkit: easy emulation of complex networks on inexpensive hardware (English)
TRIDENTCOM, 7 (2008).
5
Investigating prefix propagation through active BGP probing. (English)
Microprocess. Microsyst. 31, No. 7, 460-474 (2007).
6
Computing the types of the relationships between autonomous systems. (English)
IEEE/ACM Trans. Netw. 15, No. 2, 267-280 (2007).
7
Topographic visualization of prefix propagation in the internet. (English)
IEEE Transactions on Visualization and Computer Graphics 12, No. 05, 725-732 (2006).
8
Minimum depth graph embeddings and quality of the drawings: An experimental analysis. (English)
Healy, Patrick (ed.) et al., Graph drawing. 13th international symposium, GD 2005, Limerick, Ireland, September 12‒14, 2005. Revised papers. Berlin: Springer (ISBN 3-540-31425-3/pbk). Lecture Notes in Computer Science 3843, 397-408 (2006).
9
On embedding a cycle in a plane graph. (Extended abstract). (English)
Healy, Patrick (ed.) et al., Graph drawing. 13th international symposium, GD 2005, Limerick, Ireland, September 12‒14, 2005. Revised papers. Berlin: Springer (ISBN 3-540-31425-3/pbk). Lecture Notes in Computer Science 3843, 49-60 (2006).
10
Topographic visualization of prefix propagation in the internet (English)
IEEE Trans. Vis. Comput. Graph. 12, No. 5, 725-732 (2006).
11
Investigating prefix propagation through active BGP probing (English)
ISCC, 497-504 (2006).
12
Clustering cycles into cycles of clusters. (English)
J. Graph Algorithms Appl. 9, No. 3, 391-413 (2005).
13
Visualizing interdomain routing with BGPlay. (English)
J. Graph Algorithms Appl. 9, No. 1, 117-148 (2005).
14
Clustering cycles into cycles of clusters. (English)
Pach, János (ed.), Graph drawing. 12th international symposium, GD 2004, New York, NY, September 29‒October 2, 2004. Revised selected papers. Berlin: Springer (ISBN 3-540-24528-6/pbk). Lecture Notes in Computer Science 3383, 100-110 (2005).
15
Minimum depth graph embeddings and quality of the drawings: an experimental analysis (English)
Graph Drawing, 397-408 (2005).
16
On embedding a cycle in a plane graph (English)
Graph Drawing, 49-60 (2005).
17
BGPlay: A system for visualizing the interdomain routing evolution. (Long demo). (English)
Liotta, Giuseppe (ed.), Graph drawing. 11th international symposium, GD 2003, Perugia, Italy, September 21‒24, 2003. Revised papers. Berlin: Springer (ISBN 3-540-20831-3/pbk). Lect. Notes Comput. Sci. 2912, 295-306 (2004).
18
Clustering cycles into cycles of clusters (English)
Graph Drawing, 100-110 (2004).
19
Upward embeddings and orientations of undirected planar graphs. (English)
J. Graph Algorithms Appl. 7, No. 2, 221-241 (2003).
20
Result 1 to 20 of 43 total
Start
Contact
Print
General Help
