[{"title":"On multiple keyword sponsored search auctions with budgets","status":"public","intvolume":" 4","_id":"11668","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","type":"journal_article","abstract":[{"lang":"eng","text":"We study multiple keyword sponsored search auctions with budgets. Each keyword has multiple ad slots with a click-through rate. The bidders have additive valuations, which are linear in the click-through rates, and budgets, which are restricting their overall payments. Additionally, the number of slots per keyword assigned to a bidder is bounded.\r\n\r\nWe show the following results: (1) We give the first mechanism for multiple keywords, where click-through rates differ among slots. Our mechanism is incentive compatible in expectation, individually rational in expectation, and Pareto optimal. (2) We study the combinatorial setting, where each bidder is only interested in a subset of the keywords. We give an incentive compatible, individually rational, Pareto-optimal, and deterministic mechanism for identical click-through rates. (3) We give an impossibility result for incentive compatible, individually rational, Pareto-optimal, and deterministic mechanisms for bidders with diminishing marginal valuations."}],"issue":"1","article_type":"original","publication":"ACM Transactions on Economics and Computation","citation":{"ama":"Colini-Baldeschi R, Leonardi S, Henzinger MH, Starnberger M. On multiple keyword sponsored search auctions with budgets. ACM Transactions on Economics and Computation. 2015;4(1). doi:10.1145/2818357","ista":"Colini-Baldeschi R, Leonardi S, Henzinger MH, Starnberger M. 2015. On multiple keyword sponsored search auctions with budgets. ACM Transactions on Economics and Computation. 4(1), 2.","ieee":"R. Colini-Baldeschi, S. Leonardi, M. H. Henzinger, and M. Starnberger, “On multiple keyword sponsored search auctions with budgets,” ACM Transactions on Economics and Computation, vol. 4, no. 1. Association for Computing Machinery, 2015.","apa":"Colini-Baldeschi, R., Leonardi, S., Henzinger, M. H., & Starnberger, M. (2015). On multiple keyword sponsored search auctions with budgets. ACM Transactions on Economics and Computation. Association for Computing Machinery. https://doi.org/10.1145/2818357","mla":"Colini-Baldeschi, Riccardo, et al. “On Multiple Keyword Sponsored Search Auctions with Budgets.” ACM Transactions on Economics and Computation, vol. 4, no. 1, 2, Association for Computing Machinery, 2015, doi:10.1145/2818357.","short":"R. Colini-Baldeschi, S. Leonardi, M.H. Henzinger, M. Starnberger, ACM Transactions on Economics and Computation 4 (2015).","chicago":"Colini-Baldeschi, Riccardo, Stefano Leonardi, Monika H Henzinger, and Martin Starnberger. “On Multiple Keyword Sponsored Search Auctions with Budgets.” ACM Transactions on Economics and Computation. Association for Computing Machinery, 2015. https://doi.org/10.1145/2818357."},"date_published":"2015-12-05T00:00:00Z","keyword":["Algorithms","Economics","Clinching ascending auction","auctions with budgets","Sponsored search auctions"],"scopus_import":"1","day":"05","article_processing_charge":"No","publication_status":"published","publisher":"Association for Computing Machinery","year":"2015","date_updated":"2023-02-09T10:03:35Z","date_created":"2022-07-27T11:54:56Z","volume":4,"author":[{"full_name":"Colini-Baldeschi, Riccardo","last_name":"Colini-Baldeschi","first_name":"Riccardo"},{"first_name":"Stefano","last_name":"Leonardi","full_name":"Leonardi, Stefano"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"last_name":"Starnberger","first_name":"Martin","full_name":"Starnberger, Martin"}],"article_number":"2","extern":"1","quality_controlled":"1","main_file_link":[{"url":"http://eprints.cs.univie.ac.at/3510/","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1145/2818357","month":"12","publication_identifier":{"issn":["2167-8375"],"eissn":["2167-8383"]}},{"issue":"1","abstract":[{"lang":"eng","text":"We study individual rational, Pareto-optimal, and incentive compatible mechanisms for auctions with heterogeneous items and budget limits. We consider settings with multiunit demand and additive valuations. For single-dimensional valuations we prove a positive result for randomized mechanisms, and a negative result for deterministic mechanisms. While the positive result allows for private budgets, the negative result is for public budgets. For multidimensional valuations and public budgets we prove an impossibility result that applies to deterministic and randomized mechanisms. Taken together this shows the power of randomization in certain settings with heterogeneous items, but it also shows its limitations."}],"type":"journal_article","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11669","intvolume":" 4","status":"public","title":"Auctions for heterogeneous items and budget limits","article_processing_charge":"No","day":"05","scopus_import":"1","keyword":["Algorithmic game theory","auction theory","Clinching auction","Pareto optimality","Budget limits"],"date_published":"2015-12-05T00:00:00Z","citation":{"ama":"Dütting P, Henzinger MH, Starnberger M. Auctions for heterogeneous items and budget limits. ACM Transactions on Economics and Computation. 2015;4(1). doi:10.1145/2818351","ista":"Dütting P, Henzinger MH, Starnberger M. 2015. Auctions for heterogeneous items and budget limits. ACM Transactions on Economics and Computation. 4(1), 4.","ieee":"P. Dütting, M. H. Henzinger, and M. Starnberger, “Auctions for heterogeneous items and budget limits,” ACM Transactions on Economics and Computation, vol. 4, no. 1. Association for Computing Machinery, 2015.","apa":"Dütting, P., Henzinger, M. H., & Starnberger, M. (2015). Auctions for heterogeneous items and budget limits. ACM Transactions on Economics and Computation. Association for Computing Machinery. https://doi.org/10.1145/2818351","mla":"Dütting, Paul, et al. “Auctions for Heterogeneous Items and Budget Limits.” ACM Transactions on Economics and Computation, vol. 4, no. 1, 4, Association for Computing Machinery, 2015, doi:10.1145/2818351.","short":"P. Dütting, M.H. Henzinger, M. Starnberger, ACM Transactions on Economics and Computation 4 (2015).","chicago":"Dütting, Paul, Monika H Henzinger, and Martin Starnberger. “Auctions for Heterogeneous Items and Budget Limits.” ACM Transactions on Economics and Computation. Association for Computing Machinery, 2015. https://doi.org/10.1145/2818351."},"publication":"ACM Transactions on Economics and Computation","article_type":"original","extern":"1","article_number":"4","author":[{"full_name":"Dütting, Paul","first_name":"Paul","last_name":"Dütting"},{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Starnberger, Martin","first_name":"Martin","last_name":"Starnberger"}],"volume":4,"date_created":"2022-07-27T12:09:15Z","date_updated":"2022-09-09T12:08:37Z","year":"2015","publisher":"Association for Computing Machinery","publication_status":"published","publication_identifier":{"issn":["2167-8375"],"eissn":["2167-8383"]},"month":"12","doi":"10.1145/2818351","language":[{"iso":"eng"}],"external_id":{"arxiv":["1209.6448"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1209.6448","open_access":"1"}],"quality_controlled":"1"},{"issue":"1","abstract":[{"text":"Auctions are widely used on the Web. Applications range from sponsored search to platforms such as eBay. In these and in many other applications the auctions in use are single-/multi-item auctions with unit demand. The main drawback of standard mechanisms for this type of auctions, such as VCG and GSP, is the limited expressiveness that they offer to the bidders. The General Auction Mechanism (GAM) of Aggarwal et al. [2009] takes a first step toward addressing the problem of limited expressiveness by computing a bidder optimal, envy-free outcome for linear utility functions with identical slopes and a single discontinuity per bidder-item pair. We show that in many practical situations this does not suffice to adequately model the preferences of the bidders, and we overcome this problem by presenting the first mechanism for piecewise linear utility functions with nonidentical slopes and multiple discontinuities. Our mechanism runs in polynomial time. Like GAM it is incentive compatible for inputs that fulfill a certain nondegeneracy assumption, but our requirement is more general than the requirement of GAM. For discontinuous utility functions that are nondegenerate as well as for continuous utility functions the outcome of our mechanism is a competitive equilibrium. We also show how our mechanism can be used to compute approximately bidder optimal, envy-free outcomes for a general class of continuous utility functions via piecewise linear approximation. Finally, we prove hardness results for even more expressive settings.","lang":"eng"}],"type":"journal_article","oa_version":"None","intvolume":" 4","status":"public","title":"An expressive mechanism for auctions on the web","_id":"11670","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"02","keyword":["Computational Mathematics","Marketing","Economics and Econometrics","Statistics and Probability","Computer Science (miscellaneous)"],"scopus_import":"1","date_published":"2015-12-02T00:00:00Z","article_type":"original","citation":{"mla":"Dütting, Paul, et al. “An Expressive Mechanism for Auctions on the Web.” ACM Transactions on Economics and Computation, vol. 4, no. 1, 1, Association for Computing Machinery, 2015, doi:10.1145/2716312.","short":"P. Dütting, M.H. Henzinger, I. Weber, ACM Transactions on Economics and Computation 4 (2015).","chicago":"Dütting, Paul, Monika H Henzinger, and Ingmar Weber. “An Expressive Mechanism for Auctions on the Web.” ACM Transactions on Economics and Computation. Association for Computing Machinery, 2015. https://doi.org/10.1145/2716312.","ama":"Dütting P, Henzinger MH, Weber I. An expressive mechanism for auctions on the web. ACM Transactions on Economics and Computation. 2015;4(1). doi:10.1145/2716312","ista":"Dütting P, Henzinger MH, Weber I. 2015. An expressive mechanism for auctions on the web. ACM Transactions on Economics and Computation. 4(1), 1.","apa":"Dütting, P., Henzinger, M. H., & Weber, I. (2015). An expressive mechanism for auctions on the web. ACM Transactions on Economics and Computation. Association for Computing Machinery. https://doi.org/10.1145/2716312","ieee":"P. Dütting, M. H. Henzinger, and I. Weber, “An expressive mechanism for auctions on the web,” ACM Transactions on Economics and Computation, vol. 4, no. 1. Association for Computing Machinery, 2015."},"publication":"ACM Transactions on Economics and Computation","extern":"1","article_number":"1","volume":4,"date_created":"2022-07-27T12:43:18Z","date_updated":"2023-02-09T10:08:41Z","author":[{"first_name":"Paul","last_name":"Dütting","full_name":"Dütting, Paul"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Weber, Ingmar","last_name":"Weber","first_name":"Ingmar"}],"publisher":"Association for Computing Machinery","publication_status":"published","acknowledgement":"We would like to thank Veronika Loitzenbauer and the anonymous referees for their valuable feedback.","year":"2015","publication_identifier":{"eissn":["2167-8383"],"issn":["2167-8375"]},"month":"12","language":[{"iso":"eng"}],"doi":"10.1145/2716312","quality_controlled":"1"},{"type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Combinatorial auctions (CA) are a well-studied area in algorithmic mechanism design. However, contrary to the standard model, empirical studies suggest that a bidder’s valuation often does not depend solely on the goods assigned to him. For instance, in adwords auctions an advertiser might not want his ads to be displayed next to his competitors’ ads. In this paper, we propose and analyze several natural graph-theoretic models that incorporate such negative externalities, in which bidders form a directed conflict graph with maximum out-degree Δ. We design algorithms and truthful mechanisms for social welfare maximization that attain approximation ratios depending on Δ.\r\n\r\nFor CA, our results are twofold: (1) A lottery that eliminates conflicts by discarding bidders/items independent of the bids. It allows to apply any truthful 𝛼-approximation mechanism for conflict-free valuations and yields an 𝒪(𝛼Δ)-approximation mechanism. (2) For fractionally sub-additive valuations, we design a rounding algorithm via a novel combination of a semi-definite program and a linear program, resulting in a cone program; the approximation ratio is 𝒪((ΔloglogΔ)/logΔ). The ratios are almost optimal given existing hardness results.\r\n\r\nFor adwords auctions, we present several algorithms for the most relevant scenario when the number of items is small. In particular, we design a truthful mechanism with approximation ratio 𝑜(Δ) when the number of items is only logarithmic in the number of bidders."}],"_id":"11774","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Combinatorial auctions with conflict-based externalities","intvolume":" 9470","oa_version":"Preprint","scopus_import":"1","day":"09","article_processing_charge":"No","publication":"11th International Conference on Web and Internet Economics","citation":{"chicago":"Cheung, Yun Kuen, Monika H Henzinger, Martin Hoefer, and Martin Starnberger. “Combinatorial Auctions with Conflict-Based Externalities.” In 11th International Conference on Web and Internet Economics, 9470:230–243. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-48995-6_17.","short":"Y.K. Cheung, M.H. Henzinger, M. Hoefer, M. Starnberger, in:, 11th International Conference on Web and Internet Economics, Springer Nature, 2015, pp. 230–243.","mla":"Cheung, Yun Kuen, et al. “Combinatorial Auctions with Conflict-Based Externalities.” 11th International Conference on Web and Internet Economics, vol. 9470, Springer Nature, 2015, pp. 230–243, doi:10.1007/978-3-662-48995-6_17.","apa":"Cheung, Y. K., Henzinger, M. H., Hoefer, M., & Starnberger, M. (2015). Combinatorial auctions with conflict-based externalities. In 11th International Conference on Web and Internet Economics (Vol. 9470, pp. 230–243). Amsterdam, Netherlands: Springer Nature. https://doi.org/10.1007/978-3-662-48995-6_17","ieee":"Y. K. Cheung, M. H. Henzinger, M. Hoefer, and M. Starnberger, “Combinatorial auctions with conflict-based externalities,” in 11th International Conference on Web and Internet Economics, Amsterdam, Netherlands, 2015, vol. 9470, pp. 230–243.","ista":"Cheung YK, Henzinger MH, Hoefer M, Starnberger M. 2015. Combinatorial auctions with conflict-based externalities. 11th International Conference on Web and Internet Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 9470, 230–243.","ama":"Cheung YK, Henzinger MH, Hoefer M, Starnberger M. Combinatorial auctions with conflict-based externalities. In: 11th International Conference on Web and Internet Economics. Vol 9470. Springer Nature; 2015:230–243. doi:10.1007/978-3-662-48995-6_17"},"page":"230–243","date_published":"2015-12-09T00:00:00Z","extern":"1","year":"2015","publication_status":"published","publisher":"Springer Nature","author":[{"last_name":"Cheung","first_name":"Yun Kuen","full_name":"Cheung, Yun Kuen"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"first_name":"Martin","last_name":"Hoefer","full_name":"Hoefer, Martin"},{"last_name":"Starnberger","first_name":"Martin","full_name":"Starnberger, Martin"}],"date_created":"2022-08-08T13:54:32Z","date_updated":"2023-02-10T09:08:30Z","volume":9470,"month":"12","publication_identifier":{"isbn":["9783662489949"],"issn":["0302-9743"],"eisbn":["9783662489956"]},"external_id":{"arxiv":["1509.09147"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1509.09147"}],"oa":1,"quality_controlled":"1","conference":{"end_date":"2015-12-12","start_date":"2015-12-09","location":"Amsterdam, Netherlands","name":"WINE: International Conference on Web and Internet Economics"},"doi":"10.1007/978-3-662-48995-6_17","language":[{"iso":"eng"}]},{"publication":"11th International Conference on Web and Internet Economics","citation":{"apa":"Ben-Zwi, O., Henzinger, M. H., & Loitzenbauer, V. (2015). Ad exchange: Envy-free auctions with mediators. In 11th International Conference on Web and Internet Economics (Vol. 9470, pp. 104–117). Amsterdam, Netherlands: Springer Nature. https://doi.org/10.1007/978-3-662-48995-6_8","ieee":"O. Ben-Zwi, M. H. Henzinger, and V. Loitzenbauer, “Ad exchange: Envy-free auctions with mediators,” in 11th International Conference on Web and Internet Economics, Amsterdam, Netherlands, 2015, vol. 9470, pp. 104–117.","ista":"Ben-Zwi O, Henzinger MH, Loitzenbauer V. 2015. Ad exchange: Envy-free auctions with mediators. 11th International Conference on Web and Internet Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 9470, 104–117.","ama":"Ben-Zwi O, Henzinger MH, Loitzenbauer V. Ad exchange: Envy-free auctions with mediators. In: 11th International Conference on Web and Internet Economics. Vol 9470. Springer Nature; 2015:104–117. doi:10.1007/978-3-662-48995-6_8","chicago":"Ben-Zwi, Oren, Monika H Henzinger, and Veronika Loitzenbauer. “Ad Exchange: Envy-Free Auctions with Mediators.” In 11th International Conference on Web and Internet Economics, 9470:104–117. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-48995-6_8.","short":"O. Ben-Zwi, M.H. Henzinger, V. Loitzenbauer, in:, 11th International Conference on Web and Internet Economics, Springer Nature, 2015, pp. 104–117.","mla":"Ben-Zwi, Oren, et al. “Ad Exchange: Envy-Free Auctions with Mediators.” 11th International Conference on Web and Internet Economics, vol. 9470, Springer Nature, 2015, pp. 104–117, doi:10.1007/978-3-662-48995-6_8."},"page":"104–117","date_published":"2015-12-09T00:00:00Z","scopus_import":"1","day":"09","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11773","title":"Ad exchange: Envy-free auctions with mediators","status":"public","intvolume":" 9470","oa_version":"Preprint","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"Ad exchanges are an emerging platform for trading advertisement slots on the web with billions of dollars revenue per year. Every time a user visits a web page, the publisher of that web page can ask an ad exchange to auction off the ad slots on this page to determine which advertisements are shown at which price. Due to the high volume of traffic, ad networks typically act as mediators for individual advertisers at ad exchanges. If multiple advertisers in an ad network are interested in the ad slots of the same auction, the ad network might use a “local” auction to resell the obtained ad slots among its advertisers.\r\n\r\nIn this work we want to deepen the theoretical understanding of these new markets by analyzing them from the viewpoint of combinatorial auctions. Prior work studied mostly single-item auctions, while we allow the advertisers to express richer preferences over multiple items. We develop a game-theoretic model for the entanglement of the central auction at the ad exchange with the local auctions at the ad networks. We consider the incentives of all three involved parties and suggest a three-party competitive equilibrium, an extension of the Walrasian equilibrium that ensures envy-freeness for all participants. We show the existence of a three-party competitive equilibrium and a polynomial-time algorithm to find one for gross-substitute bidder valuations.","lang":"eng"}],"oa":1,"external_id":{"arxiv":["1604.05562"]},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1604.05562","open_access":"1"}],"quality_controlled":"1","conference":{"location":"Amsterdam, Netherlands","start_date":"2015-09-09","end_date":"2015-09-12","name":"WINE: International Conference on Web and Internet Economics"},"doi":"10.1007/978-3-662-48995-6_8","language":[{"iso":"eng"}],"month":"12","publication_identifier":{"isbn":["9783662489949"],"eisbn":["9783662489956"],"issn":["0302-9743"]},"year":"2015","publication_status":"published","publisher":"Springer Nature","author":[{"full_name":"Ben-Zwi, Oren","first_name":"Oren","last_name":"Ben-Zwi"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer","first_name":"Veronika"}],"date_updated":"2023-02-10T09:06:23Z","date_created":"2022-08-08T13:33:56Z","volume":9470,"extern":"1"},{"month":"01","publication_identifier":{"isbn":["9783662476710"],"issn":["0302-9743"]},"quality_controlled":"1","oa":1,"external_id":{"arxiv":["1612.03856"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1612.03856"}],"language":[{"iso":"eng"}],"conference":{"location":"Kyoto, Japan","start_date":"2015-07-06","end_date":"2015-07-10","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"doi":"10.1007/978-3-662-47672-7_59","extern":"1","publication_status":"published","publisher":"Springer Nature","year":"2015","date_updated":"2023-02-10T09:10:26Z","date_created":"2022-08-11T08:51:32Z","volume":9134,"author":[{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"scopus_import":"1","day":"01","article_processing_charge":"No","page":"725 - 736","publication":"42nd International Colloquium on Automata, Languages and Programming","citation":{"ama":"Henzinger MH, Krinninger S, Nanongkai D. Improved algorithms for decremental single-source reachability on directed graphs. In: 42nd International Colloquium on Automata, Languages and Programming. Vol 9134. Springer Nature; 2015:725-736. doi:10.1007/978-3-662-47672-7_59","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Improved algorithms for decremental single-source reachability on directed graphs,” in 42nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 725–736.","apa":"Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2015). Improved algorithms for decremental single-source reachability on directed graphs. In 42nd International Colloquium on Automata, Languages and Programming (Vol. 9134, pp. 725–736). Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47672-7_59","ista":"Henzinger MH, Krinninger S, Nanongkai D. 2015. Improved algorithms for decremental single-source reachability on directed graphs. 42nd International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 9134, 725–736.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 42nd International Colloquium on Automata, Languages and Programming, Springer Nature, 2015, pp. 725–736.","mla":"Henzinger, Monika H., et al. “Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs.” 42nd International Colloquium on Automata, Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 725–36, doi:10.1007/978-3-662-47672-7_59.","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs.” In 42nd International Colloquium on Automata, Languages and Programming, 9134:725–36. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47672-7_59."},"date_published":"2015-01-01T00:00:00Z","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"Recently we presented the first algorithm for maintaining the set of nodes reachable from a source node in a directed graph that is modified by edge deletions with 𝑜(𝑚𝑛) total update time, where 𝑚 is the number of edges and 𝑛 is the number of nodes in the graph [Henzinger et al. STOC 2014]. The algorithm is a combination of several different algorithms, each for a different 𝑚 vs. 𝑛 trade-off. For the case of 𝑚=Θ(𝑛1.5) the running time is 𝑂(𝑛2.47), just barely below 𝑚𝑛=Θ(𝑛2.5). In this paper we simplify the previous algorithm using new algorithmic ideas and achieve an improved running time of 𝑂̃ (min(𝑚7/6𝑛2/3,𝑚3/4𝑛5/4+𝑜(1),𝑚2/3𝑛4/3+𝑜(1)+𝑚3/7𝑛12/7+𝑜(1))). This gives, e.g., 𝑂(𝑛2.36) for the notorious case 𝑚=Θ(𝑛1.5). We obtain the same upper bounds for the problem of maintaining the strongly connected components of a directed graph undergoing edge deletions. Our algorithms are correct with high probabililty against an oblivious adversary."}],"status":"public","title":"Improved algorithms for decremental single-source reachability on directed graphs","intvolume":" 9134","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11785","oa_version":"Preprint"},{"extern":"1","publisher":"Springer Nature","publication_status":"published","year":"2015","volume":9134,"date_created":"2022-08-11T09:38:34Z","date_updated":"2023-02-10T09:21:47Z","author":[{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"full_name":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer","first_name":"Veronika"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783662476710"]},"month":"07","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1412.6466"}],"oa":1,"external_id":{"arxiv":["1412.6466"]},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-47672-7_58","conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","location":"Kyoto, Japan","start_date":"2015-07-06","end_date":"2015-07-10"},"alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"We present faster algorithms for computing the 2-edge and 2-vertex strongly connected components of a directed graph. While in undirected graphs the 2-edge and 2-vertex connected components can be found in linear time, in directed graphs with m edges and n vertices only rather simple O(m n)-time algorithms were known. We use a hierarchical sparsification technique to obtain algorithms that run in time 𝑂(𝑛2). For 2-edge strongly connected components our algorithm gives the first running time improvement in 20 years. Additionally we present an 𝑂(𝑚2/log𝑛)-time algorithm for 2-edge strongly connected components, and thus improve over the O(m n) running time also when 𝑚=𝑂(𝑛). Our approach extends to k-edge and k-vertex strongly connected components for any constant k with a running time of 𝑂(𝑛2log𝑛) for k-edge-connectivity and 𝑂(𝑛3) for k-vertex-connectivity."}],"intvolume":" 9134","status":"public","title":"Finding 2-edge and 2-vertex strongly connected components in quadratic time","_id":"11787","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","scopus_import":"1","article_processing_charge":"No","day":"06","page":"713 - 724","citation":{"chicago":"Henzinger, Monika H, Sebastian Krinninger, and Veronika Loitzenbauer. “Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time.” In 2nd International Colloquium on Automata, Languages and Programming, 9134:713–24. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47672-7_58.","mla":"Henzinger, Monika H., et al. “Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time.” 2nd International Colloquium on Automata, Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 713–24, doi:10.1007/978-3-662-47672-7_58.","short":"M.H. Henzinger, S. Krinninger, V. Loitzenbauer, in:, 2nd International Colloquium on Automata, Languages and Programming, Springer Nature, 2015, pp. 713–724.","ista":"Henzinger MH, Krinninger S, Loitzenbauer V. 2015. Finding 2-edge and 2-vertex strongly connected components in quadratic time. 2nd International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 9134, 713–724.","apa":"Henzinger, M. H., Krinninger, S., & Loitzenbauer, V. (2015). Finding 2-edge and 2-vertex strongly connected components in quadratic time. In 2nd International Colloquium on Automata, Languages and Programming (Vol. 9134, pp. 713–724). Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47672-7_58","ieee":"M. H. Henzinger, S. Krinninger, and V. Loitzenbauer, “Finding 2-edge and 2-vertex strongly connected components in quadratic time,” in 2nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 713–724.","ama":"Henzinger MH, Krinninger S, Loitzenbauer V. Finding 2-edge and 2-vertex strongly connected components in quadratic time. In: 2nd International Colloquium on Automata, Languages and Programming. Vol 9134. Springer Nature; 2015:713-724. doi:10.1007/978-3-662-47672-7_58"},"publication":"2nd International Colloquium on Automata, Languages and Programming","date_published":"2015-07-06T00:00:00Z"},{"extern":"1","publication_status":"published","publisher":"Springer Nature","year":"2015","date_updated":"2023-02-10T09:26:06Z","date_created":"2022-08-11T09:43:32Z","volume":8952,"author":[{"full_name":"Dvořák, Wolfgang","last_name":"Dvořák","first_name":"Wolfgang"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"}],"month":"01","publication_identifier":{"issn":["0302-9743"]},"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1604.05603","open_access":"1"}],"external_id":{"arxiv":["1604.05603"]},"oa":1,"language":[{"iso":"eng"}],"conference":{"end_date":"2014-09-12","location":"Wroclaw, Poland","start_date":"2014-09-11","name":"WAOA: International Workshop on Approximation and Online Algorithms"},"doi":"10.1007/978-3-319-18263-6_14","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"Ad exchanges are becoming an increasingly popular way to sell advertisement slots on the internet. An ad exchange is basically a spot market for ad impressions. A publisher who has already signed contracts reserving advertisement impressions on his pages can choose between assigning a new ad impression for a new page view to a contracted advertiser or to sell it at an ad exchange. This leads to an online revenue maximization problem for the publisher. Given a new impression to sell decide whether (a) to assign it to a contracted advertiser and if so to which one or (b) to sell it at the ad exchange and if so at which reserve price. We make no assumptions about the distribution of the advertiser valuations that participate in the ad exchange and show that there exists a simple primal-dual based online algorithm, whose lower bound for the revenue converges to 𝑅𝐴𝐷𝑋+𝑅𝐴(1−1/𝑒), where 𝑅𝐴𝐷𝑋 is the revenue that the optimum algorithm achieves from the ad exchange and 𝑅𝐴 is the revenue that the optimum algorithm achieves from the contracted advertisers.","lang":"eng"}],"status":"public","title":"Online ad assignment with an ad exchange","intvolume":" 8952","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11788","oa_version":"Preprint","scopus_import":"1","day":"01","article_processing_charge":"No","page":"156–167","publication":"12th International Workshop of Approximation and Online Algorithms","citation":{"ama":"Dvořák W, Henzinger MH. Online ad assignment with an ad exchange. In: 12th International Workshop of Approximation and Online Algorithms. Vol 8952. Springer Nature; 2015:156–167. doi:10.1007/978-3-319-18263-6_14","apa":"Dvořák, W., & Henzinger, M. H. (2015). Online ad assignment with an ad exchange. In 12th International Workshop of Approximation and Online Algorithms (Vol. 8952, pp. 156–167). Wroclaw, Poland: Springer Nature. https://doi.org/10.1007/978-3-319-18263-6_14","ieee":"W. Dvořák and M. H. Henzinger, “Online ad assignment with an ad exchange,” in 12th International Workshop of Approximation and Online Algorithms, Wroclaw, Poland, 2015, vol. 8952, pp. 156–167.","ista":"Dvořák W, Henzinger MH. 2015. Online ad assignment with an ad exchange. 12th International Workshop of Approximation and Online Algorithms. WAOA: International Workshop on Approximation and Online Algorithms, LNCS, vol. 8952, 156–167.","short":"W. Dvořák, M.H. Henzinger, in:, 12th International Workshop of Approximation and Online Algorithms, Springer Nature, 2015, pp. 156–167.","mla":"Dvořák, Wolfgang, and Monika H. Henzinger. “Online Ad Assignment with an Ad Exchange.” 12th International Workshop of Approximation and Online Algorithms, vol. 8952, Springer Nature, 2015, pp. 156–167, doi:10.1007/978-3-319-18263-6_14.","chicago":"Dvořák, Wolfgang, and Monika H Henzinger. “Online Ad Assignment with an Ad Exchange.” In 12th International Workshop of Approximation and Online Algorithms, 8952:156–167. Springer Nature, 2015. https://doi.org/10.1007/978-3-319-18263-6_14."},"date_published":"2015-01-01T00:00:00Z"},{"volume":9134,"date_updated":"2023-02-10T09:13:31Z","date_created":"2022-08-11T09:28:49Z","author":[{"last_name":"Bhattacharya","first_name":"Sayan","full_name":"Bhattacharya, Sayan"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"first_name":"Giuseppe F.","last_name":"Italiano","full_name":"Italiano, Giuseppe F."}],"publisher":"Springer Nature","publication_status":"published","year":"2015","extern":"1","language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-47672-7_17","conference":{"location":"Kyoto, Japan","start_date":"2015-07-06","end_date":"2015-07-10","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"quality_controlled":"1","oa":1,"external_id":{"arxiv":["1604.05337"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.05337"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783662476710"]},"month":"01","oa_version":"Preprint","intvolume":" 9134","status":"public","title":"Design of dynamic algorithms via primal-dual method","_id":"11786","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"In this paper, 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 𝑂(𝑓2)-approximately optimal solution in 𝑂(𝑓⋅log(𝑚+𝑛)) amortized update time, where 𝑓 is the maximum “frequency” of an element, 𝑛 is the number of sets, and 𝑚 is the maximum number of elements in the universe at any point in time. (2) For the dynamic 𝑏-matching problem, we maintain an 𝑂(1)-approximately optimal solution in 𝑂(log3𝑛) amortized update time, where 𝑛 is the number of nodes in the graph."}],"alternative_title":["LNCS"],"type":"conference","date_published":"2015-01-01T00:00:00Z","page":"206 - 218","citation":{"ama":"Bhattacharya S, Henzinger MH, Italiano GF. Design of dynamic algorithms via primal-dual method. In: 42nd International Colloquium on Automata, Languages and Programming. Vol 9134. Springer Nature; 2015:206-218. doi:10.1007/978-3-662-47672-7_17","ista":"Bhattacharya S, Henzinger MH, Italiano GF. 2015. Design of dynamic algorithms via primal-dual method. 42nd International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 9134, 206–218.","apa":"Bhattacharya, S., Henzinger, M. H., & Italiano, G. F. (2015). Design of dynamic algorithms via primal-dual method. In 42nd International Colloquium on Automata, Languages and Programming (Vol. 9134, pp. 206–218). Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47672-7_17","ieee":"S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Design of dynamic algorithms via primal-dual method,” in 42nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 206–218.","mla":"Bhattacharya, Sayan, et al. “Design of Dynamic Algorithms via Primal-Dual Method.” 42nd International Colloquium on Automata, Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 206–18, doi:10.1007/978-3-662-47672-7_17.","short":"S. Bhattacharya, M.H. Henzinger, G.F. Italiano, in:, 42nd International Colloquium on Automata, Languages and Programming, Springer Nature, 2015, pp. 206–218.","chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Design of Dynamic Algorithms via Primal-Dual Method.” In 42nd International Colloquium on Automata, Languages and Programming, 9134:206–18. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47672-7_17."},"publication":"42nd International Colloquium on Automata, Languages and Programming","article_processing_charge":"No","day":"01","scopus_import":"1"},{"extern":"1","file_date_updated":"2022-08-16T06:52:53Z","publisher":"Wiley","publication_status":"published","pmid":1,"year":"2015","volume":6,"date_updated":"2023-02-17T09:30:08Z","date_created":"2022-08-16T06:43:49Z","author":[{"full_name":"Chernomor, Olga","first_name":"Olga","last_name":"Chernomor"},{"first_name":"Bui Quang","last_name":"Minh","full_name":"Minh, Bui Quang"},{"full_name":"Forest, Félix","last_name":"Forest","first_name":"Félix"},{"full_name":"Klaere, Steffen","last_name":"Klaere","first_name":"Steffen"},{"last_name":"Ingram","first_name":"Travis","full_name":"Ingram, Travis"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"von Haeseler, Arndt","first_name":"Arndt","last_name":"von Haeseler"}],"publication_identifier":{"eissn":["2041-210X"]},"month":"01","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["25893087"]},"language":[{"iso":"eng"}],"doi":"10.1111/2041-210x.12299","type":"journal_article","issue":"1","abstract":[{"text":"Phylogenetic diversity (PD) is a measure of biodiversity based on the evolutionary history of species. Here, we discuss several optimization problems related to the use of PD, and the more general measure split diversity (SD), in conservation prioritization.\r\nDepending on the conservation goal and the information available about species, one can construct optimization routines that incorporate various conservation constraints. We demonstrate how this information can be used to select sets of species for conservation action. Specifically, we discuss the use of species' geographic distributions, the choice of candidates under economic pressure, and the use of predator–prey interactions between the species in a community to define viability constraints.\r\nDespite such optimization problems falling into the area of NP hard problems, it is possible to solve them in a reasonable amount of time using integer programming. We apply integer linear programming to a variety of models for conservation prioritization that incorporate the SD measure.\r\nWe exemplarily show the results for two data sets: the Cape region of South Africa and a Caribbean coral reef community. Finally, we provide user-friendly software at http://www.cibiv.at/software/pda.","lang":"eng"}],"intvolume":" 6","status":"public","ddc":["570"],"title":"Split diversity in constrained conservation prioritization using integer linear programming","_id":"11845","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"creator":"asandaue","file_size":411415,"content_type":"application/pdf","access_level":"open_access","file_name":"2015_MethodsInEcologyAndEvolutionChernomor.pdf","success":1,"checksum":"880e78f09f0ac99cb351c48dc97623b6","date_updated":"2022-08-16T06:52:53Z","date_created":"2022-08-16T06:52:53Z","file_id":"11846","relation":"main_file"}],"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01","page":"83-91","article_type":"original","citation":{"short":"O. Chernomor, B.Q. Minh, F. Forest, S. Klaere, T. Ingram, M.H. Henzinger, A. von Haeseler, Methods in Ecology and Evolution 6 (2015) 83–91.","mla":"Chernomor, Olga, et al. “Split Diversity in Constrained Conservation Prioritization Using Integer Linear Programming.” Methods in Ecology and Evolution, vol. 6, no. 1, Wiley, 2015, pp. 83–91, doi:10.1111/2041-210x.12299.","chicago":"Chernomor, Olga, Bui Quang Minh, Félix Forest, Steffen Klaere, Travis Ingram, Monika H Henzinger, and Arndt von Haeseler. “Split Diversity in Constrained Conservation Prioritization Using Integer Linear Programming.” Methods in Ecology and Evolution. Wiley, 2015. https://doi.org/10.1111/2041-210x.12299.","ama":"Chernomor O, Minh BQ, Forest F, et al. Split diversity in constrained conservation prioritization using integer linear programming. Methods in Ecology and Evolution. 2015;6(1):83-91. doi:10.1111/2041-210x.12299","ieee":"O. Chernomor et al., “Split diversity in constrained conservation prioritization using integer linear programming,” Methods in Ecology and Evolution, vol. 6, no. 1. Wiley, pp. 83–91, 2015.","apa":"Chernomor, O., Minh, B. Q., Forest, F., Klaere, S., Ingram, T., Henzinger, M. H., & von Haeseler, A. (2015). Split diversity in constrained conservation prioritization using integer linear programming. Methods in Ecology and Evolution. Wiley. https://doi.org/10.1111/2041-210x.12299","ista":"Chernomor O, Minh BQ, Forest F, Klaere S, Ingram T, Henzinger MH, von Haeseler A. 2015. Split diversity in constrained conservation prioritization using integer linear programming. Methods in Ecology and Evolution. 6(1), 83–91."},"publication":"Methods in Ecology and Evolution","date_published":"2015-01-01T00:00:00Z"},{"external_id":{"arxiv":["1511.06773"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.06773"}],"citation":{"chicago":"Henzinger, Monika H, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak. “Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture.” In 47th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, 2015. https://doi.org/10.1145/2746539.2746609.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, T. Saranurak, in:, 47th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2015.","mla":"Henzinger, Monika H., et al. “Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture.” 47th Annual ACM Symposium on Theory of Computing, 21–30, Association for Computing Machinery, 2015, doi:10.1145/2746539.2746609.","ieee":"M. H. Henzinger, S. Krinninger, D. Nanongkai, and T. Saranurak, “Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture,” in 47th Annual ACM Symposium on Theory of Computing, Portland, OR, United States, 2015.","apa":"Henzinger, M. H., Krinninger, S., Nanongkai, D., & Saranurak, T. (2015). Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In 47th Annual ACM Symposium on Theory of Computing. Portland, OR, United States: Association for Computing Machinery. https://doi.org/10.1145/2746539.2746609","ista":"Henzinger MH, Krinninger S, Nanongkai D, Saranurak T. 2015. Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. 47th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 21–30.","ama":"Henzinger MH, Krinninger S, Nanongkai D, Saranurak T. Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In: 47th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2015. doi:10.1145/2746539.2746609"},"oa":1,"publication":"47th Annual ACM Symposium on Theory of Computing","quality_controlled":"1","date_published":"2015-06-14T00:00:00Z","doi":"10.1145/2746539.2746609","conference":{"name":"STOC: Symposium on Theory of Computing","location":"Portland, OR, United States","start_date":"2015-06-14","end_date":"2015-06-17"},"language":[{"iso":"eng"}],"scopus_import":"1","publication_identifier":{"isbn":["978-145033536-2"],"issn":["0737.8017"]},"article_processing_charge":"No","month":"06","day":"14","_id":"11868","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Association for Computing Machinery","publication_status":"published","title":"Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture","status":"public","author":[{"last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"},{"first_name":"Thatchaphol","last_name":"Saranurak","full_name":"Saranurak, Thatchaphol"}],"oa_version":"Preprint","date_created":"2022-08-16T09:31:21Z","date_updated":"2023-02-17T11:09:54Z","type":"conference","article_number":"21-30","abstract":[{"text":"Consider the following Online Boolean Matrix-Vector Multiplication problem: We are given an n x n matrix M and will receive n column-vectors of size n, denoted by v1, ..., vn, one by one. After seeing each vector vi, we have to output the product Mvi before we can see the next vector. A naive algorithm can solve this problem using O(n3) time in total, and its running time can be slightly improved to O(n3/log2 n) [Williams SODA'07]. We show that a conjecture that there is no truly subcubic (O(n3-ε)) time algorithm for this problem can be used to exhibit the underlying polynomial time hardness shared by many dynamic problems. For a number of problems, such as subgraph connectivity, Pagh's problem, d-failure connectivity, decremental single-source shortest paths, and decremental transitive closure, this conjecture implies tight hardness results. Thus, proving or disproving this conjecture will be very interesting as it will either imply several tight unconditional lower bounds or break through a common barrier that blocks progress with these problems. This conjecture might also be considered as strong evidence against any further improvement for these problems since refuting it will imply a major breakthrough for combinatorial Boolean matrix multiplication and other long-standing problems if the term \"combinatorial algorithms\" is interpreted as \"Strassen-like algorithms\" [Ballard et al. SPAA'11].\r\n\r\nThe conjecture also leads to hardness results for problems that were previously based on diverse problems and conjectures -- such as 3SUM, combinatorial Boolean matrix multiplication, triangle detection, and multiphase -- thus providing a uniform way to prove polynomial hardness results for dynamic algorithms; some of the new proofs are also simpler or even become trivial. The conjecture also leads to stronger and new, non-trivial, hardness results, e.g., for the fully-dynamic densest subgraph and diameter problems.","lang":"eng"}],"extern":"1"},{"type":"conference","extern":"1","abstract":[{"text":"While in many graph mining applications it is crucial to handle a stream of updates efficiently in terms of both time and space, not much was known about achieving such type of algorithm. In this paper we study this issue for a problem which lies at the core of many graph mining applications called densest subgraph problem. We develop an algorithm that achieves time- and space-efficiency for this problem simultaneously. It is one of the first of its kind for graph problems to the best of our knowledge.\r\n\r\nGiven an input graph, the densest subgraph is the subgraph that maximizes the ratio between the number of edges and the number of nodes. For any ε>0, our algorithm can, with high probability, maintain a (4+ε)-approximate solution under edge insertions and deletions using ~O(n) space and ~O(1) amortized time per update; here, $n$ is the number of nodes in the graph and ~O hides the O(polylog_{1+ε} n) term. The approximation ratio can be improved to (2+ε) with more time. It can be extended to a (2+ε)-approximation sublinear-time algorithm and a distributed-streaming algorithm. Our algorithm is the first streaming algorithm that can maintain the densest subgraph in one pass. Prior to this, no algorithm could do so even in the special case of an incremental stream and even when there is no time restriction. The previously best algorithm in this setting required O(log n) passes [BahmaniKV12]. The space required by our algorithm is tight up to a polylogarithmic factor.","lang":"eng"}],"status":"public","publication_status":"published","title":"Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams","publisher":"Association for Computing Machinery","year":"2015","_id":"11869","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-17T11:17:03Z","date_created":"2022-08-16T09:36:48Z","oa_version":"Preprint","author":[{"full_name":"Bhattacharya, Sayan","first_name":"Sayan","last_name":"Bhattacharya"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"},{"last_name":"Tsourakakis","first_name":"Charalampos","full_name":"Tsourakakis, Charalampos"}],"scopus_import":"1","month":"06","day":"01","publication_identifier":{"issn":["0737-8017"],"isbn":["978-145033536-2"]},"article_processing_charge":"No","quality_controlled":"1","page":"173 - 182","publication":"47th Annual ACM Symposium on Theory of Computing","citation":{"ama":"Bhattacharya S, Henzinger MH, Nanongkai D, Tsourakakis C. Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In: 47th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2015:173-182. doi:10.1145/2746539.2746592","apa":"Bhattacharya, S., Henzinger, M. H., Nanongkai, D., & Tsourakakis, C. (2015). Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In 47th Annual ACM Symposium on Theory of Computing (pp. 173–182). Portland, OR, United States: Association for Computing Machinery. https://doi.org/10.1145/2746539.2746592","ieee":"S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and C. Tsourakakis, “Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams,” in 47th Annual ACM Symposium on Theory of Computing, Portland, OR, United States, 2015, pp. 173–182.","ista":"Bhattacharya S, Henzinger MH, Nanongkai D, Tsourakakis C. 2015. Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. 47th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 173–182.","short":"S. Bhattacharya, M.H. Henzinger, D. Nanongkai, C. Tsourakakis, in:, 47th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2015, pp. 173–182.","mla":"Bhattacharya, Sayan, et al. “Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams.” 47th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2015, pp. 173–82, doi:10.1145/2746539.2746592.","chicago":"Bhattacharya, Sayan, Monika H Henzinger, Danupon Nanongkai, and Charalampos Tsourakakis. “Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams.” In 47th Annual ACM Symposium on Theory of Computing, 173–82. Association for Computing Machinery, 2015. https://doi.org/10.1145/2746539.2746592."},"external_id":{"arxiv":["1504.02268"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1504.02268","open_access":"1"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2015-06-17","start_date":"2015-06-14","location":"Portland, OR, United States","name":"STOC: Symposium on Theory of Computing"},"date_published":"2015-06-01T00:00:00Z","doi":"10.1145/2746539.2746592"},{"extern":"1","year":"2015","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya","first_name":"Sayan"},{"first_name":"Wolfgang","last_name":"Dvorák","full_name":"Dvorák, Wolfgang"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"first_name":" Martin","last_name":"Starnberger","full_name":"Starnberger, Martin"}],"related_material":{"record":[{"id":"11903","relation":"later_version","status":"public"}]},"date_created":"2022-08-12T11:39:40Z","date_updated":"2023-02-21T16:32:37Z","volume":30,"month":"02","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-939897-78-1"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPICS.STACS.2015.90"}],"quality_controlled":"1","conference":{"start_date":"2015-03-04","location":"Garching, Germany","end_date":"2015-03-07","name":"STACS: Symposium on Theoretical Aspects of Computer Science"},"doi":"10.4230/LIPICS.STACS.2015.90","language":[{"iso":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"abstract":[{"text":"Online social networks allow the collection of large amounts of data about the influence between users connected by a friendship-like relationship. When distributing items among agents forming a social network, this information allows us to exploit network externalities that each agent receives from his neighbors that get the same item. In this paper we consider Friends-of-Friends (2-hop) network externalities, i.e., externalities that not only depend on the neighbors that get the same item but also on neighbors of neighbors. For these externalities we study a setting where multiple different items are assigned to unit-demand agents. Specifically, we study the problem of welfare maximization under different types of externality functions. Let n be the number of agents and m be the number of items. Our contributions are the following: (1) We show that welfare maximization is APX-hard; we show that even for step functions with 2-hop (and also with 1-hop) externalities it is NP-hard to approximate social welfare better than (1-1/e). (2) On the positive side we present (i) an O(sqrt n)-approximation algorithm for general concave externality functions,\r\n(ii) an O(\\log m)-approximation algorithm for linear externality functions, and (iii) an (1-1/e)\\frac{1}{6}-approximation algorithm for 2-hop step function externalities. We also improve the result from [6] for 1-hop step function externalities by giving a (1-1/e)/2-approximation algorithm.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11837","title":"Welfare maximization with friends-of-friends network externalities","status":"public","intvolume":" 30","oa_version":"Published Version","scopus_import":"1","day":"26","article_processing_charge":"No","publication":"32nd International Symposium on Theoretical Aspects of Computer Science","citation":{"mla":"Bhattacharya, Sayan, et al. “Welfare Maximization with Friends-of-Friends Network Externalities.” 32nd International Symposium on Theoretical Aspects of Computer Science, vol. 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 90–102, doi:10.4230/LIPICS.STACS.2015.90.","short":"S. Bhattacharya, W. Dvorák, M.H. Henzinger, Martin Starnberger, in:, 32nd International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 90–102.","chicago":"Bhattacharya, Sayan, Wolfgang Dvorák, Monika H Henzinger, and Martin Starnberger. “Welfare Maximization with Friends-of-Friends Network Externalities.” In 32nd International Symposium on Theoretical Aspects of Computer Science, 30:90–102. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. https://doi.org/10.4230/LIPICS.STACS.2015.90.","ama":"Bhattacharya S, Dvorák W, Henzinger MH, Starnberger Martin. Welfare maximization with friends-of-friends network externalities. In: 32nd International Symposium on Theoretical Aspects of Computer Science. Vol 30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:90-102. doi:10.4230/LIPICS.STACS.2015.90","ista":"Bhattacharya S, Dvorák W, Henzinger MH, Starnberger Martin. 2015. Welfare maximization with friends-of-friends network externalities. 32nd International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 30, 90–102.","apa":"Bhattacharya, S., Dvorák, W., Henzinger, M. H., & Starnberger, Martin. (2015). Welfare maximization with friends-of-friends network externalities. In 32nd International Symposium on Theoretical Aspects of Computer Science (Vol. 30, pp. 90–102). Garching, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.STACS.2015.90","ieee":"S. Bhattacharya, W. Dvorák, M. H. Henzinger, and Martin Starnberger, “Welfare maximization with friends-of-friends network externalities,” in 32nd International Symposium on Theoretical Aspects of Computer Science, Garching, Germany, 2015, vol. 30, pp. 90–102."},"page":"90-102","date_published":"2015-02-26T00:00:00Z"},{"extern":"1","author":[{"last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Loitzenbauer, Veronika","first_name":"Veronika","last_name":"Loitzenbauer"}],"date_updated":"2023-02-17T14:50:04Z","date_created":"2022-08-17T09:06:53Z","volume":573,"year":"2015","publication_status":"published","publisher":"Elsevier","month":"03","publication_identifier":{"issn":["0304-3975"]},"doi":"10.1016/j.tcs.2015.01.033","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.tcs.2015.01.033"}],"oa":1,"quality_controlled":"1","abstract":[{"text":"We consider auctions of indivisible items to unit-demand bidders with budgets. This setting was suggested as an expressive model for single sponsored search auctions. Prior work presented mechanisms that compute bidder-optimal outcomes and are truthful for a restricted set of inputs, i.e., inputs in so-called general position. This condition is easily violated. We provide the first mechanism that is truthful in expectation for all inputs and achieves for each bidder no worse utility than the bidder-optimal outcome. Additionally we give a complete characterization for which inputs mechanisms that compute bidder-optimal outcomes are truthful.","lang":"eng"}],"type":"journal_article","oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11901","title":"Truthful unit-demand auctions with budgets revisited","status":"public","intvolume":" 573","day":"30","article_processing_charge":"No","scopus_import":"1","date_published":"2015-03-30T00:00:00Z","publication":"Theoretical Computer Science","citation":{"ama":"Henzinger MH, Loitzenbauer V. Truthful unit-demand auctions with budgets revisited. Theoretical Computer Science. 2015;573:1-15. doi:10.1016/j.tcs.2015.01.033","ieee":"M. H. Henzinger and V. Loitzenbauer, “Truthful unit-demand auctions with budgets revisited,” Theoretical Computer Science, vol. 573. Elsevier, pp. 1–15, 2015.","apa":"Henzinger, M. H., & Loitzenbauer, V. (2015). Truthful unit-demand auctions with budgets revisited. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2015.01.033","ista":"Henzinger MH, Loitzenbauer V. 2015. Truthful unit-demand auctions with budgets revisited. Theoretical Computer Science. 573, 1–15.","short":"M.H. Henzinger, V. Loitzenbauer, Theoretical Computer Science 573 (2015) 1–15.","mla":"Henzinger, Monika H., and Veronika Loitzenbauer. “Truthful Unit-Demand Auctions with Budgets Revisited.” Theoretical Computer Science, vol. 573, Elsevier, 2015, pp. 1–15, doi:10.1016/j.tcs.2015.01.033.","chicago":"Henzinger, Monika H, and Veronika Loitzenbauer. “Truthful Unit-Demand Auctions with Budgets Revisited.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.01.033."},"article_type":"original","page":"1-15"},{"date_published":"2015-03-09T00:00:00Z","article_type":"original","page":"4368-4376","publication":"Chemistry - A European Journal","citation":{"mla":"Pieber, Bartholomäus, et al. “Continuous Flow Reduction of Artemisinic Acid Utilizing Multi-Injection Strategies-Closing the Gap towards a Fully Continuous Synthesis of Antimalarial Drugs.” Chemistry - A European Journal, vol. 21, no. 11, Wiley, 2015, pp. 4368–76, doi:10.1002/chem.201406439.","short":"B. Pieber, T. Glasnov, C.O. Kappe, Chemistry - A European Journal 21 (2015) 4368–4376.","chicago":"Pieber, Bartholomäus, Toma Glasnov, and C. Oliver Kappe. “Continuous Flow Reduction of Artemisinic Acid Utilizing Multi-Injection Strategies-Closing the Gap towards a Fully Continuous Synthesis of Antimalarial Drugs.” Chemistry - A European Journal. Wiley, 2015. https://doi.org/10.1002/chem.201406439.","ama":"Pieber B, Glasnov T, Kappe CO. Continuous flow reduction of artemisinic acid utilizing multi-injection strategies-closing the gap towards a fully continuous synthesis of antimalarial drugs. Chemistry - A European Journal. 2015;21(11):4368-4376. doi:10.1002/chem.201406439","ista":"Pieber B, Glasnov T, Kappe CO. 2015. Continuous flow reduction of artemisinic acid utilizing multi-injection strategies-closing the gap towards a fully continuous synthesis of antimalarial drugs. Chemistry - A European Journal. 21(11), 4368–4376.","ieee":"B. Pieber, T. Glasnov, and C. O. Kappe, “Continuous flow reduction of artemisinic acid utilizing multi-injection strategies-closing the gap towards a fully continuous synthesis of antimalarial drugs,” Chemistry - A European Journal, vol. 21, no. 11. Wiley, pp. 4368–4376, 2015.","apa":"Pieber, B., Glasnov, T., & Kappe, C. O. (2015). Continuous flow reduction of artemisinic acid utilizing multi-injection strategies-closing the gap towards a fully continuous synthesis of antimalarial drugs. Chemistry - A European Journal. Wiley. https://doi.org/10.1002/chem.201406439"},"day":"09","article_processing_charge":"No","scopus_import":"1","oa_version":"None","title":"Continuous flow reduction of artemisinic acid utilizing multi-injection strategies-closing the gap towards a fully continuous synthesis of antimalarial drugs","status":"public","intvolume":" 21","_id":"11962","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"One of the rare alternative reagents for the reduction of carbon–carbon double bonds is diimide (HNNH), which can be generated in situ from hydrazine hydrate (N2H4⋅H2O) and O2. Although this selective method is extremely clean and powerful, it is rarely used, as the rate-determining oxidation of hydrazine in the absence of a catalyst is relatively slow using conventional batch protocols. A continuous high-temperature/high-pressure methodology dramatically enhances the initial oxidation step, at the same time allowing for a safe and scalable processing of the hazardous reaction mixture. Simple alkenes can be selectively reduced within 10–20 min at 100–120 °C and 20 bar O2 pressure. The development of a multi-injection reactor platform for the periodic addition of N2H4⋅H2O enables the reduction of less reactive olefins even at lower reaction temperatures. This concept was utilized for the highly selective reduction of artemisinic acid to dihydroartemisinic acid, the precursor molecule for the semisynthesis of the antimalarial drug artemisinin. The industrially relevant reduction was achieved by using four consecutive liquid feeds (of N2H4⋅H2O) and residence time units resulting in a highly selective reduction within approximately 40 min at 60 °C and 20 bar O2 pressure, providing dihydroartemisinic acid in ≥93 % yield and ≥95 % selectivity.","lang":"eng"}],"issue":"11","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1002/chem.201406439","quality_controlled":"1","external_id":{"pmid":["25655090"]},"month":"03","publication_identifier":{"eissn":["1521-3765"],"issn":["0947-6539"]},"date_created":"2022-08-24T11:11:10Z","date_updated":"2023-02-21T10:09:30Z","volume":21,"author":[{"full_name":"Pieber, Bartholomäus","last_name":"Pieber","first_name":"Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726"},{"last_name":"Glasnov","first_name":"Toma","full_name":"Glasnov, Toma"},{"full_name":"Kappe, C. Oliver","last_name":"Kappe","first_name":"C. Oliver"}],"publication_status":"published","publisher":"Wiley","year":"2015","pmid":1,"extern":"1"},{"scopus_import":"1","day":"01","article_processing_charge":"No","article_type":"original","page":"4590-4602","publication":"The Journal of Organic Chemistry","citation":{"ama":"Salvador CEM, Pieber B, Neu PM, Torvisco A, Kleber Z. Andrade C, Kappe CO. A sequential Ugi multicomponent/Cu-catalyzed azide–alkyne cycloaddition approach for the continuous flow generation of cyclic peptoids. The Journal of Organic Chemistry. 2015;80(9):4590-4602. doi:10.1021/acs.joc.5b00445","ista":"Salvador CEM, Pieber B, Neu PM, Torvisco A, Kleber Z. Andrade C, Kappe CO. 2015. A sequential Ugi multicomponent/Cu-catalyzed azide–alkyne cycloaddition approach for the continuous flow generation of cyclic peptoids. The Journal of Organic Chemistry. 80(9), 4590–4602.","ieee":"C. E. M. Salvador, B. Pieber, P. M. Neu, A. Torvisco, C. Kleber Z. Andrade, and C. O. Kappe, “A sequential Ugi multicomponent/Cu-catalyzed azide–alkyne cycloaddition approach for the continuous flow generation of cyclic peptoids,” The Journal of Organic Chemistry, vol. 80, no. 9. American Chemical Society, pp. 4590–4602, 2015.","apa":"Salvador, C. E. M., Pieber, B., Neu, P. M., Torvisco, A., Kleber Z. Andrade, C., & Kappe, C. O. (2015). A sequential Ugi multicomponent/Cu-catalyzed azide–alkyne cycloaddition approach for the continuous flow generation of cyclic peptoids. The Journal of Organic Chemistry. American Chemical Society. https://doi.org/10.1021/acs.joc.5b00445","mla":"Salvador, Carlos Eduardo M., et al. “A Sequential Ugi Multicomponent/Cu-Catalyzed Azide–Alkyne Cycloaddition Approach for the Continuous Flow Generation of Cyclic Peptoids.” The Journal of Organic Chemistry, vol. 80, no. 9, American Chemical Society, 2015, pp. 4590–602, doi:10.1021/acs.joc.5b00445.","short":"C.E.M. Salvador, B. Pieber, P.M. Neu, A. Torvisco, C. Kleber Z. Andrade, C.O. Kappe, The Journal of Organic Chemistry 80 (2015) 4590–4602.","chicago":"Salvador, Carlos Eduardo M., Bartholomäus Pieber, Philipp M. Neu, Ana Torvisco, Carlos Kleber Z. Andrade, and C. Oliver Kappe. “A Sequential Ugi Multicomponent/Cu-Catalyzed Azide–Alkyne Cycloaddition Approach for the Continuous Flow Generation of Cyclic Peptoids.” The Journal of Organic Chemistry. American Chemical Society, 2015. https://doi.org/10.1021/acs.joc.5b00445."},"date_published":"2015-05-01T00:00:00Z","type":"journal_article","abstract":[{"text":"The development of a continuous flow multistep strategy for the synthesis of linear peptoids and their subsequent macrocyclization via Click chemistry is described. The central transformation of this process is an Ugi four-component reaction generating the peptidomimetic core structure. In order to avoid exposure to the often toxic and malodorous isocyanide building blocks, the continuous approach was telescoped by the dehydration of the corresponding formamide. In a concurrent operation, the highly energetic azide moiety required for the subsequent intramolecular copper-catalyzed azide–alkyne cycloaddition (Click reaction) was installed by nucleophilic substitution from a bromide precursor. All steps yielding to the linear core structures can be conveniently coupled without the need for purification steps resulting in a single process generating the desired peptidomimetics in good to excellent yields within a 25 min reaction time. The following macrocyclization was realized in a coil reactor made of copper without any additional additive. A careful process intensification study demonstrated that this transformation occurs quantitatively within 25 min at 140 °C. Depending on the resulting ring strain, either a dimeric or a monomeric form of the cyclic product was obtained.","lang":"eng"}],"issue":"9","status":"public","title":"A sequential Ugi multicomponent/Cu-catalyzed azide–alkyne cycloaddition approach for the continuous flow generation of cyclic peptoids","intvolume":" 80","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11977","oa_version":"None","month":"05","publication_identifier":{"issn":["0022-3263"],"eissn":["1520-6904"]},"quality_controlled":"1","external_id":{"pmid":["25842982"]},"language":[{"iso":"eng"}],"doi":"10.1021/acs.joc.5b00445","extern":"1","publication_status":"published","publisher":"American Chemical Society","year":"2015","pmid":1,"date_updated":"2023-02-21T10:10:04Z","date_created":"2022-08-25T10:52:24Z","volume":80,"author":[{"full_name":"Salvador, Carlos Eduardo M.","first_name":"Carlos Eduardo M.","last_name":"Salvador"},{"full_name":"Pieber, Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","first_name":"Bartholomäus","last_name":"Pieber"},{"full_name":"Neu, Philipp M.","first_name":"Philipp M.","last_name":"Neu"},{"full_name":"Torvisco, Ana","first_name":"Ana","last_name":"Torvisco"},{"full_name":"Kleber Z. Andrade, Carlos","first_name":"Carlos","last_name":"Kleber Z. Andrade"},{"first_name":"C. Oliver","last_name":"Kappe","full_name":"Kappe, C. Oliver"}]},{"month":"06","publication_identifier":{"issn":["1436-6002"],"eisbn":["9783319332437"],"isbn":["9783319332413"],"eissn":["1616-8534"]},"doi":"10.1007/3418_2015_133","language":[{"iso":"eng"}],"quality_controlled":"1","extern":"1","place":"Cham","author":[{"full_name":"Pieber, Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","first_name":"Bartholomäus","last_name":"Pieber"},{"full_name":"Kappe, C. Oliver","last_name":"Kappe","first_name":"C. Oliver"}],"edition":"1","date_updated":"2023-02-21T10:10:35Z","date_created":"2022-08-25T11:58:38Z","volume":57,"year":"2015","publication_status":"published","publisher":"Springer Nature","editor":[{"full_name":"Noël, Timothy","last_name":"Noël","first_name":"Timothy"}],"day":"10","article_processing_charge":"No","scopus_import":"1","series_title":"TOPORGAN","date_published":"2015-06-10T00:00:00Z","publication":"Organometallic Flow Chemistry","citation":{"mla":"Pieber, Bartholomäus, and C. Oliver Kappe. “Aerobic Oxidations in Continuous Flow.” Organometallic Flow Chemistry, edited by Timothy Noël, 1st ed., vol. 57, Springer Nature, 2015, pp. 97–136, doi:10.1007/3418_2015_133.","short":"B. Pieber, C.O. Kappe, in:, T. Noël (Ed.), Organometallic Flow Chemistry, 1st ed., Springer Nature, Cham, 2015, pp. 97–136.","chicago":"Pieber, Bartholomäus, and C. Oliver Kappe. “Aerobic Oxidations in Continuous Flow.” In Organometallic Flow Chemistry, edited by Timothy Noël, 1st ed., 57:97–136. TOPORGAN. Cham: Springer Nature, 2015. https://doi.org/10.1007/3418_2015_133.","ama":"Pieber B, Kappe CO. Aerobic oxidations in continuous flow. In: Noël T, ed. Organometallic Flow Chemistry. Vol 57. 1st ed. TOPORGAN. Cham: Springer Nature; 2015:97–136. doi:10.1007/3418_2015_133","ista":"Pieber B, Kappe CO. 2015.Aerobic oxidations in continuous flow. In: Organometallic Flow Chemistry. Topics in Organometallic Chemistry, vol. 57, 97–136.","apa":"Pieber, B., & Kappe, C. O. (2015). Aerobic oxidations in continuous flow. In T. Noël (Ed.), Organometallic Flow Chemistry (1st ed., Vol. 57, pp. 97–136). Cham: Springer Nature. https://doi.org/10.1007/3418_2015_133","ieee":"B. Pieber and C. O. Kappe, “Aerobic oxidations in continuous flow,” in Organometallic Flow Chemistry, 1st ed., vol. 57, T. Noël, Ed. Cham: Springer Nature, 2015, pp. 97–136."},"page":"97–136","abstract":[{"text":"In recent years, the high demand for sustainable processes resulted in the development of highly attractive oxidation protocols utilizing molecular oxygen or even air instead of more uneconomic and often toxic reagents. The application of these sustainable, gaseous oxidants in conventional batch reactors is often associated with severe safety risks and process challenges especially on larger scales. Continuous flow technology offers the possibility to minimize these safety hazards and concurrently allows working in high-temperature/high-pressure regimes to access highly efficient oxidation protocols. This review article critically discusses recent literature examples of flow methodologies for selective aerobic oxidations of organic compounds. Several technologies and reactor designs for biphasic gas/liquid as well as supercritical reaction media are presented in detail. © Springer International Publishing Switzerland 2015.","lang":"eng"}],"type":"book_chapter","alternative_title":["Topics in Organometallic Chemistry"],"oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11989","status":"public","title":"Aerobic oxidations in continuous flow","intvolume":" 57"},{"type":"journal_article","extern":"1","abstract":[{"text":"Clustering of fine particles is of crucial importance in settings ranging from the early stages of planet formation to the coagulation of industrial powders and airborne pollutants. Models of such clustering typically focus on inelastic deformation and cohesion. However, even in charge-neutral particle systems comprising grains of the same dielectric material, tribocharging can generate large amounts of net positive or negative charge on individual particles, resulting in long-range electrostatic forces. The effects of such forces on cluster formation are not well understood and have so far not been studied in situ. Here we report the first observations of individual collide-and-capture events between charged submillimetre particles, including Kepler-like orbits. Charged particles can become trapped in their mutual electrostatic energy well and aggregate via multiple bounces. This enables the initiation of clustering at relative velocities much larger than the upper limit for sticking after a head-on collision, a long-standing issue known from pre-planetary dust aggregation. Moreover, Coulomb interactions together with dielectric polarization are found to stabilize characteristic molecule-like configurations, providing new insights for the modelling of clustering dynamics in a wide range of microscopic dielectric systems, such as charged polarizable ions, biomolecules and colloids.","lang":"eng"}],"issue":"9","publist_id":"7934","publication_status":"published","title":"Direct observation of particle interactions and clustering in charged granular streams","status":"public","intvolume":" 11","publisher":"Nature Publishing Group","acknowledgement":"This research was supported by NSF through DMR-1309611. The Chicago MRSEC, supported by NSF DMR-1420709, is gratefully acknowledged for access to its shared experimental facilities.","_id":"120","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2015","date_created":"2018-12-11T11:44:44Z","date_updated":"2021-01-12T06:49:02Z","oa_version":"None","volume":11,"author":[{"full_name":"Lee, Victor","last_name":"Lee","first_name":"Victor"},{"orcid":"0000-0002-2299-3176","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","last_name":"Waitukaitis","first_name":"Scott R","full_name":"Waitukaitis, Scott R"},{"first_name":"Marc","last_name":"Miskin","full_name":"Miskin, Marc"},{"full_name":"Jaeger, Heinrich","last_name":"Jaeger","first_name":"Heinrich"}],"month":"07","day":"13","quality_controlled":"1","page":"733 - 737","publication":"Nature Physics","citation":{"ieee":"V. Lee, S. R. Waitukaitis, M. Miskin, and H. Jaeger, “Direct observation of particle interactions and clustering in charged granular streams,” Nature Physics, vol. 11, no. 9. Nature Publishing Group, pp. 733–737, 2015.","apa":"Lee, V., Waitukaitis, S. R., Miskin, M., & Jaeger, H. (2015). Direct observation of particle interactions and clustering in charged granular streams. Nature Physics. Nature Publishing Group. https://doi.org/10.1038/nphys3396","ista":"Lee V, Waitukaitis SR, Miskin M, Jaeger H. 2015. Direct observation of particle interactions and clustering in charged granular streams. Nature Physics. 11(9), 733–737.","ama":"Lee V, Waitukaitis SR, Miskin M, Jaeger H. Direct observation of particle interactions and clustering in charged granular streams. Nature Physics. 2015;11(9):733-737. doi:10.1038/nphys3396","chicago":"Lee, Victor, Scott R Waitukaitis, Marc Miskin, and Heinrich Jaeger. “Direct Observation of Particle Interactions and Clustering in Charged Granular Streams.” Nature Physics. Nature Publishing Group, 2015. https://doi.org/10.1038/nphys3396.","short":"V. Lee, S.R. Waitukaitis, M. Miskin, H. Jaeger, Nature Physics 11 (2015) 733–737.","mla":"Lee, Victor, et al. “Direct Observation of Particle Interactions and Clustering in Charged Granular Streams.” Nature Physics, vol. 11, no. 9, Nature Publishing Group, 2015, pp. 733–37, doi:10.1038/nphys3396."},"language":[{"iso":"eng"}],"doi":"10.1038/nphys3396","date_published":"2015-07-13T00:00:00Z"},{"intvolume":" 114","title":"Origami multistability: From single vertices to metasheets","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"121","oa_version":"Preprint","type":"journal_article","issue":"5","abstract":[{"text":"We show that the simplest building blocks of origami-based materials - rigid, degree-four vertices - are generically multistable. The existence of two distinct branches of folding motion emerging from the flat state suggests at least bistability, but we show how nonlinearities in the folding motions allow generic vertex geometries to have as many as five stable states. In special geometries with collinear folds and symmetry, more branches emerge leading to as many as six stable states. Tuning the fold energy parameters, we show how monostability is also possible. Finally, we show how to program the stability features of a single vertex into a periodic fold tessellation. The resulting metasheets provide a previously unanticipated functionality - tunable and switchable shape and size via multistability.","lang":"eng"}],"citation":{"apa":"Waitukaitis, S. R., Menaut, R., Chen, B., & Van Hecke, M. (2015). Origami multistability: From single vertices to metasheets. APS Physics, Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.114.055503","ieee":"S. R. Waitukaitis, R. Menaut, B. Chen, and M. Van Hecke, “Origami multistability: From single vertices to metasheets,” APS Physics, Physical Review Letters, vol. 114, no. 5. American Physical Society, 2015.","ista":"Waitukaitis SR, Menaut R, Chen B, Van Hecke M. 2015. Origami multistability: From single vertices to metasheets. APS Physics, Physical Review Letters. 114(5), 055503.","ama":"Waitukaitis SR, Menaut R, Chen B, Van Hecke M. Origami multistability: From single vertices to metasheets. APS Physics, Physical Review Letters. 2015;114(5). doi:10.1103/PhysRevLett.114.055503","chicago":"Waitukaitis, Scott R, Rémi Menaut, Bryan Chen, and Martin Van Hecke. “Origami Multistability: From Single Vertices to Metasheets.” APS Physics, Physical Review Letters. American Physical Society, 2015. https://doi.org/10.1103/PhysRevLett.114.055503.","short":"S.R. Waitukaitis, R. Menaut, B. Chen, M. Van Hecke, APS Physics, Physical Review Letters 114 (2015).","mla":"Waitukaitis, Scott R., et al. “Origami Multistability: From Single Vertices to Metasheets.” APS Physics, Physical Review Letters, vol. 114, no. 5, 055503, American Physical Society, 2015, doi:10.1103/PhysRevLett.114.055503."},"publication":"APS Physics, Physical Review Letters","date_published":"2015-02-04T00:00:00Z","day":"04","publisher":"American Physical Society","publication_status":"published","year":"2015","acknowledgement":"B. G. C. acknowledges support from FOM, and S. W. and M. v. H. acknowledge support from NWO.","volume":114,"date_updated":"2021-01-12T06:49:07Z","date_created":"2018-12-11T11:44:44Z","author":[{"first_name":"Scott R","last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R"},{"last_name":"Menaut","first_name":"Rémi","full_name":"Menaut, Rémi"},{"full_name":"Chen, Bryan","last_name":"Chen","first_name":"Bryan"},{"first_name":"Martin","last_name":"Van Hecke","full_name":"Van Hecke, Martin"}],"article_number":"055503","extern":"1","publist_id":"7933","quality_controlled":"1","external_id":{"arxiv":["1408.1607"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1408.1607"}],"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevLett.114.055503","month":"02"},{"type":"journal_article","publist_id":"5958","issue":"1","abstract":[{"text":"In this paper, we develop an energy method to study finite speed of propagation and waiting time phenomena for the stochastic porous media equation with linear multiplicative noise in up to three spatial dimensions. Based on a novel iteration technique and on stochastic counterparts of weighted integral estimates used in the deterministic setting, we formulate a sufficient criterion on the growth of initial data which locally guarantees a waiting time phenomenon to occur almost surely. Up to a logarithmic factor, this criterion coincides with the optimal criterion known from the deterministic setting. Our technique can be modified to prove finite speed of propagation as well.","lang":"eng"}],"extern":1,"_id":"1311","year":"2015","acknowledgement":"The first author has been supported by the Lithuanian-Swiss co- operation program under the project agreement No. CH-SMM-01/0.","intvolume":" 47","publisher":"Society for Industrial and Applied Mathematics ","title":"Finite speed of propagation and waiting times for the stochastic porous medium equation: A unifying approach","status":"public","publication_status":"published","author":[{"first_name":"Julian L","last_name":"Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X","full_name":"Julian Fischer"},{"full_name":"Grün, Günther","last_name":"Grün","first_name":"Günther"}],"volume":47,"date_created":"2018-12-11T11:51:18Z","date_updated":"2021-01-12T06:49:48Z","day":"01","month":"01","citation":{"mla":"Fischer, Julian L., and Günther Grün. “Finite Speed of Propagation and Waiting Times for the Stochastic Porous Medium Equation: A Unifying Approach.” SIAM Journal on Mathematical Analysis, vol. 47, no. 1, Society for Industrial and Applied Mathematics , 2015, pp. 825–54, doi:10.1137/140960578.","short":"J.L. Fischer, G. Grün, SIAM Journal on Mathematical Analysis 47 (2015) 825–854.","chicago":"Fischer, Julian L, and Günther Grün. “Finite Speed of Propagation and Waiting Times for the Stochastic Porous Medium Equation: A Unifying Approach.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics , 2015. https://doi.org/10.1137/140960578.","ama":"Fischer JL, Grün G. Finite speed of propagation and waiting times for the stochastic porous medium equation: A unifying approach. SIAM Journal on Mathematical Analysis. 2015;47(1):825-854. doi:10.1137/140960578","ista":"Fischer JL, Grün G. 2015. Finite speed of propagation and waiting times for the stochastic porous medium equation: A unifying approach. SIAM Journal on Mathematical Analysis. 47(1), 825–854.","ieee":"J. L. Fischer and G. Grün, “Finite speed of propagation and waiting times for the stochastic porous medium equation: A unifying approach,” SIAM Journal on Mathematical Analysis, vol. 47, no. 1. Society for Industrial and Applied Mathematics , pp. 825–854, 2015.","apa":"Fischer, J. L., & Grün, G. (2015). Finite speed of propagation and waiting times for the stochastic porous medium equation: A unifying approach. SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/140960578"},"publication":"SIAM Journal on Mathematical Analysis","page":"825 - 854","quality_controlled":0,"doi":"10.1137/140960578","date_published":"2015-01-01T00:00:00Z"}]