---
_id: '11826'
abstract:
- lang: eng
text: "The diameter, radius and eccentricities are natural graph parameters. While
these problems have been studied extensively, there are no known dynamic algorithms
for them beyond the ones that follow from trivial recomputation after each update
or from solving dynamic All-Pairs Shortest Paths (APSP), which is very computationally
intensive. This is the situation for dynamic approximation algorithms as well,
and even if only edge insertions or edge deletions need to be supported.\r\nThis
paper provides a comprehensive study of the dynamic approximation of Diameter,
Radius and Eccentricities, providing both conditional lower bounds, and new algorithms
whose bounds are optimal under popular hypotheses in fine-grained complexity.
Some of the highlights include:\r\n- Under popular hardness hypotheses, there
can be no significantly better fully dynamic approximation algorithms than recomputing
the answer after each update, or maintaining full APSP.\r\n- Nearly optimal partially
dynamic (incremental/decremental) algorithms can be achieved via efficient reductions
to (incremental/decremental) maintenance of Single-Source Shortest Paths. For
instance, a nearly (3/2+epsilon)-approximation to Diameter in directed or undirected
n-vertex, m-edge graphs can be maintained decrementally in total time m^{1+o(1)}sqrt{n}/epsilon^2.
This nearly matches the static 3/2-approximation algorithm for the problem that
is known to be conditionally optimal."
alternative_title:
- LIPIcs
article_number: '13'
article_processing_charge: No
arxiv: 1
author:
- first_name: Bertie
full_name: Ancona, Bertie
last_name: Ancona
- 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: Liam
full_name: Roditty, Liam
last_name: Roditty
- first_name: Virginia Vassilevska
full_name: Williams, Virginia Vassilevska
last_name: Williams
- first_name: Nicole
full_name: Wein, Nicole
last_name: Wein
citation:
ama: 'Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. Algorithms and hardness
for diameter in dynamic graphs. In: 46th International Colloquium on Automata,
Languages, and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2019. doi:10.4230/LIPICS.ICALP.2019.13'
apa: 'Ancona, B., Henzinger, M. H., Roditty, L., Williams, V. V., & Wein, N.
(2019). Algorithms and hardness for diameter in dynamic graphs. In 46th International
Colloquium on Automata, Languages, and Programming (Vol. 132). Patras, Greece:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2019.13'
chicago: Ancona, Bertie, Monika H Henzinger, Liam Roditty, Virginia Vassilevska
Williams, and Nicole Wein. “Algorithms and Hardness for Diameter in Dynamic Graphs.”
In 46th International Colloquium on Automata, Languages, and Programming,
Vol. 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.13.
ieee: B. Ancona, M. H. Henzinger, L. Roditty, V. V. Williams, and N. Wein, “Algorithms
and hardness for diameter in dynamic graphs,” in 46th International Colloquium
on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132.
ista: 'Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. 2019. Algorithms
and hardness for diameter in dynamic graphs. 46th International Colloquium on
Automata, Languages, and Programming. ICALP: International Colloquium on Automata,
Languages, and Programming, LIPIcs, vol. 132, 13.'
mla: Ancona, Bertie, et al. “Algorithms and Hardness for Diameter in Dynamic Graphs.”
46th International Colloquium on Automata, Languages, and Programming,
vol. 132, 13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ICALP.2019.13.
short: B. Ancona, M.H. Henzinger, L. Roditty, V.V. Williams, N. Wein, in:, 46th
International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2019.
conference:
end_date: 2019-07-12
location: Patras, Greece
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2019-07-09
date_created: 2022-08-12T08:14:51Z
date_published: 2019-07-04T00:00:00Z
date_updated: 2023-02-16T10:48:24Z
day: '04'
doi: 10.4230/LIPICS.ICALP.2019.13
extern: '1'
external_id:
arxiv:
- '811.12527'
intvolume: ' 132'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.ICALP.2019.13
month: '07'
oa: 1
oa_version: Published Version
publication: 46th International Colloquium on Automata, Languages, and Programming
publication_identifier:
isbn:
- 978-3-95977-109-2
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Algorithms and hardness for diameter in dynamic graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 132
year: '2019'
...
---
_id: '11847'
abstract:
- lang: eng
text: This paper serves as a user guide to the Vienna graph clustering framework.
We review our general memetic algorithm, VieClus, to tackle the graph clustering
problem. A key component of our contribution are natural recombine operators that
employ ensemble clusterings as well as multi-level techniques. Lastly, we combine
these techniques with a scalable communication protocol, producing a system that
is able to compute high-quality solutions in a short amount of time. After giving
a description of the algorithms employed, we establish the connection of the graph
clustering problem to protein–protein interaction networks and moreover give a
description on how the software can be used, what file formats are expected, and
how this can be used to find functional groups in protein–protein interaction
networks.
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
author:
- first_name: Sonja
full_name: Biedermann, Sonja
last_name: Biedermann
- 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
- first_name: Bernhard
full_name: Schuster, Bernhard
last_name: Schuster
citation:
ama: 'Biedermann S, Henzinger MH, Schulz C, Schuster B. Vienna Graph Clustering.
In: Canzar S, Rojas Ringeling F, eds. Protein-Protein Interaction Networks.
Vol 2074. MIMB. Springer Nature; 2019:215–231. doi:10.1007/978-1-4939-9873-9_16'
apa: Biedermann, S., Henzinger, M. H., Schulz, C., & Schuster, B. (2019). Vienna
Graph Clustering. In S. Canzar & F. Rojas Ringeling (Eds.), Protein-Protein
Interaction Networks (Vol. 2074, pp. 215–231). Springer Nature. https://doi.org/10.1007/978-1-4939-9873-9_16
chicago: Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster.
“Vienna Graph Clustering.” In Protein-Protein Interaction Networks, edited
by Stefan Canzar and Francisca Rojas Ringeling, 2074:215–231. MIMB. Springer Nature,
2019. https://doi.org/10.1007/978-1-4939-9873-9_16.
ieee: S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Vienna Graph
Clustering,” in Protein-Protein Interaction Networks, vol. 2074, S. Canzar
and F. Rojas Ringeling, Eds. Springer Nature, 2019, pp. 215–231.
ista: 'Biedermann S, Henzinger MH, Schulz C, Schuster B. 2019.Vienna Graph Clustering.
In: Protein-Protein Interaction Networks. Methods in Molecular Biology, vol. 2074,
215–231.'
mla: Biedermann, Sonja, et al. “Vienna Graph Clustering.” Protein-Protein Interaction
Networks, edited by Stefan Canzar and Francisca Rojas Ringeling, vol. 2074,
Springer Nature, 2019, pp. 215–231, doi:10.1007/978-1-4939-9873-9_16.
short: S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, S. Canzar, F.
Rojas Ringeling (Eds.), Protein-Protein Interaction Networks, Springer Nature,
2019, pp. 215–231.
date_created: 2022-08-16T06:54:48Z
date_published: 2019-10-04T00:00:00Z
date_updated: 2023-02-17T09:34:26Z
day: '04'
doi: 10.1007/978-1-4939-9873-9_16
editor:
- first_name: Stefan
full_name: Canzar, Stefan
last_name: Canzar
- first_name: Francisca
full_name: Rojas Ringeling, Francisca
last_name: Rojas Ringeling
extern: '1'
external_id:
pmid:
- '31583641'
intvolume: ' 2074'
language:
- iso: eng
month: '10'
oa_version: None
page: 215–231
pmid: 1
publication: Protein-Protein Interaction Networks
publication_identifier:
eisbn:
- '9781493998739'
eissn:
- 1940-6029
isbn:
- '9781493998722'
issn:
- 1064-3745
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: MIMB
status: public
title: Vienna Graph Clustering
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2074
year: '2019'
...
---
_id: '11850'
abstract:
- lang: eng
text: 'Modern networked systems are increasingly reconfigurable, enabling demand-aware
infrastructures whose resources can be adjusted according to the workload they
currently serve. Such dynamic adjustments can be exploited to improve network
utilization and hence performance, by moving frequently interacting communication
partners closer, e.g., collocating them in the same server or datacenter. However,
dynamically changing the embedding of workloads is algorithmically challenging:
communication patterns are often not known ahead of time, but must be learned.
During the learning process, overheads related to unnecessary moves (i.e., re-embeddings)
should be minimized. This paper studies a fundamental model which captures the
tradeoff between the benefits and costs of dynamically collocating communication
partners on l servers, in an online manner. Our main contribution is a distributed
online algorithm which is asymptotically almost optimal, i.e., almost matches
the lower bound (also derived in this paper) on the competitive ratio of any (distributed
or centralized) online algorithm.'
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: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Henzinger MH, Neumann S, Schmid S. Efficient distributed workload (re-)embedding.
In: SIGMETRICS’19: International Conference on Measurement and Modeling of
Computer Systems. Association for Computing Machinery; 2019:43–44. doi:10.1145/3309697.3331503'
apa: 'Henzinger, M. H., Neumann, S., & Schmid, S. (2019). Efficient distributed
workload (re-)embedding. In SIGMETRICS’19: International Conference on Measurement
and Modeling of Computer Systems (pp. 43–44). Phoenix, AZ, United States:
Association for Computing Machinery. https://doi.org/10.1145/3309697.3331503'
chicago: 'Henzinger, Monika H, Stefan Neumann, and Stefan Schmid. “Efficient Distributed
Workload (Re-)Embedding.” In SIGMETRICS’19: International Conference on Measurement
and Modeling of Computer Systems, 43–44. Association for Computing Machinery,
2019. https://doi.org/10.1145/3309697.3331503.'
ieee: 'M. H. Henzinger, S. Neumann, and S. Schmid, “Efficient distributed workload
(re-)embedding,” in SIGMETRICS’19: International Conference on Measurement
and Modeling of Computer Systems, Phoenix, AZ, United States, 2019, pp. 43–44.'
ista: 'Henzinger MH, Neumann S, Schmid S. 2019. Efficient distributed workload (re-)embedding.
SIGMETRICS’19: International Conference on Measurement and Modeling of Computer
Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer
Systems, 43–44.'
mla: 'Henzinger, Monika H., et al. “Efficient Distributed Workload (Re-)Embedding.”
SIGMETRICS’19: International Conference on Measurement and Modeling of Computer
Systems, Association for Computing Machinery, 2019, pp. 43–44, doi:10.1145/3309697.3331503.'
short: 'M.H. Henzinger, S. Neumann, S. Schmid, in:, SIGMETRICS’19: International
Conference on Measurement and Modeling of Computer Systems, Association for Computing
Machinery, 2019, pp. 43–44.'
conference:
end_date: 2019-06-28
location: Phoenix, AZ, United States
name: 'SIGMETRICS: International Conference on Measurement and Modeling of Computer
Systems'
start_date: 2019-06-24
date_created: 2022-08-16T07:14:57Z
date_published: 2019-06-20T00:00:00Z
date_updated: 2023-02-17T09:41:45Z
day: '20'
doi: 10.1145/3309697.3331503
extern: '1'
external_id:
arxiv:
- '1904.05474'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.05474
month: '06'
oa: 1
oa_version: Preprint
page: 43–44
publication: 'SIGMETRICS''19: International Conference on Measurement and Modeling
of Computer Systems'
publication_identifier:
isbn:
- 978-1-4503-6678-6
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient distributed workload (re-)embedding
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11851'
abstract:
- lang: eng
text: The minimum cut problem for an undirected edge-weighted graph asks us to divide
its set of nodes into two blocks while minimizing the weighted sum of the cut
edges. In this paper, we engineer the fastest known exact algorithm for the problem.
State-of-the-art algorithms like the algorithm of Padberg and Rinaldi or the algorithm
of Nagamochi, Ono and Ibaraki identify edges that can be contracted to reduce
the graph size such that at least one minimum cut is maintained in the contracted
graph. Our algorithm achieves improvements in running time over these algorithms
by a multitude of techniques. First, we use a recently developed fast and parallel
inexact minimum cut algorithm to obtain a better bound for the problem. Afterwards,
we use reductions that depend on this bound to reduce the size of the graph much
faster than previously possible. We use improved data structures to further lower
the running time of our algorithm. Additionally, we parallelize the contraction
routines of Nagamochi et al. . Overall, we arrive at a system that significantly
outperforms the fastest state-of-the-art solvers for the exact minimum cut problem.
article_number: '8820968'
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 MH, Noe A, Schulz C. Shared-memory exact minimum cuts. In: 33rd
International Parallel and Distributed Processing Symposium. Institute of
Electrical and Electronics Engineers; 2019. doi:10.1109/ipdps.2019.00013'
apa: 'Henzinger, M. H., Noe, A., & Schulz, C. (2019). Shared-memory exact minimum
cuts. In 33rd International Parallel and Distributed Processing Symposium.
Rio de Janeiro, Brazil: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ipdps.2019.00013'
chicago: Henzinger, Monika H, Alexander Noe, and Christian Schulz. “Shared-Memory
Exact Minimum Cuts.” In 33rd International Parallel and Distributed Processing
Symposium. Institute of Electrical and Electronics Engineers, 2019. https://doi.org/10.1109/ipdps.2019.00013.
ieee: M. H. Henzinger, A. Noe, and C. Schulz, “Shared-memory exact minimum cuts,”
in 33rd International Parallel and Distributed Processing Symposium, Rio
de Janeiro, Brazil, 2019.
ista: 'Henzinger MH, Noe A, Schulz C. 2019. Shared-memory exact minimum cuts. 33rd
International Parallel and Distributed Processing Symposium. IPDPS: International
Parallel and Distributed Processing Symposium, 8820968.'
mla: Henzinger, Monika H., et al. “Shared-Memory Exact Minimum Cuts.” 33rd International
Parallel and Distributed Processing Symposium, 8820968, Institute of Electrical
and Electronics Engineers, 2019, doi:10.1109/ipdps.2019.00013.
short: M.H. Henzinger, A. Noe, C. Schulz, in:, 33rd International Parallel and Distributed
Processing Symposium, Institute of Electrical and Electronics Engineers, 2019.
conference:
end_date: 2019-05-24
location: Rio de Janeiro, Brazil
name: 'IPDPS: International Parallel and Distributed Processing Symposium'
start_date: 2019-05-20
date_created: 2022-08-16T07:25:23Z
date_published: 2019-05-01T00:00:00Z
date_updated: 2023-02-21T16:30:34Z
day: '01'
doi: 10.1109/ipdps.2019.00013
extern: '1'
external_id:
arxiv:
- '1808.05458'
language:
- iso: eng
main_file_link:
- url: https://arxiv.org/abs/1808.05458
month: '05'
oa_version: Preprint
publication: 33rd International Parallel and Distributed Processing Symposium
publication_identifier:
eisbn:
- 978-1-7281-1246-6
eissn:
- 1530-2075
isbn:
- 978-1-7281-1247-3
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
related_material:
record:
- id: '11851'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Shared-memory exact minimum cuts
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11853'
abstract:
- lang: eng
text: We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate
minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the input
set system is undergoing element insertions and deletions. Here, n denotes the
number of elements, each element appears in at most f sets, and the cost of each
set lies in the range [1/C, 1]. Our result, together with that of Gupta~et~al.~[STOC'17],
implies that there is a deterministic algorithm for this problem with O(f log(Cn))
amortized update time and O(min(log n, f)) -approximation ratio, which nearly
matches the polynomial-time hardness of approximation for minimum set cover in
the static setting. Our update time is only O(log (Cn)) away from a trivial lower
bound. Prior to our work, the previous best approximation ratio guaranteed by
deterministic algorithms was O(f^2), which was due to Bhattacharya~et~al.~[ICALP`15].
In contrast, the only result that guaranteed O(f) -approximation was obtained
very recently by Abboud~et~al.~[STOC`19], who designed a dynamic algorithm with
(1+ε)f-approximation ratio and O(f^2 log n/ε) amortized update time. Besides the
extra O(f) factor in the update time compared to our and Gupta~et~al.'s results,
the Abboud~et~al.~algorithm is randomized, and works only when the adversary is
oblivious and the sets are unweighted (each set has the same cost). We achieve
our result via the primal-dual approach, by maintaining a fractional packing solution
as a dual certificate. This approach was pursued previously by Bhattacharya~et~al.~and
Gupta~et~al., but not in the recent paper by Abboud~et~al. Unlike previous primal-dual
algorithms that try to satisfy some local constraints for individual sets at all
time, our algorithm basically waits until the dual solution changes significantly
globally, and fixes the solution only where the fix is needed.
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
citation:
ama: 'Bhattacharya S, Henzinger MH, Nanongkai D. A new deterministic algorithm for
dynamic set cover. In: 60th Annual Symposium on Foundations of Computer Science.
Institute of Electrical and Electronics Engineers; 2019:406-423. doi:10.1109/focs.2019.00033'
apa: 'Bhattacharya, S., Henzinger, M. H., & Nanongkai, D. (2019). A new deterministic
algorithm for dynamic set cover. In 60th Annual Symposium on Foundations of
Computer Science (pp. 406–423). Baltimore, MD, United States: Institute of
Electrical and Electronics Engineers. https://doi.org/10.1109/focs.2019.00033'
chicago: Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “A New
Deterministic Algorithm for Dynamic Set Cover.” In 60th Annual Symposium on
Foundations of Computer Science, 406–23. Institute of Electrical and Electronics
Engineers, 2019. https://doi.org/10.1109/focs.2019.00033.
ieee: S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “A new deterministic algorithm
for dynamic set cover,” in 60th Annual Symposium on Foundations of Computer
Science, Baltimore, MD, United States, 2019, pp. 406–423.
ista: 'Bhattacharya S, Henzinger MH, Nanongkai D. 2019. A new deterministic algorithm
for dynamic set cover. 60th Annual Symposium on Foundations of Computer Science.
FOCS: Annual Symposium on Foundations of Computer Science, 406–423.'
mla: Bhattacharya, Sayan, et al. “A New Deterministic Algorithm for Dynamic Set
Cover.” 60th Annual Symposium on Foundations of Computer Science, Institute
of Electrical and Electronics Engineers, 2019, pp. 406–23, doi:10.1109/focs.2019.00033.
short: S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 60th Annual Symposium
on Foundations of Computer Science, Institute of Electrical and Electronics Engineers,
2019, pp. 406–423.
conference:
end_date: 2019-11-12
location: Baltimore, MD, United States
name: 'FOCS: Annual Symposium on Foundations of Computer Science'
start_date: 2019-11-09
date_created: 2022-08-16T08:00:00Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2023-02-17T09:50:37Z
day: '01'
doi: 10.1109/focs.2019.00033
extern: '1'
external_id:
arxiv:
- '1909.11600'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1909.11600
month: '11'
oa: 1
oa_version: Preprint
page: 406-423
publication: 60th Annual Symposium on Foundations of Computer Science
publication_identifier:
eisbn:
- 978-1-7281-4952-3
isbn:
- 978-1-7281-4953-0
issn:
- 2575-8454
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: A new deterministic algorithm for dynamic set cover
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11865'
abstract:
- lang: eng
text: We present the first sublinear-time algorithm that can compute the edge connectivity
λ of a network exactly on distributed message-passing networks (the CONGEST model),
as long as the network contains no multi-edge. We present the first sublinear-time
algorithm for a distributed message-passing network sto compute its edge connectivity
λ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm
takes Õ(n1−1/353D1/353+n1−1/706) time to compute λ and a cut of cardinality λ
with high probability, where n and D are the number of nodes and the diameter
of the network, respectively, and Õ hides polylogarithmic factors. This running
time is sublinear in n (i.e. Õ(n1−є)) whenever D is. Previous sublinear-time distributed
algorithms can solve this problem either (i) exactly only when λ=O(n1/8−є) [Thurimella
PODC’95; Pritchard, Thurimella, ACM Trans. Algorithms’11; Nanongkai, Su, DISC’14]
or (ii) approximately [Ghaffari, Kuhn, DISC’13; Nanongkai, Su, DISC’14]. To achieve
this we develop and combine several new techniques. First, we design the first
distributed algorithm that can compute a k-edge connectivity certificate for any
k=O(n1−є) in time Õ(√nk+D). The previous sublinear-time algorithm can do so only
when k=o(√n) [Thurimella PODC’95]. In fact, our algorithm can be turned into the
first parallel algorithm with polylogarithmic depth and near-linear work. Previous
near-linear work algorithms are essentially sequential and previous polylogarithmic-depth
algorithms require Ω(mk) work in the worst case (e.g. [Karger, Motwani, STOC’93]).
Second, we show that by combining the recent distributed expander decomposition
technique of [Chang, Pettie, Zhang, SODA’19] with techniques from the sequential
deterministic edge connectivity algorithm of [Kawarabayashi, Thorup, STOC’15],
we can decompose the network into a sublinear number of clusters with small average
diameter and without any mincut separating a cluster (except the “trivial” ones).
This leads to a simplification of the Kawarabayashi-Thorup framework (except that
we are randomized while they are deterministic). This might make this framework
more useful in other models of computation. Finally, by extending the tree packing
technique from [Karger STOC’96], we can find the minimum cut in time proportional
to the number of components. As a byproduct of this technique, we obtain an Õ(n)-time
algorithm for computing exact minimum cut for weighted graphs.
article_processing_charge: No
arxiv: 1
author:
- first_name: Mohit
full_name: Daga, Mohit
last_name: Daga
- 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: Thatchaphol
full_name: Saranurak, Thatchaphol
last_name: Saranurak
citation:
ama: 'Daga M, Henzinger MH, Nanongkai D, Saranurak T. Distributed edge connectivity
in sublinear time. In: Proceedings of the 51st Annual ACM SIGACT Symposium
on Theory of Computing. Association for Computing Machinery; 2019:343–354.
doi:10.1145/3313276.3316346'
apa: 'Daga, M., Henzinger, M. H., Nanongkai, D., & Saranurak, T. (2019). Distributed
edge connectivity in sublinear time. In Proceedings of the 51st Annual ACM
SIGACT Symposium on Theory of Computing (pp. 343–354). Phoenix, AZ, United
States: Association for Computing Machinery. https://doi.org/10.1145/3313276.3316346'
chicago: Daga, Mohit, Monika H Henzinger, Danupon Nanongkai, and Thatchaphol Saranurak.
“Distributed Edge Connectivity in Sublinear Time.” In Proceedings of the 51st
Annual ACM SIGACT Symposium on Theory of Computing, 343–354. Association for
Computing Machinery, 2019. https://doi.org/10.1145/3313276.3316346.
ieee: M. Daga, M. H. Henzinger, D. Nanongkai, and T. Saranurak, “Distributed edge
connectivity in sublinear time,” in Proceedings of the 51st Annual ACM SIGACT
Symposium on Theory of Computing, Phoenix, AZ, United States, 2019, pp. 343–354.
ista: 'Daga M, Henzinger MH, Nanongkai D, Saranurak T. 2019. Distributed edge connectivity
in sublinear time. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory
of Computing. STOC: Symposium on Theory of Computing, 343–354.'
mla: Daga, Mohit, et al. “Distributed Edge Connectivity in Sublinear Time.” Proceedings
of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association
for Computing Machinery, 2019, pp. 343–354, doi:10.1145/3313276.3316346.
short: M. Daga, M.H. Henzinger, D. Nanongkai, T. Saranurak, in:, Proceedings of
the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing
Machinery, 2019, pp. 343–354.
conference:
end_date: 2019-06-26
location: Phoenix, AZ, United States
name: 'STOC: Symposium on Theory of Computing'
start_date: 2019-06-23
date_created: 2022-08-16T09:11:17Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-02-17T10:26:25Z
day: '01'
doi: 10.1145/3313276.3316346
extern: '1'
external_id:
arxiv:
- '1904.04341'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.04341
month: '06'
oa: 1
oa_version: Preprint
page: 343–354
publication: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
publication_identifier:
isbn:
- 978-1-4503-6705-9
issn:
- 0737-8017
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Distributed edge connectivity in sublinear time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11871'
abstract:
- lang: eng
text: "Many dynamic graph algorithms have an amortized update time, rather than
a stronger worst-case guarantee. But amortized data structures are not suitable
for real-time systems, where each individual operation has to be executed quickly.
For this reason, there exist many recent randomized results that aim to provide
a guarantee stronger than amortized expected. The strongest possible guarantee
for a randomized algorithm is that it is always correct (Las Vegas), and has high-probability
worst-case update time, which gives a bound on the time for each individual operation
that holds with high probability.\r\n\r\nIn this paper we present the first polylogarithmic
high-probability worst-case time bounds for the dynamic spanner and the dynamic
maximal matching problem.\r\n\r\n1.\t\r\nFor dynamic spanner, the only known o(n)
worst-case bounds were O(n3/4) high-probability worst-case update time for maintaining
a 3-spanner, and O(n5/9) for maintaining a 5-spanner. We give a O(1)k log3(n)
high-probability worst-case time bound for maintaining a (2k – 1)-spanner, which
yields the first worst-case polylog update time for all constant k. (All the results
above maintain the optimal tradeoff of stretch 2k – 1 and Õ(n1+1/k) edges.)\r\n\r\n2.\t\r\nFor
dynamic maximal matching, or dynamic 2-approximate maximum matching, no algorithm
with o(n) worst-case time bound was known and we present an algorithm with O(log5
(n)) high-probability worst-case time; similar worst-case bounds existed only
for maintaining a matching that was (2 + ∊)-approximate, and hence not maximal.\r\n\r\nOur
results are achieved using a new approach for converting amortized guarantees
to worst-case ones for randomized data structures by going through a third type
of guarantee, which is a middle ground between the two above: an algorithm is
said to have worst-case expected update time α if for every update σ, the expected
time to process σ is at most α. Although stronger than amortized expected, the
worst-case expected guarantee does not resolve the fundamental problem of amortization:
a worst-case expected update time of O(1) still allows for the possibility that
every 1/f(n) updates requires Θ(f(n)) time to process, for arbitrarily high f(n).
In this paper we present a black-box reduction that converts any data structure
with worst-case expected update time into one with a high-probability worst-case
update time: the query time remains the same, while the update time increases
by a factor of O(log2(n)).\r\n\r\nThus we achieve our results in two steps: (1)
First we show how to convert existing dynamic graph algorithms with amortized
expected polylogarithmic running times into algorithms with worst-case expected
polylogarithmic running times. (2) Then we use our black-box reduction to achieve
the polylogarithmic high-probability worst-case time bound. All our algorithms
are Las-Vegas-type algorithms."
article_processing_charge: No
arxiv: 1
author:
- first_name: Aaron
full_name: Bernstein, Aaron
last_name: Bernstein
- first_name: Sebastian
full_name: Forster, Sebastian
last_name: Forster
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Bernstein A, Forster S, Henzinger MH. A deamortization approach for dynamic
spanner and dynamic maximal matching. In: 30th Annual ACM-SIAM Symposium on
Discrete Algorithms. Society for Industrial and Applied Mathematics; 2019:1899-1918.
doi:10.1137/1.9781611975482.115'
apa: 'Bernstein, A., Forster, S., & Henzinger, M. H. (2019). A deamortization
approach for dynamic spanner and dynamic maximal matching. In 30th Annual ACM-SIAM
Symposium on Discrete Algorithms (pp. 1899–1918). San Diego, CA, United States:
Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.115'
chicago: Bernstein, Aaron, Sebastian Forster, and Monika H Henzinger. “A Deamortization
Approach for Dynamic Spanner and Dynamic Maximal Matching.” In 30th Annual
ACM-SIAM Symposium on Discrete Algorithms, 1899–1918. Society for Industrial
and Applied Mathematics, 2019. https://doi.org/10.1137/1.9781611975482.115.
ieee: A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach
for dynamic spanner and dynamic maximal matching,” in 30th Annual ACM-SIAM
Symposium on Discrete Algorithms, San Diego, CA, United States, 2019, pp.
1899–1918.
ista: 'Bernstein A, Forster S, Henzinger MH. 2019. A deamortization approach for
dynamic spanner and dynamic maximal matching. 30th Annual ACM-SIAM Symposium on
Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1899–1918.'
mla: Bernstein, Aaron, et al. “A Deamortization Approach for Dynamic Spanner and
Dynamic Maximal Matching.” 30th Annual ACM-SIAM Symposium on Discrete Algorithms,
Society for Industrial and Applied Mathematics, 2019, pp. 1899–918, doi:10.1137/1.9781611975482.115.
short: A. Bernstein, S. Forster, M.H. Henzinger, in:, 30th Annual ACM-SIAM Symposium
on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2019,
pp. 1899–1918.
conference:
end_date: 2019-01-09
location: San Diego, CA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2019-01-06
date_created: 2022-08-16T09:50:33Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2023-02-21T16:31:21Z
day: '01'
doi: 10.1137/1.9781611975482.115
extern: '1'
external_id:
arxiv:
- '1810.10932'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1810.10932
month: '01'
oa: 1
oa_version: Preprint
page: 1899-1918
publication: 30th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- 978-1-61197-548-2
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '11871'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: A deamortization approach for dynamic spanner and dynamic maximal matching
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11898'
abstract:
- lang: eng
text: "We build upon the recent papers by Weinstein and Yu (FOCS'16), Larsen (FOCS'12),
and Clifford et al. (FOCS'15) to present a general framework that gives amortized
lower bounds on the update and query times of dynamic data structures. Using our
framework, we present two concrete results.\r\n(1) For the dynamic polynomial
evaluation problem, where the polynomial is defined over a finite field of size
n1+Ω(1) and has degree n, any dynamic data structure must either have an amortized
update time of Ω((lgn/lglgn)2) or an amortized query time of Ω((lgn/lglgn)2).\r\n(2)
For the dynamic online matrix vector multiplication problem, where we get an n×n
matrix whose entires are drawn from a finite field of size nΘ(1), any dynamic
data structure must either have an amortized update time of Ω((lgn/lglgn)2) or
an amortized query time of Ω(n⋅(lgn/lglgn)2).\r\nFor these two problems, the previous
works by Larsen (FOCS'12) and Clifford et al. (FOCS'15) gave the same lower bounds,
but only for worst case update and query times. Our bounds match the highest unconditional
lower bounds known till date for any dynamic problem in the cell-probe model."
article_processing_charge: No
article_type: original
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: Stefan
full_name: Neumann, Stefan
last_name: Neumann
citation:
ama: Bhattacharya S, Henzinger MH, Neumann S. New amortized cell-probe lower bounds
for dynamic problems. Theoretical Computer Science. 2019;779:72-87. doi:10.1016/j.tcs.2019.01.043
apa: Bhattacharya, S., Henzinger, M. H., & Neumann, S. (2019). New amortized
cell-probe lower bounds for dynamic problems. Theoretical Computer Science.
Elsevier. https://doi.org/10.1016/j.tcs.2019.01.043
chicago: Bhattacharya, Sayan, Monika H Henzinger, and Stefan Neumann. “New Amortized
Cell-Probe Lower Bounds for Dynamic Problems.” Theoretical Computer Science.
Elsevier, 2019. https://doi.org/10.1016/j.tcs.2019.01.043.
ieee: S. Bhattacharya, M. H. Henzinger, and S. Neumann, “New amortized cell-probe
lower bounds for dynamic problems,” Theoretical Computer Science, vol.
779. Elsevier, pp. 72–87, 2019.
ista: Bhattacharya S, Henzinger MH, Neumann S. 2019. New amortized cell-probe lower
bounds for dynamic problems. Theoretical Computer Science. 779, 72–87.
mla: Bhattacharya, Sayan, et al. “New Amortized Cell-Probe Lower Bounds for Dynamic
Problems.” Theoretical Computer Science, vol. 779, Elsevier, 2019, pp.
72–87, doi:10.1016/j.tcs.2019.01.043.
short: S. Bhattacharya, M.H. Henzinger, S. Neumann, Theoretical Computer Science
779 (2019) 72–87.
date_created: 2022-08-17T09:02:15Z
date_published: 2019-08-02T00:00:00Z
date_updated: 2022-09-09T11:29:04Z
day: '02'
doi: 10.1016/j.tcs.2019.01.043
extern: '1'
external_id:
arxiv:
- '1902.02304'
intvolume: ' 779'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.02304
month: '08'
oa: 1
oa_version: Preprint
page: 72-87
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: New amortized cell-probe lower bounds for dynamic problems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 779
year: '2019'
...
---
_id: '11957'
abstract:
- lang: eng
text: Cross-coupling reactions mediated by dual nickel/photocatalysis are synthetically
attractive but rely mainly on expensive, non-recyclable noble-metal complexes
as photocatalysts. Heterogeneous semiconductors, which are commonly used for artificial
photosynthesis and wastewater treatment, are a sustainable alternative. Graphitic
carbon nitrides, a class of metal-free polymers that can be easily prepared from
bulk chemicals, are heterogeneous semiconductors with high potential for photocatalytic
organic transformations. Here, we demonstrate that graphitic carbon nitrides in
combination with nickel catalysis can induce selective C−O cross-couplings of
carboxylic acids with aryl halides, yielding the respective aryl esters in excellent
yield and selectivity. The heterogeneous organic photocatalyst exhibits a broad
substrate scope, is able to harvest green light, and can be recycled multiple
times. In situ FTIR was used to track the reaction progress to study this transformation
at different irradiation wavelengths and reaction scales.
article_processing_charge: No
article_type: letter_note
author:
- 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: Jamal A.
full_name: Malik, Jamal A.
last_name: Malik
- first_name: Cristian
full_name: Cavedon, Cristian
last_name: Cavedon
- first_name: Sebastian
full_name: Gisbertz, Sebastian
last_name: Gisbertz
- first_name: Aleksandr
full_name: Savateev, Aleksandr
last_name: Savateev
- first_name: Daniel
full_name: Cruz, Daniel
last_name: Cruz
- first_name: Tobias
full_name: Heil, Tobias
last_name: Heil
- first_name: Guigang
full_name: Zhang, Guigang
last_name: Zhang
- first_name: Peter H.
full_name: Seeberger, Peter H.
last_name: Seeberger
citation:
ama: 'Pieber B, Malik JA, Cavedon C, et al. Semi‐heterogeneous dual nickel/photocatalysis
using carbon nitrides: Esterification of carboxylic acids with aryl halides. Angewandte
Chemie International Edition. 2019;58(28):9575-9580. doi:10.1002/anie.201902785'
apa: 'Pieber, B., Malik, J. A., Cavedon, C., Gisbertz, S., Savateev, A., Cruz, D.,
… Seeberger, P. H. (2019). Semi‐heterogeneous dual nickel/photocatalysis using
carbon nitrides: Esterification of carboxylic acids with aryl halides. Angewandte
Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201902785'
chicago: 'Pieber, Bartholomäus, Jamal A. Malik, Cristian Cavedon, Sebastian Gisbertz,
Aleksandr Savateev, Daniel Cruz, Tobias Heil, Guigang Zhang, and Peter H. Seeberger.
“Semi‐heterogeneous Dual Nickel/Photocatalysis Using Carbon Nitrides: Esterification
of Carboxylic Acids with Aryl Halides.” Angewandte Chemie International Edition.
Wiley, 2019. https://doi.org/10.1002/anie.201902785.'
ieee: 'B. Pieber et al., “Semi‐heterogeneous dual nickel/photocatalysis using
carbon nitrides: Esterification of carboxylic acids with aryl halides,” Angewandte
Chemie International Edition, vol. 58, no. 28. Wiley, pp. 9575–9580, 2019.'
ista: 'Pieber B, Malik JA, Cavedon C, Gisbertz S, Savateev A, Cruz D, Heil T, Zhang
G, Seeberger PH. 2019. Semi‐heterogeneous dual nickel/photocatalysis using carbon
nitrides: Esterification of carboxylic acids with aryl halides. Angewandte Chemie
International Edition. 58(28), 9575–9580.'
mla: 'Pieber, Bartholomäus, et al. “Semi‐heterogeneous Dual Nickel/Photocatalysis
Using Carbon Nitrides: Esterification of Carboxylic Acids with Aryl Halides.”
Angewandte Chemie International Edition, vol. 58, no. 28, Wiley, 2019,
pp. 9575–80, doi:10.1002/anie.201902785.'
short: B. Pieber, J.A. Malik, C. Cavedon, S. Gisbertz, A. Savateev, D. Cruz, T.
Heil, G. Zhang, P.H. Seeberger, Angewandte Chemie International Edition 58 (2019)
9575–9580.
date_created: 2022-08-24T10:50:19Z
date_published: 2019-07-08T00:00:00Z
date_updated: 2023-02-21T10:09:16Z
day: '08'
doi: 10.1002/anie.201902785
extern: '1'
external_id:
pmid:
- '31050132'
intvolume: ' 58'
issue: '28'
language:
- iso: eng
month: '07'
oa_version: None
page: 9575-9580
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: 'Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification
of carboxylic acids with aryl halides'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 58
year: '2019'
...
---
_id: '11982'
abstract:
- lang: eng
text: A carbon nitride material can be combined with homogeneous nickel catalysts
for light-mediated cross-couplings of aryl bromides with alcohols under mild conditions.
The metal-free heterogeneous semiconductor is fully recyclable and couples a broad
range of electron-poor aryl bromides with primary and secondary alcohols as well
as water. The application for intramolecular reactions and the synthesis of active
pharmaceutical ingredients was demonstrated. The catalytic protocol is applicable
for the coupling of aryl iodides with thiols as well.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Cristian
full_name: Cavedon, Cristian
last_name: Cavedon
- first_name: Amiera
full_name: Madani, Amiera
last_name: Madani
- 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, Madani A, Seeberger PH, Pieber B. Semiheterogeneous dual nickel/photocatalytic
(thio)etherification using carbon nitrides. Organic Letters. 2019;21(13):5331-5334.
doi:10.1021/acs.orglett.9b01957
apa: Cavedon, C., Madani, A., Seeberger, P. H., & Pieber, B. (2019). Semiheterogeneous
dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic
Letters. American Chemical Society. https://doi.org/10.1021/acs.orglett.9b01957
chicago: Cavedon, Cristian, Amiera Madani, Peter H. Seeberger, and Bartholomäus
Pieber. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using
Carbon Nitrides.” Organic Letters. American Chemical Society, 2019. https://doi.org/10.1021/acs.orglett.9b01957.
ieee: C. Cavedon, A. Madani, P. H. Seeberger, and B. Pieber, “Semiheterogeneous
dual nickel/photocatalytic (thio)etherification using carbon nitrides,” Organic
Letters, vol. 21, no. 13. American Chemical Society, pp. 5331–5334, 2019.
ista: Cavedon C, Madani A, Seeberger PH, Pieber B. 2019. Semiheterogeneous dual
nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters.
21(13), 5331–5334.
mla: Cavedon, Cristian, et al. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification
Using Carbon Nitrides.” Organic Letters, vol. 21, no. 13, American Chemical
Society, 2019, pp. 5331–34, doi:10.1021/acs.orglett.9b01957.
short: C. Cavedon, A. Madani, P.H. Seeberger, B. Pieber, Organic Letters 21 (2019)
5331–5334.
date_created: 2022-08-25T11:18:00Z
date_published: 2019-07-05T00:00:00Z
date_updated: 2023-02-21T10:10:19Z
day: '05'
doi: 10.1021/acs.orglett.9b01957
extern: '1'
external_id:
pmid:
- '31247752'
intvolume: ' 21'
issue: '13'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1021/acs.orglett.9b01957
month: '07'
oa: 1
oa_version: Published Version
page: 5331-5334
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: Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon
nitrides
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2019'
...
---
_id: '11984'
abstract:
- lang: eng
text: Differentially protected galactosamine building blocks are key components
for the synthesis of human and bacterial oligosaccharides. The azidophenylselenylation
of 3,4,6-tri-O-acetyl-d-galactal provides straightforward access to the corresponding
2-nitrogenated glycoside. Poor reproducibility and the use of azides that lead
to the formation of potentially explosive and toxic species limit the scalability
of this reaction and render it a bottleneck for carbohydrate synthesis. Here,
we present a method for the safe, efficient, and reliable azidophenylselenylation
of 3,4,6-tri-O-acetyl-d-galactal at room temperature, using continuous flow chemistry.
Careful analysis of the transformation resulted in reaction conditions that produce
minimal side products while the reaction time was reduced drastically when compared
to batch reactions. The flow setup is readily scalable to process 5 mmol of galactal
in 3 h, producing 1.2 mmol/h of product.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Mónica
full_name: Guberman, Mónica
last_name: Guberman
- 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: Peter H.
full_name: Seeberger, Peter H.
last_name: Seeberger
citation:
ama: Guberman M, Pieber B, Seeberger PH. Safe and scalable continuous flow azidophenylselenylation
of galactal to prepare galactosamine building blocks. Organic Process Research
and Development. 2019;23(12):2764-2770. doi:10.1021/acs.oprd.9b00456
apa: Guberman, M., Pieber, B., & Seeberger, P. H. (2019). Safe and scalable
continuous flow azidophenylselenylation of galactal to prepare galactosamine building
blocks. Organic Process Research and Development. American Chemical Society.
https://doi.org/10.1021/acs.oprd.9b00456
chicago: Guberman, Mónica, Bartholomäus Pieber, and Peter H. Seeberger. “Safe and
Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine
Building Blocks.” Organic Process Research and Development. American Chemical
Society, 2019. https://doi.org/10.1021/acs.oprd.9b00456.
ieee: M. Guberman, B. Pieber, and P. H. Seeberger, “Safe and scalable continuous
flow azidophenylselenylation of galactal to prepare galactosamine building blocks,”
Organic Process Research and Development, vol. 23, no. 12. American Chemical
Society, pp. 2764–2770, 2019.
ista: Guberman M, Pieber B, Seeberger PH. 2019. Safe and scalable continuous flow
azidophenylselenylation of galactal to prepare galactosamine building blocks.
Organic Process Research and Development. 23(12), 2764–2770.
mla: Guberman, Mónica, et al. “Safe and Scalable Continuous Flow Azidophenylselenylation
of Galactal to Prepare Galactosamine Building Blocks.” Organic Process Research
and Development, vol. 23, no. 12, American Chemical Society, 2019, pp. 2764–70,
doi:10.1021/acs.oprd.9b00456.
short: M. Guberman, B. Pieber, P.H. Seeberger, Organic Process Research and Development
23 (2019) 2764–2770.
date_created: 2022-08-25T11:30:33Z
date_published: 2019-12-20T00:00:00Z
date_updated: 2023-02-21T10:10:23Z
day: '20'
doi: 10.1021/acs.oprd.9b00456
extern: '1'
intvolume: ' 23'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1021/acs.oprd.9b00456
month: '12'
oa: 1
oa_version: Published Version
page: 2764-2770
publication: Organic Process Research and Development
publication_identifier:
eissn:
- 1520-586X
issn:
- 1083-6160
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Safe and scalable continuous flow azidophenylselenylation of galactal to prepare
galactosamine building blocks
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2019'
...
---
_id: '12190'
abstract:
- lang: eng
text: Meiotic crossover frequency varies within genomes, which influences genetic
diversity and adaptation. In turn, genetic variation within populations can act
to modify crossover frequency in cis and trans. To identify genetic variation
that controls meiotic crossover frequency, we screened Arabidopsis accessions
using fluorescent recombination reporters. We mapped a genetic modifier of crossover
frequency in Col × Bur populations of Arabidopsis to a premature stop codon within
TBP-ASSOCIATED FACTOR 4b (TAF4b), which encodes a subunit of the RNA polymerase
II general transcription factor TFIID. The Arabidopsis taf4b mutation is a rare
variant found in the British Isles, originating in South-West Ireland. Using genetics,
genomics, and immunocytology, we demonstrate a genome-wide decrease in taf4b crossovers,
with strongest reduction in the sub-telomeric regions. Using RNA sequencing (RNA-seq)
from purified meiocytes, we show that TAF4b expression is meiocyte enriched, whereas
its paralog TAF4 is broadly expressed. Consistent with the role of TFIID in promoting
gene expression, RNA-seq of wild-type and taf4b meiocytes identified widespread
transcriptional changes, including in genes that regulate the meiotic cell cycle
and recombination. Therefore, TAF4b duplication is associated with acquisition
of meiocyte-specific expression and promotion of germline transcription, which
act directly or indirectly to elevate crossovers. This identifies a novel mode
of meiotic recombination control via a general transcription factor.
acknowledgement: "We thank Gregory Copenhaver (University of North Carolina), Avraham
Levy (The Weizmann Institute), and Scott Poethig (University of Pennsylvania) for
FTLs; Piotr Ziolkowski for Col-420/Bur seed; Sureshkumar Balasubramanian\r\n(Monash
University) for providing British and Irish Arabidopsis accessions; Mathilde Grelon
(INRA, Versailles) for providing the MLH1 antibody; and the Gurdon Institute for
access to microscopes. This work was supported by a BBSRC DTP studentship (E.J.L.),
European Research Area Network for Coordinating Action in Plant Sciences/BBSRC ‘‘DeCOP’’
(BB/M004937/1; C.L.), a BBSRC David Phillips Fellowship (BB/L025043/1; H.G. and
X.F.), the European Research Council (CoG ‘‘SynthHotspot,’’ A.J.T., C.L., and I.R.H.;
StG ‘‘SexMeth,’’ X.F.), and a Sainsbury Charitable Foundation Studentship (A.R.B.)."
article_processing_charge: No
article_type: original
author:
- first_name: Emma J.
full_name: Lawrence, Emma J.
last_name: Lawrence
- first_name: Hongbo
full_name: Gao, Hongbo
last_name: Gao
- first_name: Andrew J.
full_name: Tock, Andrew J.
last_name: Tock
- first_name: Christophe
full_name: Lambing, Christophe
last_name: Lambing
- first_name: Alexander R.
full_name: Blackwell, Alexander R.
last_name: Blackwell
- first_name: Xiaoqi
full_name: Feng, Xiaoqi
id: e0164712-22ee-11ed-b12a-d80fcdf35958
last_name: Feng
orcid: 0000-0002-4008-1234
- first_name: Ian R.
full_name: Henderson, Ian R.
last_name: Henderson
citation:
ama: Lawrence EJ, Gao H, Tock AJ, et al. Natural variation in TBP-ASSOCIATED FACTOR
4b controls meiotic crossover and germline transcription in Arabidopsis. Current
Biology. 2019;29(16):2676-2686.e3. doi:10.1016/j.cub.2019.06.084
apa: Lawrence, E. J., Gao, H., Tock, A. J., Lambing, C., Blackwell, A. R., Feng,
X., & Henderson, I. R. (2019). Natural variation in TBP-ASSOCIATED FACTOR
4b controls meiotic crossover and germline transcription in Arabidopsis. Current
Biology. Elsevier BV. https://doi.org/10.1016/j.cub.2019.06.084
chicago: Lawrence, Emma J., Hongbo Gao, Andrew J. Tock, Christophe Lambing, Alexander
R. Blackwell, Xiaoqi Feng, and Ian R. Henderson. “Natural Variation in TBP-ASSOCIATED
FACTOR 4b Controls Meiotic Crossover and Germline Transcription in Arabidopsis.”
Current Biology. Elsevier BV, 2019. https://doi.org/10.1016/j.cub.2019.06.084.
ieee: E. J. Lawrence et al., “Natural variation in TBP-ASSOCIATED FACTOR
4b controls meiotic crossover and germline transcription in Arabidopsis,” Current
Biology, vol. 29, no. 16. Elsevier BV, p. 2676–2686.e3, 2019.
ista: Lawrence EJ, Gao H, Tock AJ, Lambing C, Blackwell AR, Feng X, Henderson IR.
2019. Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover
and germline transcription in Arabidopsis. Current Biology. 29(16), 2676–2686.e3.
mla: Lawrence, Emma J., et al. “Natural Variation in TBP-ASSOCIATED FACTOR 4b Controls
Meiotic Crossover and Germline Transcription in Arabidopsis.” Current Biology,
vol. 29, no. 16, Elsevier BV, 2019, p. 2676–2686.e3, doi:10.1016/j.cub.2019.06.084.
short: E.J. Lawrence, H. Gao, A.J. Tock, C. Lambing, A.R. Blackwell, X. Feng, I.R.
Henderson, Current Biology 29 (2019) 2676–2686.e3.
date_created: 2023-01-16T09:16:33Z
date_published: 2019-08-19T00:00:00Z
date_updated: 2023-05-08T10:54:54Z
day: '19'
department:
- _id: XiFe
doi: 10.1016/j.cub.2019.06.084
extern: '1'
external_id:
pmid:
- '31378616'
intvolume: ' 29'
issue: '16'
keyword:
- General Agricultural and Biological Sciences
- General Biochemistry
- Genetics and Molecular Biology
language:
- iso: eng
month: '08'
oa_version: None
page: 2676-2686.e3
pmid: 1
publication: Current Biology
publication_identifier:
issn:
- 0960-9822
publication_status: published
publisher: Elsevier BV
quality_controlled: '1'
scopus_import: '1'
status: public
title: Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and
germline transcription in Arabidopsis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2019'
...
---
_id: '12192'
abstract:
- lang: eng
text: Transposable elements (TEs), the movement of which can damage the genome,
are epigenetically silenced in eukaryotes. Intriguingly, TEs are activated in
the sperm companion cell – vegetative cell (VC) – of the flowering plant Arabidopsis
thaliana. However, the extent and mechanism of this activation are unknown. Here
we show that about 100 heterochromatic TEs are activated in VCs, mostly by DEMETER-catalyzed
DNA demethylation. We further demonstrate that DEMETER access to some of these
TEs is permitted by the natural depletion of linker histone H1 in VCs. Ectopically
expressed H1 suppresses TEs in VCs by reducing DNA demethylation and via a methylation-independent
mechanism. We demonstrate that H1 is required for heterochromatin condensation
in plant cells and show that H1 overexpression creates heterochromatic foci in
the VC progenitor cell. Taken together, our results demonstrate that the natural
depletion of H1 during male gametogenesis facilitates DEMETER-directed DNA demethylation,
heterochromatin relaxation, and TE activation.
acknowledgement: We thank David Twell for the pDONR-P4-P1R-pLAT52 and pDONR-P2R-P3-mRFP
vectors, the John Innes Centre Bioimaging Facility (Elaine Barclay and Grant Calder)
for their assistance with microscopy, and the Norwich BioScience Institute Partnership
Computing infrastructure for Science Group for High Performance Computing resources.
This work was funded by a Biotechnology and Biological Sciences Research Council
(BBSRC) David Phillips Fellowship (BB/L025043/1; SH, JZ and XF), a European Research
Council Starting Grant ('SexMeth' 804981; XF) and a Grant to Exceptional Researchers
by the Gatsby Charitable Foundation (SH and XF).
article_number: '42530'
article_processing_charge: No
article_type: original
author:
- first_name: Shengbo
full_name: He, Shengbo
last_name: He
- first_name: Martin
full_name: Vickers, Martin
last_name: Vickers
- first_name: Jingyi
full_name: Zhang, Jingyi
last_name: Zhang
- first_name: Xiaoqi
full_name: Feng, Xiaoqi
id: e0164712-22ee-11ed-b12a-d80fcdf35958
last_name: Feng
orcid: 0000-0002-4008-1234
citation:
ama: He S, Vickers M, Zhang J, Feng X. Natural depletion of histone H1 in sex cells
causes DNA demethylation, heterochromatin decondensation and transposon activation.
eLife. 2019;8. doi:10.7554/elife.42530
apa: He, S., Vickers, M., Zhang, J., & Feng, X. (2019). Natural depletion of
histone H1 in sex cells causes DNA demethylation, heterochromatin decondensation
and transposon activation. ELife. eLife Sciences Publications, Ltd. https://doi.org/10.7554/elife.42530
chicago: He, Shengbo, Martin Vickers, Jingyi Zhang, and Xiaoqi Feng. “Natural Depletion
of Histone H1 in Sex Cells Causes DNA Demethylation, Heterochromatin Decondensation
and Transposon Activation.” ELife. eLife Sciences Publications, Ltd, 2019.
https://doi.org/10.7554/elife.42530.
ieee: S. He, M. Vickers, J. Zhang, and X. Feng, “Natural depletion of histone H1
in sex cells causes DNA demethylation, heterochromatin decondensation and transposon
activation,” eLife, vol. 8. eLife Sciences Publications, Ltd, 2019.
ista: He S, Vickers M, Zhang J, Feng X. 2019. Natural depletion of histone H1 in
sex cells causes DNA demethylation, heterochromatin decondensation and transposon
activation. eLife. 8, 42530.
mla: He, Shengbo, et al. “Natural Depletion of Histone H1 in Sex Cells Causes DNA
Demethylation, Heterochromatin Decondensation and Transposon Activation.” ELife,
vol. 8, 42530, eLife Sciences Publications, Ltd, 2019, doi:10.7554/elife.42530.
short: S. He, M. Vickers, J. Zhang, X. Feng, ELife 8 (2019).
date_created: 2023-01-16T09:17:21Z
date_published: 2019-05-28T00:00:00Z
date_updated: 2023-05-08T10:54:12Z
day: '28'
ddc:
- '580'
department:
- _id: XiFe
doi: 10.7554/elife.42530
extern: '1'
external_id:
unknown:
- '31135340'
file:
- access_level: open_access
checksum: ea6b89c20d59e5eb3646916fe5d568ad
content_type: application/pdf
creator: alisjak
date_created: 2023-02-07T09:42:46Z
date_updated: 2023-02-07T09:42:46Z
file_id: '12525'
file_name: 2019_elife_He.pdf
file_size: 2493837
relation: main_file
success: 1
file_date_updated: 2023-02-07T09:42:46Z
has_accepted_license: '1'
intvolume: ' 8'
keyword:
- General Immunology and Microbiology
- General Biochemistry
- Genetics and Molecular Biology
- General Medicine
- General Neuroscience
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6594752/
month: '05'
oa: 1
oa_version: Published Version
publication: eLife
publication_identifier:
issn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications, Ltd
quality_controlled: '1'
scopus_import: '1'
status: public
title: Natural depletion of histone H1 in sex cells causes DNA demethylation, heterochromatin
decondensation and transposon activation
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: 8
year: '2019'
...
---
_id: '12600'
abstract:
- lang: eng
text: The snow cover dynamics of High Mountain Asia are usually assessed at spatial
resolutions of 250 m or greater, but this scale is too coarse to clearly represent
the rugged topography common to the region. Higher-resolution measurement of snow-covered
area often results in biased sampling due to cloud cover and deep shadows. We
therefore develop a Normalized Difference Snow Index-based workflow to delineate
snow lines from Landsat Thematic Mapper/Enhanced Thematic Mapper+ imagery and
apply it to the upper Langtang Valley in Nepal, processing 194 scenes spanning
1999 to 2013. For each scene, we determine the spatial distribution of snow line
altitudes (SLAs) with respect to aspect and across six subcatchments. Our results
show that the mean SLA exhibits distinct seasonal behavior based on aspect and
subcatchment position. We find that SLA dynamics respond to spatial and seasonal
trade-offs in precipitation, temperature, and solar radiation, which act as primary
controls. We identify two SLA spatial gradients, which we attribute to the effect
of spatially variable precipitation. Our results also reveal that aspect-related
SLA differences vary seasonally and are influenced by solar radiation. In terms
of seasonal dominant controls, we demonstrate that the snow line is controlled
by snow precipitation in winter, melt in premonsoon, a combination of both in
postmonsoon, and temperature in monsoon, explaining to a large extent the spatial
and seasonal variability of the SLA in the upper Langtang Valley. We conclude
that while SLA and snow-covered area are complementary metrics, the SLA has a
strong potential for understanding local-scale snow cover dynamics and their controlling
mechanisms.
article_processing_charge: No
article_type: original
author:
- first_name: Marc
full_name: Girona‐Mata, Marc
last_name: Girona‐Mata
- first_name: Evan S.
full_name: Miles, Evan S.
last_name: Miles
- first_name: Silvan
full_name: Ragettli, Silvan
last_name: Ragettli
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
citation:
ama: Girona‐Mata M, Miles ES, Ragettli S, Pellicciotti F. High‐resolution snowline
delineation from Landsat imagery to infer snow cover controls in a Himalayan catchment.
Water Resources Research. 2019;55(8):6754-6772. doi:10.1029/2019wr024935
apa: Girona‐Mata, M., Miles, E. S., Ragettli, S., & Pellicciotti, F. (2019).
High‐resolution snowline delineation from Landsat imagery to infer snow cover
controls in a Himalayan catchment. Water Resources Research. American Geophysical
Union. https://doi.org/10.1029/2019wr024935
chicago: Girona‐Mata, Marc, Evan S. Miles, Silvan Ragettli, and Francesca Pellicciotti.
“High‐resolution Snowline Delineation from Landsat Imagery to Infer Snow Cover
Controls in a Himalayan Catchment.” Water Resources Research. American
Geophysical Union, 2019. https://doi.org/10.1029/2019wr024935.
ieee: M. Girona‐Mata, E. S. Miles, S. Ragettli, and F. Pellicciotti, “High‐resolution
snowline delineation from Landsat imagery to infer snow cover controls in a Himalayan
catchment,” Water Resources Research, vol. 55, no. 8. American Geophysical
Union, pp. 6754–6772, 2019.
ista: Girona‐Mata M, Miles ES, Ragettli S, Pellicciotti F. 2019. High‐resolution
snowline delineation from Landsat imagery to infer snow cover controls in a Himalayan
catchment. Water Resources Research. 55(8), 6754–6772.
mla: Girona‐Mata, Marc, et al. “High‐resolution Snowline Delineation from Landsat
Imagery to Infer Snow Cover Controls in a Himalayan Catchment.” Water Resources
Research, vol. 55, no. 8, American Geophysical Union, 2019, pp. 6754–72, doi:10.1029/2019wr024935.
short: M. Girona‐Mata, E.S. Miles, S. Ragettli, F. Pellicciotti, Water Resources
Research 55 (2019) 6754–6772.
date_created: 2023-02-20T08:12:59Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2023-02-28T12:14:18Z
day: '01'
doi: 10.1029/2019wr024935
extern: '1'
intvolume: ' 55'
issue: '8'
keyword:
- Water Science and Technology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1029/2019WR024935
month: '08'
oa: 1
oa_version: Published Version
page: 6754-6772
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: High‐resolution snowline delineation from Landsat imagery to infer snow cover
controls in a Himalayan catchment
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2019'
...
---
_id: '12601'
abstract:
- lang: eng
text: Ice cliffs and ponds on debris-covered glaciers have received increased attention
due to their role in amplifying local melt. However, very few studies have looked
at these features on the catchment scale to determine their patterns and changes
in space and time. We have compiled a detailed inventory of cliffs and ponds in
the Langtang catchment, central Himalaya, from six high-resolution satellite orthoimages
and DEMs between 2006 and 2015, and a historic orthophoto from 1974. Cliffs cover
between 1.4% (± 0.4%) in the dry and 3.4% (± 0.9%) in the wet seasons and ponds
between 0.6% (± 0.1%) and 1.6% (± 0.3%) of the total debris-covered tongues. We
find large variations between seasons, as cliffs and ponds tend to grow in the
wetter monsoon period, but there is no obvious trend in total area over the study
period. The inventory further shows that cliffs are predominately north-facing
irrespective of the glacier flow direction. Both cliffs and ponds appear in higher
densities several hundred metres from the terminus in areas where tributaries
reach the main glacier tongue. On the largest glacier in the catchment ~10% of
all cliffs and ponds persisted over nearly a decade.
article_processing_charge: No
article_type: original
author:
- first_name: JAKOB F.
full_name: STEINER, JAKOB F.
last_name: STEINER
- first_name: PASCAL
full_name: BURI, PASCAL
last_name: BURI
- first_name: EVAN S.
full_name: MILES, EVAN S.
last_name: MILES
- first_name: SILVAN
full_name: RAGETTLI, SILVAN
last_name: RAGETTLI
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
citation:
ama: 'STEINER JF, BURI P, MILES ES, RAGETTLI S, Pellicciotti F. Supraglacial ice
cliffs and ponds on debris-covered glaciers: Spatio-temporal distribution and
characteristics. Journal of Glaciology. 2019;65(252):617-632. doi:10.1017/jog.2019.40'
apa: 'STEINER, J. F., BURI, P., MILES, E. S., RAGETTLI, S., & Pellicciotti,
F. (2019). Supraglacial ice cliffs and ponds on debris-covered glaciers: Spatio-temporal
distribution and characteristics. Journal of Glaciology. Cambridge University
Press. https://doi.org/10.1017/jog.2019.40'
chicago: 'STEINER, JAKOB F., PASCAL BURI, EVAN S. MILES, SILVAN RAGETTLI, and Francesca
Pellicciotti. “Supraglacial Ice Cliffs and Ponds on Debris-Covered Glaciers: Spatio-Temporal
Distribution and Characteristics.” Journal of Glaciology. Cambridge University
Press, 2019. https://doi.org/10.1017/jog.2019.40.'
ieee: 'J. F. STEINER, P. BURI, E. S. MILES, S. RAGETTLI, and F. Pellicciotti, “Supraglacial
ice cliffs and ponds on debris-covered glaciers: Spatio-temporal distribution
and characteristics,” Journal of Glaciology, vol. 65, no. 252. Cambridge
University Press, pp. 617–632, 2019.'
ista: 'STEINER JF, BURI P, MILES ES, RAGETTLI S, Pellicciotti F. 2019. Supraglacial
ice cliffs and ponds on debris-covered glaciers: Spatio-temporal distribution
and characteristics. Journal of Glaciology. 65(252), 617–632.'
mla: 'STEINER, JAKOB F., et al. “Supraglacial Ice Cliffs and Ponds on Debris-Covered
Glaciers: Spatio-Temporal Distribution and Characteristics.” Journal of Glaciology,
vol. 65, no. 252, Cambridge University Press, 2019, pp. 617–32, doi:10.1017/jog.2019.40.'
short: J.F. STEINER, P. BURI, E.S. MILES, S. RAGETTLI, F. Pellicciotti, Journal
of Glaciology 65 (2019) 617–632.
date_created: 2023-02-20T08:13:03Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2023-02-28T12:11:07Z
day: '01'
doi: 10.1017/jog.2019.40
extern: '1'
intvolume: ' 65'
issue: '252'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1017/jog.2019.40
month: '08'
oa: 1
oa_version: Published Version
page: 617-632
publication: Journal of Glaciology
publication_identifier:
eissn:
- 1727-5652
issn:
- 0022-1430
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Supraglacial ice cliffs and ponds on debris-covered glaciers: Spatio-temporal
distribution and characteristics'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 65
year: '2019'
...
---
_id: '12602'
abstract:
- lang: eng
text: 'This study aims at developing and applying a spatially-distributed coupled
glacier mass balance and ice-flow model to attribute the response of glaciers
to natural and anthropogenic climate change. We focus on two glaciers with contrasting
surface characteristics: a debris-covered glacier (Langtang Glacier in Nepal)
and a clean-ice glacier (Hintereisferner in Austria). The model is applied from
the end of the Little Ice Age (1850) to the present-day (2016) and is forced with
four bias-corrected General Circulation Models (GCMs) from the historical experiment
of the CMIP5 archive. The selected GCMs represent region-specific warm-dry, warm-wet,
cold-dry, and cold-wet climate conditions. To isolate the effects of anthropogenic
climate change on glacier mass balance and flow runs from these GCMs with and
without further anthropogenic forcing after 1970 until 2016 are selected. The
outcomes indicate that both glaciers experience the largest reduction in area
and volume under warm climate conditions, whereas area and volume reductions are
smaller under cold climate conditions. Simultaneously with changes in glacier
area and volume, surface velocities generally decrease over time. Without further
anthropogenic forcing the results reveal a 3% (9%) smaller decline in glacier
area (volume) for the debris-covered glacier and a 18% (39%) smaller decline in
glacier area (volume) for the clean-ice glacier. The difference in the magnitude
between the two glaciers can mainly be attributed to differences in the response
time of the glaciers, where the clean-ice glacier shows a much faster response
to climate change. We conclude that the response of the two glaciers can mainly
be attributed to anthropogenic climate change and that the impact is larger on
the clean-ice glacier. The outcomes show that the model performs well under different
climate conditions and that the developed approach can be used for regional-scale
glacio-hydrological modeling.'
article_number: '143'
article_processing_charge: No
article_type: original
author:
- first_name: René R.
full_name: Wijngaard, René R.
last_name: Wijngaard
- first_name: Jakob F.
full_name: Steiner, Jakob F.
last_name: Steiner
- first_name: Philip D. A.
full_name: Kraaijenbrink, Philip D. A.
last_name: Kraaijenbrink
- first_name: Christoph
full_name: Klug, Christoph
last_name: Klug
- first_name: Surendra
full_name: Adhikari, Surendra
last_name: Adhikari
- first_name: Argha
full_name: Banerjee, Argha
last_name: Banerjee
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
- first_name: Ludovicus P. H.
full_name: van Beek, Ludovicus P. H.
last_name: van Beek
- first_name: Marc F. P.
full_name: Bierkens, Marc F. P.
last_name: Bierkens
- first_name: Arthur F.
full_name: Lutz, Arthur F.
last_name: Lutz
- first_name: Walter W.
full_name: Immerzeel, Walter W.
last_name: Immerzeel
citation:
ama: Wijngaard RR, Steiner JF, Kraaijenbrink PDA, et al. Modeling the response of
the Langtang Glacier and the Hintereisferner to a changing climate since the Little
Ice Age. Frontiers in Earth Science. 2019;7. doi:10.3389/feart.2019.00143
apa: Wijngaard, R. R., Steiner, J. F., Kraaijenbrink, P. D. A., Klug, C., Adhikari,
S., Banerjee, A., … Immerzeel, W. W. (2019). Modeling the response of the Langtang
Glacier and the Hintereisferner to a changing climate since the Little Ice Age.
Frontiers in Earth Science. Frontiers Media. https://doi.org/10.3389/feart.2019.00143
chicago: Wijngaard, René R., Jakob F. Steiner, Philip D. A. Kraaijenbrink, Christoph
Klug, Surendra Adhikari, Argha Banerjee, Francesca Pellicciotti, et al. “Modeling
the Response of the Langtang Glacier and the Hintereisferner to a Changing Climate
since the Little Ice Age.” Frontiers in Earth Science. Frontiers Media,
2019. https://doi.org/10.3389/feart.2019.00143.
ieee: R. R. Wijngaard et al., “Modeling the response of the Langtang Glacier
and the Hintereisferner to a changing climate since the Little Ice Age,” Frontiers
in Earth Science, vol. 7. Frontiers Media, 2019.
ista: Wijngaard RR, Steiner JF, Kraaijenbrink PDA, Klug C, Adhikari S, Banerjee
A, Pellicciotti F, van Beek LPH, Bierkens MFP, Lutz AF, Immerzeel WW. 2019. Modeling
the response of the Langtang Glacier and the Hintereisferner to a changing climate
since the Little Ice Age. Frontiers in Earth Science. 7, 143.
mla: Wijngaard, René R., et al. “Modeling the Response of the Langtang Glacier and
the Hintereisferner to a Changing Climate since the Little Ice Age.” Frontiers
in Earth Science, vol. 7, 143, Frontiers Media, 2019, doi:10.3389/feart.2019.00143.
short: R.R. Wijngaard, J.F. Steiner, P.D.A. Kraaijenbrink, C. Klug, S. Adhikari,
A. Banerjee, F. Pellicciotti, L.P.H. van Beek, M.F.P. Bierkens, A.F. Lutz, W.W.
Immerzeel, Frontiers in Earth Science 7 (2019).
date_created: 2023-02-20T08:13:08Z
date_published: 2019-06-04T00:00:00Z
date_updated: 2023-02-28T12:04:48Z
day: '04'
doi: 10.3389/feart.2019.00143
extern: '1'
intvolume: ' 7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.3389/feart.2019.00143
month: '06'
oa: 1
oa_version: Published Version
publication: Frontiers in Earth Science
publication_identifier:
issn:
- 2296-6463
publication_status: published
publisher: Frontiers Media
quality_controlled: '1'
scopus_import: '1'
status: public
title: Modeling the response of the Langtang Glacier and the Hintereisferner to a
changing climate since the Little Ice Age
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2019'
...
---
_id: '12901'
article_processing_charge: No
author:
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Janos
full_name: Kiss, Janos
id: 3D3A06F8-F248-11E8-B48F-1D18A9856A87
last_name: Kiss
- first_name: Stefano
full_name: Elefante, Stefano
id: 490F40CE-F248-11E8-B48F-1D18A9856A87
last_name: Elefante
citation:
ama: 'Schlögl A, Kiss J, Elefante S. Is Debian suitable for running an HPC Cluster?
In: AHPC19 - Austrian HPC Meeting 2019 . Institut für Mathematik und wissenschaftliches
Rechnen der Universität Graz; 2019:25.'
apa: 'Schlögl, A., Kiss, J., & Elefante, S. (2019). Is Debian suitable for running
an HPC Cluster? In AHPC19 - Austrian HPC Meeting 2019 (p. 25). Grundlsee,
Austria: Institut für Mathematik und wissenschaftliches Rechnen der Universität
Graz.'
chicago: Schlögl, Alois, Janos Kiss, and Stefano Elefante. “Is Debian Suitable for
Running an HPC Cluster?” In AHPC19 - Austrian HPC Meeting 2019 , 25. Institut
für Mathematik und wissenschaftliches Rechnen der Universität Graz, 2019.
ieee: A. Schlögl, J. Kiss, and S. Elefante, “Is Debian suitable for running an HPC
Cluster?,” in AHPC19 - Austrian HPC Meeting 2019 , Grundlsee, Austria,
2019, p. 25.
ista: 'Schlögl A, Kiss J, Elefante S. 2019. Is Debian suitable for running an HPC
Cluster? AHPC19 - Austrian HPC Meeting 2019 . AHPC: Austrian HPC Meeting, 25.'
mla: Schlögl, Alois, et al. “Is Debian Suitable for Running an HPC Cluster?” AHPC19
- Austrian HPC Meeting 2019 , Institut für Mathematik und wissenschaftliches
Rechnen der Universität Graz, 2019, p. 25.
short: A. Schlögl, J. Kiss, S. Elefante, in:, AHPC19 - Austrian HPC Meeting 2019
, Institut für Mathematik und wissenschaftliches Rechnen der Universität Graz,
2019, p. 25.
conference:
end_date: 2019-02-27
location: Grundlsee, Austria
name: 'AHPC: Austrian HPC Meeting'
start_date: 2019-02-25
date_created: 2023-05-05T12:48:48Z
date_published: 2019-02-27T00:00:00Z
date_updated: 2023-05-16T07:29:32Z
day: '27'
ddc:
- '000'
department:
- _id: ScienComp
file:
- access_level: open_access
checksum: acc8272027faaf30709c51ac5c58ffa4
content_type: application/pdf
creator: dernst
date_created: 2023-05-16T07:27:09Z
date_updated: 2023-05-16T07:27:09Z
file_id: '12970'
file_name: 2019_AHPC_Schloegl.pdf
file_size: 1097603
relation: main_file
success: 1
file_date_updated: 2023-05-16T07:27:09Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://vsc.ac.at/fileadmin/user_upload/vsc/conferences/ahpc19/BOOKLET_AHPC19.pdf
month: '02'
oa: 1
oa_version: Published Version
page: '25'
publication: 'AHPC19 - Austrian HPC Meeting 2019 '
publication_status: published
publisher: Institut für Mathematik und wissenschaftliches Rechnen der Universität
Graz
status: public
title: Is Debian suitable for running an HPC Cluster?
type: conference_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '9726'
abstract:
- lang: eng
text: A detailed description of the two stochastic models, table of parameters,
supplementary data for Figures 4 and 5, parameter dependence of the results, and
an analysis on motors with different force–velocity functions (PDF)
article_processing_charge: No
author:
- first_name: Mehmet C
full_name: Ucar, Mehmet C
id: 50B2A802-6007-11E9-A42B-EB23E6697425
last_name: Ucar
orcid: 0000-0003-0506-4217
- first_name: Reinhard
full_name: Lipowsky, Reinhard
last_name: Lipowsky
citation:
ama: Ucar MC, Lipowsky R. Supplementary information - Collective force generation
by molecular motors is determined by strain-induced unbinding. 2019. doi:10.1021/acs.nanolett.9b04445.s001
apa: Ucar, M. C., & Lipowsky, R. (2019). Supplementary information - Collective
force generation by molecular motors is determined by strain-induced unbinding.
American Chemical Society . https://doi.org/10.1021/acs.nanolett.9b04445.s001
chicago: Ucar, Mehmet C, and Reinhard Lipowsky. “Supplementary Information - Collective
Force Generation by Molecular Motors Is Determined by Strain-Induced Unbinding.”
American Chemical Society , 2019. https://doi.org/10.1021/acs.nanolett.9b04445.s001.
ieee: M. C. Ucar and R. Lipowsky, “Supplementary information - Collective force
generation by molecular motors is determined by strain-induced unbinding.” American
Chemical Society , 2019.
ista: Ucar MC, Lipowsky R. 2019. Supplementary information - Collective force generation
by molecular motors is determined by strain-induced unbinding, American Chemical
Society , 10.1021/acs.nanolett.9b04445.s001.
mla: Ucar, Mehmet C., and Reinhard Lipowsky. Supplementary Information - Collective
Force Generation by Molecular Motors Is Determined by Strain-Induced Unbinding.
American Chemical Society , 2019, doi:10.1021/acs.nanolett.9b04445.s001.
short: M.C. Ucar, R. Lipowsky, (2019).
date_created: 2021-07-27T09:51:46Z
date_published: 2019-12-19T00:00:00Z
date_updated: 2023-08-17T14:07:52Z
day: '19'
department:
- _id: EdHa
doi: 10.1021/acs.nanolett.9b04445.s001
month: '12'
oa_version: Published Version
publisher: 'American Chemical Society '
related_material:
record:
- id: '7166'
relation: used_in_publication
status: public
status: public
title: Supplementary information - Collective force generation by molecular motors
is determined by strain-induced unbinding
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2019'
...
---
_id: '9731'
abstract:
- lang: eng
text: OGs with putative pseudogenes by the number of affected genomes in different
chlamydial species. Frameshift and nonsense mutations located less than 60 bp
upstreamof the gene end or present in a single genome from the corresponding OG
were excluded. (CSV 31 kb)
article_processing_charge: No
author:
- first_name: Olga
full_name: Sigalova, Olga
last_name: Sigalova
- first_name: Andrei
full_name: Chaplin, Andrei
last_name: Chaplin
- first_name: Olga
full_name: Bochkareva, Olga
id: C4558D3C-6102-11E9-A62E-F418E6697425
last_name: Bochkareva
orcid: 0000-0003-1006-6639
- first_name: Pavel
full_name: Shelyakin, Pavel
last_name: Shelyakin
- first_name: Vsevolod
full_name: Filaretov, Vsevolod
last_name: Filaretov
- first_name: Evgeny
full_name: Akkuratov, Evgeny
last_name: Akkuratov
- first_name: Valentina
full_name: Burskaia, Valentina
last_name: Burskaia
- first_name: Mikhail S.
full_name: Gelfand, Mikhail S.
last_name: Gelfand
citation:
ama: Sigalova O, Chaplin A, Bochkareva O, et al. Additional file 11 of Chlamydia
pan-genomic analysis reveals balance between host adaptation and selective pressure
to genome reduction. 2019. doi:10.6084/m9.figshare.9808772.v1
apa: Sigalova, O., Chaplin, A., Bochkareva, O., Shelyakin, P., Filaretov, V., Akkuratov,
E., … Gelfand, M. S. (2019). Additional file 11 of Chlamydia pan-genomic analysis
reveals balance between host adaptation and selective pressure to genome reduction.
Springer Nature. https://doi.org/10.6084/m9.figshare.9808772.v1
chicago: Sigalova, Olga, Andrei Chaplin, Olga Bochkareva, Pavel Shelyakin, Vsevolod
Filaretov, Evgeny Akkuratov, Valentina Burskaia, and Mikhail S. Gelfand. “Additional
File 11 of Chlamydia Pan-Genomic Analysis Reveals Balance between Host Adaptation
and Selective Pressure to Genome Reduction.” Springer Nature, 2019. https://doi.org/10.6084/m9.figshare.9808772.v1.
ieee: O. Sigalova et al., “Additional file 11 of Chlamydia pan-genomic analysis
reveals balance between host adaptation and selective pressure to genome reduction.”
Springer Nature, 2019.
ista: Sigalova O, Chaplin A, Bochkareva O, Shelyakin P, Filaretov V, Akkuratov E,
Burskaia V, Gelfand MS. 2019. Additional file 11 of Chlamydia pan-genomic analysis
reveals balance between host adaptation and selective pressure to genome reduction,
Springer Nature, 10.6084/m9.figshare.9808772.v1.
mla: Sigalova, Olga, et al. Additional File 11 of Chlamydia Pan-Genomic Analysis
Reveals Balance between Host Adaptation and Selective Pressure to Genome Reduction.
Springer Nature, 2019, doi:10.6084/m9.figshare.9808772.v1.
short: O. Sigalova, A. Chaplin, O. Bochkareva, P. Shelyakin, V. Filaretov, E. Akkuratov,
V. Burskaia, M.S. Gelfand, (2019).
date_created: 2021-07-27T14:09:11Z
date_published: 2019-09-12T00:00:00Z
date_updated: 2023-08-30T06:20:21Z
day: '12'
department:
- _id: FyKo
doi: 10.6084/m9.figshare.9808772.v1
main_file_link:
- open_access: '1'
url: https://doi.org/10.6084/m9.figshare.9808772.v1
month: '09'
oa: 1
oa_version: Published Version
publisher: Springer Nature
related_material:
record:
- id: '6898'
relation: used_in_publication
status: public
status: public
title: Additional file 11 of Chlamydia pan-genomic analysis reveals balance between
host adaptation and selective pressure to genome reduction
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2019'
...
---
_id: '9783'
abstract:
- lang: eng
text: Predicted frameshift and nonsense mutations in Chlamydial pan-genome. For
the analysis of putative pseudogenes, events located less than 60 bp. away from
gene end or present in a single genome from the corresponding OG were excluded.
(CSV 600 kb)
article_processing_charge: No
author:
- first_name: Olga M.
full_name: Sigalova, Olga M.
last_name: Sigalova
- first_name: Andrei V.
full_name: Chaplin, Andrei V.
last_name: Chaplin
- first_name: Olga
full_name: Bochkareva, Olga
id: C4558D3C-6102-11E9-A62E-F418E6697425
last_name: Bochkareva
orcid: 0000-0003-1006-6639
- first_name: Pavel V.
full_name: Shelyakin, Pavel V.
last_name: Shelyakin
- first_name: Vsevolod A.
full_name: Filaretov, Vsevolod A.
last_name: Filaretov
- first_name: Evgeny E.
full_name: Akkuratov, Evgeny E.
last_name: Akkuratov
- first_name: Valentina
full_name: Burskaia, Valentina
last_name: Burskaia
- first_name: Mikhail S.
full_name: Gelfand, Mikhail S.
last_name: Gelfand
citation:
ama: Sigalova OM, Chaplin AV, Bochkareva O, et al. Additional file 10 of Chlamydia
pan-genomic analysis reveals balance between host adaptation and selective pressure
to genome reduction. 2019. doi:10.6084/m9.figshare.9808760.v1
apa: Sigalova, O. M., Chaplin, A. V., Bochkareva, O., Shelyakin, P. V., Filaretov,
V. A., Akkuratov, E. E., … Gelfand, M. S. (2019). Additional file 10 of Chlamydia
pan-genomic analysis reveals balance between host adaptation and selective pressure
to genome reduction. Springer Nature. https://doi.org/10.6084/m9.figshare.9808760.v1
chicago: Sigalova, Olga M., Andrei V. Chaplin, Olga Bochkareva, Pavel V. Shelyakin,
Vsevolod A. Filaretov, Evgeny E. Akkuratov, Valentina Burskaia, and Mikhail S.
Gelfand. “Additional File 10 of Chlamydia Pan-Genomic Analysis Reveals Balance
between Host Adaptation and Selective Pressure to Genome Reduction.” Springer
Nature, 2019. https://doi.org/10.6084/m9.figshare.9808760.v1.
ieee: O. M. Sigalova et al., “Additional file 10 of Chlamydia pan-genomic
analysis reveals balance between host adaptation and selective pressure to genome
reduction.” Springer Nature, 2019.
ista: Sigalova OM, Chaplin AV, Bochkareva O, Shelyakin PV, Filaretov VA, Akkuratov
EE, Burskaia V, Gelfand MS. 2019. Additional file 10 of Chlamydia pan-genomic
analysis reveals balance between host adaptation and selective pressure to genome
reduction, Springer Nature, 10.6084/m9.figshare.9808760.v1.
mla: Sigalova, Olga M., et al. Additional File 10 of Chlamydia Pan-Genomic Analysis
Reveals Balance between Host Adaptation and Selective Pressure to Genome Reduction.
Springer Nature, 2019, doi:10.6084/m9.figshare.9808760.v1.
short: O.M. Sigalova, A.V. Chaplin, O. Bochkareva, P.V. Shelyakin, V.A. Filaretov,
E.E. Akkuratov, V. Burskaia, M.S. Gelfand, (2019).
date_created: 2021-08-06T07:59:56Z
date_published: 2019-09-12T00:00:00Z
date_updated: 2023-08-30T06:20:21Z
day: '12'
department:
- _id: FyKo
doi: 10.6084/m9.figshare.9808760.v1
main_file_link:
- open_access: '1'
url: https://doi.org/10.6084/m9.figshare.9808760.v1
month: '09'
oa: 1
oa_version: Published Version
publisher: Springer Nature
related_material:
record:
- id: '6898'
relation: used_in_publication
status: public
status: public
title: Additional file 10 of Chlamydia pan-genomic analysis reveals balance between
host adaptation and selective pressure to genome reduction
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2019'
...