Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.”10.1007/978-3-319-59250-3_8__19th International Conference on Integer Programming and Combinatorial Optimization, vol. 10328, Springer Nature, 2017, pp. 86–98, doi: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, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.”10.1007/978-3-319-59108-7_8__Combinatorial Image Analysis, vol. 10256, Springer Nature, 2017, pp. 93–104, doi: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, Ranita, and Partha Bhowmick. “On Functionality of Quadraginta Octants of Naive Sphere with Application to Circle Drawing.”10.1007/978-3-319-32360-2_20__Discrete Geometry for Computer Imagery, vol. 9647, Springer Nature, 2016, pp. 256–67, doi: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, Ranita, and Partha Bhowmick. On Finding Spherical Geodesic Paths and Circles in 3. Vol. 8668, Springer, 2014, pp. 396–409, doi: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, Monika H., et al. “Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks.”10.1007/978-3-642-39212-2_53__40th International Colloquium on Automata, Languages, and Programming, vol. 7966, Springer Nature, 2013, pp. 607–619, doi: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, Paul, et al. “Valuation Compressions in VCG-Based Combinatorial Auctions.”10.1007/978-3-642-45046-4_13__9th International Conference on Web and Internet Economics, vol. 8289, Springer Nature, 2013, pp. 146–159, doi: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, Wolfgang, et al. “Maximizing a Submodular Function with Viability Constraints.”10.1007/978-3-642-40450-4_35__21st Annual European Symposium on Algorithms, vol. 8125, Springer Nature, 2013, pp. 409–20, doi: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, Paul, et al. “Auctions with Heterogeneous Items and Budget Limits.”10.1007/978-3-642-35311-6_4__8th International Workshop on Internet and Network Economics, vol. 7695, Springer Nature, 2012, pp. 44–57, doi: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, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.”10.1007/978-3-642-32940-1_10__CONCUR 2012 - Concurrency Theory, edited by Maciej Koutny and Irek Ulidowski, vol. 7454, Springer, 2012, pp. 115–31, doi: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, Monika H., and Angelina Vidali. “Multi-Parameter Mechanism Design under Budget and Matroid Constraints.”10.1007/978-3-642-23719-5_17__19th Annual European Symposium on Algorithms, vol. 6942, Springer Nature, 2011, pp. 192–202, doi: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, Jon, et al. “Online Stochastic Packing Applied to Display Ad Allocation.”10.1007/978-3-642-15775-2_16__18th Annual European Symposium on Algorithms, vol. 6346, Springer Nature, 2010, pp. 182–194, doi: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, Paul, and Monika H. Henzinger. “Mechanisms for the Marriage and the Assignment Game.”10.1007/978-3-642-13073-1_2__7th International Conference on Algorithms and Complexity, vol. 6078, Springer Nature, 2010, pp. 6–12, doi: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, Gabriel, et al. “Instance Deadlock: A Mystery behind Frozen Programs.”10.1007/978-3-642-13675-7_1__Applications and Theory of Petri Nets, Springer Berlin Heidelberg, 2010, pp. 1–17, doi: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, Paul, et al. “Bidder Optimal Assignments for General Utilities.”10.1007/978-3-642-10841-9_58__5th International Workshop on Internet and Network Economics, vol. 5929, Springer Nature, 2009, pp. 575–82, doi: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