Result 1 to 20 from 25 total
On a tree and a path with no geometric simultaneous embedding. (English)
J. Graph Algorithms Appl. 16, No. 1, 37-83 (2012).
1
io-port 05915202 Brandes, Ulrik;
Erten, Cesim;
Estrella-Balderrama, Alejandro;
Fowler, J.Joseph;
Frati, Fabrizio;
Geyer, Markus;
Gutwenger, Carsten;
Hong, Seok-Hee;
Kaufmann, Michael;
Kobourov, Stephen G.;
Liotta, Giuseppe;
Mutzel, Petra;
Symvonis, Antonios
Colored simultaneous geometric embeddings and universal pointsets. (English)
Algorithmica 60, No. 3, 569-592 (2011).
2
Upward point-set embeddability. (English)
Černá, Ivana (ed.) et al., SOFSEM 2011: Theory and practice of computer science. 37th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 22‒28, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-18380-5/pbk). Lecture Notes in Computer Science 6543, 272-283 (2011).
3
Visualizing differences between two large 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, 393-394 (2011).
4
On a tree and a path with no geometric simultaneous embedding. (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, 38-49 (2011).
5
Upward geometric graph embeddings into point sets. (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, 25-37 (2011).
6
The joint terrasar-X / tandem-X mission planning system (English)
IGARSS, 3971-3974 (2011).
7
Upward point-set embeddability (English)
SOFSEM, 272-283 (2011).
8
Chapter 2. Modeling. (English)
Müller-Hannemann, Matthias (ed.) et al., Algorithm engineering. Bridging the gap between algorithm theory and practice. Berlin: Springer (ISBN 978-3-642-14865-1/pbk). Lecture Notes in Computer Science 5971, 16-57 (2010).
9
On a tree and a path with no geometric simultaneous embedding. (English)
Comput. Res. Repos. 2010, Article No. 1001.0555 (2010).
10
Terrasar-X mission planning system: automated command generation for spacecraft operations (English)
IEEE T. Geoscience and Remote Sensing 48, No. 2, 642-648 (2010).
11
Modeling (English)
Algorithm Engineering, 16-57 (2010).
12
Upward geometric graph embeddings into point sets (English)
Graph Drawing, 25-37 (2010).
13
Visualizing differences between two large graphs (English)
Graph Drawing, 393-394 (2010).
14
On a tree and a path with no geometric simultaneous embedding (English)
Graph Drawing, 38-49 (2010).
15
Planar packing of trees and spider trees. (English)
Inf. Process. Lett. 109, No. 6, 301-307 (2009).
16
Two trees which are self-intersecting when drawn simultaneously. (English)
Discrete Math. 309, No. 7, 1909-1916 (2009).
17
io-port 05523843 Brandes, U.;
Erten, C.;
Fowler, J.;
Frati, F.;
Geyer, M.;
Gutwenger, C.;
Hong, S.;
Kaufmann, M.;
Kobourov, S.G.;
Liotta, G.;
Mutzel, P.;
Symvonis, A.
Colored simultaneous geometric embeddings. (English)
Lin, Guohui (ed.), Computing and combinatorics. 13th annual international conference, COCOON 2007, Banff, Canada, July 16‒19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73544-1/pbk). Lecture Notes in Computer Science 4598, 254-263 (2007).
18
Packing and squeezing subgraphs into planar graphs. (English)
Kučera, Luděk (ed.) et al., Mathematical foundations of computer science 2007. 32nd international symposium, MFCS 2007, Český Krumlov, Czech Republic, August 26‒31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74455-9/pbk). Lecture Notes in Computer Science 4708, 394-405 (2007).
19
Packing and squeezing subgraphs into planar graphs (English)
MFCS, 394-405 (2007).
20
Result 1 to 20 from 25 total
Start
Contact
Print
General Help
