Zobrazeno 1 - 10
of 141
pro vyhledávání: '"Christoph Dürr"'
Autor:
Anne-Kathrin Hechinger, Kristina Maas, Christoph Dürr, Franziska Leonhardt, Gabriele Prinz, Reinhard Marks, Ulrike Gerlach, Maike Hofmann, Paul Fisch, Jürgen Finke, Hanspeter Pircher, Robert Zeiser
Publikováno v:
Haematologica, Vol 98, Iss 1 (2013)
Despite advances in immunosuppressive regimens, acute graft-versus-host disease remains a frequent complication of allogeneic hematopoietic cell transplantation. Pathogenic donor T cells are dependent on correct attachment of small GTPases to the cel
Externí odkaz:
https://doaj.org/article/1d19d035cfb548f8896d3d5636ad5664
Autor:
Philipp R Esser, Ute Wölfle, Christoph Dürr, Friederike D von Loewenich, Christoph M Schempp, Marina A Freudenberg, Thilo Jakob, Stefan F Martin
Publikováno v:
PLoS ONE, Vol 7, Iss 7, p e41340 (2012)
BackgroundAllergic contact dermatitis (ACD) represents a severe health problem with increasing worldwide prevalence. It is a T cell-mediated skin disease induced by protein-reactive organic and inorganic chemicals. A key feature of contact allergens
Externí odkaz:
https://doaj.org/article/53c6188ca9cc4c91b69c3d445dad070e
Publikováno v:
Applied Mathematical Modelling
Applied Mathematical Modelling, 2022, 104, pp.701-720. ⟨10.1016/j.apm.2021.12.020⟩
Applied Mathematical Modelling, 2022, 104, pp.701-720. ⟨10.1016/j.apm.2021.12.020⟩
International audience; In this paper we study a single machine scheduling problem with the objective of minimizing the sum of completion times. Each of the given jobs is either short or long. However the processing times are initially hidden to the
Autor:
Astrid Zabel, Eva Lieberherr, Christoph Dürr, Jean-Laurent Pfund, Jürgen Blaser, Evelyn Coleman Brantschen, Claude Garcia, Mariana Melnykovych, Roope Kaaronen
Der «IDANE Wald+ Science-Policy Dialogue» ist eine erweiterte Diskussionsplattform zu internationalen waldpolitischen Themen mit spezifischen Beiträgen aus der Schweizer Wissenschaft. Im Dezember 2021 organisierte die Abteilung Wald des Bundesamts
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09fb06c754ca9efaab5ff6fdec8cf4f5
Autor:
Marek Chrobak, Łukasz Jeż, Nguyen Kim Thang, Martin Böhm, Pavel Veselý, Jiří Sgall, Christoph Dürr, Jaroslaw Byrka, Marcin Bienkowski, Lukáš Folwarczný
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2021, 861, pp.133-143. ⟨10.1016/j.tcs.2021.02.016⟩
Theoretical Computer Science, 2021, 861, pp.133-143. ⟨10.1016/j.tcs.2021.02.016⟩
Theoretical Computer Science, Elsevier, 2021, 861, pp.133--143. ⟨10.1016/j.tcs.2021.02.016⟩
Theoretical Computer Science, Elsevier, 2021, 861, pp.133-143. ⟨10.1016/j.tcs.2021.02.016⟩
Theoretical Computer Science, 2021, 861, pp.133-143. ⟨10.1016/j.tcs.2021.02.016⟩
Theoretical Computer Science, Elsevier, 2021, 861, pp.133--143. ⟨10.1016/j.tcs.2021.02.016⟩
In the Multi-Level Aggregation Problem ( MLAP ), requests for service arrive at the nodes of an edge-weighted rooted tree T . Each service is represented by a subtree X of T that contains its root. This subtree X serves all requests that are pending
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0186c04d6bcce26ca5e147e16ac11595
https://hal.archives-ouvertes.fr/hal-03377715
https://hal.archives-ouvertes.fr/hal-03377715
Publikováno v:
Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}
Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence, Jan 2021, Yokohama, Japan. pp.2148--2154, ⟨10.24963/ijcai.2020/297⟩
Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}, Jan 2021, Yokohama, Japan. pp.2148--2154, ⟨10.24963/ijcai.2020/297⟩
IJCAI
Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence, Jan 2021, Yokohama, Japan. pp.2148--2154, ⟨10.24963/ijcai.2020/297⟩
Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}, Jan 2021, Yokohama, Japan. pp.2148--2154, ⟨10.24963/ijcai.2020/297⟩
IJCAI
International audience; Many real-world problems can often be cast as the optimization of DR-submodular functions defined over a convex domain. These functions play an important role with applications in many areas of applied mathematics, such as mac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f79ae0b92a07fd5bf39670cf4c4ee991
https://hal.archives-ouvertes.fr/hal-02980471
https://hal.archives-ouvertes.fr/hal-02980471
Publikováno v:
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization, Springer Verlag, 2020, 40 (4), pp.974-1007. ⟨10.1007/s10878-020-00641-w⟩
43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)
43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Aug 2018, Liverpool, United Kingdom. pp.8:1--8:15, ⟨10.4230/LIPIcs.MFCS.2018.8⟩
Journal of Combinatorial Optimization, Springer Verlag, 2020, 40 (4), pp.974-1007. ⟨10.1007/s10878-020-00641-w⟩
43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)
43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Aug 2018, Liverpool, United Kingdom. pp.8:1--8:15, ⟨10.4230/LIPIcs.MFCS.2018.8⟩
International audience; We study the online maximum matching problem in a model in which the edges are associated with a known recourse parameter k. An online algorithm for this problem has to maintain a valid matching while edges of the underlying g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7573378eaed640339b978f3f52073b9a
https://hal.archives-ouvertes.fr/hal-02980298
https://hal.archives-ouvertes.fr/hal-02980298