Result 1 to 20 of 245 total
Pinning balloons with perfect angles and optimal area. (English)
J. Graph Algorithms Appl. 16, No. 4, 847-870 (2012).
1
Pointed drawings of planar graphs. (English)
Comput. Geom. 45, No. 9, 482-494 (2012).
2
ECTS grades: combination of norm- and criterion-referenced grading. (English)
Gaul, Wolfgang (ed.) et al., Challenges at the interface of data analysis, computer science, and optimization. Proceedings of the 34th annual conference of the Gesellschaft für Klassifikation e.V., Karlsruhe, Germany, July 21‒23, 2010. Berlin: Springer (ISBN 978-3-642-24465-0/pbk; 978-3-642-24466-7/ebook). Studies in Classification, Data Analysis, and Knowledge Organization, 557-565 (2012).
3
A comparison of agglomerative hierarchical algorithms for modularity clustering. (English)
Gaul, Wolfgang (ed.) et al., Challenges at the interface of data analysis, computer science, and optimization. Proceedings of the 34th annual conference of the Gesellschaft für Klassifikation e.V., Karlsruhe, Germany, July 21‒23, 2010. Berlin: Springer (ISBN 978-3-642-24465-0/pbk; 978-3-642-24466-7/ebook). Studies in Classification, Data Analysis, and Knowledge Organization, 225-232 (2012).
4
Pinning balloons with perfect angles and optimal area. (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, 154-165 (2012).
5
Challenges at the interface of data analysis, computer science, and optimization. Proceedings of the 34th annual conference of the Gesellschaft für Klassifikation e.V., Karlsruhe, Germany, July 21‒23, 2010. (English)
Studies in Classification, Data Analysis, and Knowledge Organization. Berlin: Springer (ISBN 978-3-642-24465-0/pbk; 978-3-642-24466-7/ebook). xvi, 598~p. EUR~129.95/net; SFR~172.00; \sterling~117.00; \$~179.00 (2012).
6
On the membership problem for the ${0, 1/2}$-closure. (English)
Oper. Res. Lett. 39, No. 5, 301-304 (2011).
7
Bounds on the maximum multiplicity of some common geometric graphs. (English)
Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10‒12, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPICS ‒ Leibniz International Proceedings in Informatics 9, 637-648, electronic only (2011).
8
LiCoRMS ‒ towards a resource management system based on lifecycle and content information. (English)
Beigl, Michael (ed.) et al., Modeling and using context. 7th international and interdisciplinary conference, CONTEXT 2011, Karlsruhe, Germany, September 26‒30, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24278-6/pbk). Lecture Notes in Computer Science 6967. Lecture Notes in Artificial Intelligence, 292-295 (2011).
9
Approximation algorithms and hardness results for the joint replenishment problem with constant demands. (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, 628-639 (2011).
10
Combined head localization and head pose estimation for video-based advanced driver assistance systems. (English)
Mester, Rudolf (ed.) et al., Pattern recognition. 33rd DAGM symposium, Frankfurt/Main, Germany, August 31‒September 2, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23122-3/pbk). Lecture Notes in Computer Science 6835, 51-60 (2011).
11
Near-optimal solutions and large integrality gaps for almost all instances of single-machine precedence-constrained scheduling. (English)
Math. Oper. Res. 36, No. 1, 14-23 (2011).
12
Drawing 3-polytopes with good vertex resolution. (English)
J. Graph Algorithms Appl. 15, No. 1, 33-52 (2011).
13
Small grid embeddings of 3-polytopes. (English)
Discrete Comput. Geom. 45, No. 1, 65-87 (2011).
14
Near-optimal solutions and large integrality gaps for almost all instances of single-machine precedence-constrained scheduling (English)
Math. Oper. Res. 36, No. 1, 14-23 (2011).
15
Small grid embeddings of 3-polytopes (English)
Discrete & Computational Geometry 45, No. 1, 65-87 (2011).
16
Choreographics: an authoring environment for dance shows (English)
SIGGRAPH Posters, 14 (2011).
17
Approximation algorithms and hardness results for the joint replenishment problem with constant demands (English)
ESA, 628-639 (2011).
18
Embedding stacked polytopes on a polynomial-size grid (English)
SODA, 1177-1187 (2011).
19
Supporting safety through social territorial networks (English)
ICE-B, 91-99 (2011).
20
Result 1 to 20 of 245 total
Start
Contact
Print
General Help
