[{"_id":"11657","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","publisher":"Association for Computing Machinery","arxiv":1,"doi":"10.1145/3274662","author":[{"first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Alexander","last_name":"Noe","full_name":"Noe, Alexander"},{"full_name":"Schulz, Christian","first_name":"Christian","last_name":"Schulz"},{"first_name":"Darren","last_name":"Strash","full_name":"Strash, Darren"}],"publication_status":"published","citation":{"ama":"Henzinger MH, Noe A, Schulz C, Strash D. Practical minimum cut algorithms. <i>ACM Journal of Experimental Algorithmics</i>. 2018;23:1-22. doi:<a href=\"https://doi.org/10.1145/3274662\">10.1145/3274662</a>","apa":"Henzinger, M. H., Noe, A., Schulz, C., &#38; Strash, D. (2018). Practical minimum cut algorithms. <i>ACM Journal of Experimental Algorithmics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3274662\">https://doi.org/10.1145/3274662</a>","short":"M.H. Henzinger, A. Noe, C. Schulz, D. Strash, ACM Journal of Experimental Algorithmics 23 (2018) 1–22.","ieee":"M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Practical minimum cut algorithms,” <i>ACM Journal of Experimental Algorithmics</i>, vol. 23. Association for Computing Machinery, pp. 1–22, 2018.","mla":"Henzinger, Monika H., et al. “Practical Minimum Cut Algorithms.” <i>ACM Journal of Experimental Algorithmics</i>, vol. 23, Association for Computing Machinery, 2018, pp. 1–22, doi:<a href=\"https://doi.org/10.1145/3274662\">10.1145/3274662</a>.","ista":"Henzinger MH, Noe A, Schulz C, Strash D. 2018. Practical minimum cut algorithms. ACM Journal of Experimental Algorithmics. 23, 1–22.","chicago":"Henzinger, Monika H, Alexander Noe, Christian Schulz, and Darren Strash. “Practical Minimum Cut Algorithms.” <i>ACM Journal of Experimental Algorithmics</i>. Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3274662\">https://doi.org/10.1145/3274662</a>."},"keyword":["Theoretical Computer Science"],"oa_version":"Preprint","publication_identifier":{"issn":["1084-6654"],"eissn":["1084-6654"]},"type":"journal_article","volume":23,"year":"2018","scopus_import":"1","title":"Practical minimum cut algorithms","abstract":[{"text":"The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi’s contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory parallel implementations of our algorithm. Extensive experiments on both real-world and generated instances show that our algorithm finds the optimal cut on nearly all instances significantly faster than other state-of-the-art exact algorithms, and our error rate is lower than that of other heuristic algorithms. In addition, our parallel algorithm runs a factor 7.5× faster on average when using 32 threads. To further speed up computations, we also give a version of our algorithm that performs random edge contractions as preprocessing. This version achieves a lower running time and better parallel scalability at the expense of a higher error rate.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1708.06127","open_access":"1"}],"date_published":"2018-10-01T00:00:00Z","date_updated":"2022-09-09T11:32:52Z","article_processing_charge":"No","quality_controlled":"1","intvolume":"        23","external_id":{"arxiv":["1708.06127"]},"oa":1,"language":[{"iso":"eng"}],"month":"10","article_type":"original","page":"1-22","publication":"ACM Journal of Experimental Algorithmics","day":"01","date_created":"2022-07-27T08:28:26Z","status":"public"},{"acknowledgement":"We thank the two anonymous reviewers for their suggestions and comments, which improved the\r\nquality of the article.","quality_controlled":"1","article_processing_charge":"No","intvolume":"        14","external_id":{"arxiv":["1611.06500"]},"oa":1,"language":[{"iso":"eng"}],"article_type":"original","month":"04","publication":"ACM Transactions on Algorithms","day":"01","date_created":"2022-07-27T11:29:39Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11664","extern":"1","arxiv":1,"publisher":"Association for Computing Machinery","doi":"10.1145/3174803","publication_status":"published","author":[{"first_name":"Gramoz","last_name":"Goranci","full_name":"Goranci, Gramoz"},{"last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"first_name":"Mikkel","last_name":"Thorup","full_name":"Thorup, Mikkel"}],"citation":{"ista":"Goranci G, Henzinger MH, Thorup M. 2018. Incremental exact min-cut in polylogarithmic amortized update time. ACM Transactions on Algorithms. 14(2), 17.","chicago":"Goranci, Gramoz, Monika H Henzinger, and Mikkel Thorup. “Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time.” <i>ACM Transactions on Algorithms</i>. Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3174803\">https://doi.org/10.1145/3174803</a>.","ama":"Goranci G, Henzinger MH, Thorup M. Incremental exact min-cut in polylogarithmic amortized update time. <i>ACM Transactions on Algorithms</i>. 2018;14(2). doi:<a href=\"https://doi.org/10.1145/3174803\">10.1145/3174803</a>","apa":"Goranci, G., Henzinger, M. H., &#38; Thorup, M. (2018). Incremental exact min-cut in polylogarithmic amortized update time. <i>ACM Transactions on Algorithms</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3174803\">https://doi.org/10.1145/3174803</a>","ieee":"G. Goranci, M. H. Henzinger, and M. Thorup, “Incremental exact min-cut in polylogarithmic amortized update time,” <i>ACM Transactions on Algorithms</i>, vol. 14, no. 2. Association for Computing Machinery, 2018.","mla":"Goranci, Gramoz, et al. “Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time.” <i>ACM Transactions on Algorithms</i>, vol. 14, no. 2, 17, Association for Computing Machinery, 2018, doi:<a href=\"https://doi.org/10.1145/3174803\">10.1145/3174803</a>.","short":"G. Goranci, M.H. Henzinger, M. Thorup, ACM Transactions on Algorithms 14 (2018)."},"oa_version":"Preprint","type":"journal_article","publication_identifier":{"eissn":["1549-6333"],"issn":["1549-6325"]},"scopus_import":"1","year":"2018","volume":14,"title":"Incremental exact min-cut in polylogarithmic amortized update time","article_number":"17","abstract":[{"text":"We present a deterministic incremental algorithm for exactly maintaining the size of a minimum cut with O(log3 n log log2 n) amortized time per edge insertion and O(1) query time. This result partially answers an open question posed by Thorup (2007). It also stays in sharp contrast to a polynomial conditional lower bound for the fully dynamic weighted minimum cut problem. Our algorithm is obtained by combining a sparsification technique of Kawarabayashi and Thorup (2015) or its recent improvement by Henzinger, Rao, and Wang (2017), and an exact incremental algorithm of Henzinger (1997).\r\n\r\nWe also study space-efficient incremental algorithms for the minimum cut problem. Concretely, we show that there exists an O(nlog n/ε2) space Monte Carlo algorithm that can process a stream of edge insertions starting from an empty graph, and with high probability, the algorithm maintains a (1+ε)-approximation to the minimum cut. The algorithm has O((α (n) log3 n)/ε 2) amortized update time and constant query time, where α (n) stands for the inverse of Ackermann function.","lang":"eng"}],"date_published":"2018-04-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.06500"}],"issue":"2","date_updated":"2022-09-09T11:38:14Z"},{"month":"05","article_type":"original","language":[{"iso":"eng"}],"date_created":"2022-07-27T11:46:46Z","status":"public","publication":"ACM Transactions on Economics and Computation","day":"01","quality_controlled":"1","article_processing_charge":"No","intvolume":"         6","oa":1,"external_id":{"arxiv":["1310.3153"]},"type":"journal_article","publication_identifier":{"eissn":["2167-8383"],"issn":["2167-8375"]},"scopus_import":"1","year":"2018","volume":6,"citation":{"short":"P. Dütting, M.H. Henzinger, M. Starnberger, ACM Transactions on Economics and Computation 6 (2018).","ieee":"P. Dütting, M. H. Henzinger, and M. Starnberger, “Valuation compressions in VCG-based combinatorial auctions,” <i>ACM Transactions on Economics and Computation</i>, vol. 6, no. 2. Association for Computing Machinery, 2018.","mla":"Dütting, Paul, et al. “Valuation Compressions in VCG-Based Combinatorial Auctions.” <i>ACM Transactions on Economics and Computation</i>, vol. 6, no. 2, 5, Association for Computing Machinery, 2018, doi:<a href=\"https://doi.org/10.1145/3232860\">10.1145/3232860</a>.","apa":"Dütting, P., Henzinger, M. H., &#38; Starnberger, M. (2018). Valuation compressions in VCG-based combinatorial auctions. <i>ACM Transactions on Economics and Computation</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3232860\">https://doi.org/10.1145/3232860</a>","ama":"Dütting P, Henzinger MH, Starnberger M. Valuation compressions in VCG-based combinatorial auctions. <i>ACM Transactions on Economics and Computation</i>. 2018;6(2). doi:<a href=\"https://doi.org/10.1145/3232860\">10.1145/3232860</a>","chicago":"Dütting, Paul, Monika H Henzinger, and Martin Starnberger. “Valuation Compressions in VCG-Based Combinatorial Auctions.” <i>ACM Transactions on Economics and Computation</i>. Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3232860\">https://doi.org/10.1145/3232860</a>.","ista":"Dütting P, Henzinger MH, Starnberger M. 2018. Valuation compressions in VCG-based combinatorial auctions. ACM Transactions on Economics and Computation. 6(2), 5."},"keyword":["Theory of computation","Algorithmic game theory and mechanism design","Applied computing","Economics","Simplified mechanisms","Combinatorial auctions with item bidding","Price of anarchy"],"oa_version":"Preprint","date_published":"2018-05-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1310.3153"}],"issue":"2","date_updated":"2022-09-09T12:04:42Z","title":"Valuation compressions in VCG-based combinatorial auctions","article_number":"5","abstract":[{"text":"The focus of classic mechanism design has been on truthful direct-revelation mechanisms. In the context of combinatorial auctions, the truthful direct-revelation mechanism that maximizes social welfare is the Vickrey-Clarke-Groves mechanism. For many valuation spaces, computing the allocation and payments of the VCG mechanism, however, is a computationally hard problem. We thus study the performance of the VCG mechanism when bidders are forced to choose bids from a subspace of the valuation space for which the VCG outcome can be computed efficiently. We prove improved upper bounds on the welfare loss for restrictions to additive bids and upper and lower bounds for restrictions to non-additive bids. These bounds show that increased expressiveness can give rise to additional equilibria of poorer efficiency.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11667","extern":"1","publication_status":"published","author":[{"first_name":"Paul","last_name":"Dütting","full_name":"Dütting, Paul"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Starnberger, Martin","last_name":"Starnberger","first_name":"Martin"}],"arxiv":1,"publisher":"Association for Computing Machinery","doi":"10.1145/3232860"},{"oa":1,"article_processing_charge":"No","quality_controlled":"1","intvolume":"       261","page":"219-239","publication":"Information and Computation","day":"01","date_created":"2022-08-08T11:20:03Z","status":"public","language":[{"iso":"eng"}],"article_type":"original","month":"08","publisher":"Elsevier","doi":"10.1016/j.ic.2018.02.005","publication_status":"published","author":[{"full_name":"Bhattacharya, Sayan","first_name":"Sayan","last_name":"Bhattacharya"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Italiano, Giuseppe","last_name":"Italiano","first_name":"Giuseppe"}],"_id":"11757","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","title":"Dynamic algorithms via the primal-dual method","abstract":[{"lang":"eng","text":"We develop a dynamic version of the primal-dual method for optimization problems, and apply it to obtain the following results. (1) For the dynamic set-cover problem, we maintain an O ( f 2)-approximately optimal solution in O ( f · log(m + n)) amortized update time, where f is the maximum “frequency” of an element, n is the number of sets, and m is the maximum number of elements in the universe at any point in time. (2) For the dynamic b-matching problem, we maintain an O (1)-approximately optimal solution in O (log3 n) amortized update time, where n is the number of nodes in the graph."}],"issue":"08","date_published":"2018-08-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.ic.2018.02.005"}],"date_updated":"2023-02-10T07:27:39Z","citation":{"chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe Italiano. “Dynamic Algorithms via the Primal-Dual Method.” <i>Information and Computation</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.ic.2018.02.005\">https://doi.org/10.1016/j.ic.2018.02.005</a>.","ista":"Bhattacharya S, Henzinger MH, Italiano G. 2018. Dynamic algorithms via the primal-dual method. Information and Computation. 261(08), 219–239.","mla":"Bhattacharya, Sayan, et al. “Dynamic Algorithms via the Primal-Dual Method.” <i>Information and Computation</i>, vol. 261, no. 08, Elsevier, 2018, pp. 219–39, doi:<a href=\"https://doi.org/10.1016/j.ic.2018.02.005\">10.1016/j.ic.2018.02.005</a>.","ieee":"S. Bhattacharya, M. H. Henzinger, and G. Italiano, “Dynamic algorithms via the primal-dual method,” <i>Information and Computation</i>, vol. 261, no. 08. Elsevier, pp. 219–239, 2018.","short":"S. Bhattacharya, M.H. Henzinger, G. Italiano, Information and Computation 261 (2018) 219–239.","apa":"Bhattacharya, S., Henzinger, M. H., &#38; Italiano, G. (2018). Dynamic algorithms via the primal-dual method. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2018.02.005\">https://doi.org/10.1016/j.ic.2018.02.005</a>","ama":"Bhattacharya S, Henzinger MH, Italiano G. Dynamic algorithms via the primal-dual method. <i>Information and Computation</i>. 2018;261(08):219-239. doi:<a href=\"https://doi.org/10.1016/j.ic.2018.02.005\">10.1016/j.ic.2018.02.005</a>"},"oa_version":"Published Version","publication_identifier":{"issn":["0890-5401"]},"type":"journal_article","volume":261,"year":"2018","scopus_import":"1"},{"intvolume":"        65","article_processing_charge":"No","quality_controlled":"1","external_id":{"arxiv":["1512.08148"]},"oa":1,"language":[{"iso":"eng"}],"article_type":"original","month":"12","day":"01","publication":"Journal of the ACM","related_material":{"record":[{"status":"public","id":"11855","relation":"earlier_version"}]},"page":"1-40","status":"public","date_created":"2022-08-08T12:33:17Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11768","doi":"10.1145/3218657","arxiv":1,"publisher":"Association for Computing Machinery","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"full_name":"Nanongkai, Danupon","first_name":"Danupon","last_name":"Nanongkai"}],"publication_status":"published","citation":{"apa":"Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2018). Decremental single-source shortest paths on undirected graphs in near-linear total update time. <i>Journal of the ACM</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3218657\">https://doi.org/10.1145/3218657</a>","ama":"Henzinger MH, Krinninger S, Nanongkai D. Decremental single-source shortest paths on undirected graphs in near-linear total update time. <i>Journal of the ACM</i>. 2018;65(6):1-40. doi:<a href=\"https://doi.org/10.1145/3218657\">10.1145/3218657</a>","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source shortest paths on undirected graphs in near-linear total update time,” <i>Journal of the ACM</i>, vol. 65, no. 6. Association for Computing Machinery, pp. 1–40, 2018.","mla":"Henzinger, Monika H., et al. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” <i>Journal of the ACM</i>, vol. 65, no. 6, Association for Computing Machinery, 2018, pp. 1–40, doi:<a href=\"https://doi.org/10.1145/3218657\">10.1145/3218657</a>.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, Journal of the ACM 65 (2018) 1–40.","ista":"Henzinger MH, Krinninger S, Nanongkai D. 2018. Decremental single-source shortest paths on undirected graphs in near-linear total update time. Journal of the ACM. 65(6), 1–40.","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” <i>Journal of the ACM</i>. Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3218657\">https://doi.org/10.1145/3218657</a>."},"oa_version":"Preprint","scopus_import":"1","year":"2018","volume":65,"type":"journal_article","publication_identifier":{"eissn":["1557-735X"],"issn":["0004-5411"]},"abstract":[{"lang":"eng","text":"In the decremental single-source shortest paths (SSSP) problem, we want to maintain the distances between a given source node s and every other node in an n-node m-edge graph G undergoing edge deletions. While its static counterpart can be solved in near-linear time, this decremental problem is much more challenging even in the undirected unweighted case. In this case, the classic O(mn) total update time of Even and Shiloach [16] has been the fastest known algorithm for three decades. At the cost of a (1+ϵ)-approximation factor, the running time was recently improved to n2+o(1) by Bernstein and Roditty [9]. In this article, we bring the running time down to near-linear: We give a (1+ϵ)-approximation algorithm with m1+o(1) expected total update time, thus obtaining near-linear time. Moreover, we obtain m1+o(1) log W time for the weighted case, where the edge weights are integers from 1 to W. The only prior work on weighted graphs in o(mn) time is the mn0.9 + o(1)-time algorithm by Henzinger et al. [18, 19], which works for directed graphs with quasi-polynomial edge weights. The expected running time bound of our algorithm holds against an oblivious adversary.\r\n\r\nIn contrast to the previous results, which rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called sparse (h, ϵ)-hop set introduced by Cohen [12] in the PRAM literature. An (h, ϵ)-hop set of a graph G=(V, E) is a set F of weighted edges such that the distance between any pair of nodes in G can be (1+ϵ)-approximated by their h-hop distance (given by a path containing at most h edges) on G′=(V, E ∪ F). Our algorithm can maintain an (no(1), ϵ)-hop set of near-linear size in near-linear time under edge deletions. It is the first of its kind to the best of our knowledge. To maintain approximate distances using this hop set, we extend the monotone Even-Shiloach tree of Henzinger et al. [20] and combine it with the bounded-hop SSSP technique of Bernstein [4, 5] and Mądry [27]. These two new tools might be of independent interest."}],"title":"Decremental single-source shortest paths on undirected graphs in near-linear total update time","date_updated":"2023-02-21T16:30:41Z","main_file_link":[{"url":"https://arxiv.org/abs/1512.08148","open_access":"1"}],"date_published":"2018-12-01T00:00:00Z","issue":"6"},{"arxiv":1,"alternative_title":["LIPIcs"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.4230/LIPICS.ESA.2018.39","author":[{"last_name":"Goranci","first_name":"Gramoz ","full_name":"Goranci, Gramoz "},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H"},{"first_name":"Dariusz","last_name":"Leniowski","full_name":"Leniowski, Dariusz"}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11827","extern":"1","article_number":"39","title":"A tree structure for dynamic facility location","abstract":[{"text":"We study the metric facility location problem with client insertions and deletions. This setting differs from the classic dynamic facility location problem, where the set of clients remains the same, but the metric space can change over time. We show a deterministic algorithm that maintains a constant factor approximation to the optimal solution in worst-case time O~(2^{O(kappa^2)}) per client insertion or deletion in metric spaces while answering queries about the cost in O(1) time, where kappa denotes the doubling dimension of the metric. For metric spaces with bounded doubling dimension, the update time is polylogarithmic in the parameters of the problem.","lang":"eng"}],"date_published":"2018-08-14T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ESA.2018.39","open_access":"1"}],"date_updated":"2023-02-16T10:50:51Z","oa_version":"Published Version","citation":{"ieee":"G. Goranci, M. H. Henzinger, and D. Leniowski, “A tree structure for dynamic facility location,” in <i>26th Annual European Symposium on Algorithms</i>, Helsinki, Finland, 2018, vol. 112.","mla":"Goranci, Gramoz, et al. “A Tree Structure for Dynamic Facility Location.” <i>26th Annual European Symposium on Algorithms</i>, vol. 112, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.39\">10.4230/LIPICS.ESA.2018.39</a>.","short":"G. Goranci, M.H. Henzinger, D. Leniowski, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","apa":"Goranci, G., Henzinger, M. H., &#38; Leniowski, D. (2018). A tree structure for dynamic facility location. In <i>26th Annual European Symposium on Algorithms</i> (Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.39\">https://doi.org/10.4230/LIPICS.ESA.2018.39</a>","ama":"Goranci G, Henzinger MH, Leniowski D. A tree structure for dynamic facility location. In: <i>26th Annual European Symposium on Algorithms</i>. Vol 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.39\">10.4230/LIPICS.ESA.2018.39</a>","chicago":"Goranci, Gramoz , Monika H Henzinger, and Dariusz Leniowski. “A Tree Structure for Dynamic Facility Location.” In <i>26th Annual European Symposium on Algorithms</i>, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.39\">https://doi.org/10.4230/LIPICS.ESA.2018.39</a>.","ista":"Goranci G, Henzinger MH, Leniowski D. 2018. A tree structure for dynamic facility location. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 39."},"type":"conference","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959770811"]},"scopus_import":"1","year":"2018","volume":112,"external_id":{"arxiv":["1909.06653"]},"oa":1,"quality_controlled":"1","article_processing_charge":"No","intvolume":"       112","conference":{"location":"Helsinki, Finland","start_date":"2018-08-20","end_date":"2018-08-22","name":"ESA: Annual European Symposium on Algorithms"},"publication":"26th Annual European Symposium on Algorithms","day":"14","date_created":"2022-08-12T08:20:57Z","status":"public","language":[{"iso":"eng"}],"month":"08"},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","arxiv":1,"alternative_title":["LIPIcs"],"doi":"10.4230/LIPICS.ESA.2018.40","author":[{"first_name":"Gramoz","last_name":"Goranci","full_name":"Goranci, Gramoz"},{"last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Peng, Pan","first_name":"Pan","last_name":"Peng"}],"publication_status":"published","_id":"11828","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","title":"Dynamic effective resistances and approximate schur complement on separable graphs","article_number":"40","abstract":[{"lang":"eng","text":"We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that admit an n^{c}-separator theorem for some c<1. We give a fully dynamic algorithm that maintains (1+epsilon)-approximations of the all-pairs effective resistances of an n-vertex graph G undergoing edge insertions and deletions with O~(sqrt{n}/epsilon^2) worst-case update time and O~(sqrt{n}/epsilon^2) worst-case query time, if G is guaranteed to be sqrt{n}-separable (i.e., it is taken from a class satisfying a sqrt{n}-separator theorem) and its separator can be computed in O~(n) time. Our algorithm is built upon a dynamic algorithm for maintaining approximate Schur complement that approximately preserves pairwise effective resistances among a set of terminals for separable graphs, which might be of independent interest.\r\nWe complement our result by proving that for any two fixed vertices s and t, no incremental or decremental algorithm can maintain the s-t effective resistance for sqrt{n}-separable graphs with worst-case update time O(n^{1/2-delta}) and query time O(n^{1-delta}) for any delta>0, unless the Online Matrix Vector Multiplication (OMv) conjecture is false.\r\nWe further show that for general graphs, no incremental or decremental algorithm can maintain the s-t effective resistance problem with worst-case update time O(n^{1-delta}) and query-time O(n^{2-delta}) for any delta >0, unless the OMv conjecture is false."}],"main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ESA.2018.40","open_access":"1"}],"date_published":"2018-08-14T00:00:00Z","date_updated":"2023-02-16T11:08:08Z","citation":{"apa":"Goranci, G., Henzinger, M. H., &#38; Peng, P. (2018). Dynamic effective resistances and approximate schur complement on separable graphs. In <i>26th Annual European Symposium on Algorithms</i> (Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.40\">https://doi.org/10.4230/LIPICS.ESA.2018.40</a>","ama":"Goranci G, Henzinger MH, Peng P. Dynamic effective resistances and approximate schur complement on separable graphs. In: <i>26th Annual European Symposium on Algorithms</i>. Vol 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.40\">10.4230/LIPICS.ESA.2018.40</a>","mla":"Goranci, Gramoz, et al. “Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.” <i>26th Annual European Symposium on Algorithms</i>, vol. 112, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.40\">10.4230/LIPICS.ESA.2018.40</a>.","ieee":"G. Goranci, M. H. Henzinger, and P. Peng, “Dynamic effective resistances and approximate schur complement on separable graphs,” in <i>26th Annual European Symposium on Algorithms</i>, Helsinki, Finland, 2018, vol. 112.","short":"G. Goranci, M.H. Henzinger, P. Peng, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ista":"Goranci G, Henzinger MH, Peng P. 2018. Dynamic effective resistances and approximate schur complement on separable graphs. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 40.","chicago":"Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.” In <i>26th Annual European Symposium on Algorithms</i>, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.40\">https://doi.org/10.4230/LIPICS.ESA.2018.40</a>."},"oa_version":"Published Version","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959770811"]},"type":"conference","volume":112,"year":"2018","scopus_import":"1","external_id":{"arxiv":["1802.09111"]},"oa":1,"article_processing_charge":"No","quality_controlled":"1","intvolume":"       112","publication":"26th Annual European Symposium on Algorithms","conference":{"start_date":"2018-08-20","location":"Helsinki, Finland","end_date":"2018-08-22","name":"ESA: Annual European Symposium on Algorithms"},"day":"14","date_created":"2022-08-12T08:26:42Z","status":"public","language":[{"iso":"eng"}],"month":"08"},{"page":"1 - 20","publication":"29th Annual ACM-SIAM Symposium on Discrete Algorithms","conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"2018-01-10","start_date":"2018-01-07","location":"New Orleans, LA, United States"},"day":"01","date_created":"2022-08-16T12:07:14Z","status":"public","language":[{"iso":"eng"}],"month":"01","external_id":{"arxiv":["1711.04355"]},"oa":1,"quality_controlled":"1","article_processing_charge":"No","title":"Dynamic algorithms for graph coloring","abstract":[{"lang":"eng","text":"We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for (Δ + 1)- vertex coloring and (2Δ – 1)-edge coloring in a graph with maximum degree Δ. It is natural to ask if we can efficiently maintain such colorings in the dynamic setting as well. We get the following three results. (1) We present a randomized algorithm which maintains a (Δ + 1)-vertex coloring with O(log Δ) expected amortized update time. (2) We present a deterministic algorithm which maintains a (1 + o(1)Δ-vertex coloring with O(polylog Δ) amortized update time. (3) We present a simple, deterministic algorithm which maintains a (2Δ – 1)-edge coloring with O(log Δ) worst-case update time. This improves the recent O(Δ)-edge coloring algorithm with  worst-case update time [4]."}],"date_published":"2018-01-01T00:00:00Z","main_file_link":[{"url":"https://arxiv.org/abs/1711.04355","open_access":"1"}],"date_updated":"2023-02-17T11:39:01Z","oa_version":"Preprint","citation":{"ista":"Bhattacharya S, Chakrabarty D, Henzinger MH, Nanongkai D. 2018. Dynamic algorithms for graph coloring. 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1–20.","chicago":"Bhattacharya, Sayan, Deeparnab Chakrabarty, Monika H Henzinger, and Danupon Nanongkai. “Dynamic Algorithms for Graph Coloring.” In <i>29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1–20. Society for Industrial and Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/1.9781611975031.1\">https://doi.org/10.1137/1.9781611975031.1</a>.","apa":"Bhattacharya, S., Chakrabarty, D., Henzinger, M. H., &#38; Nanongkai, D. (2018). Dynamic algorithms for graph coloring. In <i>29th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1–20). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611975031.1\">https://doi.org/10.1137/1.9781611975031.1</a>","ama":"Bhattacharya S, Chakrabarty D, Henzinger MH, Nanongkai D. Dynamic algorithms for graph coloring. In: <i>29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2018:1-20. doi:<a href=\"https://doi.org/10.1137/1.9781611975031.1\">10.1137/1.9781611975031.1</a>","short":"S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, D. Nanongkai, in:, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2018, pp. 1–20.","mla":"Bhattacharya, Sayan, et al. “Dynamic Algorithms for Graph Coloring.” <i>29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2018, pp. 1–20, doi:<a href=\"https://doi.org/10.1137/1.9781611975031.1\">10.1137/1.9781611975031.1</a>.","ieee":"S. Bhattacharya, D. Chakrabarty, M. H. Henzinger, and D. Nanongkai, “Dynamic algorithms for graph coloring,” in <i>29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, New Orleans, LA, United States, 2018, pp. 1–20."},"publication_identifier":{"eisbn":["978-161197503-1"]},"type":"conference","year":"2018","scopus_import":"1","publisher":"Society for Industrial and Applied Mathematics","arxiv":1,"doi":"10.1137/1.9781611975031.1","author":[{"full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya","first_name":"Sayan"},{"first_name":"Deeparnab","last_name":"Chakrabarty","full_name":"Chakrabarty, Deeparnab"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"publication_status":"published","_id":"11872","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1"},{"external_id":{"arxiv":["1708.06127"]},"oa":1,"article_processing_charge":"No","quality_controlled":"1","day":"01","page":"48-61","publication":"20th Workshop on Algorithm Engineering and Experiments","conference":{"end_date":"2018-01-08","name":"ALENEX: Symposium on Algorithm Engineering and Experiments","location":"New Orleans, LA, United States","start_date":"2018-01-07"},"status":"public","date_created":"2022-08-17T07:04:57Z","language":[{"iso":"eng"}],"month":"01","doi":"10.1137/1.9781611975055.5","publisher":"Society for Industrial and Applied Mathematics","arxiv":1,"author":[{"first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Alexander","last_name":"Noe","full_name":"Noe, Alexander"},{"first_name":"Christian","last_name":"Schulz","full_name":"Schulz, Christian"},{"last_name":"Strash","first_name":"Darren","full_name":"Strash, Darren"}],"publication_status":"published","extern":"1","_id":"11882","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi's contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory parallel implementations of our algorithm. Extensive experiments on both real-world and generated instances show that our algorithm finds the optimal cut on nearly all instances significantly faster than other state-of-the-art exact algorithms, and our error rate is lower than that of other heuristic algorithms. In addition, our parallel algorithm shows good scalability."}],"title":"Practical minimum cut algorithms","date_updated":"2023-02-17T14:03:39Z","date_published":"2018-01-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.06127"}],"citation":{"chicago":"Henzinger, Monika H, Alexander Noe, Christian Schulz, and Darren Strash. “Practical Minimum Cut Algorithms.” In <i>20th Workshop on Algorithm Engineering and Experiments</i>, 48–61. Society for Industrial and Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/1.9781611975055.5\">https://doi.org/10.1137/1.9781611975055.5</a>.","ista":"Henzinger MH, Noe A, Schulz C, Strash D. 2018. Practical minimum cut algorithms. 20th Workshop on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 48–61.","short":"M.H. Henzinger, A. Noe, C. Schulz, D. Strash, in:, 20th Workshop on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2018, pp. 48–61.","mla":"Henzinger, Monika H., et al. “Practical Minimum Cut Algorithms.” <i>20th Workshop on Algorithm Engineering and Experiments</i>, Society for Industrial and Applied Mathematics, 2018, pp. 48–61, doi:<a href=\"https://doi.org/10.1137/1.9781611975055.5\">10.1137/1.9781611975055.5</a>.","ieee":"M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Practical minimum cut algorithms,” in <i>20th Workshop on Algorithm Engineering and Experiments</i>, New Orleans, LA, United States, 2018, pp. 48–61.","ama":"Henzinger MH, Noe A, Schulz C, Strash D. Practical minimum cut algorithms. In: <i>20th Workshop on Algorithm Engineering and Experiments</i>. Society for Industrial and Applied Mathematics; 2018:48-61. doi:<a href=\"https://doi.org/10.1137/1.9781611975055.5\">10.1137/1.9781611975055.5</a>","apa":"Henzinger, M. H., Noe, A., Schulz, C., &#38; Strash, D. (2018). Practical minimum cut algorithms. In <i>20th Workshop on Algorithm Engineering and Experiments</i> (pp. 48–61). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611975055.5\">https://doi.org/10.1137/1.9781611975055.5</a>"},"oa_version":"Preprint","year":"2018","scopus_import":"1","publication_identifier":{"eisbn":["978-1-61197-505-5"]},"type":"conference"},{"doi":"10.1137/140998925","arxiv":1,"publisher":"Society for Industrial & Applied Mathematics","publication_status":"published","author":[{"last_name":"Bhattacharya","first_name":"Sayan","full_name":"Bhattacharya, Sayan"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger"},{"full_name":"Italiano, Giuseppe F.","first_name":"Giuseppe F.","last_name":"Italiano"}],"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11890","abstract":[{"lang":"eng","text":"We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph 𝐺=(𝑉,𝐸), with |𝑉|=𝑛 and |𝐸|=𝑚, in 𝑜(𝑚‾‾√) time per update. In particular, for minimum vertex cover, we provide deterministic data structures for maintaining a (2+𝜖) approximation in 𝑂(log𝑛/𝜖2) amortized time per update. For maximum matching, we show how to maintain a (3+𝜖) approximation in 𝑂(min(𝑛√/𝜖,𝑚1/3/𝜖2) amortized time per update and a (4+𝜖) approximation in 𝑂(𝑚1/3/𝜖2) worst-case time per update. Our data structure for fully dynamic minimum vertex cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld [in 42nd ACM Symposium on Theory of Computing, Cambridge, MA, ACM, 2010, pp. 457--464]."}],"title":"Deterministic fully dynamic data structures for vertex cover and matching","date_updated":"2023-02-21T16:31:30Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1412.1318"}],"date_published":"2018-05-01T00:00:00Z","issue":"3","citation":{"ista":"Bhattacharya S, Henzinger MH, Italiano GF. 2018. Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. 47(3), 859–887.","chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/140998925\">https://doi.org/10.1137/140998925</a>.","ama":"Bhattacharya S, Henzinger MH, Italiano GF. Deterministic fully dynamic data structures for vertex cover and matching. <i>SIAM Journal on Computing</i>. 2018;47(3):859-887. doi:<a href=\"https://doi.org/10.1137/140998925\">10.1137/140998925</a>","apa":"Bhattacharya, S., Henzinger, M. H., &#38; Italiano, G. F. (2018). Deterministic fully dynamic data structures for vertex cover and matching. <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics. <a href=\"https://doi.org/10.1137/140998925\">https://doi.org/10.1137/140998925</a>","short":"S. Bhattacharya, M.H. Henzinger, G.F. Italiano, SIAM Journal on Computing 47 (2018) 859–887.","mla":"Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” <i>SIAM Journal on Computing</i>, vol. 47, no. 3, Society for Industrial &#38; Applied Mathematics, 2018, pp. 859–87, doi:<a href=\"https://doi.org/10.1137/140998925\">10.1137/140998925</a>.","ieee":"S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” <i>SIAM Journal on Computing</i>, vol. 47, no. 3. Society for Industrial &#38; Applied Mathematics, pp. 859–887, 2018."},"oa_version":"Preprint","scopus_import":"1","volume":47,"year":"2018","type":"journal_article","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"external_id":{"arxiv":["1412.1318"]},"oa":1,"intvolume":"        47","quality_controlled":"1","article_processing_charge":"No","day":"01","publication":"SIAM Journal on Computing","related_material":{"record":[{"id":"11875","relation":"earlier_version","status":"public"}]},"page":"859-887","status":"public","date_created":"2022-08-17T08:21:23Z","language":[{"iso":"eng"}],"month":"05","article_type":"original"},{"_id":"11911","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","alternative_title":["LIPIcs"],"arxiv":1,"doi":"10.4230/LIPICS.SEA.2018.3","author":[{"full_name":"Biedermann, Sonja","last_name":"Biedermann","first_name":"Sonja"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger"},{"full_name":"Schulz, Christian","last_name":"Schulz","first_name":"Christian"},{"first_name":"Bernhard","last_name":"Schuster","full_name":"Schuster, Bernhard"}],"publication_status":"published","oa_version":"Published Version","citation":{"ista":"Biedermann S, Henzinger MH, Schulz C, Schuster B. 2018. Memetic graph clustering. 17th International Symposium on Experimental Algorithms. SEA: Symposium on Experimental Algorithms, LIPIcs, vol. 103, 3.","chicago":"Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster. “Memetic Graph Clustering.” In <i>17th International Symposium on Experimental Algorithms</i>, Vol. 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPICS.SEA.2018.3\">https://doi.org/10.4230/LIPICS.SEA.2018.3</a>.","apa":"Biedermann, S., Henzinger, M. H., Schulz, C., &#38; Schuster, B. (2018). Memetic graph clustering. In <i>17th International Symposium on Experimental Algorithms</i> (Vol. 103). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.SEA.2018.3\">https://doi.org/10.4230/LIPICS.SEA.2018.3</a>","ama":"Biedermann S, Henzinger MH, Schulz C, Schuster B. Memetic graph clustering. In: <i>17th International Symposium on Experimental Algorithms</i>. Vol 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPICS.SEA.2018.3\">10.4230/LIPICS.SEA.2018.3</a>","short":"S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, 17th International Symposium on Experimental Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ieee":"S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Memetic graph clustering,” in <i>17th International Symposium on Experimental Algorithms</i>, L’Aquila, Italy, 2018, vol. 103.","mla":"Biedermann, Sonja, et al. “Memetic Graph Clustering.” <i>17th International Symposium on Experimental Algorithms</i>, vol. 103, 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPICS.SEA.2018.3\">10.4230/LIPICS.SEA.2018.3</a>."},"publication_identifier":{"isbn":["9783959770705"],"issn":["1868-8969"]},"type":"conference","year":"2018","volume":103,"scopus_import":"1","title":"Memetic graph clustering","article_number":"3","abstract":[{"text":"It is common knowledge that there is no single best strategy for graph clustering, which justifies a plethora of existing approaches. In this paper, we present a general memetic algorithm, VieClus, to tackle the graph clustering problem. This algorithm can be adapted to optimize different objective functions. A key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multi-level techniques. Lastly, we combine these techniques with a scalable communication protocol, producing a system that is able to compute high-quality solutions in a short amount of time. We instantiate our scheme with local search for modularity and show that our algorithm successfully improves or reproduces all entries of the 10th DIMACS implementation challenge under consideration using a small amount of time.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPICS.SEA.2018.3"}],"date_published":"2018-07-01T00:00:00Z","date_updated":"2023-02-16T11:45:14Z","article_processing_charge":"No","quality_controlled":"1","intvolume":"       103","external_id":{"arxiv":["1802.07034"]},"oa":1,"language":[{"iso":"eng"}],"month":"07","conference":{"name":"SEA: Symposium on Experimental Algorithms","end_date":"2018-07-29","start_date":"2018-07-27","location":"L'Aquila, Italy"},"publication":"17th International Symposium on Experimental Algorithms","day":"01","date_created":"2022-08-18T06:49:40Z","status":"public"},{"extern":"1","_id":"11958","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1,"doi":"10.1002/anie.201712568","publisher":"Wiley","publication_status":"published","author":[{"orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus","last_name":"Pieber"},{"full_name":"Shalom, Menny","first_name":"Menny","last_name":"Shalom"},{"full_name":"Antonietti, Markus","last_name":"Antonietti","first_name":"Markus"},{"first_name":"Peter H.","last_name":"Seeberger","full_name":"Seeberger, Peter H."},{"full_name":"Gilmore, Kerry","last_name":"Gilmore","first_name":"Kerry"}],"citation":{"chicago":"Pieber, Bartholomäus, Menny Shalom, Markus Antonietti, Peter H. Seeberger, and Kerry Gilmore. “Continuous Heterogeneous Photocatalysis in Serial Micro-Batch Reactors.” <i>Angewandte Chemie International Edition</i>. Wiley, 2018. <a href=\"https://doi.org/10.1002/anie.201712568\">https://doi.org/10.1002/anie.201712568</a>.","ista":"Pieber B, Shalom M, Antonietti M, Seeberger PH, Gilmore K. 2018. Continuous heterogeneous photocatalysis in serial micro-batch reactors. Angewandte Chemie International Edition. 57(31), 9976–9979.","mla":"Pieber, Bartholomäus, et al. “Continuous Heterogeneous Photocatalysis in Serial Micro-Batch Reactors.” <i>Angewandte Chemie International Edition</i>, vol. 57, no. 31, Wiley, 2018, pp. 9976–79, doi:<a href=\"https://doi.org/10.1002/anie.201712568\">10.1002/anie.201712568</a>.","ieee":"B. Pieber, M. Shalom, M. Antonietti, P. H. Seeberger, and K. Gilmore, “Continuous heterogeneous photocatalysis in serial micro-batch reactors,” <i>Angewandte Chemie International Edition</i>, vol. 57, no. 31. Wiley, pp. 9976–9979, 2018.","short":"B. Pieber, M. Shalom, M. Antonietti, P.H. Seeberger, K. Gilmore, Angewandte Chemie International Edition 57 (2018) 9976–9979.","apa":"Pieber, B., Shalom, M., Antonietti, M., Seeberger, P. H., &#38; Gilmore, K. (2018). Continuous heterogeneous photocatalysis in serial micro-batch reactors. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.201712568\">https://doi.org/10.1002/anie.201712568</a>","ama":"Pieber B, Shalom M, Antonietti M, Seeberger PH, Gilmore K. Continuous heterogeneous photocatalysis in serial micro-batch reactors. <i>Angewandte Chemie International Edition</i>. 2018;57(31):9976-9979. doi:<a href=\"https://doi.org/10.1002/anie.201712568\">10.1002/anie.201712568</a>"},"oa_version":"None","year":"2018","volume":57,"scopus_import":"1","publication_identifier":{"eissn":[" 1521-3773"],"issn":["1433-7851"]},"type":"journal_article","abstract":[{"lang":"eng","text":"Solid reagents, leaching catalysts, and heterogeneous photocatalysts are commonly employed in batch processes but are ill-suited for continuous-flow chemistry. Heterogeneous catalysts for thermal reactions are typically used in packed-bed reactors, which cannot be penetrated by light and thus are not suitable for photocatalytic reactions involving solids. We demonstrate that serial micro-batch reactors (SMBRs) allow for the continuous utilization of solid materials together with liquids and gases in flow. This technology was utilized to develop selective and efficient fluorination reactions using a modified graphitic carbon nitride heterogeneous catalyst instead of costly homogeneous metal polypyridyl complexes. The merger of this inexpensive, recyclable catalyst and the SMBR approach enables sustainable and scalable photocatalysis."}],"title":"Continuous heterogeneous photocatalysis in serial micro-batch reactors","date_updated":"2023-02-21T10:09:18Z","issue":"31","date_published":"2018-07-26T00:00:00Z","intvolume":"        57","article_processing_charge":"No","quality_controlled":"1","external_id":{"pmid":["29377383"]},"language":[{"iso":"eng"}],"month":"07","article_type":"letter_note","day":"26","page":"9976-9979","publication":"Angewandte Chemie International Edition","status":"public","date_created":"2022-08-24T10:57:25Z"},{"pubrep_id":"1037","month":"08","language":[{"iso":"eng"}],"status":"public","date_created":"2018-12-11T11:44:09Z","day":"04","related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/interactive-software-tool-makes-complex-mold-design-simple/"}]},"publication":"ACM Transaction on Graphics","intvolume":"        37","article_processing_charge":"No","quality_controlled":"1","file_date_updated":"2020-07-14T12:44:38Z","oa":1,"publist_id":"8044","has_accepted_license":"1","isi":1,"external_id":{"isi":["000448185000096"]},"file":[{"date_created":"2018-12-12T10:18:38Z","file_name":"IST-2018-1037-v1+1_CoreCavity-AuthorVersion.pdf","access_level":"open_access","file_size":104225664,"date_updated":"2020-07-14T12:44:38Z","checksum":"6a5368bc86c4e1a9fcfe588fd1f14ee8","file_id":"5360","content_type":"application/pdf","creator":"system","relation":"main_file"},{"file_size":377743553,"access_level":"open_access","date_created":"2018-12-12T10:18:39Z","file_name":"IST-2018-1037-v1+2_CoreCavity-Supplemental.zip","file_id":"5361","checksum":"3861e693ba47c51f3ec7b7867d573a61","date_updated":"2020-07-14T12:44:38Z","creator":"system","content_type":"application/zip","relation":"main_file"},{"creator":"system","content_type":"video/vnd.objectvideo","file_id":"5362","checksum":"490040c685ed869536e2a18f5a906b94","date_updated":"2020-07-14T12:44:38Z","file_size":162634396,"file_name":"IST-2018-1037-v1+3_CoreCavity-Video.mp4","access_level":"open_access","date_created":"2018-12-12T10:18:41Z","relation":"main_file"},{"creator":"system","content_type":"image/jpeg","file_id":"5363","date_updated":"2020-07-14T12:44:38Z","checksum":"be7fc8b229adda727419b6504b3b9352","file_size":527972,"date_created":"2018-12-12T10:18:42Z","access_level":"open_access","file_name":"IST-2018-1037-v1+4_CoreCavity-RepresentativeImage.jpg","relation":"main_file"}],"volume":37,"year":"2018","scopus_import":"1","type":"journal_article","oa_version":"Submitted Version","citation":{"short":"K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, B. Bickel, ACM Transaction on Graphics 37 (2018).","mla":"Nakashima, Kazutaka, et al. “CoreCavity: Interactive Shell Decomposition for Fabrication with Two-Piece Rigid Molds.” <i>ACM Transaction on Graphics</i>, vol. 37, no. 4, 135, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3197517.3201341\">10.1145/3197517.3201341</a>.","ieee":"K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, and B. Bickel, “CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds,” <i>ACM Transaction on Graphics</i>, vol. 37, no. 4. ACM, 2018.","ama":"Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. <i>ACM Transaction on Graphics</i>. 2018;37(4). doi:<a href=\"https://doi.org/10.1145/3197517.3201341\">10.1145/3197517.3201341</a>","apa":"Nakashima, K., Auzinger, T., Iarussi, E., Zhang, R., Igarashi, T., &#38; Bickel, B. (2018). CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. <i>ACM Transaction on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/3197517.3201341\">https://doi.org/10.1145/3197517.3201341</a>","chicago":"Nakashima, Kazutaka, Thomas Auzinger, Emmanuel Iarussi, Ran Zhang, Takeo Igarashi, and Bernd Bickel. “CoreCavity: Interactive Shell Decomposition for Fabrication with Two-Piece Rigid Molds.” <i>ACM Transaction on Graphics</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3197517.3201341\">https://doi.org/10.1145/3197517.3201341</a>.","ista":"Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. 2018. CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. ACM Transaction on Graphics. 37(4), 135."},"date_updated":"2023-09-11T12:48:09Z","ddc":["004","516","670"],"issue":"4","date_published":"2018-08-04T00:00:00Z","abstract":[{"text":"Molding is a popular mass production method, in which the initial expenses for the mold are offset by the low per-unit production cost. However, the physical fabrication constraints of the molding technique commonly restrict the shape of moldable objects. For a complex shape, a decomposition of the object into moldable parts is a common strategy to address these constraints, with plastic model kits being a popular and illustrative example. However, conducting such a decomposition requires considerable expertise, and it depends on the technical aspects of the fabrication technique, as well as aesthetic considerations. We present an interactive technique to create such decompositions for two-piece molding, in which each part of the object is cast between two rigid mold pieces. Given the surface description of an object, we decompose its thin-shell equivalent into moldable parts by first performing a coarse decomposition and then utilizing an active contour model for the boundaries between individual parts. Formulated as an optimization problem, the movement of the contours is guided by an energy reflecting fabrication constraints to ensure the moldability of each part. Simultaneously, the user is provided with editing capabilities to enforce aesthetic guidelines. Our interactive interface provides control of the contour positions by allowing, for example, the alignment of part boundaries with object features. Our technique enables a novel workflow, as it empowers novice users to explore the design space, and it generates fabrication-ready two-piece molds that can be used either for casting or industrial injection molding of free-form objects.","lang":"eng"}],"article_number":"135","title":"CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds","project":[{"call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"},{"_id":"2508E324-B435-11E9-9278-68D0E5697425","name":"Distributed 3D Object Design","grant_number":"642841","call_identifier":"H2020"}],"_id":"12","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"BeBi"}],"author":[{"full_name":"Nakashima, Kazutaka","last_name":"Nakashima","first_name":"Kazutaka"},{"first_name":"Thomas","last_name":"Auzinger","orcid":"0000-0002-1546-3265","full_name":"Auzinger, Thomas","id":"4718F954-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Iarussi","first_name":"Emmanuel","id":"33F19F16-F248-11E8-B48F-1D18A9856A87","full_name":"Iarussi, Emmanuel"},{"last_name":"Zhang","first_name":"Ran","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3808-281X","full_name":"Zhang, Ran"},{"last_name":"Igarashi","first_name":"Takeo","full_name":"Igarashi, Takeo"},{"first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","doi":"10.1145/3197517.3201341","publisher":"ACM","ec_funded":1},{"project":[{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","grant_number":"692692","name":"Biophysics and circuit function of a giant cortical glumatergic synapse","call_identifier":"H2020"},{"_id":"25C5A090-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z00312","call_identifier":"FWF"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"21","publication_status":"published","author":[{"last_name":"Espinoza Martinez","first_name":"Claudia ","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","full_name":"Espinoza Martinez, Claudia ","orcid":"0000-0003-4710-2082"},{"id":"30CC5506-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2209-5242","full_name":"Guzmán, José","last_name":"Guzmán","first_name":"José"},{"last_name":"Zhang","first_name":"Xiaomin","id":"423EC9C2-F248-11E8-B48F-1D18A9856A87","full_name":"Zhang, Xiaomin"},{"full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","last_name":"Jonas"}],"department":[{"_id":"PeJo"}],"ec_funded":1,"publisher":"Nature Publishing Group","doi":"10.1038/s41467-018-06899-3","type":"journal_article","scopus_import":"1","year":"2018","volume":9,"oa_version":"Published Version","citation":{"chicago":"Espinoza Martinez, Claudia , José Guzmán, Xiaomin Zhang, and Peter M Jonas. “Parvalbumin+ Interneurons Obey Unique Connectivity Rules and Establish a Powerful Lateral-Inhibition Microcircuit in Dentate Gyrus.” <i>Nature Communications</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41467-018-06899-3\">https://doi.org/10.1038/s41467-018-06899-3</a>.","ista":"Espinoza Martinez C, Guzmán J, Zhang X, Jonas PM. 2018. Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus. Nature Communications. 9(1), 4605.","mla":"Espinoza Martinez, Claudia, et al. “Parvalbumin+ Interneurons Obey Unique Connectivity Rules and Establish a Powerful Lateral-Inhibition Microcircuit in Dentate Gyrus.” <i>Nature Communications</i>, vol. 9, no. 1, 4605, Nature Publishing Group, 2018, doi:<a href=\"https://doi.org/10.1038/s41467-018-06899-3\">10.1038/s41467-018-06899-3</a>.","ieee":"C. Espinoza Martinez, J. Guzmán, X. Zhang, and P. M. Jonas, “Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus,” <i>Nature Communications</i>, vol. 9, no. 1. Nature Publishing Group, 2018.","short":"C. Espinoza Martinez, J. Guzmán, X. Zhang, P.M. Jonas, Nature Communications 9 (2018).","apa":"Espinoza Martinez, C., Guzmán, J., Zhang, X., &#38; Jonas, P. M. (2018). Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41467-018-06899-3\">https://doi.org/10.1038/s41467-018-06899-3</a>","ama":"Espinoza Martinez C, Guzmán J, Zhang X, Jonas PM. Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus. <i>Nature Communications</i>. 2018;9(1). doi:<a href=\"https://doi.org/10.1038/s41467-018-06899-3\">10.1038/s41467-018-06899-3</a>"},"date_published":"2018-11-02T00:00:00Z","issue":"1","ddc":["570"],"date_updated":"2024-03-25T23:30:16Z","article_number":"4605","title":"Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus","abstract":[{"text":"Parvalbumin-positive (PV+) GABAergic interneurons in hippocampal microcircuits are thought to play a key role in several higher network functions, such as feedforward and feedback inhibition, network oscillations, and pattern separation. Fast lateral inhibition mediated by GABAergic interneurons may implement a winner-takes-all mechanism in the hippocampal input layer. However, it is not clear whether the functional connectivity rules of granule cells (GCs) and interneurons in the dentate gyrus are consistent with such a mechanism. Using simultaneous patch-clamp recordings from up to seven GCs and up to four PV+ interneurons in the dentate gyrus, we find that connectivity is structured in space, synapse-specific, and enriched in specific disynaptic motifs. In contrast to the neocortex, lateral inhibition in the dentate gyrus (in which a GC inhibits neighboring GCs via a PV+ interneuron) is ~ 10-times more abundant than recurrent inhibition (in which a GC inhibits itself). Thus, unique connectivity rules may enable the dentate gyrus to perform specific higher-order computations","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:28Z","acknowledgement":"This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 692692) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award), both to P.J..","article_processing_charge":"No","quality_controlled":"1","intvolume":"         9","oa":1,"file":[{"relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":4651930,"access_level":"open_access","date_created":"2018-12-17T15:41:57Z","file_name":"2018_NatureComm_Espinoza.pdf","file_id":"5715","checksum":"9fe2a63bd95a5067d896c087d07998f3","date_updated":"2020-07-14T12:45:28Z"}],"external_id":{"isi":["000449069700009"]},"isi":1,"has_accepted_license":"1","publist_id":"8034","month":"11","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:44:12Z","status":"public","related_material":{"record":[{"status":"public","id":"6363","relation":"dissertation_contains"}],"link":[{"url":"https://ist.ac.at/en/news/lateral-inhibition-keeps-similar-memories-apart/","relation":"press_release","description":"News on IST Homepage"}]},"publication":"Nature Communications","day":"02"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"22","department":[{"_id":"JoFi"}],"publication_status":"published","author":[{"full_name":"Botello, Gabriel","first_name":"Gabriel","last_name":"Botello"},{"full_name":"Sedlmeir, Florian","first_name":"Florian","last_name":"Sedlmeir"},{"id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","full_name":"Rueda Sanchez, Alfredo R","orcid":"0000-0001-6249-5860","last_name":"Rueda Sanchez","first_name":"Alfredo R"},{"full_name":"Abdalmalak, Kerlos","first_name":"Kerlos","last_name":"Abdalmalak"},{"last_name":"Brown","first_name":"Elliott","full_name":"Brown, Elliott"},{"full_name":"Leuchs, Gerd","last_name":"Leuchs","first_name":"Gerd"},{"last_name":"Preu","first_name":"Sascha","full_name":"Preu, Sascha"},{"first_name":"Daniel","last_name":"Segovia Vargas","full_name":"Segovia Vargas, Daniel"},{"full_name":"Strekalov, Dmitry","last_name":"Strekalov","first_name":"Dmitry"},{"last_name":"Munoz","first_name":"Luis","full_name":"Munoz, Luis"},{"full_name":"Schwefel, Harald","last_name":"Schwefel","first_name":"Harald"}],"doi":"10.1364/OPTICA.5.001210","scopus_import":"1","volume":5,"year":"2018","type":"journal_article","publication_identifier":{"issn":["23342536"]},"oa_version":"Published Version","citation":{"ista":"Botello G, Sedlmeir F, Rueda Sanchez AR, Abdalmalak K, Brown E, Leuchs G, Preu S, Segovia Vargas D, Strekalov D, Munoz L, Schwefel H. 2018. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. 5(10), 1210–1219.","chicago":"Botello, Gabriel, Florian Sedlmeir, Alfredo R Rueda Sanchez, Kerlos Abdalmalak, Elliott Brown, Gerd Leuchs, Sascha Preu, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” <i>Optica</i>, 2018. <a href=\"https://doi.org/10.1364/OPTICA.5.001210\">https://doi.org/10.1364/OPTICA.5.001210</a>.","ama":"Botello G, Sedlmeir F, Rueda Sanchez AR, et al. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. <i>Optica</i>. 2018;5(10):1210-1219. doi:<a href=\"https://doi.org/10.1364/OPTICA.5.001210\">10.1364/OPTICA.5.001210</a>","apa":"Botello, G., Sedlmeir, F., Rueda Sanchez, A. R., Abdalmalak, K., Brown, E., Leuchs, G., … Schwefel, H. (2018). Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. <i>Optica</i>. <a href=\"https://doi.org/10.1364/OPTICA.5.001210\">https://doi.org/10.1364/OPTICA.5.001210</a>","short":"G. Botello, F. Sedlmeir, A.R. Rueda Sanchez, K. Abdalmalak, E. Brown, G. Leuchs, S. Preu, D. Segovia Vargas, D. Strekalov, L. Munoz, H. Schwefel, Optica 5 (2018) 1210–1219.","mla":"Botello, Gabriel, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” <i>Optica</i>, vol. 5, no. 10, 2018, pp. 1210–19, doi:<a href=\"https://doi.org/10.1364/OPTICA.5.001210\">10.1364/OPTICA.5.001210</a>.","ieee":"G. Botello <i>et al.</i>, “Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters,” <i>Optica</i>, vol. 5, no. 10. pp. 1210–1219, 2018."},"date_updated":"2023-10-17T12:12:40Z","main_file_link":[{"url":"www.doi.org/10.1364/OPTICA.5.001210 ","open_access":"1"}],"date_published":"2018-10-20T00:00:00Z","issue":"10","abstract":[{"text":"Conventional ultra-high sensitivity detectors in the millimeter-wave range are usually cooled as their own thermal noise at room temperature would mask the weak received radiation. The need for cryogenic systems increases the cost and complexity of the instruments, hindering the development of, among others, airborne and space applications. In this work, the nonlinear parametric upconversion of millimeter-wave radiation to the optical domain inside high-quality (Q) lithium niobate whispering-gallery mode (WGM) resonators is proposed for ultra-low noise detection. We experimentally demonstrate coherent upconversion of millimeter-wave signals to a 1550 nm telecom carrier, with a photon conversion efficiency surpassing the state-of-the-art by 2 orders of magnitude. Moreover, a theoretical model shows that the thermal equilibrium of counterpropagating WGMs is broken by overcoupling the millimeter-wave WGM, effectively cooling the upconverted mode and allowing ultra-low noise detection. By theoretically estimating the sensitivity of a correlation radiometer based on the presented scheme, it is found that room-temperature radiometers with better sensitivity than state-of-the-art high-electron-mobility transistor (HEMT)-based radiometers can be designed. This detection paradigm can be used to develop room-temperature instrumentation for radio astronomy, earth observation, planetary missions, and imaging systems.","lang":"eng"}],"title":"Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters","intvolume":"         5","article_processing_charge":"No","quality_controlled":"1","oa":1,"publist_id":"8033","external_id":{"isi":["000447853100007"]},"isi":1,"month":"10","article_type":"original","language":[{"iso":"eng"}],"status":"public","date_created":"2018-12-11T11:44:12Z","day":"20","publication":"Optica","page":"1210 - 1219"},{"department":[{"_id":"GeKa"}],"author":[{"last_name":"Vukušić","first_name":"Lada","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2424-8636","full_name":"Vukušić, Lada"},{"first_name":"Josip","last_name":"Kukucka","full_name":"Kukucka, Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Hannes","last_name":"Watzinger","full_name":"Watzinger, Hannes","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Joshua M","last_name":"Milem","full_name":"Milem, Joshua M","id":"4CDE0A96-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schäffler, Friedrich","last_name":"Schäffler","first_name":"Friedrich"},{"full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","last_name":"Katsaros"}],"publication_status":"published","doi":"10.1021/acs.nanolett.8b03217","publisher":"American Chemical Society","ec_funded":1,"project":[{"call_identifier":"FP7","_id":"25517E86-B435-11E9-9278-68D0E5697425","grant_number":"335497","name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires"}],"pmid":1,"_id":"23","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-18T09:30:37Z","ddc":["530"],"issue":"11","date_published":"2018-10-25T00:00:00Z","abstract":[{"text":"The strong atomistic spin–orbit coupling of holes makes single-shot spin readout measurements difficult because it reduces the spin lifetimes. By integrating the charge sensor into a high bandwidth radio frequency reflectometry setup, we were able to demonstrate single-shot readout of a germanium quantum dot hole spin and measure the spin lifetime. Hole spin relaxation times of about 90 μs at 500 mT are reported, with a total readout visibility of about 70%. By analyzing separately the spin-to-charge conversion and charge readout fidelities, we have obtained insight into the processes limiting the visibilities of hole spins. The analyses suggest that high hole visibilities are feasible at realistic experimental conditions, underlying the potential of hole spins for the realization of viable qubit devices.","lang":"eng"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"title":"Single-shot readout of hole spins in Ge","volume":18,"year":"2018","scopus_import":"1","publication_identifier":{"issn":["15306984"]},"type":"journal_article","citation":{"apa":"Vukušić, L., Kukucka, J., Watzinger, H., Milem, J. M., Schäffler, F., &#38; Katsaros, G. (2018). Single-shot readout of hole spins in Ge. <i>Nano Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.nanolett.8b03217\">https://doi.org/10.1021/acs.nanolett.8b03217</a>","ama":"Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. Single-shot readout of hole spins in Ge. <i>Nano Letters</i>. 2018;18(11):7141-7145. doi:<a href=\"https://doi.org/10.1021/acs.nanolett.8b03217\">10.1021/acs.nanolett.8b03217</a>","mla":"Vukušić, Lada, et al. “Single-Shot Readout of Hole Spins in Ge.” <i>Nano Letters</i>, vol. 18, no. 11, American Chemical Society, 2018, pp. 7141–45, doi:<a href=\"https://doi.org/10.1021/acs.nanolett.8b03217\">10.1021/acs.nanolett.8b03217</a>.","ieee":"L. Vukušić, J. Kukucka, H. Watzinger, J. M. Milem, F. Schäffler, and G. Katsaros, “Single-shot readout of hole spins in Ge,” <i>Nano Letters</i>, vol. 18, no. 11. American Chemical Society, pp. 7141–7145, 2018.","short":"L. Vukušić, J. Kukucka, H. Watzinger, J.M. Milem, F. Schäffler, G. Katsaros, Nano Letters 18 (2018) 7141–7145.","ista":"Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. 2018. Single-shot readout of hole spins in Ge. Nano Letters. 18(11), 7141–7145.","chicago":"Vukušić, Lada, Josip Kukucka, Hannes Watzinger, Joshua M Milem, Friedrich Schäffler, and Georgios Katsaros. “Single-Shot Readout of Hole Spins in Ge.” <i>Nano Letters</i>. American Chemical Society, 2018. <a href=\"https://doi.org/10.1021/acs.nanolett.8b03217\">https://doi.org/10.1021/acs.nanolett.8b03217</a>."},"oa_version":"Published Version","oa":1,"publist_id":"8032","has_accepted_license":"1","isi":1,"external_id":{"pmid":["30359041"],"isi":["000451102100064"]},"file":[{"creator":"system","content_type":"application/pdf","file_size":1361441,"file_name":"IST-2018-1065-v1+1_ACS_nanoletters_8b03217.pdf","access_level":"open_access","date_created":"2018-12-12T10:16:08Z","file_id":"5194","checksum":"3e6034a94c6b5335e939145d88bdb371","date_updated":"2020-07-14T12:45:37Z","relation":"main_file"}],"intvolume":"        18","article_processing_charge":"No","quality_controlled":"1","file_date_updated":"2020-07-14T12:45:37Z","status":"public","date_created":"2018-12-11T11:44:13Z","day":"25","page":"7141 - 7145","related_material":{"record":[{"id":"7977","relation":"popular_science"},{"id":"69","relation":"dissertation_contains","status":"public"},{"status":"public","relation":"dissertation_contains","id":"7996"}]},"publication":"Nano Letters","pubrep_id":"1065","month":"10","language":[{"iso":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"}},{"intvolume":"      2018","acknowledgement":"This research was supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003; Austrian Science Fund (FWF): S11407-N23(RiSE/SHiNE);and an ERC Start Grant (279307:Graph Games).\r\n","quality_controlled":"1","article_processing_charge":"No","oa":1,"publist_id":"8031","external_id":{"isi":["000764175404117"],"arxiv":["1804.10601"]},"isi":1,"month":"07","language":[{"iso":"eng"}],"status":"public","date_created":"2018-12-11T11:44:13Z","day":"01","conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2018-07-19","start_date":"2018-07-13","location":"Stockholm, Sweden"},"page":"4692 - 4699","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"24","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","full_name":"Elgyütt, Adrian","last_name":"Elgyütt","first_name":"Adrian"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotny, Petr","last_name":"Novotny","first_name":"Petr"},{"full_name":"Rouillé, Owen","first_name":"Owen","last_name":"Rouillé"}],"publication_status":"published","doi":"10.24963/ijcai.2018/652","arxiv":1,"ec_funded":1,"publisher":"IJCAI","scopus_import":"1","volume":2018,"year":"2018","type":"conference","oa_version":"Preprint","citation":{"ieee":"K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.","mla":"Chatterjee, Krishnendu, et al. <i>Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives</i>. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:<a href=\"https://doi.org/10.24963/ijcai.2018/652\">10.24963/ijcai.2018/652</a>.","short":"K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699.","apa":"Chatterjee, K., Elgyütt, A., Novotný, P., &#38; Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. <a href=\"https://doi.org/10.24963/ijcai.2018/652\">https://doi.org/10.24963/ijcai.2018/652</a>","ama":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018. IJCAI; 2018:4692-4699. doi:<a href=\"https://doi.org/10.24963/ijcai.2018/652\">10.24963/ijcai.2018/652</a>","chicago":"Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. <a href=\"https://doi.org/10.24963/ijcai.2018/652\">https://doi.org/10.24963/ijcai.2018/652</a>.","ista":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699."},"date_updated":"2025-06-02T08:53:48Z","date_published":"2018-07-01T00:00:00Z","main_file_link":[{"url":"https://arxiv.org/abs/1804.10601","open_access":"1"}],"abstract":[{"lang":"eng","text":"Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies that optimize the expectation of the discounted-sum payoff. A key drawback of the expectation measure is that even low probability events with extreme payoff can significantly affect the expectation, and thus the obtained policies are not necessarily risk-averse. An alternate approach is to optimize the probability that the payoff is above a certain threshold, which allows obtaining risk-averse policies, but ignores optimization of the expectation. We consider the expectation optimization with probabilistic guarantee (EOPG) problem, where the goal is to optimize the expectation ensuring that the payoff is above a given threshold with at least a specified probability. We present several results on the EOPG problem, including the first algorithm to solve it."}],"title":"Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives"},{"oa":1,"publist_id":"8030","external_id":{"isi":["000764175404127"]},"isi":1,"acknowledgement":"∗This work has been supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Starting grant (279307: Graph Games). This research was sponsored by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). ","quality_controlled":"1","article_processing_charge":"No","status":"public","date_created":"2018-12-11T11:44:13Z","day":"01","publication":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2018-07-19","location":"Stockholm, Sweden","start_date":"2018-07-13"},"page":"4764 - 4770","month":"07","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"author":[{"last_name":"Horák","first_name":"Karel","full_name":"Horák, Karel"},{"full_name":"Bošanský, Branislav","first_name":"Branislav","last_name":"Bošanský"},{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","doi":"10.24963/ijcai.2018/662","ec_funded":1,"publisher":"IJCAI","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"25","date_updated":"2025-06-02T08:53:40Z","date_published":"2018-07-01T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.24963/ijcai.2018/662","open_access":"1"}],"abstract":[{"text":"Partially observable Markov decision processes (POMDPs) are the standard models for planning under uncertainty with both finite and infinite horizon. Besides the well-known discounted-sum objective, indefinite-horizon objective (aka Goal-POMDPs) is another classical objective for POMDPs. In this case, given a set of target states and a positive cost for each transition, the optimization objective is to minimize the expected total cost until a target state is reached. In the literature, RTDP-Bel or heuristic search value iteration (HSVI) have been used for solving Goal-POMDPs. Neither of these algorithms has theoretical convergence guarantees, and HSVI may even fail to terminate its trials. We give the following contributions: (1) We discuss the challenges introduced in Goal-POMDPs and illustrate how they prevent the original HSVI from converging. (2) We present a novel algorithm inspired by HSVI, termed Goal-HSVI, and show that our algorithm has convergence guarantees. (3) We show that Goal-HSVI outperforms RTDP-Bel on a set of well-known examples.","lang":"eng"}],"title":"Goal-HSVI: Heuristic search value iteration for goal-POMDPs","scopus_import":"1","year":"2018","volume":"2018-July","type":"conference","citation":{"short":"K. Horák, B. Bošanský, K. Chatterjee, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4764–4770.","mla":"Horák, Karel, et al. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i>, vol. 2018–July, IJCAI, 2018, pp. 4764–70, doi:<a href=\"https://doi.org/10.24963/ijcai.2018/662\">10.24963/ijcai.2018/662</a>.","ieee":"K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value iteration for goal-POMDPs,” in <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i>, Stockholm, Sweden, 2018, vol. 2018–July, pp. 4764–4770.","ama":"Horák K, Bošanský B, Chatterjee K. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In: <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i>. Vol 2018-July. IJCAI; 2018:4764-4770. doi:<a href=\"https://doi.org/10.24963/ijcai.2018/662\">10.24963/ijcai.2018/662</a>","apa":"Horák, K., Bošanský, B., &#38; Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i> (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI. <a href=\"https://doi.org/10.24963/ijcai.2018/662\">https://doi.org/10.24963/ijcai.2018/662</a>","chicago":"Horák, Karel, Branislav Bošanský, and Krishnendu Chatterjee. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” In <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i>, 2018–July:4764–70. IJCAI, 2018. <a href=\"https://doi.org/10.24963/ijcai.2018/662\">https://doi.org/10.24963/ijcai.2018/662</a>.","ista":"Horák K, Bošanský B, Chatterjee K. 2018. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018–July, 4764–4770."},"oa_version":"Published Version"},{"language":[{"iso":"eng"}],"supervisor":[{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C","last_name":"Guet","first_name":"Calin C"}],"pubrep_id":"1059","month":"10","day":"30","page":"109","related_material":{"record":[{"status":"public","id":"704","relation":"part_of_dissertation"}]},"status":"public","date_created":"2018-12-11T11:44:14Z","article_processing_charge":"No","degree_awarded":"PhD","file_date_updated":"2021-02-11T11:17:14Z","publist_id":"8029","has_accepted_license":"1","file":[{"file_id":"5941","date_updated":"2020-07-14T12:45:43Z","checksum":"413cbce1cd1debeae3abe2a25dbc70d1","embargo_to":"open_access","file_size":9190845,"date_created":"2019-02-08T10:51:22Z","access_level":"closed","file_name":"Thesis_Steinrueck_final.docx","creator":"dernst","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"source_file"},{"creator":"dernst","content_type":"application/pdf","file_size":7521973,"date_created":"2019-02-08T10:51:22Z","file_name":"Thesis_Steinrueck_final.pdf","access_level":"open_access","file_id":"5942","checksum":"3def8b7854c8b42d643597ce0215efac","date_updated":"2021-02-11T11:17:14Z","relation":"main_file","embargo":"2019-11-02"}],"oa":1,"oa_version":"Published Version","citation":{"short":"M. Steinrück, The Influence of Sequence Context on the Evolution of Bacterial Gene Expression, Institute of Science and Technology Austria, 2018.","ieee":"M. Steinrück, “The influence of sequence context on the evolution of bacterial gene expression,” Institute of Science and Technology Austria, 2018.","mla":"Steinrück, Magdalena. <i>The Influence of Sequence Context on the Evolution of Bacterial Gene Expression</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th1059\">10.15479/AT:ISTA:th1059</a>.","apa":"Steinrück, M. (2018). <i>The influence of sequence context on the evolution of bacterial gene expression</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th1059\">https://doi.org/10.15479/AT:ISTA:th1059</a>","ama":"Steinrück M. The influence of sequence context on the evolution of bacterial gene expression. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th1059\">10.15479/AT:ISTA:th1059</a>","chicago":"Steinrück, Magdalena. “The Influence of Sequence Context on the Evolution of Bacterial Gene Expression.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th1059\">https://doi.org/10.15479/AT:ISTA:th1059</a>.","ista":"Steinrück M. 2018. The influence of sequence context on the evolution of bacterial gene expression. Institute of Science and Technology Austria."},"year":"2018","publication_identifier":{"issn":["2663-337X"]},"type":"dissertation","abstract":[{"lang":"eng","text":"Expression of genes is a fundamental molecular phenotype that is subject to evolution by different types of mutations. Both the rate and the effect of mutations may depend on the DNA sequence context of a particular gene or a particular promoter sequence. In this thesis I investigate the nature of this dependence using simple genetic systems in Escherichia coli. With these systems I explore the evolution of constitutive gene expression from random starting sequences at different loci on the chromosome and at different locations in sequence space. First, I dissect chromosomal neighborhood effects that underlie locus-dependent differences in the potential of a gene under selection to become more highly expressed. Next, I find that the effects of point mutations in promoter sequences are dependent on sequence context, and that an existing energy matrix model performs poorly in predicting relative expression of unrelated sequences. Finally, I show that a substantial fraction of random sequences contain functional promoters and I present an extended thermodynamic model that predicts promoter strength in full sequence space. Taken together, these results provide new insights and guides on how to integrate information on sequence context to improve our qualitative and quantitative understanding of bacterial gene expression, with implications for rapid evolution of drug resistance, de novo evolution of genes, and horizontal gene transfer."}],"title":"The influence of sequence context on the evolution of bacterial gene expression","date_updated":"2023-09-07T12:48:43Z","ddc":["576","579"],"date_published":"2018-10-30T00:00:00Z","_id":"26","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","doi":"10.15479/AT:ISTA:th1059","publisher":"Institute of Science and Technology Austria","alternative_title":["ISTA Thesis"],"department":[{"_id":"CaGu"}],"publication_status":"published","author":[{"first_name":"Magdalena","last_name":"Steinrück","orcid":"0000-0003-1229-9719","full_name":"Steinrück, Magdalena","id":"2C023F40-F248-11E8-B48F-1D18A9856A87"}]},{"article_processing_charge":"No","quality_controlled":"1","external_id":{"isi":["000457843603087"],"arxiv":["1604.08269"]},"isi":1,"oa":1,"language":[{"iso":"eng"}],"month":"06","day":"28","publication":"2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition","conference":{"end_date":"2018-06-22","name":"CVPR: Conference on Computer Vision and Pattern Recognition","start_date":"2018-06-18","location":"Salt Lake City, UT, USA"},"page":"3693-3701","status":"public","date_created":"2018-12-11T11:45:33Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"273","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"doi":"10.1109/cvpr.2018.00389","arxiv":1,"ec_funded":1,"publisher":"IEEE","department":[{"_id":"VlKo"}],"publication_status":"published","author":[{"full_name":"Mohapatra, Pritish","first_name":"Pritish","last_name":"Mohapatra"},{"first_name":"Michal","last_name":"Rolinek","full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jawahar, C V","last_name":"Jawahar","first_name":"C V"},{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov"},{"last_name":"Kumar","first_name":"M Pawan","full_name":"Kumar, M Pawan"}],"oa_version":"Preprint","citation":{"chicago":"Mohapatra, Pritish, Michal Rolinek, C V Jawahar, Vladimir Kolmogorov, and M Pawan Kumar. “Efficient Optimization for Rank-Based Loss Functions.” In <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, 3693–3701. IEEE, 2018. <a href=\"https://doi.org/10.1109/cvpr.2018.00389\">https://doi.org/10.1109/cvpr.2018.00389</a>.","ista":"Mohapatra P, Rolinek M, Jawahar CV, Kolmogorov V, Kumar MP. 2018. Efficient optimization for rank-based loss functions. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 3693–3701.","mla":"Mohapatra, Pritish, et al. “Efficient Optimization for Rank-Based Loss Functions.” <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, IEEE, 2018, pp. 3693–701, doi:<a href=\"https://doi.org/10.1109/cvpr.2018.00389\">10.1109/cvpr.2018.00389</a>.","ieee":"P. Mohapatra, M. Rolinek, C. V. Jawahar, V. Kolmogorov, and M. P. Kumar, “Efficient optimization for rank-based loss functions,” in <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, Salt Lake City, UT, USA, 2018, pp. 3693–3701.","short":"P. Mohapatra, M. Rolinek, C.V. Jawahar, V. Kolmogorov, M.P. Kumar, in:, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–3701.","ama":"Mohapatra P, Rolinek M, Jawahar CV, Kolmogorov V, Kumar MP. Efficient optimization for rank-based loss functions. In: <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>. IEEE; 2018:3693-3701. doi:<a href=\"https://doi.org/10.1109/cvpr.2018.00389\">10.1109/cvpr.2018.00389</a>","apa":"Mohapatra, P., Rolinek, M., Jawahar, C. V., Kolmogorov, V., &#38; Kumar, M. P. (2018). Efficient optimization for rank-based loss functions. In <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i> (pp. 3693–3701). Salt Lake City, UT, USA: IEEE. <a href=\"https://doi.org/10.1109/cvpr.2018.00389\">https://doi.org/10.1109/cvpr.2018.00389</a>"},"scopus_import":"1","year":"2018","type":"conference","publication_identifier":{"isbn":["9781538664209"]},"abstract":[{"lang":"eng","text":"The accuracy of information retrieval systems is often measured using complex loss functions such as the average precision (AP) or the normalized discounted cumulative gain (NDCG). Given a set of positive and negative samples, the parameters of a retrieval system can be estimated by minimizing these loss functions. However, the non-differentiability and non-decomposability of these loss functions does not allow for simple gradient based optimization algorithms. This issue is generally circumvented by either optimizing a structured hinge-loss upper bound to the loss function or by using asymptotic methods like the direct-loss minimization framework. Yet, the high computational complexity of loss-augmented inference, which is necessary for both the frameworks, prohibits its use in large training data sets. To alleviate this deficiency, we present a novel quicksort flavored algorithm for a large class of non-decomposable loss functions. We provide a complete characterization of the loss functions that are amenable to our algorithm, and show that it includes both AP and NDCG based loss functions. Furthermore, we prove that no comparison based algorithm can improve upon the computational complexity of our approach asymptotically. We demonstrate the effectiveness of our approach in the context of optimizing the structured hinge loss upper bound of AP and NDCG loss for learning models for a variety of vision tasks. We show that our approach provides significantly better results than simpler decomposable loss functions, while requiring a comparable training time."}],"title":"Efficient optimization for rank-based loss functions","date_updated":"2023-09-11T13:24:43Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.08269"}],"date_published":"2018-06-28T00:00:00Z"}]