Result 1 to 20 of 55 total
Special issue: Selected papers based on the presentations at the 22th Canadian conference on computational geometry (CCCG 2010), Winnipeg, August 9‒11, 2010. (English)
Comput. Geom. 46, No. 2, 119-189 (2013).
1
Hamiltonian paths and cycles in planar graphs. (English)
Lin, Guohui (ed.), Combinatorial optimization and applications. 6th international conference, COCOA 2012, Banff, AB, Canada, August 5‒9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31769-9/pbk). Lecture Notes in Computer Science 7402, 83-94 (2012).
2
Bounding interference in wireless ad hoc networks with nodes in random position. (English)
Even, Guy (ed.) et al., Structural information and communication complexity. 19th international colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30‒July 2, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-31103-1/pbk). Lecture Notes in Computer Science 7355, 85-98 (2012).
3
Computing partitions of rectilinear polygons with minimum stabbing number. (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, 228-239 (2012).
4
Linear-space data structures for range mode query in arrays. (English)
Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th ‒ March 3rd, 2012. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPICS ‒ Leibniz International Proceedings in Informatics 14, 290-301, electronic only (2012).
5
Linear-space data structures for range minority query in arrays. (English)
Fomin, Fedor V. (ed.) et al., Algorithm theory ‒ SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 295-306 (2012).
6
On the hardness of point-set embeddability. (Extended abstract). (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, 148-159 (2012).
7
Embedding plane 3-trees in $\Bbb R^{2}$ and $\Bbb R^{3}$. (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, 39-51 (2012).
8
Ranking and loopless generation of $k$-ary Dyck words in cool-lex order. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 22nd international workshop, IWOCA 2011, Victoria, BC, Canada, July 20‒22, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25010-1/pbk). Lecture Notes in Computer Science 7056, 182-194 (2011).
9
Faster optimal algorithms for segment minimization with small maximal value. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 86-97 (2011).
10
io-port 05932534 Arroyuelo, Diego;
Claude, Francisco;
Dorrigiv, Reza;
Durocher, Stephane;
He, Meng;
López-Ortiz, Alejandro;
Munro, J.Ian;
Nicholson, Patrick K.;
Salinger, Alejandro;
Skala, Matthew
Untangled monotonic chains and adaptive range search. (English)
Theor. Comput. Sci. 412, No. 32, 4200-4211 (2011).
11
Reconstructing polygons from scanner data. (English)
Theor. Comput. Sci. 412, No. 32, 4161-4172 (2011).
12
Range majority in constant time and linear space. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 244-255 (2011).
13
Modelling gateway placement in wireless networks: geometric $k$-centres of unit disc graphs. (English)
Comput. Geom. 44, No. 5, 286-302 (2011).
14
Linear-space data structures for range mode query in arrays. (English)
Comput. Res. Repos. 2011, Article No. 1101.4068 (2011).
15
Range majority in constant time and linear space (English)
ICALP (1), 244-255 (2011).
16
Faster optimal algorithms for segment minimization with small maximal value (English)
WADS, 86-97 (2011).
17
Embedding plane 3-trees in $\Bbb R2$ and $\Bbb R$3 (English)
Graph Drawing, 39-51 (2011).
18
Ranking and loopless generation of k-ary Dyck words in cool-lex order (English)
IWOCA, 182-194 (2011).
19
On routing with guaranteed delivery in three-dimensional ad hoc wireless networks. (English)
Wirel. Netw. 16, No. 1, 227-235 (2010).
20
Result 1 to 20 of 55 total
Start
Contact
Print
General Help
