Result 1 to 20 of 85 total
Computational complexity of traffic hijacking under BGP and S-BGP. (English)
Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9‒13, 2012. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-31584-8/pbk). Lecture Notes in Computer Science 7392, 476-487 (2012).
1
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. (English)
J. Discrete Algorithms 14, 150-172 (2012).
2
Drawing trees in a streaming model. (English)
Inf. Process. Lett. 112, No. 11, 418-422 (2012).
3
Monotone drawings of graphs. (English)
J. Graph Algorithms Appl. 16, No. 1, 5-35 (2012).
4
Finding a minimum-depth embedding of a planar graph in $O(n^{4})$ time. (English)
Algorithmica 60, No. 4, 890-937 (2011).
5
Ownership types for the join calculus. (English)
Bruni, Roberto (ed.) et al., Formal techniques for distributed systems. Joint 13th IFIP WG 6.1 international conference, FMOODS 2011, and 31st IFIP WG 6.1 international conference, FORTE 2011, Reykjavik, Iceland, June 6‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21460-8/pbk). Lecture Notes in Computer Science 6722, 289-303 (2011).
6
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 212-225 (2011).
7
Monotone drawings of graphs. (English)
Brandes, Ulrik (ed.) et al., Graph drawing. 18th international symposium, GD 2010, Konstanz, Germany, September 21‒24, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18468-0/pbk). Lecture Notes in Computer Science 6502, 13-24 (2011).
8
Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations (English)
IEEE Trans. Vis. Comput. Graph. 17, No. 11, 1587-1598 (2011).
9
Ownership types for the join calculus (English)
FMOODS/FORTE, 289-303 (2011).
10
Drawing trees in a streaming model. (English)
Eppstein, David (ed.) et al., Graph drawing. 17th international symposium, GD 2009, Chicago, IL, USA, September 22‒25, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11804-3/pbk). Lecture Notes in Computer Science 5849, 292-303 (2010).
11
Splitting clusters to get c-planarity. (English)
Eppstein, David (ed.) et al., Graph drawing. 17th international symposium, GD 2009, Chicago, IL, USA, September 22‒25, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11804-3/pbk). Lecture Notes in Computer Science 5849, 57-68 (2010).
12
Special issue: Selected papers from the 16th international symposium on graph drawing (GD 2008). Selected papers based on the presentations at the symposium, Hersonissos, Greece, September 2008. (English)
J. Graph Algorithms Appl. 14, No. 1, 3-119 (2010).
13
Testing planarity of partially embedded graphs (English)
SODA, 202-221 (2010).
14
Assigning AS relationships to satisfy the gao-rexford conditions (English)
ICNP, 113-123 (2010).
15
Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations (English)
PacificVis, 209-216 (2010).
16
Monotone drawings of graphs (English)
Graph Drawing, 13-24 (2010).
17
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree (English)
IWOCA, 212-225 (2010).
18
On embedding a graph in the grid with the maximum number of bends and other bad features. (English)
Theory Comput. Syst. 44, No. 2, 143-159 (2009).
19
On embedding a cycle in a plane graph. (English)
Discrete Math. 309, No. 7, 1856-1869 (2009).
20
Result 1 to 20 of 85 total
Start
Contact
Print
General Help
