--- _id: '10204' abstract: - lang: eng text: Two common representations of close packings of identical spheres consisting of hexagonal layers, called Barlow stackings, appear abundantly in minerals and metals. These motifs, however, occupy an identical portion of space and bear identical first-order topological signatures as measured by persistent homology. Here we present a novel method based on k-fold covers that unambiguously distinguishes between these patterns. Moreover, our approach provides topological evidence that the FCC motif is the more stable of the two in the context of evolving experimental sphere packings during the transition from disordered to an ordered state. We conclude that our approach can be generalised to distinguish between various Barlow stackings manifested in minerals and metals. acknowledgement: MS acknowledges the support by Australian Research Council funding through the ARC Training Centre for M3D Innovation (IC180100008). MS thanks M. Hanifpour and N. Francois for their input and valuable discussions. This project has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme, grant no. 788183 and from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. article_processing_charge: No article_type: original author: - first_name: Georg F full_name: Osang, Georg F id: 464B40D6-F248-11E8-B48F-1D18A9856A87 last_name: Osang orcid: 0000-0002-8882-5116 - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Mohammad full_name: Saadatfar, Mohammad last_name: Saadatfar citation: ama: Osang GF, Edelsbrunner H, Saadatfar M. Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter. 2021;17(40):9107-9115. doi:10.1039/d1sm00774b apa: Osang, G. F., Edelsbrunner, H., & Saadatfar, M. (2021). Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter. Royal Society of Chemistry . https://doi.org/10.1039/d1sm00774b chicago: Osang, Georg F, Herbert Edelsbrunner, and Mohammad Saadatfar. “Topological Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.” Soft Matter. Royal Society of Chemistry , 2021. https://doi.org/10.1039/d1sm00774b. ieee: G. F. Osang, H. Edelsbrunner, and M. Saadatfar, “Topological signatures and stability of hexagonal close packing and Barlow stackings,” Soft Matter, vol. 17, no. 40. Royal Society of Chemistry , pp. 9107–9115, 2021. ista: Osang GF, Edelsbrunner H, Saadatfar M. 2021. Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter. 17(40), 9107–9115. mla: Osang, Georg F., et al. “Topological Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.” Soft Matter, vol. 17, no. 40, Royal Society of Chemistry , 2021, pp. 9107–15, doi:10.1039/d1sm00774b. short: G.F. Osang, H. Edelsbrunner, M. Saadatfar, Soft Matter 17 (2021) 9107–9115. date_created: 2021-10-31T23:01:30Z date_published: 2021-10-20T00:00:00Z date_updated: 2023-10-03T09:24:27Z day: '20' ddc: - '540' department: - _id: HeEd doi: 10.1039/d1sm00774b ec_funded: 1 external_id: isi: - '000700090000001' pmid: - '34569592' file: - access_level: open_access checksum: b4da0c420530295e61b153960f6cb350 content_type: application/pdf creator: dernst date_created: 2023-10-03T09:21:42Z date_updated: 2023-10-03T09:21:42Z file_id: '14385' file_name: 2021_SoftMatter_acceptedversion_Osang.pdf file_size: 4678788 relation: main_file success: 1 file_date_updated: 2023-10-03T09:21:42Z has_accepted_license: '1' intvolume: ' 17' isi: 1 issue: '40' language: - iso: eng month: '10' oa: 1 oa_version: Submitted Version page: 9107-9115 pmid: 1 project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 268116B8-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00342 name: The Wittgenstein Prize publication: Soft Matter publication_identifier: eissn: - 1744-6848 issn: - 1744-683X publication_status: published publisher: 'Royal Society of Chemistry ' quality_controlled: '1' scopus_import: '1' status: public title: Topological signatures and stability of hexagonal close packing and Barlow stackings type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 17 year: '2021' ... --- _id: '9464' abstract: - lang: eng text: We firstly introduce the self-assembled growth of highly uniform Ge quantum wires with controllable position, distance and length on patterned Si (001) substrates. We then present the electrically tunable strong spin-orbit coupling, the first Ge hole spin qubit and ultrafast operation of hole spin qubit in the Ge/Si quantum wires. acknowledgement: This work was supported by the National Key R&D Program of China (Grant No. 2016YFA0301700) and the ERC Starting Grant no. 335497. article_number: '9420817' article_processing_charge: No author: - first_name: Fei full_name: Gao, Fei last_name: Gao - first_name: Jie Yin full_name: Zhang, Jie Yin last_name: Zhang - first_name: Jian Huan full_name: Wang, Jian Huan last_name: Wang - first_name: Ming full_name: Ming, Ming last_name: Ming - first_name: Tina full_name: Wang, Tina last_name: Wang - first_name: Jian Jun full_name: Zhang, Jian Jun last_name: Zhang - first_name: Hannes full_name: Watzinger, Hannes id: 35DF8E50-F248-11E8-B48F-1D18A9856A87 last_name: Watzinger - first_name: Josip full_name: Kukucka, Josip id: 3F5D8856-F248-11E8-B48F-1D18A9856A87 last_name: Kukucka - first_name: Lada full_name: Vukušić, Lada id: 31E9F056-F248-11E8-B48F-1D18A9856A87 last_name: Vukušić orcid: 0000-0003-2424-8636 - first_name: Georgios full_name: Katsaros, Georgios id: 38DB5788-F248-11E8-B48F-1D18A9856A87 last_name: Katsaros orcid: 0000-0001-8342-202X - first_name: Ke full_name: Wang, Ke last_name: Wang - first_name: Gang full_name: Xu, Gang last_name: Xu - first_name: Hai Ou full_name: Li, Hai Ou last_name: Li - first_name: Guo Ping full_name: Guo, Guo Ping last_name: Guo citation: ama: 'Gao F, Zhang JY, Wang JH, et al. Ge/Si quantum wires for quantum computing. In: 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021. IEEE; 2021. doi:10.1109/EDTM50988.2021.9420817' apa: 'Gao, F., Zhang, J. Y., Wang, J. H., Ming, M., Wang, T., Zhang, J. J., … Guo, G. P. (2021). Ge/Si quantum wires for quantum computing. In 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021. Virtual, Online: IEEE. https://doi.org/10.1109/EDTM50988.2021.9420817' chicago: Gao, Fei, Jie Yin Zhang, Jian Huan Wang, Ming Ming, Tina Wang, Jian Jun Zhang, Hannes Watzinger, et al. “Ge/Si Quantum Wires for Quantum Computing.” In 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021. IEEE, 2021. https://doi.org/10.1109/EDTM50988.2021.9420817. ieee: F. Gao et al., “Ge/Si quantum wires for quantum computing,” in 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021, Virtual, Online, 2021. ista: 'Gao F, Zhang JY, Wang JH, Ming M, Wang T, Zhang JJ, Watzinger H, Kukucka J, Vukušić L, Katsaros G, Wang K, Xu G, Li HO, Guo GP. 2021. Ge/Si quantum wires for quantum computing. 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021. EDTM: IEEE Electron Devices Technology and Manufacturing Conference, 9420817.' mla: Gao, Fei, et al. “Ge/Si Quantum Wires for Quantum Computing.” 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021, 9420817, IEEE, 2021, doi:10.1109/EDTM50988.2021.9420817. short: F. Gao, J.Y. Zhang, J.H. Wang, M. Ming, T. Wang, J.J. Zhang, H. Watzinger, J. Kukucka, L. Vukušić, G. Katsaros, K. Wang, G. Xu, H.O. Li, G.P. Guo, in:, 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021, IEEE, 2021. conference: end_date: 2021-04-11 location: Virtual, Online name: 'EDTM: IEEE Electron Devices Technology and Manufacturing Conference' start_date: 2021-04-08 date_created: 2021-06-06T22:01:29Z date_published: 2021-04-08T00:00:00Z date_updated: 2023-10-03T12:51:59Z day: '08' department: - _id: GeKa doi: 10.1109/EDTM50988.2021.9420817 ec_funded: 1 external_id: isi: - '000675595800006' isi: 1 language: - iso: eng month: '04' oa_version: None project: - _id: 25517E86-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '335497' name: Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires publication: 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021 publication_identifier: isbn: - '9781728181769' publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: Ge/Si quantum wires for quantum computing type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2021' ... --- _id: '9605' abstract: - lang: eng text: 'Given a finite set A ⊂ ℝ^d, let Cov_{r,k} denote the set of all points within distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter family of spaces that grow larger when r increases or k decreases, called the multicover bifiltration. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a Čech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors as well. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness. ' acknowledgement: The authors want to thank the reviewers for many helpful comments and suggestions. alternative_title: - LIPIcs article_number: '27' article_processing_charge: No author: - first_name: René full_name: Corbet, René last_name: Corbet - first_name: Michael full_name: Kerber, Michael last_name: Kerber - first_name: Michael full_name: Lesnick, Michael last_name: Lesnick - first_name: Georg F full_name: Osang, Georg F id: 464B40D6-F248-11E8-B48F-1D18A9856A87 last_name: Osang orcid: 0000-0002-8882-5116 citation: ama: 'Corbet R, Kerber M, Lesnick M, Osang GF. Computing the multicover bifiltration. In: Leibniz International Proceedings in Informatics. Vol 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.SoCG.2021.27' apa: 'Corbet, R., Kerber, M., Lesnick, M., & Osang, G. F. (2021). Computing the multicover bifiltration. In Leibniz International Proceedings in Informatics (Vol. 189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2021.27' chicago: Corbet, René, Michael Kerber, Michael Lesnick, and Georg F Osang. “Computing the Multicover Bifiltration.” In Leibniz International Proceedings in Informatics, Vol. 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.SoCG.2021.27. ieee: R. Corbet, M. Kerber, M. Lesnick, and G. F. Osang, “Computing the multicover bifiltration,” in Leibniz International Proceedings in Informatics, Online, 2021, vol. 189. ista: 'Corbet R, Kerber M, Lesnick M, Osang GF. 2021. Computing the multicover bifiltration. Leibniz International Proceedings in Informatics. SoCG: International Symposium on Computational Geometry, LIPIcs, vol. 189, 27.' mla: Corbet, René, et al. “Computing the Multicover Bifiltration.” Leibniz International Proceedings in Informatics, vol. 189, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.SoCG.2021.27. short: R. Corbet, M. Kerber, M. Lesnick, G.F. Osang, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. conference: end_date: 2021-06-11 location: Online name: 'SoCG: International Symposium on Computational Geometry' start_date: 2021-06-07 date_created: 2021-06-27T22:01:49Z date_published: 2021-06-02T00:00:00Z date_updated: 2023-10-04T12:03:39Z day: '02' ddc: - '516' department: - _id: HeEd doi: 10.4230/LIPIcs.SoCG.2021.27 external_id: arxiv: - '2103.07823' file: - access_level: open_access checksum: 0de217501e7ba8b267d58deed0d51761 content_type: application/pdf creator: cziletti date_created: 2021-06-28T12:40:47Z date_updated: 2021-06-28T12:40:47Z file_id: '9610' file_name: 2021_LIPIcs_Corbet.pdf file_size: '1367983' relation: main_file success: 1 file_date_updated: 2021-06-28T12:40:47Z has_accepted_license: '1' intvolume: ' 189' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: Leibniz International Proceedings in Informatics publication_identifier: isbn: - '9783959771849' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' related_material: link: - relation: extended_version url: https://arxiv.org/abs/2103.07823 record: - id: '12709' relation: later_version status: public scopus_import: '1' status: public title: Computing the multicover bifiltration 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: D865714E-FA4E-11E9-B85B-F5C5E5697425 volume: 189 year: '2021' ... --- _id: '9441' abstract: - lang: eng text: "Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. submanifolds of ℝ^d defined as the zero set of some multivariate multivalued smooth function f: ℝ^d → ℝ^{d-n}, where n is the intrinsic dimension of the manifold. A natural way to approximate a smooth isomanifold M is to consider its Piecewise-Linear (PL) approximation M̂ based on a triangulation \U0001D4AF of the ambient space ℝ^d. In this paper, we describe a simple algorithm to trace isomanifolds from a given starting point. The algorithm works for arbitrary dimensions n and d, and any precision D. Our main result is that, when f (or M) has bounded complexity, the complexity of the algorithm is polynomial in d and δ = 1/D (and unavoidably exponential in n). Since it is known that for δ = Ω (d^{2.5}), M̂ is O(D²)-close and isotopic to M, our algorithm produces a faithful PL-approximation of isomanifolds of bounded complexity in time polynomial in d. Combining this algorithm with dimensionality reduction techniques, the dependency on d in the size of M̂ can be completely removed with high probability. We also show that the algorithm can handle isomanifolds with boundary and, more generally, isostratifolds. The algorithm for isomanifolds with boundary has been implemented and experimental results are reported, showing that it is practical and can handle cases that are far ahead of the state-of-the-art. " acknowledgement: We thank Dominique Attali, Guilherme de Fonseca, Arijit Ghosh, Vincent Pilaud and Aurélien Alvarez for their comments and suggestions. We also acknowledge the reviewers. alternative_title: - LIPIcs article_processing_charge: No author: - first_name: Jean-Daniel full_name: Boissonnat, Jean-Daniel last_name: Boissonnat - first_name: Siargey full_name: Kachanovich, Siargey last_name: Kachanovich - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: 'Boissonnat J-D, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In: 37th International Symposium on Computational Geometry (SoCG 2021). Vol 189. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:17:1-17:16. doi:10.4230/LIPIcs.SoCG.2021.17' apa: 'Boissonnat, J.-D., Kachanovich, S., & Wintraecken, M. (2021). Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In 37th International Symposium on Computational Geometry (SoCG 2021) (Vol. 189, p. 17:1-17:16). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2021.17' chicago: 'Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.” In 37th International Symposium on Computational Geometry (SoCG 2021), 189:17:1-17:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.SoCG.2021.17.' ieee: J.-D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations,” in 37th International Symposium on Computational Geometry (SoCG 2021), Virtual, 2021, vol. 189, p. 17:1-17:16. ista: 'Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. 37th International Symposium on Computational Geometry (SoCG 2021). SoCG: Symposium on Computational GeometryLeibniz International Proceedings in Informatics (LIPIcs), LIPIcs, vol. 189, 17:1-17:16.' mla: Boissonnat, Jean-Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.” 37th International Symposium on Computational Geometry (SoCG 2021), vol. 189, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 17:1-17:16, doi:10.4230/LIPIcs.SoCG.2021.17. short: J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, in:, 37th International Symposium on Computational Geometry (SoCG 2021), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2021, p. 17:1-17:16. conference: end_date: 2021-06-11 location: Virtual name: 'SoCG: Symposium on Computational Geometry' start_date: 2021-06-07 date_created: 2021-06-02T10:10:55Z date_published: 2021-06-02T00:00:00Z date_updated: 2023-10-10T07:34:34Z day: '02' ddc: - '005' - '516' - '514' department: - _id: HeEd doi: 10.4230/LIPIcs.SoCG.2021.17 ec_funded: 1 file: - access_level: open_access checksum: c322aa48d5d35a35877896cc565705b6 content_type: application/pdf creator: mwintrae date_created: 2021-06-02T10:22:33Z date_updated: 2021-06-02T10:22:33Z file_id: '9442' file_name: LIPIcs-SoCG-2021-17.pdf file_size: 1972902 relation: main_file success: 1 file_date_updated: 2021-06-02T10:22:33Z has_accepted_license: '1' intvolume: ' 189' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 17:1-17:16 place: Dagstuhl, Germany project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: 37th International Symposium on Computational Geometry (SoCG 2021) publication_identifier: isbn: - 978-3-95977-184-9 issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' related_material: record: - id: '12960' relation: later_version status: public series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations 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: D865714E-FA4E-11E9-B85B-F5C5E5697425 volume: 189 year: '2021' ... --- _id: '9393' abstract: - lang: eng text: "We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff, the ratio, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with bounded treewidth—a class that contains the control flow graphs of most programs. Let n denote the number of nodes of a graph, m the number of edges (for bounded treewidth \U0001D45A=\U0001D442(\U0001D45B)) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for the minimum initial credit problem we show that (1) for general graphs the problem can be solved in \U0001D442(\U0001D45B2⋅\U0001D45A) time and the associated decision problem in \U0001D442(\U0001D45B⋅\U0001D45A) time, improving the previous known \U0001D442(\U0001D45B3⋅\U0001D45A⋅log(\U0001D45B⋅\U0001D44A)) and \U0001D442(\U0001D45B2⋅\U0001D45A) bounds, respectively; and (2) for bounded treewidth graphs we present an algorithm that requires \U0001D442(\U0001D45B⋅log\U0001D45B) time. Second, for bounded treewidth graphs we present an algorithm that approximates the mean-payoff value within a factor of 1+\U0001D716 in time \U0001D442(\U0001D45B⋅log(\U0001D45B/\U0001D716)) as compared to the classical exact algorithms on general graphs that require quadratic time. Third, for the ratio property we present an algorithm that for bounded treewidth graphs works in time \U0001D442(\U0001D45B⋅log(|\U0001D44E⋅\U0001D44F|))=\U0001D442(\U0001D45B⋅log(\U0001D45B⋅\U0001D44A)), when the output is \U0001D44E\U0001D44F, as compared to the previously best known algorithm on general graphs with running time \U0001D442(\U0001D45B2⋅log(\U0001D45B⋅\U0001D44A)). We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks." acknowledgement: 'The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start Grant (279307: Graph Games), and Microsoft faculty fellows award.' article_processing_charge: No article_type: original author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 citation: ama: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. 2021;57:401-428. doi:10.1007/s10703-021-00373-5 apa: Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-021-00373-5 chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design. Springer, 2021. https://doi.org/10.1007/s10703-021-00373-5. ieee: K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in bounded treewidth graphs,” Formal Methods in System Design, vol. 57. Springer, pp. 401–428, 2021. ista: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. 57, 401–428. mla: Chatterjee, Krishnendu, et al. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design, vol. 57, Springer, 2021, pp. 401–28, doi:10.1007/s10703-021-00373-5. short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Formal Methods in System Design 57 (2021) 401–428. date_created: 2021-05-16T22:01:47Z date_published: 2021-09-01T00:00:00Z date_updated: 2023-10-10T11:13:20Z day: '01' department: - _id: KrCh doi: 10.1007/s10703-021-00373-5 ec_funded: 1 external_id: arxiv: - '1504.07384' isi: - '000645490300001' intvolume: ' 57' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1504.07384 month: '09' oa: 1 oa_version: Preprint page: 401-428 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: Formal Methods in System Design publication_identifier: eissn: - 1572-8102 issn: - 0925-9856 publication_status: published publisher: Springer quality_controlled: '1' scopus_import: '1' status: public title: Faster algorithms for quantitative verification in bounded treewidth graphs type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 57 year: '2021' ...