---
_id: '11808'
abstract:
- lang: eng
text: In recent years, significant advances have been made in the design and analysis
of fully dynamic algorithms. However, these theoretical results have received
very little attention from the practical perspective. Few of the algorithms are
implemented and tested on real datasets, and their practical potential is far
from understood. Here, we present a quick reference guide to recent engineering
and theory results in the area of fully dynamic graph algorithms.
alternative_title:
- LIPIcs
article_number: '1'
article_processing_charge: No
arxiv: 1
author:
- first_name: Kathrin
full_name: Hanauer, Kathrin
last_name: Hanauer
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Christian
full_name: Schulz, Christian
last_name: Schulz
citation:
ama: 'Hanauer K, Henzinger M, Schulz C. Recent advances in fully dynamic graph algorithms.
In: 1st Symposium on Algorithmic Foundations of Dynamic Networks. Vol 221.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.SAND.2022.1'
apa: 'Hanauer, K., Henzinger, M., & Schulz, C. (2022). Recent advances in fully
dynamic graph algorithms. In 1st Symposium on Algorithmic Foundations of Dynamic
Networks (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.SAND.2022.1'
chicago: Hanauer, Kathrin, Monika Henzinger, and Christian Schulz. “Recent Advances
in Fully Dynamic Graph Algorithms.” In 1st Symposium on Algorithmic Foundations
of Dynamic Networks, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022. https://doi.org/10.4230/LIPIcs.SAND.2022.1.
ieee: K. Hanauer, M. Henzinger, and C. Schulz, “Recent advances in fully dynamic
graph algorithms,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks,
Virtual, 2022, vol. 221.
ista: 'Hanauer K, Henzinger M, Schulz C. 2022. Recent advances in fully dynamic
graph algorithms. 1st Symposium on Algorithmic Foundations of Dynamic Networks.
SAND: Symposium on Algorithmic Foundations of Dynamic Networks, LIPIcs, vol. 221,
1.'
mla: Hanauer, Kathrin, et al. “Recent Advances in Fully Dynamic Graph Algorithms.”
1st Symposium on Algorithmic Foundations of Dynamic Networks, vol. 221,
1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.SAND.2022.1.
short: K. Hanauer, M. Henzinger, C. Schulz, in:, 1st Symposium on Algorithmic Foundations
of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
conference:
end_date: 2022-03-30
location: Virtual
name: 'SAND: Symposium on Algorithmic Foundations of Dynamic Networks'
start_date: 2022-03-28
date_created: 2022-08-11T14:35:52Z
date_published: 2022-04-29T00:00:00Z
date_updated: 2024-11-06T08:23:49Z
day: '29'
doi: 10.4230/LIPIcs.SAND.2022.1
extern: '1'
external_id:
arxiv:
- '2102.11169'
intvolume: ' 221'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.SAND.2022.1
month: '04'
oa: 1
oa_version: Published Version
publication: 1st Symposium on Algorithmic Foundations of Dynamic Networks
publication_identifier:
eissn:
- 1868-8969
isbn:
- '9783959772242'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Recent advances in fully dynamic graph algorithms
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 221
year: '2022'
...
---
_id: '11812'
abstract:
- lang: eng
text: "This paper presents a comprehensive study of algorithms for maintaining the
number of all connected four-vertex subgraphs in a dynamic graph. Specifically,
our algorithms maintain the number of paths of length three in deterministic amortized
O(m^{1/2}) update time, and any other connected four-vertex subgraph which is
not a clique in deterministic amortized update time O(m^{2/3}). Queries can be
answered in constant time. We also study the query times for subgraphs containing
an arbitrary edge that is supplied only with the query as well as the case where
only subgraphs containing a vertex s that is fixed beforehand are considered.
For length-3 paths, paws, 4-cycles, and diamonds our bounds match or are not far
from (conditional) lower bounds: Based on the OMv conjecture we show that any
dynamic algorithm that detects the existence of paws, diamonds, or 4-cycles or
that counts length-3 paths takes update time Ω(m^{1/2-δ}).\r\nAdditionally, for
4-cliques and all connected induced subgraphs, we show a lower bound of Ω(m^{1-δ})
for any small constant δ > 0 for the amortized update time, assuming the static
combinatorial 4-clique conjecture holds. This shows that the O(m) algorithm by
Eppstein et al. [David Eppstein et al., 2012] for these subgraphs cannot be improved
by a polynomial factor."
alternative_title:
- LIPIcs
article_number: '18'
article_processing_charge: No
arxiv: 1
author:
- first_name: Kathrin
full_name: Hanauer, Kathrin
last_name: Hanauer
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Qi Cheng
full_name: Hua, Qi Cheng
last_name: Hua
citation:
ama: 'Hanauer K, Henzinger M, Hua QC. Fully dynamic four-vertex subgraph counting.
In: 1st Symposium on Algorithmic Foundations of Dynamic Networks. Vol 221.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.SAND.2022.18'
apa: 'Hanauer, K., Henzinger, M., & Hua, Q. C. (2022). Fully dynamic four-vertex
subgraph counting. In 1st Symposium on Algorithmic Foundations of Dynamic Networks
(Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.18'
chicago: Hanauer, Kathrin, Monika Henzinger, and Qi Cheng Hua. “Fully Dynamic Four-Vertex
Subgraph Counting.” In 1st Symposium on Algorithmic Foundations of Dynamic
Networks, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
https://doi.org/10.4230/LIPIcs.SAND.2022.18.
ieee: K. Hanauer, M. Henzinger, and Q. C. Hua, “Fully dynamic four-vertex subgraph
counting,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks,
Virtual, 2022, vol. 221.
ista: 'Hanauer K, Henzinger M, Hua QC. 2022. Fully dynamic four-vertex subgraph
counting. 1st Symposium on Algorithmic Foundations of Dynamic Networks. SAND:
Symposium on Algorithmic Foundations of Dynamic Networks, LIPIcs, vol. 221, 18.'
mla: Hanauer, Kathrin, et al. “Fully Dynamic Four-Vertex Subgraph Counting.” 1st
Symposium on Algorithmic Foundations of Dynamic Networks, vol. 221, 18, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.SAND.2022.18.
short: K. Hanauer, M. Henzinger, Q.C. Hua, in:, 1st Symposium on Algorithmic Foundations
of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
conference:
end_date: 2022-04-30
location: Virtual
name: 'SAND: Symposium on Algorithmic Foundations of Dynamic Networks'
start_date: 2022-04-28
date_created: 2022-08-12T06:57:55Z
date_published: 2022-04-29T00:00:00Z
date_updated: 2024-11-06T08:22:47Z
day: '29'
doi: 10.4230/LIPIcs.SAND.2022.18
extern: '1'
external_id:
arxiv:
- '2106.15524'
intvolume: ' 221'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.SAND.2022.18
month: '04'
oa: 1
oa_version: Published Version
publication: 1st Symposium on Algorithmic Foundations of Dynamic Networks
publication_identifier:
isbn:
- '9783959772242'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fully dynamic four-vertex subgraph counting
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 221
year: '2022'
...
---
_id: '11839'
abstract:
- lang: eng
text: "It is a highly desirable property for deep networks to be robust against\r\nsmall
input changes. One popular way to achieve this property is by designing\r\nnetworks
with a small Lipschitz constant. In this work, we propose a new\r\ntechnique for
constructing such Lipschitz networks that has a number of\r\ndesirable properties:
it can be applied to any linear network layer\r\n(fully-connected or convolutional),
it provides formal guarantees on the\r\nLipschitz constant, it is easy to implement
and efficient to run, and it can be\r\ncombined with any training objective and
optimization method. In fact, our\r\ntechnique is the first one in the literature
that achieves all of these\r\nproperties simultaneously. Our main contribution
is a rescaling-based weight\r\nmatrix parametrization that guarantees each network
layer to have a Lipschitz\r\nconstant of at most 1 and results in the learned
weight matrices to be close to\r\northogonal. Hence we call such layers almost-orthogonal
Lipschitz (AOL).\r\nExperiments and ablation studies in the context of image classification
with\r\ncertified robust accuracy confirm that AOL layers achieve results that
are on\r\npar with most existing methods. Yet, they are simpler to implement and
more\r\nbroadly applicable, because they do not require computationally expensive\r\nmatrix
orthogonalization or inversion steps as part of the network\r\narchitecture. We
provide code at https://github.com/berndprach/AOL."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Bernd
full_name: Prach, Bernd
id: 2D561D42-C427-11E9-89B4-9C1AE6697425
last_name: Prach
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Prach B, Lampert C. Almost-orthogonal layers for efficient general-purpose
Lipschitz networks. In: Computer Vision – ECCV 2022. Vol 13681. Springer
Nature; 2022:350-365. doi:10.1007/978-3-031-19803-8_21'
apa: 'Prach, B., & Lampert, C. (2022). Almost-orthogonal layers for efficient
general-purpose Lipschitz networks. In Computer Vision – ECCV 2022 (Vol.
13681, pp. 350–365). Tel Aviv, Israel: Springer Nature. https://doi.org/10.1007/978-3-031-19803-8_21'
chicago: Prach, Bernd, and Christoph Lampert. “Almost-Orthogonal Layers for Efficient
General-Purpose Lipschitz Networks.” In Computer Vision – ECCV 2022, 13681:350–65.
Springer Nature, 2022. https://doi.org/10.1007/978-3-031-19803-8_21.
ieee: B. Prach and C. Lampert, “Almost-orthogonal layers for efficient general-purpose
Lipschitz networks,” in Computer Vision – ECCV 2022, Tel Aviv, Israel,
2022, vol. 13681, pp. 350–365.
ista: 'Prach B, Lampert C. 2022. Almost-orthogonal layers for efficient general-purpose
Lipschitz networks. Computer Vision – ECCV 2022. ECCV: European Conference on
Computer Vision, LNCS, vol. 13681, 350–365.'
mla: Prach, Bernd, and Christoph Lampert. “Almost-Orthogonal Layers for Efficient
General-Purpose Lipschitz Networks.” Computer Vision – ECCV 2022, vol.
13681, Springer Nature, 2022, pp. 350–65, doi:10.1007/978-3-031-19803-8_21.
short: B. Prach, C. Lampert, in:, Computer Vision – ECCV 2022, Springer Nature,
2022, pp. 350–365.
conference:
end_date: 2022-10-27
location: Tel Aviv, Israel
name: 'ECCV: European Conference on Computer Vision'
start_date: 2022-10-23
corr_author: '1'
date_created: 2022-08-12T15:09:47Z
date_published: 2022-10-23T00:00:00Z
date_updated: 2026-04-07T11:49:51Z
day: '23'
department:
- _id: GradSch
- _id: ChLa
doi: 10.1007/978-3-031-19803-8_21
external_id:
arxiv:
- '2208.03160'
isi:
- '000904104000021'
intvolume: ' 13681'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2208.03160'
month: '10'
oa: 1
oa_version: Preprint
page: 350-365
publication: Computer Vision – ECCV 2022
publication_identifier:
eisbn:
- '9783031198038'
isbn:
- '9783031198021'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '19759'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Almost-orthogonal layers for efficient general-purpose Lipschitz networks
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 13681
year: '2022'
...
---
_id: '11841'
abstract:
- lang: eng
text: Primary nucleation is the fundamental event that initiates the conversion
of proteins from their normal physiological forms into pathological amyloid aggregates
associated with the onset and development of disorders including systemic amyloidosis,
as well as the neurodegenerative conditions Alzheimer’s and Parkinson’s diseases.
It has become apparent that the presence of surfaces can dramatically modulate
nucleation. However, the underlying physicochemical parameters governing this
process have been challenging to elucidate, with interfaces in some cases having
been found to accelerate aggregation, while in others they can inhibit the kinetics
of this process. Here we show through kinetic analysis that for three different
fibril-forming proteins, interfaces affect the aggregation reaction mainly through
modulating the primary nucleation step. Moreover, we show through direct measurements
of the Gibbs free energy of adsorption, combined with theory and coarse-grained
computer simulations, that overall nucleation rates are suppressed at high and
at low surface interaction strengths but significantly enhanced at intermediate
strengths, and we verify these regimes experimentally. Taken together, these results
provide a quantitative description of the fundamental process which triggers amyloid
formation and shed light on the key factors that control this process.
acknowledgement: "The research leading to these results has received funding from
the European Research Council (ERC) under the European Union’s Seventh Framework
Programme (FP7/2007-2013) through the ERC grant PhysProt\r\n(agreement 337969).
We are grateful for financial support from the Biotechnology and Biological Sciences
Research Council (BBSRC) (T.P.J.K.), the Newman\r\nFoundation (T.P.J.K.), the Wellcome
Trust (T.P.J.K. and M.V.), Peterhouse College\r\nCambridge (T.C.T.M.), the ERC Starting
Grant (StG) Non-Equilibrium Protein Assembly (NEPA) (A.S.), the Royal Society (A.S.),
the Academy of Medical Sciences\r\n(A.S. and J.K.), and the Cambridge Centre for
Misfolding Diseases (CMD)."
article_number: e2109718119
article_processing_charge: No
article_type: original
author:
- first_name: Zenon
full_name: Toprakcioglu, Zenon
last_name: Toprakcioglu
- first_name: Ayaka
full_name: Kamada, Ayaka
last_name: Kamada
- first_name: Thomas C.T.
full_name: Michaels, Thomas C.T.
last_name: Michaels
- first_name: Mengqi
full_name: Xie, Mengqi
last_name: Xie
- first_name: Johannes
full_name: Krausser, Johannes
last_name: Krausser
- first_name: Jiapeng
full_name: Wei, Jiapeng
last_name: Wei
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
- first_name: Michele
full_name: Vendruscolo, Michele
last_name: Vendruscolo
- first_name: Tuomas P.J.
full_name: Knowles, Tuomas P.J.
last_name: Knowles
citation:
ama: Toprakcioglu Z, Kamada A, Michaels TCT, et al. Adsorption free energy predicts
amyloid protein nucleation rates. Proceedings of the National Academy of Sciences
of the United States of America. 2022;119(31). doi:10.1073/pnas.2109718119
apa: Toprakcioglu, Z., Kamada, A., Michaels, T. C. T., Xie, M., Krausser, J., Wei,
J., … Knowles, T. P. J. (2022). Adsorption free energy predicts amyloid protein
nucleation rates. Proceedings of the National Academy of Sciences of the United
States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2109718119
chicago: Toprakcioglu, Zenon, Ayaka Kamada, Thomas C.T. Michaels, Mengqi Xie, Johannes
Krausser, Jiapeng Wei, Anđela Šarić, Michele Vendruscolo, and Tuomas P.J. Knowles.
“Adsorption Free Energy Predicts Amyloid Protein Nucleation Rates.” Proceedings
of the National Academy of Sciences of the United States of America. National
Academy of Sciences, 2022. https://doi.org/10.1073/pnas.2109718119.
ieee: Z. Toprakcioglu et al., “Adsorption free energy predicts amyloid protein
nucleation rates,” Proceedings of the National Academy of Sciences of the United
States of America, vol. 119, no. 31. National Academy of Sciences, 2022.
ista: Toprakcioglu Z, Kamada A, Michaels TCT, Xie M, Krausser J, Wei J, Šarić A,
Vendruscolo M, Knowles TPJ. 2022. Adsorption free energy predicts amyloid protein
nucleation rates. Proceedings of the National Academy of Sciences of the United
States of America. 119(31), e2109718119.
mla: Toprakcioglu, Zenon, et al. “Adsorption Free Energy Predicts Amyloid Protein
Nucleation Rates.” Proceedings of the National Academy of Sciences of the United
States of America, vol. 119, no. 31, e2109718119, National Academy of Sciences,
2022, doi:10.1073/pnas.2109718119.
short: Z. Toprakcioglu, A. Kamada, T.C.T. Michaels, M. Xie, J. Krausser, J. Wei,
A. Šarić, M. Vendruscolo, T.P.J. Knowles, Proceedings of the National Academy
of Sciences of the United States of America 119 (2022).
date_created: 2022-08-14T22:01:45Z
date_published: 2022-07-28T00:00:00Z
date_updated: 2025-06-12T06:21:34Z
day: '28'
ddc:
- '570'
department:
- _id: AnSa
doi: 10.1073/pnas.2109718119
ec_funded: 1
external_id:
isi:
- '000903753500002'
pmid:
- '35901206'
file:
- access_level: open_access
checksum: 0fe3878896cbeb6c44e29222ec2f336a
content_type: application/pdf
creator: dernst
date_created: 2023-10-04T09:05:44Z
date_updated: 2023-10-04T09:05:44Z
file_id: '14386'
file_name: 2022_PNAS_Toprakcioglu.pdf
file_size: 2476021
relation: main_file
success: 1
file_date_updated: 2023-10-04T09:05:44Z
has_accepted_license: '1'
intvolume: ' 119'
isi: 1
issue: '31'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: eba2549b-77a9-11ec-83b8-a81e493eae4e
call_identifier: H2020
grant_number: '802960'
name: 'Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines'
publication: Proceedings of the National Academy of Sciences of the United States
of America
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Adsorption free energy predicts amyloid protein nucleation rates
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 119
year: '2022'
...
---
_id: '11842'
abstract:
- lang: eng
text: We consider the flow of two viscous and incompressible fluids within a bounded
domain modeled by means of a two-phase Navier–Stokes system. The two fluids are
assumed to be immiscible, meaning that they are separated by an interface. With
respect to the motion of the interface, we consider pure transport by the fluid
flow. Along the boundary of the domain, a complete slip boundary condition for
the fluid velocities and a constant ninety degree contact angle condition for
the interface are assumed. In the present work, we devise for the resulting evolution
problem a suitable weak solution concept based on the framework of varifolds and
establish as the main result a weak-strong uniqueness principle in 2D. The proof
is based on a relative entropy argument and requires a non-trivial further development
of ideas from the recent work of Fischer and the first author (Arch. Ration. Mech.
Anal. 236, 2020) to incorporate the contact angle condition. To focus on the effects
of the necessarily singular geometry of the evolving fluid domains, we work for
simplicity in the regime of same viscosities for the two fluids.
acknowledgement: The authors warmly thank their former resp. current PhD advisor Julian
Fischer for the suggestion of this problem and for valuable initial discussions
on the subjects of this paper. This project has received funding from the European
Research Council (ERC) under the European Union’s Horizon 2020 research and innovation
programme (grant agreement No 948819) , and from the Deutsche Forschungsgemeinschaft
(DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1
– 390685813.
article_number: '93'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sebastian
full_name: Hensel, Sebastian
id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87
last_name: Hensel
orcid: 0000-0001-7252-8072
- first_name: Alice
full_name: Marveggio, Alice
id: 25647992-AA84-11E9-9D75-8427E6697425
last_name: Marveggio
citation:
ama: Hensel S, Marveggio A. Weak-strong uniqueness for the Navier–Stokes equation
for two fluids with ninety degree contact angle and same viscosities. Journal
of Mathematical Fluid Mechanics. 2022;24(3). doi:10.1007/s00021-022-00722-2
apa: Hensel, S., & Marveggio, A. (2022). Weak-strong uniqueness for the Navier–Stokes
equation for two fluids with ninety degree contact angle and same viscosities.
Journal of Mathematical Fluid Mechanics. Springer Nature. https://doi.org/10.1007/s00021-022-00722-2
chicago: Hensel, Sebastian, and Alice Marveggio. “Weak-Strong Uniqueness for the
Navier–Stokes Equation for Two Fluids with Ninety Degree Contact Angle and Same
Viscosities.” Journal of Mathematical Fluid Mechanics. Springer Nature,
2022. https://doi.org/10.1007/s00021-022-00722-2.
ieee: S. Hensel and A. Marveggio, “Weak-strong uniqueness for the Navier–Stokes
equation for two fluids with ninety degree contact angle and same viscosities,”
Journal of Mathematical Fluid Mechanics, vol. 24, no. 3. Springer Nature,
2022.
ista: Hensel S, Marveggio A. 2022. Weak-strong uniqueness for the Navier–Stokes
equation for two fluids with ninety degree contact angle and same viscosities.
Journal of Mathematical Fluid Mechanics. 24(3), 93.
mla: Hensel, Sebastian, and Alice Marveggio. “Weak-Strong Uniqueness for the Navier–Stokes
Equation for Two Fluids with Ninety Degree Contact Angle and Same Viscosities.”
Journal of Mathematical Fluid Mechanics, vol. 24, no. 3, 93, Springer Nature,
2022, doi:10.1007/s00021-022-00722-2.
short: S. Hensel, A. Marveggio, Journal of Mathematical Fluid Mechanics 24 (2022).
corr_author: '1'
date_created: 2022-08-14T22:01:45Z
date_published: 2022-08-01T00:00:00Z
date_updated: 2026-04-07T13:28:13Z
day: '01'
ddc:
- '510'
department:
- _id: JuFi
doi: 10.1007/s00021-022-00722-2
ec_funded: 1
external_id:
arxiv:
- '2112.11154'
isi:
- '000834834300001'
file:
- access_level: open_access
checksum: 75c5f286300e6f0539cf57b4dba108d5
content_type: application/pdf
creator: cchlebak
date_created: 2022-08-16T06:55:22Z
date_updated: 2022-08-16T06:55:22Z
file_id: '11848'
file_name: 2022_JMathFluidMech_Hensel.pdf
file_size: 2045570
relation: main_file
success: 1
file_date_updated: 2022-08-16T06:55:22Z
has_accepted_license: '1'
intvolume: ' 24'
isi: 1
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 0aa76401-070f-11eb-9043-b5bb049fa26d
call_identifier: H2020
grant_number: '948819'
name: Bridging Scales in Random Materials
publication: Journal of Mathematical Fluid Mechanics
publication_identifier:
eissn:
- 1422-6952
issn:
- 1422-6928
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '14587'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety
degree contact angle and same viscosities
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 24
year: '2022'
...
---
_id: '11843'
abstract:
- lang: eng
text: A key attribute of persistent or recurring bacterial infections is the ability
of the pathogen to evade the host’s immune response. Many Enterobacteriaceae express
type 1 pili, a pre-adapted virulence trait, to invade host epithelial cells and
establish persistent infections. However, the molecular mechanisms and strategies
by which bacteria actively circumvent the immune response of the host remain poorly
understood. Here, we identified CD14, the major co-receptor for lipopolysaccharide
detection, on mouse dendritic cells (DCs) as a binding partner of FimH, the protein
located at the tip of the type 1 pilus of Escherichia coli. The FimH amino acids
involved in CD14 binding are highly conserved across pathogenic and non-pathogenic
strains. Binding of the pathogenic strain CFT073 to CD14 reduced DC migration
by overactivation of integrins and blunted expression of co-stimulatory molecules
by overactivating the NFAT (nuclear factor of activated T-cells) pathway, both
rate-limiting factors of T cell activation. This response was binary at the single-cell
level, but averaged in larger populations exposed to both piliated and non-piliated
pathogens, presumably via the exchange of immunomodulatory cytokines. While defining
an active molecular mechanism of immune evasion by pathogens, the interaction
between FimH and CD14 represents a potential target to interfere with persistent
and recurrent infections, such as urinary tract infections or Crohn’s disease.
acknowledged_ssus:
- _id: Bio
- _id: PreCl
- _id: EM-Fac
acknowledgement: We thank Ulrich Dobrindt for providing UPEC strains CFT073, UTI89,
and 536, Frank Assen, Vlad Gavra, Maximilian Götz, Bor Kavčič, Jonna Alanko, and
Eva Kiermaier for help with experiments and Robert Hauschild, Julian Stopp, and
Saren Tasciyan for help with data analysis. We thank the IST Austria Scientific
Service Units, especially the Bioimaging facility, the Preclinical facility and
the Electron microscopy facility for technical support, Jakob Wallner and all members
of the Guet and Sixt lab for fruitful discussions and Daria Siekhaus for critically
reading the manuscript. This work was supported by grants from the Austrian Research
Promotion Agency (FEMtech 868984) to IG, the European Research Council (CoG 724373),
and the Austrian Science Fund (FWF P29911) to MS.
article_number: e78995
article_processing_charge: Yes
article_type: original
author:
- first_name: Kathrin
full_name: Tomasek, Kathrin
id: 3AEC8556-F248-11E8-B48F-1D18A9856A87
last_name: Tomasek
orcid: 0000-0003-3768-877X
- first_name: Alexander F
full_name: Leithner, Alexander F
id: 3B1B77E4-F248-11E8-B48F-1D18A9856A87
last_name: Leithner
orcid: 0000-0002-1073-744X
- first_name: Ivana
full_name: Glatzová, Ivana
id: 727b3c7d-4939-11ec-89b3-b9b0750ab74d
last_name: Glatzová
- first_name: Michael S.
full_name: Lukesch, Michael S.
last_name: Lukesch
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: Tomasek K, Leithner AF, Glatzová I, Lukesch MS, Guet CC, Sixt MK. Type 1 piliated
uropathogenic Escherichia coli hijack the host immune response by binding to CD14.
eLife. 2022;11. doi:10.7554/eLife.78995
apa: Tomasek, K., Leithner, A. F., Glatzová, I., Lukesch, M. S., Guet, C. C., &
Sixt, M. K. (2022). Type 1 piliated uropathogenic Escherichia coli hijack the
host immune response by binding to CD14. ELife. eLife Sciences Publications.
https://doi.org/10.7554/eLife.78995
chicago: Tomasek, Kathrin, Alexander F Leithner, Ivana Glatzová, Michael S. Lukesch,
Calin C Guet, and Michael K Sixt. “Type 1 Piliated Uropathogenic Escherichia Coli
Hijack the Host Immune Response by Binding to CD14.” ELife. eLife Sciences
Publications, 2022. https://doi.org/10.7554/eLife.78995.
ieee: K. Tomasek, A. F. Leithner, I. Glatzová, M. S. Lukesch, C. C. Guet, and M.
K. Sixt, “Type 1 piliated uropathogenic Escherichia coli hijack the host immune
response by binding to CD14,” eLife, vol. 11. eLife Sciences Publications,
2022.
ista: Tomasek K, Leithner AF, Glatzová I, Lukesch MS, Guet CC, Sixt MK. 2022. Type
1 piliated uropathogenic Escherichia coli hijack the host immune response by binding
to CD14. eLife. 11, e78995.
mla: Tomasek, Kathrin, et al. “Type 1 Piliated Uropathogenic Escherichia Coli Hijack
the Host Immune Response by Binding to CD14.” ELife, vol. 11, e78995, eLife
Sciences Publications, 2022, doi:10.7554/eLife.78995.
short: K. Tomasek, A.F. Leithner, I. Glatzová, M.S. Lukesch, C.C. Guet, M.K. Sixt,
ELife 11 (2022).
corr_author: '1'
date_created: 2022-08-14T22:01:46Z
date_published: 2022-07-26T00:00:00Z
date_updated: 2025-04-15T07:17:32Z
day: '26'
ddc:
- '570'
department:
- _id: MiSi
- _id: CaGu
doi: 10.7554/eLife.78995
ec_funded: 1
external_id:
isi:
- '000838410200001'
pmid:
- '35881547'
file:
- access_level: open_access
checksum: 002a3c7c7ea5caa9af9cfbea308f6ea4
content_type: application/pdf
creator: cchlebak
date_created: 2022-08-16T08:57:37Z
date_updated: 2022-08-16T08:57:37Z
file_id: '11861'
file_name: 2022_eLife_Tomasek.pdf
file_size: 2057577
relation: main_file
success: 1
file_date_updated: 2022-08-16T08:57:37Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 25FE9508-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '724373'
name: Cellular Navigation Along Spatial Gradients
- _id: 26018E70-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29911
name: Mechanical adaptation of lamellipodial actin
publication: eLife
publication_identifier:
eissn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
related_material:
record:
- id: '10316'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Type 1 piliated uropathogenic Escherichia coli hijack the host immune response
by binding to CD14
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2022'
...
---
_id: '11844'
abstract:
- lang: eng
text: "In the stochastic population protocol model, we are given a connected graph
with n nodes, and in every time step, a scheduler samples an edge of the graph
uniformly at random and the nodes connected by this edge interact. A fundamental
task in this model is stable leader election, in which all nodes start in an identical
state and the aim is to reach a configuration in which (1) exactly one node is
elected as leader and (2) this node remains as the unique leader no matter what
sequence of interactions follows. On cliques, the complexity of this problem has
recently been settled: time-optimal protocols stabilize in Θ(n log n) expected
steps using Θ(log log n) states, whereas protocols that use O(1) states require
Θ(n2) expected steps.\r\n\r\nIn this work, we investigate the complexity of stable
leader election on general graphs. We provide the first non-trivial time lower
bounds for leader election on general graphs, showing that, when moving beyond
cliques, the complexity landscape of leader election becomes very diverse: the
time required to elect a leader can range from O(1) to Θ(n3) expected steps. On
the upper bound side, we first observe that there exists a protocol that is time-optimal
on many graph families, but uses polynomially-many states. In contrast, we give
a near-time-optimal protocol that uses only O(log2n) states that is at most a
factor log n slower. Finally, we show that the constant-state protocol of Beauquier
et al. [OPODIS 2013] is at most a factor n log n slower than the fast polynomial-state
protocol. Moreover, among constant-state protocols, this protocol has near-optimal
average case complexity on dense random graphs."
acknowledgement: We thank the anonymous reviewers for their helpful comments. We gratefully
acknowledge funding from the European Research Council (ERC) under the European
Union’s Horizon 2020 research and innovation programme (grant agreement No 805223
ScaleML).
article_processing_charge: Yes (via OA deal)
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Joel
full_name: Rybicki, Joel
id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
last_name: Rybicki
orcid: 0000-0002-6432-6646
- first_name: Sasha
full_name: Voitovych, Sasha
last_name: Voitovych
citation:
ama: 'Alistarh D-A, Rybicki J, Voitovych S. Near-optimal leader election in population
protocols on graphs. In: Proceedings of the Annual ACM Symposium on Principles
of Distributed Computing. Association for Computing Machinery; 2022:246-256.
doi:10.1145/3519270.3538435'
apa: 'Alistarh, D.-A., Rybicki, J., & Voitovych, S. (2022). Near-optimal leader
election in population protocols on graphs. In Proceedings of the Annual ACM
Symposium on Principles of Distributed Computing (pp. 246–256). Salerno, Italy:
Association for Computing Machinery. https://doi.org/10.1145/3519270.3538435'
chicago: Alistarh, Dan-Adrian, Joel Rybicki, and Sasha Voitovych. “Near-Optimal
Leader Election in Population Protocols on Graphs.” In Proceedings of the Annual
ACM Symposium on Principles of Distributed Computing, 246–56. Association
for Computing Machinery, 2022. https://doi.org/10.1145/3519270.3538435.
ieee: D.-A. Alistarh, J. Rybicki, and S. Voitovych, “Near-optimal leader election
in population protocols on graphs,” in Proceedings of the Annual ACM Symposium
on Principles of Distributed Computing, Salerno, Italy, 2022, pp. 246–256.
ista: 'Alistarh D-A, Rybicki J, Voitovych S. 2022. Near-optimal leader election
in population protocols on graphs. Proceedings of the Annual ACM Symposium on
Principles of Distributed Computing. PODC: Symposium on Principles of Distributed
Computing, 246–256.'
mla: Alistarh, Dan-Adrian, et al. “Near-Optimal Leader Election in Population Protocols
on Graphs.” Proceedings of the Annual ACM Symposium on Principles of Distributed
Computing, Association for Computing Machinery, 2022, pp. 246–56, doi:10.1145/3519270.3538435.
short: D.-A. Alistarh, J. Rybicki, S. Voitovych, in:, Proceedings of the Annual
ACM Symposium on Principles of Distributed Computing, Association for Computing
Machinery, 2022, pp. 246–256.
conference:
end_date: 2022-07-29
location: Salerno, Italy
name: 'PODC: Symposium on Principles of Distributed Computing'
start_date: 2022-07-25
corr_author: '1'
date_created: 2022-08-14T22:01:46Z
date_published: 2022-07-21T00:00:00Z
date_updated: 2025-12-30T09:04:17Z
day: '21'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1145/3519270.3538435
ec_funded: 1
external_id:
arxiv:
- '2205.12597'
isi:
- '001031439100030'
file:
- access_level: open_access
checksum: 4c6b29172b8e355b4fbc364a2e0827b2
content_type: application/pdf
creator: cchlebak
date_created: 2022-08-16T08:05:15Z
date_updated: 2022-08-16T08:05:15Z
file_id: '11854'
file_name: 2022_PODC_Alistarh.pdf
file_size: 1593474
relation: main_file
success: 1
file_date_updated: 2022-08-16T08:05:15Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 246-256
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the Annual ACM Symposium on Principles of Distributed
Computing
publication_identifier:
isbn:
- '9781450392624'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '19969'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Near-optimal leader election in population protocols on graphs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2022'
...
---
_id: '11858'
abstract:
- lang: eng
text: "This paper is a continuation of Part I of this project, where we developed
a new local well-posedness theory for nonlinear stochastic PDEs with Gaussian
noise. In the current Part II we consider blow-up criteria and regularization
phenomena. As in Part I we can allow nonlinearities with polynomial growth and
rough initial values from critical spaces. In the first main result we obtain
several new blow-up criteria for quasi- and semilinear stochastic evolution equations.
In particular, for semilinear equations we obtain a Serrin type blow-up criterium,
which extends a recent result of Prüss–Simonett–Wilke (J Differ Equ 264(3):2028–2074,
2018) to the stochastic setting. Blow-up criteria can be used to prove global
well-posedness for SPDEs. As in Part I, maximal regularity techniques and weights
in time play a central role in the proofs. Our second contribution is a new method
to bootstrap Sobolev and Hölder regularity in time and space, which does not require
smoothness of the initial data. The blow-up criteria are at the basis of these
new methods. Moreover, in applications the bootstrap results can be combined with
our blow-up criteria, to obtain efficient ways to prove global existence. This
gives new results even in classical \U0001D43F2-settings, which we illustrate
for a concrete SPDE. In future works in preparation we apply the results of the
current paper to obtain global well-posedness results and regularity for several
concrete SPDEs. These include stochastic Navier–Stokes equations, reaction– diffusion
equations and the Allen–Cahn equation. Our setting allows to put these SPDEs into
a more flexible framework, where less restrictions on the nonlinearities are needed,
and we are able to treat rough initial values from critical spaces. Moreover,
we will obtain higher-order regularity results."
acknowledgement: "The authors thank Emiel Lorist for helpful comments. The authors
thank the anonymous referees for their helpful remarks to improve the presentation.\r\nOpen
access funding provided by Institute of Science and Technology (IST Austria)."
article_number: '56'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Antonio
full_name: Agresti, Antonio
id: 673cd0cc-9b9a-11eb-b144-88f30e1fbb72
last_name: Agresti
orcid: 0000-0002-9573-2962
- first_name: Mark
full_name: Veraar, Mark
last_name: Veraar
citation:
ama: Agresti A, Veraar M. Nonlinear parabolic stochastic evolution equations in
critical spaces part II. Journal of Evolution Equations. 2022;22(2). doi:10.1007/s00028-022-00786-7
apa: Agresti, A., & Veraar, M. (2022). Nonlinear parabolic stochastic evolution
equations in critical spaces part II. Journal of Evolution Equations. Springer
Nature. https://doi.org/10.1007/s00028-022-00786-7
chicago: Agresti, Antonio, and Mark Veraar. “Nonlinear Parabolic Stochastic Evolution
Equations in Critical Spaces Part II.” Journal of Evolution Equations.
Springer Nature, 2022. https://doi.org/10.1007/s00028-022-00786-7.
ieee: A. Agresti and M. Veraar, “Nonlinear parabolic stochastic evolution equations
in critical spaces part II,” Journal of Evolution Equations, vol. 22, no.
2. Springer Nature, 2022.
ista: Agresti A, Veraar M. 2022. Nonlinear parabolic stochastic evolution equations
in critical spaces part II. Journal of Evolution Equations. 22(2), 56.
mla: Agresti, Antonio, and Mark Veraar. “Nonlinear Parabolic Stochastic Evolution
Equations in Critical Spaces Part II.” Journal of Evolution Equations,
vol. 22, no. 2, 56, Springer Nature, 2022, doi:10.1007/s00028-022-00786-7.
short: A. Agresti, M. Veraar, Journal of Evolution Equations 22 (2022).
corr_author: '1'
date_created: 2022-08-16T08:39:43Z
date_published: 2022-06-01T00:00:00Z
date_updated: 2024-10-09T21:03:06Z
day: '01'
ddc:
- '510'
department:
- _id: JuFi
doi: 10.1007/s00028-022-00786-7
external_id:
isi:
- '000809108500001'
file:
- access_level: open_access
checksum: 59b99d1b48b6bd40983e7ce298524a21
content_type: application/pdf
creator: kschuh
date_created: 2022-08-16T08:52:46Z
date_updated: 2022-08-16T08:52:46Z
file_id: '11862'
file_name: 2022_Journal of Evolution Equations_Agresti.pdf
file_size: 1758371
relation: main_file
success: 1
file_date_updated: 2022-08-16T08:52:46Z
has_accepted_license: '1'
intvolume: ' 22'
isi: 1
issue: '2'
keyword:
- Mathematics (miscellaneous)
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Journal of Evolution Equations
publication_identifier:
eissn:
- 1424-3202
issn:
- 1424-3199
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nonlinear parabolic stochastic evolution equations in critical spaces part
II
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 22
year: '2022'
...
---
_id: '11916'
abstract:
- lang: eng
text: A domain is called Kac regular for a quadratic form on L2 if every functions
vanishing almost everywhere outside the domain can be approximated in form norm
by functions with compact support in the domain. It is shown that this notion
is stable under domination of quadratic forms. As applications measure perturbations
of quasi-regular Dirichlet forms, Cheeger energies on metric measure spaces and
Schrödinger operators on manifolds are studied. Along the way a characterization
of the Sobolev space with Dirichlet boundary conditions on domains in infinitesimally
Riemannian metric measure spaces is obtained.
acknowledgement: "The author was supported by the German Academic Scholarship Foundation
(Studienstiftung des deutschen Volkes) and by the German Research Foundation (DFG)
via RTG 1523/2. The author would like to thank Daniel Lenz for his support and encouragement
during the author’s ongoing graduate studies and him as well as Marcel Schmidt for
fruitful discussions on domination of quadratic forms. He wants to thank Batu Güneysu
and Peter Stollmann for valuable comments on a preliminary version of this article.
He would also like to thank the organizers of the conference Analysis and Geometry
on Graphs and Manifolds in Potsdam, where the initial motivation of this article
was conceived, and the organizers of the intense activity period Metric Measure
Spaces and Ricci Curvature at MPIM in Bonn, where this work was finished.\r\nOpen
access funding provided by Institute of Science and Technology (IST Austria)."
article_number: '38'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Melchior
full_name: Wirth, Melchior
id: 88644358-0A0E-11EA-8FA5-49A33DDC885E
last_name: Wirth
orcid: 0000-0002-0519-4241
citation:
ama: Wirth M. Kac regularity and domination of quadratic forms. Advances in Operator
Theory. 2022;7(3). doi:10.1007/s43036-022-00199-w
apa: Wirth, M. (2022). Kac regularity and domination of quadratic forms. Advances
in Operator Theory. Springer Nature. https://doi.org/10.1007/s43036-022-00199-w
chicago: Wirth, Melchior. “Kac Regularity and Domination of Quadratic Forms.” Advances
in Operator Theory. Springer Nature, 2022. https://doi.org/10.1007/s43036-022-00199-w.
ieee: M. Wirth, “Kac regularity and domination of quadratic forms,” Advances
in Operator Theory, vol. 7, no. 3. Springer Nature, 2022.
ista: Wirth M. 2022. Kac regularity and domination of quadratic forms. Advances
in Operator Theory. 7(3), 38.
mla: Wirth, Melchior. “Kac Regularity and Domination of Quadratic Forms.” Advances
in Operator Theory, vol. 7, no. 3, 38, Springer Nature, 2022, doi:10.1007/s43036-022-00199-w.
short: M. Wirth, Advances in Operator Theory 7 (2022).
corr_author: '1'
date_created: 2022-08-18T07:22:24Z
date_published: 2022-07-01T00:00:00Z
date_updated: 2024-10-09T21:03:07Z
day: '01'
ddc:
- '510'
department:
- _id: JaMa
doi: 10.1007/s43036-022-00199-w
file:
- access_level: open_access
checksum: 913474844a1b38264fb710746d5e2e98
content_type: application/pdf
creator: dernst
date_created: 2022-08-18T08:02:34Z
date_updated: 2022-08-18T08:02:34Z
file_id: '11921'
file_name: 2022_AdvancesOperatorTheory_Wirth.pdf
file_size: 389060
relation: main_file
success: 1
file_date_updated: 2022-08-18T08:02:34Z
has_accepted_license: '1'
intvolume: ' 7'
issue: '3'
keyword:
- Algebra and Number Theory
- Analysis
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Advances in Operator Theory
publication_identifier:
eissn:
- 2538-225X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Kac regularity and domination of quadratic forms
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2022'
...
---
_id: '11917'
abstract:
- lang: eng
text: We study the many-body dynamics of an initially factorized bosonic wave function
in the mean-field regime. We prove large deviation estimates for the fluctuations
around the condensate. We derive an upper bound extending a recent result to more
general interactions. Furthermore, we derive a new lower bound which agrees with
the upper bound in leading order.
acknowledgement: "The authors thank Gérard Ben Arous for pointing out the question
of a lower bound. Funding from the European Union’s Horizon 2020 research and innovation
programme under the ERC Grant Agreement No. 694227 (R.S.) and under the Marie Skłodowska-Curie
Grant Agreement No. 754411 (S.R.) is gratefully acknowledged.\r\nOpen access funding
provided by IST Austria."
article_number: '9'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Simone Anna Elvira
full_name: Rademacher, Simone Anna Elvira
id: 856966FE-A408-11E9-977E-802DE6697425
last_name: Rademacher
orcid: 0000-0001-5059-4466
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Rademacher SAE, Seiringer R. Large deviation estimates for weakly interacting
bosons. Journal of Statistical Physics. 2022;188. doi:10.1007/s10955-022-02940-4
apa: Rademacher, S. A. E., & Seiringer, R. (2022). Large deviation estimates
for weakly interacting bosons. Journal of Statistical Physics. Springer
Nature. https://doi.org/10.1007/s10955-022-02940-4
chicago: Rademacher, Simone Anna Elvira, and Robert Seiringer. “Large Deviation
Estimates for Weakly Interacting Bosons.” Journal of Statistical Physics.
Springer Nature, 2022. https://doi.org/10.1007/s10955-022-02940-4.
ieee: S. A. E. Rademacher and R. Seiringer, “Large deviation estimates for weakly
interacting bosons,” Journal of Statistical Physics, vol. 188. Springer
Nature, 2022.
ista: Rademacher SAE, Seiringer R. 2022. Large deviation estimates for weakly interacting
bosons. Journal of Statistical Physics. 188, 9.
mla: Rademacher, Simone Anna Elvira, and Robert Seiringer. “Large Deviation Estimates
for Weakly Interacting Bosons.” Journal of Statistical Physics, vol. 188,
9, Springer Nature, 2022, doi:10.1007/s10955-022-02940-4.
short: S.A.E. Rademacher, R. Seiringer, Journal of Statistical Physics 188 (2022).
corr_author: '1'
date_created: 2022-08-18T07:23:26Z
date_published: 2022-07-01T00:00:00Z
date_updated: 2025-04-14T07:26:59Z
day: '01'
ddc:
- '510'
department:
- _id: RoSe
doi: 10.1007/s10955-022-02940-4
ec_funded: 1
external_id:
isi:
- '000805175000001'
file:
- access_level: open_access
checksum: 44418cb44f07fa21ed3907f85abf7f39
content_type: application/pdf
creator: dernst
date_created: 2022-08-18T08:09:00Z
date_updated: 2022-08-18T08:09:00Z
file_id: '11922'
file_name: 2022_JournalStatisticalPhysics_Rademacher.pdf
file_size: 483481
relation: main_file
success: 1
file_date_updated: 2022-08-18T08:09:00Z
has_accepted_license: '1'
intvolume: ' 188'
isi: 1
keyword:
- Mathematical Physics
- Statistical and Nonlinear Physics
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Journal of Statistical Physics
publication_identifier:
eissn:
- 1572-9613
issn:
- 0022-4715
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Large deviation estimates for weakly interacting bosons
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 188
year: '2022'
...
---
_id: '11918'
abstract:
- lang: eng
text: "Statistics of small subgraph counts such as triangles, four-cycles, and s-t
paths of short lengths reveal important structural properties of the underlying
graph. These problems have been widely studied in social network analysis. In
most relevant applications, the graphs are not only massive but also change dynamically
over time. Most of these problems become hard in the dynamic setting when considering
the worst case. In this paper, we ask whether the question of small subgraph counting
over dynamic graphs is hard also in the average case.\r\n\r\nWe consider the simplest
possible average case model where the updates follow an Erdős-Rényi graph: each
update selects a pair of vertices (u, v) uniformly at random and flips the existence
of the edge (u, v). We develop new lower bounds and matching algorithms in this
model for counting four-cycles, counting triangles through a specified point s,
or a random queried point, and st paths of length 3, 4 and 5. Our results indicate
while computing st paths of length 3, and 4 are easy in the average case with
O(1) update time (note that they are hard in the worst case), it becomes hard
when considering st paths of length 5.\r\n\r\nWe introduce new techniques which
allow us to get average-case hardness for these graph problems from the worst-case
hardness of the Online Matrix vector problem (OMv). Our techniques rely on recent
advances in fine-grained average-case complexity. Our techniques advance this
literature, giving the ability to prove new lower bounds on average-case dynamic
algorithms."
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Andrea
full_name: Lincoln, Andrea
last_name: Lincoln
- first_name: Barna
full_name: Saha, Barna
last_name: Saha
citation:
ama: 'Henzinger M, Lincoln A, Saha B. The complexity of average-case dynamic subgraph
counting. In: 33rd Annual ACM-SIAM Symposium on Discrete Algorithms. Society
for Industrial and Applied Mathematics; 2022:459-498. doi:10.1137/1.9781611977073.23'
apa: 'Henzinger, M., Lincoln, A., & Saha, B. (2022). The complexity of average-case
dynamic subgraph counting. In 33rd Annual ACM-SIAM Symposium on Discrete Algorithms
(pp. 459–498). Alexandria, VA, United States: Society for Industrial and Applied
Mathematics. https://doi.org/10.1137/1.9781611977073.23'
chicago: Henzinger, Monika, Andrea Lincoln, and Barna Saha. “The Complexity of Average-Case
Dynamic Subgraph Counting.” In 33rd Annual ACM-SIAM Symposium on Discrete Algorithms,
459–98. Society for Industrial and Applied Mathematics, 2022. https://doi.org/10.1137/1.9781611977073.23.
ieee: M. Henzinger, A. Lincoln, and B. Saha, “The complexity of average-case dynamic
subgraph counting,” in 33rd Annual ACM-SIAM Symposium on Discrete Algorithms,
Alexandria, VA, United States, 2022, pp. 459–498.
ista: 'Henzinger M, Lincoln A, Saha B. 2022. The complexity of average-case dynamic
subgraph counting. 33rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA:
Symposium on Discrete Algorithms, 459–498.'
mla: Henzinger, Monika, et al. “The Complexity of Average-Case Dynamic Subgraph
Counting.” 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, Society
for Industrial and Applied Mathematics, 2022, pp. 459–98, doi:10.1137/1.9781611977073.23.
short: M. Henzinger, A. Lincoln, B. Saha, in:, 33rd Annual ACM-SIAM Symposium on
Discrete Algorithms, Society for Industrial and Applied Mathematics, 2022, pp.
459–498.
conference:
end_date: 2022-01-12
location: Alexandria, VA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2022-01-09
date_created: 2022-08-18T07:26:19Z
date_published: 2022-01-01T00:00:00Z
date_updated: 2024-11-06T12:25:50Z
day: '01'
doi: 10.1137/1.9781611977073.23
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 459-498
publication: 33rd Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- 978-1-61197-707-3
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: The complexity of average-case dynamic subgraph counting
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '11930'
abstract:
- lang: eng
text: We present a practically efficient algorithm for maintaining a global minimum
cut in large dynamic graphs under both edge insertions and deletions. While there
has been theoretical work on this problem, our algorithm is the first implementation
of a fully-dynamic algorithm. The algorithm uses the theoretical foundation and
combines it with efficient and finely-tuned implementations to give an algorithm
that can maintain the global minimum cut of a graph with rapid update times. We
show that our algorithm gives up to multiple orders of magnitude speedup compared
to static approaches both on edge insertions and deletions.
article_processing_charge: No
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Noe, Alexander
last_name: Noe
- first_name: Christian
full_name: Schulz, Christian
last_name: Schulz
citation:
ama: 'Henzinger M, Noe A, Schulz C. Practical fully dynamic minimum cut algorithms.
In: 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments.
Society for Industrial and Applied Mathematics; 2022:13-26. doi:10.1137/1.9781611977042.2'
apa: 'Henzinger, M., Noe, A., & Schulz, C. (2022). Practical fully dynamic minimum
cut algorithms. In 2022 Proceedings of the Symposium on Algorithm Engineering
and Experiments (pp. 13–26). Alexandria, VA, United States: Society for Industrial
and Applied Mathematics. https://doi.org/10.1137/1.9781611977042.2'
chicago: Henzinger, Monika, Alexander Noe, and Christian Schulz. “Practical Fully
Dynamic Minimum Cut Algorithms.” In 2022 Proceedings of the Symposium on Algorithm
Engineering and Experiments, 13–26. Society for Industrial and Applied Mathematics,
2022. https://doi.org/10.1137/1.9781611977042.2.
ieee: M. Henzinger, A. Noe, and C. Schulz, “Practical fully dynamic minimum cut
algorithms,” in 2022 Proceedings of the Symposium on Algorithm Engineering
and Experiments, Alexandria, VA, United States, 2022, pp. 13–26.
ista: 'Henzinger M, Noe A, Schulz C. 2022. Practical fully dynamic minimum cut algorithms.
2022 Proceedings of the Symposium on Algorithm Engineering and Experiments. ALENEX:
Symposium on Algorithm Engineering and Experiments, 13–26.'
mla: Henzinger, Monika, et al. “Practical Fully Dynamic Minimum Cut Algorithms.”
2022 Proceedings of the Symposium on Algorithm Engineering and Experiments,
Society for Industrial and Applied Mathematics, 2022, pp. 13–26, doi:10.1137/1.9781611977042.2.
short: M. Henzinger, A. Noe, C. Schulz, in:, 2022 Proceedings of the Symposium on
Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics,
2022, pp. 13–26.
conference:
end_date: 2022-01-10
location: Alexandria, VA, United States
name: 'ALENEX: Symposium on Algorithm Engineering and Experiments'
start_date: 2022-01-09
date_created: 2022-08-19T07:27:51Z
date_published: 2022-01-01T00:00:00Z
date_updated: 2024-11-06T12:26:51Z
day: '01'
doi: 10.1137/1.9781611977042.2
extern: '1'
external_id:
arxiv:
- '2101.05033'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2101.05033
month: '01'
oa: 1
oa_version: Preprint
page: 13-26
publication: 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments
publication_identifier:
eisbn:
- 978-1-61197-704-2
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Practical fully dynamic minimum cut algorithms
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '11937'
abstract:
- lang: eng
text: Most experimentally known high-pressure ice phases have a body-centred cubic
(bcc) oxygen lattice. Our large-scale molecular-dynamics simulations with a machine-learning
potential indicate that, amongst these bcc ice phases, ices VII, VII′ and X are
the same thermodynamic phase under different conditions, whereas superionic ice
VII″ has a first-order phase boundary with ice VII′. Moreover, at about 300 GPa,
the transformation between ice X and the Pbcm phase has a sharp structural change
but no apparent activation barrier, whilst at higher pressures the barrier gradually
increases. Our study thus clarifies the phase behaviour of the high-pressure ices
and reveals peculiar solid–solid transition mechanisms not known in other systems.
acknowledgement: We thank Chris Pickard for providing the initial structures of high-pressure
ice phases and for useful advice. A.R. and B.C. acknowledge resources provided by
the Cambridge Tier-2 system operated by the University of Cambridge Research Computing
Service funded by EPSRC Tier-2 capital grant EP/P020259/1. M.B. was supported by
the European Union within the Marie Skłodowska-Curie actions (xICE grant 894725)
and acknowledges computational resources at North-German Supercomputing Alliance
(HLRN) facilities. S.H. and M.M. acknowledge support from LDRD 19-ERD-031 and computing
support from the Lawrence Livermore National Laboratory (LLNL) Institutional Computing
Grand Challenge programme. F.C. acknowledges support from the US DOE Office of Science,
Office of Fusion Energy Sciences. Lawrence Livermore National Laboratory is operated
by Lawrence Livermore National Security, LLC, for the U.S. Department of Energy,
National Nuclear Security Administration under Contract DE-AC52-07NA27344.
article_number: '4707'
article_processing_charge: No
article_type: original
author:
- first_name: Aleks
full_name: Reinhardt, Aleks
last_name: Reinhardt
- first_name: Mandy
full_name: Bethkenhagen, Mandy
last_name: Bethkenhagen
- first_name: Federica
full_name: Coppari, Federica
last_name: Coppari
- first_name: Marius
full_name: Millot, Marius
last_name: Millot
- first_name: Sebastien
full_name: Hamel, Sebastien
last_name: Hamel
- first_name: Bingqing
full_name: Cheng, Bingqing
id: cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9
last_name: Cheng
orcid: 0000-0002-3584-9632
citation:
ama: Reinhardt A, Bethkenhagen M, Coppari F, Millot M, Hamel S, Cheng B. Thermodynamics
of high-pressure ice phases explored with atomistic simulations. Nature Communications.
2022;13. doi:10.1038/s41467-022-32374-1
apa: Reinhardt, A., Bethkenhagen, M., Coppari, F., Millot, M., Hamel, S., &
Cheng, B. (2022). Thermodynamics of high-pressure ice phases explored with atomistic
simulations. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-022-32374-1
chicago: Reinhardt, Aleks, Mandy Bethkenhagen, Federica Coppari, Marius Millot,
Sebastien Hamel, and Bingqing Cheng. “Thermodynamics of High-Pressure Ice Phases
Explored with Atomistic Simulations.” Nature Communications. Springer Nature,
2022. https://doi.org/10.1038/s41467-022-32374-1.
ieee: A. Reinhardt, M. Bethkenhagen, F. Coppari, M. Millot, S. Hamel, and B. Cheng,
“Thermodynamics of high-pressure ice phases explored with atomistic simulations,”
Nature Communications, vol. 13. Springer Nature, 2022.
ista: Reinhardt A, Bethkenhagen M, Coppari F, Millot M, Hamel S, Cheng B. 2022.
Thermodynamics of high-pressure ice phases explored with atomistic simulations.
Nature Communications. 13, 4707.
mla: Reinhardt, Aleks, et al. “Thermodynamics of High-Pressure Ice Phases Explored
with Atomistic Simulations.” Nature Communications, vol. 13, 4707, Springer
Nature, 2022, doi:10.1038/s41467-022-32374-1.
short: A. Reinhardt, M. Bethkenhagen, F. Coppari, M. Millot, S. Hamel, B. Cheng,
Nature Communications 13 (2022).
corr_author: '1'
date_created: 2022-08-21T22:01:55Z
date_published: 2022-08-10T00:00:00Z
date_updated: 2024-10-09T21:03:16Z
day: '10'
ddc:
- '540'
department:
- _id: BiCh
doi: 10.1038/s41467-022-32374-1
external_id:
isi:
- '000838655300022'
pmid:
- '35948550'
file:
- access_level: open_access
checksum: 8ff9b689cde59fd3a9959a9f01929dea
content_type: application/pdf
creator: dernst
date_created: 2022-08-22T06:33:02Z
date_updated: 2022-08-22T06:33:02Z
file_id: '11939'
file_name: 2022_NatureCommunications_Reinhardt.pdf
file_size: 1767206
relation: main_file
success: 1
file_date_updated: 2022-08-22T06:33:02Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
publication: Nature Communications
publication_identifier:
eissn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Thermodynamics of high-pressure ice phases explored with atomistic simulations
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13
year: '2022'
...
---
_id: '11938'
abstract:
- lang: eng
text: A matching is compatible to two or more labeled point sets of size n with
labels {1, . . . , n} if its straight-line drawing on each of these point sets
is crossing-free. We study the maximum number of edges in a matching compatible
to two or more labeled point sets in general position in the plane. We show that
for any two labeled sets of n points in convex position there exists a compatible
matching with ⌊√2n + 1 − 1⌋ edges. More generally, for any ℓ labeled point sets
we construct compatible matchings of size Ω(n1/ℓ). As a corresponding upper bound,
we use probabilistic arguments to show that for any ℓ given sets of n points there
exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1))
edges. Finally, we show that Θ(log n) copies of any set of n points are necessary
and sufficient for the existence of labelings of these point sets such that any
compatible matching consists only of a single edge.
acknowledgement: 'A.A. funded by the Marie Sklodowska-Curie grant agreement No 754411.
Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant
no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative
DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported
by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by
ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23
(RiSE).'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Oswin
full_name: Aichholzer, Oswin
last_name: Aichholzer
- first_name: Alan M
full_name: Arroyo Guevara, Alan M
id: 3207FDC6-F248-11E8-B48F-1D18A9856A87
last_name: Arroyo Guevara
orcid: 0000-0003-2401-8670
- first_name: Zuzana
full_name: Masárová, Zuzana
id: 45CFE238-F248-11E8-B48F-1D18A9856A87
last_name: Masárová
orcid: 0000-0002-6660-1322
- first_name: Irene
full_name: Parada, Irene
last_name: Parada
- first_name: Daniel
full_name: Perz, Daniel
last_name: Perz
- first_name: Alexander
full_name: Pilz, Alexander
last_name: Pilz
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Birgit
full_name: Vogtenhuber, Birgit
last_name: Vogtenhuber
citation:
ama: Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings.
Journal of Graph Algorithms and Applications. 2022;26(2):225-240. doi:10.7155/jgaa.00591
apa: Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D.,
Pilz, A., … Vogtenhuber, B. (2022). On compatible matchings. Journal of Graph
Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00591
chicago: Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada,
Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible
Matchings.” Journal of Graph Algorithms and Applications. Brown University,
2022. https://doi.org/10.7155/jgaa.00591.
ieee: O. Aichholzer et al., “On compatible matchings,” Journal of Graph
Algorithms and Applications, vol. 26, no. 2. Brown University, pp. 225–240,
2022.
ista: Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec
J, Vogtenhuber B. 2022. On compatible matchings. Journal of Graph Algorithms and
Applications. 26(2), 225–240.
mla: Aichholzer, Oswin, et al. “On Compatible Matchings.” Journal of Graph Algorithms
and Applications, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:10.7155/jgaa.00591.
short: O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz,
J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022)
225–240.
corr_author: '1'
date_created: 2022-08-21T22:01:56Z
date_published: 2022-06-01T00:00:00Z
date_updated: 2026-04-16T09:18:20Z
day: '01'
ddc:
- '000'
department:
- _id: UlWa
- _id: HeEd
- _id: KrCh
doi: 10.7155/jgaa.00591
ec_funded: 1
external_id:
arxiv:
- '2101.03928'
file:
- access_level: open_access
checksum: dc6e255e3558faff924fd9e370886c11
content_type: application/pdf
creator: dernst
date_created: 2022-08-22T06:42:42Z
date_updated: 2022-08-22T06:42:42Z
file_id: '11940'
file_name: 2022_JourGraphAlgorithmsApplic_Aichholzer.pdf
file_size: 694538
relation: main_file
success: 1
file_date_updated: 2022-08-22T06:42:42Z
has_accepted_license: '1'
intvolume: ' 26'
issue: '2'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 225-240
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Journal of Graph Algorithms and Applications
publication_identifier:
issn:
- 1526-1719
publication_status: published
publisher: Brown University
quality_controlled: '1'
related_material:
record:
- id: '9296'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: On compatible matchings
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 26
year: '2022'
...
---
OA_place: publisher
_id: '11945'
abstract:
- lang: eng
text: "G protein-coupled receptors (GPCRs) respond to specific ligands and regulate
multiple processes ranging from cell growth and immune responses to neuronal signal
transmission. However, ligands for many GPCRs remain unknown, suffer from off-target
effects or have poor bioavailability. Additional challenges exist to dissect cell-type
specific responses when the same GPCR is expressed on several cell types within
the body. Here, we overcome these limitations by engineering DREADD-based GPCR
chimeras that selectively bind their agonist clozapine-N-oxide (CNO) and mimic
a GPCR-of-interest in a desired cell type.\r\nWe validated our approach with β2-adrenergic
receptor (β2AR/ADRB2) and show that our chimeric DREADD-β2AR triggers comparable
responses on second messenger and kinase activity, post-translational modifications,
and protein-protein interactions. Since β2AR is also enriched in microglia, which
can drive inflammation in the central nervous system, we expressed chimeric DREADD-β2AR
in primary microglia and successfully recapitulate β2AR-mediated filopodia formation
through CNO stimulation. To dissect the role of selected GPCRs during microglial
inflammation, we additionally generated DREADD-based chimeras for microglia-enriched
GPR65 and GPR109A/HCAR2. In a microglia cell line, DREADD-β2AR and DREADD-GPR65
both modulated the inflammatory response with a similar profile as endogenously
expressed β2AR, while DREADD-GPR109A showed no impact.\r\nOur DREADD-based approach
provides the means to obtain mechanistic and functional insights into GPCR signaling
on a cell-type specific level."
acknowledged_ssus:
- _id: Bio
- _id: PreCl
- _id: LifeSc
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Rouven
full_name: Schulz, Rouven
id: 4C5E7B96-F248-11E8-B48F-1D18A9856A87
last_name: Schulz
orcid: 0000-0001-5297-733X
citation:
ama: Schulz R. Chimeric G protein-coupled receptors mimic distinct signaling pathways
and modulate microglia function. 2022. doi:10.15479/at:ista:11945
apa: Schulz, R. (2022). Chimeric G protein-coupled receptors mimic distinct signaling
pathways and modulate microglia function. Institute of Science and Technology
Austria. https://doi.org/10.15479/at:ista:11945
chicago: Schulz, Rouven. “Chimeric G Protein-Coupled Receptors Mimic Distinct Signaling
Pathways and Modulate Microglia Function.” Institute of Science and Technology
Austria, 2022. https://doi.org/10.15479/at:ista:11945.
ieee: R. Schulz, “Chimeric G protein-coupled receptors mimic distinct signaling
pathways and modulate microglia function,” Institute of Science and Technology
Austria, 2022.
ista: Schulz R. 2022. Chimeric G protein-coupled receptors mimic distinct signaling
pathways and modulate microglia function. Institute of Science and Technology
Austria.
mla: Schulz, Rouven. Chimeric G Protein-Coupled Receptors Mimic Distinct Signaling
Pathways and Modulate Microglia Function. Institute of Science and Technology
Austria, 2022, doi:10.15479/at:ista:11945.
short: R. Schulz, Chimeric G Protein-Coupled Receptors Mimic Distinct Signaling
Pathways and Modulate Microglia Function, Institute of Science and Technology
Austria, 2022.
corr_author: '1'
date_created: 2022-08-23T11:33:11Z
date_published: 2022-08-23T00:00:00Z
date_updated: 2026-04-07T14:17:59Z
day: '23'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: GradSch
- _id: SaSi
doi: 10.15479/at:ista:11945
file:
- access_level: open_access
checksum: 61b1b666a210ff7cdd0e95ea75207a13
content_type: application/pdf
creator: rschulz
date_created: 2022-08-25T08:59:57Z
date_updated: 2022-08-25T08:59:57Z
file_id: '11970'
file_name: Thesis_Rouven_Schulz_2022_final.pdf
file_size: 28079331
relation: main_file
success: 1
- access_level: closed
checksum: 2b8f95ea1c134dbdb927b41b1dbeeeb5
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: rschulz
date_created: 2022-08-25T09:00:11Z
date_updated: 2022-08-25T09:33:31Z
file_id: '11971'
file_name: Thesis_Rouven_Schulz_2022_final.docx
file_size: 27226963
relation: source_file
file_date_updated: 2022-08-25T09:33:31Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '133'
project:
- _id: 267F75D8-B435-11E9-9278-68D0E5697425
name: Modulating microglia through G protein-coupled receptor (GPCR) signaling
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '11995'
relation: dissertation_contains
status: public
status: public
supervisor:
- first_name: Sandra
full_name: Siegert, Sandra
id: 36ACD32E-F248-11E8-B48F-1D18A9856A87
last_name: Siegert
orcid: 0000-0001-8635-0877
title: Chimeric G protein-coupled receptors mimic distinct signaling pathways and
modulate microglia function
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2022'
...
---
_id: '11951'
abstract:
- lang: eng
text: The mammalian hippocampal formation (HF) plays a key role in several higher
brain functions, such as spatial coding, learning and memory. Its simple circuit
architecture is often viewed as a trisynaptic loop, processing input originating
from the superficial layers of the entorhinal cortex (EC) and sending it back
to its deeper layers. Here, we show that excitatory neurons in layer 6b of the
mouse EC project to all sub-regions comprising the HF and receive input from the
CA1, thalamus and claustrum. Furthermore, their output is characterized by unique
slow-decaying excitatory postsynaptic currents capable of driving plateau-like
potentials in their postsynaptic targets. Optogenetic inhibition of the EC-6b
pathway affects spatial coding in CA1 pyramidal neurons, while cell ablation impairs
not only acquisition of new spatial memories, but also degradation of previously
acquired ones. Our results provide evidence of a functional role for cortical
layer 6b neurons in the adult brain.
acknowledged_ssus:
- _id: Bio
- _id: SSU
acknowledgement: We thank F. Marr and A. Schlögl for technical assistance, E. Kralli-Beller
for manuscript editing, as well as C. Sommer and the Imaging and Optics Facility
of the Institute of Science and Technology Austria (ISTA) for image analysis scripts
and microscopy support. We extend our gratitude to J. Wallenschus and D. Rangel
Guerrero for technical assistance acquiring single-unit data and I. Gridchyn for
help with single-unit clustering. Finally, we also thank B. Suter for discussions,
A. Saunders, M. Jösch, and H. Monyer for critically reading earlier versions of
the manuscript, C. Petersen for sharing clearing protocols, and the Scientific Service
Units of ISTA for efficient support. This project was funded by the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
(ERC advanced grant No 692692 to P.J.) and the Fond zur Förderung der Wissenschaftlichen
Forschung (Z 312-B27, Wittgenstein award for P.J. and I3600-B27 for J.G.D. and P.V.).
article_number: '4826'
article_processing_charge: No
article_type: original
author:
- first_name: Yoav
full_name: Ben Simon, Yoav
id: 43DF3136-F248-11E8-B48F-1D18A9856A87
last_name: Ben Simon
- first_name: Karola
full_name: Käfer, Karola
id: 2DAA49AA-F248-11E8-B48F-1D18A9856A87
last_name: Käfer
- first_name: Philipp
full_name: Velicky, Philipp
id: 39BDC62C-F248-11E8-B48F-1D18A9856A87
last_name: Velicky
orcid: 0000-0002-2340-7431
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Ben Simon Y, Käfer K, Velicky P, Csicsvari JL, Danzl JG, Jonas PM. A direct
excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes
to spatial coding and memory. Nature Communications. 2022;13. doi:10.1038/s41467-022-32559-8
apa: Ben Simon, Y., Käfer, K., Velicky, P., Csicsvari, J. L., Danzl, J. G., &
Jonas, P. M. (2022). A direct excitatory projection from entorhinal layer 6b neurons
to the hippocampus contributes to spatial coding and memory. Nature Communications.
Springer Nature. https://doi.org/10.1038/s41467-022-32559-8
chicago: Ben Simon, Yoav, Karola Käfer, Philipp Velicky, Jozsef L Csicsvari, Johann
G Danzl, and Peter M Jonas. “A Direct Excitatory Projection from Entorhinal Layer
6b Neurons to the Hippocampus Contributes to Spatial Coding and Memory.” Nature
Communications. Springer Nature, 2022. https://doi.org/10.1038/s41467-022-32559-8.
ieee: Y. Ben Simon, K. Käfer, P. Velicky, J. L. Csicsvari, J. G. Danzl, and P. M.
Jonas, “A direct excitatory projection from entorhinal layer 6b neurons to the
hippocampus contributes to spatial coding and memory,” Nature Communications,
vol. 13. Springer Nature, 2022.
ista: Ben Simon Y, Käfer K, Velicky P, Csicsvari JL, Danzl JG, Jonas PM. 2022. A
direct excitatory projection from entorhinal layer 6b neurons to the hippocampus
contributes to spatial coding and memory. Nature Communications. 13, 4826.
mla: Ben Simon, Yoav, et al. “A Direct Excitatory Projection from Entorhinal Layer
6b Neurons to the Hippocampus Contributes to Spatial Coding and Memory.” Nature
Communications, vol. 13, 4826, Springer Nature, 2022, doi:10.1038/s41467-022-32559-8.
short: Y. Ben Simon, K. Käfer, P. Velicky, J.L. Csicsvari, J.G. Danzl, P.M. Jonas,
Nature Communications 13 (2022).
corr_author: '1'
date_created: 2022-08-24T08:25:50Z
date_published: 2022-08-16T00:00:00Z
date_updated: 2025-06-12T06:10:44Z
day: '16'
ddc:
- '570'
department:
- _id: JoCs
- _id: PeJo
- _id: JoDa
doi: 10.1038/s41467-022-32559-8
ec_funded: 1
external_id:
isi:
- '000841396400008'
pmid:
- '35974109'
file:
- access_level: open_access
checksum: 405936d9e4d33625d80c093c9713a91f
content_type: application/pdf
creator: dernst
date_created: 2022-08-26T11:51:40Z
date_updated: 2022-08-26T11:51:40Z
file_id: '11990'
file_name: 2022_NatureCommunications_BenSimon.pdf
file_size: 5910357
relation: main_file
success: 1
file_date_updated: 2022-08-26T11:51:40Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
keyword:
- General Physics and Astronomy
- General Biochemistry
- Genetics and Molecular Biology
- General Chemistry
- Multidisciplinary
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 25B7EB9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '692692'
name: Biophysics and circuit function of a giant cortical glutamatergic synapse
- _id: 265CB4D0-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03600
name: Optical control of synaptic function via adhesion molecules
- _id: 25C5A090-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00312
name: Synaptic communication in neuronal microcircuits
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus
contributes to spatial coding and memory
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2022'
...
---
_id: '11955'
abstract:
- lang: eng
text: Covalent organic frameworks (COFs) are structurally tuneable, porous and crystalline
polymers constructed through the covalent attachment of small organic building
blocks as elementary units. Using the myriad of such building blocks, a broad
spectrum of functionalities has been applied for COF syntheses for broad applications,
including heterogeneous catalysis. Herein, we report the synthesis of a new family
of porous and crystalline COFs using a novel acridine linker and benzene-1,3,5-tricarbaldehyde
derivatives bearing a variable number of hydroxy groups. With the broad absorption
in the visible light region, the COFs were applied as photocatalysts in metallaphotocatalytic
C−N cross-coupling. The fully β-ketoenamine linked COF showed the highest activity,
due to the increased charge separation upon irradiation. The COF showed good to
excellent yields for several aryl bromides, good recyclability and even catalyzed
the organic transformation in presence of green light as energy source.
article_number: e202117738
article_processing_charge: No
article_type: original
author:
- first_name: Michael
full_name: Traxler, Michael
last_name: Traxler
- first_name: Sebastian
full_name: Gisbertz, Sebastian
last_name: Gisbertz
- first_name: Pradip
full_name: Pachfule, Pradip
last_name: Pachfule
- first_name: Johannes
full_name: Schmidt, Johannes
last_name: Schmidt
- first_name: Jérôme
full_name: Roeser, Jérôme
last_name: Roeser
- first_name: Susanne
full_name: Reischauer, Susanne
last_name: Reischauer
- first_name: Jabor
full_name: Rabeah, Jabor
last_name: Rabeah
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
- first_name: Arne
full_name: Thomas, Arne
last_name: Thomas
citation:
ama: Traxler M, Gisbertz S, Pachfule P, et al. Acridine‐functionalized covalent
organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling.
Angewandte Chemie International Edition. 2022;61(21). doi:10.1002/anie.202117738
apa: Traxler, M., Gisbertz, S., Pachfule, P., Schmidt, J., Roeser, J., Reischauer,
S., … Thomas, A. (2022). Acridine‐functionalized covalent organic frameworks (COFs)
as photocatalysts for metallaphotocatalytic C−N cross‐coupling. Angewandte
Chemie International Edition. Wiley. https://doi.org/10.1002/anie.202117738
chicago: Traxler, Michael, Sebastian Gisbertz, Pradip Pachfule, Johannes Schmidt,
Jérôme Roeser, Susanne Reischauer, Jabor Rabeah, Bartholomäus Pieber, and Arne
Thomas. “Acridine‐functionalized Covalent Organic Frameworks (COFs) as Photocatalysts
for Metallaphotocatalytic C−N Cross‐coupling.” Angewandte Chemie International
Edition. Wiley, 2022. https://doi.org/10.1002/anie.202117738.
ieee: M. Traxler et al., “Acridine‐functionalized covalent organic frameworks
(COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling,” Angewandte
Chemie International Edition, vol. 61, no. 21. Wiley, 2022.
ista: Traxler M, Gisbertz S, Pachfule P, Schmidt J, Roeser J, Reischauer S, Rabeah
J, Pieber B, Thomas A. 2022. Acridine‐functionalized covalent organic frameworks
(COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling. Angewandte
Chemie International Edition. 61(21), e202117738.
mla: Traxler, Michael, et al. “Acridine‐functionalized Covalent Organic Frameworks
(COFs) as Photocatalysts for Metallaphotocatalytic C−N Cross‐coupling.” Angewandte
Chemie International Edition, vol. 61, no. 21, e202117738, Wiley, 2022, doi:10.1002/anie.202117738.
short: M. Traxler, S. Gisbertz, P. Pachfule, J. Schmidt, J. Roeser, S. Reischauer,
J. Rabeah, B. Pieber, A. Thomas, Angewandte Chemie International Edition 61 (2022).
date_created: 2022-08-24T10:41:25Z
date_published: 2022-05-16T00:00:00Z
date_updated: 2024-10-14T11:42:54Z
day: '16'
doi: 10.1002/anie.202117738
extern: '1'
external_id:
pmid:
- '35188714'
intvolume: ' 61'
issue: '21'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1002/anie.202117738
month: '05'
oa: 1
oa_version: Published Version
pmid: 1
publication: Angewandte Chemie International Edition
publication_identifier:
eissn:
- 1521-3773
issn:
- 1433-7851
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts
for metallaphotocatalytic C−N cross‐coupling
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 61
year: '2022'
...
---
_id: '11991'
abstract:
- lang: eng
text: The study of the complexity of the constraint satisfaction problem (CSP),
centred around the Feder-Vardi Dichotomy Conjecture, has been very prominent in
the last two decades. After a long concerted effort and many partial results,
the Dichotomy Conjecture has been proved in 2017 independently by Bulatov and
Zhuk. At about the same time, a vast generalisation of CSP, called promise CSP,
has started to gain prominence. In this survey, we explain the importance of promise
CSP and highlight many new very interesting features that the study of promise
CSP has brought to light. The complexity classification quest for the promise
CSP is wide open, and we argue that, despite the promise CSP being more general,
this quest is rather more accessible to a wide range of researchers than the dichotomy-led
study of the CSP has been.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Andrei
full_name: Krokhin, Andrei
last_name: Krokhin
- first_name: Jakub
full_name: Opršal, Jakub
id: ec596741-c539-11ec-b829-c79322a91242
last_name: Opršal
orcid: 0000-0003-1245-3456
citation:
ama: Krokhin A, Opršal J. An invitation to the promise constraint satisfaction problem.
ACM SIGLOG News. 2022;9(3):30-59. doi:10.1145/3559736.3559740
apa: Krokhin, A., & Opršal, J. (2022). An invitation to the promise constraint
satisfaction problem. ACM SIGLOG News. Association for Computing Machinery.
https://doi.org/10.1145/3559736.3559740
chicago: Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint
Satisfaction Problem.” ACM SIGLOG News. Association for Computing Machinery,
2022. https://doi.org/10.1145/3559736.3559740.
ieee: A. Krokhin and J. Opršal, “An invitation to the promise constraint satisfaction
problem,” ACM SIGLOG News, vol. 9, no. 3. Association for Computing Machinery,
pp. 30–59, 2022.
ista: Krokhin A, Opršal J. 2022. An invitation to the promise constraint satisfaction
problem. ACM SIGLOG News. 9(3), 30–59.
mla: Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint
Satisfaction Problem.” ACM SIGLOG News, vol. 9, no. 3, Association for
Computing Machinery, 2022, pp. 30–59, doi:10.1145/3559736.3559740.
short: A. Krokhin, J. Opršal, ACM SIGLOG News 9 (2022) 30–59.
date_created: 2022-08-27T11:23:37Z
date_published: 2022-07-01T00:00:00Z
date_updated: 2022-09-05T08:19:38Z
day: '01'
department:
- _id: UlWa
doi: 10.1145/3559736.3559740
external_id:
arxiv:
- '2208.13538'
intvolume: ' 9'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/2208.13538
month: '07'
oa: 1
oa_version: Preprint
page: 30-59
publication: ACM SIGLOG News
publication_identifier:
issn:
- 2372-3491
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
status: public
title: An invitation to the promise constraint satisfaction problem
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2022'
...
---
_id: '11993'
abstract:
- lang: eng
text: Moulding refers to a set of manufacturing techniques in which a mould, usually
a cavity or a solid frame, is used to shape a liquid or pliable material into
an object of the desired shape. The popularity of moulding comes from its effectiveness,
scalability and versatility in terms of employed materials. Its relevance as a
fabrication process is demonstrated by the extensive literature covering different
aspects related to mould design, from material flow simulation to the automation
of mould geometry design. In this state-of-the-art report, we provide an extensive
review of the automatic methods for the design of moulds, focusing on contributions
from a geometric perspective. We classify existing mould design methods based
on their computational approach and the nature of their target moulding process.
We summarize the relationships between computational approaches and moulding techniques,
highlighting their strengths and limitations. Finally, we discuss potential future
research directions.
article_processing_charge: No
article_type: original
author:
- first_name: Thomas
full_name: Alderighi, Thomas
last_name: Alderighi
- first_name: Luigi
full_name: Malomo, Luigi
last_name: Malomo
- first_name: Thomas
full_name: Auzinger, Thomas
id: 4718F954-F248-11E8-B48F-1D18A9856A87
last_name: Auzinger
orcid: 0000-0002-1546-3265
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Paulo
full_name: Cignoni, Paulo
last_name: Cignoni
- first_name: Nico
full_name: Pietroni, Nico
last_name: Pietroni
citation:
ama: Alderighi T, Malomo L, Auzinger T, Bickel B, Cignoni P, Pietroni N. State of
the art in computational mould design. Computer Graphics Forum. 2022;41(6):435-452.
doi:10.1111/cgf.14581
apa: Alderighi, T., Malomo, L., Auzinger, T., Bickel, B., Cignoni, P., & Pietroni,
N. (2022). State of the art in computational mould design. Computer Graphics
Forum. Wiley. https://doi.org/10.1111/cgf.14581
chicago: Alderighi, Thomas, Luigi Malomo, Thomas Auzinger, Bernd Bickel, Paulo Cignoni,
and Nico Pietroni. “State of the Art in Computational Mould Design.” Computer
Graphics Forum. Wiley, 2022. https://doi.org/10.1111/cgf.14581.
ieee: T. Alderighi, L. Malomo, T. Auzinger, B. Bickel, P. Cignoni, and N. Pietroni,
“State of the art in computational mould design,” Computer Graphics Forum,
vol. 41, no. 6. Wiley, pp. 435–452, 2022.
ista: Alderighi T, Malomo L, Auzinger T, Bickel B, Cignoni P, Pietroni N. 2022.
State of the art in computational mould design. Computer Graphics Forum. 41(6),
435–452.
mla: Alderighi, Thomas, et al. “State of the Art in Computational Mould Design.”
Computer Graphics Forum, vol. 41, no. 6, Wiley, 2022, pp. 435–52, doi:10.1111/cgf.14581.
short: T. Alderighi, L. Malomo, T. Auzinger, B. Bickel, P. Cignoni, N. Pietroni,
Computer Graphics Forum 41 (2022) 435–452.
corr_author: '1'
date_created: 2022-08-28T18:17:01Z
date_published: 2022-09-01T00:00:00Z
date_updated: 2024-10-09T21:03:21Z
day: '01'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.1111/cgf.14581
external_id:
isi:
- '000842638900001'
file:
- access_level: open_access
checksum: c40cc8ceb7b7f0512172b883d712198e
content_type: application/pdf
creator: bbickel
date_created: 2022-08-28T18:18:08Z
date_updated: 2022-08-28T18:18:08Z
description: 'This is the pre-peer reviewed version of the following article: Alderighi,
T., Malomo, L., Auzinger, T., Bickel, B., Cignoni, P. and Pietroni, N. (2022),
State of the Art in Computational Mould Design. Computer Graphics Forum, which
has been published in final form at https://doi.org/10.1111/cgf.14581. This article
may be used for non-commercial purposes in accordance with Wiley Terms and Conditions
for Use of Self-Archived Versions.'
file_id: '11994'
file_name: star_molding_preprint.pdf
file_size: 32480850
relation: main_file
title: pre-peer reviewed version
file_date_updated: 2022-08-28T18:18:08Z
has_accepted_license: '1'
intvolume: ' 41'
isi: 1
issue: '6'
keyword:
- Computer Graphics and Computer-Aided Design
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 435-452
publication: Computer Graphics Forum
publication_identifier:
eissn:
- 1467-8659
issn:
- 0167-7055
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: State of the art in computational mould design
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 41
year: '2022'
...
---
_id: '11995'
abstract:
- lang: eng
text: G protein-coupled receptors (GPCRs) regulate processes ranging from immune
responses to neuronal signaling. However, ligands for many GPCRs remain unknown,
suffer from off-target effects or have poor bioavailability. Additionally, dissecting
cell type-specific responses is challenging when the same GPCR is expressed on
different cells within a tissue. Here, we overcome these limitations by engineering
DREADD-based GPCR chimeras that bind clozapine-N-oxide and mimic a GPCR-of-interest.
We show that chimeric DREADD-β2AR triggers responses comparable to β2AR on second
messenger and kinase activity, post-translational modifications, and protein-protein
interactions. Moreover, we successfully recapitulate β2AR-mediated filopodia formation
in microglia, an immune cell capable of driving central nervous system inflammation.
When dissecting microglial inflammation, we included two additional DREADD-based
chimeras mimicking microglia-enriched GPR65 and GPR109A. DREADD-β2AR and DREADD-GPR65
modulate the inflammatory response with high similarity to endogenous β2AR, while
DREADD-GPR109A shows no impact. Our DREADD-based approach allows investigation
of cell type-dependent pathways without known endogenous ligands.
acknowledged_ssus:
- _id: PreCl
- _id: Bio
- _id: LifeSc
acknowledgement: The authors thank the Scientific Service Units at ISTA, in particular
the Molecular Biology Service of the Lab Support Facility, Imaging & Optics Facility,
and the Preclinical Facility, and the Novarino group, Harald Janoviak, and Marco
Benevento for sharing reagents and expertise. This research was supported by a DOC
Fellowship (24979) awarded to R.S. by the Austrian Academy of Sciences.
article_number: '4728'
article_processing_charge: No
article_type: original
author:
- first_name: Rouven
full_name: Schulz, Rouven
id: 4C5E7B96-F248-11E8-B48F-1D18A9856A87
last_name: Schulz
orcid: 0000-0001-5297-733X
- first_name: Medina
full_name: Korkut, Medina
id: 4B51CE74-F248-11E8-B48F-1D18A9856A87
last_name: Korkut
orcid: 0000-0003-4309-2251
- first_name: Alessandro
full_name: Venturino, Alessandro
id: 41CB84B2-F248-11E8-B48F-1D18A9856A87
last_name: Venturino
orcid: 0000-0003-2356-9403
- first_name: Gloria
full_name: Colombo, Gloria
id: 3483CF6C-F248-11E8-B48F-1D18A9856A87
last_name: Colombo
orcid: 0000-0001-9434-8902
- first_name: Sandra
full_name: Siegert, Sandra
id: 36ACD32E-F248-11E8-B48F-1D18A9856A87
last_name: Siegert
orcid: 0000-0001-8635-0877
citation:
ama: Schulz R, Korkut M, Venturino A, Colombo G, Siegert S. Chimeric GPCRs mimic
distinct signaling pathways and modulate microglia responses. Nature Communications.
2022;13. doi:10.1038/s41467-022-32390-1
apa: Schulz, R., Korkut, M., Venturino, A., Colombo, G., & Siegert, S. (2022).
Chimeric GPCRs mimic distinct signaling pathways and modulate microglia responses.
Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-022-32390-1
chicago: Schulz, Rouven, Medina Korkut, Alessandro Venturino, Gloria Colombo, and
Sandra Siegert. “Chimeric GPCRs Mimic Distinct Signaling Pathways and Modulate
Microglia Responses.” Nature Communications. Springer Nature, 2022. https://doi.org/10.1038/s41467-022-32390-1.
ieee: R. Schulz, M. Korkut, A. Venturino, G. Colombo, and S. Siegert, “Chimeric
GPCRs mimic distinct signaling pathways and modulate microglia responses,” Nature
Communications, vol. 13. Springer Nature, 2022.
ista: Schulz R, Korkut M, Venturino A, Colombo G, Siegert S. 2022. Chimeric GPCRs
mimic distinct signaling pathways and modulate microglia responses. Nature Communications.
13, 4728.
mla: Schulz, Rouven, et al. “Chimeric GPCRs Mimic Distinct Signaling Pathways and
Modulate Microglia Responses.” Nature Communications, vol. 13, 4728, Springer
Nature, 2022, doi:10.1038/s41467-022-32390-1.
short: R. Schulz, M. Korkut, A. Venturino, G. Colombo, S. Siegert, Nature Communications
13 (2022).
corr_author: '1'
date_created: 2022-08-28T22:01:59Z
date_published: 2022-08-15T00:00:00Z
date_updated: 2026-04-07T14:17:58Z
day: '15'
ddc:
- '570'
department:
- _id: SaSi
doi: 10.1038/s41467-022-32390-1
external_id:
isi:
- '000840984400032'
pmid:
- '35970889'
file:
- access_level: open_access
checksum: 191d9db0266e14a28d3a56dc7f65da84
content_type: application/pdf
creator: cchlebak
date_created: 2022-08-29T06:44:30Z
date_updated: 2022-08-29T06:44:30Z
file_id: '12002'
file_name: 2022_NatComm_Schulz.pdf
file_size: 7317396
relation: main_file
success: 1
file_date_updated: 2022-08-29T06:44:30Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 267F75D8-B435-11E9-9278-68D0E5697425
name: Modulating microglia through G protein-coupled receptor (GPCR) signaling
publication: Nature Communications
publication_identifier:
eissn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on ISTA website
relation: press_release
url: https://ista.ac.at/en/news/dreaddful-mimicry/
record:
- id: '11542'
relation: research_data
status: public
- id: '11945'
relation: part_of_dissertation
status: public
scopus_import: '1'
status: public
title: Chimeric GPCRs mimic distinct signaling pathways and modulate microglia responses
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13
year: '2022'
...