


Publication
 Refereed contributions
 Articles in refereed publications
2011
 Larusic,T. and Punnen, A., The Balanced Traveling Salesman Problem, Computers and OR, 38(5), 868875, 2011.
 Bhattacharya, B.K. and Shi, Q., Improved Algorithms to Network pcenter Location Problems, Accepted: Computational Geometry: Theory and Applications, 2011.
 Karmakar, A., Das, S., Nandy, S.C. and Bhattacharya, B.K. , Some Variations on Constrained Minimum Enclosing Circle Problem, Accepted: Journal of Combinatorial Optimization, 2011.
 Zhang, R. and Punnen, A, Quadratic Bottleneck Knapsack Problem, Accepted Journal of heuristics, 2011
 Zhang, R.Kabadi, S.N. and Punnen, A., Minimum Spanning Tree Problem with Conflict Constraints and Variations,, Discrete Optimization, 8, 191205, 2011.
2010
 Oncan,T. and Punnen, A., The Quadratic Minimum Spanning Tree Problem: A lower Bounding Procedure and an Efficient Search Algorithm, Computers and OR, 37(10), 17621773, 2010.
 Bhattacharya, B. and Shi, Q., Improved algorithms to network pcenter problem, Accepted, Computational Geometry: Theory and Applications, 2010.
 Benvenuti, D,Punnen, A., Hamiltonicity and Its Linkages with Strong Hamiltonicity of a Graph, SIAM J. Discrete Math., 23(4), 20352041, 2010.
 Benvenuti, D,Punnen, A., SCHamiltonian graphs and digraphs: New necessary conditions and their impacts, Discrete Mathematics, 310(21), 28412846, 2010.
2009
 Bhattacharya, B.K.,Shi, Q. and Tamir, A., Optimal Algorithms for the Path/TreeShaped Facility Location Problems in Trees, Algorithmica, 55(4), 601618, 2009.
 Benkoczi, R., Bhattacharya, B.K., Das S. and Sember, J., Collection depots facility location problems in the plane, Computational Geometry, Theory and Applications, 42(5), 403418, 2009.
 Bhattacharya, B.K., Burmester, M., Hu, Y., Kranakis, E., Shi, Q. and Wiese, A.,
Optimal Movement of Mobile Sensors for Barrier Coverage, Theoretical
Computer Science, 410(52), 55155528(2009).
 Benkoczi, R., Bhattacharya, B.K., Tamir, A., Collection depots
facility location problems in trees, Networks 53, 5062, 2009.
 Han, Q. , Punnen, A.P., Ye, Y., An edgereduction algorithm for the vertex cover
problem, Operations Research Letters, 37 (2009) 1186.
 Zhang, R. and Punnen, A.P., Punnen, Bottleneck Flows in Networks,
Information processing letters, 109 (2009) 334338.
 MitrovicMinic, S. and Punnen, A.P., Variable intensity local search,
Book chapter, Springer LNCS Proceedings of Matheuristics 2009 (accepted).
 Benvenuti, D. and Punnen, A.P., On weighted graphs with
hamiltonian cycles of same cost. Revised for SIAM Journal of Discrete
Mathematics, 2009.
 Choudhury S., Gaur D and Krishnamurti R, An Approximation Algorithm for Max kUncut with Capacity Constraints, CSO, 2, 934938, 2009.
 Gaur D., Krishnamurti R., and Kohli R., Conflict Resolution in the Scheduling of Television Commercials, Operations Research,57(5):15981605, 2009.
2008
 Gaur D., Krishnamurti R., and Kohli R., "The Capacitated
max kcut problem", Mathematical Programming, 115(1): 6572
(2008).
 Ge R., Hu R., Ester M., Bhattacharya B.
and BenMoshe B., "Joint Cluster Analysis of Attribute Data
and Relationship Data: the Connected kCenter Problem", Algorithms
and Applications, ACM Transactions on Knowledge Discovery from Data,
Vol. 2, no. 2, 2008.
 Kabadi, S.N. and Punnen, A.P., "Antistalling pivot rule for
linear programs with totally unimodular coefficient matrix", Book
Chapter in, Mathematical Programming and Game Theory for Decision
Making, S. K. Neogy, R. B. Bapat, A. K. Das and T. Parthasarathy
(editors), World Scientific Press, 2008
 Kabadi, S.N. and Punnen, A.P., "A strongly polynomial simplex
method for the linear fractional assignment problem", Operations
Research Letters 36 (2008) 402407.
 Krishnamurti R., Gaur D., Ghosh S., and Sachs H., "Berge's theorem for
the maximum charge problem", Discrete Optimization, 3 (2006) 174178.
 MitrovicMinic, S. and Punnen, A.P., "An improved heuristic approach for
the generalized assignment problem." Accepted, JIM, 2008.
 Oncan,T., Kabadi, S.N., Nair,K.P.K. Punnen, A.P., "VLSN search algorithms for partitioning
problems", Journal of the Operational Research Society, UK, 59,
(2008)388398.
 MitrovicMinic, S. and Punnen, A.P., Very largescale variable
neighborhood search for the generalized assignment problem Journal of Interdisciplinary Mathematics, 11 (2008) 653670.
2007
 R.K. Ahuja, O. Ergun, J.B. Orlin, and A.P. Punnen, "Very
Large Scale Neighborhood Search: Theory, Algorithms and
Applications", Approximation Algorithms and Metaheuristics ,
T. Gonzalez (ed), CRC Press, 2007.
 N. Belacel, H. Raval, and A.P. Punnen, "Learning
multicriteria classification method PROAFTN from data", Computers
and Operations Research, 34 (2007) 18851898.
 BenMoshe B., Bhattacharya B.K., Shi Q.,
and Tamir A., "Efficient algorithms for center problems in cactus
networks", Theor. Comput. Sci., 378(3): 237252, 2007.
 Bose P., Morin P., Maheshwari A., Morrison J., Smid M.,
and Vahrenhold J., "SpaceEfficient Geometric DivideandConquer
Algorithms", Computational Geometry: Theory and Applications, 37(3),
pp. 209227, 2007.
 P. Pandey and A.P. Punnen, "Simplex method for
piecewiselinear fractional programming problem", European Journal
of Operational Research, 178 (2007) 343358.
 Pandey P. and Punnen A.P., "A simplex algorithm for
piecewiselinear fractional programming problems", European Journal
of Operational Research 178(2): 343358, 2007.
 Gaur D., Krishnamurti R., and Kohli R.,
"The Capacitated max kcut problem", accepted for
publication in Mathematical Programming, Series A.
 Atanassov
R., Bose
P., Maheshwari
A., Morin
P., Paquette
M., Smid
M., and Wuhere
S. "Algorithms for optimal outlier
removal", Journal of Discrete Algorithms,
accepted, 2007.
 Bose P.
and Keil
M., "On the Stretch Factor of the
Constrained Delaunay Triangulation", Journal of
Discrete Algorithms, accepted, 2007.
 Bose P., Morin
P., Maheshwari
A., Morrison
J., Smid M.,
and Vahrenhold
J.,
"SpaceEfficient Geometric DivideandConquer
Algorithms", Computational Geometry: Theory and
Applications, 37(3), pp. 209227, 2007.
 Toussaint G.T.,
"Classification and phylogenetic analysis of African
rhythm timelines," Musicae Scientiae, (accepted
for publication April 1, 2005).
 Toussaint G.T., "Computational geometric
aspects of rhythm and melody", Computational
Geometry: Theory and Applications, January 2007. In
Press.
 Pandey P. and Punnen A.P., "A simplex
algorithm for piecewiselinear fractional programming
problems", European Journal of Operational Research
178(2): 343358, 2007.
 BenMoshe, B., Bhattacharya, B.K., Shi,
Q., and Tamir, A., "Efficient algorithms for center problems in cactus
networks", Theor. Comput. Sci., 378(3): 237252, 2007.
2006
 Gaur D. and Krishnamurti R., "LP
Rounding and Extensions. Forthcoming", In Handbook of
Approximation algorithms and Metaheuristics, Dec 2006.
 Gaur D., Krishnamurti R., and Manuch
J., "Improved Approximation Algorithm for Scheduling
Tasks with a Choice of Start Times", ACID 8594, 2006.
 **Bespamyatnikh,
S., Bhattacharya, B.K., Kirkpatrick, D., and Segal,
M., "Competitive algorithms for mobile centers", Mobile Networks and
Applications, 11(2):177186, 2006.
 Durocher,
S., and Kirkpatrick,
D., "The Steiner Centre: Stability, Eccentricity, and
Applications to
Mobile Facility Location",
International Journal of Computational Geometry and Applications,
16(4):345371, 2006.
Devroye, L., Evans, W. and Kirkpatrick,
D.,
"On the spanning ratios of Gabriel graphs and betaskeletons", SIAM
Journal of Discrete Mathematics, 20(2): 116125, 2006.
 MitrovicMimic, S. and Krishnamurti, R., "The
multiple TSP with time windows: vehicle bounds based on precedence
graphs", Operations Research Letters (1): 111120 (2006).
 Benkoczi, R., Bhattacharya, B.K.
and Breton, D.,
"Efficient computation of 2medians in a tree network with
positive/negative weights",
Discrete Applied Mathematics, 306 (2006) 15051516.
 Chapovska O. and Punnen A.P., "Variations of
the prizecollecting Steiner tree problem", Networks
47(4): 199205, 2006.
2005
 Toussaint, G.T.
"Geometric proximity graphs for improving nearest neighbor methods in
instancebased learning and data mining", International Journal of
Computational Geometry and Applications, Vol.
15, No. 2, April 2005, pp. 101150.
 DiazBanez, M., Gomez, F. and Toussaint,
G.,
"Computing shortest paths for transportation of hazardous materials in
continuous spaces",
Journal of Food Engineering, Vol. 30, 2005, pp. 293298.
 Bremner, D., Demaine, E., Erickson, J.,
Iacono, J., Langerman, S., Morin, P. and Toussaint, G.T.,
"Outputsensitive algorithms for computing nearestneighbor decision
boundaries",
Discrete and Computational Geometry, Vol. 33, No. 4, 2005, pp. 593604.
 Bose, P., Gudmundsson, J. and Smid,
M.,
"Constructing Plane Spanners of Bounded Degree and Low Weight",
Algorithmica: Special Issue for ESA, 42:249264, 2005.
2004
 Spriggs, M., Keil, J. M.,
Bespamyatnikh, S., Segal, J., and Snoeyink, J.,
"Computing a (1+ε)Approximate Geometric MinimumDiameter Spanning
Tree",
Algorithmica, Vol. 38, 2004, 577589.
 Bronnimann, H., Iacono, J., Katajainen, J.,
Morin, P., Morrison, J. and Toussaint, G.T.,
"Spaceefficient planar convex hull algorithms",
Theoretical Computer Science, Vol 321/1, March 2004, pp. 2540.
 Bose, P., Morin, P., Maheshwari, A.,
Morrison, J., Smid, M., and Vahrenhold, J.,
"Packing two disks into a polygonal environment",
Journal of Discrete Algorithms, 2(3):373380, 2004.
2003
 Aloupis, G., Langerman, S., Soss,
M., and Toussaint, G.T.,
"Algorithms for bivariate medians and a FermatToricelli problem for
lines",
Computational Geometry: Theory and Applications, Special Issue
containing the Selected Papers from the Thirteenth Canadian Conference
on Computational Geometry  CCCG'01, Vol. 26, No. 1, August 2003, pp.
6079.
2002
 Agarwal P., Bhattacharya, B.K. and
Sen S.,
"Improved algorithms for uniform partition of points",
Algorithmica, Vol. 32, pp.3252, 2002.
 Marlin, B. and Toussaint, G.T.,
"Constructing convex 3polytopes from two triangulations of a
polygon", Computational Geometry: Theory and Applications, Vol. 28,
No. 1, May
2004, pp. 4147. (Special Issue containing the six best papers selected
from the 14th Canadian Conference on Computational Geometry,
Lethbridge, Alberta, August 2002).
 Bespamyatnikh, S. N., Bhattacharya, B. K.,
Keil, J. M., Kirkpatrick D. G.,
and Segal, M., "Efficient Algorithms for Centers and Medians in
Interval and
CircularArc Graphs",
Networks, 33 (2002)133142.
 Other refereed contributions:
2011
 Ando, E, Bhattacharya, B.K., Hu, Y., Kameda, T. and Shi,Q., Selecting Good a Priori Sequences for Vehicle Routing Problem with
Stochastic Demand, ICTAC 2011, 4561, 2011.
 MitrovicMinic, S. and Punnen, A., Routing and Scheduling of a Heterogeneous Fleet of Reconfigurable Ferries: a Model, a Heuristic, and a Case Study, OR 2011International Conference on Operations Research, Zurich, 2011.
2010
 Bhattacharya B. and Hu Y., Approximation algorithms for the multivehicle scheduling problem, in Proc. ISAAC, 2010.
 Karmakar A., Das, S., Nandy S.C. and Bhattacharya B., Some variations on constrained minimum enclosing circle problem, in Proc. COCOA, 2010.
 Bhattacharya B., Bishnu A., Cheong O., Karmakar A., and Snoeyink J., Computation of nondominated points using compact Voronoi diagrams, in Proc. WALCOM, 8293, 2010.
 Han Q and Punnen A., On the approximability of the vertex cover and related problems, in Proc. AAIM, 161169, 2010.

2009
 Bereg, S. and Kirkpatrick D., Approximating Barrier Resilience in Wireless Sensor Networks, in Proc. ALGOSENSORS, 2940, 2009.
 Choudhury, S.,Gaur, D.,Krishnamurti, R. , "An Approximation Algorithm for Max kUncut with Capacity Constraints", in Proc. of the Second International Joint Conference on Computational Sciences and Optimization, CSO 2009, Sanya, Hainan, China, 2426 April 2009.
 Bhattacharya, B.K., Hu, Y., Shi, Q.,
"Approximation algorithms for the network design problem", COCOON, 225337(2009).
 Bhattacharya, B.K., Hu, Y., Shi, Q.,Kranakis, E., Krizanc, D.,
"Sensor network connectivity with multiple directional antennae of a given angular sum", IPDPSC, 111(2009)
 Bhattacharya, B.K., Bishnu, A., Cheung, O., Das, S., Karmakar, A. and Snoeyink, J.,
"On Finding Nondominated Points using Compact Voronoi Diagrams", CoRR abs/0909.0814: (2009)/li>
2008
 Bhattacharya, B.K., Carmi, P., Hu, Y., Shi, Q.,
"Vehicle Scheduling Problem on Networks with Release and Handling
Times", 19th ISAAC, Australia.
 B. Bhattacharya,
M. Burmester, Y. Hu, E. Kranakis, Q. Shi, and
A. Wiese, "Optimal movement of mobile sensors for barrier coverage
of a planar region", COCOA, 2008 invited to a special issue of the
Theoretical Computer Science (2008).
 R. Benkoczi, B. Bhattacharya, and Q. Shi
"New upper bounds on continuous tree edgepartition problem",
in Proc. AAIM'08 (2008) 3849.
 Bhattacharya, B.K., Burmester, M., Hu, Y., Kranakis, E., Shi, Q. and Wiesse, A.,
"Optimal movement of mobile sensors for barrier coverage of a planar region"
,2nd International Conference on Combinatorial Optimization, 2008.
 Bhattacharya, B.K., Shi, Q.,
"Application of computational geometry to network pcenter location problems",
CCCG 2008 (Invited to a special issue).
2007
 Bhattacharya, B.K., Hu, Y., and Kononov A.,
"Approximation Algorithms for the Black and White Traveling Salesman
Problem", COCOON: 559567, 2007 (Invited to a special issue).
 Bhattacharya, B.K. and Shi Q., "Optimal Algorithms
for the Weighted pCenter Problems on the Real Line for Small p",
WADS:529540, 2007.
 Gaur D. and Bhattacharya, B.K. "Covering points by axis
parallel lines", (Extended Abstract), EWCG 4245, 2007.
 Couture M., Barbeau M., Bose P., and Kranakis E.,
"Incremental Construction of kDominating Sets in Wireless Sensor
Networks", Ad Hoc and Sensor Wireless Networks, 2007.
 Bose P., Douieb K., and Langerman S., "Dynamic Optimality
for Skip Lists and BTrees", Proceedings of the ACMSIAM Symposium
on Discrete Algorithms (SODA), 2007.
 S.N. Kabadi and A.P. Punnen, "Antistalling pivot rule for
linear programs with totally unimodular coefficient matrix",
Symposium on Mathematical Programming for Decision Making: Theory
and Applications (ISMPDM07), ISI Delhi, January 1011, 2007.
 Gaur D. and Bhattacharya, B.K.
"Covering points by axis parallel lines", (Extended
Abstract), EWCG 4245,
2007.
 Couture M., Barbeau
M., Bose
P., and Kranakis
E., "Incremental
Construction of kDominating Sets in Wireless Sensor
Networks", Ad Hoc and Sensor Wireless Networks,
accepted, 2007.
 Bose P., Douieb
K., and Langerman
S., "Dynamic Optimality for Skip Lists
and BTrees", Proceedings of the ACMSIAM Symposium
on Discrete Algorithms (SODA), 2007.
 Bhattacharya, B.K. and Sember J.,
"Efficient Snap Rounding with Integer Arithmetic", CCCG,
145148, 2007.
 BenMoshe B., Bhattacharya, B.K., Das
S., Gaur D., Shi Q., "Computing a planar
widest empty alphasiphon in o(n^{3}) time",
CCCG, 3336, 2007.
 Bhattacharya, B.K., Hu, Y.,
and Kononov A., "Approximation Algorithms for the Black
and White Traveling Salesman Problem", COCOON: 559567,
2007.
 Bhattacharya, B.K. and Shi Q., "Optimal
Algorithms for the Weighted p Center Problems on
the Real Line for Small p", WADS:529540, 2007.
 BenMoshe B., Bhattacharya, B.K., Das S., Gaur D., Shi Q.,
"Computing a planar widest empty alphasiphon in o(n3) time",
CCCG, 3336, 2007.
 Bhattacharya, B.K. and Sember J.,
"Efficient Snap Rounding with Integer Arithmetic",
CCCG, 145148, 2007 (Invited to a special issue).
2006
 BenMoshe, B., Bhattacharya, B.K.
and Shi, Q., "A lineartime algorithm for solving the weighted
2center problem",
Proceedings of Latin American Theoretical Informatics Symposium, March
2024, 2006.
 Bhattacharya, B.K., Hu, Y., Shi,
Q., and Tamir, A., "Optimal algorithms for the
path/treeshaped facility location
problems in trees", Proceedings of ISAAC, 379388, 2006.
 **Couture, M., Barbeau, M., Bose, P.,
and Kranakis, E., "Incremental Construction of kDominating Sets in
Wireless Sensor
Networks", International Conference on Principles of
Distributed
Systems, 2006.
 Bose, P. and Keil, M., "On the stretch factor
of the constrained Delaunay triangulation", Proc. International
Symposium on Voronoi Diagrams in Science and Technology, 2006.
2005
 BenMoshe, B, Bhattacharya, B.K.,
Shi, Q,
"Efficient algorithms for the weighted 2center problem in a cactus
graph",
Proceedings of ISAAC, December 1921, 2005.
 BenMoshe, B., Bhattacharya, B.K.
and Shi, Q.,
"Computing the widest empty boomerang",
Proceedings of Canadian Conference on Computational Geometry, August
1012, 2005.
 BenMoshe, B., Bhattacharya, B.K.
and Shi, Q.,
"Farthest neighbor Voronoi diagram in the presence of rectangular
obstacles",
Proceedings of Canadian Conference on Computational Geometry, August
1012, 2005.
 Benkoczi, R. and Bhattacharya, B.K.,
"A new template for solving pmedian problems for trees in
subquadratic time",
Proceedings of European Symposium on Algorithms,
October 36, 2005.
 Benkoczi, R., Bhattacharya, B.K.,
Das, S. and Sember, J.,
"Collection depot location problem in the plane",
Proceedings of Canadian Conference on Computational Geometry, August
1012, 2005. (Invited to submit a journal version of the paper to
Computational Geometry: Theory and Applications)
 Bhattacharya, B.K., Mukherjee, K.
and Toussaint, G.T.,
"Geometric decision rules for instancebased learning problems",
Proceedings of the First International Conference on Pattern
Recognition and Machine Learning, Kolkata, December 1518, 2005.
 Bhattacharya, B.K., Mukherjee, K.
and Toussaint, G.T.,
"Geometric decision rules for high dimensions",
Proceedings of the 55th Sessions of Int. Statistics Institute, Sydney,
2005.
 Bose, P., Karanakis, E., Morin, P.,
and Tang, Y.,
"Approximate Range Mode and Range Median Queries",
Proceedings of the Symposium on Theoretical Aspects of Computer
Science, 377388, 2005.
 Colannino, J. and Toussaint, G.T.,
"Faster algorithms for computing distances between one dimensional
point sets",
Proceedings of the XI Encuentros de Geometria Computacional, Editors:
Francisco Santos and David Orden, Servicio de Publicaciones de la
Universidad de Cantabria, Santander, Spain, June 2729, 2005, pp.
189198.
 Durocher, S., and Kirkpatrick, D.,
"The Projection Median of a Set Points in R^2",
Proceedings of Canadian Conference on Computational Geometry, August
1012, 2005.
2004
 Benkoczi, R., Bhattacharya, B.K.
and Merchant, R.,
"Constrained Weighted Rectilinear Median Problem in the Plane",
Japan Conference on Discrete and Computational geometry, October 811,
2004.
 Durocher, S., and Kirkpatrick, D.,
"The Gaussian Centre and the Projection Centre of a Set Points in
R^3",
Proceedings of the 16th Canadian Conference on Computational Geometry,
16:140144, 2004.
2003
 Benkoczi, R., Bhattacharya, B.,
Chrobak, M., Larmore, L., and Rytter, W.,
"Faster Algorithms for kMedians in Trees",
MFCS 2003, Bratislava, Slovak Republic.
 Bhattacharya, B.K. and
MitrovicMinic, S.,
"The dynamic TSPTW on a line: Do preprocessing so that insertion of a
new location into an existing route may be done in sublinear time",
EURO/INFORMS Joint International Meeting, Istanbul, Turkey,July 610,
2003.
 Durocher, S., and Kirkpatrick, D.,
"The Gaussian Centre of a Set of Mobie Points ",
Proceedings of the 15th Canadian Conference on Computational Geometry,
15:123127, 2003.
 Toussaint, G.T.,
"Geometric graphs for improving nearest neighbor decision rules",
Computational Science and its Applications, Eds. V. Kumar, M. L.
Gavrilova, C. J. K. Tan and P. L'Ecuyer, ICCSA 2003, LNCS 2669,
SpringerVerlag, 2003, pp. 762765.
 Toussaint, G.T.,
"Open problems in geometric methods for instancebased learning",
Discrete and Computational Geometry, Japanese Conference, JCDCG 2002,
Tokyo, Japan, December 69, 2002, Editors: Jin Akiyama and Mikio Kano,
SpingerVerlag, BerlinHeidelberg, 2003, pp. 273283.
 Benkoczi, R., Bhattacharya, B.,
Chrobak, M., Larmore, L., and Rytter, W.,
"Faster Algorithms for kMedians in Trees",
MFCS 2003, Bratislava, Slovak Republic.
 Bhattacharya, B.K. and
MitrovicMinic, S.,
"The dynamic TSPTW on a line: Do preprocessing so that insertion of a
new location into an existing route may be done in sublinear time",
EURO/INFORMS Joint International Meeting, Istanbul, Turkey,July 610,
2003.
 Durocher, S., and Kirkpatrick, D.,
"The Gaussian Centre of a Set of Mobie Points ",
Proceedings of the 15th Canadian Conference on Computational Geometry,
15:123127, 2003.
 Toussaint, G.T.,
"Geometric graphs for improving nearest neighbor decision rules",
Computational Science and its Applications, Eds. V. Kumar, M. L.
Gavrilova, C. J. K. Tan and P. L'Ecuyer, ICCSA 2003, LNCS 2669,
SpringerVerlag, 2003, pp. 762765.
 Toussaint, G.T.,
"Open problems in geometric methods for instancebased learning",
Discrete and Computational Geometry, Japanese Conference, JCDCG 2002,
Tokyo, Japan, December 69, 2002, Editors: Jin Akiyama and Mikio Kano,
SpingerVerlag, BerlinHeidelberg, 2003, pp. 273283.
2002
 Bose, P., Maheshwari A., and Morin,
P.,
"Fast approximations for sums of distances, clustering and the
FermatWeber problem",
Computational Geometry: Theory and Applications (2002).
 Benkoczi, R., Bhattacharya, B. K.,
and Breton, D.,
"Efficient computation of 2medians in a tree network with
positive/negative weights",
In R.C. Bose Centenary Symposium on Discrete Math, Kolkata, Dec. 2002.
 Bespamyatnikh, S. N., Bhattacharya, B. K.,
Kirkpatrick, D. G., and Segal, M.,
"Lower and upper bounds for tracking mobile users",
IFIP TCS 2002, 4758.
 Benkoczi, R., Bhattacharya, B. K.,
and Breton, D.,
"Optimal location in trees using the spine decomposition",
5th International Conference of Operations Research, Havana, March 48,
2002.
 Bose, P. and Wang, Q.,
"Facility location costrained to a polygonal domain",
LATIN, 2002.
 Bhattacharya, B.K. and ElGindy, H.,
"Cluster identification in tree networks",
Proceedings of Communications in Computing CIC2002 , 2002.
2000
 Bespamyatnikh, S., Bhattacharya, B. K.,
Kirkpatrick, D., and Segal, M.,
"Mobile facility location",
Proc. Fourth International Workshop on Discrete Algorithms and Methods
for Mobile Computing and Communications, August 2000.
 Nonrefereed contributions
 Zhang, R.,
"Quadratic bottleneck knapsack problems",
Simon Fraser University, 2011.
 Taghipour, S.,
"Quadratic balanced optimization",
Simon Fraser University, 2011.
 Bakker, L.,
“Homeless outreach in the Tri Cities: is something social going on?”
M.Sc. Thesis, Simon Fraser University, 2011.
 Bhattacharjee, S.,
"A primaldual algorithm for the maximum charge problem with capacity constraints",
MSc Thesis, University of Lethbridge, 2010.
 Kaveh, A.,
"Algorithms and theoretical topics on selected combinatorial optimization",
MSc Thesis, Simon Fraser University, 2010.
 Woods, B.,
"Generalized travelling salesman problem on halin graphs",
MSc Thesis, Simon Fraser University, 2010.
 Chan, B.,
"A primaldual algorithm for the unconstrained fractional matching problem",
MSc Thesis, Simon Fraser University, 2010.
 Hu, Y.,
"Approximation algorithms for the capacitated vehicle routing problem",
PhD Thesis, Simon Fraser University, 2009.
 Taslakian, P.
"Musical Rhythms in the Euclidean Plane",
PhD Thesis, McGill University, 2009.
 LaRusic, J.,
"Experimental analysis of heuristics for the bottleneck traveling salesman problem",
MSc Thesis, Simon Fraser University, 2009.
 Choudhury, S.,
"Approximation algorithms for a graphcut problem with applications to a clusteringi problem in bioinformatics",
MSc Thesis, University of Lethbridge, 2009.
 Haque, S.,
"A computational study of sparse matrix storage schemes",
MSc Thesis, University of Lethbridge, 2009.
 D. Benvenuti,
"Generalizations and extensions of the constant travelling salesman
problem",
MSc Thesis, Simon Fraser University, 2007.
 Q. Shi,
"Efficient algorithms for network center/covering location
optimization problems",
PhD Thesis, Simon Fraser University, 2008.
 D.K. Benvenuti and A.P. Punnen,
"Weighted graphs with constant Hamiltonian cycle cost",
CORS 2007, London, Ontario.
 J. LaRusic, E. Aubanel, and A.P. Punnen,
"Experimental results from Arrow: A bottleneck TSP solver",
CORS 2007, London, Ontario.
 R. Zhang and A.P. Punnen,
"Quadratic bottleneck optimization problems",
CORS 2007, London, Ontario.
 Benkoczi , R. R. and Bhattacharya, B. K.,
"Spine tree decomposition",
Technical Report, School of Computing Science, Simon Fraser University, 1999.
 Breton, D.,
"Facility location problems in trees",
M.Sc. Thesis, Simon Fraser University, November, 2002.
 Toussaint, G. T.,
"Proximity graphs for instancebased learning",
Internal document, 2002.
 Merchant, R.,
"Facility location in the presence of obstacles",
M.Sc. Thesis, Simon Fraser University, 2003.
 Mukherjee, K.,
"Application of Gabriel graph to instancebased learning",
M.Sc. Thesis, Simon Fraser University.
 Benkoczi, R.,
"Cardinality constrainted facility location problems in trees",
Ph.D. Thesis, Simon Fraser University, 2004.
 Durocher, S.,
"Geometric Facility Location under Continuous Motion",
Ph.D. Thesis, University of British Columbia, 2006.
 Sember, J.,
"The planar collection depots location problem",
M.Sc. Thesis, Simon Fraser University, 2006.
 Whurer, S.,
"Clamshell casting",
M.Sc. Thesis, Carleton University, 2006.


