---
_id: '11832'
abstract:
- lang: eng
text: "In this paper, we study the problem of opening centers to cluster a set of
clients in a metric space so as to minimize the sum of the costs of the centers
and of the cluster radii, in a dynamic environment where clients arrive and depart,
and the solution must be updated efficiently while remaining competitive with
respect to the current optimal solution. We call this dynamic sum-of-radii clustering
problem.\r\n\r\nWe present a data structure that maintains a solution whose cost
is within a constant factor of the cost of an optimal solution in metric spaces
with bounded doubling dimension and whose worst-case update time is logarithmic
in the parameters of the problem."
alternative_title:
- LIPIcs
article_number: '48'
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Dariusz
full_name: Leniowski, Dariusz
last_name: Leniowski
- first_name: Claire
full_name: Mathieu, Claire
last_name: Mathieu
citation:
ama: 'Henzinger MH, Leniowski D, Mathieu C. Dynamic clustering to minimize the sum
of radii. In: 25th Annual European Symposium on Algorithms. Vol 87. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ESA.2017.48'
apa: 'Henzinger, M. H., Leniowski, D., & Mathieu, C. (2017). Dynamic clustering
to minimize the sum of radii. In 25th Annual European Symposium on Algorithms
(Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.ESA.2017.48'
chicago: Henzinger, Monika H, Dariusz Leniowski, and Claire Mathieu. “Dynamic Clustering
to Minimize the Sum of Radii.” In 25th Annual European Symposium on Algorithms,
Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.ESA.2017.48.
ieee: M. H. Henzinger, D. Leniowski, and C. Mathieu, “Dynamic clustering to minimize
the sum of radii,” in 25th Annual European Symposium on Algorithms, Vienna,
Austria, 2017, vol. 87.
ista: 'Henzinger MH, Leniowski D, Mathieu C. 2017. Dynamic clustering to minimize
the sum of radii. 25th Annual European Symposium on Algorithms. ESA: Annual European
Symposium on Algorithms, LIPIcs, vol. 87, 48.'
mla: Henzinger, Monika H., et al. “Dynamic Clustering to Minimize the Sum of Radii.”
25th Annual European Symposium on Algorithms, vol. 87, 48, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ESA.2017.48.
short: M.H. Henzinger, D. Leniowski, C. Mathieu, in:, 25th Annual European Symposium
on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
conference:
end_date: 2017-09-06
location: Vienna, Austria
name: 'ESA: Annual European Symposium on Algorithms'
start_date: 2017-09-04
date_created: 2022-08-12T09:58:46Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2023-02-16T11:54:12Z
day: '01'
doi: 10.4230/LIPICS.ESA.2017.48
extern: '1'
external_id:
arxiv:
- '1707.02577'
intvolume: ' 87'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPICS.ESA.2017.48
month: '09'
oa: 1
oa_version: Published Version
publication: 25th Annual European Symposium on Algorithms
publication_identifier:
isbn:
- 978-3-95977-049-1
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamic clustering to minimize the sum of radii
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 87
year: '2017'
...
---
_id: '11874'
abstract:
- lang: eng
text: "We consider the problem of maintaining an approximately maximum (fractional)
matching and an approximately minimum vertex cover in a dynamic graph. Starting
with the seminal paper by Onak and Rubinfeld [STOC 2010], this problem has received
significant attention in recent years. There remains, however, a polynomial gap
between the best known worst case update time and the best known amortised update
time for this problem, even after allowing for randomisation. Specifically, Bernstein
and Stein [ICALP 2015, SODA 2016] have the best known worst case update time.
They present a deterministic data structure with approximation ratio (3/2 + ∊)
and worst case update time O(m1/4/ ∊2), where m is the number of edges in the
graph. In recent past, Gupta and Peng [FOCS 2013] gave a deterministic data structure
with approximation ratio (1+ ∊) and worst case update time No known randomised
data structure beats the worst case update times of these two results. In contrast,
the paper by Onak and Rubinfeld [STOC 2010] gave a randomised data structure with
approximation ratio O(1) and amortised update time O(log2 n), where n is the number
of nodes in the graph. This was later improved by Baswana, Gupta and Sen [FOCS
2011] and Solomon [FOCS 2016], leading to a randomised date structure with approximation
ratio 2 and amortised update time O(1).\r\n\r\nWe bridge the polynomial gap between
the worst case and amortised update times for this problem, without using any
randomisation. We present a deterministic data structure with approximation ratio
(2 + ∊) and worst case update time O(log3 n), for all sufficiently small constants
∊."
article_processing_charge: No
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. Fully dynamic approximate maximum
matching and minimum vertex cover in o(log3 n) worst case update time. In: 28th
Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 0. Society for Industrial
and Applied Mathematics; 2017:470-489. doi:10.1137/1.9781611974782.30'
apa: 'Bhattacharya, S., Henzinger, M. H., & Nanongkai, D. (2017). Fully dynamic
approximate maximum matching and minimum vertex cover in o(log3 n) worst case
update time. In 28th Annual ACM-SIAM Symposium on Discrete Algorithms (Vol.
0, pp. 470–489). Barcelona, Spain: Society for Industrial and Applied Mathematics.
https://doi.org/10.1137/1.9781611974782.30'
chicago: Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “Fully
Dynamic Approximate Maximum Matching and Minimum Vertex Cover in o(Log3 n) Worst
Case Update Time.” In 28th Annual ACM-SIAM Symposium on Discrete Algorithms,
0:470–89. Society for Industrial and Applied Mathematics, 2017. https://doi.org/10.1137/1.9781611974782.30.
ieee: S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “Fully dynamic approximate
maximum matching and minimum vertex cover in o(log3 n) worst case update time,”
in 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain,
2017, vol. 0, pp. 470–489.
ista: 'Bhattacharya S, Henzinger MH, Nanongkai D. 2017. Fully dynamic approximate
maximum matching and minimum vertex cover in o(log3 n) worst case update time.
28th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete
Algorithms vol. 0, 470–489.'
mla: Bhattacharya, Sayan, et al. “Fully Dynamic Approximate Maximum Matching and
Minimum Vertex Cover in o(Log3 n) Worst Case Update Time.” 28th Annual ACM-SIAM
Symposium on Discrete Algorithms, vol. 0, Society for Industrial and Applied
Mathematics, 2017, pp. 470–89, doi:10.1137/1.9781611974782.30.
short: S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 28th Annual ACM-SIAM
Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics,
2017, pp. 470–489.
conference:
end_date: 2017-01-19
location: Barcelona, Spain
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2017-01-16
date_created: 2022-08-16T12:28:27Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-02-17T11:54:22Z
day: '01'
doi: 10.1137/1.9781611974782.30
extern: '1'
external_id:
arxiv:
- '1704.02844'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1704.02844
month: '01'
oa: 1
oa_version: Preprint
page: 470 - 489
publication: 28th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- 978-161197478-2
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fully dynamic approximate maximum matching and minimum vertex cover in o(log3
n) worst case update time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: '0'
year: '2017'
...
---
_id: '11873'
abstract:
- lang: eng
text: "We study the problem of computing a minimum cut in a simple, undirected graph
and give a deterministic O(m log2 n log log2 n) time algorithm. This improves
both on the best previously known deterministic running time of O(m log12 n) (Kawarabayashi
and Thorup [12]) and the best previously known randomized running time of O(mlog3n)
(Karger [11]) for this problem, though Karger's algorithm can be further applied
to weighted graphs.\r\n\r\nOur approach is using the Kawarabayashi and Tho- rup
graph compression technique, which repeatedly finds low-conductance cuts. To find
these cuts they use a diffusion-based local algorithm. We use instead a flow-
based local algorithm and suitably adjust their framework to work with our flow-based
subroutine. Both flow and diffusion based methods have a long history of being
applied to finding low conductance cuts. Diffusion algorithms have several variants
that are naturally local while it is more complicated to make flow methods local.
Some prior work has proven nice properties for local flow based algorithms with
respect to improving or cleaning up low conductance cuts. Our flow subroutine,
however, is the first that is both local and produces low conductance cuts. Thus,
it may be of independent interest."
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Satish
full_name: Rao, Satish
last_name: Rao
- first_name: Di
full_name: Wang, Di
last_name: Wang
citation:
ama: 'Henzinger MH, Rao S, Wang D. Local flow partitioning for faster edge connectivity.
In: 28th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for
Industrial and Applied Mathematics; 2017:1919-1938. doi:10.1137/1.9781611974782.125'
apa: 'Henzinger, M. H., Rao, S., & Wang, D. (2017). Local flow partitioning
for faster edge connectivity. In 28th Annual ACM-SIAM Symposium on Discrete
Algorithms (pp. 1919–1938). Barcelona, Spain: Society for Industrial and Applied
Mathematics. https://doi.org/10.1137/1.9781611974782.125'
chicago: Henzinger, Monika H, Satish Rao, and Di Wang. “Local Flow Partitioning
for Faster Edge Connectivity.” In 28th Annual ACM-SIAM Symposium on Discrete
Algorithms, 1919–38. Society for Industrial and Applied Mathematics, 2017.
https://doi.org/10.1137/1.9781611974782.125.
ieee: M. H. Henzinger, S. Rao, and D. Wang, “Local flow partitioning for faster
edge connectivity,” in 28th Annual ACM-SIAM Symposium on Discrete Algorithms,
Barcelona, Spain, 2017, pp. 1919–1938.
ista: 'Henzinger MH, Rao S, Wang D. 2017. Local flow partitioning for faster edge
connectivity. 28th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium
on Discrete Algorithms, 1919–1938.'
mla: Henzinger, Monika H., et al. “Local Flow Partitioning for Faster Edge Connectivity.”
28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial
and Applied Mathematics, 2017, pp. 1919–38, doi:10.1137/1.9781611974782.125.
short: M.H. Henzinger, S. Rao, D. Wang, in:, 28th Annual ACM-SIAM Symposium on Discrete
Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 1919–1938.
conference:
end_date: 2017-01-19
location: Barcelona, Spain
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2017-01-16
date_created: 2022-08-16T12:20:59Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-02-21T16:32:01Z
day: '01'
doi: 10.1137/1.9781611974782.125
extern: '1'
external_id:
arxiv:
- '1704.01254'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1704.01254
month: '01'
oa: 1
oa_version: Preprint
page: 1919-1938
publication: 28th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- 978-161197478-2
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '11889'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Local flow partitioning for faster edge connectivity
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '11831'
abstract:
- lang: eng
text: "Graph Sparsification aims at compressing large graphs into smaller ones while
(approximately) preserving important characteristics of the input graph. In this
work we study Vertex Sparsifiers, i.e., sparsifiers whose goal is to reduce the
number of vertices. Given a weighted graph G=(V,E), and a terminal set K with
|K|=k, a quality-q vertex cut sparsifier of G is a graph H with K contained in
V_H that preserves the value of minimum cuts separating any bipartition of K,
up to a factor of q. We show that planar graphs with all the k terminals lying
on the same face admit quality-1 vertex cut sparsifier of size O(k^2) that are
also planar. Our result extends to vertex flow and distance sparsifiers. It improves
the previous best known bound of O(k^2 2^(2k)) for cut and flow sparsifiers by
an exponential factor, and matches an Omega(k^2) lower-bound for this class of
graphs.\r\n\r\nWe also study vertex reachability sparsifiers for directed graphs.
Given a digraph G=(V,E) and a terminal set K, a vertex reachability sparsifier
of G is a digraph H=(V_H,E_H), K contained in V_H that preserves all reachability
information among terminal pairs. We introduce the notion of reachability-preserving
minors, i.e., we require H to be a minor of G. Among others, for general planar
digraphs, we construct reachability-preserving minors of size O(k^2 log^2 k).
We complement our upper-bound by showing that there exists an infinite family
of acyclic planar digraphs such that any reachability-preserving minor must have
Omega(k^2) vertices."
alternative_title:
- LIPIcs
article_number: '44'
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: Pan
full_name: Peng, Pan
last_name: Peng
citation:
ama: 'Goranci G, Henzinger MH, Peng P. Improved guarantees for vertex sparsification
in planar graphs. In: 25th Annual European Symposium on Algorithms. Vol
87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ESA.2017.44'
apa: 'Goranci, G., Henzinger, M. H., & Peng, P. (2017). Improved guarantees
for vertex sparsification in planar graphs. In 25th Annual European Symposium
on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPICS.ESA.2017.44'
chicago: Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Improved Guarantees
for Vertex Sparsification in Planar Graphs.” In 25th Annual European Symposium
on Algorithms, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017. https://doi.org/10.4230/LIPICS.ESA.2017.44.
ieee: G. Goranci, M. H. Henzinger, and P. Peng, “Improved guarantees for vertex
sparsification in planar graphs,” in 25th Annual European Symposium on Algorithms,
Vienna, Austria, 2017, vol. 87.
ista: 'Goranci G, Henzinger MH, Peng P. 2017. Improved guarantees for vertex sparsification
in planar graphs. 25th Annual European Symposium on Algorithms. ESA: Annual European
Symposium on Algorithms, LIPIcs, vol. 87, 44.'
mla: Goranci, Gramoz, et al. “Improved Guarantees for Vertex Sparsification in Planar
Graphs.” 25th Annual European Symposium on Algorithms, vol. 87, 44, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ESA.2017.44.
short: G. Goranci, M.H. Henzinger, P. Peng, in:, 25th Annual European Symposium
on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
conference:
end_date: 2017-09-06
location: Vienna, Austria
name: 'ESA: Annual European Symposium on Algorithms'
start_date: 2017-09-04
date_created: 2022-08-12T09:27:11Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2023-02-21T16:32:16Z
day: '01'
doi: 10.4230/LIPICS.ESA.2017.44
extern: '1'
external_id:
arxiv:
- '1702.01136'
intvolume: ' 87'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.ESA.2017.44
month: '09'
oa: 1
oa_version: Published Version
publication: 25th Annual European Symposium on Algorithms
publication_identifier:
isbn:
- 978-3-95977-049-1
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '11894'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Improved guarantees for vertex sparsification in planar graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 87
year: '2017'
...
---
_id: '11903'
abstract:
- lang: eng
text: "Online social networks allow the collection of large amounts of data about
the influence between users connected by a friendship-like relationship. When
distributing items among agents forming a social network, this information allows
us to exploit network externalities that each agent receives from his neighbors
that get the same item. In this paper we consider Friends-of-Friends (2-hop) network
externalities, i.e., externalities that not only depend on the neighbors that
get the same item but also on neighbors of neighbors. For these externalities
we study a setting where multiple different items are assigned to unit-demand
agents. Specifically, we study the problem of welfare maximization under different
types of externality functions. Let n be the number of agents and m be the number
of items. Our contributions are the following: (1) We show that welfare maximization
is APX-hard; we show that even for step functions with 2-hop (and also with 1-hop)
externalities it is NP-hard to approximate social welfare better than (1−1/e).
(2) On the positive side we present (i) an \U0001D442(\U0001D45B√)-approximation
algorithm for general concave externality functions, (ii) an O(log m)-approximation
algorithm for linear externality functions, and (iii) a 518(1−1/\U0001D452)-approximation
algorithm for 2-hop step function externalities. We also improve the result from
[7] for 1-hop step function externalities by giving a 12(1−1/\U0001D452)-approximation
algorithm."
article_processing_charge: No
article_type: original
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- first_name: Wolfgang
full_name: Dvořák, Wolfgang
last_name: Dvořák
- 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: Martin
full_name: Starnberger, Martin
last_name: Starnberger
citation:
ama: Bhattacharya S, Dvořák W, Henzinger MH, Starnberger M. Welfare maximization
with friends-of-friends network externalities. Theory of Computing Systems.
2017;61(4):948-986. doi:10.1007/s00224-017-9759-8
apa: Bhattacharya, S., Dvořák, W., Henzinger, M. H., & Starnberger, M. (2017).
Welfare maximization with friends-of-friends network externalities. Theory
of Computing Systems. Springer Nature. https://doi.org/10.1007/s00224-017-9759-8
chicago: Bhattacharya, Sayan, Wolfgang Dvořák, Monika H Henzinger, and Martin Starnberger.
“Welfare Maximization with Friends-of-Friends Network Externalities.” Theory
of Computing Systems. Springer Nature, 2017. https://doi.org/10.1007/s00224-017-9759-8.
ieee: S. Bhattacharya, W. Dvořák, M. H. Henzinger, and M. Starnberger, “Welfare
maximization with friends-of-friends network externalities,” Theory of Computing
Systems, vol. 61, no. 4. Springer Nature, pp. 948–986, 2017.
ista: Bhattacharya S, Dvořák W, Henzinger MH, Starnberger M. 2017. Welfare maximization
with friends-of-friends network externalities. Theory of Computing Systems. 61(4),
948–986.
mla: Bhattacharya, Sayan, et al. “Welfare Maximization with Friends-of-Friends Network
Externalities.” Theory of Computing Systems, vol. 61, no. 4, Springer Nature,
2017, pp. 948–86, doi:10.1007/s00224-017-9759-8.
short: S. Bhattacharya, W. Dvořák, M.H. Henzinger, M. Starnberger, Theory of Computing
Systems 61 (2017) 948–986.
date_created: 2022-08-17T11:14:12Z
date_published: 2017-11-01T00:00:00Z
date_updated: 2023-02-21T16:29:58Z
day: '01'
doi: 10.1007/s00224-017-9759-8
extern: '1'
intvolume: ' 61'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/s00224-017-9759-8
month: '11'
oa: 1
oa_version: Published Version
page: 948-986
publication: Theory of Computing Systems
publication_identifier:
eissn:
- 1433-0490
issn:
- 1432-4350
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '11837'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Welfare maximization with friends-of-friends network externalities
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 61
year: '2017'
...
---
_id: '1191'
abstract:
- lang: eng
text: Variation in genotypes may be responsible for differences in dispersal rates,
directional biases, and growth rates of individuals. These traits may favor certain
genotypes and enhance their spatiotemporal spreading into areas occupied by the
less advantageous genotypes. We study how these factors influence the speed of
spreading in the case of two competing genotypes under the assumption that spatial
variation of the total population is small compared to the spatial variation of
the frequencies of the genotypes in the population. In that case, the dynamics
of the frequency of one of the genotypes is approximately described by a generalized
Fisher–Kolmogorov–Petrovskii–Piskunov (F–KPP) equation. This generalized F–KPP
equation with (nonlinear) frequency-dependent diffusion and advection terms admits
traveling wave solutions that characterize the invasion of the dominant genotype.
Our existence results generalize the classical theory for traveling waves for
the F–KPP with constant coefficients. Moreover, in the particular case of the
quadratic (monostable) nonlinear growth–decay rate in the generalized F–KPP we
study in detail the influence of the variance in diffusion and mean displacement
rates of the two genotypes on the minimal wave propagation speed.
acknowledgement: "We thank Nick Barton, Katarína Bod’ová, and Sr\r\n-\r\ndan Sarikas
for constructive feed-\r\nback and support. Furthermore, we would like to express
our deep gratitude to the anonymous referees (one\r\nof whom, Jimmy Garnier, agreed
to reveal his identity) and the editor Max Souza, for very helpful and\r\ndetailed
comments and suggestions that significantly helped us to improve the manuscript.
This project has\r\nreceived funding from the European Union’s Seventh Framework
Programme for research, technological\r\ndevelopment and demonstration under Grant
Agreement 618091 Speed of Adaptation in Population Genet-\r\nics and Evolutionary
Computation (SAGE) and the European Research Council (ERC) Grant No. 250152\r\n(SN),
from the Scientific Grant Agency of the Slovak Republic under the Grant 1/0459/13
and by the Slovak\r\nResearch and Development Agency under the Contract No. APVV-14-0378
(RK). RK would also like to\r\nthank IST Austria for its hospitality during the
work on this project."
author:
- first_name: Richard
full_name: Kollár, Richard
last_name: Kollár
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
citation:
ama: Kollár R, Novak S. Existence of traveling waves for the generalized F–KPP equation.
Bulletin of Mathematical Biology. 2017;79(3):525-559. doi:10.1007/s11538-016-0244-3
apa: Kollár, R., & Novak, S. (2017). Existence of traveling waves for the generalized
F–KPP equation. Bulletin of Mathematical Biology. Springer. https://doi.org/10.1007/s11538-016-0244-3
chicago: Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for
the Generalized F–KPP Equation.” Bulletin of Mathematical Biology. Springer,
2017. https://doi.org/10.1007/s11538-016-0244-3.
ieee: R. Kollár and S. Novak, “Existence of traveling waves for the generalized
F–KPP equation,” Bulletin of Mathematical Biology, vol. 79, no. 3. Springer,
pp. 525–559, 2017.
ista: Kollár R, Novak S. 2017. Existence of traveling waves for the generalized
F–KPP equation. Bulletin of Mathematical Biology. 79(3), 525–559.
mla: Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the
Generalized F–KPP Equation.” Bulletin of Mathematical Biology, vol. 79,
no. 3, Springer, 2017, pp. 525–59, doi:10.1007/s11538-016-0244-3.
short: R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559.
date_created: 2018-12-11T11:50:38Z
date_published: 2017-03-01T00:00:00Z
date_updated: 2021-01-12T06:48:58Z
day: '01'
department:
- _id: NiBa
doi: 10.1007/s11538-016-0244-3
ec_funded: 1
intvolume: ' 79'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1607.00944
month: '03'
oa: 1
oa_version: Preprint
page: 525-559
project:
- _id: 25B1EC9E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618091'
name: Speed of Adaptation in Population Genetics and Evolutionary Computation
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Bulletin of Mathematical Biology
publication_status: published
publisher: Springer
publist_id: '6160'
quality_controlled: '1'
scopus_import: 1
status: public
title: Existence of traveling waves for the generalized F–KPP equation
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 79
year: '2017'
...
---
_id: '11976'
abstract:
- lang: eng
text: The way organic multistep synthesis is performed is changing due to the adoption
of flow chemical techniques, which has enabled the development of improved methods
to make complex molecules. The modular nature of the technique provides not only
access to target molecules via linear flow approaches but also for the targeting
of structural cores with single systems. This perspective article summarizes the
state of the art of continuous multistep synthesis and discusses the main challenges
and opportunities in this area.
article_processing_charge: No
article_type: original
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: Kerry
full_name: Gilmore, Kerry
last_name: Gilmore
- first_name: Peter H.
full_name: Seeberger, Peter H.
last_name: Seeberger
citation:
ama: Pieber B, Gilmore K, Seeberger PH. Integrated flow processing - challenges
in continuous multistep synthesis. Journal of Flow Chemistry. 2017;7(3-4):129-136.
doi:10.1556/1846.2017.00016
apa: Pieber, B., Gilmore, K., & Seeberger, P. H. (2017). Integrated flow processing
- challenges in continuous multistep synthesis. Journal of Flow Chemistry.
AKJournals. https://doi.org/10.1556/1846.2017.00016
chicago: Pieber, Bartholomäus, Kerry Gilmore, and Peter H. Seeberger. “Integrated
Flow Processing - Challenges in Continuous Multistep Synthesis.” Journal of
Flow Chemistry. AKJournals, 2017. https://doi.org/10.1556/1846.2017.00016.
ieee: B. Pieber, K. Gilmore, and P. H. Seeberger, “Integrated flow processing -
challenges in continuous multistep synthesis,” Journal of Flow Chemistry,
vol. 7, no. 3–4. AKJournals, pp. 129–136, 2017.
ista: Pieber B, Gilmore K, Seeberger PH. 2017. Integrated flow processing - challenges
in continuous multistep synthesis. Journal of Flow Chemistry. 7(3–4), 129–136.
mla: Pieber, Bartholomäus, et al. “Integrated Flow Processing - Challenges in Continuous
Multistep Synthesis.” Journal of Flow Chemistry, vol. 7, no. 3–4, AKJournals,
2017, pp. 129–36, doi:10.1556/1846.2017.00016.
short: B. Pieber, K. Gilmore, P.H. Seeberger, Journal of Flow Chemistry 7 (2017)
129–136.
date_created: 2022-08-25T10:47:51Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2023-02-21T10:10:02Z
day: '01'
doi: 10.1556/1846.2017.00016
extern: '1'
intvolume: ' 7'
issue: 3-4
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1556/1846.2017.00016
month: '09'
oa: 1
oa_version: Published Version
page: 129-136
publication: Journal of Flow Chemistry
publication_identifier:
eissn:
- 2063-0212
issn:
- 2062-249X
publication_status: published
publisher: AKJournals
quality_controlled: '1'
scopus_import: '1'
status: public
title: Integrated flow processing - challenges in continuous multistep synthesis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2017'
...
---
_id: '1211'
abstract:
- lang: eng
text: Systems such as fluid flows in channels and pipes or the complex Ginzburg–Landau
system, defined over periodic domains, exhibit both continuous symmetries, translational
and rotational, as well as discrete symmetries under spatial reflections or complex
conjugation. The simplest, and very common symmetry of this type is the equivariance
of the defining equations under the orthogonal group O(2). We formulate a novel
symmetry reduction scheme for such systems by combining the method of slices with
invariant polynomial methods, and show how it works by applying it to the Kuramoto–Sivashinsky
system in one spatial dimension. As an example, we track a relative periodic orbit
through a sequence of bifurcations to the onset of chaos. Within the symmetry-reduced
state space we are able to compute and visualize the unstable manifolds of relative
periodic orbits, their torus bifurcations, a transition to chaos via torus breakdown,
and heteroclinic connections between various relative periodic orbits. It would
be very hard to carry through such analysis in the full state space, without a
symmetry reduction such as the one we present here.
acknowledgement: 'This work was supported by the family of late G. Robinson, Jr. and
NSF Grant DMS-1211827. '
author:
- first_name: Nazmi B
full_name: Budanur, Nazmi B
id: 3EA1010E-F248-11E8-B48F-1D18A9856A87
last_name: Budanur
orcid: 0000-0003-0423-5010
- first_name: Predrag
full_name: Cvitanović, Predrag
last_name: Cvitanović
citation:
ama: Budanur NB, Cvitanović P. Unstable manifolds of relative periodic orbits in
the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal
of Statistical Physics. 2017;167(3-4):636-655. doi:10.1007/s10955-016-1672-z
apa: Budanur, N. B., & Cvitanović, P. (2017). Unstable manifolds of relative
periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky
system. Journal of Statistical Physics. Springer. https://doi.org/10.1007/s10955-016-1672-z
chicago: Budanur, Nazmi B, and Predrag Cvitanović. “Unstable Manifolds of Relative
Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky
System.” Journal of Statistical Physics. Springer, 2017. https://doi.org/10.1007/s10955-016-1672-z.
ieee: N. B. Budanur and P. Cvitanović, “Unstable manifolds of relative periodic
orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system,”
Journal of Statistical Physics, vol. 167, no. 3–4. Springer, pp. 636–655,
2017.
ista: Budanur NB, Cvitanović P. 2017. Unstable manifolds of relative periodic orbits
in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal
of Statistical Physics. 167(3–4), 636–655.
mla: Budanur, Nazmi B., and Predrag Cvitanović. “Unstable Manifolds of Relative
Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky
System.” Journal of Statistical Physics, vol. 167, no. 3–4, Springer, 2017,
pp. 636–55, doi:10.1007/s10955-016-1672-z.
short: N.B. Budanur, P. Cvitanović, Journal of Statistical Physics 167 (2017) 636–655.
date_created: 2018-12-11T11:50:44Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2021-01-12T06:49:07Z
day: '01'
ddc:
- '530'
department:
- _id: BjHo
doi: 10.1007/s10955-016-1672-z
file:
- access_level: open_access
checksum: 3e971d09eb167761aa0888ed415b0056
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:01Z
date_updated: 2020-07-14T12:44:39Z
file_id: '5319'
file_name: IST-2017-782-v1+1_BudCvi15.pdf
file_size: 2820207
relation: main_file
file_date_updated: 2020-07-14T12:44:39Z
has_accepted_license: '1'
intvolume: ' 167'
issue: 3-4
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 636-655
publication: Journal of Statistical Physics
publication_status: published
publisher: Springer
publist_id: '6136'
pubrep_id: '782'
quality_controlled: '1'
scopus_import: 1
status: public
title: Unstable manifolds of relative periodic orbits in the symmetry reduced state
space of the Kuramoto–Sivashinsky system
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 167
year: '2017'
...
---
_id: '123'
abstract:
- lang: eng
text: The Leidenfrost effect occurs when an object near a hot surface vaporizes
rapidly enough to lift itself up and hover. Although well understood for liquids
and stiff sublimable solids, nothing is known about the effect with materials
whose stiffness lies between these extremes. Here we introduce a new phenomenon
that occurs with vaporizable soft solids - the elastic Leidenfrost effect. By
dropping hydrogel spheres onto hot surfaces we find that, rather than hovering,
they energetically bounce several times their diameter for minutes at a time.
With high-speed video during a single impact, we uncover high-frequency microscopic
gap dynamics at the sphere/substrate interface. We show how these otherwise-hidden
agitations constitute work cycles that harvest mechanical energy from the vapour
and sustain the bouncing. Our findings suggest a new strategy for injecting mechanical
energy into a widely used class of soft materials, with potential relevance to
fields such as active matter, soft robotics and microfluidics.
acknowledgement: A.S. acknowledges funding from the Delta Institute for Theoretical
Physics and the hospitality of the IBS Center for Theoretical Physics of Complex
Systems, Daejeon, South Korea. We acknowledge funding from the Netherlands Organisation
for Scientific Research through grants VICI No. NWO-680-47-609 (M.v.H. and S.R.W.),
VENI No. NWO-680-47-445 (C.C.) and VENI No. NWO-680-47-453 (S.R.W.).
author:
- first_name: Scott R
full_name: Waitukaitis, Scott R
id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
last_name: Waitukaitis
orcid: 0000-0002-2299-3176
- first_name: Antal
full_name: Zuiderwijk, Antal
last_name: Zuiderwijk
- first_name: Anton
full_name: Souslov, Anton
last_name: Souslov
- first_name: Corentin
full_name: Coulais, Corentin
last_name: Coulais
- first_name: Martin
full_name: Van Hecke, Martin
last_name: Van Hecke
citation:
ama: Waitukaitis SR, Zuiderwijk A, Souslov A, Coulais C, Van Hecke M. Coupling the
Leidenfrost effect and elastic deformations to power sustained bouncing. Nature
Physics. 2017;13(11):1095-1099. doi:10.1038/nphys4194
apa: Waitukaitis, S. R., Zuiderwijk, A., Souslov, A., Coulais, C., & Van Hecke,
M. (2017). Coupling the Leidenfrost effect and elastic deformations to power sustained
bouncing. Nature Physics. Nature Publishing Group. https://doi.org/10.1038/nphys4194
chicago: Waitukaitis, Scott R, Antal Zuiderwijk, Anton Souslov, Corentin Coulais,
and Martin Van Hecke. “Coupling the Leidenfrost Effect and Elastic Deformations
to Power Sustained Bouncing.” Nature Physics. Nature Publishing Group,
2017. https://doi.org/10.1038/nphys4194.
ieee: S. R. Waitukaitis, A. Zuiderwijk, A. Souslov, C. Coulais, and M. Van Hecke,
“Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing,”
Nature Physics, vol. 13, no. 11. Nature Publishing Group, pp. 1095–1099,
2017.
ista: Waitukaitis SR, Zuiderwijk A, Souslov A, Coulais C, Van Hecke M. 2017. Coupling
the Leidenfrost effect and elastic deformations to power sustained bouncing. Nature
Physics. 13(11), 1095–1099.
mla: Waitukaitis, Scott R., et al. “Coupling the Leidenfrost Effect and Elastic
Deformations to Power Sustained Bouncing.” Nature Physics, vol. 13, no.
11, Nature Publishing Group, 2017, pp. 1095–99, doi:10.1038/nphys4194.
short: S.R. Waitukaitis, A. Zuiderwijk, A. Souslov, C. Coulais, M. Van Hecke, Nature
Physics 13 (2017) 1095–1099.
date_created: 2018-12-11T11:44:45Z
date_published: 2017-07-24T00:00:00Z
date_updated: 2021-01-12T06:49:14Z
day: '24'
doi: 10.1038/nphys4194
extern: '1'
external_id:
arxiv:
- '1705.03530'
intvolume: ' 13'
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.03530
month: '07'
oa: 1
oa_version: Preprint
page: 1095 - 1099
publication: Nature Physics
publication_status: published
publisher: Nature Publishing Group
publist_id: '7931'
quality_controlled: '1'
status: public
title: Coupling the Leidenfrost effect and elastic deformations to power sustained
bouncing
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2017'
...
---
_id: '12571'
abstract:
- lang: eng
text: We consider the problems of maintaining approximate maximum matching and minimum
vertex cover in a dynamic graph. Starting with the seminal work of Onak and Rubinfeld
[STOC 2010], this problem has received significant attention in recent years.
Very recently, extending the framework of Baswana, Gupta and Sen [FOCS 2011],
Solomon [FOCS 2016] gave a randomized 2-approximation dynamic algorithm for this
problem that has amortized update time of O(1) with high probability. We consider
the natural open question of derandomizing this result. We present a new deterministic
fully dynamic algorithm that maintains a O(1)-approximate minimum vertex cover
and maximum fractional matching, with an amortized update time of O(1). Previously,
the best deterministic algorithm for this problem was due to Bhattacharya, Henzinger
and Italiano [SODA 2015]; it had an approximation ratio of (2+ϵ) and an amortized
update time of O(logn/ϵ2). Our result can be generalized to give a fully dynamic
O(f3)-approximation algorithm with O(f2) amortized update time for the hypergraph
vertex cover and fractional matching problems, where every hyperedge has at most
f vertices.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- first_name: Deeparnab
full_name: Chakrabarty, Deeparnab
last_name: Chakrabarty
- 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: 'Bhattacharya S, Chakrabarty D, Henzinger MH. Deterministic fully dynamic approximate
vertex cover and fractional matching in O(1) amortized update time. In: 19th
International Conference on Integer Programming and Combinatorial Optimization.
Vol 10328. Springer Nature; 2017:86-98. doi:10.1007/978-3-319-59250-3_8'
apa: 'Bhattacharya, S., Chakrabarty, D., & Henzinger, M. H. (2017). Deterministic
fully dynamic approximate vertex cover and fractional matching in O(1) amortized
update time. In 19th International Conference on Integer Programming and Combinatorial
Optimization (Vol. 10328, pp. 86–98). Waterloo, ON, Canada: Springer Nature.
https://doi.org/10.1007/978-3-319-59250-3_8'
chicago: Bhattacharya, Sayan, Deeparnab Chakrabarty, and Monika H Henzinger. “Deterministic
Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized
Update Time.” In 19th International Conference on Integer Programming and Combinatorial
Optimization, 10328:86–98. Springer Nature, 2017. https://doi.org/10.1007/978-3-319-59250-3_8.
ieee: S. Bhattacharya, D. Chakrabarty, and M. H. Henzinger, “Deterministic fully
dynamic approximate vertex cover and fractional matching in O(1) amortized update
time,” in 19th International Conference on Integer Programming and Combinatorial
Optimization, Waterloo, ON, Canada, 2017, vol. 10328, pp. 86–98.
ista: 'Bhattacharya S, Chakrabarty D, Henzinger MH. 2017. Deterministic fully dynamic
approximate vertex cover and fractional matching in O(1) amortized update time.
19th International Conference on Integer Programming and Combinatorial Optimization.
IPCO: Integer Programming and Combinatorial Optimization, LNCS, vol. 10328, 86–98.'
mla: Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Approximate Vertex
Cover and Fractional Matching in O(1) Amortized Update Time.” 19th International
Conference on Integer Programming and Combinatorial Optimization, vol. 10328,
Springer Nature, 2017, pp. 86–98, doi:10.1007/978-3-319-59250-3_8.
short: S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, in:, 19th International
Conference on Integer Programming and Combinatorial Optimization, Springer Nature,
2017, pp. 86–98.
conference:
end_date: 2017-06-28
location: Waterloo, ON, Canada
name: 'IPCO: Integer Programming and Combinatorial Optimization'
start_date: 2017-06-26
date_created: 2023-02-20T07:52:31Z
date_published: 2017-05-24T00:00:00Z
date_updated: 2023-02-20T07:57:24Z
day: '24'
doi: 10.1007/978-3-319-59250-3_8
extern: '1'
external_id:
arxiv:
- '1611.00198'
intvolume: ' 10328'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1611.00198
month: '05'
oa: 1
oa_version: Preprint
page: 86-98
publication: 19th International Conference on Integer Programming and Combinatorial
Optimization
publication_identifier:
eisbn:
- '9783319592503'
isbn:
- '9783319592497'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Deterministic fully dynamic approximate vertex cover and fractional matching
in O(1) amortized update time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10328
year: '2017'
...
---
_id: '1113'
abstract:
- lang: eng
text: 'A drawing of a graph G is radial if the vertices of G are placed on concentric
circles C 1 , . . . , C k with common center c , and edges are drawn radially
: every edge intersects every circle centered at c at most once. G is radial planar
if it has a radial embedding, that is, a crossing-free radial drawing. If the
vertices of G are ordered or partitioned into ordered levels (as they are for
leveled graphs), we require that the assignment of vertices to circles corresponds
to the given ordering or leveling. We show that a graph G is radial planar if
G has a radial drawing in which every two edges cross an even number of times;
the radial embedding has the same leveling as the radial drawing. In other words,
we establish the weak variant of the Hanani-Tutte theorem for radial planarity.
This generalizes a result by Pach and Toth.'
article_processing_charge: No
article_type: original
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Michael
full_name: Pelsmajer, Michael
last_name: Pelsmajer
- first_name: Marcus
full_name: Schaefer, Marcus
last_name: Schaefer
citation:
ama: Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity. Journal
of Graph Algorithms and Applications. 2017;21(1):135-154. doi:10.7155/jgaa.00408
apa: Fulek, R., Pelsmajer, M., & Schaefer, M. (2017). Hanani-Tutte for radial
planarity. Journal of Graph Algorithms and Applications. Brown University.
https://doi.org/10.7155/jgaa.00408
chicago: Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte
for Radial Planarity.” Journal of Graph Algorithms and Applications. Brown
University, 2017. https://doi.org/10.7155/jgaa.00408.
ieee: R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity,”
Journal of Graph Algorithms and Applications, vol. 21, no. 1. Brown University,
pp. 135–154, 2017.
ista: Fulek R, Pelsmajer M, Schaefer M. 2017. Hanani-Tutte for radial planarity.
Journal of Graph Algorithms and Applications. 21(1), 135–154.
mla: Fulek, Radoslav, et al. “Hanani-Tutte for Radial Planarity.” Journal of
Graph Algorithms and Applications, vol. 21, no. 1, Brown University, 2017,
pp. 135–54, doi:10.7155/jgaa.00408.
short: R. Fulek, M. Pelsmajer, M. Schaefer, Journal of Graph Algorithms and Applications
21 (2017) 135–154.
date_created: 2018-12-11T11:50:13Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-02-23T10:05:57Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.7155/jgaa.00408
ec_funded: 1
external_id:
arxiv:
- '1608.08662'
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2019-10-24T10:54:37Z
date_updated: 2019-10-24T10:54:37Z
file_id: '6967'
file_name: 2017_JournalGraphAlgorithms_Fulek.pdf
file_size: 573623
relation: main_file
success: 1
file_date_updated: 2019-10-24T10:54:37Z
has_accepted_license: '1'
intvolume: ' 21'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 135 - 154
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Journal of Graph Algorithms and Applications
publication_status: published
publisher: Brown University
publist_id: '6254'
quality_controlled: '1'
related_material:
record:
- id: '1164'
relation: earlier_version
status: public
- id: '1595'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Hanani-Tutte for radial planarity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2017'
...
---
_id: '169'
abstract:
- lang: eng
text: We show that a twisted variant of Linnik’s conjecture on sums of Kloosterman
sums leads to an optimal covering exponent for S3.
article_processing_charge: No
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Vinay
full_name: Kumaraswamy, Vinay
last_name: Kumaraswamy
- first_name: Rapael
full_name: Steiner, Rapael
last_name: Steiner
citation:
ama: Browning TD, Kumaraswamy V, Steiner R. Twisted Linnik implies optimal covering
exponent for S3. International Mathematics Research Notices. 2017. doi:10.1093/imrn/rnx116
apa: Browning, T. D., Kumaraswamy, V., & Steiner, R. (2017). Twisted Linnik
implies optimal covering exponent for S3. International Mathematics Research
Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnx116
chicago: Browning, Timothy D, Vinay Kumaraswamy, and Rapael Steiner. “Twisted Linnik
Implies Optimal Covering Exponent for S3.” International Mathematics Research
Notices. Oxford University Press, 2017. https://doi.org/10.1093/imrn/rnx116.
ieee: T. D. Browning, V. Kumaraswamy, and R. Steiner, “Twisted Linnik implies optimal
covering exponent for S3,” International Mathematics Research Notices.
Oxford University Press, 2017.
ista: Browning TD, Kumaraswamy V, Steiner R. 2017. Twisted Linnik implies optimal
covering exponent for S3. International Mathematics Research Notices.
mla: Browning, Timothy D., et al. “Twisted Linnik Implies Optimal Covering Exponent
for S3.” International Mathematics Research Notices, Oxford University
Press, 2017, doi:10.1093/imrn/rnx116.
short: T.D. Browning, V. Kumaraswamy, R. Steiner, International Mathematics Research
Notices (2017).
date_created: 2018-12-11T11:44:59Z
date_published: 2017-06-19T00:00:00Z
date_updated: 2021-01-12T06:52:32Z
day: '19'
doi: 10.1093/imrn/rnx116
extern: '1'
external_id:
arxiv:
- '1609.06097'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1609.06097
month: '06'
oa: 1
oa_version: None
publication: International Mathematics Research Notices
publication_status: published
publisher: Oxford University Press
publist_id: '7752'
quality_controlled: '1'
status: public
title: Twisted Linnik implies optimal covering exponent for S3
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '172'
abstract:
- lang: eng
text: We study strong approximation for some algebraic varieties over ℚ which are
defined using norm forms. This allows us to confirm a special case of a conjecture
due to Harpaz and Wittenberg.
article_processing_charge: No
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Damaris
full_name: Schindler, Damaris
last_name: Schindler
citation:
ama: Browning TD, Schindler D. Strong approximation and a conjecture of Harpaz and
Wittenberg. International Mathematics Research Notices. 2017. doi:10.1093/imrn/rnx252
apa: Browning, T. D., & Schindler, D. (2017). Strong approximation and a conjecture
of Harpaz and Wittenberg. International Mathematics Research Notices. Oxford
University Press. https://doi.org/10.1093/imrn/rnx252
chicago: Browning, Timothy D, and Damaris Schindler. “Strong Approximation and a
Conjecture of Harpaz and Wittenberg.” International Mathematics Research Notices.
Oxford University Press, 2017. https://doi.org/10.1093/imrn/rnx252.
ieee: T. D. Browning and D. Schindler, “Strong approximation and a conjecture of
Harpaz and Wittenberg,” International Mathematics Research Notices. Oxford
University Press, 2017.
ista: Browning TD, Schindler D. 2017. Strong approximation and a conjecture of Harpaz
and Wittenberg. International Mathematics Research Notices.
mla: Browning, Timothy D., and Damaris Schindler. “Strong Approximation and a Conjecture
of Harpaz and Wittenberg.” International Mathematics Research Notices,
Oxford University Press, 2017, doi:10.1093/imrn/rnx252.
short: T.D. Browning, D. Schindler, International Mathematics Research Notices (2017).
date_created: 2018-12-11T11:45:00Z
date_published: 2017-10-30T00:00:00Z
date_updated: 2021-01-12T06:52:45Z
day: '30'
doi: 10.1093/imrn/rnx252
extern: '1'
external_id:
arxiv:
- '1509.07744'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1509.07744
month: '10'
oa: 1
oa_version: None
publication: International Mathematics Research Notices
publication_status: published
publisher: Oxford University Press
publist_id: '7749'
quality_controlled: '1'
status: public
title: Strong approximation and a conjecture of Harpaz and Wittenberg
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '393'
abstract:
- lang: eng
text: 'We use a three-pulse ultrafast optical spectroscopy to study the relaxation
processes in a frustrated Mott insulator Na2IrO3. By being able to independently
produce the out-of-equilibrium bound states (excitons) of doublons and holons
with the first pulse and suppress the underlying antiferromagnetic order with
the second one, we were able to elucidate the relaxation mechanism of quasiparticles
in this system. By observing the difference in the exciton dynamics in the magnetically
ordered and disordered phases we found that the mass of this quasiparticle is
mostly determined by its interaction with the surrounding spins. '
acknowledgement: "Z.A. gratefully acknowledges discussions with P. A. Lee and A. Kemper.
A conversation with J. Zaanen was instrumental in clarifying the physical picture
described in this paper. We would also like to thank A. Kogar for thoroughly reading
the manuscript and making valuable comments. This work was supported by Army Research
Office Grant No. W911NF-15-1-0128 and Gordon and Betty Moore Foundation EPiQS Initiative
through Grant No. GBMF4540 (time resolved optical spectroscopy), Skoltech, as part
of the Skoltech NGP program (theory) and National Science Foundation Grant No. DMR-1265162
(material growth).\r\n\r\n"
author:
- first_name: Zhanybek
full_name: Alpichshev, Zhanybek
id: 45E67A2A-F248-11E8-B48F-1D18A9856A87
last_name: Alpichshev
orcid: 0000-0002-7183-5203
- first_name: Edbert
full_name: Sie, Edbert
last_name: Sie
- first_name: Fahad
full_name: Mahmood, Fahad
last_name: Mahmood
- first_name: Gang
full_name: Cao, Gang
last_name: Cao
- first_name: Nuh
full_name: Gedik, Nuh
last_name: Gedik
citation:
ama: Alpichshev Z, Sie E, Mahmood F, Cao G, Gedik N. Origin of the exciton mass
in the frustrated Mott insulator Na2IrO3. Physical Review B. 2017;96(23).
doi:10.1103/PhysRevB.96.235141
apa: Alpichshev, Z., Sie, E., Mahmood, F., Cao, G., & Gedik, N. (2017). Origin
of the exciton mass in the frustrated Mott insulator Na2IrO3. Physical Review
B. American Physical Society. https://doi.org/10.1103/PhysRevB.96.235141
chicago: Alpichshev, Zhanybek, Edbert Sie, Fahad Mahmood, Gang Cao, and Nuh Gedik.
“Origin of the Exciton Mass in the Frustrated Mott Insulator Na2IrO3.” Physical
Review B. American Physical Society, 2017. https://doi.org/10.1103/PhysRevB.96.235141.
ieee: Z. Alpichshev, E. Sie, F. Mahmood, G. Cao, and N. Gedik, “Origin of the exciton
mass in the frustrated Mott insulator Na2IrO3,” Physical Review B, vol.
96, no. 23. American Physical Society, 2017.
ista: Alpichshev Z, Sie E, Mahmood F, Cao G, Gedik N. 2017. Origin of the exciton
mass in the frustrated Mott insulator Na2IrO3. Physical Review B. 96(23).
mla: Alpichshev, Zhanybek, et al. “Origin of the Exciton Mass in the Frustrated
Mott Insulator Na2IrO3.” Physical Review B, vol. 96, no. 23, American Physical
Society, 2017, doi:10.1103/PhysRevB.96.235141.
short: Z. Alpichshev, E. Sie, F. Mahmood, G. Cao, N. Gedik, Physical Review B 96
(2017).
date_created: 2018-12-11T11:46:13Z
date_published: 2017-12-26T00:00:00Z
date_updated: 2021-01-12T07:53:16Z
day: '26'
doi: 10.1103/PhysRevB.96.235141
extern: '1'
intvolume: ' 96'
issue: '23'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://dspace.mit.edu/handle/1721.1/114259
month: '12'
oa: 1
oa_version: None
publication: Physical Review B
publication_status: published
publisher: American Physical Society
publist_id: '7436'
status: public
title: Origin of the exciton mass in the frustrated Mott insulator Na2IrO3
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 96
year: '2017'
...
---
_id: '392'
abstract:
- lang: eng
text: We used femtosecond optical pump-probe spectroscopy to study the photoinduced
change in reflectivity of thin films of the electron-doped cuprate La2-xCexCuO4
(LCCO) with dopings of x=0.08 (underdoped) and x=0.11 (optimally doped). Above
Tc, we observe fluence-dependent relaxation rates that begin at a temperature
similar to the one where transport measurements first show signatures of antiferromagnetic
correlations. Upon suppressing superconductivity with a magnetic field, it is
found that the fluence and temperature dependence of relaxation rates are consistent
with bimolecular recombination of electrons and holes across a gap (2ΔAF) originating
from antiferromagnetic correlations which comprise the pseudogap in electron-doped
cuprates. This can be used to learn about coupling between electrons and high-energy
(ω>2ΔAF) excitations in these compounds and set limits on the time scales on
which antiferromagnetic correlations are static.
acknowledgement: Optical pump-probe work was supported by the Gordon and Betty Moore
Foundation's EPiQS initiative through Grant No. GBMF4540. Materials growth and characterization
was supported by AFOSR FA95501410332 and NSF DMR1410665.
author:
- first_name: Inna
full_name: Vishik, Inna
last_name: Vishik
- first_name: Fahad
full_name: Mahmood, Fahad
last_name: Mahmood
- first_name: Zhanybek
full_name: Alpichshev, Zhanybek
id: 45E67A2A-F248-11E8-B48F-1D18A9856A87
last_name: Alpichshev
orcid: 0000-0002-7183-5203
- first_name: Nuh
full_name: Gedik, Nuh
last_name: Gedik
- first_name: Joshu
full_name: Higgins, Joshu
last_name: Higgins
- first_name: Richard
full_name: Greene, Richard
last_name: Greene
citation:
ama: Vishik I, Mahmood F, Alpichshev Z, Gedik N, Higgins J, Greene R. Ultrafast
dynamics in the presence of antiferromagnetic correlations in electron doped cuprate
La2 xCexCuO4±δ. Physical Review B. 2017;95(11). doi:10.1103/PhysRevB.95.115125
apa: Vishik, I., Mahmood, F., Alpichshev, Z., Gedik, N., Higgins, J., & Greene,
R. (2017). Ultrafast dynamics in the presence of antiferromagnetic correlations
in electron doped cuprate La2 xCexCuO4±δ. Physical Review B. American Physical
Society. https://doi.org/10.1103/PhysRevB.95.115125
chicago: Vishik, Inna, Fahad Mahmood, Zhanybek Alpichshev, Nuh Gedik, Joshu Higgins,
and Richard Greene. “Ultrafast Dynamics in the Presence of Antiferromagnetic Correlations
in Electron Doped Cuprate La2 XCexCuO4±δ.” Physical Review B. American
Physical Society, 2017. https://doi.org/10.1103/PhysRevB.95.115125.
ieee: I. Vishik, F. Mahmood, Z. Alpichshev, N. Gedik, J. Higgins, and R. Greene,
“Ultrafast dynamics in the presence of antiferromagnetic correlations in electron
doped cuprate La2 xCexCuO4±δ,” Physical Review B, vol. 95, no. 11. American
Physical Society, 2017.
ista: Vishik I, Mahmood F, Alpichshev Z, Gedik N, Higgins J, Greene R. 2017. Ultrafast
dynamics in the presence of antiferromagnetic correlations in electron doped cuprate
La2 xCexCuO4±δ. Physical Review B. 95(11).
mla: Vishik, Inna, et al. “Ultrafast Dynamics in the Presence of Antiferromagnetic
Correlations in Electron Doped Cuprate La2 XCexCuO4±δ.” Physical Review B,
vol. 95, no. 11, American Physical Society, 2017, doi:10.1103/PhysRevB.95.115125.
short: I. Vishik, F. Mahmood, Z. Alpichshev, N. Gedik, J. Higgins, R. Greene, Physical
Review B 95 (2017).
date_created: 2018-12-11T11:46:13Z
date_published: 2017-03-13T00:00:00Z
date_updated: 2021-01-12T07:53:12Z
day: '13'
doi: 10.1103/PhysRevB.95.115125
extern: '1'
intvolume: ' 95'
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://dspace.mit.edu/handle/1721.1/109835
month: '03'
oa: 1
oa_version: None
publication: Physical Review B
publication_status: published
publisher: American Physical Society
publist_id: '7437'
status: public
title: Ultrafast dynamics in the presence of antiferromagnetic correlations in electron
doped cuprate La2 xCexCuO4±δ
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 95
year: '2017'
...
---
_id: '443'
abstract:
- lang: eng
text: Pancreatic cancer has a five-year survival rate of ~8%, with characteristic
molecular heterogeneity and restricted treatment options. Targeting metabolism
has emerged as a potentially effective therapeutic strategy for cancers such as
pancreatic cancer, which are driven by genetic alterations that are not tractable
drug targets. Although somatic mitochondrial genome (mtDNA) mutations have been
observed in various tumors types, understanding of metabolic genotype-phenotype
relationships is limited.
author:
- first_name: Rae
full_name: Hardie, Rae
last_name: Hardie
- first_name: Ellen
full_name: Van Dam, Ellen
last_name: Van Dam
- first_name: Mark
full_name: Cowley, Mark
last_name: Cowley
- first_name: Ting
full_name: Han, Ting
last_name: Han
- first_name: Seher
full_name: Balaban, Seher
last_name: Balaban
- first_name: Marina
full_name: Pajic, Marina
last_name: Pajic
- first_name: Mark
full_name: Pinese, Mark
last_name: Pinese
- first_name: Mary
full_name: Iconomou, Mary
last_name: Iconomou
- first_name: Robert
full_name: Shearer, Robert
last_name: Shearer
- first_name: Jessie
full_name: Mckenna, Jessie
last_name: Mckenna
- first_name: David
full_name: Miller, David
last_name: Miller
- first_name: Nicola
full_name: Waddell, Nicola
last_name: Waddell
- first_name: John
full_name: Pearson, John
last_name: Pearson
- first_name: Sean
full_name: Grimmond, Sean
last_name: Grimmond
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
- first_name: Andrew
full_name: Biankin, Andrew
last_name: Biankin
- first_name: Silas
full_name: Villas Boas, Silas
last_name: Villas Boas
- first_name: Andrew
full_name: Hoy, Andrew
last_name: Hoy
- first_name: Nigel
full_name: Turner, Nigel
last_name: Turner
- first_name: Darren
full_name: Saunders, Darren
last_name: Saunders
citation:
ama: Hardie R, Van Dam E, Cowley M, et al. Mitochondrial mutations and metabolic
adaptation in pancreatic cancer. Cancer & Metabolism. 2017;5(2). doi:10.1186/s40170-017-0164-1
apa: Hardie, R., Van Dam, E., Cowley, M., Han, T., Balaban, S., Pajic, M., … Saunders,
D. (2017). Mitochondrial mutations and metabolic adaptation in pancreatic cancer.
Cancer & Metabolism. BioMed Central. https://doi.org/10.1186/s40170-017-0164-1
chicago: Hardie, Rae, Ellen Van Dam, Mark Cowley, Ting Han, Seher Balaban, Marina
Pajic, Mark Pinese, et al. “Mitochondrial Mutations and Metabolic Adaptation in
Pancreatic Cancer.” Cancer & Metabolism. BioMed Central, 2017. https://doi.org/10.1186/s40170-017-0164-1.
ieee: R. Hardie et al., “Mitochondrial mutations and metabolic adaptation
in pancreatic cancer,” Cancer & Metabolism, vol. 5, no. 2. BioMed Central,
2017.
ista: Hardie R, Van Dam E, Cowley M, Han T, Balaban S, Pajic M, Pinese M, Iconomou
M, Shearer R, Mckenna J, Miller D, Waddell N, Pearson J, Grimmond S, Sazanov LA,
Biankin A, Villas Boas S, Hoy A, Turner N, Saunders D. 2017. Mitochondrial mutations
and metabolic adaptation in pancreatic cancer. Cancer & Metabolism. 5(2).
mla: Hardie, Rae, et al. “Mitochondrial Mutations and Metabolic Adaptation in Pancreatic
Cancer.” Cancer & Metabolism, vol. 5, no. 2, BioMed Central, 2017,
doi:10.1186/s40170-017-0164-1.
short: R. Hardie, E. Van Dam, M. Cowley, T. Han, S. Balaban, M. Pajic, M. Pinese,
M. Iconomou, R. Shearer, J. Mckenna, D. Miller, N. Waddell, J. Pearson, S. Grimmond,
L.A. Sazanov, A. Biankin, S. Villas Boas, A. Hoy, N. Turner, D. Saunders, Cancer
& Metabolism 5 (2017).
date_created: 2018-12-11T11:46:30Z
date_published: 2017-01-30T00:00:00Z
date_updated: 2021-01-12T07:56:55Z
day: '30'
ddc:
- '570'
doi: 10.1186/s40170-017-0164-1
extern: '1'
file:
- access_level: open_access
checksum: 337a65786875f64a1fe9fc0ac24767dc
content_type: application/pdf
creator: dernst
date_created: 2019-01-22T08:17:56Z
date_updated: 2020-07-14T12:46:29Z
file_id: '5868'
file_name: 2017_Cancer_Hardie.pdf
file_size: 1609174
relation: main_file
file_date_updated: 2020-07-14T12:46:29Z
has_accepted_license: '1'
intvolume: ' 5'
issue: '2'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: Cancer & Metabolism
publication_status: published
publisher: BioMed Central
publist_id: '7380'
quality_controlled: '1'
status: public
title: Mitochondrial mutations and metabolic adaptation in pancreatic cancer
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: 5
year: '2017'
...
---
_id: '445'
abstract:
- lang: eng
text: The Loschmidt echo, defined as the overlap between quantum wave function evolved
with different Hamiltonians, quantifies the sensitivity of quantum dynamics to
perturbations and is often used as a probe of quantum chaos. In this work we consider
the behavior of the Loschmidt echo in the many-body localized phase, which is
characterized by emergent local integrals of motion and provides a generic example
of nonergodic dynamics. We demonstrate that the fluctuations of the Loschmidt
echo decay as a power law in time in the many-body localized phase, in contrast
to the exponential decay in few-body ergodic systems. We consider the spin-echo
generalization of the Loschmidt echo and argue that the corresponding correlation
function saturates to a finite value in localized systems. Slow, power-law decay
of fluctuations of such spin-echo-type overlap is related to the operator spreading
and is present only in the many-body localized phase, but not in a noninteracting
Anderson insulator. While most of the previously considered probes of dephasing
dynamics could be understood by approximating physical spin operators with local
integrals of motion, the Loschmidt echo and its generalizations crucially depend
on the full expansion of the physical operators via local integrals of motion
operators, as well as operators which flip local integrals of motion. Hence these
probes allow one to get insights into the relation between physical operators
and local integrals of motion and access the operator spreading in the many-body
localized phase.
acknowledgement: |-
This research was supported in part by the National
Science Foundation under Grant No. NSF PHY11-25915.
M.S. was supported by Gordon and Betty Moore Foundation’s
EPiQS Initiative through Grant No. GBMF4307. D.A. also
acknowledges support by Swiss National Science Foundation.
author:
- first_name: Maksym
full_name: Maksym Serbyn
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
- first_name: Dimitry
full_name: Abanin, Dimitry A
last_name: Abanin
citation:
ama: Serbyn M, Abanin D. Loschmidt echo in many body localized phases. Physical
Review B - Condensed Matter and Materials Physics. 2017;96(1). doi:10.1103/PhysRevB.96.014202
apa: Serbyn, M., & Abanin, D. (2017). Loschmidt echo in many body localized
phases. Physical Review B - Condensed Matter and Materials Physics. American
Physical Society. https://doi.org/10.1103/PhysRevB.96.014202
chicago: Serbyn, Maksym, and Dimitry Abanin. “Loschmidt Echo in Many Body Localized
Phases.” Physical Review B - Condensed Matter and Materials Physics. American
Physical Society, 2017. https://doi.org/10.1103/PhysRevB.96.014202.
ieee: M. Serbyn and D. Abanin, “Loschmidt echo in many body localized phases,” Physical
Review B - Condensed Matter and Materials Physics, vol. 96, no. 1. American
Physical Society, 2017.
ista: Serbyn M, Abanin D. 2017. Loschmidt echo in many body localized phases. Physical
Review B - Condensed Matter and Materials Physics. 96(1).
mla: Serbyn, Maksym, and Dimitry Abanin. “Loschmidt Echo in Many Body Localized
Phases.” Physical Review B - Condensed Matter and Materials Physics, vol.
96, no. 1, American Physical Society, 2017, doi:10.1103/PhysRevB.96.014202.
short: M. Serbyn, D. Abanin, Physical Review B - Condensed Matter and Materials
Physics 96 (2017).
date_created: 2018-12-11T11:46:31Z
date_published: 2017-07-12T00:00:00Z
date_updated: 2021-01-12T07:57:03Z
day: '12'
doi: 10.1103/PhysRevB.96.014202
extern: 1
intvolume: ' 96'
issue: '1'
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1701.07772
month: '07'
oa: 1
publication: Physical Review B - Condensed Matter and Materials Physics
publication_status: published
publisher: American Physical Society
publist_id: '7378'
quality_controlled: 0
status: public
title: Loschmidt echo in many body localized phases
type: journal_article
volume: 96
year: '2017'
...
---
_id: '453'
abstract:
- lang: eng
text: Most kinesin motors move in only one direction along microtubules. Members
of the kinesin-5 subfamily were initially described as unidirectional plus-end-directed
motors and shown to produce piconewton forces. However, some fungal kinesin-5
motors are bidirectional. The force production of a bidirectional kinesin-5 has
not yet been measured. Therefore, it remains unknown whether the mechanism of
the unconventional minus-end-directed motility differs fundamentally from that
of plus-end-directed stepping. Using force spectroscopy, we have measured here
the forces that ensembles of purified budding yeast kinesin-5 Cin8 produce in
microtubule gliding assays in both plus- and minus-end direction. Correlation
analysis of pause forces demonstrated that individual Cin8 molecules produce additive
forces in both directions of movement. In ensembles, Cin8 motors were able to
produce single-motor forces up to a magnitude of ∼1.5 pN. Hence, these properties
appear to be conserved within the kinesin-5 subfamily. Force production was largely
independent of the directionality of movement, indicating similarities between
the motility mechanisms for both directions. These results provide constraints
for the development of models for the bidirectional motility mechanism of fission
yeast kinesin-5 and provide insight into the function of this mitotic motor.
acknowledgement: 'The plasmid for full-length kinesin-1 was a gift from G. Holzwarth
and J. Macosko with permission from J. Howard. We thank I. Lueke and N. I. Cade
for technical assistance. G.P. thanks the Francis Crick Institute, and in particular
the Surrey and Salbreux groups, for their hospitality during his sabbatical stay,
as well as Imperial College London for making it possible. This work was supported
by the Francis Crick Institute, which receives its core funding from Cancer Research
UK (FC001163), the United Kingdom Medical Research Council (FC001163), and the Wellcome
Trust (FC001163), and by Imperial College London. J.R. was also supported by a Sir
Henry Wellcome Postdoctoral Fellowship (100145/Z/12/Z) and T.S. by the European
Research Council (Advanced Grant, project 323042). '
article_processing_charge: No
article_type: original
author:
- first_name: Todd
full_name: Fallesen, Todd
last_name: Fallesen
- first_name: Johanna
full_name: Roostalu, Johanna
last_name: Roostalu
- first_name: Christian F
full_name: Düllberg, Christian F
id: 459064DC-F248-11E8-B48F-1D18A9856A87
last_name: Düllberg
orcid: 0000-0001-6335-9748
- first_name: Gunnar
full_name: Pruessner, Gunnar
last_name: Pruessner
- first_name: Thomas
full_name: Surrey, Thomas
last_name: Surrey
citation:
ama: Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. Ensembles of bidirectional
kinesin Cin8 produce additive forces in both directions of movement. Biophysical
Journal. 2017;113(9):2055-2067. doi:10.1016/j.bpj.2017.09.006
apa: Fallesen, T., Roostalu, J., Düllberg, C. F., Pruessner, G., & Surrey, T.
(2017). Ensembles of bidirectional kinesin Cin8 produce additive forces in both
directions of movement. Biophysical Journal. Biophysical Society. https://doi.org/10.1016/j.bpj.2017.09.006
chicago: Fallesen, Todd, Johanna Roostalu, Christian F Düllberg, Gunnar Pruessner,
and Thomas Surrey. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces
in Both Directions of Movement.” Biophysical Journal. Biophysical Society,
2017. https://doi.org/10.1016/j.bpj.2017.09.006.
ieee: T. Fallesen, J. Roostalu, C. F. Düllberg, G. Pruessner, and T. Surrey, “Ensembles
of bidirectional kinesin Cin8 produce additive forces in both directions of movement,”
Biophysical Journal, vol. 113, no. 9. Biophysical Society, pp. 2055–2067,
2017.
ista: Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. 2017. Ensembles
of bidirectional kinesin Cin8 produce additive forces in both directions of movement.
Biophysical Journal. 113(9), 2055–2067.
mla: Fallesen, Todd, et al. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive
Forces in Both Directions of Movement.” Biophysical Journal, vol. 113,
no. 9, Biophysical Society, 2017, pp. 2055–67, doi:10.1016/j.bpj.2017.09.006.
short: T. Fallesen, J. Roostalu, C.F. Düllberg, G. Pruessner, T. Surrey, Biophysical
Journal 113 (2017) 2055–2067.
date_created: 2018-12-11T11:46:33Z
date_published: 2017-11-07T00:00:00Z
date_updated: 2021-01-12T07:59:28Z
day: '07'
ddc:
- '570'
department:
- _id: MaLo
doi: 10.1016/j.bpj.2017.09.006
file:
- access_level: open_access
checksum: 99a2474088e20ac74b1882c4fbbb45b1
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:03Z
date_updated: 2020-07-14T12:46:31Z
file_id: '5052'
file_name: IST-2018-965-v1+1_2017_Duellberg_Ensembles_of.pdf
file_size: 977192
relation: main_file
file_date_updated: 2020-07-14T12:46:31Z
has_accepted_license: '1'
intvolume: ' 113'
issue: '9'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 2055 - 2067
publication: Biophysical Journal
publication_status: published
publisher: Biophysical Society
publist_id: '7369'
pubrep_id: '965'
quality_controlled: '1'
status: public
title: Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions
of movement
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: 113
year: '2017'
...
---
_id: '464'
abstract:
- lang: eng
text: The computation of the winning set for parity objectives and for Streett objectives
in graphs as well as in game graphs are central problems in computer-aided verification,
with application to the verification of closed systems with strong fairness conditions,
the verification of open systems, checking interface compatibility, well-formedness
of specifications, and the synthesis of reactive systems. We show how to compute
the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives
in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs
in time O(n2+nklogn). For both problems this gives faster algorithms for dense
graphs and represents the first improvement in asymptotic running time in 15 years.
article_number: '26'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- 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: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for parity
and Streett objectives. Logical Methods in Computer Science. 2017;13(3).
doi:10.23638/LMCS-13(3:26)2017
apa: Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved algorithms
for parity and Streett objectives. Logical Methods in Computer Science.
International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017
chicago: Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer.
“Improved Algorithms for Parity and Streett Objectives.” Logical Methods in
Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017.
ieee: K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms
for parity and Streett objectives,” Logical Methods in Computer Science,
vol. 13, no. 3. International Federation of Computational Logic, 2017.
ista: Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for
parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.
mla: Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett
Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International
Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017.
short: K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer
Science 13 (2017).
date_created: 2018-12-11T11:46:37Z
date_published: 2017-09-26T00:00:00Z
date_updated: 2023-02-23T10:08:55Z
day: '26'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.23638/LMCS-13(3:26)2017
ec_funded: 1
external_id:
arxiv:
- '1410.0833'
file:
- access_level: open_access
checksum: 12d469ae69b80361333d7dead965cf5d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:27Z
date_updated: 2020-07-14T12:46:32Z
file_id: '5010'
file_name: IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf
file_size: 582940
relation: main_file
file_date_updated: 2020-07-14T12:46:32Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Logical Methods in Computer Science
publication_identifier:
issn:
- 1860-5974
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '7357'
pubrep_id: '956'
quality_controlled: '1'
related_material:
record:
- id: '1661'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Improved algorithms for parity and Streett objectives
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2017'
...
---
_id: '470'
abstract:
- lang: eng
text: This paper presents a method for simulating water surface waves as a displacement
field on a 2D domain. Our method relies on Lagrangian particles that carry packets
of water wave energy; each packet carries information about an entire group of
wave trains, as opposed to only a single wave crest. Our approach is unconditionally
stable and can simulate high resolution geometric details. This approach also
presents a straightforward interface for artistic control, because it is essentially
a particle system with intuitive parameters like wavelength and amplitude. Our
implementation parallelizes well and runs in real time for moderately challenging
scenarios.
acknowledged_ssus:
- _id: ScienComp
article_number: '103'
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Stefan
full_name: Jeschke, Stefan
id: 44D6411A-F248-11E8-B48F-1D18A9856A87
last_name: Jeschke
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Jeschke S, Wojtan C. Water wave packets. ACM Transactions on Graphics.
2017;36(4). doi:10.1145/3072959.3073678
apa: Jeschke, S., & Wojtan, C. (2017). Water wave packets. ACM Transactions
on Graphics. ACM. https://doi.org/10.1145/3072959.3073678
chicago: Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions
on Graphics. ACM, 2017. https://doi.org/10.1145/3072959.3073678.
ieee: S. Jeschke and C. Wojtan, “Water wave packets,” ACM Transactions on Graphics,
vol. 36, no. 4. ACM, 2017.
ista: Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics.
36(4), 103.
mla: Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions
on Graphics, vol. 36, no. 4, 103, ACM, 2017, doi:10.1145/3072959.3073678.
short: S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017).
date_created: 2018-12-11T11:46:39Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2023-02-23T12:20:26Z
day: '01'
ddc:
- '006'
department:
- _id: ChWo
doi: 10.1145/3072959.3073678
ec_funded: 1
file:
- access_level: open_access
checksum: 82a3b2bfeee4ddef16ecc21675d1a48a
content_type: application/pdf
creator: wojtan
date_created: 2020-01-24T09:32:35Z
date_updated: 2020-07-14T12:46:34Z
file_id: '7359'
file_name: wavepackets_final.pdf
file_size: 13131683
relation: main_file
file_date_updated: 2020-07-14T12:46:34Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
publication: ACM Transactions on Graphics
publication_identifier:
issn:
- '07300301'
publication_status: published
publisher: ACM
publist_id: '7350'
quality_controlled: '1'
scopus_import: 1
status: public
title: Water wave packets
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2017'
...