---
_id: '11814'
abstract:
- lang: eng
text: "Differentially private algorithms protect individuals in data analysis scenarios
by ensuring that there is only a weak correlation between the existence of the
user in the data and the result of the analysis. Dynamic graph algorithms maintain
the solution to a problem (e.g., a matching) on an evolving input, i.e., a graph
where nodes or edges are inserted or deleted over time. They output the value
of the solution after each update operation, i.e., continuously. We study (event-level
and user-level) differentially private algorithms for graph problems under continual
observation, i.e., differentially private dynamic graph algorithms. We present
event-level private algorithms for partially dynamic counting-based problems such
as triangle count that improve the additive error by a polynomial factor (in the
length T of the update sequence) on the state of the art, resulting in the first
algorithms with additive error polylogarithmic in T.\r\nWe also give ε-differentially
private and partially dynamic algorithms for minimum spanning tree, minimum cut,
densest subgraph, and maximum matching. The additive error of our improved MST
algorithm is O(W log^{3/2}T / ε), where W is the maximum weight of any edge, which,
as we show, is tight up to a (√{log T} / ε)-factor. For the other problems, we
present a partially-dynamic algorithm with multiplicative error (1+β) for any
constant β > 0 and additive error O(W log(nW) log(T) / (ε β)). Finally, we show
that the additive error for a broad class of dynamic graph algorithms with user-level
privacy must be linear in the value of the output solution’s range."
alternative_title:
- LIPIcs
article_number: '42'
article_processing_charge: No
arxiv: 1
author:
- first_name: Hendrik
full_name: Fichtenberger, Hendrik
last_name: Fichtenberger
- 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: Wolfgang
full_name: Ost, Wolfgang
last_name: Ost
citation:
ama: 'Fichtenberger H, Henzinger MH, Ost W. Differentially private algorithms for
graphs under continual observation. In: 29th Annual European Symposium on Algorithms.
Vol 204. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.ESA.2021.42'
apa: 'Fichtenberger, H., Henzinger, M. H., & Ost, W. (2021). Differentially
private algorithms for graphs under continual observation. In 29th Annual European
Symposium on Algorithms (Vol. 204). Lisbon, Portual: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2021.42'
chicago: Fichtenberger, Hendrik, Monika H Henzinger, and Wolfgang Ost. “Differentially
Private Algorithms for Graphs under Continual Observation.” In 29th Annual
European Symposium on Algorithms, Vol. 204. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2021. https://doi.org/10.4230/LIPIcs.ESA.2021.42.
ieee: H. Fichtenberger, M. H. Henzinger, and W. Ost, “Differentially private algorithms
for graphs under continual observation,” in 29th Annual European Symposium
on Algorithms, Lisbon, Portual, 2021, vol. 204.
ista: 'Fichtenberger H, Henzinger MH, Ost W. 2021. Differentially private algorithms
for graphs under continual observation. 29th Annual European Symposium on Algorithms.
ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 204, 42.'
mla: Fichtenberger, Hendrik, et al. “Differentially Private Algorithms for Graphs
under Continual Observation.” 29th Annual European Symposium on Algorithms,
vol. 204, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.ESA.2021.42.
short: H. Fichtenberger, M.H. Henzinger, W. Ost, in:, 29th Annual European Symposium
on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
conference:
end_date: 2021-09-08
location: Lisbon, Portual
name: 'ESA: Annual European Symposium on Algorithms'
start_date: 2021-09-06
date_created: 2022-08-12T07:04:44Z
date_published: 2021-08-31T00:00:00Z
date_updated: 2023-02-14T08:28:56Z
day: '31'
doi: 10.4230/LIPIcs.ESA.2021.42
extern: '1'
external_id:
arxiv:
- '2106.14756'
intvolume: ' 204'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.ESA.2021.42
month: '08'
oa: 1
oa_version: Published Version
publication: 29th Annual European Symposium on Algorithms
publication_identifier:
isbn:
- '9783959772044'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Differentially private algorithms for graphs under continual observation
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 204
year: '2021'
...
---
_id: '11886'
abstract:
- lang: eng
text: "We present a deterministic (1+\U0001D45C(1))-approximation (\U0001D45B1/2+\U0001D45C(1)+\U0001D4371+\U0001D45C(1))-time
algorithm for solving the single-source shortest paths problem on distributed
weighted networks (the \\sf CONGEST model); here \U0001D45B is the number of nodes
in the network, \U0001D437 is its (hop) diameter, and edge weights are positive
integers from 1 to poly(\U0001D45B). This is the first nontrivial deterministic
algorithm for this problem. It also improves (i) the running time of the randomized
(1+\U0001D45C(1))-approximation \U0001D442̃ (\U0001D45B√\U0001D4371/4+\U0001D437)-time
algorithm of Nanongkai [in Proceedings of STOC, 2014, pp. 565--573] by a factor
of as large as \U0001D45B1/8, and (ii) the \U0001D442(\U0001D716−1log\U0001D716−1)-approximation
factor of Lenzen and Patt-Shamir's \U0001D442̃ (\U0001D45B1/2+\U0001D716+\U0001D437)-time
algorithm [in Proceedings of STOC, 2013, pp. 381--390] within the same running
time. (Throughout, we use \U0001D442̃ (⋅) to hide polylogarithmic factors in \U0001D45B.)
Our running time matches the known time lower bound of Ω(\U0001D45B/log\U0001D45B‾‾‾‾‾‾‾√+\U0001D437)
[M. Elkin, SIAM J. Comput., 36 (2006), pp. 433--456], thus essentially settling
the status of this problem which was raised at least a decade ago [M. Elkin, SIGACT
News, 35 (2004), pp. 40--57]. It also implies a (2+\U0001D45C(1))-approximation
(\U0001D45B1/2+\U0001D45C(1)+\U0001D4371+\U0001D45C(1))-time algorithm for approximating
a network's weighted diameter which almost matches the lower bound by Holzer and
Pinsker [in Proceedings of OPODIS, 2015, Schloss Dagstuhl. Leibniz-Zent. Inform.,
Wadern, Germany, 2016, 6]. In achieving this result, we develop two techniques
which might be of independent interest and useful in other settings: (i) a deterministic
process that replaces the “hitting set argument” commonly used for shortest paths
computation in various settings, and (ii) a simple, deterministic construction
of an (\U0001D45B\U0001D45C(1),\U0001D45C(1))-hop set of size \U0001D45B1+\U0001D45C(1).
We combine these techniques with many distributed algorithmic techniques, some
of which are from problems that are not directly related to shortest paths, e.g.,
ruling sets [A. V. Goldberg, S. A. Plotkin, and G. E. Shannon, SIAM J. Discrete
Math., 1 (1988), pp. 434--446], source detection [C. Lenzen and D. Peleg, in Proceedings
of PODC, 2013, pp. 375--382], and partial distance estimation [C. Lenzen and B.
Patt-Shamir, in Proceedings of PODC, 2015, pp. 153--162]. Our hop set construction
also leads to single-source shortest paths algorithms in two other settings: (i)
a (1+\U0001D45C(1))-approximation \U0001D45B\U0001D45C(1)-time algorithm on congested
cliques, and (ii) a (1+\U0001D45C(1))-approximation \U0001D45B\U0001D45C(1)-pass
\U0001D45B1+\U0001D45C(1)-space streaming algorithm. The first result answers
an open problem in [D. Nanongkai, in Proceedings of STOC, 2014, pp. 565--573].
The second result partially answers an open problem raised by McGregor in 2006
[List of Open Problems in Sublinear Algorithms: Problem 14]."
article_processing_charge: No
article_type: original
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: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: Henzinger MH, Krinninger S, Nanongkai D. A deterministic almost-tight distributed
algorithm for approximating single-source shortest paths. SIAM Journal on Computing.
2021;50(3):STOC16-98-STOC16-137. doi:10.1137/16m1097808
apa: Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2021). A deterministic
almost-tight distributed algorithm for approximating single-source shortest paths.
SIAM Journal on Computing. Society for Industrial & Applied Mathematics.
https://doi.org/10.1137/16m1097808
chicago: Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “A Deterministic
Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.”
SIAM Journal on Computing. Society for Industrial & Applied Mathematics,
2021. https://doi.org/10.1137/16m1097808.
ieee: M. H. Henzinger, S. Krinninger, and D. Nanongkai, “A deterministic almost-tight
distributed algorithm for approximating single-source shortest paths,” SIAM
Journal on Computing, vol. 50, no. 3. Society for Industrial & Applied
Mathematics, pp. STOC16-98-STOC16-137, 2021.
ista: Henzinger MH, Krinninger S, Nanongkai D. 2021. A deterministic almost-tight
distributed algorithm for approximating single-source shortest paths. SIAM Journal
on Computing. 50(3), STOC16-98-STOC16-137.
mla: Henzinger, Monika H., et al. “A Deterministic Almost-Tight Distributed Algorithm
for Approximating Single-Source Shortest Paths.” SIAM Journal on Computing,
vol. 50, no. 3, Society for Industrial & Applied Mathematics, 2021, pp. STOC16-98-STOC16-137,
doi:10.1137/16m1097808.
short: M.H. Henzinger, S. Krinninger, D. Nanongkai, SIAM Journal on Computing 50
(2021) STOC16-98-STOC16-137.
date_created: 2022-08-17T07:54:45Z
date_published: 2021-05-01T00:00:00Z
date_updated: 2023-02-17T14:12:49Z
day: '01'
doi: 10.1137/16m1097808
extern: '1'
external_id:
arxiv:
- '1504.07056'
intvolume: ' 50'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.07056
month: '05'
oa: 1
oa_version: Preprint
page: STOC16-98-STOC16-137
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: Society for Industrial & Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: A deterministic almost-tight distributed algorithm for approximating single-source
shortest paths
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 50
year: '2021'
...
---
_id: '11919'
abstract:
- lang: eng
text: "Maintaining and updating shortest paths information in a graph is a fundamental
problem with many applications. As computations on dense graphs can be prohibitively
expensive, and it is preferable to perform the computations on a sparse skeleton
of the given graph that roughly preserves the shortest paths information. Spanners
and emulators serve this purpose. Unfortunately, very little is known about dynamically
maintaining sparse spanners and emulators as the graph is modified by a sequence
of edge insertions and deletions. This paper develops fast dynamic algorithms
for spanner and emulator maintenance and provides evidence from fine-grained complexity
that these algorithms are tight. For unweighted undirected m-edge n-node graphs
we obtain the following results.\r\n\r\nUnder the popular OMv conjecture, there
can be no decremental or incremental algorithm that maintains an n1+o(1) edge
(purely additive) +nδ-emulator for any δ < 1/2 with arbitrary polynomial preprocessing
time and total update time m1+o(1). Also, under the Combinatorial k-Clique hypothesis,
any fully dynamic combinatorial algorithm that maintains an n1+o(1) edge (1 +
∊, no(1))-spanner or emulator for small ∊ must either have preprocessing time
mn1–o(1) or amortized update time m1–o(1). Both of our conditional lower bounds
are tight.\r\n\r\nAs the above fully dynamic lower bound only applies to combinatorial
algorithms, we also develop an algebraic spanner algorithm that improves over
the m1–o(1) update time for dense graphs. For any constant ∊ ∊ (0, 1], there is
a fully dynamic algorithm with worst-case update time O(n1.529) that whp maintains
an n1+o(1) edge (1 + ∊, no(1))-spanner.\r\n\r\nOur new algebraic techniques allow
us to also obtain a new fully dynamic algorithm for All-Pairs Shortest Paths (APSP)
that can perform both edge updates and can report shortest paths in worst-case
time O(n1.9), which are correct whp. This is the first path-reporting fully dynamic
APSP algorithm with a truly subquadratic query time that beats O(n2.5) update
time. It works against an oblivious adversary.\r\n\r\nFinally, we give two applications
of our new dynamic spanner algorithms: (1) a fully dynamic (1 + ∊)-approximate
APSP algorithm with update time O(n1.529) that can report approximate shortest
paths in n1+o(1) time per query; previous subquadratic update/query algorithms
could only report the distance, but not obtain the paths; (2) a fully dynamic
algorithm for near-2-approximate Steiner tree maintenance with both terminal and
edge updates."
article_processing_charge: No
arxiv: 1
author:
- first_name: Thiago
full_name: Bergamaschi, Thiago
last_name: Bergamaschi
- 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: Maximilian Probst
full_name: Gutenberg, Maximilian Probst
last_name: Gutenberg
- first_name: Virginia Vassilevska
full_name: Williams, Virginia Vassilevska
last_name: Williams
- first_name: Nicole
full_name: Wein, Nicole
last_name: Wein
citation:
ama: 'Bergamaschi T, Henzinger MH, Gutenberg MP, Williams VV, Wein N. New techniques
and fine-grained hardness for dynamic near-additive spanners. In: 32nd Annual
ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied
Mathematics; 2021:1836-1855. doi:10.1137/1.9781611976465.110'
apa: 'Bergamaschi, T., Henzinger, M. H., Gutenberg, M. P., Williams, V. V., &
Wein, N. (2021). New techniques and fine-grained hardness for dynamic near-additive
spanners. In 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (pp.
1836–1855). Alexandria, VA, United States: Society for Industrial and Applied
Mathematics. https://doi.org/10.1137/1.9781611976465.110'
chicago: Bergamaschi, Thiago, Monika H Henzinger, Maximilian Probst Gutenberg, Virginia
Vassilevska Williams, and Nicole Wein. “New Techniques and Fine-Grained Hardness
for Dynamic near-Additive Spanners.” In 32nd Annual ACM-SIAM Symposium on Discrete
Algorithms, 1836–55. Society for Industrial and Applied Mathematics, 2021.
https://doi.org/10.1137/1.9781611976465.110.
ieee: T. Bergamaschi, M. H. Henzinger, M. P. Gutenberg, V. V. Williams, and N. Wein,
“New techniques and fine-grained hardness for dynamic near-additive spanners,”
in 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA,
United States, 2021, pp. 1836–1855.
ista: 'Bergamaschi T, Henzinger MH, Gutenberg MP, Williams VV, Wein N. 2021. New
techniques and fine-grained hardness for dynamic near-additive spanners. 32nd
Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete
Algorithms, 1836–1855.'
mla: Bergamaschi, Thiago, et al. “New Techniques and Fine-Grained Hardness for Dynamic
near-Additive Spanners.” 32nd Annual ACM-SIAM Symposium on Discrete Algorithms,
Society for Industrial and Applied Mathematics, 2021, pp. 1836–55, doi:10.1137/1.9781611976465.110.
short: T. Bergamaschi, M.H. Henzinger, M.P. Gutenberg, V.V. Williams, N. Wein, in:,
32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial
and Applied Mathematics, 2021, pp. 1836–1855.
conference:
end_date: 2021-01-13
location: Alexandria, VA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2021-01-10
date_created: 2022-08-18T07:37:36Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2023-02-17T11:28:46Z
day: '01'
doi: 10.1137/1.9781611976465.110
extern: '1'
external_id:
arxiv:
- '2010.10134'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2010.10134
month: '01'
oa: 1
oa_version: Preprint
page: 1836-1855
publication: 32nd Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- 978-1-61197-646-5
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: New techniques and fine-grained hardness for dynamic near-additive spanners
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '11920'
abstract:
- lang: eng
text: 'In the dynamic minimum set cover problem, a challenge is to minimize the
update time while guaranteeing close to the optimal min(O(log n), f) approximation
factor. (Throughout, m, n, f, and C are parameters denoting the maximum number
of sets, number of elements, frequency, and the cost range.) In the high-frequency
range, when f = Ω(log n), this was achieved by a deterministic O(log n)-approximation
algorithm with O(f log n) amortized update time [Gupta et al. STOC''17]. In the
low-frequency range, the line of work by Gupta et al. [STOC''17], Abboud et al.
[STOC''19], and Bhattacharya et al. [ICALP''15, IPCO''17, FOCS''19] led to a deterministic
(1 + ∊) f-approximation algorithm with O(f log(Cn)/∊2) amortized update time.
In this paper we improve the latter update time and provide the first bounds that
subsume (and sometimes improve) the state-of-the-art dynamic vertex cover algorithms.
We obtain: (1) (1 + ∊) f-approximation ratio in O(f log2(Cn)/∊3) worst-case update
time: No non-trivial worst-case update time was previously known for dynamic set
cover. Our bound subsumes and improves by a logarithmic factor the O(log3 n/poly(∊))
worst-case update time for unweighted dynamic vertex cover (i.e., when f = 2 and
C = 1) by Bhattacharya et al. [SODA''17]. (2) (1 + ∊) f-approximation ratio in
O ((f2/∊3) + (f/∊2) log C) amortized update time: This result improves the previous
O(f log (Cn)/∊2) update time bound for most values of f in the low-frequency range,
i.e. whenever f = o(log n). It is the first that is independent of m and n. It
subsumes the constant amortized update time of Bhattacharya and Kulkarni [SODA''19]
for unweighted dynamic vertex cover (i.e., when f = 2 and C = 1). These results
are achieved by leveraging the approximate complementary slackness and background
schedulers techniques. These techniques were used in the local update scheme for
dynamic vertex cover. Our main technical contribution is to adapt these techniques
within the global update scheme of Bhattacharya et al. [FOCS''19] for the dynamic
set cover problem.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- 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: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
- first_name: Xiaowei
full_name: Wu, Xiaowei
last_name: Wu
citation:
ama: 'Bhattacharya S, Henzinger MH, Nanongkai D, Wu X. Dynamic set cover: Improved
amortized and worst-case update time. In: 32nd Annual ACM-SIAM Symposium on
Discrete Algorithms. Society for Industrial and Applied Mathematics; 2021:2537-2549.
doi:10.1137/1.9781611976465.150'
apa: 'Bhattacharya, S., Henzinger, M. H., Nanongkai, D., & Wu, X. (2021). Dynamic
set cover: Improved amortized and worst-case update time. In 32nd Annual ACM-SIAM
Symposium on Discrete Algorithms (pp. 2537–2549). Alexandria, VA, United States:
Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976465.150'
chicago: 'Bhattacharya, Sayan, Monika H Henzinger, Danupon Nanongkai, and Xiaowei
Wu. “Dynamic Set Cover: Improved Amortized and Worst-Case Update Time.” In 32nd
Annual ACM-SIAM Symposium on Discrete Algorithms, 2537–49. Society for Industrial
and Applied Mathematics, 2021. https://doi.org/10.1137/1.9781611976465.150.'
ieee: 'S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and X. Wu, “Dynamic set cover:
Improved amortized and worst-case update time,” in 32nd Annual ACM-SIAM Symposium
on Discrete Algorithms, Alexandria, VA, United States, 2021, pp. 2537–2549.'
ista: 'Bhattacharya S, Henzinger MH, Nanongkai D, Wu X. 2021. Dynamic set cover:
Improved amortized and worst-case update time. 32nd Annual ACM-SIAM Symposium
on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 2537–2549.'
mla: 'Bhattacharya, Sayan, et al. “Dynamic Set Cover: Improved Amortized and Worst-Case
Update Time.” 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society
for Industrial and Applied Mathematics, 2021, pp. 2537–49, doi:10.1137/1.9781611976465.150.'
short: S. Bhattacharya, M.H. Henzinger, D. Nanongkai, X. Wu, in:, 32nd Annual ACM-SIAM
Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics,
2021, pp. 2537–2549.
conference:
end_date: 2021-01-13
location: Alexandria, VA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2021-01-10
date_created: 2022-08-18T07:46:54Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2023-02-17T11:31:22Z
day: '01'
doi: 10.1137/1.9781611976465.150
extern: '1'
external_id:
arxiv:
- '2002.11171'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2002.11171
month: '01'
oa: 1
oa_version: Preprint
page: 2537-2549
publication: 32nd Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- 978-1-61197-646-5
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Dynamic set cover: Improved amortized and worst-case update time'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '11923'
abstract:
- lang: eng
text: "We consider the following online optimization problem. We are given a graph
G and each vertex of the graph is assigned to one of ℓ servers, where servers
have capacity k and we assume that the graph has ℓ · k vertices. Initially, G
does not contain any edges and then the edges of G are revealed one-by-one. The
goal is to design an online algorithm ONL, which always places the connected components
induced by the revealed edges on the same server and never exceeds the server
capacities by more than ∊k for constant ∊ > 0. Whenever ONL learns about a new
edge, the algorithm is allowed to move vertices from one server to another. Its
objective is to minimize the number of vertex moves. More specifically, ONL should
minimize the competitive ratio: the total cost ONL incurs compared to an optimal
offline algorithm OPT.\r\n\r\nThe problem was recently introduced by Henzinger
et al. (SIGMETRICS'2019) and is related to classic online problems such as online
paging and scheduling. It finds applications in the context of resource allocation
in the cloud and for optimizing distributed data structures such as union–find
data structures.\r\n\r\nOur main contribution is a polynomial-time randomized
algorithm, that is asymptotically optimal: we derive an upper bound of O(log ℓ
+ log k) on its competitive ratio and show that no randomized online algorithm
can achieve a competitive ratio of less than Ω(log ℓ + log k). We also settle
the open problem of the achievable competitive ratio by deterministic online algorithms,
by deriving a competitive ratio of Θ(ℓ log k); to this end, we present an improved
lower bound as well as a deterministic polynomial-time online algorithm.\r\n\r\nOur
algorithms rely on a novel technique which combines efficient integer programming
with a combinatorial approach for maintaining ILP solutions. More precisely, we
use an ILP to assign the connected components induced by the revealed edges to
the servers; this is similar to existing approximation schemes for scheduling
algorithms. However, we cannot obtain our competitive ratios if we run the ILP
after each edge insertion. Instead, we identify certain types of edge insertions,
after which we can manually obtain an optimal ILP solution at zero cost without
resolving the ILP. We believe this technique is of independent interest and will
find further applications in the future."
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: Stefan
full_name: Neumann, Stefan
last_name: Neumann
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Henzinger MH, Neumann S, Räcke H, Schmid S. Tight bounds for online graph
partitioning. In: 32nd Annual ACM-SIAM Symposium on Discrete Algorithms.
Society for Industrial and Applied Mathematics; 2021:2799-2818. doi:10.1137/1.9781611976465.166'
apa: 'Henzinger, M. H., Neumann, S., Räcke, H., & Schmid, S. (2021). Tight bounds
for online graph partitioning. In 32nd Annual ACM-SIAM Symposium on Discrete
Algorithms (pp. 2799–2818). Alexandria, VA, United States: Society for Industrial
and Applied Mathematics. https://doi.org/10.1137/1.9781611976465.166'
chicago: Henzinger, Monika H, Stefan Neumann, Harald Räcke, and Stefan Schmid. “Tight
Bounds for Online Graph Partitioning.” In 32nd Annual ACM-SIAM Symposium on
Discrete Algorithms, 2799–2818. Society for Industrial and Applied Mathematics,
2021. https://doi.org/10.1137/1.9781611976465.166.
ieee: M. H. Henzinger, S. Neumann, H. Räcke, and S. Schmid, “Tight bounds for online
graph partitioning,” in 32nd Annual ACM-SIAM Symposium on Discrete Algorithms,
Alexandria, VA, United States, 2021, pp. 2799–2818.
ista: 'Henzinger MH, Neumann S, Räcke H, Schmid S. 2021. Tight bounds for online
graph partitioning. 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA:
Symposium on Discrete Algorithms, 2799–2818.'
mla: Henzinger, Monika H., et al. “Tight Bounds for Online Graph Partitioning.”
32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial
and Applied Mathematics, 2021, pp. 2799–818, doi:10.1137/1.9781611976465.166.
short: M.H. Henzinger, S. Neumann, H. Räcke, S. Schmid, in:, 32nd Annual ACM-SIAM
Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics,
2021, pp. 2799–2818.
conference:
end_date: 2021-01-13
location: Alexandria, VA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2021-01-10
date_created: 2022-08-18T10:31:58Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2023-02-17T11:32:38Z
day: '01'
doi: 10.1137/1.9781611976465.166
extern: '1'
external_id:
arxiv:
- '2011.01017'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2011.01017
month: '01'
oa: 1
oa_version: Preprint
page: 2799-2818
publication: 32nd Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- 978-161197646-5
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tight bounds for online graph partitioning
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '11931'
abstract:
- lang: eng
text: Clustering is one of the most fundamental problems in unsupervised learning
with a large number of applications. However, classical clustering algorithms
assume that the data is static, thus failing to capture many real-world applications
where data is constantly changing and evolving. Driven by this, we study the metric
k-center clustering problem in the fully dynamic setting, where the goal is to
efficiently maintain a clustering while supporting an intermixed sequence of insertions
and deletions of points. This model also supports queries of the form (1) report
whether a given point is a center or (2) determine the cluster a point is assigned
to. We present a deterministic dynamic algorithm for the k-center clustering problem
that provably achieves a (2 + ∊)-approximation in nearly logarithmic update and
query time, if the underlying metric has bounded doubling dimension, its aspect
ratio is bounded by a polynomial and ∊ is a constant. An important feature of
our algorithm is that the update and query times are independent of k. We confirm
the practical relevance of this feature via an extensive experimental study which
shows that for large values of k, our algorithmic construction outperforms the
state-of-the-art algorithm in terms of solution quality and running time.
article_processing_charge: No
author:
- first_name: Gramoz
full_name: Goranci, Gramoz
last_name: Goranci
- 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: Dariusz
full_name: Leniowski, Dariusz
last_name: Leniowski
- first_name: Christian
full_name: Schulz, Christian
last_name: Schulz
- first_name: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Goranci G, Henzinger MH, Leniowski D, Schulz C, Svozil A. Fully dynamic k-center
clustering in low dimensional metrics. In: 2021 Proceedings of the Workshop
on Algorithm Engineering and Experiments. Society for Industrial and Applied
Mathematics; 2021:143-153. doi:10.1137/1.9781611976472.11'
apa: 'Goranci, G., Henzinger, M. H., Leniowski, D., Schulz, C., & Svozil, A.
(2021). Fully dynamic k-center clustering in low dimensional metrics. In 2021
Proceedings of the Workshop on Algorithm Engineering and Experiments (pp.
143–153). Alexandria, VA, United States: Society for Industrial and Applied Mathematics.
https://doi.org/10.1137/1.9781611976472.11'
chicago: Goranci, Gramoz, Monika H Henzinger, Dariusz Leniowski, Christian Schulz,
and Alexander Svozil. “Fully Dynamic K-Center Clustering in Low Dimensional Metrics.”
In 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments,
143–53. Society for Industrial and Applied Mathematics, 2021. https://doi.org/10.1137/1.9781611976472.11.
ieee: G. Goranci, M. H. Henzinger, D. Leniowski, C. Schulz, and A. Svozil, “Fully
dynamic k-center clustering in low dimensional metrics,” in 2021 Proceedings
of the Workshop on Algorithm Engineering and Experiments, Alexandria, VA,
United States, 2021, pp. 143–153.
ista: 'Goranci G, Henzinger MH, Leniowski D, Schulz C, Svozil A. 2021. Fully dynamic
k-center clustering in low dimensional metrics. 2021 Proceedings of the Workshop
on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering
and Experiments, 143–153.'
mla: Goranci, Gramoz, et al. “Fully Dynamic K-Center Clustering in Low Dimensional
Metrics.” 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments,
Society for Industrial and Applied Mathematics, 2021, pp. 143–53, doi:10.1137/1.9781611976472.11.
short: G. Goranci, M.H. Henzinger, D. Leniowski, C. Schulz, A. Svozil, in:, 2021
Proceedings of the Workshop on Algorithm Engineering and Experiments, Society
for Industrial and Applied Mathematics, 2021, pp. 143–153.
conference:
end_date: 2021-01-11
location: Alexandria, VA, United States
name: 'ALENEX: Symposium on Algorithm Engineering and Experiments'
start_date: 2021-01-10
date_created: 2022-08-19T07:33:37Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2023-02-17T13:58:51Z
day: '01'
doi: 10.1137/1.9781611976472.11
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1137/1.9781611976472.11
month: '01'
oa: 1
oa_version: Published Version
page: 143 -153
publication: 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments
publication_identifier:
eisbn:
- 978-1-61197-647-2
issn:
- 2164-0300
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fully dynamic k-center clustering in low dimensional metrics
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '11956'
abstract:
- lang: eng
text: Controlling the selectivity of a chemical reaction with external stimuli is
common in thermal processes, but rare in visible-light photocatalysis. Here we
show that the redox potential of a carbon nitride photocatalyst (CN-OA-m) can
be tuned by changing the irradiation wavelength to generate electron holes with
different oxidation potentials. This tuning was the key to realizing photo-chemo-enzymatic
cascades that give either the (S)- or the (R)-enantiomer of phenylethanol. In
combination with an unspecific peroxygenase from Agrocybe aegerita, green light
irradiation of CN-OA-m led to the enantioselective hydroxylation of ethylbenzene
to (R)-1-phenylethanol (99 % ee). In contrast, blue light irradiation triggered
the photocatalytic oxidation of ethylbenzene to acetophenone, which in turn was
enantioselectively reduced with an alcohol dehydrogenase from Rhodococcus ruber
to form (S)-1-phenylethanol (93 % ee).
article_processing_charge: No
article_type: original
author:
- first_name: Luca
full_name: Schmermund, Luca
last_name: Schmermund
- first_name: Susanne
full_name: Reischauer, Susanne
last_name: Reischauer
- first_name: Sarah
full_name: Bierbaumer, Sarah
last_name: Bierbaumer
- first_name: Christoph K.
full_name: Winkler, Christoph K.
last_name: Winkler
- first_name: Alba
full_name: Diaz‐Rodriguez, Alba
last_name: Diaz‐Rodriguez
- first_name: Lee J.
full_name: Edwards, Lee J.
last_name: Edwards
- first_name: Selin
full_name: Kara, Selin
last_name: Kara
- first_name: Tamara
full_name: Mielke, Tamara
last_name: Mielke
- first_name: Jared
full_name: Cartwright, Jared
last_name: Cartwright
- first_name: Gideon
full_name: Grogan, Gideon
last_name: Grogan
- 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: Wolfgang
full_name: Kroutil, Wolfgang
last_name: Kroutil
citation:
ama: Schmermund L, Reischauer S, Bierbaumer S, et al. Chromoselective photocatalysis
enables stereocomplementary biocatalytic pathways. Angewandte Chemie International
Edition. 2021;60(13):6965-6969. doi:10.1002/anie.202100164
apa: Schmermund, L., Reischauer, S., Bierbaumer, S., Winkler, C. K., Diaz‐Rodriguez,
A., Edwards, L. J., … Kroutil, W. (2021). Chromoselective photocatalysis enables
stereocomplementary biocatalytic pathways. Angewandte Chemie International
Edition. Wiley. https://doi.org/10.1002/anie.202100164
chicago: Schmermund, Luca, Susanne Reischauer, Sarah Bierbaumer, Christoph K. Winkler,
Alba Diaz‐Rodriguez, Lee J. Edwards, Selin Kara, et al. “Chromoselective Photocatalysis
Enables Stereocomplementary Biocatalytic Pathways.” Angewandte Chemie International
Edition. Wiley, 2021. https://doi.org/10.1002/anie.202100164.
ieee: L. Schmermund et al., “Chromoselective photocatalysis enables stereocomplementary
biocatalytic pathways,” Angewandte Chemie International Edition, vol. 60,
no. 13. Wiley, pp. 6965–6969, 2021.
ista: Schmermund L, Reischauer S, Bierbaumer S, Winkler CK, Diaz‐Rodriguez A, Edwards
LJ, Kara S, Mielke T, Cartwright J, Grogan G, Pieber B, Kroutil W. 2021. Chromoselective
photocatalysis enables stereocomplementary biocatalytic pathways. Angewandte Chemie
International Edition. 60(13), 6965–6969.
mla: Schmermund, Luca, et al. “Chromoselective Photocatalysis Enables Stereocomplementary
Biocatalytic Pathways.” Angewandte Chemie International Edition, vol. 60,
no. 13, Wiley, 2021, pp. 6965–69, doi:10.1002/anie.202100164.
short: L. Schmermund, S. Reischauer, S. Bierbaumer, C.K. Winkler, A. Diaz‐Rodriguez,
L.J. Edwards, S. Kara, T. Mielke, J. Cartwright, G. Grogan, B. Pieber, W. Kroutil,
Angewandte Chemie International Edition 60 (2021) 6965–6969.
date_created: 2022-08-24T10:47:16Z
date_published: 2021-03-22T00:00:00Z
date_updated: 2023-02-21T10:09:14Z
day: '22'
doi: 10.1002/anie.202100164
extern: '1'
intvolume: ' 60'
issue: '13'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1002/anie.202100164
month: '03'
oa: 1
oa_version: Published Version
page: 6965-6969
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: Chromoselective photocatalysis enables stereocomplementary biocatalytic pathways
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 60
year: '2021'
...
---
_id: '11965'
abstract:
- lang: eng
text: Metallaphotocatalytic cross-coupling reactions are typically carried out by
combining homogeneous or heterogeneous photocatalysts with a soluble nickel complex.
Previous attempts to realize recyclable catalytic systems use immobilized iridium
complexes to harvest light. We present bifunctional materials based on semiconductors
for metallaphotocatalytic C−S cross-coupling reactions that can be reused without
losing their catalytic activity. Key to the success is the permanent immobilization
of a nickel complex on the surface of a heterogeneous semiconductor through phosphonic
acid anchors. The optimized catalyst harvests a broad range of the visible light
spectrum and requires a nickel loading of only ∼0.1 mol %.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Susanne
full_name: Reischauer, Susanne
last_name: Reischauer
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
citation:
ama: Reischauer S, Pieber B. Recyclable, bifunctional metallaphotocatalysts for
C−S cross‐coupling reactions. ChemPhotoChem. 2021;5(8):716-720. doi:10.1002/cptc.202100062
apa: Reischauer, S., & Pieber, B. (2021). Recyclable, bifunctional metallaphotocatalysts
for C−S cross‐coupling reactions. ChemPhotoChem. Wiley. https://doi.org/10.1002/cptc.202100062
chicago: Reischauer, Susanne, and Bartholomäus Pieber. “Recyclable, Bifunctional
Metallaphotocatalysts for C−S Cross‐coupling Reactions.” ChemPhotoChem.
Wiley, 2021. https://doi.org/10.1002/cptc.202100062.
ieee: S. Reischauer and B. Pieber, “Recyclable, bifunctional metallaphotocatalysts
for C−S cross‐coupling reactions,” ChemPhotoChem, vol. 5, no. 8. Wiley,
pp. 716–720, 2021.
ista: Reischauer S, Pieber B. 2021. Recyclable, bifunctional metallaphotocatalysts
for C−S cross‐coupling reactions. ChemPhotoChem. 5(8), 716–720.
mla: Reischauer, Susanne, and Bartholomäus Pieber. “Recyclable, Bifunctional Metallaphotocatalysts
for C−S Cross‐coupling Reactions.” ChemPhotoChem, vol. 5, no. 8, Wiley,
2021, pp. 716–20, doi:10.1002/cptc.202100062.
short: S. Reischauer, B. Pieber, ChemPhotoChem 5 (2021) 716–720.
date_created: 2022-08-25T08:31:11Z
date_published: 2021-08-01T00:00:00Z
date_updated: 2023-02-21T10:09:37Z
day: '01'
doi: 10.1002/cptc.202100062
extern: '1'
intvolume: ' 5'
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1002/cptc.202100062
month: '08'
oa: 1
oa_version: Published Version
page: 716-720
publication: ChemPhotoChem
publication_identifier:
eissn:
- 2367-0932
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Recyclable, bifunctional metallaphotocatalysts for C−S cross‐coupling reactions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2021'
...
---
_id: '11972'
abstract:
- lang: eng
text: Carbon dots have been previosly immobilized on titanium dioxide to generate
photocatalysts for pollutant degradation and water splitting. Here we demonstrate
that these nanocomposites are valuable photocatalysts for metallaphotocatalytic
carbon–heteroatom cross-couplings. These sustainable materials show a large applicability,
high photostability, excellent reusability, and broadly absorb across the visible-light
spectrum.
article_processing_charge: No
article_type: original
author:
- first_name: Zhouxiang
full_name: Zhao, Zhouxiang
last_name: Zhao
- first_name: Susanne
full_name: Reischauer, Susanne
last_name: Reischauer
- 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: Martina
full_name: Delbianco, Martina
last_name: Delbianco
citation:
ama: Zhao Z, Reischauer S, Pieber B, Delbianco M. Carbon dot/TiO₂ nanocomposites
as photocatalysts for metallaphotocatalytic carbon-heteroatom cross-couplings.
Green Chemistry. 2021;23(12):4524-4530. doi:10.1039/d1gc01284c
apa: Zhao, Z., Reischauer, S., Pieber, B., & Delbianco, M. (2021). Carbon dot/TiO₂
nanocomposites as photocatalysts for metallaphotocatalytic carbon-heteroatom cross-couplings.
Green Chemistry. Royal Society of Chemistry. https://doi.org/10.1039/d1gc01284c
chicago: Zhao, Zhouxiang, Susanne Reischauer, Bartholomäus Pieber, and Martina Delbianco.
“Carbon Dot/TiO₂ Nanocomposites as Photocatalysts for Metallaphotocatalytic Carbon-Heteroatom
Cross-Couplings.” Green Chemistry. Royal Society of Chemistry, 2021. https://doi.org/10.1039/d1gc01284c.
ieee: Z. Zhao, S. Reischauer, B. Pieber, and M. Delbianco, “Carbon dot/TiO₂ nanocomposites
as photocatalysts for metallaphotocatalytic carbon-heteroatom cross-couplings,”
Green Chemistry, vol. 23, no. 12. Royal Society of Chemistry, pp. 4524–4530,
2021.
ista: Zhao Z, Reischauer S, Pieber B, Delbianco M. 2021. Carbon dot/TiO₂ nanocomposites
as photocatalysts for metallaphotocatalytic carbon-heteroatom cross-couplings.
Green Chemistry. 23(12), 4524–4530.
mla: Zhao, Zhouxiang, et al. “Carbon Dot/TiO₂ Nanocomposites as Photocatalysts for
Metallaphotocatalytic Carbon-Heteroatom Cross-Couplings.” Green Chemistry,
vol. 23, no. 12, Royal Society of Chemistry, 2021, pp. 4524–30, doi:10.1039/d1gc01284c.
short: Z. Zhao, S. Reischauer, B. Pieber, M. Delbianco, Green Chemistry 23 (2021)
4524–4530.
date_created: 2022-08-25T10:25:46Z
date_published: 2021-06-21T00:00:00Z
date_updated: 2023-02-21T10:09:52Z
day: '21'
doi: 10.1039/d1gc01284c
extern: '1'
intvolume: ' 23'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1039/D1GC01284C
month: '06'
oa: 1
oa_version: Published Version
page: 4524-4530
publication: Green Chemistry
publication_identifier:
eissn:
- 1463-9270
issn:
- 1463-9262
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: Carbon dot/TiO₂ nanocomposites as photocatalysts for metallaphotocatalytic
carbon-heteroatom cross-couplings
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2021'
...
---
_id: '11974'
abstract:
- lang: eng
text: Visible light photocatalysis has become a powerful tool in organic synthesis
that uses photons as traceless, sustainable reagents. Most of the activities in
the field focus on the development of new reactions via common photoredox cycles,
but recently a number of exciting new concepts and strategies entered less charted
territories. We survey approaches that enable the use of longer wavelengths and
show that the wavelength and intensity of photons are import parameters that enable
tuning of the reactivity of a photocatalyst to control or change the selectivity
of chemical reactions. In addition, we discuss recent efforts to substitute strong
reductants, such as elemental lithium and sodium, by light and technological advances
in the field.
article_number: '102209'
article_processing_charge: No
article_type: review
author:
- first_name: Susanne
full_name: Reischauer, Susanne
last_name: Reischauer
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
citation:
ama: Reischauer S, Pieber B. Emerging concepts in photocatalytic organic synthesis.
iScience. 2021;24(3). doi:10.1016/j.isci.2021.102209
apa: Reischauer, S., & Pieber, B. (2021). Emerging concepts in photocatalytic
organic synthesis. IScience. Elsevier. https://doi.org/10.1016/j.isci.2021.102209
chicago: Reischauer, Susanne, and Bartholomäus Pieber. “Emerging Concepts in Photocatalytic
Organic Synthesis.” IScience. Elsevier, 2021. https://doi.org/10.1016/j.isci.2021.102209.
ieee: S. Reischauer and B. Pieber, “Emerging concepts in photocatalytic organic
synthesis,” iScience, vol. 24, no. 3. Elsevier, 2021.
ista: Reischauer S, Pieber B. 2021. Emerging concepts in photocatalytic organic
synthesis. iScience. 24(3), 102209.
mla: Reischauer, Susanne, and Bartholomäus Pieber. “Emerging Concepts in Photocatalytic
Organic Synthesis.” IScience, vol. 24, no. 3, 102209, Elsevier, 2021, doi:10.1016/j.isci.2021.102209.
short: S. Reischauer, B. Pieber, IScience 24 (2021).
date_created: 2022-08-25T10:31:44Z
date_published: 2021-03-19T00:00:00Z
date_updated: 2023-02-21T10:09:57Z
day: '19'
doi: 10.1016/j.isci.2021.102209
extern: '1'
intvolume: ' 24'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.isci.2021.102209
month: '03'
oa: 1
oa_version: Published Version
publication: iScience
publication_identifier:
eissn:
- 2589-0042
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Emerging concepts in photocatalytic organic synthesis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2021'
...
---
_id: '11981'
abstract:
- lang: eng
text: The cleavage of benzyl ethers by catalytic hydrogenolysis or Birch reduction
suffers from poor functional group compatibility and limits their use as a protecting
group. The visible-light-mediated debenzylation disclosed here renders benzyl
ethers temporary protective groups, enabling new orthogonal protection strategies.
Using 2,3-dichloro-5,6-dicyano-1,4-benzoquinone (DDQ) as a stoichiometric or catalytic
photooxidant, benzyl ethers can be cleaved in the presence of azides, alkenes,
and alkynes. The reaction time can be reduced from hours to minutes in continuous
flow.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Cristian
full_name: Cavedon, Cristian
last_name: Cavedon
- first_name: Eric T.
full_name: Sletten, Eric T.
last_name: Sletten
- first_name: Amiera
full_name: Madani, Amiera
last_name: Madani
- first_name: Olaf
full_name: Niemeyer, Olaf
last_name: Niemeyer
- first_name: Peter H.
full_name: Seeberger, Peter H.
last_name: Seeberger
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
citation:
ama: Cavedon C, Sletten ET, Madani A, Niemeyer O, Seeberger PH, Pieber B. Visible-light-mediated
oxidative debenzylation enables the use of benzyl ethers as temporary protecting
groups. Organic Letters. 2021;23(2):514-518. doi:10.1021/acs.orglett.0c04026
apa: Cavedon, C., Sletten, E. T., Madani, A., Niemeyer, O., Seeberger, P. H., &
Pieber, B. (2021). Visible-light-mediated oxidative debenzylation enables the
use of benzyl ethers as temporary protecting groups. Organic Letters. American
Chemical Society. https://doi.org/10.1021/acs.orglett.0c04026
chicago: Cavedon, Cristian, Eric T. Sletten, Amiera Madani, Olaf Niemeyer, Peter
H. Seeberger, and Bartholomäus Pieber. “Visible-Light-Mediated Oxidative Debenzylation
Enables the Use of Benzyl Ethers as Temporary Protecting Groups.” Organic Letters.
American Chemical Society, 2021. https://doi.org/10.1021/acs.orglett.0c04026.
ieee: C. Cavedon, E. T. Sletten, A. Madani, O. Niemeyer, P. H. Seeberger, and B.
Pieber, “Visible-light-mediated oxidative debenzylation enables the use of benzyl
ethers as temporary protecting groups,” Organic Letters, vol. 23, no. 2.
American Chemical Society, pp. 514–518, 2021.
ista: Cavedon C, Sletten ET, Madani A, Niemeyer O, Seeberger PH, Pieber B. 2021.
Visible-light-mediated oxidative debenzylation enables the use of benzyl ethers
as temporary protecting groups. Organic Letters. 23(2), 514–518.
mla: Cavedon, Cristian, et al. “Visible-Light-Mediated Oxidative Debenzylation Enables
the Use of Benzyl Ethers as Temporary Protecting Groups.” Organic Letters,
vol. 23, no. 2, American Chemical Society, 2021, pp. 514–18, doi:10.1021/acs.orglett.0c04026.
short: C. Cavedon, E.T. Sletten, A. Madani, O. Niemeyer, P.H. Seeberger, B. Pieber,
Organic Letters 23 (2021) 514–518.
date_created: 2022-08-25T11:13:05Z
date_published: 2021-01-15T00:00:00Z
date_updated: 2023-02-21T10:10:16Z
day: '15'
doi: 10.1021/acs.orglett.0c04026
extern: '1'
external_id:
pmid:
- '33400534'
intvolume: ' 23'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1021/acs.orglett.0c04026
month: '01'
oa: 1
oa_version: Published Version
page: 514-518
pmid: 1
publication: Organic Letters
publication_identifier:
eissn:
- 1523-7052
issn:
- 1523-7060
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Visible-light-mediated oxidative debenzylation enables the use of benzyl ethers
as temporary protecting groups
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2021'
...
---
_id: '12068'
abstract:
- lang: eng
text: Metallaphotocatalysis typically requires a photocatalyst to harness the energy
of visible-light and transfer it to a transition metal catalyst to trigger chemical
reactions. The most prominent example is the merger of photo- and nickel catalysis
that unlocked various cross-couplings. However, the high reactivity of excited
photocatalyst can lead to unwanted side reactions thus limiting this approach.
Here we show that a bipyridine ligand that is subtly decorated with two carbazole
groups forms a nickel complex that absorbs visible-light and promotes several
carbon–heteroatom cross-couplings in the absence of an exogenous photocatalysts.
The ligand can be polymerized in a simple one-step procedure to afford a porous
organic polymer that can be used for heterogeneous nickel catalysis in the same
reactions. The material can be easily recovered and reused multiple times maintaining
high catalytic activity and selectivity.
article_processing_charge: No
author:
- first_name: Cristian
full_name: Cavedon, Cristian
last_name: Cavedon
- first_name: Sebastian
full_name: Gisbertz, Sebastian
last_name: Gisbertz
- first_name: Sarah
full_name: Vogl, Sarah
last_name: Vogl
- first_name: Noah
full_name: Richter, Noah
last_name: Richter
- first_name: Stefanie
full_name: Schrottke, Stefanie
last_name: Schrottke
- first_name: Christian
full_name: Teutloff, Christian
last_name: Teutloff
- first_name: Peter H.
full_name: Seeberger, Peter H.
last_name: Seeberger
- first_name: Arne
full_name: Thomas, Arne
last_name: Thomas
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
citation:
ama: Cavedon C, Gisbertz S, Vogl S, et al. Photocatalyst-free, visible-light-mediated
nickel catalyzed carbon–heteroatom cross-couplings. doi:10.26434/chemrxiv-2021-kt2wr
apa: Cavedon, C., Gisbertz, S., Vogl, S., Richter, N., Schrottke, S., Teutloff,
C., … Pieber, B. (n.d.). Photocatalyst-free, visible-light-mediated nickel catalyzed
carbon–heteroatom cross-couplings. ChemRxiv. https://doi.org/10.26434/chemrxiv-2021-kt2wr
chicago: Cavedon, Cristian, Sebastian Gisbertz, Sarah Vogl, Noah Richter, Stefanie
Schrottke, Christian Teutloff, Peter H. Seeberger, Arne Thomas, and Bartholomäus
Pieber. “Photocatalyst-Free, Visible-Light-Mediated Nickel Catalyzed Carbon–Heteroatom
Cross-Couplings.” ChemRxiv, n.d. https://doi.org/10.26434/chemrxiv-2021-kt2wr.
ieee: C. Cavedon et al., “Photocatalyst-free, visible-light-mediated nickel
catalyzed carbon–heteroatom cross-couplings.” ChemRxiv.
ista: Cavedon C, Gisbertz S, Vogl S, Richter N, Schrottke S, Teutloff C, Seeberger
PH, Thomas A, Pieber B. Photocatalyst-free, visible-light-mediated nickel catalyzed
carbon–heteroatom cross-couplings. 10.26434/chemrxiv-2021-kt2wr.
mla: Cavedon, Cristian, et al. Photocatalyst-Free, Visible-Light-Mediated Nickel
Catalyzed Carbon–Heteroatom Cross-Couplings. ChemRxiv, doi:10.26434/chemrxiv-2021-kt2wr.
short: C. Cavedon, S. Gisbertz, S. Vogl, N. Richter, S. Schrottke, C. Teutloff,
P.H. Seeberger, A. Thomas, B. Pieber, (n.d.).
date_created: 2022-09-08T11:42:02Z
date_published: 2021-08-04T00:00:00Z
date_updated: 2022-09-08T11:44:01Z
day: '04'
doi: 10.26434/chemrxiv-2021-kt2wr
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.26434/chemrxiv-2021-kt2wr
month: '08'
oa: 1
oa_version: Preprint
publication_status: submitted
publisher: ChemRxiv
status: public
title: Photocatalyst-free, visible-light-mediated nickel catalyzed carbon–heteroatom
cross-couplings
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '12070'
abstract:
- lang: eng
text: Controlling the selectivity of a chemical reaction with external stimuli is
common in thermal processes, but rare in visible-light photocatalysis. Here we
show that the redox potential of a carbon nitride photocatalyst (CN-OA-m) can
be tuned by changing the irradiation wavelength to generate electron holes with
different oxidation potentials. This tuning was the key to realizing photo-chemo-enzymatic
cascades that give either the (S)- or the (R)-enantiomer of phenylethanol. In
combination with an unspecific peroxygenase from Agrocybe aegerita, green light
irradiation of CN-OA-m led to the enantioselective hydroxylation of ethylbenzene
to (R)-1-phenylethanol (99% ee). In contrast, blue light irradiation triggered
the photocatalytic oxidation of ethylbenzene to acetophenone, which in turn was
enantioselectively reduced with an alcohol dehydrogenase from Rhodococcus ruber
to form (S)-1-phenylethanol (93% ee).
article_processing_charge: No
author:
- first_name: Luca
full_name: Schmermund, Luca
last_name: Schmermund
- first_name: Susanne
full_name: Reischauer, Susanne
last_name: Reischauer
- first_name: Sarah
full_name: Bierbaumer, Sarah
last_name: Bierbaumer
- first_name: Christoph
full_name: Winkler, Christoph
last_name: Winkler
- first_name: Alba
full_name: Diaz-Rodriguez, Alba
last_name: Diaz-Rodriguez
- first_name: Lee J.
full_name: Edwards, Lee J.
last_name: Edwards
- first_name: Selin
full_name: Kara, Selin
last_name: Kara
- first_name: Tamara
full_name: Mielke, Tamara
last_name: Mielke
- first_name: Jared
full_name: Cartwright, Jared
last_name: Cartwright
- first_name: Gideon
full_name: Grogan, Gideon
last_name: Grogan
- 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: Wolfgang
full_name: Kroutil, Wolfgang
last_name: Kroutil
citation:
ama: Schmermund L, Reischauer S, Bierbaumer S, et al. Switching between enantiomers
by combining chromoselective photocatalysis and biocatalysis. doi:10.26434/chemrxiv.13521527
apa: Schmermund, L., Reischauer, S., Bierbaumer, S., Winkler, C., Diaz-Rodriguez,
A., Edwards, L. J., … Kroutil, W. (n.d.). Switching between enantiomers by combining
chromoselective photocatalysis and biocatalysis. ChemRxiv. https://doi.org/10.26434/chemrxiv.13521527
chicago: Schmermund, Luca, Susanne Reischauer, Sarah Bierbaumer, Christoph Winkler,
Alba Diaz-Rodriguez, Lee J. Edwards, Selin Kara, et al. “Switching between Enantiomers
by Combining Chromoselective Photocatalysis and Biocatalysis.” ChemRxiv, n.d.
https://doi.org/10.26434/chemrxiv.13521527.
ieee: L. Schmermund et al., “Switching between enantiomers by combining chromoselective
photocatalysis and biocatalysis.” ChemRxiv.
ista: Schmermund L, Reischauer S, Bierbaumer S, Winkler C, Diaz-Rodriguez A, Edwards
LJ, Kara S, Mielke T, Cartwright J, Grogan G, Pieber B, Kroutil W. Switching between
enantiomers by combining chromoselective photocatalysis and biocatalysis. 10.26434/chemrxiv.13521527.
mla: Schmermund, Luca, et al. Switching between Enantiomers by Combining Chromoselective
Photocatalysis and Biocatalysis. ChemRxiv, doi:10.26434/chemrxiv.13521527.
short: L. Schmermund, S. Reischauer, S. Bierbaumer, C. Winkler, A. Diaz-Rodriguez,
L.J. Edwards, S. Kara, T. Mielke, J. Cartwright, G. Grogan, B. Pieber, W. Kroutil,
(n.d.).
date_created: 2022-09-08T11:46:45Z
date_published: 2021-01-06T00:00:00Z
date_updated: 2022-09-08T11:49:16Z
day: '06'
doi: 10.26434/chemrxiv.13521527
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.26434/chemrxiv.13521527
month: '01'
oa: 1
oa_version: Preprint
publication_status: submitted
publisher: ChemRxiv
status: public
title: Switching between enantiomers by combining chromoselective photocatalysis and
biocatalysis
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '12071'
abstract:
- lang: eng
text: Despite many efforts to rationalize the strongly correlated electronic ground
states in doped Mott insulators, the nature of the doping-induced insulator-to-metal
transition is still a subject under intensive investigation. Here, we probe the
nanoscale electronic structure of the Mott insulator Sr₂IrO₄δ with low-temperature
scanning tunneling microscopy and find an enhanced local density of states (LDOS)
inside the Mott gap at the location of individual defects which we interpret as
defects at apical oxygen sites. A chiral behavior in the topography for those
defects has been observed. We also visualize the local enhanced conductance arising
from the overlapping of defect states which induces finite LDOS inside of the
Mott gap. By combining these findings with the typical spatial extension of isolated
defects of about 2 nm, our results indicate that the insulator-to-metal transition
in Sr₂IrO₄−δ could be percolative in nature.
article_number: '023075'
article_processing_charge: No
article_type: original
author:
- first_name: Zhixiang
full_name: Sun, Zhixiang
last_name: Sun
- first_name: Jose M.
full_name: Guevara, Jose M.
last_name: Guevara
- first_name: Steffen
full_name: Sykora, Steffen
last_name: Sykora
- first_name: Ekaterina
full_name: Paerschke, Ekaterina
id: 8275014E-6063-11E9-9B7F-6338E6697425
last_name: Paerschke
orcid: 0000-0003-0853-8182
- first_name: Kaustuv
full_name: Manna, Kaustuv
last_name: Manna
- first_name: Andrey
full_name: Maljuk, Andrey
last_name: Maljuk
- first_name: Sabine
full_name: Wurmehl, Sabine
last_name: Wurmehl
- first_name: Jeroen
full_name: van den Brink, Jeroen
last_name: van den Brink
- first_name: Bernd
full_name: Büchner, Bernd
last_name: Büchner
- first_name: Christian
full_name: Hess, Christian
last_name: Hess
citation:
ama: Sun Z, Guevara JM, Sykora S, et al. Evidence for a percolative Mott insulator-metal
transition in doped Sr₂IrO₄. Physical Review Research. 2021;3(2). doi:10.1103/physrevresearch.3.023075
apa: Sun, Z., Guevara, J. M., Sykora, S., Paerschke, E., Manna, K., Maljuk, A.,
… Hess, C. (2021). Evidence for a percolative Mott insulator-metal transition
in doped Sr₂IrO₄. Physical Review Research. American Physical Society.
https://doi.org/10.1103/physrevresearch.3.023075
chicago: Sun, Zhixiang, Jose M. Guevara, Steffen Sykora, Ekaterina Paerschke, Kaustuv
Manna, Andrey Maljuk, Sabine Wurmehl, Jeroen van den Brink, Bernd Büchner, and
Christian Hess. “Evidence for a Percolative Mott Insulator-Metal Transition in
Doped Sr₂IrO₄.” Physical Review Research. American Physical Society, 2021.
https://doi.org/10.1103/physrevresearch.3.023075.
ieee: Z. Sun et al., “Evidence for a percolative Mott insulator-metal transition
in doped Sr₂IrO₄,” Physical Review Research, vol. 3, no. 2. American Physical
Society, 2021.
ista: Sun Z, Guevara JM, Sykora S, Paerschke E, Manna K, Maljuk A, Wurmehl S, van
den Brink J, Büchner B, Hess C. 2021. Evidence for a percolative Mott insulator-metal
transition in doped Sr₂IrO₄. Physical Review Research. 3(2), 023075.
mla: Sun, Zhixiang, et al. “Evidence for a Percolative Mott Insulator-Metal Transition
in Doped Sr₂IrO₄.” Physical Review Research, vol. 3, no. 2, 023075, American
Physical Society, 2021, doi:10.1103/physrevresearch.3.023075.
short: Z. Sun, J.M. Guevara, S. Sykora, E. Paerschke, K. Manna, A. Maljuk, S. Wurmehl,
J. van den Brink, B. Büchner, C. Hess, Physical Review Research 3 (2021).
date_created: 2022-09-08T15:01:16Z
date_published: 2021-04-27T00:00:00Z
date_updated: 2022-09-09T07:26:01Z
day: '27'
ddc:
- '530'
doi: 10.1103/physrevresearch.3.023075
extern: '1'
file:
- access_level: open_access
checksum: 73f1331b9716295849e87a7d3acd9323
content_type: application/pdf
creator: dernst
date_created: 2022-09-09T07:23:40Z
date_updated: 2022-09-09T07:23:40Z
file_id: '12075'
file_name: 2021_PhysicalRevResearch_Sun.pdf
file_size: 4020901
relation: main_file
success: 1
file_date_updated: 2022-09-09T07:23:40Z
has_accepted_license: '1'
intvolume: ' 3'
issue: '2'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
publication: Physical Review Research
publication_identifier:
issn:
- 2643-1564
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evidence for a percolative Mott insulator-metal transition in doped Sr₂IrO₄
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: 3
year: '2021'
...
---
_id: '12076'
abstract:
- lang: eng
text: We find an asymptotic formula for the number of primitive vectors $(z_1,\ldots,z_4)\in
(\mathbb{Z}_{\neq 0})^4$ such that $z_1,\ldots, z_4$ are all squareful and bounded
by $B$, and $z_1+\cdots + z_4 = 0$. Our result agrees in the power of $B$ and
$\log B$ with the Campana-Manin conjecture of Pieropan, Smeets, Tanimoto and V\'{a}rilly-Alvarado.
article_number: '2104.06966'
article_processing_charge: No
arxiv: 1
author:
- first_name: Alec L
full_name: Shute, Alec L
id: 440EB050-F248-11E8-B48F-1D18A9856A87
last_name: Shute
orcid: 0000-0002-1812-2810
citation:
ama: Shute AL. Sums of four squareful numbers. arXiv. doi:10.48550/arXiv.2104.06966
apa: Shute, A. L. (n.d.). Sums of four squareful numbers. arXiv. https://doi.org/10.48550/arXiv.2104.06966
chicago: Shute, Alec L. “Sums of Four Squareful Numbers.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2104.06966.
ieee: A. L. Shute, “Sums of four squareful numbers,” arXiv. .
ista: Shute AL. Sums of four squareful numbers. arXiv, 2104.06966.
mla: Shute, Alec L. “Sums of Four Squareful Numbers.” ArXiv, 2104.06966,
doi:10.48550/arXiv.2104.06966.
short: A.L. Shute, ArXiv (n.d.).
date_created: 2022-09-09T10:42:51Z
date_published: 2021-04-15T00:00:00Z
date_updated: 2023-02-21T16:37:30Z
day: '15'
department:
- _id: TiBr
doi: 10.48550/arXiv.2104.06966
external_id:
arxiv:
- '2104.06966'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2104.06966
month: '04'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '12072'
relation: dissertation_contains
status: public
status: public
title: Sums of four squareful numbers
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '12077'
abstract:
- lang: eng
text: "We compare the Manin-type conjecture for Campana points recently formulated\r\nby
Pieropan, Smeets, Tanimoto and V\\'{a}rilly-Alvarado with an alternative\r\nprediction
of Browning and Van Valckenborgh in the special case of the orbifold\r\n$(\\mathbb{P}^1,D)$,
where $D =\\frac{1}{2}[0]+\\frac{1}{2}[1]+\\frac{1}{2}[\\infty]$. We find that
the two predicted leading constants do not agree, and we discuss whether thin
sets\r\ncould explain this discrepancy. Motivated by this, we provide a counterexample\r\nto
the Manin-type conjecture for Campana points, by considering orbifolds\r\ncorresponding
to squareful values of binary quadratic forms."
acknowledgement: The author would like to thank Damaris Schindler and Florian Wilsch
for their helpful comments on the heights and Tamagawa measures used in Section
3, together with Marta Pieropan, Sho Tanimoto and Sam Streeter for providing valuable
feedback on an earlier version of this paper, and Tim Browning for many useful comments
and discussions during the development of this work. The author is also grateful
to the anonymous referee for providing many valuable comments and suggestions that
improved the quality of the paper.
article_number: '2104.14946'
article_processing_charge: No
arxiv: 1
author:
- first_name: Alec L
full_name: Shute, Alec L
id: 440EB050-F248-11E8-B48F-1D18A9856A87
last_name: Shute
orcid: 0000-0002-1812-2810
citation:
ama: Shute AL. On the leading constant in the Manin-type conjecture for Campana
points. arXiv. doi:10.48550/arXiv.2104.14946
apa: Shute, A. L. (n.d.). On the leading constant in the Manin-type conjecture for
Campana points. arXiv. https://doi.org/10.48550/arXiv.2104.14946
chicago: Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for
Campana Points.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2104.14946.
ieee: A. L. Shute, “On the leading constant in the Manin-type conjecture for Campana
points,” arXiv. .
ista: Shute AL. On the leading constant in the Manin-type conjecture for Campana
points. arXiv, 2104.14946.
mla: Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for Campana
Points.” ArXiv, 2104.14946, doi:10.48550/arXiv.2104.14946.
short: A.L. Shute, ArXiv (n.d.).
date_created: 2022-09-09T10:43:17Z
date_published: 2021-04-30T00:00:00Z
date_updated: 2023-02-21T16:37:30Z
day: '30'
department:
- _id: TiBr
doi: 10.48550/arXiv.2104.14946
external_id:
arxiv:
- '2104.14946'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2104.14946
month: '04'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '12072'
relation: dissertation_contains
status: public
status: public
title: On the leading constant in the Manin-type conjecture for Campana points
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '12188'
abstract:
- lang: eng
text: Molecular mechanisms enabling the switching and maintenance of epigenetic
states are not fully understood. Distinct histone modifications are often associated
with ON/OFF epigenetic states, but how these states are stably maintained through
DNA replication, yet in certain situations switch from one to another remains
unclear. Here, we address this problem through identification of Arabidopsis INCURVATA11
(ICU11) as a Polycomb Repressive Complex 2 accessory protein. ICU11 robustly immunoprecipitated
in vivo with PRC2 core components and the accessory proteins, EMBRYONIC FLOWER
1 (EMF1), LIKE HETEROCHROMATIN PROTEIN1 (LHP1), and TELOMERE_REPEAT_BINDING FACTORS
(TRBs). ICU11 encodes a 2-oxoglutarate-dependent dioxygenase, an activity associated
with histone demethylation in other organisms, and mutant plants show defects
in multiple aspects of the Arabidopsis epigenome. To investigate its primary molecular
function we identified the Arabidopsis FLOWERING LOCUS C (FLC) as a direct target
and found icu11 disrupted the cold-induced, Polycomb-mediated silencing underlying
vernalization. icu11 prevented reduction in H3K36me3 levels normally seen during
the early cold phase, supporting a role for ICU11 in H3K36me3 demethylation. This
was coincident with an attenuation of H3K27me3 at the internal nucleation site
in FLC, and reduction in H3K27me3 levels across the body of the gene after plants
were returned to the warm. Thus, ICU11 is required for the cold-induced epigenetic
switching between the mutually exclusive chromatin states at FLC, from the active
H3K36me3 state to the silenced H3K27me3 state. These data support the importance
of physical coupling of histone modification activities to promote epigenetic
switching between opposing chromatin states.
acknowledgement: We would like to thank Scott Berry for help with ICU-GFP nuclear
localization microscopy, Hao Yu and Lisha Shen for assistance with 6mA DNA methylation
analysis, Donna Gibson for graphic design assistance, and members of the C.D. and
Howard laboratories for helpful discussions. This work was funded by the European
Research Council grants to “MEXTIM” (to C.D.) and “SexMeth” (to X. Feng), by the
Biotechnological and Biological Sciences Research Council (BBSRC) Institute Strategic
Programmes GRO (BB/J004588/1), GEN (BB/P013511/1), BBSRC grant (to X. Feng) (BB/S009620/1),
and the Marie Sklodowska–Curie Postdoctoral Fellowships “UNRAVEL” (to R.H.B.) and
"WISDOM" (to X. Fang). Additional funding via the Wellcome Trust through a Senior
Research Fellowship (to J.R.) (103139) and a multiuser equipment grant (108504).
The Wellcome Centre for Cell Biology is supported by core funding from the Wellcome
Trust (203149).
article_processing_charge: No
article_type: original
author:
- first_name: Rebecca H.
full_name: Bloomer, Rebecca H.
last_name: Bloomer
- first_name: Claire E.
full_name: Hutchison, Claire E.
last_name: Hutchison
- first_name: Isabel
full_name: Bäurle, Isabel
last_name: Bäurle
- first_name: James
full_name: Walker, James
last_name: Walker
- first_name: Xiaofeng
full_name: Fang, Xiaofeng
last_name: Fang
- first_name: Pumi
full_name: Perera, Pumi
last_name: Perera
- first_name: Christos N.
full_name: Velanis, Christos N.
last_name: Velanis
- first_name: Serin
full_name: Gümüs, Serin
last_name: Gümüs
- first_name: Christos
full_name: Spanos, Christos
last_name: Spanos
- first_name: Juri
full_name: Rappsilber, Juri
last_name: Rappsilber
- first_name: Xiaoqi
full_name: Feng, Xiaoqi
id: e0164712-22ee-11ed-b12a-d80fcdf35958
last_name: Feng
orcid: 0000-0002-4008-1234
- first_name: Justin
full_name: Goodrich, Justin
last_name: Goodrich
- first_name: Caroline
full_name: Dean, Caroline
last_name: Dean
citation:
ama: Bloomer RH, Hutchison CE, Bäurle I, et al. The Arabidopsis epigenetic regulator
ICU11 as an accessory protein of polycomb repressive complex 2. Proceedings
of the National Academy of Sciences. 2020;117(28):16660-16666. doi:10.1073/pnas.1920621117
apa: Bloomer, R. H., Hutchison, C. E., Bäurle, I., Walker, J., Fang, X., Perera,
P., … Dean, C. (2020). The Arabidopsis epigenetic regulator ICU11 as an accessory
protein of polycomb repressive complex 2. Proceedings of the National Academy
of Sciences. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1920621117
chicago: Bloomer, Rebecca H., Claire E. Hutchison, Isabel Bäurle, James Walker,
Xiaofeng Fang, Pumi Perera, Christos N. Velanis, et al. “The Arabidopsis Epigenetic
Regulator ICU11 as an Accessory Protein of Polycomb Repressive Complex 2.” Proceedings
of the National Academy of Sciences. Proceedings of the National Academy of
Sciences, 2020. https://doi.org/10.1073/pnas.1920621117.
ieee: R. H. Bloomer et al., “The Arabidopsis epigenetic regulator ICU11
as an accessory protein of polycomb repressive complex 2,” Proceedings of the
National Academy of Sciences, vol. 117, no. 28. Proceedings of the National
Academy of Sciences, pp. 16660–16666, 2020.
ista: Bloomer RH, Hutchison CE, Bäurle I, Walker J, Fang X, Perera P, Velanis CN,
Gümüs S, Spanos C, Rappsilber J, Feng X, Goodrich J, Dean C. 2020. The Arabidopsis
epigenetic regulator ICU11 as an accessory protein of polycomb repressive complex
2. Proceedings of the National Academy of Sciences. 117(28), 16660–16666.
mla: Bloomer, Rebecca H., et al. “The Arabidopsis Epigenetic Regulator ICU11 as
an Accessory Protein of Polycomb Repressive Complex 2.” Proceedings of the
National Academy of Sciences, vol. 117, no. 28, Proceedings of the National
Academy of Sciences, 2020, pp. 16660–66, doi:10.1073/pnas.1920621117.
short: R.H. Bloomer, C.E. Hutchison, I. Bäurle, J. Walker, X. Fang, P. Perera, C.N.
Velanis, S. Gümüs, C. Spanos, J. Rappsilber, X. Feng, J. Goodrich, C. Dean, Proceedings
of the National Academy of Sciences 117 (2020) 16660–16666.
date_created: 2023-01-16T09:15:44Z
date_published: 2020-05-22T00:00:00Z
date_updated: 2023-05-08T10:53:55Z
day: '22'
ddc:
- '580'
department:
- _id: XiFe
doi: 10.1073/pnas.1920621117
extern: '1'
external_id:
pmid:
- '32601198'
file:
- access_level: open_access
checksum: cedee184cb12f454f2fba4158ff47db9
content_type: application/pdf
creator: alisjak
date_created: 2023-02-07T11:29:55Z
date_updated: 2023-02-07T11:29:55Z
file_id: '12526'
file_name: 2020_PNAS_Bloomer.pdf
file_size: 1105414
relation: main_file
success: 1
file_date_updated: 2023-02-07T11:29:55Z
has_accepted_license: '1'
intvolume: ' 117'
issue: '28'
keyword:
- Multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7368280/
month: '05'
oa: 1
oa_version: Published Version
page: 16660-16666
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
issn:
- 0027-8424
- 1091-6490
publication_status: published
publisher: Proceedings of the National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Arabidopsis epigenetic regulator ICU11 as an accessory protein of polycomb
repressive complex 2
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: 117
year: '2020'
...
---
_id: '12189'
abstract:
- lang: eng
text: Meiotic crossovers (COs) are important for reshuffling genetic information
between homologous chromosomes and they are essential for their correct segregation.
COs are unevenly distributed along chromosomes and the underlying mechanisms controlling
CO localization are not well understood. We previously showed that meiotic COs
are mis-localized in the absence of AXR1, an enzyme involved in the neddylation/rubylation
protein modification pathway in Arabidopsis thaliana. Here, we report that in
axr1-/-, male meiocytes show a strong defect in chromosome pairing whereas the
formation of the telomere bouquet is not affected. COs are also redistributed
towards subtelomeric chromosomal ends where they frequently form clusters, in
contrast to large central regions depleted in recombination. The CO suppressed
regions correlate with DNA hypermethylation of transposable elements (TEs) in
the CHH context in axr1-/- meiocytes. Through examining somatic methylomes, we
found axr1-/- affects DNA methylation in a plant, causing hypermethylation in
all sequence contexts (CG, CHG and CHH) in TEs. Impairment of the main pathways
involved in DNA methylation is epistatic over axr1-/- for DNA methylation in somatic
cells but does not restore regular chromosome segregation during meiosis. Collectively,
our findings reveal that the neddylation pathway not only regulates hormonal perception
and CO distribution but is also, directly or indirectly, a major limiting pathway
of TE DNA methylation in somatic cells.
acknowledgement: The authors wish to thank Cécile Raynaud, Eric Jenczewski, Rajeev
Kumar, Raphaël Mercier and Jean Molinier for critical reading of the manuscript.
article_number: e1008894
article_processing_charge: No
article_type: original
author:
- first_name: Nicolas
full_name: Christophorou, Nicolas
last_name: Christophorou
- first_name: Wenjing
full_name: She, Wenjing
last_name: She
- first_name: Jincheng
full_name: Long, Jincheng
last_name: Long
- first_name: Aurélie
full_name: Hurel, Aurélie
last_name: Hurel
- first_name: Sébastien
full_name: Beaubiat, Sébastien
last_name: Beaubiat
- first_name: Yassir
full_name: Idir, Yassir
last_name: Idir
- first_name: Marina
full_name: Tagliaro-Jahns, Marina
last_name: Tagliaro-Jahns
- first_name: Aurélie
full_name: Chambon, Aurélie
last_name: Chambon
- first_name: Victor
full_name: Solier, Victor
last_name: Solier
- first_name: Daniel
full_name: Vezon, Daniel
last_name: Vezon
- first_name: Mathilde
full_name: Grelon, Mathilde
last_name: Grelon
- first_name: Xiaoqi
full_name: Feng, Xiaoqi
id: e0164712-22ee-11ed-b12a-d80fcdf35958
last_name: Feng
orcid: 0000-0002-4008-1234
- first_name: Nicolas
full_name: Bouché, Nicolas
last_name: Bouché
- first_name: Christine
full_name: Mézard, Christine
last_name: Mézard
citation:
ama: Christophorou N, She W, Long J, et al. AXR1 affects DNA methylation independently
of its role in regulating meiotic crossover localization. PLOS Genetics.
2020;16(6). doi:10.1371/journal.pgen.1008894
apa: Christophorou, N., She, W., Long, J., Hurel, A., Beaubiat, S., Idir, Y., …
Mézard, C. (2020). AXR1 affects DNA methylation independently of its role in regulating
meiotic crossover localization. PLOS Genetics. Public Library of Science
(PLoS). https://doi.org/10.1371/journal.pgen.1008894
chicago: Christophorou, Nicolas, Wenjing She, Jincheng Long, Aurélie Hurel, Sébastien
Beaubiat, Yassir Idir, Marina Tagliaro-Jahns, et al. “AXR1 Affects DNA Methylation
Independently of Its Role in Regulating Meiotic Crossover Localization.” PLOS
Genetics. Public Library of Science (PLoS), 2020. https://doi.org/10.1371/journal.pgen.1008894.
ieee: N. Christophorou et al., “AXR1 affects DNA methylation independently
of its role in regulating meiotic crossover localization,” PLOS Genetics,
vol. 16, no. 6. Public Library of Science (PLoS), 2020.
ista: Christophorou N, She W, Long J, Hurel A, Beaubiat S, Idir Y, Tagliaro-Jahns
M, Chambon A, Solier V, Vezon D, Grelon M, Feng X, Bouché N, Mézard C. 2020. AXR1
affects DNA methylation independently of its role in regulating meiotic crossover
localization. PLOS Genetics. 16(6), e1008894.
mla: Christophorou, Nicolas, et al. “AXR1 Affects DNA Methylation Independently
of Its Role in Regulating Meiotic Crossover Localization.” PLOS Genetics,
vol. 16, no. 6, e1008894, Public Library of Science (PLoS), 2020, doi:10.1371/journal.pgen.1008894.
short: N. Christophorou, W. She, J. Long, A. Hurel, S. Beaubiat, Y. Idir, M. Tagliaro-Jahns,
A. Chambon, V. Solier, D. Vezon, M. Grelon, X. Feng, N. Bouché, C. Mézard, PLOS
Genetics 16 (2020).
date_created: 2023-01-16T09:16:10Z
date_published: 2020-06-29T00:00:00Z
date_updated: 2023-05-08T10:54:39Z
day: '29'
department:
- _id: XiFe
doi: 10.1371/journal.pgen.1008894
extern: '1'
external_id:
pmid:
- '32598340'
intvolume: ' 16'
issue: '6'
keyword:
- Cancer Research
- Genetics (clinical)
- Genetics
- Molecular Biology
- Ecology
- Evolution
- Behavior and Systematics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7351236/
month: '06'
oa: 1
oa_version: Published Version
pmid: 1
publication: PLOS Genetics
publication_identifier:
issn:
- 1553-7404
publication_status: published
publisher: Public Library of Science (PLoS)
quality_controlled: '1'
scopus_import: '1'
status: public
title: AXR1 affects DNA methylation independently of its role in regulating meiotic
crossover localization
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2020'
...
---
_id: '12310'
abstract:
- lang: eng
text: Let be a sequence of points on an elliptic curve defined over a number field
K. In this paper, we study the denominators of the x-coordinates of this sequence.
We prove that, if Q is a torsion point of prime order, then for n large enough
there always exists a primitive divisor. Later on, we show the link between the
study of the primitive divisors and a Lang-Trotter conjecture. Indeed, given two
points P and Q on the elliptic curve, we prove a lower bound for the number of
primes p such that P is in the orbit of Q modulo p.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Matteo
full_name: Verzobio, Matteo
id: 7aa8f170-131e-11ed-88e1-a9efd01027cb
last_name: Verzobio
orcid: 0000-0002-0854-0306
citation:
ama: Verzobio M. Primitive divisors of sequences associated to elliptic curves.
Journal of Number Theory. 2020;209(4):378-390. doi:10.1016/j.jnt.2019.09.003
apa: Verzobio, M. (2020). Primitive divisors of sequences associated to elliptic
curves. Journal of Number Theory. Elsevier. https://doi.org/10.1016/j.jnt.2019.09.003
chicago: Verzobio, Matteo. “Primitive Divisors of Sequences Associated to Elliptic
Curves.” Journal of Number Theory. Elsevier, 2020. https://doi.org/10.1016/j.jnt.2019.09.003.
ieee: M. Verzobio, “Primitive divisors of sequences associated to elliptic curves,”
Journal of Number Theory, vol. 209, no. 4. Elsevier, pp. 378–390, 2020.
ista: Verzobio M. 2020. Primitive divisors of sequences associated to elliptic curves.
Journal of Number Theory. 209(4), 378–390.
mla: Verzobio, Matteo. “Primitive Divisors of Sequences Associated to Elliptic Curves.”
Journal of Number Theory, vol. 209, no. 4, Elsevier, 2020, pp. 378–90,
doi:10.1016/j.jnt.2019.09.003.
short: M. Verzobio, Journal of Number Theory 209 (2020) 378–390.
date_created: 2023-01-16T11:45:07Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2023-05-10T11:14:56Z
day: '01'
doi: 10.1016/j.jnt.2019.09.003
extern: '1'
external_id:
arxiv:
- '1906.00632'
intvolume: ' 209'
issue: '4'
keyword:
- Algebra and Number Theory
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1906.00632
month: '04'
oa: 1
oa_version: Preprint
page: 378-390
publication: Journal of Number Theory
publication_identifier:
issn:
- 0022-314X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Primitive divisors of sequences associated to elliptic curves
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 209
year: '2020'
...
---
_id: '12594'
abstract:
- lang: eng
text: Information about end-of-winter spatial distribution of snow depth is important
for seasonal forecasts of spring/summer streamflow in high-mountain regions. Nevertheless,
such information typically relies upon extrapolation from a sparse network of
observations at low elevations. Here, we test the potential of high-resolution
snow depth data derived from optical stereophotogrammetry of Pléiades satellites
for improving the representation of snow depth initial conditions (SDICs) in a
glacio-hydrological model and assess potential improvements in the skill of snowmelt
and streamflow simulations in a high-elevation Andean catchment. We calibrate
model parameters controlling glacier mass balance and snow cover evolution using
ground-based and satellite observations, and consider the relative importance
of accurate estimates of SDICs compared to model parameters and forcings. We find
that Pléiades SDICs improve the simulation of snow-covered area, glacier mass
balance, and monthly streamflow compared to alternative SDICs based upon extrapolation
of meteorological variables or statistical methods to estimate SDICs based upon
topography. Model simulations are found to be sensitive to SDICs in the early
spring (up to 48% variability in modeled streamflow compared to the best estimate
model), and to temperature gradients in all months that control albedo and melt
rates over a large elevation range (>2,400 m). As such, appropriately characterizing
the distribution of total snow volume with elevation is important for reproducing
total streamflow and the proportions of snowmelt. Therefore, optical stereo-photogrammetry
offers an advantage for obtaining SDICs that aid both the timing and magnitude
of streamflow simulations, process representation (e.g., snow cover evolution)
and has the potential for large spatial domains.
article_number: e2020WR027188
article_processing_charge: No
article_type: original
author:
- first_name: Thomas E.
full_name: Shaw, Thomas E.
last_name: Shaw
- first_name: Alexis
full_name: Caro, Alexis
last_name: Caro
- first_name: Pablo
full_name: Mendoza, Pablo
last_name: Mendoza
- first_name: Álvaro
full_name: Ayala, Álvaro
last_name: Ayala
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
- first_name: Simon
full_name: Gascoin, Simon
last_name: Gascoin
- first_name: James
full_name: McPhee, James
last_name: McPhee
citation:
ama: Shaw TE, Caro A, Mendoza P, et al. The utility of optical satellite winter
snow depths for initializing a glacio‐hydrological model of a High‐Elevation,
Andean catchment. Water Resources Research. 2020;56(8). doi:10.1029/2020wr027188
apa: Shaw, T. E., Caro, A., Mendoza, P., Ayala, Á., Pellicciotti, F., Gascoin, S.,
& McPhee, J. (2020). The utility of optical satellite winter snow depths for
initializing a glacio‐hydrological model of a High‐Elevation, Andean catchment.
Water Resources Research. American Geophysical Union. https://doi.org/10.1029/2020wr027188
chicago: Shaw, Thomas E., Alexis Caro, Pablo Mendoza, Álvaro Ayala, Francesca Pellicciotti,
Simon Gascoin, and James McPhee. “The Utility of Optical Satellite Winter Snow
Depths for Initializing a Glacio‐hydrological Model of a High‐Elevation, Andean
Catchment.” Water Resources Research. American Geophysical Union, 2020.
https://doi.org/10.1029/2020wr027188.
ieee: T. E. Shaw et al., “The utility of optical satellite winter snow depths
for initializing a glacio‐hydrological model of a High‐Elevation, Andean catchment,”
Water Resources Research, vol. 56, no. 8. American Geophysical Union, 2020.
ista: Shaw TE, Caro A, Mendoza P, Ayala Á, Pellicciotti F, Gascoin S, McPhee J.
2020. The utility of optical satellite winter snow depths for initializing a glacio‐hydrological
model of a High‐Elevation, Andean catchment. Water Resources Research. 56(8),
e2020WR027188.
mla: Shaw, Thomas E., et al. “The Utility of Optical Satellite Winter Snow Depths
for Initializing a Glacio‐hydrological Model of a High‐Elevation, Andean Catchment.”
Water Resources Research, vol. 56, no. 8, e2020WR027188, American Geophysical
Union, 2020, doi:10.1029/2020wr027188.
short: T.E. Shaw, A. Caro, P. Mendoza, Á. Ayala, F. Pellicciotti, S. Gascoin, J.
McPhee, Water Resources Research 56 (2020).
date_created: 2023-02-20T08:12:22Z
date_published: 2020-08-01T00:00:00Z
date_updated: 2023-02-28T12:41:45Z
day: '01'
doi: 10.1029/2020wr027188
extern: '1'
intvolume: ' 56'
issue: '8'
keyword:
- Water Science and Technology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1029/2020WR027188
month: '08'
oa: 1
oa_version: Published Version
publication: Water Resources Research
publication_identifier:
eissn:
- 1944-7973
issn:
- 0043-1397
publication_status: published
publisher: American Geophysical Union
quality_controlled: '1'
scopus_import: '1'
status: public
title: The utility of optical satellite winter snow depths for initializing a glacio‐hydrological
model of a High‐Elevation, Andean catchment
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 56
year: '2020'
...