Jaroslav OPATRNY

Department of Computer Science and Software Engineering
Concordia University
1455 de Maisonneuve Blvd west
Montréal Québec
H3G 1M8 Canada

Office:	EV 3.255 (3rd floor of the Engineering and Visual Arts building, corner of Sainte Catherine and Guy streets):
Tel:	(514) 848 2424 ext. 3047
Fax:	(514) 848 2830
E-mail:	opatrny@cs.concordia.ca

Education:

Courses taught presently:

Comp 442 Compiler construction	Winter 10
Comp 6461 Computer Networks and Protocols	Winter 10

Research:

Routing Algorithms, Energy efficiency of routing, Efficient Data gathering, Efficient Deployment of sensor networks,

Recent Publications (2000 on):

1. M. Eftekhari Hesari, L. Narayanan, and J. Opatrny,
   On average and maximum load of greedy routing in wireless ad hoc networks
   Proceedings of WONS 2010, accepted, 2010.
2. A.E. Abdallah, T. Fevens, J. Opatrny and I. Stojmenovic,
   Power-Aware Semi-beaconless 3D Georouting Algorithms using Adjustable Transmission Ranges for Wireless Ad Hoc and Sensor Networks,
   Ad Hoc Networks Journal, pp 15-29, 2010
3. H. Kassaei, M. Mehran, L. Narayanan, J. Opatrny,
   Local Algorithms for Backbone Formation in Ad Hoc Networks,
   ACM Proceedings of PE-WASUN conference, to appear, 2009
   
4. Y. Cohen and J. Opatrny,
   A Local Algorithm for Dominating Sets of Quasi-unit Disk Graphs,
   Proceedings of C3S2E'09 conference, pp. 223-231, 2009
5. S. Kamali, J. Opatrny,
   A Hybrid Ant-colony Routing Algorithm for Mobile Ad-hoc Networks,
   Proceedings of the COMPLEX 2009 conference, electronic, 2009
6. E. Kranakis, J. Czyzowicz, S. Dobrev; J.Opatrny, J. Urrutia,
   Local Edge Colouring of Yao-like Subgraphs of Unit Disk Graphs,
   Theoretical Computer Science, v. 410, pp. 1388-1400, 2009
7. J. Czyzowicz, S. Dobrev, H. Gonzalez-Aguilar, R. Kralovic, E. Kranakis, J. Opatrny, L. Stacho, J. Urrutia,
   Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs,
   5th Annual Conference on Theory and Applications of Models of Computation (TAMC08), LNCS 4978, pp. 170-181. 2008
8. J. Czyzowicz, S. Dobrev, T. Fevens, H. Gonzalez-Aguilar, E. Kranakis, J. Opatrny, and J. Urrutia,
   Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes,
   Proceedings of LATIN 2008, LNCS 4957, pp. 158-169, 2008.
9. S. Kamali and J. Opatrny,
   POSANT: A Position based ant colony routing algorithm for mobile ad hoc networks,
   Journal of Networks, v. 3, no. 4, pp. 31-41, 2008
10. A.E. Abdallah, T. Fevens, J. Opatrny,
    High delivery rate position based routing algorithm for 3D ad hoc networks,
    Computer Communications,Vol 31/4 pp 807-817, 2007
11. J. Czyzowicz, S. Dobrev, H. Gonzalez-Aguilar, R. Kralovic, E. Kranakis, J. Opatrny, L. Stacho, J. Urrutia,
    Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs,
    5th Annual Conference on Theory and Applications of Models of Computation (TAMC08), accepted, LNCS, 2008
12. J. Czyzowitcz, S. Dobrev, E. Kranakis, J. Opatrny,J. Urrutia,
    Local Edge Colouring of Yao-like Subgraphs of Unit Disk Graphs,
    Proceedings of the Sirocco conference, LNCS 4474, pp. 195-207, 2007.
13. A.E. Abdallah, T. Fevens, J. Opatrny,
    Power-Aware 3D Position-based Routing,
    Proceedings of 2007 IEEE International Conference on Communications (ICC 2007), Session WAS02, pp. 1-8, 2007
14. S. Kamali, J. Opatrny,
    POSANT: a position based ant colony routing algorithm for mobile ad-hoc networks,
    Proceedings of the 3rd Int. Conf. on Wireless and Mobile Comm. ICWMC, p. 21, (best paper award), 2007
15. T. Fevens, G. Kao, J. Opatrny,
    3-D Localized Position-Based Routing with Nearly Certain Delivery in Mobile Ad Hoc Networks,
    Int. Symp. on Wireless Pervasive Computing, Puerto Rico, 2007
16. E. Chavez, S. Dobrev, E. Kranakis, J.Opatrny, L. Stacho, J. Urrutia,
    Route Discovery with Constant Memory in Oriented Planar Geometric Networks,
    Networks, v. 48, pp 7-15, 2006
17. E. Chavez, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, J. Urrutia,
    Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges,
    Proceedings of Latin 06, LNCS 3387, pp. 286-297, 2006
18. A.E. Abdallah, T. Fevens, J. Opatrny,
    Randomized 3-D Position-based Routing Algorithms for Ad-hoc Networks,
    Proc. 3rd Annual Conf. on Mobile and Ubiquitous Systems, Mobiquitous 2006, pp 1-8, San Jose, 2006
19. A.E. Abdallah, T. Fevens, J. Opatrny,
    Hybrid Position-Based 3-D Routing Algorithms with Partial Flooding,
    IEEE CCECE 2006 Conference, Ottawa, pp. 1135-1138, 2006
20. E. Chavez, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, J. Urrutia,
    Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges,
    Proceedings of Latin 06, LNCS 3387, pp. 286-297, 2006
21. E. Chavez, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, H. Tejeda, J. Urrutia,
    New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph,
    Proceedings of OPODIS 2005, LNCS 3974, pp.235-245, 2006
22. T. Fevens, G. Kao, J. Opatrny, Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc Networks
    proceedings of CCCG 2005, pp. 88-91, 2005
    
23. S. Ansari, L.Narayanan, J. Opatrny,
    A generalization of the face routing algorithm to a class of non-planar networks,
    Proceedings of Mobiquitous 2005, pp. 213-225, 2005
24. E. Chavez, S. Dobrev, E. Kranakis, J.Opatrny, L. Stacho, J. Urrutia,
    Route Discovery with Constant Memory in Oriented Planar Geometric Networks,
    Proceedings of ALGOSENSORS 2004, LNCS 3121, pp. 147-156, 2004
25. P. Boone, E. Chavez, L. Gleitzky, E. Kranakis, J.Opatrny, G. Salazar, J. Urrutia,
    Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-hoc Networks,
    Proceedings of SIROCCO 2004, LNCS 3104, pp. 23-34, 2004.
26. S. Choplin, L. Narayanan, J. Opatrny, Two-Hop Virtual Path Layout in Tori,
    Proceedings of SIROCCO 04, LNCS 3104, pp. 69-78, 2004.
27. S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, J. Urrutia,
    Traversal of a quasi-planar subdivision without using mark bits,
    International Workshop on Wireless. Mobile, and Ad Hoc Networks WMAN04, Santa Fe, New Mexico, 2004
    
28. L. Barriere, P. Fraigniaud, L. Narayanan, J. Opatrny,
    Dynamic Construction of Bluetooth Scatternets of Fixed Degree and Low Diameter,
    Proceedings of SODA pp. 781-790, 2003.
29. J. Opatrny, Uniform Multi-hop All-to-All Optical Routings in Rings,
    Theoretical Computer Scince vol 297/1-3 pp 385 - 397, 2003.
30. M.H. Albert, R.E.L. Aldred, M.D. Atkinson, H.P. van Ditmarsch, B.D. Handley, C.C. Handley, J. Opatrny
    Longest subsequences in permutations Australasian Journal of Combinatorics, v. 28, pp 225-238, 2003.
31. L. Barriere, P. Fraigniaud, L. Narayanan, J. Opatrny,
    {Robust Position-Based Routing in Wireless Ad Hoc Networks with Unstable Transmission Ranges,
    Wireless Communications and Mobile Computing Journal, vol. 3/2, pp. 141-153, 2003.
32. F. Comellas, M. Mitjana, L. Narayanan, J. Opatrny,
    Optical Routing of Uniform Instances in Tori,
    MFCS 2000, in LNCS 1893, pp. 205-294, 2000
33. L. Narayanan, J. Opatrny,
    Wavelength routing of uniform instances in Optical Rings, ARACNE 2000,
    in Proceedings on Informatics 8, Carleton Scientific publ. pp. 203-214, 2000.
34. J. Opatrny, and D. Sotteau,
    Embeddings of Complete Binary Trees into Grids and Extended Grids
    with total Vertex-congestion 1,
    Discrete Applied Mathematics 98, pp.237-254, 2000