[{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"06","oa_version":"Preprint","date_updated":"2023-02-10T09:21:47Z","type":"conference","doi":"10.1007/978-3-662-47672-7_58","language":[{"iso":"eng"}],"page":"713 - 724","external_id":{"arxiv":["1412.6466"]},"date_published":"2015-07-06T00:00:00Z","scopus_import":"1","publication_identifier":{"isbn":["9783662476710"],"issn":["0302-9743"]},"alternative_title":["LNCS"],"arxiv":1,"extern":"1","author":[{"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":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer","first_name":"Veronika"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1412.6466"}],"citation":{"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","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.","short":"M.H. Henzinger, S. Krinninger, V. Loitzenbauer, in:, 2nd International Colloquium on Automata, Languages and Programming, Springer Nature, 2015, pp. 713–724.","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.","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.","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.","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"},"year":"2015","_id":"11787","oa":1,"title":"Finding 2-edge and 2-vertex strongly connected components in quadratic time","publication":"2nd International Colloquium on Automata, Languages and Programming","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."}],"publication_status":"published","volume":9134,"publisher":"Springer Nature","intvolume":" 9134","status":"public","month":"07","conference":{"end_date":"2015-07-10","name":"ICALP: International Colloquium on Automata, Languages, and Programming","start_date":"2015-07-06","location":"Kyoto, Japan"},"date_created":"2022-08-11T09:38:34Z"},{"intvolume":" 8952","conference":{"end_date":"2014-09-12","name":"WAOA: International Workshop on Approximation and Online Algorithms","location":"Wroclaw, Poland","start_date":"2014-09-11"},"month":"01","date_created":"2022-08-11T09:43:32Z","status":"public","volume":8952,"publisher":"Springer Nature","title":"Online ad assignment with an ad exchange","publication":"12th International Workshop of Approximation and Online Algorithms","_id":"11788","oa":1,"abstract":[{"lang":"eng","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."}],"publication_status":"published","citation":{"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.","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","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.","short":"W. Dvořák, M.H. Henzinger, in:, 12th International Workshop of Approximation and Online Algorithms, Springer Nature, 2015, 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.","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.","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"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.05603"}],"extern":"1","quality_controlled":"1","author":[{"last_name":"Dvořák","first_name":"Wolfgang","full_name":"Dvořák, Wolfgang"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H"}],"year":"2015","alternative_title":["LNCS"],"scopus_import":"1","publication_identifier":{"issn":["0302-9743"]},"arxiv":1,"external_id":{"arxiv":["1604.05603"]},"date_published":"2015-01-01T00:00:00Z","page":"156–167","doi":"10.1007/978-3-319-18263-6_14","language":[{"iso":"eng"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"conference","date_updated":"2023-02-10T09:26:06Z","day":"01"},{"publication_identifier":{"isbn":["978-3-939897-78-1"],"issn":["1868-8969"]},"scopus_import":"1","alternative_title":["LIPIcs"],"page":"90-102","date_published":"2015-02-26T00:00:00Z","doi":"10.4230/LIPICS.STACS.2015.90","language":[{"iso":"eng"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"26","date_updated":"2023-02-21T16:32:37Z","type":"conference","oa_version":"Published Version","intvolume":" 30","status":"public","date_created":"2022-08-12T11:39:40Z","month":"02","conference":{"name":"STACS: Symposium on Theoretical Aspects of Computer Science","end_date":"2015-03-07","start_date":"2015-03-04","location":"Garching, Germany"},"volume":30,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","related_material":{"record":[{"id":"11903","status":"public","relation":"later_version"}]},"oa":1,"_id":"11837","publication":"32nd International Symposium on Theoretical Aspects of Computer Science","title":"Welfare maximization with friends-of-friends network externalities","publication_status":"published","abstract":[{"lang":"eng","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."}],"extern":"1","quality_controlled":"1","author":[{"first_name":"Sayan","last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan"},{"first_name":"Wolfgang","last_name":"Dvorák","full_name":"Dvorák, Wolfgang"},{"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":"Starnberger, Martin","first_name":" Martin","last_name":"Starnberger"}],"main_file_link":[{"url":"https://doi.org/10.4230/LIPICS.STACS.2015.90","open_access":"1"}],"citation":{"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.","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","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.","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.","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.","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.","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"},"year":"2015"},{"intvolume":" 6","status":"public","month":"01","date_created":"2022-08-16T06:43:49Z","volume":6,"issue":"1","publisher":"Wiley","article_type":"original","file_date_updated":"2022-08-16T06:52:53Z","_id":"11845","oa":1,"ddc":["570"],"pmid":1,"publication":"Methods in Ecology and Evolution","title":"Split diversity in constrained conservation prioritization using integer linear programming","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"}],"publication_status":"published","quality_controlled":"1","extern":"1","author":[{"full_name":"Chernomor, Olga","first_name":"Olga","last_name":"Chernomor"},{"full_name":"Minh, Bui Quang","first_name":"Bui Quang","last_name":"Minh"},{"last_name":"Forest","first_name":"Félix","full_name":"Forest, Félix"},{"last_name":"Klaere","first_name":"Steffen","full_name":"Klaere, Steffen"},{"full_name":"Ingram, Travis","last_name":"Ingram","first_name":"Travis"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"first_name":"Arndt","last_name":"von Haeseler","full_name":"von Haeseler, Arndt"}],"citation":{"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","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.","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.","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.","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.","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."},"year":"2015","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"scopus_import":"1","publication_identifier":{"eissn":["2041-210X"]},"page":"83-91","external_id":{"pmid":["25893087"]},"file":[{"success":1,"file_id":"11846","date_updated":"2022-08-16T06:52:53Z","checksum":"880e78f09f0ac99cb351c48dc97623b6","file_name":"2015_MethodsInEcologyAndEvolutionChernomor.pdf","access_level":"open_access","relation":"main_file","date_created":"2022-08-16T06:52:53Z","file_size":411415,"creator":"asandaue","content_type":"application/pdf"}],"date_published":"2015-01-01T00:00:00Z","has_accepted_license":"1","doi":"10.1111/2041-210x.12299","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"01","oa_version":"Published Version","type":"journal_article","date_updated":"2023-02-17T09:30:08Z"},{"publication_identifier":{"issn":["0737.8017"],"isbn":["978-145033536-2"]},"scopus_import":"1","arxiv":1,"date_published":"2015-06-14T00:00:00Z","external_id":{"arxiv":["1511.06773"]},"doi":"10.1145/2746539.2746609","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","date_updated":"2023-02-17T11:09:54Z","type":"conference","oa_version":"Preprint","day":"14","date_created":"2022-08-16T09:31:21Z","month":"06","conference":{"name":"STOC: Symposium on Theory of Computing","end_date":"2015-06-17","location":"Portland, OR, United States","start_date":"2015-06-14"},"article_number":"21-30","status":"public","publisher":"Association for Computing Machinery","title":"Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture","publication":"47th Annual ACM Symposium on Theory of Computing","oa":1,"_id":"11868","publication_status":"published","abstract":[{"lang":"eng","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."}],"citation":{"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.","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.","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","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.","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.","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"},"main_file_link":[{"url":"https://arxiv.org/abs/1511.06773","open_access":"1"}],"author":[{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"first_name":"Sebastian","last_name":"Krinninger","full_name":"Krinninger, Sebastian"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"},{"first_name":"Thatchaphol","last_name":"Saranurak","full_name":"Saranurak, Thatchaphol"}],"quality_controlled":"1","extern":"1","year":"2015"},{"abstract":[{"lang":"eng","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."}],"publication_status":"published","_id":"11869","oa":1,"publication":"47th Annual ACM Symposium on Theory of Computing","title":"Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams","year":"2015","extern":"1","author":[{"first_name":"Sayan","last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"},{"last_name":"Tsourakakis","first_name":"Charalampos","full_name":"Tsourakakis, Charalampos"}],"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1504.02268","open_access":"1"}],"citation":{"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","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.","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.","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.","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.","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","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."},"status":"public","month":"06","conference":{"start_date":"2015-06-14","location":"Portland, OR, United States","name":"STOC: Symposium on Theory of Computing","end_date":"2015-06-17"},"date_created":"2022-08-16T09:36:48Z","publisher":"Association for Computing Machinery","doi":"10.1145/2746539.2746592","language":[{"iso":"eng"}],"day":"01","oa_version":"Preprint","date_updated":"2023-02-17T11:17:03Z","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","arxiv":1,"scopus_import":"1","publication_identifier":{"issn":["0737-8017"],"isbn":["978-145033536-2"]},"page":"173 - 182","external_id":{"arxiv":["1504.02268"]},"date_published":"2015-06-01T00:00:00Z"},{"language":[{"iso":"eng"}],"doi":"10.1016/j.tcs.2015.01.033","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"30","oa_version":"None","type":"journal_article","date_updated":"2023-02-17T14:50:04Z","scopus_import":"1","publication_identifier":{"issn":["0304-3975"]},"page":"1-15","date_published":"2015-03-30T00:00:00Z","_id":"11901","oa":1,"title":"Truthful unit-demand auctions with budgets revisited","publication":"Theoretical Computer Science","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"}],"publication_status":"published","author":[{"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":"Loitzenbauer, Veronika","first_name":"Veronika","last_name":"Loitzenbauer"}],"extern":"1","quality_controlled":"1","citation":{"ieee":"M. H. Henzinger and V. Loitzenbauer, “Truthful unit-demand auctions with budgets revisited,” Theoretical Computer Science, vol. 573. Elsevier, pp. 1–15, 2015.","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","short":"M.H. Henzinger, V. Loitzenbauer, Theoretical Computer Science 573 (2015) 1–15.","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.","ista":"Henzinger MH, Loitzenbauer V. 2015. Truthful unit-demand auctions with budgets revisited. Theoretical Computer Science. 573, 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.","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"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.tcs.2015.01.033"}],"year":"2015","intvolume":" 573","status":"public","month":"03","date_created":"2022-08-17T09:06:53Z","volume":573,"article_type":"original","publisher":"Elsevier"},{"publication_identifier":{"eissn":["1521-3765"],"issn":["0947-6539"]},"scopus_import":"1","page":"4368-4376","date_published":"2015-03-09T00:00:00Z","external_id":{"pmid":["25655090"]},"doi":"10.1002/chem.201406439","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"09","date_updated":"2023-02-21T10:09:30Z","type":"journal_article","oa_version":"None","intvolume":" 21","status":"public","date_created":"2022-08-24T11:11:10Z","month":"03","issue":"11","volume":21,"article_type":"original","publisher":"Wiley","_id":"11962","publication":"Chemistry - A European Journal","title":"Continuous flow reduction of artemisinic acid utilizing multi-injection strategies-closing the gap towards a fully continuous synthesis of antimalarial drugs","pmid":1,"publication_status":"published","abstract":[{"lang":"eng","text":"One of the rare alternative reagents for the reduction of carbon–carbon double bonds is diimide (HNNH), 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."}],"quality_controlled":"1","author":[{"first_name":"Bartholomäus","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus"},{"full_name":"Glasnov, Toma","last_name":"Glasnov","first_name":"Toma"},{"full_name":"Kappe, C. Oliver","last_name":"Kappe","first_name":"C. Oliver"}],"extern":"1","citation":{"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","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.","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.","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.","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.","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"},"year":"2015"},{"author":[{"first_name":"Carlos Eduardo M.","last_name":"Salvador","full_name":"Salvador, Carlos Eduardo M."},{"full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus","last_name":"Pieber"},{"last_name":"Neu","first_name":"Philipp M.","full_name":"Neu, Philipp M."},{"first_name":"Ana","last_name":"Torvisco","full_name":"Torvisco, Ana"},{"full_name":"Kleber Z. Andrade, Carlos","last_name":"Kleber Z. Andrade","first_name":"Carlos"},{"last_name":"Kappe","first_name":"C. Oliver","full_name":"Kappe, C. Oliver"}],"quality_controlled":"1","extern":"1","citation":{"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.","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.","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","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."},"year":"2015","_id":"11977","pmid":1,"publication":"The Journal of Organic Chemistry","title":"A sequential Ugi multicomponent/Cu-catalyzed azide–alkyne cycloaddition approach for the continuous flow generation of cyclic peptoids","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"}],"publication_status":"published","issue":"9","volume":80,"publisher":"American Chemical Society","article_type":"original","intvolume":" 80","status":"public","month":"05","date_created":"2022-08-25T10:52:24Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"01","oa_version":"None","type":"journal_article","date_updated":"2023-02-21T10:10:04Z","language":[{"iso":"eng"}],"doi":"10.1021/acs.joc.5b00445","page":"4590-4602","external_id":{"pmid":["25842982"]},"date_published":"2015-05-01T00:00:00Z","scopus_import":"1","publication_identifier":{"eissn":["1520-6904"],"issn":["0022-3263"]}},{"status":"public","month":"06","date_created":"2022-08-25T11:58:38Z","place":"Cham","intvolume":" 57","editor":[{"last_name":"Noël","first_name":"Timothy","full_name":"Noël, Timothy"}],"publisher":"Springer Nature","volume":57,"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"}],"publication_status":"published","_id":"11989","publication":"Organometallic Flow Chemistry","title":"Aerobic oxidations in continuous flow","year":"2015","extern":"1","author":[{"full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","first_name":"Bartholomäus"},{"last_name":"Kappe","first_name":"C. Oliver","full_name":"Kappe, C. Oliver"}],"quality_controlled":"1","citation":{"ista":"Pieber B, Kappe CO. 2015.Aerobic oxidations in continuous flow. In: Organometallic Flow Chemistry. Topics in Organometallic Chemistry, vol. 57, 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.","short":"B. Pieber, C.O. Kappe, in:, T. Noël (Ed.), Organometallic Flow Chemistry, 1st ed., Springer Nature, Cham, 2015, pp. 97–136.","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.","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","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.","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"},"scopus_import":"1","publication_identifier":{"isbn":["9783319332413"],"eissn":["1616-8534"],"issn":["1436-6002"],"eisbn":["9783319332437"]},"alternative_title":["Topics in Organometallic Chemistry"],"page":"97–136","date_published":"2015-06-10T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.1007/3418_2015_133","edition":"1","day":"10","oa_version":"None","date_updated":"2023-02-21T10:10:35Z","type":"book_chapter","series_title":"TOPORGAN","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"citation":{"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.","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.","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","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.","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.","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"},"extern":"1","quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Lee","first_name":"Victor","full_name":"Lee, Victor"},{"orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","first_name":"Scott R","last_name":"Waitukaitis"},{"full_name":"Miskin, Marc","first_name":"Marc","last_name":"Miskin"},{"first_name":"Heinrich","last_name":"Jaeger","full_name":"Jaeger, Heinrich"}],"type":"journal_article","date_updated":"2021-01-12T06:49:02Z","oa_version":"None","day":"13","year":"2015","title":"Direct observation of particle interactions and clustering in charged granular streams","publication":"Nature Physics","doi":"10.1038/nphys3396","language":[{"iso":"eng"}],"_id":"120","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.","publication_status":"published","abstract":[{"lang":"eng","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."}],"date_published":"2015-07-13T00:00:00Z","volume":11,"issue":"9","page":"733 - 737","publisher":"Nature Publishing Group","intvolume":" 11","publist_id":"7934","date_created":"2018-12-11T11:44:44Z","month":"07","status":"public"},{"volume":114,"issue":"5","publisher":"American Physical Society","intvolume":" 114","publist_id":"7933","date_created":"2018-12-11T11:44:44Z","month":"02","status":"public","article_number":"055503","citation":{"short":"S.R. Waitukaitis, R. Menaut, B. Chen, M. Van Hecke, APS Physics, Physical Review Letters 114 (2015).","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.","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.","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.","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","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.","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"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1408.1607"}],"extern":"1","quality_controlled":"1","author":[{"id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R","last_name":"Waitukaitis","first_name":"Scott R"},{"full_name":"Menaut, Rémi","last_name":"Menaut","first_name":"Rémi"},{"last_name":"Chen","first_name":"Bryan","full_name":"Chen, Bryan"},{"last_name":"Van Hecke","first_name":"Martin","full_name":"Van Hecke, Martin"}],"year":"2015","publication":"APS Physics, Physical Review Letters","title":"Origami multistability: From single vertices to metasheets","oa":1,"_id":"121","publication_status":"published","abstract":[{"lang":"eng","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."}],"date_published":"2015-02-04T00:00:00Z","external_id":{"arxiv":["1408.1607"]},"arxiv":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","type":"journal_article","date_updated":"2021-01-12T06:49:07Z","oa_version":"Preprint","day":"04","doi":"10.1103/PhysRevLett.114.055503","language":[{"iso":"eng"}],"acknowledgement":"B. G. C. acknowledges support from FOM, and S. W. and M. v. H. acknowledge support from NWO."},{"oa_version":"Preprint","type":"journal_article","date_updated":"2021-01-12T06:55:13Z","year":"2015","day":"01","citation":{"mla":"Nam, Phan, and Robert Seiringer. “Collective Excitations of Bose Gases in the Mean-Field Regime.” Archive for Rational Mechanics and Analysis, vol. 215, no. 2, Springer, 2015, pp. 381–417, doi:10.1007/s00205-014-0781-6.","apa":"Nam, P., & Seiringer, R. (2015). Collective excitations of Bose gases in the mean-field regime. Archive for Rational Mechanics and Analysis. Springer. https://doi.org/10.1007/s00205-014-0781-6","short":"P. Nam, R. Seiringer, Archive for Rational Mechanics and Analysis 215 (2015) 381–417.","chicago":"Nam, Phan, and Robert Seiringer. “Collective Excitations of Bose Gases in the Mean-Field Regime.” Archive for Rational Mechanics and Analysis. Springer, 2015. https://doi.org/10.1007/s00205-014-0781-6.","ista":"Nam P, Seiringer R. 2015. Collective excitations of Bose gases in the mean-field regime. Archive for Rational Mechanics and Analysis. 215(2), 381–417.","ama":"Nam P, Seiringer R. Collective excitations of Bose gases in the mean-field regime. Archive for Rational Mechanics and Analysis. 2015;215(2):381-417. doi:10.1007/s00205-014-0781-6","ieee":"P. Nam and R. Seiringer, “Collective excitations of Bose gases in the mean-field regime,” Archive for Rational Mechanics and Analysis, vol. 215, no. 2. Springer, pp. 381–417, 2015."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.1153"}],"quality_controlled":"1","author":[{"id":"404092F4-F248-11E8-B48F-1D18A9856A87","full_name":"Nam, Phan","first_name":"Phan","last_name":"Nam"},{"last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We study the spectrum of a large system of N identical bosons interacting via a two-body potential with strength 1/N. In this mean-field regime, Bogoliubov's theory predicts that the spectrum of the N-particle Hamiltonian can be approximated by that of an effective quadratic Hamiltonian acting on Fock space, which describes the fluctuations around a condensed state. Recently, Bogoliubov's theory has been justified rigorously in the case that the low-energy eigenvectors of the N-particle Hamiltonian display complete condensation in the unique minimizer of the corresponding Hartree functional. In this paper, we shall justify Bogoliubov's theory for the high-energy part of the spectrum of the N-particle Hamiltonian corresponding to (non-linear) excited states of the Hartree functional. Moreover, we shall extend the existing results on the excitation spectrum to the case of non-uniqueness and/or degeneracy of the Hartree minimizer. In particular, the latter covers the case of rotating Bose gases, when the rotation speed is large enough to break the symmetry and to produce multiple quantized vortices in the Hartree minimizer. ","lang":"eng"}],"publication_status":"published","publication":"Archive for Rational Mechanics and Analysis","title":"Collective excitations of Bose gases in the mean-field regime","department":[{"_id":"RoSe"}],"_id":"2085","language":[{"iso":"eng"}],"doi":"10.1007/s00205-014-0781-6","oa":1,"publisher":"Springer","date_published":"2015-02-01T00:00:00Z","volume":215,"issue":"2","page":"381 - 417","month":"02","date_created":"2018-12-11T11:55:37Z","status":"public","intvolume":" 215","scopus_import":1,"publist_id":"4951"},{"title":"The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case","publication":"Communications in Mathematical Physics","_id":"2166","department":[{"_id":"LaEr"}],"language":[{"iso":"eng"}],"doi":"10.1007/s00220-014-2119-5","oa":1,"abstract":[{"lang":"eng","text":"We consider the spectral statistics of large random band matrices on mesoscopic energy scales. We show that the correlation function of the local eigenvalue density exhibits a universal power law behaviour that differs from the Wigner-Dyson- Mehta statistics. This law had been predicted in the physics literature by Altshuler and Shklovskii in (Zh Eksp Teor Fiz (Sov Phys JETP) 91(64):220(127), 1986); it describes the correlations of the eigenvalue density in general metallic sampleswith weak disorder. Our result rigorously establishes the Altshuler-Shklovskii formulas for band matrices. In two dimensions, where the leading term vanishes owing to an algebraic cancellation, we identify the first non-vanishing term and show that it differs substantially from the prediction of Kravtsov and Lerner in (Phys Rev Lett 74:2563-2566, 1995). The proof is given in the current paper and its companion (Ann. H. Poincaré. arXiv:1309.5107, 2014). "}],"publication_status":"published","citation":{"apa":"Erdös, L., & Knowles, A. (2015). The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-014-2119-5","mla":"Erdös, László, and Antti Knowles. “The Altshuler-Shklovskii Formulas for Random Band Matrices I: The Unimodular Case.” Communications in Mathematical Physics, vol. 333, no. 3, Springer, 2015, pp. 1365–416, doi:10.1007/s00220-014-2119-5.","chicago":"Erdös, László, and Antti Knowles. “The Altshuler-Shklovskii Formulas for Random Band Matrices I: The Unimodular Case.” Communications in Mathematical Physics. Springer, 2015. https://doi.org/10.1007/s00220-014-2119-5.","short":"L. Erdös, A. Knowles, Communications in Mathematical Physics 333 (2015) 1365–1416.","ista":"Erdös L, Knowles A. 2015. The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case. Communications in Mathematical Physics. 333(3), 1365–1416.","ieee":"L. Erdös and A. Knowles, “The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case,” Communications in Mathematical Physics, vol. 333, no. 3. Springer, pp. 1365–1416, 2015.","ama":"Erdös L, Knowles A. The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case. Communications in Mathematical Physics. 2015;333(3):1365-1416. doi:10.1007/s00220-014-2119-5"},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1309.5106"}],"author":[{"last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"full_name":"Knowles, Antti","last_name":"Knowles","first_name":"Antti"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","date_updated":"2021-01-12T06:55:43Z","year":"2015","day":"01","intvolume":" 333","scopus_import":1,"publist_id":"4818","month":"02","date_created":"2018-12-11T11:56:05Z","status":"public","date_published":"2015-02-01T00:00:00Z","issue":"3","page":"1365 - 1416","volume":333,"publisher":"Springer"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","date_updated":"2023-02-23T10:46:30Z","day":"01","department":[{"_id":"VlKo"}],"language":[{"iso":"eng"}],"doi":"10.1137/130945648","external_id":{"arxiv":["1311.4219"]},"date_published":"2015-02-01T00:00:00Z","page":"1 - 36","scopus_import":1,"arxiv":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1311.4219"}],"citation":{"ieee":"V. Kolmogorov, J. Thapper, and S. Živný, “The power of linear programming for general-valued CSPs,” SIAM Journal on Computing, vol. 44, no. 1. SIAM, pp. 1–36, 2015.","ama":"Kolmogorov V, Thapper J, Živný S. The power of linear programming for general-valued CSPs. SIAM Journal on Computing. 2015;44(1):1-36. doi:10.1137/130945648","short":"V. Kolmogorov, J. Thapper, S. Živný, SIAM Journal on Computing 44 (2015) 1–36.","chicago":"Kolmogorov, Vladimir, Johan Thapper, and Stanislav Živný. “The Power of Linear Programming for General-Valued CSPs.” SIAM Journal on Computing. SIAM, 2015. https://doi.org/10.1137/130945648.","ista":"Kolmogorov V, Thapper J, Živný S. 2015. The power of linear programming for general-valued CSPs. SIAM Journal on Computing. 44(1), 1–36.","apa":"Kolmogorov, V., Thapper, J., & Živný, S. (2015). The power of linear programming for general-valued CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/130945648","mla":"Kolmogorov, Vladimir, et al. “The Power of Linear Programming for General-Valued CSPs.” SIAM Journal on Computing, vol. 44, no. 1, SIAM, 2015, pp. 1–36, doi:10.1137/130945648."},"author":[{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov"},{"full_name":"Thapper, Johan","last_name":"Thapper","first_name":"Johan"},{"first_name":"Stanislav","last_name":"Živný","full_name":"Živný, Stanislav"}],"quality_controlled":"1","year":"2015","publication":"SIAM Journal on Computing","title":"The power of linear programming for general-valued CSPs","_id":"2271","related_material":{"record":[{"id":"2518","relation":"earlier_version","status":"public"}]},"oa":1,"abstract":[{"lang":"eng","text":"A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. Finite-valued constraint languages contain functions that take on rational costs and general-valued constraint languages contain functions that take on rational or infinite costs. An instance of the problem is specified by a sum of functions from the language with the goal to minimise the sum. This framework includes and generalises well-studied constraint satisfaction problems (CSPs) and maximum constraint satisfaction problems (Max-CSPs).\r\nOur main result is a precise algebraic characterisation of valued constraint languages whose instances can be solved exactly by the basic linear programming relaxation (BLP). For a general-valued constraint language Γ, BLP is a decision procedure for Γ if and only if Γ admits a symmetric fractional polymorphism of every arity. For a finite-valued constraint language Γ, BLP is a decision procedure if and only if Γ admits a symmetric fractional polymorphism of some arity, or equivalently, if Γ admits a symmetric fractional polymorphism of arity 2.\r\nUsing these results, we obtain tractability of several novel and previously widely-open classes of VCSPs, including problems over valued constraint languages that are: (1) submodular on arbitrary lattices; (2) bisubmodular (also known as k-submodular) on arbitrary finite domains; (3) weakly (and hence strongly) tree-submodular on arbitrary trees. "}],"publication_status":"published","volume":44,"issue":"1","publisher":"SIAM","intvolume":" 44","publist_id":"4673","month":"02","date_created":"2018-12-11T11:56:41Z","status":"public"},{"publisher":"Walter de Gruyter GmbH","date_published":"2015-07-10T00:00:00Z","issue":"4","page":"2025 - 2050","volume":27,"month":"07","date_created":"2018-12-11T11:45:28Z","status":"public","intvolume":" 27","publist_id":"7645","type":"journal_article","date_updated":"2021-01-12T06:58:18Z","year":"2015","day":"10","main_file_link":[{"url":"https://arxiv.org/abs/1302.2434","open_access":"1"}],"citation":{"mla":"Browning, Timothy D., and Ritabrata Munshi. “Pairs of Diagonal Quadratic Forms and Linear Correlations among Sums of Two Squares.” Forum Mathematicum, vol. 27, no. 4, Walter de Gruyter GmbH, 2015, pp. 2025–50, doi:10.1515/forum-2013-6024.","apa":"Browning, T. D., & Munshi, R. (2015). Pairs of diagonal quadratic forms and linear correlations among sums of two squares. Forum Mathematicum. Walter de Gruyter GmbH. https://doi.org/10.1515/forum-2013-6024","short":"T.D. Browning, R. Munshi, Forum Mathematicum 27 (2015) 2025–2050.","chicago":"Browning, Timothy D, and Ritabrata Munshi. “Pairs of Diagonal Quadratic Forms and Linear Correlations among Sums of Two Squares.” Forum Mathematicum. Walter de Gruyter GmbH, 2015. https://doi.org/10.1515/forum-2013-6024.","ista":"Browning TD, Munshi R. 2015. Pairs of diagonal quadratic forms and linear correlations among sums of two squares. Forum Mathematicum. 27(4), 2025–2050.","ama":"Browning TD, Munshi R. Pairs of diagonal quadratic forms and linear correlations among sums of two squares. Forum Mathematicum. 2015;27(4):2025-2050. doi:10.1515/forum-2013-6024","ieee":"T. D. Browning and R. Munshi, “Pairs of diagonal quadratic forms and linear correlations among sums of two squares,” Forum Mathematicum, vol. 27, no. 4. Walter de Gruyter GmbH, pp. 2025–2050, 2015."},"author":[{"orcid":"0000-0002-8314-0177","full_name":"Timothy Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","last_name":"Browning"},{"last_name":"Munshi","first_name":"Ritabrata","full_name":"Munshi, Ritabrata"}],"quality_controlled":0,"extern":1,"acknowledgement":"While working on this paper the first author was supported by ERC grant 306457 and the second author was supported by SwarnaJayanti Fellowship 2011–12, DST, Government of India.","abstract":[{"lang":"eng","text":"For suitable pairs of diagonal quadratic forms in eight variables we use the circle method to investigate the density of simultaneous integer solutions and relate this to the problem of estimating linear correlations among sums of two squares."}],"publication_status":"published","publication":"Forum Mathematicum","title":"Pairs of diagonal quadratic forms and linear correlations among sums of two squares","_id":"257","doi":"10.1515/forum-2013-6024","oa":1},{"date_created":"2018-12-11T11:45:28Z","month":"08","status":"public","publist_id":"7644","publisher":"Cambridge University Press","date_published":"2015-08-01T00:00:00Z","page":"89 - 113","publication_status":"published","abstract":[{"text":"Given a number field k and a projective algebraic variety X defined over k, the question of whether X contains a k-rational point is both very natural and very difficult. In the event that the set X(k) of k-rational points is not empty, one can also ask how the points of X(k) are distributed. Are they dense in X under the Zariski topology? Are they dense in the set.","lang":"eng"}],"title":"A survey of applications of the circle method to rational points","publication":"Arithmetic and Geometry","language":[{"iso":"eng"}],"doi":"10.1017/CBO9781316106877.009","_id":"258","date_updated":"2021-01-12T06:58:22Z","type":"book_chapter","oa_version":"None","day":"01","year":"2015","citation":{"mla":"Browning, Timothy D. “A Survey of Applications of the Circle Method to Rational Points.” Arithmetic and Geometry, Cambridge University Press, 2015, pp. 89–113, doi:10.1017/CBO9781316106877.009.","apa":"Browning, T. D. (2015). A survey of applications of the circle method to rational points. In Arithmetic and Geometry (pp. 89–113). Cambridge University Press. https://doi.org/10.1017/CBO9781316106877.009","short":"T.D. Browning, in:, Arithmetic and Geometry, Cambridge University Press, 2015, pp. 89–113.","chicago":"Browning, Timothy D. “A Survey of Applications of the Circle Method to Rational Points.” In Arithmetic and Geometry, 89–113. Cambridge University Press, 2015. https://doi.org/10.1017/CBO9781316106877.009.","ista":"Browning TD. 2015.A survey of applications of the circle method to rational points. In: Arithmetic and Geometry. , 89–113.","ama":"Browning TD. A survey of applications of the circle method to rational points. In: Arithmetic and Geometry. Cambridge University Press; 2015:89-113. doi:10.1017/CBO9781316106877.009","ieee":"T. D. Browning, “A survey of applications of the circle method to rational points,” in Arithmetic and Geometry, Cambridge University Press, 2015, pp. 89–113."},"extern":"1","author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D","last_name":"Browning","first_name":"Timothy D"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"doi":"10.1007/s00039-015-0328-5","_id":"259","publication":"Geometric and Functional Analysis","title":"Rational points on cubic hypersurfaces over F_q(t) ","publication_status":"published","abstract":[{"text":"The Hasse principle and weak approximation is established for non-singular cubic hypersurfaces X over the function field ","lang":"eng"}],"acknowledgement":"EP/J018260/1\tEngineering and Physical Sciences Research Council EPSRC","extern":1,"author":[{"first_name":"Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Timothy Browning","orcid":"0000-0002-8314-0177"},{"first_name":"Pankaj","last_name":"Vishe","full_name":"Vishe, Pankaj"}],"quality_controlled":0,"citation":{"short":"T.D. Browning, P. Vishe, Geometric and Functional Analysis 25 (2015) 671–732.","chicago":"Browning, Timothy D, and Pankaj Vishe. “Rational Points on Cubic Hypersurfaces over F_q(T) .” Geometric and Functional Analysis. Birkhäuser, 2015. https://doi.org/10.1007/s00039-015-0328-5.","ista":"Browning TD, Vishe P. 2015. Rational points on cubic hypersurfaces over F_q(t) . Geometric and Functional Analysis. 25(3), 671–732.","ama":"Browning TD, Vishe P. Rational points on cubic hypersurfaces over F_q(t) . Geometric and Functional Analysis. 2015;25(3):671-732. doi:10.1007/s00039-015-0328-5","ieee":"T. D. Browning and P. Vishe, “Rational points on cubic hypersurfaces over F_q(t) ,” Geometric and Functional Analysis, vol. 25, no. 3. Birkhäuser, pp. 671–732, 2015.","apa":"Browning, T. D., & Vishe, P. (2015). Rational points on cubic hypersurfaces over F_q(t) . Geometric and Functional Analysis. Birkhäuser. https://doi.org/10.1007/s00039-015-0328-5","mla":"Browning, Timothy D., and Pankaj Vishe. “Rational Points on Cubic Hypersurfaces over F_q(T) .” Geometric and Functional Analysis, vol. 25, no. 3, Birkhäuser, 2015, pp. 671–732, doi:10.1007/s00039-015-0328-5."},"day":"11","year":"2015","date_updated":"2021-01-12T06:58:25Z","type":"journal_article","publist_id":"7643","intvolume":" 25","status":"public","date_created":"2018-12-11T11:45:29Z","month":"06","page":"671 - 732","volume":25,"issue":"3","date_published":"2015-06-11T00:00:00Z","publisher":"Birkhäuser"},{"date_published":"2015-02-20T00:00:00Z","external_id":{"arxiv":["1402.4489"]},"page":"203 - 234","publication_identifier":{"issn":["0075-4102"]},"arxiv":1,"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-03-05T12:09:22Z","type":"journal_article","oa_version":"Preprint","day":"20","doi":"10.1515/crelle-2014-0122","language":[{"iso":"eng"}],"acknowledgement":"While working on this paper the authors were supported by the Leverhulme Trust and ERC grant 306457.","volume":2017,"issue":"731","article_type":"original","publisher":"Walter de Gruyter","intvolume":" 2017","publist_id":"7631","date_created":"2018-12-11T11:45:32Z","month":"02","status":"public","citation":{"ama":"Browning TD, Prendiville S. Improvements in Birch’s theorem on forms in many variables. Journal fur die Reine und Angewandte Mathematik. 2017(731):203-234. doi:10.1515/crelle-2014-0122","ieee":"T. D. Browning and S. Prendiville, “Improvements in Birch’s theorem on forms in many variables,” Journal fur die Reine und Angewandte Mathematik, vol. 2017, no. 731. Walter de Gruyter, pp. 203–234.","ista":"Browning TD, Prendiville S. Improvements in Birch’s theorem on forms in many variables. Journal fur die Reine und Angewandte Mathematik. 2017(731), 203–234.","short":"T.D. Browning, S. Prendiville, Journal Fur Die Reine Und Angewandte Mathematik 2017 (n.d.) 203–234.","chicago":"Browning, Timothy D, and Sean Prendiville. “Improvements in Birch’s Theorem on Forms in Many Variables.” Journal Fur Die Reine Und Angewandte Mathematik. Walter de Gruyter, n.d. https://doi.org/10.1515/crelle-2014-0122.","apa":"Browning, T. D., & Prendiville, S. (n.d.). Improvements in Birch’s theorem on forms in many variables. Journal Fur Die Reine Und Angewandte Mathematik. Walter de Gruyter. https://doi.org/10.1515/crelle-2014-0122","mla":"Browning, Timothy D., and Sean Prendiville. “Improvements in Birch’s Theorem on Forms in Many Variables.” Journal Fur Die Reine Und Angewandte Mathematik, vol. 2017, no. 731, Walter de Gruyter, pp. 203–34, doi:10.1515/crelle-2014-0122."},"main_file_link":[{"url":"https://arxiv.org/abs/1402.4489","open_access":"1"}],"quality_controlled":"1","extern":"1","author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","first_name":"Timothy D","last_name":"Browning"},{"full_name":"Prendiville, Sean","last_name":"Prendiville","first_name":"Sean"}],"year":"2015","title":"Improvements in Birch's theorem on forms in many variables","publication":"Journal fur die Reine und Angewandte Mathematik","related_material":{"record":[{"id":"256","relation":"later_version","status":"public"}]},"oa":1,"_id":"271","publication_status":"submitted","abstract":[{"text":"We show that a non-singular integral form of degree d is soluble non-trivially over the integers if and only if it is soluble non-trivially over the reals and the p-adic numbers, provided that the form has at least (d-\\sqrt{d}/2)2^d variables. This improves on a longstanding result of Birch.","lang":"eng"}]},{"oa_version":"None","type":"journal_article","date_updated":"2021-01-12T07:42:42Z","year":"2015","day":"16","citation":{"mla":"Walter, Marc, et al. “Efficient and Inexpensive Sodium Magnesium Hybrid Battery.” Chemistry of Materials, vol. 27, no. 21, ACS, 2015, pp. 7452–58, doi:10.1021/acs.chemmater.5b03531.","apa":"Walter, M., Kravchyk, K., Ibáñez, M., & Kovalenko, M. (2015). Efficient and inexpensive sodium magnesium hybrid battery. Chemistry of Materials. ACS. https://doi.org/10.1021/acs.chemmater.5b03531","ista":"Walter M, Kravchyk K, Ibáñez M, Kovalenko M. 2015. Efficient and inexpensive sodium magnesium hybrid battery. Chemistry of Materials. 27(21), 7452–7458.","short":"M. Walter, K. Kravchyk, M. Ibáñez, M. Kovalenko, Chemistry of Materials 27 (2015) 7452–7458.","chicago":"Walter, Marc, Kostiantyn Kravchyk, Maria Ibáñez, and Maksym Kovalenko. “Efficient and Inexpensive Sodium Magnesium Hybrid Battery.” Chemistry of Materials. ACS, 2015. https://doi.org/10.1021/acs.chemmater.5b03531.","ieee":"M. Walter, K. Kravchyk, M. Ibáñez, and M. Kovalenko, “Efficient and inexpensive sodium magnesium hybrid battery,” Chemistry of Materials, vol. 27, no. 21. ACS, pp. 7452–7458, 2015.","ama":"Walter M, Kravchyk K, Ibáñez M, Kovalenko M. Efficient and inexpensive sodium magnesium hybrid battery. Chemistry of Materials. 2015;27(21):7452-7458. doi:10.1021/acs.chemmater.5b03531"},"extern":"1","article_processing_charge":"No","author":[{"first_name":"Marc","last_name":"Walter","full_name":"Walter, Marc"},{"full_name":"Kravchyk, Kostiantyn","first_name":"Kostiantyn","last_name":"Kravchyk"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","first_name":"Maria","last_name":"Ibáñez"},{"last_name":"Kovalenko","first_name":"Maksym","full_name":"Kovalenko, Maksym"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We present a hybrid intercalation battery based on a sodium/magnesium (Na/Mg) dual salt electrolyte, metallic magnesium anode, and a cathode based on FeS2 nanocrystals (NCs). Compared to lithium or sodium, metallic magnesium anode is safer due to dendrite-free electroplating and offers extremely high volumetric (3833 mAh cm-3) and gravimetric capacities (2205 mAh g-1). Na-ion cathodes, FeS2 NCs in the present study, may serve as attractive alternatives to Mg-ion cathodes due to the higher voltage of operation and fast, highly reversible insertion of Na-ions. In this proof-of-concept study, electrochemical cycling of the Na/Mg hybrid battery was characterized by high rate capability, high Coulombic efficiency of 99.8%, and high energy density. In particular, with an average discharge voltage of ∼1.1 V and a cathodic capacity of 189 mAh g-1 at a current of 200 mA g-1, the presented Mg/FeS2 hybrid battery delivers energy densities of up to 210 Wh kg-1, comparable to commercial Li-ion batteries and approximately twice as high as state-of-the-art Mg-ion batteries based on Mo6S8 cathodes. Further significant gains in the energy density are expected from the development of Na/Mg electrolytes with a broader electrochemical stability window. Fully based on Earth-abundant elements, hybrid Na-Mg batteries are highly promising for large-scale stationary energy storage. "}],"publication_status":"published","title":"Efficient and inexpensive sodium magnesium hybrid battery","publication":"Chemistry of Materials","_id":"333","doi":"10.1021/acs.chemmater.5b03531","language":[{"iso":"eng"}],"publisher":"ACS","article_type":"original","date_published":"2015-10-16T00:00:00Z","page":"7452 - 7458","issue":"21","volume":27,"month":"10","date_created":"2018-12-11T11:45:52Z","status":"public","intvolume":" 27","publist_id":"7507"}]