Result 1 to 20 of 142 total
Augmenting the connectivity of planar and geometric graphs. (English)
J. Graph Algorithms Appl. 16, No. 2, 599-628 (2012).
1
Approximation algorithms for the maximum leaf spanning tree problem on acyclic digraphs. (English)
Solis-Oba, Roberto (ed.) et al., Approximation and online algorithms. 9th international workshop, WAOA 2011, Saarbrücken, Germany, September 8‒9, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-29115-9/pbk). Lecture Notes in Computer Science 7164, 77-88 (2012).
2
Drawing graphs with vertices at specified positions and crossings at large angles. (English)
Rahman, Md. Saidur (ed.) et al., WALCOM: Algorithms and computation. 6th international workshop, WALCOM 2012, Dhaka, Bangladesh, February 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28075-7/pbk). Lecture Notes in Computer Science 7157, 186-197 (2012).
3
Drawing (complete) binary tanglegrams. (English)
Algorithmica 62, No. 1-2, 309-332 (2012).
4
Drawing graphs with vertices at specified positions and crossings at large angles. (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, 441-442 (2012).
5
Approximating minimum Manhattan networks in higher dimensions. (English)
Demetrescu, Camil (ed.) et al., Algorithms ‒ ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 49-60 (2011).
6
Extending ASSL: making UML metamodel-based workflows executable (English)
ECEASST 44 (2011).
7
Drawing and labeling high-quality metro maps by mixed-integer programming (English)
IEEE Trans. Vis. Comput. Graph. 17, No. 5, 626-641 (2011).
8
Muse: novel efficient multi-tier communication security model for emergency and rescue operations (English)
MASS, 929-934 (2011).
9
Approximating minimum manhattan networks in higher dimensions (English)
ESA, 49-60 (2011).
10
Character-eyes - story-driven inquiry from a character’s viewpoint (English)
CSEDU (1), 402-407 (2011).
11
Drawing graphs with vertices at specified positions and crossings at large angles (English)
Graph Drawing, 441-442 (2011).
12
The traveling salesman problem under squared Euclidean distances. (English)
Marion, Jean-Yves (ed.) et al., STACS 2010. 27th international symposium on theoretical aspects of computer science, Nancy, France, March 4‒6, 2010. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-16-3). LIPICS ‒ Leibniz International Proceedings in Informatics 5, 239-250, electronic only (2010).
13
Area aggregation in map generalisation by mixed-integer programming. (English)
Int. J. Geogr. Inf. Syst. 24, No. 12, 1871-1897 (2010).
14
Trimming of graphs, with application to point labeling. (English)
Theory Comput. Syst. 47, No. 3, 613-636 (2010).
15
Knowledge modelling to support inquiry learning tasks. (English)
Bi, Yaxin (ed.) et al., Knowledge science, engineering and management. 4th international conference, KSEM 2010, Belfast, Northern Ireland, UK, September 1‒3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15279-5/pbk). Lecture Notes in Computer Science 6291. Lecture Notes in Artificial Intelligence, 198-209 (2010).
16
The traveling salesman problem under squared Euclidean distances. (English)
Comput. Res. Repos. 2010, Article No. 1001.0236 (2010).
17
Manhattan-geodesic embedding of planar graphs. (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, 207-218 (2010).
18
Optimizing active ranges for consistent dynamic map labeling. (English)
Comput. Geom. 43, No. 3, 312-328 (2010).
19
Pattern catalogs using the pattern language meta language (English)
ECEASST 25 (2010).
20
Result 1 to 20 of 142 total
Start
Contact
Print
General Help
