Bhattacharya, S., Chakrabarty, D., &; Henzinger, M. H. (2017). 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 (Vol. 10328, pp. 86–98). Waterloo, ON, Canada: Springer Nature.https://doi.org/10.1007/978-3-319-59250-3_8 
LibreCat: https://research-explorer.ista.ac.at/record/12571
DOI: 10.1007/978-3-319-59250-3_8
arXiv: 1611.00198

Biswas, R., &; Bhowmick, P. (2017). Construction of persistent Voronoi diagram on 3D digital plane. In Combinatorial image analysis (Vol. 10256, pp. 93–104). Cham: Springer Nature.https://doi.org/10.1007/978-3-319-59108-7_8 
LibreCat: https://research-explorer.ista.ac.at/record/5803
DOI: 10.1007/978-3-319-59108-7_8

Biswas, R., &; Bhowmick, P. (2016). On functionality of quadraginta octants of naive sphere with application to circle drawing. In Discrete Geometry for Computer Imagery (Vol. 9647, pp. 256–267). Cham: Springer Nature.https://doi.org/10.1007/978-3-319-32360-2_20 
LibreCat: https://research-explorer.ista.ac.at/record/5806
DOI: 10.1007/978-3-319-32360-2_20

Biswas, R., &; Bhowmick, P. (2014). On Finding Spherical Geodesic Paths and Circles in 3. Presented at the DGCI: International Conference on Discrete Geometry for Computer Imagery, Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-319-09955-2_33 
LibreCat: https://research-explorer.ista.ac.at/record/5810
DOI: 10.1007/978-3-319-09955-2_33

Henzinger, M. H., Krinninger, S., &; Nanongkai, D. (2013). Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks. In 40th International Colloquium on Automata, Languages, and Programming (Vol. 7966, pp. 607–619). Riga, Latvia: Springer Nature.https://doi.org/10.1007/978-3-642-39212-2_53 
LibreCat: https://research-explorer.ista.ac.at/record/11793
DOI: 10.1007/978-3-642-39212-2_53
arXiv: 1512.08147

Dütting, P., Henzinger, M. H., &; Starnberger, M. (2013). Valuation compressions in VCG-based combinatorial auctions. In 9th International Conference on Web and Internet Economics (Vol. 8289, pp. 146–159). Cambridge, MA, USA: Springer Nature.https://doi.org/10.1007/978-3-642-45046-4_13 
LibreCat: https://research-explorer.ista.ac.at/record/11791
DOI: 10.1007/978-3-642-45046-4_13
arXiv: 1310.3153

Dvoák, W., Henzinger, M. H., &; Williamson, D. P. (2013). Maximizing a submodular function with viability constraints. In 21st Annual European Symposium on Algorithms (Vol. 8125, pp. 409–420). Sophia Antipolis, France: Springer Nature.https://doi.org/10.1007/978-3-642-40450-4_35 
LibreCat: https://research-explorer.ista.ac.at/record/11792
DOI: 10.1007/978-3-642-40450-4_35
arXiv: 1611.05753

Dütting, P., Henzinger, M. H., &; Starnberger, M. (2012). Auctions with heterogeneous items and budget limits. In 8th International Workshop on Internet and Network Economics (Vol. 7695, pp. 44–57). Liverpool, United Kingdom: Springer Nature.https://doi.org/10.1007/978-3-642-35311-6_4 
LibreCat: https://research-explorer.ista.ac.at/record/11794
DOI: 10.1007/978-3-642-35311-6_4
arXiv: 1209.6448

Chatterjee, K., Randour, M., &; Raskin, J.-F. (2012). Strategy synthesis for multi-dimensional quantitative objectives. In M. Koutny &; I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory (Vol. 7454, pp. 115–131). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-642-32940-1_10 
LibreCat: https://research-explorer.ista.ac.at/record/10904
DOI: 10.1007/978-3-642-32940-1_10
arXiv: 1201.5073

Henzinger, M. H., &; Vidali, A. (2011). Multi-parameter mechanism design under budget and matroid constraints. In 19th Annual European Symposium on Algorithms (Vol. 6942, pp. 192–202). Saarbrücken, Germany: Springer Nature.https://doi.org/10.1007/978-3-642-23719-5_17 
LibreCat: https://research-explorer.ista.ac.at/record/11796
DOI: 10.1007/978-3-642-23719-5_17

Feldman, J., Henzinger, M. H., Korula, N., Mirrokni, V. S., &; Stein, C. (2010). Online stochastic packing applied to display ad allocation. In 18th Annual European Symposium on Algorithms (Vol. 6346, pp. 182–194). Liverpool, United Kingdom: Springer Nature.https://doi.org/10.1007/978-3-642-15775-2_16 
LibreCat: https://research-explorer.ista.ac.at/record/11797
DOI: 10.1007/978-3-642-15775-2_16
arXiv: 1001.5076

Dütting, P., &; Henzinger, M. H. (2010). Mechanisms for the marriage and the assignment game. In 7th International Conference on Algorithms and Complexity (Vol. 6078, pp. 6–12). Rome, Italy: Springer Nature.https://doi.org/10.1007/978-3-642-13073-1_2 
LibreCat: https://research-explorer.ista.ac.at/record/11798
DOI: 10.1007/978-3-642-13073-1_2

Juhás, G., Kazlov, I., &; Juhásová, A. (2010). Instance Deadlock: A Mystery behind Frozen Programs. In Applications and Theory of Petri Nets (pp. 1–17). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-13675-7_1 
LibreCat: https://research-explorer.ista.ac.at/record/5940
DOI: 10.1007/978-3-642-13675-7_1

Dütting, P., Henzinger, M. H., &; Weber, I. (2009). Bidder optimal assignments for general utilities. In 5th International Workshop on Internet and Network Economics (Vol. 5929, pp. 575–582). Rome, Italy: Springer Nature.https://doi.org/10.1007/978-3-642-10841-9_58 
LibreCat: https://research-explorer.ista.ac.at/record/11799
DOI: 10.1007/978-3-642-10841-9_58