TY - CHAP A1 - Weinhold, Carsten A1 - Lackorzynski, Adam A1 - Bierbaum, Jan A1 - Küttler, Martin A1 - Planeta, Maksym A1 - Weisbach, Hannes A1 - Hille, Matthias A1 - Härtig, Hermann A1 - Margolin, Alexander A1 - Sharf, Dror A1 - Levy, Ely A1 - Gak, Pavel A1 - Barak, Amnon A1 - Gholami, Masoud A1 - Schintke, Florian A1 - Schütt, Thorsten A1 - Reinefeld, Alexander A1 - Lieber, Matthias A1 - Nagel, Wolfgang T1 - FFMK: A Fast and Fault-Tolerant Microkernel-Based System for Exascale Computing T2 - Software for Exascale Computing - SPPEXA 2016-2019 Y1 - 2019 U6 - https://doi.org/10.1007/978-3-030-47956-5_16 SP - 483 EP - 516 PB - Springer ER - TY - JOUR A1 - Enke, Harry A1 - Steinmetz, Matthias A1 - Adorf, Hans-Martin A1 - Beck-Ratzka, Alexander A1 - Breitling, Frank A1 - Brüsemeister, Thomas A1 - Carlson, Arthur A1 - Ensslin, Torsten A1 - Högqvist, Mikael A1 - Nickelt, Iliya A1 - Radke, Thomas A1 - Reinefeld, Alexander A1 - Reiser, Angelika A1 - Scholl, Tobias A1 - Spurzem, Rainer A1 - Steinacker, Jürgen A1 - Voges, Wolfgang A1 - Wambsganß, Joachim A1 - White, Steve T1 - AstroGrid-D: Grid technology for astronomical science JF - New Astronomy Y1 - 2011 UR - http://www.sciencedirect.com/science/article/pii/S1384107610000837 U6 - https://doi.org/10.1016/j.newast.2010.07.005 VL - 16 IS - 2 SP - 79 EP - 93 ER - TY - JOUR A1 - Sekuboyina, Anjany A1 - Bayat, Amirhossein A1 - Husseini, Malek E. A1 - Löffler, Maximilian A1 - Li, Hongwei A1 - Tetteh, Giles A1 - Kukačka, Jan A1 - Payer, Christian A1 - Štern, Darko A1 - Urschler, Martin A1 - Chen, Maodong A1 - Cheng, Dalong A1 - Lessmann, Nikolas A1 - Hu, Yujin A1 - Wang, Tianfu A1 - Yang, Dong A1 - Xu, Daguang A1 - Ambellan, Felix A1 - Amiranashvili, Tamaz A1 - Ehlke, Moritz A1 - Lamecker, Hans A1 - Lehnert, Sebastian A1 - Lirio, Marilia A1 - de Olaguer, Nicolás Pérez A1 - Ramm, Heiko A1 - Sahu, Manish A1 - Tack, Alexander A1 - Zachow, Stefan A1 - Jiang, Tao A1 - Ma, Xinjun A1 - Angerman, Christoph A1 - Wang, Xin A1 - Wei, Qingyue A1 - Brown, Kevin A1 - Wolf, Matthias A1 - Kirszenberg, Alexandre A1 - Puybareau, Élodie A1 - Valentinitsch, Alexander A1 - Rempfler, Markus A1 - Menze, Björn H. A1 - Kirschke, Jan S. T1 - VerSe: A Vertebrae Labelling and Segmentation Benchmark for Multi-detector CT Images JF - arXiv Y1 - 2020 ER - TY - JOUR A1 - Schimunek, Johannes A1 - Seidl, Philipp A1 - Elez, Katarina A1 - Hempel, Tim A1 - Le, Tuan A1 - Noé, Frank A1 - Olsson, Simon A1 - Raich, Lluís A1 - Winter, Robin A1 - Gokcan, Hatice A1 - Gusev, Filipp A1 - Gutkin, Evgeny M. A1 - Isayev, Olexandr A1 - Kurnikova, Maria G. A1 - Narangoda, Chamali H. A1 - Zubatyuk, Roman A1 - Bosko, Ivan P. A1 - Furs, Konstantin V. A1 - Karpenko, Anna D. A1 - Kornoushenko, Yury V. A1 - Shuldau, Mikita A1 - Yushkevich, Artsemi A1 - Benabderrahmane, Mohammed B. A1 - Bousquet-Melou, Patrick A1 - Bureau, Ronan A1 - Charton, Beatrice A1 - Cirou, Bertrand C. A1 - Gil, Gérard A1 - Allen, William J. A1 - Sirimulla, Suman A1 - Watowich, Stanley A1 - Antonopoulos, Nick A1 - Epitropakis, Nikolaos A1 - Krasoulis, Agamemnon A1 - Itsikalis, Vassilis A1 - Theodorakis, Stavros A1 - Kozlovskii, Igor A1 - Maliutin, Anton A1 - Medvedev, Alexander A1 - Popov, Petr A1 - Zaretckii, Mark A1 - Eghbal-Zadeh, Hamid A1 - Halmich, Christina A1 - Hochreiter, Sepp A1 - Mayr, Andreas A1 - Ruch, Peter A1 - Widrich, Michael A1 - Berenger, Francois A1 - Kumar, Ashutosh A1 - Yamanishi, Yoshihiro A1 - Zhang, Kam Y. J. A1 - Bengio, Emmanuel A1 - Bengio, Yoshua A1 - Jain, Moksh J. A1 - Korablyov, Maksym A1 - Liu, Cheng-Hao A1 - Marcou, Gilles A1 - Glaab, Enrico A1 - Barnsley, Kelly A1 - Iyengar, Suhasini M. A1 - Ondrechen, Mary Jo A1 - Haupt, V. Joachim A1 - Kaiser, Florian A1 - Schroeder, Michael A1 - Pugliese, Luisa A1 - Albani, Simone A1 - Athanasiou, Christina A1 - Beccari, Andrea A1 - Carloni, Paolo A1 - D’Arrigo, Giulia A1 - Gianquinto, Eleonora A1 - Goßen, Jonas A1 - Hanke, Anton A1 - Joseph, Benjamin P. A1 - Kokh, Daria B. A1 - Kovachka, Sandra A1 - Manelfi, Candida A1 - Mukherjee, Goutam A1 - Muñiz-Chicharro, Abraham A1 - Musiani, Francesco A1 - Nunes-Alves, Ariane A1 - Paiardi, Giulia A1 - Rossetti, Giulia A1 - Sadiq, S. Kashif A1 - Spyrakis, Francesca A1 - Talarico, Carmine A1 - Tsengenes, Alexandros A1 - Wade, Rebecca C. A1 - Copeland, Conner A1 - Gaiser, Jeremiah A1 - Olson, Daniel R. A1 - Roy, Amitava A1 - Venkatraman, Vishwesh A1 - Wheeler, Travis J. A1 - Arthanari, Haribabu A1 - Blaschitz, Klara A1 - Cespugli, Marco A1 - Durmaz, Vedat A1 - Fackeldey, Konstantin A1 - Fischer, Patrick D. A1 - Gorgulla, Christoph A1 - Gruber, Christian A1 - Gruber, Karl A1 - Hetmann, Michael A1 - Kinney, Jamie E. A1 - Padmanabha Das, Krishna M. A1 - Pandita, Shreya A1 - Singh, Amit A1 - Steinkellner, Georg A1 - Tesseyre, Guilhem A1 - Wagner, Gerhard A1 - Wang, Zi-Fu A1 - Yust, Ryan J. A1 - Druzhilovskiy, Dmitry S. A1 - Filimonov, Dmitry A. A1 - Pogodin, Pavel V. A1 - Poroikov, Vladimir A1 - Rudik, Anastassia V. A1 - Stolbov, Leonid A. A1 - Veselovsky, Alexander V. A1 - De Rosa, Maria A1 - De Simone, Giada A1 - Gulotta, Maria R. A1 - Lombino, Jessica A1 - Mekni, Nedra A1 - Perricone, Ugo A1 - Casini, Arturo A1 - Embree, Amanda A1 - Gordon, D. Benjamin A1 - Lei, David A1 - Pratt, Katelin A1 - Voigt, Christopher A. A1 - Chen, Kuang-Yu A1 - Jacob, Yves A1 - Krischuns, Tim A1 - Lafaye, Pierre A1 - Zettor, Agnès A1 - Rodríguez, M. Luis A1 - White, Kris M. A1 - Fearon, Daren A1 - Von Delft, Frank A1 - Walsh, Martin A. A1 - Horvath, Dragos A1 - Brooks III, Charles L. A1 - Falsafi, Babak A1 - Ford, Bryan A1 - García-Sastre, Adolfo A1 - Yup Lee, Sang A1 - Naffakh, Nadia A1 - Varnek, Alexandre A1 - Klambauer, Günter A1 - Hermans, Thomas M. T1 - A community effort in SARS-CoV-2 drug discovery JF - Molecular Informatics KW - COVID-19 KW - drug discovery KW - machine learning KW - SARS-CoV-2 Y1 - 2023 U6 - https://doi.org/https://doi.org/10.1002/minf.202300262 VL - 43 IS - 1 SP - e202300262 ER - TY - JOUR A1 - Lützkendorf, Janine A1 - Matkovic-Rachid, Tanja A1 - Liu, Sunbin A1 - Götz, Torsten A1 - Gao, Lili A1 - Turrel, Oriane A1 - Maglione, Marta A1 - Grieger, Melanie A1 - Putignano, Sabrina A1 - Ramesh, Niraja A1 - Ghelani, Tina A1 - Neumann, Alexander A1 - Gimber, Niclas A1 - Schmoranzer, Jan A1 - Stawrakakis, Anastasia A1 - Brence, Blaž A1 - Baum, Daniel A1 - Ludwig, Kai A1 - Heine, Martin A1 - Mielke, Thorsten A1 - Liu, Fan A1 - Walter, Alexander A1 - Wahl, Markus A1 - Sigrist, Stephan T1 - Blobby is a synaptic active zone assembly protein required for memory in Drosophila JF - Nature Communications Y1 - 2025 U6 - https://doi.org/10.1038/s41467-024-55382-9 VL - 16 ER - TY - JOUR A1 - Sekuboyina, Anjany A1 - Husseini, Malek E. A1 - Bayat, Amirhossein A1 - Löffler, Maximilian A1 - Liebl, Hans A1 - Li, Hongwei A1 - Tetteh, Giles A1 - Kukačka, Jan A1 - Payer, Christian A1 - Štern, Darko A1 - Urschler, Martin A1 - Chen, Maodong A1 - Cheng, Dalong A1 - Lessmann, Nikolas A1 - Hu, Yujin A1 - Wang, Tianfu A1 - Yang, Dong A1 - Xu, Daguang A1 - Ambellan, Felix A1 - Amiranashvili, Tamaz A1 - Ehlke, Moritz A1 - Lamecker, Hans A1 - Lehnert, Sebastian A1 - Lirio, Marilia A1 - de Olaguer, Nicolás Pérez A1 - Ramm, Heiko A1 - Sahu, Manish A1 - Tack, Alexander A1 - Zachow, Stefan A1 - Jiang, Tao A1 - Ma, Xinjun A1 - Angerman, Christoph A1 - Wang, Xin A1 - Brown, Kevin A1 - Kirszenberg, Alexandre A1 - Puybareau, Élodie A1 - Chen, Di A1 - Bai, Yiwei A1 - Rapazzo, Brandon H. A1 - Yeah, Timyoas A1 - Zhang, Amber A1 - Xu, Shangliang A1 - Hou, Feng A1 - He, Zhiqiang A1 - Zeng, Chan A1 - Xiangshang, Zheng A1 - Liming, Xu A1 - Netherton, Tucker J. A1 - Mumme, Raymond P. A1 - Court, Laurence E. A1 - Huang, Zixun A1 - He, Chenhang A1 - Wang, Li-Wen A1 - Ling, Sai Ho A1 - Huynh, Lê Duy A1 - Boutry, Nicolas A1 - Jakubicek, Roman A1 - Chmelik, Jiri A1 - Mulay, Supriti A1 - Sivaprakasam, Mohanasankar A1 - Paetzold, Johannes C. A1 - Shit, Suprosanna A1 - Ezhov, Ivan A1 - Wiestler, Benedikt A1 - Glocker, Ben A1 - Valentinitsch, Alexander A1 - Rempfler, Markus A1 - Menze, Björn H. A1 - Kirschke, Jan S. T1 - VerSe: A Vertebrae labelling and segmentation benchmark for multi-detector CT images JF - Medical Image Analysis N2 - Vertebral labelling and segmentation are two fundamental tasks in an automated spine processing pipeline. Reliable and accurate processing of spine images is expected to benefit clinical decision support systems for diagnosis, surgery planning, and population-based analysis of spine and bone health. However, designing automated algorithms for spine processing is challenging predominantly due to considerable variations in anatomy and acquisition protocols and due to a severe shortage of publicly available data. Addressing these limitations, the Large Scale Vertebrae Segmentation Challenge (VerSe) was organised in conjunction with the International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI) in 2019 and 2020, with a call for algorithms tackling the labelling and segmentation of vertebrae. Two datasets containing a total of 374 multi-detector CT scans from 355 patients were prepared and 4505 vertebrae have individually been annotated at voxel level by a human-machine hybrid algorithm (https://osf.io/nqjyw/, https://osf.io/t98fz/). A total of 25 algorithms were benchmarked on these datasets. In this work, we present the results of this evaluation and further investigate the performance variation at the vertebra level, scan level, and different fields of view. We also evaluate the generalisability of the approaches to an implicit domain shift in data by evaluating the top-performing algorithms of one challenge iteration on data from the other iteration. The principal takeaway from VerSe: the performance of an algorithm in labelling and segmenting a spine scan hinges on its ability to correctly identify vertebrae in cases of rare anatomical variations. The VerSe content and code can be accessed at: https://github.com/anjany/verse. Y1 - 2021 U6 - https://doi.org/10.1016/j.media.2021.102166 VL - 73 ER - TY - JOUR A1 - Fügenschuh, Armin A1 - Göttlich, Simone A1 - Herty, Michael A1 - Klar, Alexander A1 - Martin, Alexander T1 - A Discrete Optimization Approach to Large Scale Supply Networks Based on Partial Differential Equations JF - SIAM Journal on Scientific Computing Y1 - 2008 VL - 30 IS - 3 SP - 1490 EP - 1507 ER - TY - GEN A1 - Grötschel, Martin A1 - Martin, Alexander A1 - Weismantel, Robert T1 - Optimum Path Packing on Wheels: The Consecutive Case N2 - We show that, given a wheel with nonnegative edge lengths and pairs of terminals located on the wheel's outer cycle such that the terminal pairs are in consecutive order, then a path packing, i.~e., a collection of edge disjoint paths connecting the given terminal pairs, of minimum length can be found in strongly polynomial time. Moreover, we exhibit for this case a system of linear inequalities that provides a complete and nonredundant description of the path packing polytope, which is the convex hull of all incidence vectors of path packings and their supersets. T3 - ZIB-Report - SC-95-31 Y1 - 1995 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-1976 ER - TY - GEN A1 - Grötschel, Martin A1 - Martin, Alexander A1 - Weismantel, Robert T1 - The Steiner Tree Packing Problem in VLSI-Design. N2 - In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus on switchbox routing problems and provide integer programming formulations for routing in the knock-knee and in the Manhattan model. We give a brief sketch of cutting plane algorithms that we developed and implemented for these two models. We report on computational experiments using standard test instances. Our codes are able to determine optimum solutions in most cases, and in particular, we can show that some of the instances have no feasible solution if Manhattan routing is used instead of knock-knee routing. T3 - ZIB-Report - SC-94-02 Y1 - 1994 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-1328 ER - TY - GEN A1 - Grötschel, Martin A1 - Martin, Alexander A1 - Weismantel, Robert T1 - Optimum Path Packing on Wheels: The Noncrossing Case. N2 - We show that, given a wheel with nonnegative edge lengths and pairs of terminals located on the wheel's outer cycle such that no two terminal pairs cross, then a path packing, i.~e.,a collection of edge disjoint paths connecting the given terminal pairs, of minimum length can be found in strongly polynomial time. Moreover, we exhibit for this case a system of linear inequalities that provides a complete and nonredundant description of the path packing polytope, which is the convex hull of all incidence vectors of path packings and their supersets. T3 - ZIB-Report - SC-93-26 Y1 - 1993 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-1225 ER - TY - GEN A1 - Grötschel, Martin A1 - Martin, Alexander A1 - Weismantel, Robert T1 - Packing Steiner Trees: Polyhedral Investigations. N2 - Let $G=(V,E)$ be a graph and $T\subseteq V$ be a node set. We call an edge set $S$ a Steiner tree with respect to $T$ if $S$ connects all pairs of nodes in $T$. In this paper we address the following problem, which we call the weighted Steiner tree packing problem. Given a graph $G=(V,E)$ with edge weights $w_e$, edge capacities $c_e, e \in E,$ and node sets $T_1,\ldots,T_N$, find edge sets $S_1,\ldots,S_N$ such that each $S_k$ is a Steiner tree with respect to $T_k$, at most $c_e$ of these edge sets use edge $e$ for each $e\in E$, and such that the sum of the weights of the edge sets is minimal. Our motivation for studying this problem arises from the routing problem in VLSI-design, where given sets of points have to be connected by wires. We consider the Steiner tree packing Problem from a polyhedral point of view and define an appropriate polyhedron, called the Steiner tree packing polyhedron. The goal of this paper is to (partially) describe this polyhedron by means of inequalities. It turns out that, under mild assumptions, each inequality that defines a facet for the (single) Steiner tree polyhedron can be lifted to a facet-defining inequality for the Steiner tree packing polyhedron. The main emphasis of this paper lies on the presentation of so-called joint inequalities that are valid and facet-defining for this polyhedron. Inequalities of this kind involve at least two Steiner trees. The classes of inequalities we have found form the basis of a branch & cut algorithm. This algorithm is described in our companion paper SC 92-09. T3 - ZIB-Report - SC-92-08 KW - cutting planes KW - Facets KW - Packing KW - polyhedron KW - Steiner tree Y1 - 1992 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-786 ER -