--- _id: '11757' abstract: - lang: eng text: We develop a dynamic version of the primal-dual method for optimization problems, and apply it to obtain the following results. (1) For the dynamic set-cover problem, we maintain an O ( f 2)-approximately optimal solution in O ( f · log(m + n)) amortized update time, where f is the maximum “frequency” of an element, n is the number of sets, and m is the maximum number of elements in the universe at any point in time. (2) For the dynamic b-matching problem, we maintain an O (1)-approximately optimal solution in O (log3 n) amortized update time, where n is the number of nodes in the graph. article_processing_charge: No article_type: original author: - first_name: Sayan full_name: Bhattacharya, Sayan last_name: Bhattacharya - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Giuseppe full_name: Italiano, Giuseppe last_name: Italiano citation: ama: Bhattacharya S, Henzinger MH, Italiano G. Dynamic algorithms via the primal-dual method. Information and Computation. 2018;261(08):219-239. doi:10.1016/j.ic.2018.02.005 apa: Bhattacharya, S., Henzinger, M. H., & Italiano, G. (2018). Dynamic algorithms via the primal-dual method. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2018.02.005 chicago: Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe Italiano. “Dynamic Algorithms via the Primal-Dual Method.” Information and Computation. Elsevier, 2018. https://doi.org/10.1016/j.ic.2018.02.005. ieee: S. Bhattacharya, M. H. Henzinger, and G. Italiano, “Dynamic algorithms via the primal-dual method,” Information and Computation, vol. 261, no. 08. Elsevier, pp. 219–239, 2018. ista: Bhattacharya S, Henzinger MH, Italiano G. 2018. Dynamic algorithms via the primal-dual method. Information and Computation. 261(08), 219–239. mla: Bhattacharya, Sayan, et al. “Dynamic Algorithms via the Primal-Dual Method.” Information and Computation, vol. 261, no. 08, Elsevier, 2018, pp. 219–39, doi:10.1016/j.ic.2018.02.005. short: S. Bhattacharya, M.H. Henzinger, G. Italiano, Information and Computation 261 (2018) 219–239. date_created: 2022-08-08T11:20:03Z date_published: 2018-08-01T00:00:00Z date_updated: 2023-02-10T07:27:39Z day: '01' doi: 10.1016/j.ic.2018.02.005 extern: '1' intvolume: ' 261' issue: '08' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1016/j.ic.2018.02.005 month: '08' oa: 1 oa_version: Published Version page: 219-239 publication: Information and Computation publication_identifier: issn: - 0890-5401 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Dynamic algorithms via the primal-dual method type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 261 year: '2018' ... --- _id: '11828' abstract: - lang: eng text: "We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that admit an n^{c}-separator theorem for some c<1. We give a fully dynamic algorithm that maintains (1+epsilon)-approximations of the all-pairs effective resistances of an n-vertex graph G undergoing edge insertions and deletions with O~(sqrt{n}/epsilon^2) worst-case update time and O~(sqrt{n}/epsilon^2) worst-case query time, if G is guaranteed to be sqrt{n}-separable (i.e., it is taken from a class satisfying a sqrt{n}-separator theorem) and its separator can be computed in O~(n) time. Our algorithm is built upon a dynamic algorithm for maintaining approximate Schur complement that approximately preserves pairwise effective resistances among a set of terminals for separable graphs, which might be of independent interest.\r\nWe complement our result by proving that for any two fixed vertices s and t, no incremental or decremental algorithm can maintain the s-t effective resistance for sqrt{n}-separable graphs with worst-case update time O(n^{1/2-delta}) and query time O(n^{1-delta}) for any delta>0, unless the Online Matrix Vector Multiplication (OMv) conjecture is false.\r\nWe further show that for general graphs, no incremental or decremental algorithm can maintain the s-t effective resistance problem with worst-case update time O(n^{1-delta}) and query-time O(n^{2-delta}) for any delta >0, unless the OMv conjecture is false." alternative_title: - LIPIcs article_number: '40' article_processing_charge: No author: - first_name: Gramoz full_name: Goranci, Gramoz last_name: Goranci - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Pan full_name: Peng, Pan last_name: Peng citation: ama: 'Goranci G, Henzinger MH, Peng P. Dynamic effective resistances and approximate schur complement on separable graphs. In: 26th Annual European Symposium on Algorithms. Vol 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.ESA.2018.40' apa: 'Goranci, G., Henzinger, M. H., & Peng, P. (2018). Dynamic effective resistances and approximate schur complement on separable graphs. In 26th Annual European Symposium on Algorithms (Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2018.40' chicago: Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.” In 26th Annual European Symposium on Algorithms, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ESA.2018.40. ieee: G. Goranci, M. H. Henzinger, and P. Peng, “Dynamic effective resistances and approximate schur complement on separable graphs,” in 26th Annual European Symposium on Algorithms, Helsinki, Finland, 2018, vol. 112. ista: 'Goranci G, Henzinger MH, Peng P. 2018. Dynamic effective resistances and approximate schur complement on separable graphs. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 40.' mla: Goranci, Gramoz, et al. “Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.” 26th Annual European Symposium on Algorithms, vol. 112, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.ESA.2018.40. short: G. Goranci, M.H. Henzinger, P. Peng, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. conference: end_date: 2018-08-22 location: Helsinki, Finland name: 'ESA: Annual European Symposium on Algorithms' start_date: 2018-08-20 date_created: 2022-08-12T08:26:42Z date_published: 2018-08-14T00:00:00Z date_updated: 2023-02-16T11:08:08Z day: '14' doi: 10.4230/LIPICS.ESA.2018.40 extern: '1' external_id: arxiv: - '1802.09111' intvolume: ' 112' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.ESA.2018.40 month: '08' oa: 1 oa_version: Published Version publication: 26th Annual European Symposium on Algorithms publication_identifier: isbn: - '9783959770811' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Dynamic effective resistances and approximate schur complement on separable graphs type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 112 year: '2018' ... --- _id: '11827' abstract: - lang: eng text: We study the metric facility location problem with client insertions and deletions. This setting differs from the classic dynamic facility location problem, where the set of clients remains the same, but the metric space can change over time. We show a deterministic algorithm that maintains a constant factor approximation to the optimal solution in worst-case time O~(2^{O(kappa^2)}) per client insertion or deletion in metric spaces while answering queries about the cost in O(1) time, where kappa denotes the doubling dimension of the metric. For metric spaces with bounded doubling dimension, the update time is polylogarithmic in the parameters of the problem. alternative_title: - LIPIcs article_number: '39' article_processing_charge: No author: - first_name: 'Gramoz ' full_name: 'Goranci, Gramoz ' last_name: Goranci - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Dariusz full_name: Leniowski, Dariusz last_name: Leniowski citation: ama: 'Goranci G, Henzinger MH, Leniowski D. A tree structure for dynamic facility location. In: 26th Annual European Symposium on Algorithms. Vol 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.ESA.2018.39' apa: 'Goranci, G., Henzinger, M. H., & Leniowski, D. (2018). A tree structure for dynamic facility location. In 26th Annual European Symposium on Algorithms (Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2018.39' chicago: Goranci, Gramoz , Monika H Henzinger, and Dariusz Leniowski. “A Tree Structure for Dynamic Facility Location.” In 26th Annual European Symposium on Algorithms, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ESA.2018.39. ieee: G. Goranci, M. H. Henzinger, and D. Leniowski, “A tree structure for dynamic facility location,” in 26th Annual European Symposium on Algorithms, Helsinki, Finland, 2018, vol. 112. ista: 'Goranci G, Henzinger MH, Leniowski D. 2018. A tree structure for dynamic facility location. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 39.' mla: Goranci, Gramoz, et al. “A Tree Structure for Dynamic Facility Location.” 26th Annual European Symposium on Algorithms, vol. 112, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.ESA.2018.39. short: G. Goranci, M.H. Henzinger, D. Leniowski, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. conference: end_date: 2018-08-22 location: Helsinki, Finland name: 'ESA: Annual European Symposium on Algorithms' start_date: 2018-08-20 date_created: 2022-08-12T08:20:57Z date_published: 2018-08-14T00:00:00Z date_updated: 2023-02-16T10:50:51Z day: '14' doi: 10.4230/LIPICS.ESA.2018.39 extern: '1' external_id: arxiv: - '1909.06653' intvolume: ' 112' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.ESA.2018.39 month: '08' oa: 1 oa_version: Published Version publication: 26th Annual European Symposium on Algorithms publication_identifier: isbn: - '9783959770811' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: A tree structure for dynamic facility location type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 112 year: '2018' ... --- _id: '11768' abstract: - lang: eng text: "In the decremental single-source shortest paths (SSSP) problem, we want to maintain the distances between a given source node s and every other node in an n-node m-edge graph G undergoing edge deletions. While its static counterpart can be solved in near-linear time, this decremental problem is much more challenging even in the undirected unweighted case. In this case, the classic O(mn) total update time of Even and Shiloach [16] has been the fastest known algorithm for three decades. At the cost of a (1+ϵ)-approximation factor, the running time was recently improved to n2+o(1) by Bernstein and Roditty [9]. In this article, we bring the running time down to near-linear: We give a (1+ϵ)-approximation algorithm with m1+o(1) expected total update time, thus obtaining near-linear time. Moreover, we obtain m1+o(1) log W time for the weighted case, where the edge weights are integers from 1 to W. The only prior work on weighted graphs in o(mn) time is the mn0.9 + o(1)-time algorithm by Henzinger et al. [18, 19], which works for directed graphs with quasi-polynomial edge weights. The expected running time bound of our algorithm holds against an oblivious adversary.\r\n\r\nIn contrast to the previous results, which rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called sparse (h, ϵ)-hop set introduced by Cohen [12] in the PRAM literature. An (h, ϵ)-hop set of a graph G=(V, E) is a set F of weighted edges such that the distance between any pair of nodes in G can be (1+ϵ)-approximated by their h-hop distance (given by a path containing at most h edges) on G′=(V, E ∪ F). Our algorithm can maintain an (no(1), ϵ)-hop set of near-linear size in near-linear time under edge deletions. It is the first of its kind to the best of our knowledge. To maintain approximate distances using this hop set, we extend the monotone Even-Shiloach tree of Henzinger et al. [20] and combine it with the bounded-hop SSSP technique of Bernstein [4, 5] and Mądry [27]. These two new tools might be of independent interest." article_processing_charge: No article_type: original author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Sebastian full_name: Krinninger, Sebastian last_name: Krinninger - first_name: Danupon full_name: Nanongkai, Danupon last_name: Nanongkai citation: ama: Henzinger MH, Krinninger S, Nanongkai D. Decremental single-source shortest paths on undirected graphs in near-linear total update time. Journal of the ACM. 2018;65(6):1-40. doi:10.1145/3218657 apa: Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2018). Decremental single-source shortest paths on undirected graphs in near-linear total update time. Journal of the ACM. Association for Computing Machinery. https://doi.org/10.1145/3218657 chicago: Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” Journal of the ACM. Association for Computing Machinery, 2018. https://doi.org/10.1145/3218657. ieee: M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source shortest paths on undirected graphs in near-linear total update time,” Journal of the ACM, vol. 65, no. 6. Association for Computing Machinery, pp. 1–40, 2018. ista: Henzinger MH, Krinninger S, Nanongkai D. 2018. Decremental single-source shortest paths on undirected graphs in near-linear total update time. Journal of the ACM. 65(6), 1–40. mla: Henzinger, Monika H., et al. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” Journal of the ACM, vol. 65, no. 6, Association for Computing Machinery, 2018, pp. 1–40, doi:10.1145/3218657. short: M.H. Henzinger, S. Krinninger, D. Nanongkai, Journal of the ACM 65 (2018) 1–40. date_created: 2022-08-08T12:33:17Z date_published: 2018-12-01T00:00:00Z date_updated: 2023-02-21T16:30:41Z day: '01' doi: 10.1145/3218657 extern: '1' external_id: arxiv: - '1512.08148' intvolume: ' 65' issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1512.08148 month: '12' oa: 1 oa_version: Preprint page: 1-40 publication: Journal of the ACM publication_identifier: eissn: - 1557-735X issn: - 0004-5411 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '11855' relation: earlier_version status: public scopus_import: '1' status: public title: Decremental single-source shortest paths on undirected graphs in near-linear total update time type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 65 year: '2018' ... --- _id: '11872' abstract: - lang: eng text: We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for (Δ + 1)- vertex coloring and (2Δ – 1)-edge coloring in a graph with maximum degree Δ. It is natural to ask if we can efficiently maintain such colorings in the dynamic setting as well. We get the following three results. (1) We present a randomized algorithm which maintains a (Δ + 1)-vertex coloring with O(log Δ) expected amortized update time. (2) We present a deterministic algorithm which maintains a (1 + o(1)Δ-vertex coloring with O(polylog Δ) amortized update time. (3) We present a simple, deterministic algorithm which maintains a (2Δ – 1)-edge coloring with O(log Δ) worst-case update time. This improves the recent O(Δ)-edge coloring algorithm with worst-case update time [4]. article_processing_charge: No author: - first_name: Sayan full_name: Bhattacharya, Sayan last_name: Bhattacharya - first_name: Deeparnab full_name: Chakrabarty, Deeparnab last_name: Chakrabarty - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Danupon full_name: Nanongkai, Danupon last_name: Nanongkai citation: ama: 'Bhattacharya S, Chakrabarty D, Henzinger MH, Nanongkai D. Dynamic algorithms for graph coloring. In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2018:1-20. doi:10.1137/1.9781611975031.1' apa: 'Bhattacharya, S., Chakrabarty, D., Henzinger, M. H., & Nanongkai, D. (2018). Dynamic algorithms for graph coloring. In 29th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1–20). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975031.1' chicago: Bhattacharya, Sayan, Deeparnab Chakrabarty, Monika H Henzinger, and Danupon Nanongkai. “Dynamic Algorithms for Graph Coloring.” In 29th Annual ACM-SIAM Symposium on Discrete Algorithms, 1–20. Society for Industrial and Applied Mathematics, 2018. https://doi.org/10.1137/1.9781611975031.1. ieee: S. Bhattacharya, D. Chakrabarty, M. H. Henzinger, and D. Nanongkai, “Dynamic algorithms for graph coloring,” in 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2018, pp. 1–20. ista: 'Bhattacharya S, Chakrabarty D, Henzinger MH, Nanongkai D. 2018. Dynamic algorithms for graph coloring. 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1–20.' mla: Bhattacharya, Sayan, et al. “Dynamic Algorithms for Graph Coloring.” 29th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2018, pp. 1–20, doi:10.1137/1.9781611975031.1. short: S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, D. Nanongkai, in:, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2018, pp. 1–20. conference: end_date: 2018-01-10 location: New Orleans, LA, United States name: 'SODA: Symposium on Discrete Algorithms' start_date: 2018-01-07 date_created: 2022-08-16T12:07:14Z date_published: 2018-01-01T00:00:00Z date_updated: 2023-02-17T11:39:01Z day: '01' doi: 10.1137/1.9781611975031.1 extern: '1' external_id: arxiv: - '1711.04355' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1711.04355 month: '01' oa: 1 oa_version: Preprint page: 1 - 20 publication: 29th Annual ACM-SIAM Symposium on Discrete Algorithms publication_identifier: eisbn: - 978-161197503-1 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: Dynamic algorithms for graph coloring type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '11882' abstract: - lang: eng text: The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi's contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory parallel implementations of our algorithm. Extensive experiments on both real-world and generated instances show that our algorithm finds the optimal cut on nearly all instances significantly faster than other state-of-the-art exact algorithms, and our error rate is lower than that of other heuristic algorithms. In addition, our parallel algorithm shows good scalability. article_processing_charge: No author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Alexander full_name: Noe, Alexander last_name: Noe - first_name: Christian full_name: Schulz, Christian last_name: Schulz - first_name: Darren full_name: Strash, Darren last_name: Strash citation: ama: 'Henzinger MH, Noe A, Schulz C, Strash D. Practical minimum cut algorithms. In: 20th Workshop on Algorithm Engineering and Experiments. Society for Industrial and Applied Mathematics; 2018:48-61. doi:10.1137/1.9781611975055.5' apa: 'Henzinger, M. H., Noe, A., Schulz, C., & Strash, D. (2018). Practical minimum cut algorithms. In 20th Workshop on Algorithm Engineering and Experiments (pp. 48–61). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975055.5' chicago: Henzinger, Monika H, Alexander Noe, Christian Schulz, and Darren Strash. “Practical Minimum Cut Algorithms.” In 20th Workshop on Algorithm Engineering and Experiments, 48–61. Society for Industrial and Applied Mathematics, 2018. https://doi.org/10.1137/1.9781611975055.5. ieee: M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Practical minimum cut algorithms,” in 20th Workshop on Algorithm Engineering and Experiments, New Orleans, LA, United States, 2018, pp. 48–61. ista: 'Henzinger MH, Noe A, Schulz C, Strash D. 2018. Practical minimum cut algorithms. 20th Workshop on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 48–61.' mla: Henzinger, Monika H., et al. “Practical Minimum Cut Algorithms.” 20th Workshop on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2018, pp. 48–61, doi:10.1137/1.9781611975055.5. short: M.H. Henzinger, A. Noe, C. Schulz, D. Strash, in:, 20th Workshop on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2018, pp. 48–61. conference: end_date: 2018-01-08 location: New Orleans, LA, United States name: 'ALENEX: Symposium on Algorithm Engineering and Experiments' start_date: 2018-01-07 date_created: 2022-08-17T07:04:57Z date_published: 2018-01-01T00:00:00Z date_updated: 2023-02-17T14:03:39Z day: '01' doi: 10.1137/1.9781611975055.5 extern: '1' external_id: arxiv: - '1708.06127' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1708.06127 month: '01' oa: 1 oa_version: Preprint page: 48-61 publication: 20th Workshop on Algorithm Engineering and Experiments publication_identifier: eisbn: - 978-1-61197-505-5 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: Practical minimum cut algorithms type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '11890' abstract: - lang: eng text: "We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph \U0001D43A=(\U0001D449,\U0001D438), with |\U0001D449|=\U0001D45B and |\U0001D438|=\U0001D45A, in \U0001D45C(\U0001D45A‾‾√) time per update. In particular, for minimum vertex cover, we provide deterministic data structures for maintaining a (2+\U0001D716) approximation in \U0001D442(log\U0001D45B/\U0001D7162) amortized time per update. For maximum matching, we show how to maintain a (3+\U0001D716) approximation in \U0001D442(min(\U0001D45B√/\U0001D716,\U0001D45A1/3/\U0001D7162) amortized time per update and a (4+\U0001D716) approximation in \U0001D442(\U0001D45A1/3/\U0001D7162) worst-case time per update. Our data structure for fully dynamic minimum vertex cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld [in 42nd ACM Symposium on Theory of Computing, Cambridge, MA, ACM, 2010, pp. 457--464]." article_processing_charge: No article_type: original author: - first_name: Sayan full_name: Bhattacharya, Sayan last_name: Bhattacharya - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Giuseppe F. full_name: Italiano, Giuseppe F. last_name: Italiano citation: ama: Bhattacharya S, Henzinger MH, Italiano GF. Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. 2018;47(3):859-887. doi:10.1137/140998925 apa: Bhattacharya, S., Henzinger, M. H., & Italiano, G. F. (2018). Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/140998925 chicago: Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics, 2018. https://doi.org/10.1137/140998925. ieee: S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” SIAM Journal on Computing, vol. 47, no. 3. Society for Industrial & Applied Mathematics, pp. 859–887, 2018. ista: Bhattacharya S, Henzinger MH, Italiano GF. 2018. Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. 47(3), 859–887. mla: Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” SIAM Journal on Computing, vol. 47, no. 3, Society for Industrial & Applied Mathematics, 2018, pp. 859–87, doi:10.1137/140998925. short: S. Bhattacharya, M.H. Henzinger, G.F. Italiano, SIAM Journal on Computing 47 (2018) 859–887. date_created: 2022-08-17T08:21:23Z date_published: 2018-05-01T00:00:00Z date_updated: 2023-02-21T16:31:30Z day: '01' doi: 10.1137/140998925 extern: '1' external_id: arxiv: - '1412.1318' intvolume: ' 47' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1412.1318 month: '05' oa: 1 oa_version: Preprint page: 859-887 publication: SIAM Journal on Computing publication_identifier: eissn: - 1095-7111 issn: - 0097-5397 publication_status: published publisher: Society for Industrial & Applied Mathematics quality_controlled: '1' related_material: record: - id: '11875' relation: earlier_version status: public scopus_import: '1' status: public title: Deterministic fully dynamic data structures for vertex cover and matching type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 47 year: '2018' ... --- _id: '11911' abstract: - lang: eng text: It is common knowledge that there is no single best strategy for graph clustering, which justifies a plethora of existing approaches. In this paper, we present a general memetic algorithm, VieClus, to tackle the graph clustering problem. This algorithm can be adapted to optimize different objective functions. A key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multi-level techniques. Lastly, we combine these techniques with a scalable communication protocol, producing a system that is able to compute high-quality solutions in a short amount of time. We instantiate our scheme with local search for modularity and show that our algorithm successfully improves or reproduces all entries of the 10th DIMACS implementation challenge under consideration using a small amount of time. alternative_title: - LIPIcs article_number: '3' article_processing_charge: No author: - first_name: Sonja full_name: Biedermann, Sonja last_name: Biedermann - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Christian full_name: Schulz, Christian last_name: Schulz - first_name: Bernhard full_name: Schuster, Bernhard last_name: Schuster citation: ama: 'Biedermann S, Henzinger MH, Schulz C, Schuster B. Memetic graph clustering. In: 17th International Symposium on Experimental Algorithms. Vol 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.SEA.2018.3' apa: 'Biedermann, S., Henzinger, M. H., Schulz, C., & Schuster, B. (2018). Memetic graph clustering. In 17th International Symposium on Experimental Algorithms (Vol. 103). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SEA.2018.3' chicago: Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster. “Memetic Graph Clustering.” In 17th International Symposium on Experimental Algorithms, Vol. 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.SEA.2018.3. ieee: S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Memetic graph clustering,” in 17th International Symposium on Experimental Algorithms, L’Aquila, Italy, 2018, vol. 103. ista: 'Biedermann S, Henzinger MH, Schulz C, Schuster B. 2018. Memetic graph clustering. 17th International Symposium on Experimental Algorithms. SEA: Symposium on Experimental Algorithms, LIPIcs, vol. 103, 3.' mla: Biedermann, Sonja, et al. “Memetic Graph Clustering.” 17th International Symposium on Experimental Algorithms, vol. 103, 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.SEA.2018.3. short: S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, 17th International Symposium on Experimental Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. conference: end_date: 2018-07-29 location: L'Aquila, Italy name: 'SEA: Symposium on Experimental Algorithms' start_date: 2018-07-27 date_created: 2022-08-18T06:49:40Z date_published: 2018-07-01T00:00:00Z date_updated: 2023-02-16T11:45:14Z day: '01' doi: 10.4230/LIPICS.SEA.2018.3 extern: '1' external_id: arxiv: - '1802.07034' intvolume: ' 103' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPICS.SEA.2018.3 month: '07' oa: 1 oa_version: Published Version publication: 17th International Symposium on Experimental Algorithms publication_identifier: isbn: - '9783959770705' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Memetic graph clustering type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 103 year: '2018' ... --- _id: '11958' abstract: - lang: eng text: Solid reagents, leaching catalysts, and heterogeneous photocatalysts are commonly employed in batch processes but are ill-suited for continuous-flow chemistry. Heterogeneous catalysts for thermal reactions are typically used in packed-bed reactors, which cannot be penetrated by light and thus are not suitable for photocatalytic reactions involving solids. We demonstrate that serial micro-batch reactors (SMBRs) allow for the continuous utilization of solid materials together with liquids and gases in flow. This technology was utilized to develop selective and efficient fluorination reactions using a modified graphitic carbon nitride heterogeneous catalyst instead of costly homogeneous metal polypyridyl complexes. The merger of this inexpensive, recyclable catalyst and the SMBR approach enables sustainable and scalable photocatalysis. article_processing_charge: No article_type: letter_note author: - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X - first_name: Menny full_name: Shalom, Menny last_name: Shalom - first_name: Markus full_name: Antonietti, Markus last_name: Antonietti - first_name: Peter H. full_name: Seeberger, Peter H. last_name: Seeberger - first_name: Kerry full_name: Gilmore, Kerry last_name: Gilmore citation: ama: Pieber B, Shalom M, Antonietti M, Seeberger PH, Gilmore K. Continuous heterogeneous photocatalysis in serial micro-batch reactors. Angewandte Chemie International Edition. 2018;57(31):9976-9979. doi:10.1002/anie.201712568 apa: Pieber, B., Shalom, M., Antonietti, M., Seeberger, P. H., & Gilmore, K. (2018). Continuous heterogeneous photocatalysis in serial micro-batch reactors. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201712568 chicago: Pieber, Bartholomäus, Menny Shalom, Markus Antonietti, Peter H. Seeberger, and Kerry Gilmore. “Continuous Heterogeneous Photocatalysis in Serial Micro-Batch Reactors.” Angewandte Chemie International Edition. Wiley, 2018. https://doi.org/10.1002/anie.201712568. ieee: B. Pieber, M. Shalom, M. Antonietti, P. H. Seeberger, and K. Gilmore, “Continuous heterogeneous photocatalysis in serial micro-batch reactors,” Angewandte Chemie International Edition, vol. 57, no. 31. Wiley, pp. 9976–9979, 2018. ista: Pieber B, Shalom M, Antonietti M, Seeberger PH, Gilmore K. 2018. Continuous heterogeneous photocatalysis in serial micro-batch reactors. Angewandte Chemie International Edition. 57(31), 9976–9979. mla: Pieber, Bartholomäus, et al. “Continuous Heterogeneous Photocatalysis in Serial Micro-Batch Reactors.” Angewandte Chemie International Edition, vol. 57, no. 31, Wiley, 2018, pp. 9976–79, doi:10.1002/anie.201712568. short: B. Pieber, M. Shalom, M. Antonietti, P.H. Seeberger, K. Gilmore, Angewandte Chemie International Edition 57 (2018) 9976–9979. date_created: 2022-08-24T10:57:25Z date_published: 2018-07-26T00:00:00Z date_updated: 2023-02-21T10:09:18Z day: '26' doi: 10.1002/anie.201712568 extern: '1' external_id: pmid: - '29377383' intvolume: ' 57' issue: '31' language: - iso: eng month: '07' oa_version: None page: 9976-9979 pmid: 1 publication: Angewandte Chemie International Edition publication_identifier: eissn: - ' 1521-3773' issn: - 1433-7851 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: Continuous heterogeneous photocatalysis in serial micro-batch reactors type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 57 year: '2018' ... --- _id: '1215' abstract: - lang: eng text: "Two generalizations of Itô formula to infinite-dimensional spaces are given.\r\nThe first one, in Hilbert spaces, extends the classical one by taking advantage of\r\ncancellations when they occur in examples and it is applied to the case of a group\r\ngenerator. The second one, based on the previous one and a limit procedure, is an Itô\r\nformula in a special class of Banach spaces having a product structure with the noise\r\nin a Hilbert component; again the key point is the extension due to a cancellation. This\r\nextension to Banach spaces and in particular the specific cancellation are motivated\r\nby path-dependent Itô calculus." acknowledgement: Open access funding provided by Institute of Science and Technology (IST Austria). The second named author benefited partially from the support of the “FMJH Program Gaspard Monge in Optimization and Operations Research” (Project 2014-1607H). He is also grateful for the invitation to the Department of Mathematics of the University of Pisa. The third named author is grateful for the invitation to ENSTA. article_processing_charge: Yes (via OA deal) author: - first_name: Franco full_name: Flandoli, Franco last_name: Flandoli - first_name: Francesco full_name: Russo, Francesco last_name: Russo - first_name: Giovanni A full_name: Zanco, Giovanni A id: 47491882-F248-11E8-B48F-1D18A9856A87 last_name: Zanco citation: ama: Flandoli F, Russo F, Zanco GA. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 2018;31(2):789-826. doi:10.1007/s10959-016-0724-2 apa: Flandoli, F., Russo, F., & Zanco, G. A. (2018). Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. Springer. https://doi.org/10.1007/s10959-016-0724-2 chicago: Flandoli, Franco, Francesco Russo, and Giovanni A Zanco. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” Journal of Theoretical Probability. Springer, 2018. https://doi.org/10.1007/s10959-016-0724-2. ieee: F. Flandoli, F. Russo, and G. A. Zanco, “Infinite-dimensional calculus under weak spatial regularity of the processes,” Journal of Theoretical Probability, vol. 31, no. 2. Springer, pp. 789–826, 2018. ista: Flandoli F, Russo F, Zanco GA. 2018. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 31(2), 789–826. mla: Flandoli, Franco, et al. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” Journal of Theoretical Probability, vol. 31, no. 2, Springer, 2018, pp. 789–826, doi:10.1007/s10959-016-0724-2. short: F. Flandoli, F. Russo, G.A. Zanco, Journal of Theoretical Probability 31 (2018) 789–826. date_created: 2018-12-11T11:50:45Z date_published: 2018-06-01T00:00:00Z date_updated: 2021-01-12T06:49:09Z day: '01' ddc: - '519' department: - _id: JaMa doi: 10.1007/s10959-016-0724-2 file: - access_level: open_access checksum: 47686d58ec21c164540f1a980ff2163f content_type: application/pdf creator: system date_created: 2018-12-12T10:17:13Z date_updated: 2020-07-14T12:44:39Z file_id: '5266' file_name: IST-2016-712-v1+1_s10959-016-0724-2.pdf file_size: 671125 relation: main_file file_date_updated: 2020-07-14T12:44:39Z has_accepted_license: '1' intvolume: ' 31' issue: '2' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '06' oa: 1 oa_version: Published Version page: 789-826 project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Journal of Theoretical Probability publication_status: published publisher: Springer publist_id: '6119' pubrep_id: '712' quality_controlled: '1' scopus_import: 1 status: public title: Infinite-dimensional calculus under weak spatial regularity of the processes tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 31 year: '2018' ... --- _id: '124' abstract: - lang: eng text: By investigating the in situ chemical and O-isotope compositions of olivine in lightly sintered dust agglomerates from the early Solar System, we constrain their origins and the retention of dust in the protoplanetary disk. The grain sizes of silicates in these agglomeratic olivine (AO) chondrules indicate that the grain sizes of chondrule precursors in the Renazzo-like carbonaceous (CR) chondrites ranged from <1 to 80 µm. We infer this grain size range to be equivalent to the size range for dust in the early Solar System. AO chondrules may contain, but are not solely composed of, recycled fragments of earlier formed chondrules. They also contain 16O-rich olivine related to amoeboid olivine aggregates and represent the best record of chondrule-precursor materials. AO chondrules contain one or more large grains, sometimes similar to FeO-poor (type I) and/or FeO-rich (type II) chondrules, while others contain a type II chondrule core. These morphologies are consistent with particle agglomeration by electrostatic charging of grains during collision, a process that may explain solid agglomeration in the protoplanetary disk in the micrometer size regime. The petrographic, isotopic, and chemical compositions of AO chondrules are consistent with chondrule formation by large-scale shocks, bow shocks, and current sheets. The petrographic, isotopic, and chemical similarities between AO chondrules in CR chondrites and chondrule-like objects from comet 81P/Wild 2 indicate that comets contain AO chondrules. We infer that these AO chondrules likely formed in the inner Solar System and migrated to the comet forming region at least 3 Ma after the formation of the first Solar System solids. Observations made in this study imply that the protoplanetary disk retained a dusty disk at least ∼3.7 Ma after the formation of the first Solar System solids, longer than half of the dusty accretion disks observed around other stars. author: - first_name: Scott R full_name: Waitukaitis, Scott R id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87 last_name: Waitukaitis orcid: 0000-0002-2299-3176 - first_name: Devin full_name: Schrader, Devin last_name: Schrader - first_name: Kazuhide full_name: Nagashima, Kazuhide last_name: Nagashima - first_name: Jemma full_name: Davidson, Jemma last_name: Davidson - first_name: Timothy full_name: Mccoy, Timothy last_name: Mccoy - first_name: Harold full_name: Conolly Jr, Harold last_name: Conolly Jr - first_name: Dante full_name: Lauretta, Dante last_name: Lauretta citation: ama: 'Waitukaitis SR, Schrader D, Nagashima K, et al. The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system. Geochimica et Cosmochimica Acta. 2018;223:405-421. doi:10.1016/j.gca.2017.12.014' apa: 'Waitukaitis, S. R., Schrader, D., Nagashima, K., Davidson, J., Mccoy, T., Conolly Jr, H., & Lauretta, D. (2018). The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system. Geochimica et Cosmochimica Acta. Elsevier. https://doi.org/10.1016/j.gca.2017.12.014' chicago: 'Waitukaitis, Scott R, Devin Schrader, Kazuhide Nagashima, Jemma Davidson, Timothy Mccoy, Harold Conolly Jr, and Dante Lauretta. “The Retention of Dust in Protoplanetary Disks: Evidence from Agglomeration Olivine Chondrules from the Outer Solar System.” Geochimica et Cosmochimica Acta. Elsevier, 2018. https://doi.org/10.1016/j.gca.2017.12.014.' ieee: 'S. R. Waitukaitis et al., “The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system,” Geochimica et Cosmochimica Acta, vol. 223. Elsevier, pp. 405–421, 2018.' ista: 'Waitukaitis SR, Schrader D, Nagashima K, Davidson J, Mccoy T, Conolly Jr H, Lauretta D. 2018. The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system. Geochimica et Cosmochimica Acta. 223, 405–421.' mla: 'Waitukaitis, Scott R., et al. “The Retention of Dust in Protoplanetary Disks: Evidence from Agglomeration Olivine Chondrules from the Outer Solar System.” Geochimica et Cosmochimica Acta, vol. 223, Elsevier, 2018, pp. 405–21, doi:10.1016/j.gca.2017.12.014.' short: S.R. Waitukaitis, D. Schrader, K. Nagashima, J. Davidson, T. Mccoy, H. Conolly Jr, D. Lauretta, Geochimica et Cosmochimica Acta 223 (2018) 405–421. date_created: 2018-12-11T11:44:45Z date_published: 2018-02-15T00:00:00Z date_updated: 2021-01-12T06:49:19Z day: '15' doi: 10.1016/j.gca.2017.12.014 extern: '1' intvolume: ' 223' language: - iso: eng month: '02' oa_version: None page: 405 - 421 publication: Geochimica et Cosmochimica Acta publication_status: published publisher: Elsevier publist_id: '7930' quality_controlled: '1' status: public title: 'The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 223 year: '2018' ... --- _id: '125' abstract: - lang: eng text: Many fields of study, including medical imaging, granular physics, colloidal physics, and active matter, require the precise identification and tracking of particle-like objects in images. While many algorithms exist to track particles in diffuse conditions, these often perform poorly when particles are densely packed together—as in, for example, solid-like systems of granular materials. Incorrect particle identification can have significant effects on the calculation of physical quantities, which makes the development of more precise and faster tracking algorithms a worthwhile endeavor. In this work, we present a new tracking algorithm to identify particles in dense systems that is both highly accurate and fast. We demonstrate the efficacy of our approach by analyzing images of dense, solid-state granular media, where we achieve an identification error of 5% in the worst evaluated cases. Going further, we propose a parallelization strategy for our algorithm using a GPU, which results in a speedup of up to 10× when compared to a sequential CPU implementation in C and up to 40× when compared to the reference MATLAB library widely used for particle tracking. Our results extend the capabilities of state-of-the-art particle tracking methods by allowing fast, high-fidelity detection in dense media at high resolutions. author: - first_name: Mauricio full_name: Cerda, Mauricio last_name: Cerda - first_name: Scott R full_name: Waitukaitis, Scott R id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87 last_name: Waitukaitis orcid: 0000-0002-2299-3176 - first_name: Cristóbal full_name: Navarro, Cristóbal last_name: Navarro - first_name: Juan full_name: Silva, Juan last_name: Silva - first_name: Nicolás full_name: Mujica, Nicolás last_name: Mujica - first_name: Nancy full_name: Hitschfeld, Nancy last_name: Hitschfeld citation: ama: Cerda M, Waitukaitis SR, Navarro C, Silva J, Mujica N, Hitschfeld N. A high-speed tracking algorithm for dense granular media. Computer Physics Communications. 2018;227:8-16. doi:10.1016/j.cpc.2018.02.010 apa: Cerda, M., Waitukaitis, S. R., Navarro, C., Silva, J., Mujica, N., & Hitschfeld, N. (2018). A high-speed tracking algorithm for dense granular media. Computer Physics Communications. Elsevier. https://doi.org/10.1016/j.cpc.2018.02.010 chicago: Cerda, Mauricio, Scott R Waitukaitis, Cristóbal Navarro, Juan Silva, Nicolás Mujica, and Nancy Hitschfeld. “A High-Speed Tracking Algorithm for Dense Granular Media.” Computer Physics Communications. Elsevier, 2018. https://doi.org/10.1016/j.cpc.2018.02.010. ieee: M. Cerda, S. R. Waitukaitis, C. Navarro, J. Silva, N. Mujica, and N. Hitschfeld, “A high-speed tracking algorithm for dense granular media,” Computer Physics Communications, vol. 227. Elsevier, pp. 8–16, 2018. ista: Cerda M, Waitukaitis SR, Navarro C, Silva J, Mujica N, Hitschfeld N. 2018. A high-speed tracking algorithm for dense granular media. Computer Physics Communications. 227, 8–16. mla: Cerda, Mauricio, et al. “A High-Speed Tracking Algorithm for Dense Granular Media.” Computer Physics Communications, vol. 227, Elsevier, 2018, pp. 8–16, doi:10.1016/j.cpc.2018.02.010. short: M. Cerda, S.R. Waitukaitis, C. Navarro, J. Silva, N. Mujica, N. Hitschfeld, Computer Physics Communications 227 (2018) 8–16. date_created: 2018-12-11T11:44:45Z date_published: 2018-06-01T00:00:00Z date_updated: 2021-01-12T06:49:23Z day: '01' doi: 10.1016/j.cpc.2018.02.010 extern: '1' intvolume: ' 227' language: - iso: eng month: '06' oa_version: None page: 8 - 16 publication: Computer Physics Communications publication_status: published publisher: Elsevier publist_id: '7928' quality_controlled: '1' status: public title: A high-speed tracking algorithm for dense granular media type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 227 year: '2018' ... --- _id: '126' abstract: - lang: eng text: The Leidenfrost effect occurs when a liquid or stiff sublimable solid near a hot surface creates enough vapor beneath it to lift itself up and float. In contrast, vaporizable soft solids, e.g., hydrogels, have been shown to exhibit persistent bouncing - the elastic Leidenfrost effect. By carefully lowering hydrogel spheres towards a hot surface, we discover that they are also capable of floating. The bounce-to-float transition is controlled by the approach velocity and temperature, analogously to the "dynamic Leidenfrost effect." For the floating regime, we measure power-law scalings for the gap geometry, which we explain with a model that couples the vaporization rate to the spherical shape. Our results reveal that hydrogels are a promising pathway for controlling floating Leidenfrost objects through shape. acknowledgement: We acknowledge funding from the Netherlands Organization for Scientific Research through Grants VICI No. NWO- 680-47-609 (M. v. H. and S. W.) and VENI No. NWO-680- 47-453 (S. W.), and from the German Science Foundation through Grant No. HA8467/1-1 (K. H.). article_number: '048001 ' author: - first_name: Scott R full_name: Waitukaitis, Scott R id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87 last_name: Waitukaitis orcid: 0000-0002-2299-3176 - first_name: Kirsten full_name: Harth, Kirsten last_name: Harth - first_name: Martin full_name: Van Hecke, Martin last_name: Van Hecke citation: ama: 'Waitukaitis SR, Harth K, Van Hecke M. From bouncing to floating: the Leidenfrost effect with hydrogel spheres. Physical Review Letters. 2018;121(4). doi:10.1103/PhysRevLett.121.048001' apa: 'Waitukaitis, S. R., Harth, K., & Van Hecke, M. (2018). From bouncing to floating: the Leidenfrost effect with hydrogel spheres. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.121.048001' chicago: 'Waitukaitis, Scott R, Kirsten Harth, and Martin Van Hecke. “From Bouncing to Floating: The Leidenfrost Effect with Hydrogel Spheres.” Physical Review Letters. American Physical Society, 2018. https://doi.org/10.1103/PhysRevLett.121.048001.' ieee: 'S. R. Waitukaitis, K. Harth, and M. Van Hecke, “From bouncing to floating: the Leidenfrost effect with hydrogel spheres,” Physical Review Letters, vol. 121, no. 4. American Physical Society, 2018.' ista: 'Waitukaitis SR, Harth K, Van Hecke M. 2018. From bouncing to floating: the Leidenfrost effect with hydrogel spheres. Physical Review Letters. 121(4), 048001.' mla: 'Waitukaitis, Scott R., et al. “From Bouncing to Floating: The Leidenfrost Effect with Hydrogel Spheres.” Physical Review Letters, vol. 121, no. 4, 048001, American Physical Society, 2018, doi:10.1103/PhysRevLett.121.048001.' short: S.R. Waitukaitis, K. Harth, M. Van Hecke, Physical Review Letters 121 (2018). date_created: 2018-12-11T11:44:46Z date_published: 2018-07-25T00:00:00Z date_updated: 2021-01-12T06:49:27Z day: '25' doi: 10.1103/PhysRevLett.121.048001 extern: '1' intvolume: ' 121' issue: '4' language: - iso: eng month: '07' oa_version: None publication: Physical Review Letters publication_status: published publisher: American Physical Society publist_id: '7927' quality_controlled: '1' status: public title: 'From bouncing to floating: the Leidenfrost effect with hydrogel spheres' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 121 year: '2018' ... --- _id: '127' abstract: - lang: eng text: The ideas of topology are breaking ground in origami-based metamaterials. Experiments now show that certain shapes — doughnuts included — exhibit topological bistability, and can be made to click between different topologically stable states. author: - first_name: Scott R full_name: Waitukaitis, Scott R id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87 last_name: Waitukaitis orcid: 0000-0002-2299-3176 citation: ama: Waitukaitis SR. Clicks for doughnuts. Nature Physics. 2018;14(8):777-778. doi:10.1038/s41567-018-0160-6 apa: Waitukaitis, S. R. (2018). Clicks for doughnuts. Nature Physics. Nature Publishing Group. https://doi.org/10.1038/s41567-018-0160-6 chicago: Waitukaitis, Scott R. “Clicks for Doughnuts.” Nature Physics. Nature Publishing Group, 2018. https://doi.org/10.1038/s41567-018-0160-6. ieee: S. R. Waitukaitis, “Clicks for doughnuts,” Nature Physics, vol. 14, no. 8. Nature Publishing Group, pp. 777–778, 2018. ista: Waitukaitis SR. 2018. Clicks for doughnuts. Nature Physics. 14(8), 777–778. mla: Waitukaitis, Scott R. “Clicks for Doughnuts.” Nature Physics, vol. 14, no. 8, Nature Publishing Group, 2018, pp. 777–78, doi:10.1038/s41567-018-0160-6. short: S.R. Waitukaitis, Nature Physics 14 (2018) 777–778. date_created: 2018-12-11T11:44:46Z date_published: 2018-05-28T00:00:00Z date_updated: 2021-01-12T06:49:31Z day: '28' doi: 10.1038/s41567-018-0160-6 extern: '1' intvolume: ' 14' issue: '8' language: - iso: eng month: '05' oa_version: None page: 777 - 778 publication: Nature Physics publication_status: published publisher: Nature Publishing Group publist_id: '7926' status: public title: Clicks for doughnuts type: journal_article user_id: 2EBD1598-F248-11E8-B48F-1D18A9856A87 volume: 14 year: '2018' ... --- _id: '174' abstract: - lang: eng text: We survey recent efforts to quantify failures of the Hasse principle in families of rationally connected varieties. alternative_title: - Proceedings of Symposia in Pure Mathematics article_processing_charge: No author: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 citation: ama: 'Browning TD. How often does the Hasse principle hold? In: Vol 97. American Mathematical Society; 2018:89-102. doi:10.1090/pspum/097.2/01700' apa: 'Browning, T. D. (2018). How often does the Hasse principle hold? (Vol. 97, pp. 89–102). Presented at the Algebraic Geometry, Salt Lake City, Utah, USA: American Mathematical Society. https://doi.org/10.1090/pspum/097.2/01700' chicago: Browning, Timothy D. “How Often Does the Hasse Principle Hold?,” 97:89–102. American Mathematical Society, 2018. https://doi.org/10.1090/pspum/097.2/01700. ieee: T. D. Browning, “How often does the Hasse principle hold?,” presented at the Algebraic Geometry, Salt Lake City, Utah, USA, 2018, vol. 97, no. 2, pp. 89–102. ista: Browning TD. 2018. How often does the Hasse principle hold? Algebraic Geometry, Proceedings of Symposia in Pure Mathematics, vol. 97, 89–102. mla: Browning, Timothy D. How Often Does the Hasse Principle Hold? Vol. 97, no. 2, American Mathematical Society, 2018, pp. 89–102, doi:10.1090/pspum/097.2/01700. short: T.D. Browning, in:, American Mathematical Society, 2018, pp. 89–102. conference: end_date: 2015-07-10 location: Salt Lake City, Utah, USA name: Algebraic Geometry start_date: 2015-07-06 date_created: 2018-12-11T11:45:01Z date_published: 2018-01-01T00:00:00Z date_updated: 2021-01-12T06:52:54Z day: '01' doi: 10.1090/pspum/097.2/01700 extern: '1' intvolume: ' 97' issue: '2' language: - iso: eng month: '01' oa_version: None page: 89 - 102 publication_status: published publisher: American Mathematical Society quality_controlled: '1' status: public title: How often does the Hasse principle hold? type: conference user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425 volume: 97 year: '2018' ... --- _id: '176' abstract: - lang: eng text: For a general class of non-negative functions defined on integral ideals of number fields, upper bounds are established for their average over the values of certain principal ideals that are associated to irreducible binary forms with integer coefficients. article_processing_charge: No article_type: original author: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Efthymios full_name: Sofos, Efthymios last_name: Sofos citation: ama: Browning TD, Sofos E. Averages of arithmetic functions over principal ideals. International Journal of Nuber Theory. 2018;15(3):547-567. doi:10.1142/S1793042119500283 apa: Browning, T. D., & Sofos, E. (2018). Averages of arithmetic functions over principal ideals. International Journal of Nuber Theory. World Scientific Publishing. https://doi.org/10.1142/S1793042119500283 chicago: Browning, Timothy D, and Efthymios Sofos. “Averages of Arithmetic Functions over Principal Ideals.” International Journal of Nuber Theory. World Scientific Publishing, 2018. https://doi.org/10.1142/S1793042119500283. ieee: T. D. Browning and E. Sofos, “Averages of arithmetic functions over principal ideals,” International Journal of Nuber Theory, vol. 15, no. 3. World Scientific Publishing, pp. 547–567, 2018. ista: Browning TD, Sofos E. 2018. Averages of arithmetic functions over principal ideals. International Journal of Nuber Theory. 15(3), 547–567. mla: Browning, Timothy D., and Efthymios Sofos. “Averages of Arithmetic Functions over Principal Ideals.” International Journal of Nuber Theory, vol. 15, no. 3, World Scientific Publishing, 2018, pp. 547–67, doi:10.1142/S1793042119500283. short: T.D. Browning, E. Sofos, International Journal of Nuber Theory 15 (2018) 547–567. date_created: 2018-12-11T11:45:01Z date_published: 2018-11-16T00:00:00Z date_updated: 2021-01-12T06:53:01Z day: '16' doi: 10.1142/S1793042119500283 extern: '1' external_id: arxiv: - '1706.04331' intvolume: ' 15' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1706.04331 month: '11' oa: 1 oa_version: Preprint page: 547-567 publication: International Journal of Nuber Theory publication_status: published publisher: World Scientific Publishing status: public title: Averages of arithmetic functions over principal ideals type: journal_article user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425 volume: 15 year: '2018' ... --- _id: '178' abstract: - lang: eng text: We give an upper bound for the number of rational points of height at most B, lying on a surface defined by a quadratic form Q. The bound shows an explicit dependence on Q. It is optimal with respect to B, and is also optimal for typical forms Q. article_processing_charge: No author: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Roger full_name: Heath-Brown, Roger last_name: Heath-Brown citation: ama: Browning TD, Heath-Brown R. Counting rational points on quadric surfaces. Discrete Analysis. 2018;15:1-29. doi:10.19086/da.4375 apa: Browning, T. D., & Heath-Brown, R. (2018). Counting rational points on quadric surfaces. Discrete Analysis. Alliance of Diamond Open Access Journals. https://doi.org/10.19086/da.4375 chicago: Browning, Timothy D, and Roger Heath-Brown. “Counting Rational Points on Quadric Surfaces.” Discrete Analysis. Alliance of Diamond Open Access Journals, 2018. https://doi.org/10.19086/da.4375. ieee: T. D. Browning and R. Heath-Brown, “Counting rational points on quadric surfaces,” Discrete Analysis, vol. 15. Alliance of Diamond Open Access Journals, pp. 1–29, 2018. ista: Browning TD, Heath-Brown R. 2018. Counting rational points on quadric surfaces. Discrete Analysis. 15, 1–29. mla: Browning, Timothy D., and Roger Heath-Brown. “Counting Rational Points on Quadric Surfaces.” Discrete Analysis, vol. 15, Alliance of Diamond Open Access Journals, 2018, pp. 1–29, doi:10.19086/da.4375. short: T.D. Browning, R. Heath-Brown, Discrete Analysis 15 (2018) 1–29. date_created: 2018-12-11T11:45:02Z date_published: 2018-09-07T00:00:00Z date_updated: 2022-08-26T09:13:02Z day: '07' ddc: - '512' doi: 10.19086/da.4375 extern: '1' external_id: arxiv: - '1801.00979' intvolume: ' 15' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1801.00979 month: '09' oa: 1 oa_version: Preprint page: 1 - 29 publication: Discrete Analysis publication_identifier: eissn: - 2397-3129 publication_status: published publisher: Alliance of Diamond Open Access Journals quality_controlled: '1' status: public title: Counting rational points on quadric surfaces tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2018' ... --- _id: '185' abstract: - lang: eng text: We resolve in the affirmative conjectures of A. Skopenkov and Repovš (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our proof of this result is constructive and almost immediately implies an efficient algorithm for testing whether a given piecewise linear map of a graph in a surface is approximable by an embedding. More precisely, an instance of this problem consists of (i) a graph G whose vertices are partitioned into clusters and whose inter-cluster edges are partitioned into bundles, and (ii) a region R of a 2-dimensional compact surface M given as the union of a set of pairwise disjoint discs corresponding to the clusters and a set of pairwise disjoint "pipes" corresponding to the bundles, connecting certain pairs of these discs. We are to decide whether G can be embedded inside M so that the vertices in every cluster are drawn in the corresponding disc, the edges in every bundle pass only through its corresponding pipe, and every edge crosses the boundary of each disc at most once. alternative_title: - Leibniz International Proceedings in Information, LIPIcs article_number: '39' author: - first_name: Radoslav full_name: Fulek, Radoslav id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87 last_name: Fulek orcid: 0000-0001-8485-1774 - first_name: Jan full_name: Kynčl, Jan last_name: Kynčl citation: ama: 'Fulek R, Kynčl J. Hanani-Tutte for approximating maps of graphs. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.39' apa: 'Fulek, R., & Kynčl, J. (2018). Hanani-Tutte for approximating maps of graphs (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.39' chicago: Fulek, Radoslav, and Jan Kynčl. “Hanani-Tutte for Approximating Maps of Graphs,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.39. ieee: 'R. Fulek and J. Kynčl, “Hanani-Tutte for approximating maps of graphs,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.' ista: 'Fulek R, Kynčl J. 2018. Hanani-Tutte for approximating maps of graphs. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 39.' mla: Fulek, Radoslav, and Jan Kynčl. Hanani-Tutte for Approximating Maps of Graphs. Vol. 99, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.39. short: R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. conference: end_date: 2018-06-14 location: Budapest, Hungary name: 'SoCG: Symposium on Computational Geometry' start_date: 2018-06-11 date_created: 2018-12-11T11:45:04Z date_published: 2018-01-01T00:00:00Z date_updated: 2021-01-12T06:53:36Z day: '01' ddc: - '510' department: - _id: UlWa doi: 10.4230/LIPIcs.SoCG.2018.39 file: - access_level: open_access checksum: f1b94f1a75b37c414a1f61d59fb2cd4c content_type: application/pdf creator: dernst date_created: 2018-12-17T12:33:52Z date_updated: 2020-07-14T12:45:19Z file_id: '5701' file_name: 2018_LIPIcs_Fulek.pdf file_size: 718857 relation: main_file file_date_updated: 2020-07-14T12:45:19Z has_accepted_license: '1' intvolume: ' 99' language: - iso: eng month: '01' oa: 1 oa_version: Published Version project: - _id: 261FA626-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02281 name: Eliminating intersections in drawings of graphs publication_identifier: isbn: - 978-3-95977-066-8 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '7735' quality_controlled: '1' scopus_import: 1 status: public title: Hanani-Tutte for approximating maps of graphs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 99 year: '2018' ... --- _id: '188' abstract: - lang: eng text: Smallest enclosing spheres of finite point sets are central to methods in topological data analysis. Focusing on Bregman divergences to measure dissimilarity, we prove bounds on the location of the center of a smallest enclosing sphere. These bounds depend on the range of radii for which Bregman balls are convex. acknowledgement: This research is partially supported by the Office of Naval Research, through grant no. N62909-18-1-2038, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund alternative_title: - Leibniz International Proceedings in Information, LIPIcs author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Ziga full_name: Virk, Ziga last_name: Virk - first_name: Hubert full_name: Wagner, Hubert id: 379CA8B8-F248-11E8-B48F-1D18A9856A87 last_name: Wagner citation: ama: 'Edelsbrunner H, Virk Z, Wagner H. Smallest enclosing spheres and Chernoff points in Bregman geometry. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:35:1-35:13. doi:10.4230/LIPIcs.SoCG.2018.35' apa: 'Edelsbrunner, H., Virk, Z., & Wagner, H. (2018). Smallest enclosing spheres and Chernoff points in Bregman geometry (Vol. 99, p. 35:1-35:13). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.35' chicago: Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry,” 99:35:1-35:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.35. ieee: 'H. Edelsbrunner, Z. Virk, and H. Wagner, “Smallest enclosing spheres and Chernoff points in Bregman geometry,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 35:1-35:13.' ista: 'Edelsbrunner H, Virk Z, Wagner H. 2018. Smallest enclosing spheres and Chernoff points in Bregman geometry. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 35:1-35:13.' mla: Edelsbrunner, Herbert, et al. Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13, doi:10.4230/LIPIcs.SoCG.2018.35. short: H. Edelsbrunner, Z. Virk, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13. conference: end_date: 2018-06-14 location: Budapest, Hungary name: 'SoCG: Symposium on Computational Geometry' start_date: 2018-06-11 date_created: 2018-12-11T11:45:05Z date_published: 2018-06-11T00:00:00Z date_updated: 2021-01-12T06:53:48Z day: '11' ddc: - '000' department: - _id: HeEd doi: 10.4230/LIPIcs.SoCG.2018.35 file: - access_level: open_access checksum: 7509403803b3ac1aee94bbc2ad293d21 content_type: application/pdf creator: dernst date_created: 2018-12-17T16:31:31Z date_updated: 2020-07-14T12:45:20Z file_id: '5724' file_name: 2018_LIPIcs_Edelsbrunner.pdf file_size: 489080 relation: main_file file_date_updated: 2020-07-14T12:45:20Z has_accepted_license: '1' intvolume: ' 99' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 35:1 - 35:13 project: - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '7733' quality_controlled: '1' scopus_import: 1 status: public title: Smallest enclosing spheres and Chernoff points in Bregman geometry tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 99 year: '2018' ... --- _id: '2015' abstract: - lang: eng text: We consider the problem of learning a Bayesian network or directed acyclic graph model from observational data. A number of constraint‐based, score‐based and hybrid algorithms have been developed for this purpose. Statistical consistency guarantees of these algorithms rely on the faithfulness assumption, which has been shown to be restrictive especially for graphs with cycles in the skeleton. We here propose the sparsest permutation (SP) algorithm, showing that learning Bayesian networks is possible under strictly weaker assumptions than faithfulness. This comes at a computational price, thereby indicating a statistical‐computational trade‐off for causal inference algorithms. In the Gaussian noiseless setting, we prove that the SP algorithm boils down to finding the permutation of the variables with the sparsest Cholesky decomposition of the inverse covariance matrix, which is equivalent to ℓ0‐penalized maximum likelihood estimation. We end with a simulation study showing that in line with the proven stronger consistency guarantees, and the SP algorithm compares favourably to standard causal inference algorithms in terms of accuracy for a given sample size. article_number: e183 article_processing_charge: No article_type: original author: - first_name: Garvesh full_name: Raskutti, Garvesh last_name: Raskutti - first_name: Caroline full_name: Uhler, Caroline id: 49ADD78E-F248-11E8-B48F-1D18A9856A87 last_name: Uhler orcid: 0000-0002-7008-0216 citation: ama: Raskutti G, Uhler C. Learning directed acyclic graphs based on sparsest permutations. STAT. 2018;7(1). doi:10.1002/sta4.183 apa: Raskutti, G., & Uhler, C. (2018). Learning directed acyclic graphs based on sparsest permutations. STAT. Wiley. https://doi.org/10.1002/sta4.183 chicago: Raskutti, Garvesh, and Caroline Uhler. “Learning Directed Acyclic Graphs Based on Sparsest Permutations.” STAT. Wiley, 2018. https://doi.org/10.1002/sta4.183. ieee: G. Raskutti and C. Uhler, “Learning directed acyclic graphs based on sparsest permutations,” STAT, vol. 7, no. 1. Wiley, 2018. ista: Raskutti G, Uhler C. 2018. Learning directed acyclic graphs based on sparsest permutations. STAT. 7(1), e183. mla: Raskutti, Garvesh, and Caroline Uhler. “Learning Directed Acyclic Graphs Based on Sparsest Permutations.” STAT, vol. 7, no. 1, e183, Wiley, 2018, doi:10.1002/sta4.183. short: G. Raskutti, C. Uhler, STAT 7 (2018). date_created: 2018-12-11T11:55:13Z date_published: 2018-04-17T00:00:00Z date_updated: 2021-01-12T06:54:44Z day: '17' doi: 10.1002/sta4.183 extern: '1' external_id: arxiv: - '1307.0366' intvolume: ' 7' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1307.0366 month: '04' oa: 1 oa_version: Preprint publication: STAT publication_status: published publisher: Wiley publist_id: '5061' quality_controlled: '1' status: public title: Learning directed acyclic graphs based on sparsest permutations type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2018' ...