Result 1 to 20 from 109 total
The straight-line RAC drawing problem is NP-hard. (English)
J. Graph Algorithms Appl. 16, No. 2, 569-597 (2012).
1
Geometric RAC simultaneous drawings of graphs. (English)
Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20‒22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 287-298 (2012).
2
Drawing trees in a streaming model. (English)
Inf. Process. Lett. 112, No. 11, 418-422 (2012).
3
Combining problems on RAC drawings and simultaneous graph drawings. (English)
van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21‒23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 433-434 (2012).
4
Upward point set embeddability for convex point sets is in $P$. (English)
van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21‒23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 403-414 (2012).
5
Monotone drawings of graphs with fixed embedding. (English)
van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21‒23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 379-390 (2012).
6
Geometric simultaneous RAC drawings of graphs. (English)
Comput. Res. Repos. 2011, Article No. 1106.2694 (2011).
7
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).
8
On the perspectives opened by right angle crossing drawings. (English)
J. Graph Algorithms Appl. 15, No. 1, 53-78 (2011).
9
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).
10
Combining traditional map labeling with boundary labeling. (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, 111-122 (2011).
11
The straight-line RAC drawing problem is NP-hard. (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, 74-85 (2011).
12
Maximizing the total resolution 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, 62-67 (2011).
13
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).
14
Incorporating speech recognition engine into an intelligent assistive Reading system for dyslexic students (English)
INTERSPEECH, 2993-2996 (2011).
15
Upward point-set embeddability (English)
SOFSEM, 272-283 (2011).
16
The straight-line RAC drawing problem is NP-hard (English)
SOFSEM, 74-85 (2011).
17
Combining traditional map labeling with boundary labeling (English)
SOFSEM, 111-122 (2011).
18
Combining problems on RAC drawings and simultaneous graph drawings (English)
Graph Drawing, 433-434 (2011).
19
Upward point set embeddability for convex point sets is in P (English)
Graph Drawing, 403-414 (2011).
20
Result 1 to 20 from 109 total
Start
Contact
Print
General Help
