[{"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"external_id":{"arxiv":["1311.3238"]},"title":"Doomsday equilibria for omega-regular games","day":"30","publication":"VMCAI 2014: Verification, Model Checking, and Abstract Interpretation","publication_identifier":{"issn":["0302-9743"],"isbn":["9783642540127"],"eisbn":["9783642540134"],"eissn":["1611-3349"]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"first_name":"Emmanuel","last_name":"Filiot","full_name":"Filiot, Emmanuel"},{"first_name":"Jean-François","last_name":"Raskin","full_name":"Raskin, Jean-François"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.” <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>, vol. 8318, Springer Nature, 2014, pp. 78–97, doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">10.1007/978-3-642-54013-4_5</a>.","ama":"Chatterjee K, Doyen L, Filiot E, Raskin J-F. Doomsday equilibria for omega-regular games. In: <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>. Vol 8318. Springer Nature; 2014:78-97. doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">10.1007/978-3-642-54013-4_5</a>","ieee":"K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin, “Doomsday equilibria for omega-regular games,” in <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>, San Diego, CA, United States, 2014, vol. 8318, pp. 78–97.","apa":"Chatterjee, K., Doyen, L., Filiot, E., &#38; Raskin, J.-F. (2014). Doomsday equilibria for omega-regular games. In <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i> (Vol. 8318, pp. 78–97). San Diego, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">https://doi.org/10.1007/978-3-642-54013-4_5</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin. “Doomsday Equilibria for Omega-Regular Games.” In <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>, 8318:78–97. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">https://doi.org/10.1007/978-3-642-54013-4_5</a>.","ista":"Chatterjee K, Doyen L, Filiot E, Raskin J-F. 2014. Doomsday equilibria for omega-regular games. VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 78–97.","short":"K. Chatterjee, L. Doyen, E. Filiot, J.-F. Raskin, in:, VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 78–97."},"date_updated":"2023-02-23T12:52:24Z","quality_controlled":"1","oa_version":"Preprint","article_processing_charge":"No","related_material":{"record":[{"id":"681","status":"public","relation":"later_version"}]},"publication_status":"published","abstract":[{"text":"Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information games.\r\nIn this paper we propose a new notion of equilibria, called doomsday equilibria, which is a strategy profile such that all players satisfy their own objective, and if any coalition of players deviates and violates even one of the players objective, then the objective of every player is violated.\r\nWe present algorithms and complexity results for deciding the existence of doomsday equilibria for various classes of ω-regular objectives, both for imperfect-information games, and for perfect-information games.We provide optimal complexity bounds for imperfect-information games, and in most cases for perfect-information games.","lang":"eng"}],"date_created":"2022-03-18T13:03:15Z","ec_funded":1,"year":"2014","_id":"10885","intvolume":"      8318","alternative_title":["LNCS"],"doi":"10.1007/978-3-642-54013-4_5","date_published":"2014-01-30T00:00:00Z","language":[{"iso":"eng"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","volume":8318,"publisher":"Springer Nature","department":[{"_id":"KrCh"}],"month":"01","acknowledgement":" Supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No\r\nS11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","scopus_import":"1","arxiv":1,"conference":{"name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation","location":"San Diego, CA, United States","start_date":"2014-01-19","end_date":"2014-01-21"},"page":"78-97"},{"publication_identifier":{"issn":["1612-3786"],"isbn":["9783319040981"],"eisbn":["9783319040998"],"eissn":["2197-666X"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication":"Topological Methods in Data Analysis and Visualization III ","day":"19","type":"conference","citation":{"short":"V. Zobel, J. Reininghaus, I. Hotz, in:, Topological Methods in Data Analysis and Visualization III , Springer, 2014, pp. 249–262.","ieee":"V. Zobel, J. Reininghaus, and I. Hotz, “Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature,” in <i>Topological Methods in Data Analysis and Visualization III </i>, 2014, pp. 249–262.","apa":"Zobel, V., Reininghaus, J., &#38; Hotz, I. (2014). Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. In <i>Topological Methods in Data Analysis and Visualization III </i> (pp. 249–262). Springer. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_16\">https://doi.org/10.1007/978-3-319-04099-8_16</a>","ama":"Zobel V, Reininghaus J, Hotz I. Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. In: <i>Topological Methods in Data Analysis and Visualization III </i>. Springer; 2014:249-262. doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_16\">10.1007/978-3-319-04099-8_16</a>","mla":"Zobel, Valentin, et al. “Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.” <i>Topological Methods in Data Analysis and Visualization III </i>, Springer, 2014, pp. 249–62, doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_16\">10.1007/978-3-319-04099-8_16</a>.","ista":"Zobel V, Reininghaus J, Hotz I. 2014. Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. Topological Methods in Data Analysis and Visualization III . , Mathematics and Visualization, , 249–262.","chicago":"Zobel, Valentin, Jan Reininghaus, and Ingrid Hotz. “Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.” In <i>Topological Methods in Data Analysis and Visualization III </i>, 249–62. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_16\">https://doi.org/10.1007/978-3-319-04099-8_16</a>."},"author":[{"first_name":"Valentin","last_name":"Zobel","full_name":"Zobel, Valentin"},{"id":"4505473A-F248-11E8-B48F-1D18A9856A87","full_name":"Reininghaus, Jan","first_name":"Jan","last_name":"Reininghaus"},{"first_name":"Ingrid","last_name":"Hotz","full_name":"Hotz, Ingrid"}],"date_updated":"2023-09-05T14:13:16Z","alternative_title":["Mathematics and Visualization"],"language":[{"iso":"eng"}],"title":"Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature","status":"public","doi":"10.1007/978-3-319-04099-8_16","date_published":"2014-03-19T00:00:00Z","year":"2014","scopus_import":"1","_id":"10886","date_created":"2022-03-18T13:05:39Z","acknowledgement":"This research is partially supported by the TOPOSYS project FP7-ICT-318493-STREP.","page":"249-262","oa_version":"None","article_processing_charge":"No","quality_controlled":"1","abstract":[{"lang":"eng","text":"We propose a method for visualizing two-dimensional symmetric positive definite tensor fields using the Heat Kernel Signature (HKS). The HKS is derived from the heat kernel and was originally introduced as an isometry invariant shape signature. Each positive definite tensor field defines a Riemannian manifold by considering the tensor field as a Riemannian metric. On this Riemmanian manifold we can apply the definition of the HKS. The resulting scalar quantity is used for the visualization of tensor fields. The HKS is closely related to the Gaussian curvature of the Riemannian manifold and the time parameter of the heat kernel allows a multiscale analysis in a natural way. In this way, the HKS represents field related scale space properties, enabling a level of detail analysis of tensor fields. This makes the HKS an interesting new scalar quantity for tensor fields, which differs significantly from usual tensor invariants like the trace or the determinant. A method for visualization and a numerical realization of the HKS for tensor fields is proposed in this chapter. To validate the approach we apply it to some illustrating simple examples as isolated critical points and to a medical diffusion tensor data set."}],"publisher":"Springer","publication_status":"published","department":[{"_id":"HeEd"}],"month":"03"},{"type":"conference","volume":8889,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2014-11-08T00:00:00Z","doi":"10.1007/978-3-319-13075-0_10","status":"public","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"intvolume":"      8889","conference":{"location":"Jeonju, Korea","start_date":"2014-12-15","name":"ISAAC: International Symposium on Algorithms and Computation","end_date":"2014-12-17"},"page":"117-127","acknowledgement":"T. Biedl was supported by NSERC and the Ross and Muriel Cheriton Fellowship. P. Palfrader was supported by Austrian Science Fund (FWF): P25816-N15.","scopus_import":"1","month":"11","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"author":[{"first_name":"Therese","last_name":"Biedl","full_name":"Biedl, Therese"},{"id":"4700A070-F248-11E8-B48F-1D18A9856A87","full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814","last_name":"Huber","first_name":"Stefan"},{"full_name":"Palfrader, Peter","first_name":"Peter","last_name":"Palfrader"}],"citation":{"mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” <i>25th International Symposium, ISAAC 2014</i>, vol. 8889, Springer Nature, 2014, pp. 117–27, doi:<a href=\"https://doi.org/10.1007/978-3-319-13075-0_10\">10.1007/978-3-319-13075-0_10</a>.","apa":"Biedl, T., Huber, S., &#38; Palfrader, P. (2014). Planar matchings for weighted straight skeletons. In <i>25th International Symposium, ISAAC 2014</i> (Vol. 8889, pp. 117–127). Jeonju, Korea: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-13075-0_10\">https://doi.org/10.1007/978-3-319-13075-0_10</a>","ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” in <i>25th International Symposium, ISAAC 2014</i>, Jeonju, Korea, 2014, vol. 8889, pp. 117–127.","ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. In: <i>25th International Symposium, ISAAC 2014</i>. Vol 8889. Springer Nature; 2014:117-127. doi:<a href=\"https://doi.org/10.1007/978-3-319-13075-0_10\">10.1007/978-3-319-13075-0_10</a>","chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” In <i>25th International Symposium, ISAAC 2014</i>, 8889:117–27. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13075-0_10\">https://doi.org/10.1007/978-3-319-13075-0_10</a>.","ista":"Biedl T, Huber S, Palfrader P. 2014. Planar matchings for weighted straight skeletons. 25th International Symposium, ISAAC 2014. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 8889, 117–127.","short":"T. Biedl, S. Huber, P. Palfrader, in:, 25th International Symposium, ISAAC 2014, Springer Nature, 2014, pp. 117–127."},"date_updated":"2023-02-23T12:20:55Z","day":"08","publication":"25th International Symposium, ISAAC 2014","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783319130743"],"eisbn":["9783319130750"]},"title":"Planar matchings for weighted straight skeletons","date_created":"2022-03-21T07:09:03Z","_id":"10892","year":"2014","related_material":{"record":[{"relation":"later_version","id":"481","status":"public"}]},"publication_status":"published","abstract":[{"text":"In this paper, we introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist.\r\nUsing our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings.","lang":"eng"}],"quality_controlled":"1","article_processing_charge":"No","oa_version":"None"},{"title":"Toward the extraction of saddle periodic orbits","project":[{"grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Topological Complex Systems"}],"day":"19","publication_identifier":{"eissn":["2197-666X"],"isbn":["9783319040981"],"eisbn":["9783319040998"],"issn":["1612-3786"]},"publication":"Topological Methods in Data Analysis and Visualization III ","author":[{"last_name":"Kasten","first_name":"Jens","full_name":"Kasten, Jens"},{"last_name":"Reininghaus","first_name":"Jan","full_name":"Reininghaus, Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Reich, Wieland","first_name":"Wieland","last_name":"Reich"},{"full_name":"Scheuermann, Gerik","last_name":"Scheuermann","first_name":"Gerik"}],"citation":{"mla":"Kasten, Jens, et al. “Toward the Extraction of Saddle Periodic Orbits.” <i>Topological Methods in Data Analysis and Visualization III </i>, edited by Peer-Timo Bremer et al., vol. 1, Springer, 2014, pp. 55–69, doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_4\">10.1007/978-3-319-04099-8_4</a>.","apa":"Kasten, J., Reininghaus, J., Reich, W., &#38; Scheuermann, G. (2014). Toward the extraction of saddle periodic orbits. In P.-T. Bremer, I. Hotz, V. Pascucci, &#38; R. Peikert (Eds.), <i>Topological Methods in Data Analysis and Visualization III </i> (Vol. 1, pp. 55–69). Cham: Springer. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_4\">https://doi.org/10.1007/978-3-319-04099-8_4</a>","ama":"Kasten J, Reininghaus J, Reich W, Scheuermann G. Toward the extraction of saddle periodic orbits. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds. <i>Topological Methods in Data Analysis and Visualization III </i>. Vol 1. Mathematics and Visualization. Cham: Springer; 2014:55-69. doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_4\">10.1007/978-3-319-04099-8_4</a>","ieee":"J. Kasten, J. Reininghaus, W. Reich, and G. Scheuermann, “Toward the extraction of saddle periodic orbits,” in <i>Topological Methods in Data Analysis and Visualization III </i>, vol. 1, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Cham: Springer, 2014, pp. 55–69.","chicago":"Kasten, Jens, Jan Reininghaus, Wieland Reich, and Gerik Scheuermann. “Toward the Extraction of Saddle Periodic Orbits.” In <i>Topological Methods in Data Analysis and Visualization III </i>, edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 1:55–69. Mathematics and Visualization. Cham: Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_4\">https://doi.org/10.1007/978-3-319-04099-8_4</a>.","ista":"Kasten J, Reininghaus J, Reich W, Scheuermann G. 2014.Toward the extraction of saddle periodic orbits. In: Topological Methods in Data Analysis and Visualization III . vol. 1, 55–69.","short":"J. Kasten, J. Reininghaus, W. Reich, G. Scheuermann, in:, P.-T. Bremer, I. Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III , Springer, Cham, 2014, pp. 55–69."},"date_updated":"2022-06-21T12:01:47Z","quality_controlled":"1","article_processing_charge":"No","oa_version":"None","publication_status":"published","abstract":[{"lang":"eng","text":"Saddle periodic orbits are an essential and stable part of the topological skeleton of a 3D vector field. Nevertheless, there is currently no efficient algorithm to robustly extract these features. In this chapter, we present a novel technique to extract saddle periodic orbits. Exploiting the analytic properties of such an orbit, we propose a scalar measure based on the finite-time Lyapunov exponent (FTLE) that indicates its presence. Using persistent homology, we can then extract the robust cycles of this field. These cycles thereby represent the saddle periodic orbits of the given vector field. We discuss the different existing FTLE approximation schemes regarding their applicability to this specific problem and propose an adapted version of FTLE called Normalized Velocity Separation. Finally, we evaluate our method using simple analytic vector field data."}],"series_title":"Mathematics and Visualization","ec_funded":1,"date_created":"2022-03-21T07:11:23Z","_id":"10893","year":"2014","intvolume":"         1","date_published":"2014-03-19T00:00:00Z","doi":"10.1007/978-3-319-04099-8_4","status":"public","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"book_chapter","volume":1,"editor":[{"full_name":"Bremer, Peer-Timo","last_name":"Bremer","first_name":"Peer-Timo"},{"last_name":"Hotz","first_name":"Ingrid","full_name":"Hotz, Ingrid"},{"last_name":"Pascucci","first_name":"Valerio","full_name":"Pascucci, Valerio"},{"full_name":"Peikert, Ronald","first_name":"Ronald","last_name":"Peikert"}],"month":"03","publisher":"Springer","department":[{"_id":"HeEd"}],"acknowledgement":"First, we thank the reviewers of this paper for their ideas and critical comments. In addition, we thank Ronny Peikert and Filip Sadlo for a fruitful discussions. This research is supported by the European Commission under the TOPOSYS project FP7-ICT-318493-STREP, the European Social Fund (ESF App. No. 100098251), and the European Science Foundation under the ACAT Research Network Program.","place":"Cham","scopus_import":"1","page":"55-69"},{"citation":{"mla":"Bauer, Ulrich, et al. “PHAT – Persistent Homology Algorithms Toolbox.” <i>ICMS 2014: International Congress on Mathematical Software</i>, vol. 8592, Springer Berlin Heidelberg, 2014, pp. 137–43, doi:<a href=\"https://doi.org/10.1007/978-3-662-44199-2_24\">10.1007/978-3-662-44199-2_24</a>.","ama":"Bauer U, Kerber M, Reininghaus J, Wagner H. PHAT – Persistent Homology Algorithms Toolbox. In: <i>ICMS 2014: International Congress on Mathematical Software</i>. Vol 8592. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2014:137-143. doi:<a href=\"https://doi.org/10.1007/978-3-662-44199-2_24\">10.1007/978-3-662-44199-2_24</a>","apa":"Bauer, U., Kerber, M., Reininghaus, J., &#38; Wagner, H. (2014). PHAT – Persistent Homology Algorithms Toolbox. In <i>ICMS 2014: International Congress on Mathematical Software</i> (Vol. 8592, pp. 137–143). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-662-44199-2_24\">https://doi.org/10.1007/978-3-662-44199-2_24</a>","ieee":"U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “PHAT – Persistent Homology Algorithms Toolbox,” in <i>ICMS 2014: International Congress on Mathematical Software</i>, Seoul, South Korea, 2014, vol. 8592, pp. 137–143.","chicago":"Bauer, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “PHAT – Persistent Homology Algorithms Toolbox.” In <i>ICMS 2014: International Congress on Mathematical Software</i>, 8592:137–43. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44199-2_24\">https://doi.org/10.1007/978-3-662-44199-2_24</a>.","ista":"Bauer U, Kerber M, Reininghaus J, Wagner H. 2014. PHAT – Persistent Homology Algorithms Toolbox. ICMS 2014: International Congress on Mathematical Software. ICMS: International Congress on Mathematical SoftwareLNCS vol. 8592, 137–143.","short":"U. Bauer, M. Kerber, J. Reininghaus, H. Wagner, in:, ICMS 2014: International Congress on Mathematical Software, Springer Berlin Heidelberg, Berlin, Heidelberg, 2014, pp. 137–143."},"date_updated":"2023-09-20T09:42:40Z","author":[{"orcid":"0000-0002-9683-0724","full_name":"Bauer, Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer","first_name":"Ulrich"},{"first_name":"Michael","last_name":"Kerber","full_name":"Kerber, Michael"},{"first_name":"Jan","last_name":"Reininghaus","full_name":"Reininghaus, Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wagner, Hubert","first_name":"Hubert","last_name":"Wagner"}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783662441985"],"eisbn":["9783662441992"]},"publication":"ICMS 2014: International Congress on Mathematical Software","day":"01","title":"PHAT – Persistent Homology Algorithms Toolbox","_id":"10894","year":"2014","series_title":"LNCS","date_created":"2022-03-21T07:12:16Z","abstract":[{"text":"PHAT is a C++ library for the computation of persistent homology by matrix reduction. We aim for a simple generic design that decouples algorithms from data structures without sacrificing efficiency or user-friendliness. This makes PHAT a versatile platform for experimenting with algorithmic ideas and comparing them to state of the art implementations.","lang":"eng"}],"publication_status":"published","related_material":{"record":[{"status":"public","id":"1433","relation":"later_version"}]},"article_processing_charge":"No","oa_version":"None","quality_controlled":"1","volume":8592,"type":"conference","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","language":[{"iso":"eng"}],"date_published":"2014-09-01T00:00:00Z","doi":"10.1007/978-3-662-44199-2_24","intvolume":"      8592","conference":{"end_date":"2014-08-09","start_date":"2014-08-05","name":"ICMS: International Congress on Mathematical Software","location":"Seoul, South Korea"},"page":"137-143","scopus_import":"1","place":"Berlin, Heidelberg","month":"09","department":[{"_id":"HeEd"}],"publisher":"Springer Berlin Heidelberg"},{"title":"Nuclear pores set the speed limit for mitosis","external_id":{"pmid":["24581486"]},"issue":"5","author":[{"last_name":"Buchwalter","first_name":"Abigail","full_name":"Buchwalter, Abigail"},{"first_name":"Martin W","last_name":"HETZER","orcid":"0000-0002-2111-992X","full_name":"HETZER, Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed"}],"citation":{"ista":"Buchwalter A, Hetzer M. 2014. Nuclear pores set the speed limit for mitosis. Cell. 156(5), 868–869.","chicago":"Buchwalter, Abigail, and Martin Hetzer. “Nuclear Pores Set the Speed Limit for Mitosis.” <i>Cell</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.cell.2014.02.004\">https://doi.org/10.1016/j.cell.2014.02.004</a>.","ieee":"A. Buchwalter and M. Hetzer, “Nuclear pores set the speed limit for mitosis,” <i>Cell</i>, vol. 156, no. 5. Elsevier, pp. 868–869, 2014.","ama":"Buchwalter A, Hetzer M. Nuclear pores set the speed limit for mitosis. <i>Cell</i>. 2014;156(5):868-869. doi:<a href=\"https://doi.org/10.1016/j.cell.2014.02.004\">10.1016/j.cell.2014.02.004</a>","apa":"Buchwalter, A., &#38; Hetzer, M. (2014). Nuclear pores set the speed limit for mitosis. <i>Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cell.2014.02.004\">https://doi.org/10.1016/j.cell.2014.02.004</a>","mla":"Buchwalter, Abigail, and Martin Hetzer. “Nuclear Pores Set the Speed Limit for Mitosis.” <i>Cell</i>, vol. 156, no. 5, Elsevier, 2014, pp. 868–69, doi:<a href=\"https://doi.org/10.1016/j.cell.2014.02.004\">10.1016/j.cell.2014.02.004</a>.","short":"A. Buchwalter, M. Hetzer, Cell 156 (2014) 868–869."},"date_updated":"2022-07-18T08:44:33Z","publication":"Cell","publication_identifier":{"issn":["0092-8674"]},"oa":1,"day":"27","abstract":[{"text":"The spindle assembly checkpoint prevents separation of sister chromatids until each kinetochore is attached to the mitotic spindle. Rodriguez-Bravo et al. report that the nuclear pore complex scaffolds spindle assembly checkpoint signaling in interphase, providing a store of inhibitory signals that limits the speed of the subsequent mitosis.","lang":"eng"}],"publication_status":"published","article_type":"original","oa_version":"Published Version","article_processing_charge":"No","keyword":["General Biochemistry","Genetics and Molecular Biology"],"quality_controlled":"1","year":"2014","_id":"11080","pmid":1,"date_created":"2022-04-07T07:50:04Z","language":[{"iso":"eng"}],"status":"public","doi":"10.1016/j.cell.2014.02.004","date_published":"2014-02-27T00:00:00Z","intvolume":"       156","extern":"1","volume":156,"type":"journal_article","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","publisher":"Elsevier","month":"02","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.cell.2014.02.004"}],"page":"868-869","scopus_import":"1"},{"scopus_import":"1","page":"133-141","main_file_link":[{"url":"https://doi.org/10.1083/jcb.201402003","open_access":"1"}],"month":"04","publisher":"Rockefeller University Press","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","type":"journal_article","volume":205,"extern":"1","intvolume":"       205","date_published":"2014-04-21T00:00:00Z","doi":"10.1083/jcb.201402003","status":"public","language":[{"iso":"eng"}],"pmid":1,"date_created":"2022-04-07T07:50:13Z","_id":"11081","year":"2014","quality_controlled":"1","keyword":["Cell Biology"],"article_processing_charge":"No","oa_version":"Published Version","article_type":"review","publication_status":"published","abstract":[{"text":"In eukaryotic cells the nuclear genome is enclosed by the nuclear envelope (NE). In metazoans, the NE breaks down in mitosis and it has been assumed that the physical barrier separating nucleoplasm and cytoplasm remains intact during the rest of the cell cycle and cell differentiation. However, recent studies suggest that nonmitotic NE remodeling plays a critical role in development, virus infection, laminopathies, and cancer. Although the mechanisms underlying these NE restructuring events are currently being defined, one common theme is activation of protein kinase C family members in the interphase nucleus to disrupt the nuclear lamina, demonstrating the importance of the lamina in maintaining nuclear integrity.","lang":"eng"}],"day":"21","oa":1,"publication":"Journal of Cell Biology","publication_identifier":{"issn":["1540-8140","0021-9525"]},"date_updated":"2022-07-18T08:45:09Z","author":[{"full_name":"Hatch, Emily","first_name":"Emily","last_name":"Hatch"},{"id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","full_name":"HETZER, Martin W","orcid":"0000-0002-2111-992X","first_name":"Martin W","last_name":"HETZER"}],"citation":{"mla":"Hatch, Emily, and Martin Hetzer. “Breaching the Nuclear Envelope in Development and Disease.” <i>Journal of Cell Biology</i>, vol. 205, no. 2, Rockefeller University Press, 2014, pp. 133–41, doi:<a href=\"https://doi.org/10.1083/jcb.201402003\">10.1083/jcb.201402003</a>.","ieee":"E. Hatch and M. Hetzer, “Breaching the nuclear envelope in development and disease,” <i>Journal of Cell Biology</i>, vol. 205, no. 2. Rockefeller University Press, pp. 133–141, 2014.","ama":"Hatch E, Hetzer M. Breaching the nuclear envelope in development and disease. <i>Journal of Cell Biology</i>. 2014;205(2):133-141. doi:<a href=\"https://doi.org/10.1083/jcb.201402003\">10.1083/jcb.201402003</a>","apa":"Hatch, E., &#38; Hetzer, M. (2014). Breaching the nuclear envelope in development and disease. <i>Journal of Cell Biology</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1083/jcb.201402003\">https://doi.org/10.1083/jcb.201402003</a>","chicago":"Hatch, Emily, and Martin Hetzer. “Breaching the Nuclear Envelope in Development and Disease.” <i>Journal of Cell Biology</i>. Rockefeller University Press, 2014. <a href=\"https://doi.org/10.1083/jcb.201402003\">https://doi.org/10.1083/jcb.201402003</a>.","ista":"Hatch E, Hetzer M. 2014. Breaching the nuclear envelope in development and disease. Journal of Cell Biology. 205(2), 133–141.","short":"E. Hatch, M. Hetzer, Journal of Cell Biology 205 (2014) 133–141."},"issue":"2","external_id":{"pmid":["24751535"]},"title":"Breaching the nuclear envelope in development and disease"},{"scopus_import":"1","page":"2472-2484","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1091/mbc.e14-04-0865"}],"publisher":"American Society for Cell Biology","month":"08","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","type":"journal_article","volume":25,"intvolume":"        25","extern":"1","doi":"10.1091/mbc.e14-04-0865","date_published":"2014-08-15T00:00:00Z","language":[{"iso":"eng"}],"status":"public","date_created":"2022-04-07T07:50:24Z","year":"2014","_id":"11082","quality_controlled":"1","oa_version":"Published Version","keyword":["Cell Biology","Molecular Biology"],"article_processing_charge":"No","article_type":"original","publication_status":"published","abstract":[{"text":"The nuclear pore complex (NPC) plays a critical role in gene expression by mediating import of transcription regulators into the nucleus and export of RNA transcripts to the cytoplasm. Emerging evidence suggests that in addition to mediating transport, a subset of nucleoporins (Nups) engage in transcriptional activation and elongation at genomic loci that are not associated with NPCs. The underlying mechanism and regulation of Nup mobility on and off nuclear pores remain unclear. Here we show that Nup50 is a mobile Nup with a pronounced presence both at the NPC and in the nucleoplasm that can move between these different localizations. Strikingly, the dynamic behavior of Nup50 in both locations is dependent on active transcription by RNA polymerase II and requires the N-terminal half of the protein, which contains importin α– and Nup153-binding domains. However, Nup50 dynamics are independent of importin α, Nup153, and Nup98, even though the latter two proteins also exhibit transcription-dependent mobility. Of interest, depletion of Nup50 from C2C12 myoblasts does not affect cell proliferation but inhibits differentiation into myotubes. Taken together, our results suggest a transport-independent role for Nup50 in chromatin biology that occurs away from the NPC.","lang":"eng"}],"day":"15","publication_identifier":{"issn":["1059-1524","1939-4586"]},"publication":"Molecular Biology of the Cell","oa":1,"author":[{"full_name":"Buchwalter, Abigail L.","first_name":"Abigail L.","last_name":"Buchwalter"},{"first_name":"Yun","last_name":"Liang","full_name":"Liang, Yun"},{"first_name":"Martin W","last_name":"HETZER","full_name":"HETZER, Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","orcid":"0000-0002-2111-992X"}],"citation":{"mla":"Buchwalter, Abigail L., et al. “Nup50 Is Required for Cell Differentiation and Exhibits Transcription-Dependent Dynamics.” <i>Molecular Biology of the Cell</i>, vol. 25, no. 16, American Society for Cell Biology, 2014, pp. 2472–84, doi:<a href=\"https://doi.org/10.1091/mbc.e14-04-0865\">10.1091/mbc.e14-04-0865</a>.","ama":"Buchwalter AL, Liang Y, Hetzer M. Nup50 is required for cell differentiation and exhibits transcription-dependent dynamics. <i>Molecular Biology of the Cell</i>. 2014;25(16):2472-2484. doi:<a href=\"https://doi.org/10.1091/mbc.e14-04-0865\">10.1091/mbc.e14-04-0865</a>","ieee":"A. L. Buchwalter, Y. Liang, and M. Hetzer, “Nup50 is required for cell differentiation and exhibits transcription-dependent dynamics,” <i>Molecular Biology of the Cell</i>, vol. 25, no. 16. American Society for Cell Biology, pp. 2472–2484, 2014.","apa":"Buchwalter, A. L., Liang, Y., &#38; Hetzer, M. (2014). Nup50 is required for cell differentiation and exhibits transcription-dependent dynamics. <i>Molecular Biology of the Cell</i>. American Society for Cell Biology. <a href=\"https://doi.org/10.1091/mbc.e14-04-0865\">https://doi.org/10.1091/mbc.e14-04-0865</a>","chicago":"Buchwalter, Abigail L., Yun Liang, and Martin Hetzer. “Nup50 Is Required for Cell Differentiation and Exhibits Transcription-Dependent Dynamics.” <i>Molecular Biology of the Cell</i>. American Society for Cell Biology, 2014. <a href=\"https://doi.org/10.1091/mbc.e14-04-0865\">https://doi.org/10.1091/mbc.e14-04-0865</a>.","ista":"Buchwalter AL, Liang Y, Hetzer M. 2014. Nup50 is required for cell differentiation and exhibits transcription-dependent dynamics. Molecular Biology of the Cell. 25(16), 2472–2484.","short":"A.L. Buchwalter, Y. Liang, M. Hetzer, Molecular Biology of the Cell 25 (2014) 2472–2484."},"date_updated":"2022-07-18T08:45:20Z","issue":"16","title":"Nup50 is required for cell differentiation and exhibits transcription-dependent dynamics"},{"type":"journal_article","volume":443,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2014-09-21T00:00:00Z","doi":"10.1093/mnras/stu1343","status":"public","language":[{"iso":"eng"}],"extern":"1","intvolume":"       443","arxiv":1,"page":"2695-2704","acknowledgement":"First, we acknowledge the referee for their comments, which have improved the clarity of this paper. JPS and IRS acknowledge support from STFC (ST/I001573/1). IRS also acknowledges support from the ERC Advanced Investigator programme DUSTYGAL and a Royal Society/Wolfson Merit Award. DS acknowledges financial support from NWO through a Veni fellowship and from FCT through the award of an FCT-IF starting grant. PNB acknowledges STFC for financial support.","scopus_import":"1","month":"09","publisher":"Oxford University Press","main_file_link":[{"url":"https://arxiv.org/abs/1407.1047","open_access":"1"}],"date_updated":"2022-08-19T08:27:25Z","citation":{"chicago":"Stott, John P., David Sobral, A. M. Swinbank, Ian Smail, Richard Bower, Philip N. Best, Ray M. Sharples, James E. Geach, and Jorryt J Matthee. “A Relationship between Specific Star Formation Rate and Metallicity Gradient within z ∼ 1 Galaxies from KMOS-HiZELS.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/mnras/stu1343\">https://doi.org/10.1093/mnras/stu1343</a>.","ista":"Stott JP, Sobral D, Swinbank AM, Smail I, Bower R, Best PN, Sharples RM, Geach JE, Matthee JJ. 2014. A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. Monthly Notices of the Royal Astronomical Society. 443(3), 2695–2704.","mla":"Stott, John P., et al. “A Relationship between Specific Star Formation Rate and Metallicity Gradient within z ∼ 1 Galaxies from KMOS-HiZELS.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 443, no. 3, Oxford University Press, 2014, pp. 2695–704, doi:<a href=\"https://doi.org/10.1093/mnras/stu1343\">10.1093/mnras/stu1343</a>.","apa":"Stott, J. P., Sobral, D., Swinbank, A. M., Smail, I., Bower, R., Best, P. N., … Matthee, J. J. (2014). A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stu1343\">https://doi.org/10.1093/mnras/stu1343</a>","ieee":"J. P. Stott <i>et al.</i>, “A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 443, no. 3. Oxford University Press, pp. 2695–2704, 2014.","ama":"Stott JP, Sobral D, Swinbank AM, et al. A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. <i>Monthly Notices of the Royal Astronomical Society</i>. 2014;443(3):2695-2704. doi:<a href=\"https://doi.org/10.1093/mnras/stu1343\">10.1093/mnras/stu1343</a>","short":"J.P. Stott, D. Sobral, A.M. Swinbank, I. Smail, R. Bower, P.N. Best, R.M. Sharples, J.E. Geach, J.J. Matthee, Monthly Notices of the Royal Astronomical Society 443 (2014) 2695–2704."},"author":[{"last_name":"Stott","first_name":"John P.","full_name":"Stott, John P."},{"last_name":"Sobral","first_name":"David","full_name":"Sobral, David"},{"first_name":"A. M.","last_name":"Swinbank","full_name":"Swinbank, A. M."},{"last_name":"Smail","first_name":"Ian","full_name":"Smail, Ian"},{"first_name":"Richard","last_name":"Bower","full_name":"Bower, Richard"},{"full_name":"Best, Philip N.","first_name":"Philip N.","last_name":"Best"},{"full_name":"Sharples, Ray M.","first_name":"Ray M.","last_name":"Sharples"},{"first_name":"James E.","last_name":"Geach","full_name":"Geach, James E."},{"id":"7439a258-f3c0-11ec-9501-9df22fe06720","full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X","last_name":"Matthee","first_name":"Jorryt J"}],"day":"21","oa":1,"publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"publication":"Monthly Notices of the Royal Astronomical Society","external_id":{"arxiv":["1407.1047"]},"title":"A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS","issue":"3","date_created":"2022-07-14T12:16:10Z","_id":"11582","year":"2014","article_type":"original","publication_status":"published","abstract":[{"lang":"eng","text":"We have observed a sample of typical z ∼ 1 star-forming galaxies, selected from the HiZELS survey, with the new K-band Multi-Object Spectrograph (KMOS) near-infrared, multi-integral field unit instrument on the Very Large Telescope (VLT), in order to obtain their dynamics and metallicity gradients. The majority of our galaxies have a metallicity gradient consistent with being flat or negative (i.e. higher metallicity cores than outskirts). Intriguingly, we find a trend between metallicity gradient and specific star formation rate (sSFR), such that galaxies with a high sSFR tend to have relatively metal poor centres, a result which is strengthened when combined with data sets from the literature. This result appears to explain the discrepancies reported between different high-redshift studies and varying claims for evolution. From a galaxy evolution perspective, the trend we see would mean that a galaxy's sSFR is governed by the amount of metal-poor gas that can be funnelled into its core, triggered either by merging or through efficient accretion. In fact, merging may play a significant role as it is the starburst galaxies at all epochs, which have the more positive metallicity gradients. Our results may help to explain the origin of the fundamental metallicity relation, in which galaxies at a fixed mass are observed to have lower metallicities at higher star formation rates, especially if the metallicity is measured in an aperture encompassing only the central regions of the galaxy. Finally, we note that this study demonstrates the power of KMOS as an efficient instrument for large-scale resolved galaxy surveys."}],"quality_controlled":"1","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: abundances","galaxies: evolution","galaxies: kinematics and dynamics"],"article_processing_charge":"No","oa_version":"Preprint"},{"author":[{"id":"7439a258-f3c0-11ec-9501-9df22fe06720","full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X","last_name":"Matthee","first_name":"Jorryt J"},{"full_name":"Sobral, David","first_name":"David","last_name":"Sobral"},{"full_name":"Swinbank, A. M.","last_name":"Swinbank","first_name":"A. M."},{"first_name":"Ian","last_name":"Smail","full_name":"Smail, Ian"},{"full_name":"Best, P. N.","last_name":"Best","first_name":"P. N."},{"full_name":"Kim, Jae-Woo","first_name":"Jae-Woo","last_name":"Kim"},{"first_name":"Marijn","last_name":"Franx","full_name":"Franx, Marijn"},{"last_name":"Milvang-Jensen","first_name":"Bo","full_name":"Milvang-Jensen, Bo"},{"first_name":"Johan","last_name":"Fynbo","full_name":"Fynbo, Johan"}],"date_updated":"2022-08-19T08:30:30Z","citation":{"short":"J.J. Matthee, D. Sobral, A.M. Swinbank, I. Smail, P.N. Best, J.-W. Kim, M. Franx, B. Milvang-Jensen, J. Fynbo, Monthly Notices of the Royal Astronomical Society 440 (2014) 2375–2387.","ista":"Matthee JJ, Sobral D, Swinbank AM, Smail I, Best PN, Kim J-W, Franx M, Milvang-Jensen B, Fynbo J. 2014. A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys. Monthly Notices of the Royal Astronomical Society. 440(3), 2375–2387.","chicago":"Matthee, Jorryt J, David Sobral, A. M. Swinbank, Ian Smail, P. N. Best, Jae-Woo Kim, Marijn Franx, Bo Milvang-Jensen, and Johan Fynbo. “A 10 Deg2 Lyman α Survey at Z=8.8 with Spectroscopic Follow-up: Strong Constraints on the Luminosity Function and Implications for Other Surveys.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/mnras/stu392\">https://doi.org/10.1093/mnras/stu392</a>.","apa":"Matthee, J. J., Sobral, D., Swinbank, A. M., Smail, I., Best, P. N., Kim, J.-W., … Fynbo, J. (2014). A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stu392\">https://doi.org/10.1093/mnras/stu392</a>","ieee":"J. J. Matthee <i>et al.</i>, “A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 440, no. 3. Oxford University Press, pp. 2375–2387, 2014.","ama":"Matthee JJ, Sobral D, Swinbank AM, et al. A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys. <i>Monthly Notices of the Royal Astronomical Society</i>. 2014;440(3):2375-2387. doi:<a href=\"https://doi.org/10.1093/mnras/stu392\">10.1093/mnras/stu392</a>","mla":"Matthee, Jorryt J., et al. “A 10 Deg2 Lyman α Survey at Z=8.8 with Spectroscopic Follow-up: Strong Constraints on the Luminosity Function and Implications for Other Surveys.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 440, no. 3, Oxford University Press, 2014, pp. 2375–87, doi:<a href=\"https://doi.org/10.1093/mnras/stu392\">10.1093/mnras/stu392</a>."},"day":"21","oa":1,"publication":"Monthly Notices of the Royal Astronomical Society","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"external_id":{"arxiv":["1402.6697"]},"title":"A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys","issue":"3","date_created":"2022-07-14T12:33:24Z","_id":"11583","year":"2014","publication_status":"published","article_type":"original","abstract":[{"lang":"eng","text":"Candidate galaxies at redshifts of z ∼ 10 are now being found in extremely deep surveys, probing very small areas. As a consequence, candidates are very faint, making spectroscopic confirmation practically impossible. In order to overcome such limitations, we have undertaken the CF-HiZELS survey, which is a large-area, medium-depth near-infrared narrow-band survey targeted at z = 8.8 Lyman α (Lyα) emitters (LAEs) and covering 10 deg2 in part of the SSA22 field with the Canada–France–Hawaii Telescope (CFHT). We surveyed a comoving volume of 4.7 × 106 Mpc3 to a Lyα luminosity limit of 6.3 × 1043舁erg舁s−1. We look for Lyα candidates by applying the following criteria: (i) clear emission-line source, (ii) no optical detections (ugriz from CFHTLS), (iii) no visible detection in the optical stack (ugriz > 27), (iv) visually checked reliable NBJ and J detections and (v) J − K ≤ 0. We compute photometric redshifts and remove a significant amount of dusty lower redshift line-emitters at z ∼ 1.4 or 2.2. A total of 13 Lyα candidates were found, of which two are marked as strong candidates, but the majority have very weak constraints on their spectral energy distributions. Using follow-up observations with SINFONI/VLT, we are able to exclude the most robust candidates as LAEs. We put a strong constraint on the Lyα luminosity function at z ∼ 9 and make realistic predictions for ongoing and future surveys. Our results show that surveys for the highest redshift LAEs are susceptible of multiple contaminations and that spectroscopic follow-up is absolutely necessary."}],"quality_controlled":"1","article_processing_charge":"No","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: high-redshift","cosmology: observations","dark ages","reionization","first stars"],"oa_version":"Preprint","type":"journal_article","volume":440,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2014-05-21T00:00:00Z","doi":"10.1093/mnras/stu392","status":"public","language":[{"iso":"eng"}],"extern":"1","intvolume":"       440","arxiv":1,"page":"2375-2387","acknowledgement":"We thank the anonymous referee for the comments and suggestions which improved both the quality and clarity of this work. DS acknowledges financial support from the Netherlands Organisation for Scientific Research (NWO) through a Veni fellowship. IRS acknowledges support from STFC (ST/I001573/1), a Leverhulme Fellowship, the ERC Advanced Investigator programme DUSTYGAL 321334 and a Royal Society/Wolfson Merit Award. PNB acknowledges support from the Leverhulme Trust. JWK acknowledges the support from the Creative Research Initiative Program, no. 2008- 0060544, of the National Research Foundation of Korea (NRF) funded by the Korean government (MSIP). JPUF and BMJ acknowledge support from the ERC-StG grant EGGS-278202. The Dark Cosmology Centre is funded by the Danish National Research Foundation. This work is based in part on data obtained as part of the UKIRT Infrared Deep Sky Survey. Based on observations obtained with MegaPrime/MegaCam, a joint project of CFHT and CEA/IRFU, at the Canada–France–Hawaii Telescope (CFHT) which is operated by the National Research Council (NRC) of Canada, the Institut National des Science de l’Univers of the Centre National de la Recherche Scientifique (CNRS) of France and the University of Hawaii. This work is based in part on data products produced at Terapix available at the Canadian Astronomy Data Centre as part of the Canada-France-Hawaii Telescope Legacy Survey, a collaborative project of NRC and CNRS. This work was only possible due to OPTICON/FP7 and the access that it granted to the CFHT telescope. The authors also wish to acknowledge the CFHTLS and UKIDSS surveys for their excellent legacy and complementary value – without such high-quality data sets, this research would not have been possible.","scopus_import":"1","month":"05","publisher":"Oxford University Press","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1402.6697"}]},{"year":"2014","_id":"11750","date_created":"2022-08-08T08:26:02Z","oa_version":"None","article_processing_charge":"No","quality_controlled":"1","abstract":[{"lang":"eng","text":"We report on the magnetic properties of a hot-pressed FeSb 2 sample. We find a significant increase in the magnetic susceptibility in our sample when compared with the values previously reported for the polycrystalline sample. The pronounced Curie tail at low temperature corresponds to 0.2% of Fe 2+ impurities per mole. In the intrinsic conductivity region, the susceptibility due to free carriers shows thermally activated behavior and is consistent with the data reported for single crystal FeSb 2 . Based on our data and analysis, while the enhanced magnetic susceptibility in our sample comes mainly from a small amount of unreacted Fe, the contribution from the enhanced carrier density due to lattice and strain defects arising from the ball milling process is also significant. Existence of an unreacted Fe phase is evidenced by small coercivity values of ~100 observed at 50 and 300 K."}],"article_type":"original","publication_status":"published","publication_identifier":{"eissn":["1941-0069"],"issn":["0018-9464"]},"publication":"IEEE Transactions on Magnetics","day":"01","author":[{"last_name":"Pokharel","first_name":"Mani","full_name":"Pokharel, Mani"},{"first_name":"Huaizhou","last_name":"Zhao","full_name":"Zhao, Huaizhou"},{"full_name":"Modic, Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","orcid":"0000-0001-9760-3147","last_name":"Modic","first_name":"Kimberly A"},{"full_name":"Ren, Zhifeng","first_name":"Zhifeng","last_name":"Ren"},{"full_name":"Opeil, Cyril","last_name":"Opeil","first_name":"Cyril"}],"citation":{"mla":"Pokharel, Mani, et al. “Magnetic Properties of Hot-Pressed FeSb2.” <i>IEEE Transactions on Magnetics</i>, vol. 50, no. 5, 6675864, Institute of Electrical and Electronics Engineers, 2014, doi:<a href=\"https://doi.org/10.1109/TMAG.2013.2292607\">10.1109/TMAG.2013.2292607</a>.","ieee":"M. Pokharel, H. Zhao, K. A. Modic, Z. Ren, and C. Opeil, “Magnetic properties of hot-pressed FeSb2,” <i>IEEE Transactions on Magnetics</i>, vol. 50, no. 5. Institute of Electrical and Electronics Engineers, 2014.","ama":"Pokharel M, Zhao H, Modic KA, Ren Z, Opeil C. Magnetic properties of hot-pressed FeSb2. <i>IEEE Transactions on Magnetics</i>. 2014;50(5). doi:<a href=\"https://doi.org/10.1109/TMAG.2013.2292607\">10.1109/TMAG.2013.2292607</a>","apa":"Pokharel, M., Zhao, H., Modic, K. A., Ren, Z., &#38; Opeil, C. (2014). Magnetic properties of hot-pressed FeSb2. <i>IEEE Transactions on Magnetics</i>. Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/TMAG.2013.2292607\">https://doi.org/10.1109/TMAG.2013.2292607</a>","chicago":"Pokharel, Mani, Huaizhou Zhao, Kimberly A Modic, Zhifeng Ren, and Cyril Opeil. “Magnetic Properties of Hot-Pressed FeSb2.” <i>IEEE Transactions on Magnetics</i>. Institute of Electrical and Electronics Engineers, 2014. <a href=\"https://doi.org/10.1109/TMAG.2013.2292607\">https://doi.org/10.1109/TMAG.2013.2292607</a>.","ista":"Pokharel M, Zhao H, Modic KA, Ren Z, Opeil C. 2014. Magnetic properties of hot-pressed FeSb2. IEEE Transactions on Magnetics. 50(5), 6675864.","short":"M. Pokharel, H. Zhao, K.A. Modic, Z. Ren, C. Opeil, IEEE Transactions on Magnetics 50 (2014)."},"date_updated":"2022-08-11T09:51:22Z","issue":"5","article_number":"6675864","title":"Magnetic properties of hot-pressed FeSb2","scopus_import":"1","publisher":"Institute of Electrical and Electronics Engineers","month":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":50,"type":"journal_article","intvolume":"        50","extern":"1","language":[{"iso":"eng"}],"status":"public","doi":"10.1109/TMAG.2013.2292607","date_published":"2014-05-01T00:00:00Z"},{"publication_status":"published","abstract":[{"text":"We study a weighted online bipartite matching problem: G(V 1, V 2, E) is a weighted bipartite graph where V 1 is known beforehand and the vertices of V 2 arrive online. The goal is to match vertices of V 2 as they arrive to vertices in V 1, so as to maximize the sum of weights of edges in the matching. If assignments to V 1 cannot be changed, no bounded competitive ratio is achievable. We study the weighted online matching problem with free disposal, where vertices in V 1 can be assigned multiple times, but only get credit for the maximum weight edge assigned to them over the course of the algorithm. For this problem, the greedy algorithm is 0.5-competitive and determining whether a better competitive ratio is achievable is a well known open problem.\r\n\r\nWe identify an interesting special case where the edge weights are decomposable as the product of two factors, one corresponding to each end point of the edge. This is analogous to the well studied related machines model in the scheduling literature, although the objective functions are different. For this case of decomposable edge weights, we design a 0.5664 competitive randomized algorithm in complete bipartite graphs. We show that such instances with decomposable weights are non-trivial by establishing upper bounds of 0.618 for deterministic and 0.8 for randomized algorithms.\r\n\r\nA tight competitive ratio of 1 − 1/e ≈ 0.632 was known previously for both the 0-1 case as well as the case where edge weights depend on the offline vertices only, but for these cases, reassignments cannot change the quality of the solution. Beating 0.5 for weighted matching where reassignments are necessary has been a significant challenge. We thus give the first online algorithm with competitive ratio strictly better than 0.5 for a non-trivial case of weighted matching with free disposal.","lang":"eng"}],"quality_controlled":"1","oa_version":"Preprint","article_processing_charge":"No","date_created":"2022-08-11T10:41:47Z","year":"2014","_id":"11789","title":"Online bipartite matching with decomposable weights","external_id":{"arxiv":["1409.2139"]},"citation":{"ista":"Charikar M, Henzinger MH, Nguyễn HL. 2014. Online bipartite matching with decomposable weights. 22nd Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LNCS, vol. 8737, 260–271.","chicago":"Charikar, Moses, Monika H Henzinger, and Huy L. Nguyễn. “Online Bipartite Matching with Decomposable Weights.” In <i>22nd Annual European Symposium on Algorithms</i>, 8737:260–71. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44777-2_22\">https://doi.org/10.1007/978-3-662-44777-2_22</a>.","ama":"Charikar M, Henzinger MH, Nguyễn HL. Online bipartite matching with decomposable weights. In: <i>22nd Annual European Symposium on Algorithms</i>. Vol 8737. Springer Nature; 2014:260-271. doi:<a href=\"https://doi.org/10.1007/978-3-662-44777-2_22\">10.1007/978-3-662-44777-2_22</a>","ieee":"M. Charikar, M. H. Henzinger, and H. L. Nguyễn, “Online bipartite matching with decomposable weights,” in <i>22nd Annual European Symposium on Algorithms</i>, Wroclaw, Poland, 2014, vol. 8737, pp. 260–271.","apa":"Charikar, M., Henzinger, M. H., &#38; Nguyễn, H. L. (2014). Online bipartite matching with decomposable weights. In <i>22nd Annual European Symposium on Algorithms</i> (Vol. 8737, pp. 260–271). Wroclaw, Poland: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-44777-2_22\">https://doi.org/10.1007/978-3-662-44777-2_22</a>","mla":"Charikar, Moses, et al. “Online Bipartite Matching with Decomposable Weights.” <i>22nd Annual European Symposium on Algorithms</i>, vol. 8737, Springer Nature, 2014, pp. 260–71, doi:<a href=\"https://doi.org/10.1007/978-3-662-44777-2_22\">10.1007/978-3-662-44777-2_22</a>.","short":"M. Charikar, M.H. Henzinger, H.L. Nguyễn, in:, 22nd Annual European Symposium on Algorithms, Springer Nature, 2014, pp. 260–271."},"author":[{"first_name":"Moses","last_name":"Charikar","full_name":"Charikar, Moses"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"first_name":"Huy L.","last_name":"Nguyễn","full_name":"Nguyễn, Huy L."}],"date_updated":"2023-02-13T11:16:24Z","day":"01","publication_identifier":{"isbn":["978-366244776-5"],"issn":["0302-9743"]},"publication":"22nd Annual European Symposium on Algorithms","oa":1,"publisher":"Springer Nature","month":"09","main_file_link":[{"url":"https://arxiv.org/abs/1409.2139","open_access":"1"}],"arxiv":1,"page":"260 - 271","conference":{"end_date":"2014-09-10","location":"Wroclaw, Poland","name":"ESA: Annual European Symposium on Algorithms","start_date":"2014-09-08"},"scopus_import":"1","doi":"10.1007/978-3-662-44777-2_22","date_published":"2014-09-01T00:00:00Z","language":[{"iso":"eng"}],"status":"public","intvolume":"      8737","alternative_title":["LNCS"],"extern":"1","type":"conference","volume":8737,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"quality_controlled":"1","article_processing_charge":"No","oa_version":"None","month":"12","publication_status":"published","publisher":"Springer Nature","abstract":[{"lang":"eng","text":"Assume a seller wants to sell a digital product in a social network where a buyer’s valuation of the item has positive network externalities from her neighbors that already have the item. The goal of the seller is to maximize his revenue. Previous work on this problem [7] studies the case where clients are offered the item in sequence and have to pay personalized prices. This is highly infeasible in large scale networks such as the Facebook graph: (1) Offering items to the clients one after the other consumes a large amount of time, and (2) price-discrimination of clients could appear unfair to them and result in negative client reaction or could conflict with legal requirements.\r\n\r\nWe study a setting dealing with these issues. Specifically, the item is offered in parallel to multiple clients at the same time and at the same price. This is called a round. We show that with O(logn) rounds, where n is the number of clients, a constant factor of the revenue with price discrimination can be achieved and that this is not possible with o(logn) rounds. Moreover we show that it is APX-hard to maximize the revenue and we give constant factor approximation algorithms for various further settings of limited price discrimination."}],"date_created":"2022-08-11T10:58:44Z","_id":"11790","year":"2014","scopus_import":"1","page":"44 - 57","conference":{"end_date":"2014-12-17","start_date":"2014-12-14","name":"WINE: International Conference on Web and Internet Economics","location":"Beijing, China"},"extern":"1","intvolume":"      8877","alternative_title":["LNCS"],"date_published":"2014-12-01T00:00:00Z","doi":"10.1007/978-3-319-13129-0_4","status":"public","title":"Limiting price discrimination when selling products with positive network externalities","language":[{"iso":"eng"}],"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["0302-9743"]},"publication":"10th International Conference of Web and Internet Economics","author":[{"full_name":"Cigler, Luděk","last_name":"Cigler","first_name":"Luděk"},{"first_name":"Wolfgang","last_name":"Dvořák","full_name":"Dvořák, Wolfgang"},{"first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"first_name":"Martin","last_name":"Starnberger","full_name":"Starnberger, Martin"}],"type":"conference","date_updated":"2023-02-13T11:18:30Z","citation":{"chicago":"Cigler, Luděk, Wolfgang Dvořák, Monika H Henzinger, and Martin Starnberger. “Limiting Price Discrimination When Selling Products with Positive Network Externalities.” In <i>10th International Conference of Web and Internet Economics</i>, 8877:44–57. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_4\">https://doi.org/10.1007/978-3-319-13129-0_4</a>.","ista":"Cigler L, Dvořák W, Henzinger MH, Starnberger M. 2014. Limiting price discrimination when selling products with positive network externalities. 10th International Conference of Web and Internet Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 8877, 44–57.","mla":"Cigler, Luděk, et al. “Limiting Price Discrimination When Selling Products with Positive Network Externalities.” <i>10th International Conference of Web and Internet Economics</i>, vol. 8877, Springer Nature, 2014, pp. 44–57, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_4\">10.1007/978-3-319-13129-0_4</a>.","ieee":"L. Cigler, W. Dvořák, M. H. Henzinger, and M. Starnberger, “Limiting price discrimination when selling products with positive network externalities,” in <i>10th International Conference of Web and Internet Economics</i>, Beijing, China, 2014, vol. 8877, pp. 44–57.","ama":"Cigler L, Dvořák W, Henzinger MH, Starnberger M. Limiting price discrimination when selling products with positive network externalities. In: <i>10th International Conference of Web and Internet Economics</i>. Vol 8877. Springer Nature; 2014:44-57. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_4\">10.1007/978-3-319-13129-0_4</a>","apa":"Cigler, L., Dvořák, W., Henzinger, M. H., &#38; Starnberger, M. (2014). Limiting price discrimination when selling products with positive network externalities. In <i>10th International Conference of Web and Internet Economics</i> (Vol. 8877, pp. 44–57). Beijing, China: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_4\">https://doi.org/10.1007/978-3-319-13129-0_4</a>","short":"L. Cigler, W. Dvořák, M.H. Henzinger, M. Starnberger, in:, 10th International Conference of Web and Internet Economics, Springer Nature, 2014, pp. 44–57."},"volume":8877},{"abstract":[{"lang":"eng","text":"While the penetration of objects into granular media is well-studied, there is little understanding of how objects settle in gravities, geff, different from that of Earth - a scenario potentially relevant to the geomorphology of planets and asteroids and also to their exploration using man-made devices. By conducting experiments in an accelerating frame, we explore geff ranging from 0.4 g to 1.2 g. Surprisingly, we find that the rest depth is independent of geff and also that the time required for the object to come to rest scales like geff-1/2. With discrete element modeling simulations, we reproduce the experimental results and extend the range of geff to objects as small as asteroids and as large as Jupiter. Our results shed light on the initial stage of sedimentation into dry granular media across a range of celestial bodies and also have implications for the design of man-made, extraterrestrial vehicles and structures. Key Points The settling depth in granular media is independent of gravity The settling time scales like g-1/2 Layering driven by granular sedimentation should be similar."}],"month":"05","publication_status":"published","publisher":"Wiley-Blackwell","oa_version":"None","quality_controlled":"1","page":"3032 - 3037","_id":"118","year":"2014","acknowledgement":"The Spanish MINECO project FIS2011-26675, the PIUNA program (U. Navarra), and the Project 29942WL (Fonds de Solidarité Prioritaire France-Cuba) have partially supported this research. ","date_created":"2018-12-11T11:44:43Z","title":"Settling into dry granular media in different gravities","status":"public","language":[{"iso":"eng"}],"date_published":"2014-05-16T00:00:00Z","doi":"10.1002/2014GL059229","extern":"1","intvolume":"        41","issue":"9","volume":41,"citation":{"short":"E. Altshuler, H. Torres, A. González_Pita, C.G. Sánchez, C. Pérez Penichet, S.R. Waitukaitis, R. Hidalgo, Geophysical Research Letters 41 (2014) 3032–3037.","chicago":"Altshuler, Ernesto, H Torres, A González_Pita, Colina G Sánchez, Carlos Pérez Penichet, Scott R Waitukaitis, and Rauól Hidalgo. “Settling into Dry Granular Media in Different Gravities.” <i>Geophysical Research Letters</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1002/2014GL059229\">https://doi.org/10.1002/2014GL059229</a>.","ista":"Altshuler E, Torres H, González_Pita A, Sánchez CG, Pérez Penichet C, Waitukaitis SR, Hidalgo R. 2014. Settling into dry granular media in different gravities. Geophysical Research Letters. 41(9), 3032–3037.","mla":"Altshuler, Ernesto, et al. “Settling into Dry Granular Media in Different Gravities.” <i>Geophysical Research Letters</i>, vol. 41, no. 9, Wiley-Blackwell, 2014, pp. 3032–37, doi:<a href=\"https://doi.org/10.1002/2014GL059229\">10.1002/2014GL059229</a>.","ama":"Altshuler E, Torres H, González_Pita A, et al. Settling into dry granular media in different gravities. <i>Geophysical Research Letters</i>. 2014;41(9):3032-3037. doi:<a href=\"https://doi.org/10.1002/2014GL059229\">10.1002/2014GL059229</a>","ieee":"E. Altshuler <i>et al.</i>, “Settling into dry granular media in different gravities,” <i>Geophysical Research Letters</i>, vol. 41, no. 9. Wiley-Blackwell, pp. 3032–3037, 2014.","apa":"Altshuler, E., Torres, H., González_Pita, A., Sánchez, C. G., Pérez Penichet, C., Waitukaitis, S. R., &#38; Hidalgo, R. (2014). Settling into dry granular media in different gravities. <i>Geophysical Research Letters</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/2014GL059229\">https://doi.org/10.1002/2014GL059229</a>"},"date_updated":"2021-01-12T06:48:53Z","author":[{"first_name":"Ernesto","last_name":"Altshuler","full_name":"Altshuler, Ernesto"},{"full_name":"Torres, H","last_name":"Torres","first_name":"H"},{"last_name":"González_Pita","first_name":"A","full_name":"González_Pita, A"},{"last_name":"Sánchez","first_name":"Colina G","full_name":"Sánchez, Colina G"},{"full_name":"Pérez Penichet, Carlos","first_name":"Carlos","last_name":"Pérez Penichet"},{"last_name":"Waitukaitis","first_name":"Scott R","full_name":"Waitukaitis, Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176"},{"last_name":"Hidalgo","first_name":"Rauól","full_name":"Hidalgo, Rauól"}],"type":"journal_article","publication":"Geophysical Research Letters","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"7936","day":"16"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1402.0054"}],"publisher":"Institute of Electrical and Electronics Engineers","month":"10","scopus_import":"1","page":"146-155","conference":{"start_date":"2014-10-18","location":"Philadelphia, PA, United States","name":"FOCS: Annual Symposium on Foundations of Computer Science","end_date":"2014-10-21"},"arxiv":1,"extern":"1","language":[{"iso":"eng"}],"status":"public","doi":"10.1109/focs.2014.24","date_published":"2014-10-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","oa_version":"Preprint","article_processing_charge":"No","quality_controlled":"1","abstract":[{"lang":"eng","text":"The decremental single-source shortest paths (SSSP) problem concerns maintaining the distances between a given source node s to every node in an n-node m-edge graph G undergoing edge deletions. While its static counterpart can be easily 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 (JACM 1981) has been the fastest known algorithm for three decades. With the loss of a (1 + ε)-approximation factor, the running time was recently improved to O(n 2+o(1) ) by Bernstein and Roditty (SODA 2011), and more recently to O(n 1.8+o(1) + m 1+o(1) ) by Henzinger, Krinninger, and Nanongkai (SODA 2014). In this paper, we finally bring the running time of this case down to near-linear: We give a (1 + ε)-approximation algorithm with O(m 1+o(1) ) total update time, thus obtaining near-linear time. Moreover, we obtain O(m 1+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 log W) time is the O(mn 0.986 log W)-time algorithm by Henzinger, Krinninger, and Nanongkai (STOC 2014) which works for the general weighted directed case. In contrast to the previous results which rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called sparse (d, ε)-hop set introduced by Cohen (JACM 2000) in the PRAM literature. A (d, ε)-hop set of a graph G = (V, E) is a set E' of weighted edges such that the distance between any pair of nodes in G can be (1 + ε)-approximated by their d-hop distance (given by a path containing at most d edges) on G'=(V, E∪E'). Our algorithm can maintain an (n o(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 the distances on this hop set, we develop a monotone bounded-hop Even-Shiloach tree. It results from extending and combining the monotone Even-Shiloach tree of Henzinger, Krinninger, and Nanongkai (FOCS 2013) with the bounded-hop SSSP technique of Bernstein (STOC 2013). These two new tools might be of independent interest."}],"publication_status":"published","related_material":{"record":[{"relation":"later_version","id":"11768","status":"public"}]},"year":"2014","_id":"11855","date_created":"2022-08-16T08:14:33Z","external_id":{"arxiv":["1402.0054"]},"title":"Decremental single-source shortest paths on undirected graphs in near-linear total update time","publication":"55th Annual Symposium on Foundations of Computer Science","publication_identifier":{"issn":["0272-5428"],"eisbn":["978-1-4799-6517-5"]},"oa":1,"day":"01","citation":{"apa":"Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2014). Decremental single-source shortest paths on undirected graphs in near-linear total update time. In <i>55th Annual Symposium on Foundations of Computer Science</i> (pp. 146–155). Philadelphia, PA, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/focs.2014.24\">https://doi.org/10.1109/focs.2014.24</a>","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source shortest paths on undirected graphs in near-linear total update time,” in <i>55th Annual Symposium on Foundations of Computer Science</i>, Philadelphia, PA, United States, 2014, pp. 146–155.","ama":"Henzinger MH, Krinninger S, Nanongkai D. Decremental single-source shortest paths on undirected graphs in near-linear total update time. In: <i>55th Annual Symposium on Foundations of Computer Science</i>. Institute of Electrical and Electronics Engineers; 2014:146-155. doi:<a href=\"https://doi.org/10.1109/focs.2014.24\">10.1109/focs.2014.24</a>","mla":"Henzinger, Monika H., et al. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” <i>55th Annual Symposium on Foundations of Computer Science</i>, Institute of Electrical and Electronics Engineers, 2014, pp. 146–55, doi:<a href=\"https://doi.org/10.1109/focs.2014.24\">10.1109/focs.2014.24</a>.","ista":"Henzinger MH, Krinninger S, Nanongkai D. 2014. Decremental single-source shortest paths on undirected graphs in near-linear total update time. 55th Annual Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations of Computer Science, 146–155.","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” In <i>55th Annual Symposium on Foundations of Computer Science</i>, 146–55. Institute of Electrical and Electronics Engineers, 2014. <a href=\"https://doi.org/10.1109/focs.2014.24\">https://doi.org/10.1109/focs.2014.24</a>.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 55th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2014, pp. 146–155."},"author":[{"first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Sebastian","last_name":"Krinninger","full_name":"Krinninger, Sebastian"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"date_updated":"2023-02-21T16:27:34Z"},{"title":"Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs","external_id":{"arxiv":["1504.07959"]},"article_number":"674 - 683","author":[{"first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"first_name":"Sebastian","last_name":"Krinninger","full_name":"Krinninger, Sebastian"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"}],"citation":{"short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 46th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2014.","ama":"Henzinger MH, Krinninger S, Nanongkai D. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. In: <i>46th Annual ACM Symposium on Theory of Computing</i>. Association for Computing Machinery; 2014. doi:<a href=\"https://doi.org/10.1145/2591796.2591869\">10.1145/2591796.2591869</a>","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs,” in <i>46th Annual ACM Symposium on Theory of Computing</i>, New York, NY, United States, 2014.","apa":"Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2014). Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. In <i>46th Annual ACM Symposium on Theory of Computing</i>. New York, NY, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/2591796.2591869\">https://doi.org/10.1145/2591796.2591869</a>","mla":"Henzinger, Monika H., et al. “Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs.” <i>46th Annual ACM Symposium on Theory of Computing</i>, 674–683, Association for Computing Machinery, 2014, doi:<a href=\"https://doi.org/10.1145/2591796.2591869\">10.1145/2591796.2591869</a>.","ista":"Henzinger MH, Krinninger S, Nanongkai D. 2014. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. 46th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 674–683.","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs.” In <i>46th Annual ACM Symposium on Theory of Computing</i>. Association for Computing Machinery, 2014. <a href=\"https://doi.org/10.1145/2591796.2591869\">https://doi.org/10.1145/2591796.2591869</a>."},"date_updated":"2023-02-17T11:18:52Z","oa":1,"publication":"46th Annual ACM Symposium on Theory of Computing","publication_identifier":{"issn":["0737-8017"],"isbn":["978-145032710-7"]},"day":"01","abstract":[{"text":"We consider dynamic algorithms for maintaining Single-Source Reachability (SSR) and approximate Single-Source Shortest Paths (SSSP) on n-node m-edge directed graphs under edge deletions (decremental algorithms). The previous fastest algorithm for SSR and SSSP goes back three decades to Even and Shiloach (JACM 1981); it has O(1) query time and O(mn) total update time (i.e., linear amortized update time if all edges are deleted). This algorithm serves as a building block for several other dynamic algorithms. The question whether its total update time can be improved is a major, long standing, open problem.\r\n\r\nIn this paper, we answer this question affirmatively. We obtain a randomized algorithm which, in a simplified form, achieves an Õ(mn0.984) expected total update time for SSR and (1 + ε)-approximate SSSP, where Õ(·) hides poly log n. We also extend our algorithm to achieve roughly the same running time for Strongly Connected Components (SCC), improving the algorithm of Roditty and Zwick (FOCS 2002), and an algorithm that improves the Õ (mn log W)-time algorithm of Bernstein (STOC 2013) for approximating SSSP on weighted directed graphs, where the edge weights are integers from 1 to W. All our algorithms have constant query time in the worst case.","lang":"eng"}],"publication_status":"published","article_processing_charge":"No","oa_version":"Preprint","quality_controlled":"1","_id":"11870","year":"2014","date_created":"2022-08-16T09:41:57Z","status":"public","language":[{"iso":"eng"}],"date_published":"2014-05-01T00:00:00Z","doi":"10.1145/2591796.2591869","extern":"1","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"05","publisher":"Association for Computing Machinery","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.07959"}],"conference":{"end_date":"2014-06-03","start_date":"2014-05-31","location":"New York, NY, United States","name":"STOC: Symposium on Theory of Computing"},"arxiv":1,"scopus_import":"1"},{"external_id":{"arxiv":["1412.1318"]},"title":"Deterministic fully dynamic data structures for vertex cover and matching","author":[{"first_name":"Sayan","last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"},{"first_name":"Giuseppe F.","last_name":"Italiano","full_name":"Italiano, Giuseppe F."}],"date_updated":"2023-02-21T16:32:06Z","citation":{"short":"S. Bhattacharya, M.H. Henzinger, G.F. Italiano, in:, 26th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014, pp. 785–804.","ista":"Bhattacharya S, Henzinger MH, Italiano GF. 2014. Deterministic fully dynamic data structures for vertex cover and matching. 26th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 785–804.","chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” In <i>26th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 785–804. Society for Industrial and Applied Mathematics, 2014. <a href=\"https://doi.org/10.1137/1.9781611973730.54\">https://doi.org/10.1137/1.9781611973730.54</a>.","ieee":"S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” in <i>26th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, San Diego, CA, United States, 2014, pp. 785–804.","apa":"Bhattacharya, S., Henzinger, M. H., &#38; Italiano, G. F. (2014). Deterministic fully dynamic data structures for vertex cover and matching. In <i>26th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 785–804). San Diego, CA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611973730.54\">https://doi.org/10.1137/1.9781611973730.54</a>","ama":"Bhattacharya S, Henzinger MH, Italiano GF. Deterministic fully dynamic data structures for vertex cover and matching. In: <i>26th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2014:785-804. doi:<a href=\"https://doi.org/10.1137/1.9781611973730.54\">10.1137/1.9781611973730.54</a>","mla":"Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” <i>26th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2014, pp. 785–804, doi:<a href=\"https://doi.org/10.1137/1.9781611973730.54\">10.1137/1.9781611973730.54</a>."},"publication_identifier":{"isbn":["978-1-61197-374-7"],"eisbn":["978-1-61197-373-0"]},"publication":"26th Annual ACM-SIAM Symposium on Discrete Algorithms","oa":1,"day":"01","abstract":[{"text":"We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph in  time per update. In particular, for minimum vertex cover we provide deterministic data structures for maintaining a (2 + ε) approximation in O(log n/ε2) amortized time per update. For maximum matching, we show how to maintain a (3 + e) approximation in O(m1/3/ε2) amortized time per update, and a (4 + ε) approximation in O(m1/3/ε2) worst-case time per update. Our data structure for fully dynamic minimum vertex cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld [13].","lang":"eng"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"11890"}]},"publication_status":"published","oa_version":"Preprint","article_processing_charge":"No","quality_controlled":"1","year":"2014","_id":"11875","date_created":"2022-08-16T12:36:42Z","language":[{"iso":"eng"}],"status":"public","doi":"10.1137/1.9781611973730.54","date_published":"2014-01-01T00:00:00Z","extern":"1","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Society for Industrial and Applied Mathematics","month":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1412.1318"}],"page":"785-804","conference":{"end_date":"2015-01-06","location":"San Diego, CA, United States","start_date":"2015-01-04","name":"SODA: Symposium on Discrete Algorithms"},"arxiv":1,"scopus_import":"1"},{"doi":"10.1137/1.9781611973402.79","date_published":"2014-01-01T00:00:00Z","language":[{"iso":"eng"}],"title":"A subquadratic-time algorithm for decremental single-source shortest paths","status":"public","extern":"1","author":[{"last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"}],"date_updated":"2023-02-17T11:58:42Z","citation":{"short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 25th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014, pp. 1053–1072.","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “A subquadratic-time algorithm for decremental single-source shortest paths,” in <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Portland, OR, United States, 2014, pp. 1053–1072.","apa":"Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2014). A subquadratic-time algorithm for decremental single-source shortest paths. In <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1053–1072). Portland, OR, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611973402.79\">https://doi.org/10.1137/1.9781611973402.79</a>","ama":"Henzinger MH, Krinninger S, Nanongkai D. A subquadratic-time algorithm for decremental single-source shortest paths. In: <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2014:1053-1072. doi:<a href=\"https://doi.org/10.1137/1.9781611973402.79\">10.1137/1.9781611973402.79</a>","mla":"Henzinger, Monika H., et al. “A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths.” <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2014, pp. 1053–72, doi:<a href=\"https://doi.org/10.1137/1.9781611973402.79\">10.1137/1.9781611973402.79</a>.","ista":"Henzinger MH, Krinninger S, Nanongkai D. 2014. A subquadratic-time algorithm for decremental single-source shortest paths. 25th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1053–1072.","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths.” In <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1053–72. Society for Industrial and Applied Mathematics, 2014. <a href=\"https://doi.org/10.1137/1.9781611973402.79\">https://doi.org/10.1137/1.9781611973402.79</a>."},"type":"conference","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"25th Annual ACM-SIAM Symposium on Discrete Algorithms","publication_identifier":{"isbn":["978-1-61197-338-9"],"eisbn":["978-1-61197-340-2"]},"oa":1,"publisher":"Society for Industrial and Applied Mathematics","publication_status":"published","month":"01","abstract":[{"text":"We study dynamic (1 + ∊)-approximation algorithms for the single-source shortest paths problem in an unweighted undirected n-node m-edge graph under edge deletions. The fastest algorithm for this problem is an algorithm with O(n2+o(1)) total update time and constant query time by Bernstein and Roditty (SODA 2011). In this paper, we improve the total update time to O(n1.8+o(1) + m1+o(1)) while keeping the query time constant. This running time is essentially tight when m = Ω(n1.8) since we need Ω(m) time even in the static setting. For smaller values of m, the running time of our algorithm is subquadratic, and is the first that breaks through the quadratic time barrier.\r\n\r\nIn obtaining this result, we develop a fast algorithm for what we call center cover data structure. We also make non-trivial extensions to our previous techniques called lazy-update and monotone Even-Shiloach trees (ICALP 2013 and FOCS 2013). As by-products of our new techniques, we obtain two new results for the decremental all-pairs shortest-paths problem. Our first result is the first approximation algorithm whose total update time is faster than Õ(mn) for all values of m. Our second result is a new trade-off between the total update time and the additive approximation guarantee.","lang":"eng"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1137/1.9781611973402.79"}],"oa_version":"Published Version","article_processing_charge":"No","page":"1053-1072","conference":{"location":"Portland, OR, United States","start_date":"2014-01-05","name":"SODA: Symposium on Discrete Algorithms","end_date":"2014-01-07"},"date_created":"2022-08-16T12:58:31Z","year":"2014","scopus_import":"1","_id":"11876"},{"external_id":{"arxiv":["1309.2578"]},"title":"Size-dependent same-material tribocharging in insulating grains","issue":"21","article_number":"218001","date_updated":"2021-01-12T06:48:58Z","author":[{"first_name":"Scott R","last_name":"Waitukaitis","full_name":"Waitukaitis, Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176"},{"first_name":"Victor","last_name":"Lee","full_name":"Lee, Victor"},{"full_name":"Pierson, James","last_name":"Pierson","first_name":"James"},{"last_name":"Forman","first_name":"Steven","full_name":"Forman, Steven"},{"full_name":"Jaeger, Heinrich","last_name":"Jaeger","first_name":"Heinrich"}],"citation":{"mla":"Waitukaitis, Scott R., et al. “Size-Dependent Same-Material Tribocharging in Insulating Grains.” <i>APS Physics, Physical Review Letters</i>, vol. 112, no. 21, 218001, American Physical Society, 2014, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.112.218001\">10.1103/PhysRevLett.112.218001</a>.","ama":"Waitukaitis SR, Lee V, Pierson J, Forman S, Jaeger H. Size-dependent same-material tribocharging in insulating grains. <i>APS Physics, Physical Review Letters</i>. 2014;112(21). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.112.218001\">10.1103/PhysRevLett.112.218001</a>","apa":"Waitukaitis, S. R., Lee, V., Pierson, J., Forman, S., &#38; Jaeger, H. (2014). Size-dependent same-material tribocharging in insulating grains. <i>APS Physics, Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.112.218001\">https://doi.org/10.1103/PhysRevLett.112.218001</a>","ieee":"S. R. Waitukaitis, V. Lee, J. Pierson, S. Forman, and H. Jaeger, “Size-dependent same-material tribocharging in insulating grains,” <i>APS Physics, Physical Review Letters</i>, vol. 112, no. 21. American Physical Society, 2014.","chicago":"Waitukaitis, Scott R, Victor Lee, James Pierson, Steven Forman, and Heinrich Jaeger. “Size-Dependent Same-Material Tribocharging in Insulating Grains.” <i>APS Physics, Physical Review Letters</i>. American Physical Society, 2014. <a href=\"https://doi.org/10.1103/PhysRevLett.112.218001\">https://doi.org/10.1103/PhysRevLett.112.218001</a>.","ista":"Waitukaitis SR, Lee V, Pierson J, Forman S, Jaeger H. 2014. Size-dependent same-material tribocharging in insulating grains. APS Physics, Physical Review Letters. 112(21), 218001.","short":"S.R. Waitukaitis, V. Lee, J. Pierson, S. Forman, H. Jaeger, APS Physics, Physical Review Letters 112 (2014)."},"publist_id":"7935","day":"30","oa":1,"publication":"APS Physics, Physical Review Letters","publication_status":"published","abstract":[{"text":"Observations of flowing granular matter have suggested that same-material tribocharging depends on particle size, typically rendering large grains positive and small ones negative. Models assuming the transfer of trapped electrons can account for this trend, but have not been validated. Tracking individual grains in an electric field, we show quantitatively that charge is transferred based on size between materially identical grains. However, the surface density of trapped electrons, measured independently by thermoluminescence techniques, is orders of magnitude too small to account for the scale of charge transferred. This reveals that trapped electrons are not a necessary ingredient for same-material tribocharging.","lang":"eng"}],"quality_controlled":"1","oa_version":"Submitted Version","date_created":"2018-12-11T11:44:44Z","_id":"119","year":"2014","date_published":"2014-05-30T00:00:00Z","doi":"10.1103/PhysRevLett.112.218001","status":"public","language":[{"iso":"eng"}],"extern":"1","intvolume":"       112","type":"journal_article","volume":112,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"05","publisher":"American Physical Society","main_file_link":[{"url":"https://arxiv.org/abs/1309.2578","open_access":"1"}],"arxiv":1,"acknowledgement":"This work was supported by the NSF through DMR-1309611. Access to the shared experimental facilities provided by the NSF-supported Chicago MRSEC (DMR-0820054) is gratefully acknowledged. S. L. F. and J. L. P. acknowledge funding from UIC NSF Grants No. 0850830 and No. 0602308. S. R. W. acknowledges support from a University of Chicago Millikan Fellowship and from Mrs. Joan Winstein through the Winstein Prize for Instrumentation."},{"intvolume":"         7","extern":"1","doi":"10.1002/cssc.201402455","date_published":"2014-11-01T00:00:00Z","language":[{"iso":"eng"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","volume":7,"publisher":"Wiley","month":"11","scopus_import":"1","page":"3122-3131","issue":"11","external_id":{"pmid":["25209099"]},"title":"Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow","day":"01","publication_identifier":{"issn":["1864-5631"],"eissn":["1864-564X"]},"publication":"ChemSusChem","date_updated":"2023-02-21T10:09:42Z","citation":{"short":"M.M. Moghaddam, B. Pieber, T. Glasnov, C.O. Kappe, ChemSusChem 7 (2014) 3122–3131.","mla":"Moghaddam, Mojtaba Mirhosseini, et al. “Immobilized Iron Oxide Nanoparticles as Stable and Reusable Catalysts for Hydrazine-Mediated Nitro Reductions in Continuous Flow.” <i>ChemSusChem</i>, vol. 7, no. 11, Wiley, 2014, pp. 3122–31, doi:<a href=\"https://doi.org/10.1002/cssc.201402455\">10.1002/cssc.201402455</a>.","ama":"Moghaddam MM, Pieber B, Glasnov T, Kappe CO. Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. <i>ChemSusChem</i>. 2014;7(11):3122-3131. doi:<a href=\"https://doi.org/10.1002/cssc.201402455\">10.1002/cssc.201402455</a>","apa":"Moghaddam, M. M., Pieber, B., Glasnov, T., &#38; Kappe, C. O. (2014). Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. <i>ChemSusChem</i>. Wiley. <a href=\"https://doi.org/10.1002/cssc.201402455\">https://doi.org/10.1002/cssc.201402455</a>","ieee":"M. M. Moghaddam, B. Pieber, T. Glasnov, and C. O. Kappe, “Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow,” <i>ChemSusChem</i>, vol. 7, no. 11. Wiley, pp. 3122–3131, 2014.","chicago":"Moghaddam, Mojtaba Mirhosseini, Bartholomäus Pieber, Toma Glasnov, and C. Oliver Kappe. “Immobilized Iron Oxide Nanoparticles as Stable and Reusable Catalysts for Hydrazine-Mediated Nitro Reductions in Continuous Flow.” <i>ChemSusChem</i>. Wiley, 2014. <a href=\"https://doi.org/10.1002/cssc.201402455\">https://doi.org/10.1002/cssc.201402455</a>.","ista":"Moghaddam MM, Pieber B, Glasnov T, Kappe CO. 2014. Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. ChemSusChem. 7(11), 3122–3131."},"author":[{"first_name":"Mojtaba Mirhosseini","last_name":"Moghaddam","full_name":"Moghaddam, Mojtaba Mirhosseini"},{"full_name":"Pieber, Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","last_name":"Pieber","first_name":"Bartholomäus"},{"full_name":"Glasnov, Toma","first_name":"Toma","last_name":"Glasnov"},{"full_name":"Kappe, C. Oliver","first_name":"C. Oliver","last_name":"Kappe"}],"quality_controlled":"1","oa_version":"None","article_processing_charge":"No","publication_status":"published","article_type":"original","abstract":[{"text":"An experimentally easy to perform method for the generation of alumina-supported Fe3O4 nanoparticles [(6±1) nm size, 0.67 wt %]and the use of this material in hydrazine-mediated heterogeneously catalyzed reductions of nitroarenes to anilines under batch and continuous-flow conditions is presented. The bench-stable, reusable nano-Fe3O4@Al2O3 catalyst can selectively reduce functionalized nitroarenes at 1 mol % catalyst loading by using a 20 mol % excess of hydrazine hydrate in an elevated temperature regime (150 °C, reaction time 2–6 min in batch). For continuous-flow processing, the catalyst material is packed into dedicated cartridges and used in a commercially available high-temperature/-pressure flow device. In continuous mode, reaction times can be reduced to less than 1 min at 150 °C (30 bar back pressure) in a highly intensified process. The nano-Fe3O4@Al2O3 catalyst demonstrated stable reduction of nitrobenzene (0.5 M in MeOH) for more than 10 h on stream at a productivity of 30 mmol h−1 (0.72 mol per day). Importantly, virtually no leaching of the catalytically active material could be observed by inductively coupled plasma MS monitoring.","lang":"eng"}],"pmid":1,"date_created":"2022-08-25T08:36:54Z","year":"2014","_id":"11967"}]