S. Bhattacharya, D. Chakrabarty, and M. H. Henzinger, “Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time,” in 19th International Conference on Integer Programming and Combinatorial Optimization, Waterloo, ON, Canada, 2017, vol. 10328, pp. 86–98.

R. Biswas and P. Bhowmick, “Construction of persistent Voronoi diagram on 3D digital plane,” in Combinatorial image analysis, vol. 10256, Cham: Springer Nature, 2017, pp. 93–104.

R. Biswas and P. Bhowmick, “On functionality of quadraginta octants of naive sphere with application to circle drawing,” in Discrete Geometry for Computer Imagery, Nantes, France, 2016, vol. 9647, pp. 256–267.

R. Biswas and P. Bhowmick, “On Finding Spherical Geodesic Paths and Circles in 3,” vol. 8668. Springer, Berlin, Heidelberg, pp. 396–409, 2014.

M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks,” in 40th International Colloquium on Automata, Languages, and Programming, Riga, Latvia, 2013, vol. 7966, pp. 607–619.

P. Dütting, M. H. Henzinger, and M. Starnberger, “Valuation compressions in VCG-based combinatorial auctions,” in 9th International Conference on Web and Internet Economics, Cambridge, MA, USA, 2013, vol. 8289, pp. 146–159.

W. Dvoák, M. H. Henzinger, and D. P. Williamson, “Maximizing a submodular function with viability constraints,” in 21st Annual European Symposium on Algorithms, Sophia Antipolis, France, 2013, vol. 8125, pp. 409–420.

P. Dütting, M. H. Henzinger, and M. Starnberger, “Auctions with heterogeneous items and budget limits,” in 8th International Workshop on Internet and Network Economics, Liverpool, United Kingdom, 2012, vol. 7695, pp. 44–57.

K. Chatterjee, M. Randour, and J.-F. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” in CONCUR 2012 - Concurrency Theory, Newcastle upon Tyne, United Kingdom, 2012, vol. 7454, pp. 115–131.

M. H. Henzinger and A. Vidali, “Multi-parameter mechanism design under budget and matroid constraints,” in 19th Annual European Symposium on Algorithms, Saarbrücken, Germany, 2011, vol. 6942, pp. 192–202.

J. Feldman, M. H. Henzinger, N. Korula, V. S. Mirrokni, and C. Stein, “Online stochastic packing applied to display ad allocation,” in 18th Annual European Symposium on Algorithms, Liverpool, United Kingdom, 2010, vol. 6346, pp. 182–194.

P. Dütting and M. H. Henzinger, “Mechanisms for the marriage and the assignment game,” in 7th International Conference on Algorithms and Complexity, Rome, Italy, 2010, vol. 6078, pp. 6–12.

G. Juhás, I. Kazlov, and A. Juhásová, “Instance Deadlock: A Mystery behind Frozen Programs,” in Applications and Theory of Petri Nets, Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 1–17.

P. Dütting, M. H. Henzinger, and I. Weber, “Bidder optimal assignments for general utilities,” in 5th International Workshop on Internet and Network Economics, Rome, Italy, 2009, vol. 5929, pp. 575–582.