---
_id: '11785'
abstract:
- lang: eng
text: "Recently we presented the first algorithm for maintaining the set of nodes
reachable from a source node in a directed graph that is modified by edge deletions
with \U0001D45C(\U0001D45A\U0001D45B) total update time, where \U0001D45A is the
number of edges and \U0001D45B is the number of nodes in the graph [Henzinger
et al. STOC 2014]. The algorithm is a combination of several different algorithms,
each for a different \U0001D45A vs. \U0001D45B trade-off. For the case of \U0001D45A=Θ(\U0001D45B1.5)
the running time is \U0001D442(\U0001D45B2.47), just barely below \U0001D45A\U0001D45B=Θ(\U0001D45B2.5).
In this paper we simplify the previous algorithm using new algorithmic ideas and
achieve an improved running time of \U0001D442̃ (min(\U0001D45A7/6\U0001D45B2/3,\U0001D45A3/4\U0001D45B5/4+\U0001D45C(1),\U0001D45A2/3\U0001D45B4/3+\U0001D45C(1)+\U0001D45A3/7\U0001D45B12/7+\U0001D45C(1))).
This gives, e.g., \U0001D442(\U0001D45B2.36) for the notorious case \U0001D45A=Θ(\U0001D45B1.5).
We obtain the same upper bounds for the problem of maintaining the strongly connected
components of a directed graph undergoing edge deletions. Our algorithms are correct
with high probabililty against an oblivious adversary."
alternative_title:
- LNCS
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: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: 'Henzinger MH, Krinninger S, Nanongkai D. Improved algorithms for decremental
single-source reachability on directed graphs. In: 42nd International Colloquium
on Automata, Languages and Programming. Vol 9134. Springer Nature; 2015:725-736.
doi:10.1007/978-3-662-47672-7_59'
apa: 'Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2015). Improved algorithms
for decremental single-source reachability on directed graphs. In 42nd International
Colloquium on Automata, Languages and Programming (Vol. 9134, pp. 725–736).
Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47672-7_59'
chicago: Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Improved
Algorithms for Decremental Single-Source Reachability on Directed Graphs.” In
42nd International Colloquium on Automata, Languages and Programming, 9134:725–36.
Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47672-7_59.
ieee: M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Improved algorithms for
decremental single-source reachability on directed graphs,” in 42nd International
Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol.
9134, pp. 725–736.
ista: 'Henzinger MH, Krinninger S, Nanongkai D. 2015. Improved algorithms for decremental
single-source reachability on directed graphs. 42nd International Colloquium on
Automata, Languages and Programming. ICALP: International Colloquium on Automata,
Languages, and Programming, LNCS, vol. 9134, 725–736.'
mla: Henzinger, Monika H., et al. “Improved Algorithms for Decremental Single-Source
Reachability on Directed Graphs.” 42nd International Colloquium on Automata,
Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 725–36, doi:10.1007/978-3-662-47672-7_59.
short: M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 42nd International Colloquium
on Automata, Languages and Programming, Springer Nature, 2015, pp. 725–736.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2015-07-06
date_created: 2022-08-11T08:51:32Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-10T09:10:26Z
day: '01'
doi: 10.1007/978-3-662-47672-7_59
extern: '1'
external_id:
arxiv:
- '1612.03856'
intvolume: ' 9134'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1612.03856
month: '01'
oa: 1
oa_version: Preprint
page: 725 - 736
publication: 42nd International Colloquium on Automata, Languages and Programming
publication_identifier:
isbn:
- '9783662476710'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Improved algorithms for decremental single-source reachability on directed
graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9134
year: '2015'
...
---
_id: '11787'
abstract:
- lang: eng
text: "We present faster algorithms for computing the 2-edge and 2-vertex strongly
connected components of a directed graph. While in undirected graphs the 2-edge
and 2-vertex connected components can be found in linear time, in directed graphs
with m edges and n vertices only rather simple O(m n)-time algorithms were known.
We use a hierarchical sparsification technique to obtain algorithms that run in
time \U0001D442(\U0001D45B2). For 2-edge strongly connected components our algorithm
gives the first running time improvement in 20 years. Additionally we present
an \U0001D442(\U0001D45A2/log\U0001D45B)-time algorithm for 2-edge strongly connected
components, and thus improve over the O(m n) running time also when \U0001D45A=\U0001D442(\U0001D45B).
Our approach extends to k-edge and k-vertex strongly connected components for
any constant k with a running time of \U0001D442(\U0001D45B2log\U0001D45B) for
k-edge-connectivity and \U0001D442(\U0001D45B3) for k-vertex-connectivity."
alternative_title:
- LNCS
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: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: 'Henzinger MH, Krinninger S, Loitzenbauer V. Finding 2-edge and 2-vertex strongly
connected components in quadratic time. In: 2nd International Colloquium on
Automata, Languages and Programming. Vol 9134. Springer Nature; 2015:713-724.
doi:10.1007/978-3-662-47672-7_58'
apa: 'Henzinger, M. H., Krinninger, S., & Loitzenbauer, V. (2015). Finding 2-edge
and 2-vertex strongly connected components in quadratic time. In 2nd International
Colloquium on Automata, Languages and Programming (Vol. 9134, pp. 713–724).
Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47672-7_58'
chicago: Henzinger, Monika H, Sebastian Krinninger, and Veronika Loitzenbauer. “Finding
2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time.” In 2nd
International Colloquium on Automata, Languages and Programming, 9134:713–24.
Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47672-7_58.
ieee: M. H. Henzinger, S. Krinninger, and V. Loitzenbauer, “Finding 2-edge and 2-vertex
strongly connected components in quadratic time,” in 2nd International Colloquium
on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp.
713–724.
ista: 'Henzinger MH, Krinninger S, Loitzenbauer V. 2015. Finding 2-edge and 2-vertex
strongly connected components in quadratic time. 2nd International Colloquium
on Automata, Languages and Programming. ICALP: International Colloquium on Automata,
Languages, and Programming, LNCS, vol. 9134, 713–724.'
mla: Henzinger, Monika H., et al. “Finding 2-Edge and 2-Vertex Strongly Connected
Components in Quadratic Time.” 2nd International Colloquium on Automata, Languages
and Programming, vol. 9134, Springer Nature, 2015, pp. 713–24, doi:10.1007/978-3-662-47672-7_58.
short: M.H. Henzinger, S. Krinninger, V. Loitzenbauer, in:, 2nd International Colloquium
on Automata, Languages and Programming, Springer Nature, 2015, pp. 713–724.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2015-07-06
date_created: 2022-08-11T09:38:34Z
date_published: 2015-07-06T00:00:00Z
date_updated: 2023-02-10T09:21:47Z
day: '06'
doi: 10.1007/978-3-662-47672-7_58
extern: '1'
external_id:
arxiv:
- '1412.6466'
intvolume: ' 9134'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1412.6466
month: '07'
oa: 1
oa_version: Preprint
page: 713 - 724
publication: 2nd International Colloquium on Automata, Languages and Programming
publication_identifier:
isbn:
- '9783662476710'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Finding 2-edge and 2-vertex strongly connected components in quadratic time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9134
year: '2015'
...
---
_id: '11788'
abstract:
- lang: eng
text: "Ad exchanges are becoming an increasingly popular way to sell advertisement
slots on the internet. An ad exchange is basically a spot market for ad impressions.
A publisher who has already signed contracts reserving advertisement impressions
on his pages can choose between assigning a new ad impression for a new page view
to a contracted advertiser or to sell it at an ad exchange. This leads to an online
revenue maximization problem for the publisher. Given a new impression to sell
decide whether (a) to assign it to a contracted advertiser and if so to which
one or (b) to sell it at the ad exchange and if so at which reserve price. We
make no assumptions about the distribution of the advertiser valuations that participate
in the ad exchange and show that there exists a simple primal-dual based online
algorithm, whose lower bound for the revenue converges to \U0001D445\U0001D434\U0001D437\U0001D44B+\U0001D445\U0001D434(1−1/\U0001D452),
where \U0001D445\U0001D434\U0001D437\U0001D44B is the revenue that the optimum
algorithm achieves from the ad exchange and \U0001D445\U0001D434 is the revenue
that the optimum algorithm achieves from the contracted advertisers."
alternative_title:
- LNCS
article_processing_charge: No
author:
- 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
citation:
ama: 'Dvořák W, Henzinger MH. Online ad assignment with an ad exchange. In: 12th
International Workshop of Approximation and Online Algorithms. Vol 8952. Springer
Nature; 2015:156–167. doi:10.1007/978-3-319-18263-6_14'
apa: 'Dvořák, W., & Henzinger, M. H. (2015). Online ad assignment with an ad
exchange. In 12th International Workshop of Approximation and Online Algorithms
(Vol. 8952, pp. 156–167). Wroclaw, Poland: Springer Nature. https://doi.org/10.1007/978-3-319-18263-6_14'
chicago: Dvořák, Wolfgang, and Monika H Henzinger. “Online Ad Assignment with an
Ad Exchange.” In 12th International Workshop of Approximation and Online Algorithms,
8952:156–167. Springer Nature, 2015. https://doi.org/10.1007/978-3-319-18263-6_14.
ieee: W. Dvořák and M. H. Henzinger, “Online ad assignment with an ad exchange,”
in 12th International Workshop of Approximation and Online Algorithms,
Wroclaw, Poland, 2015, vol. 8952, pp. 156–167.
ista: 'Dvořák W, Henzinger MH. 2015. Online ad assignment with an ad exchange. 12th
International Workshop of Approximation and Online Algorithms. WAOA: International
Workshop on Approximation and Online Algorithms, LNCS, vol. 8952, 156–167.'
mla: Dvořák, Wolfgang, and Monika H. Henzinger. “Online Ad Assignment with an Ad
Exchange.” 12th International Workshop of Approximation and Online Algorithms,
vol. 8952, Springer Nature, 2015, pp. 156–167, doi:10.1007/978-3-319-18263-6_14.
short: W. Dvořák, M.H. Henzinger, in:, 12th International Workshop of Approximation
and Online Algorithms, Springer Nature, 2015, pp. 156–167.
conference:
end_date: 2014-09-12
location: Wroclaw, Poland
name: 'WAOA: International Workshop on Approximation and Online Algorithms'
start_date: 2014-09-11
date_created: 2022-08-11T09:43:32Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-10T09:26:06Z
day: '01'
doi: 10.1007/978-3-319-18263-6_14
extern: '1'
external_id:
arxiv:
- '1604.05603'
intvolume: ' 8952'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.05603
month: '01'
oa: 1
oa_version: Preprint
page: 156–167
publication: 12th International Workshop of Approximation and Online Algorithms
publication_identifier:
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Online ad assignment with an ad exchange
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8952
year: '2015'
...
---
_id: '11786'
abstract:
- lang: eng
text: "In this paper, we develop a dynamic version of the primal-dual method for
optimization problems, and apply it to obtain the following results. (1) For the
dynamic set-cover problem, we maintain an \U0001D442(\U0001D4532)-approximately
optimal solution in \U0001D442(\U0001D453⋅log(\U0001D45A+\U0001D45B)) amortized
update time, where \U0001D453 is the maximum “frequency” of an element, \U0001D45B
is the number of sets, and \U0001D45A is the maximum number of elements in the
universe at any point in time. (2) For the dynamic \U0001D44F-matching problem,
we maintain an \U0001D442(1)-approximately optimal solution in \U0001D442(log3\U0001D45B)
amortized update time, where \U0001D45B is the number of nodes in the graph."
alternative_title:
- LNCS
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: Giuseppe F.
full_name: Italiano, Giuseppe F.
last_name: Italiano
citation:
ama: 'Bhattacharya S, Henzinger MH, Italiano GF. Design of dynamic algorithms via
primal-dual method. In: 42nd International Colloquium on Automata, Languages
and Programming. Vol 9134. Springer Nature; 2015:206-218. doi:10.1007/978-3-662-47672-7_17'
apa: 'Bhattacharya, S., Henzinger, M. H., & Italiano, G. F. (2015). Design of
dynamic algorithms via primal-dual method. In 42nd International Colloquium
on Automata, Languages and Programming (Vol. 9134, pp. 206–218). Kyoto, Japan:
Springer Nature. https://doi.org/10.1007/978-3-662-47672-7_17'
chicago: Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Design
of Dynamic Algorithms via Primal-Dual Method.” In 42nd International Colloquium
on Automata, Languages and Programming, 9134:206–18. Springer Nature, 2015.
https://doi.org/10.1007/978-3-662-47672-7_17.
ieee: S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Design of dynamic algorithms
via primal-dual method,” in 42nd International Colloquium on Automata, Languages
and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 206–218.
ista: 'Bhattacharya S, Henzinger MH, Italiano GF. 2015. Design of dynamic algorithms
via primal-dual method. 42nd International Colloquium on Automata, Languages and
Programming. ICALP: International Colloquium on Automata, Languages, and Programming,
LNCS, vol. 9134, 206–218.'
mla: Bhattacharya, Sayan, et al. “Design of Dynamic Algorithms via Primal-Dual Method.”
42nd International Colloquium on Automata, Languages and Programming, vol.
9134, Springer Nature, 2015, pp. 206–18, doi:10.1007/978-3-662-47672-7_17.
short: S. Bhattacharya, M.H. Henzinger, G.F. Italiano, in:, 42nd International Colloquium
on Automata, Languages and Programming, Springer Nature, 2015, pp. 206–218.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2015-07-06
date_created: 2022-08-11T09:28:49Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-10T09:13:31Z
day: '01'
doi: 10.1007/978-3-662-47672-7_17
extern: '1'
external_id:
arxiv:
- '1604.05337'
intvolume: ' 9134'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.05337
month: '01'
oa: 1
oa_version: Preprint
page: 206 - 218
publication: 42nd International Colloquium on Automata, Languages and Programming
publication_identifier:
isbn:
- '9783662476710'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Design of dynamic algorithms via primal-dual method
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9134
year: '2015'
...
---
_id: '11845'
abstract:
- lang: eng
text: "Phylogenetic diversity (PD) is a measure of biodiversity based on the evolutionary
history of species. Here, we discuss several optimization problems related to
the use of PD, and the more general measure split diversity (SD), in conservation
prioritization.\r\nDepending on the conservation goal and the information available
about species, one can construct optimization routines that incorporate various
conservation constraints. We demonstrate how this information can be used to select
sets of species for conservation action. Specifically, we discuss the use of species'
geographic distributions, the choice of candidates under economic pressure, and
the use of predator–prey interactions between the species in a community to define
viability constraints.\r\nDespite such optimization problems falling into the
area of NP hard problems, it is possible to solve them in a reasonable amount
of time using integer programming. We apply integer linear programming to a variety
of models for conservation prioritization that incorporate the SD measure.\r\nWe
exemplarily show the results for two data sets: the Cape region of South Africa
and a Caribbean coral reef community. Finally, we provide user-friendly software
at http://www.cibiv.at/software/pda."
article_processing_charge: No
article_type: original
author:
- first_name: Olga
full_name: Chernomor, Olga
last_name: Chernomor
- first_name: Bui Quang
full_name: Minh, Bui Quang
last_name: Minh
- first_name: Félix
full_name: Forest, Félix
last_name: Forest
- first_name: Steffen
full_name: Klaere, Steffen
last_name: Klaere
- first_name: Travis
full_name: Ingram, Travis
last_name: Ingram
- 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: Arndt
full_name: von Haeseler, Arndt
last_name: von Haeseler
citation:
ama: Chernomor O, Minh BQ, Forest F, et al. Split diversity in constrained conservation
prioritization using integer linear programming. Methods in Ecology and Evolution.
2015;6(1):83-91. doi:10.1111/2041-210x.12299
apa: Chernomor, O., Minh, B. Q., Forest, F., Klaere, S., Ingram, T., Henzinger,
M. H., & von Haeseler, A. (2015). Split diversity in constrained conservation
prioritization using integer linear programming. Methods in Ecology and Evolution.
Wiley. https://doi.org/10.1111/2041-210x.12299
chicago: Chernomor, Olga, Bui Quang Minh, Félix Forest, Steffen Klaere, Travis Ingram,
Monika H Henzinger, and Arndt von Haeseler. “Split Diversity in Constrained Conservation
Prioritization Using Integer Linear Programming.” Methods in Ecology and Evolution.
Wiley, 2015. https://doi.org/10.1111/2041-210x.12299.
ieee: O. Chernomor et al., “Split diversity in constrained conservation prioritization
using integer linear programming,” Methods in Ecology and Evolution, vol.
6, no. 1. Wiley, pp. 83–91, 2015.
ista: Chernomor O, Minh BQ, Forest F, Klaere S, Ingram T, Henzinger MH, von Haeseler
A. 2015. Split diversity in constrained conservation prioritization using integer
linear programming. Methods in Ecology and Evolution. 6(1), 83–91.
mla: Chernomor, Olga, et al. “Split Diversity in Constrained Conservation Prioritization
Using Integer Linear Programming.” Methods in Ecology and Evolution, vol.
6, no. 1, Wiley, 2015, pp. 83–91, doi:10.1111/2041-210x.12299.
short: O. Chernomor, B.Q. Minh, F. Forest, S. Klaere, T. Ingram, M.H. Henzinger,
A. von Haeseler, Methods in Ecology and Evolution 6 (2015) 83–91.
date_created: 2022-08-16T06:43:49Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-17T09:30:08Z
day: '01'
ddc:
- '570'
doi: 10.1111/2041-210x.12299
extern: '1'
external_id:
pmid:
- '25893087'
file:
- access_level: open_access
checksum: 880e78f09f0ac99cb351c48dc97623b6
content_type: application/pdf
creator: asandaue
date_created: 2022-08-16T06:52:53Z
date_updated: 2022-08-16T06:52:53Z
file_id: '11846'
file_name: 2015_MethodsInEcologyAndEvolutionChernomor.pdf
file_size: 411415
relation: main_file
success: 1
file_date_updated: 2022-08-16T06:52:53Z
has_accepted_license: '1'
intvolume: ' 6'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 83-91
pmid: 1
publication: Methods in Ecology and Evolution
publication_identifier:
eissn:
- 2041-210X
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Split diversity in constrained conservation prioritization using integer linear
programming
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: 6
year: '2015'
...
---
_id: '11868'
abstract:
- lang: eng
text: "Consider the following Online Boolean Matrix-Vector Multiplication problem:
We are given an n x n matrix M and will receive n column-vectors of size n, denoted
by v1, ..., vn, one by one. After seeing each vector vi, we have to output the
product Mvi before we can see the next vector. A naive algorithm can solve this
problem using O(n3) time in total, and its running time can be slightly improved
to O(n3/log2 n) [Williams SODA'07]. We show that a conjecture that there is no
truly subcubic (O(n3-ε)) time algorithm for this problem can be used to exhibit
the underlying polynomial time hardness shared by many dynamic problems. For a
number of problems, such as subgraph connectivity, Pagh's problem, d-failure connectivity,
decremental single-source shortest paths, and decremental transitive closure,
this conjecture implies tight hardness results. Thus, proving or disproving this
conjecture will be very interesting as it will either imply several tight unconditional
lower bounds or break through a common barrier that blocks progress with these
problems. This conjecture might also be considered as strong evidence against
any further improvement for these problems since refuting it will imply a major
breakthrough for combinatorial Boolean matrix multiplication and other long-standing
problems if the term \"combinatorial algorithms\" is interpreted as \"Strassen-like
algorithms\" [Ballard et al. SPAA'11].\r\n\r\nThe conjecture also leads to hardness
results for problems that were previously based on diverse problems and conjectures
-- such as 3SUM, combinatorial Boolean matrix multiplication, triangle detection,
and multiphase -- thus providing a uniform way to prove polynomial hardness results
for dynamic algorithms; some of the new proofs are also simpler or even become
trivial. The conjecture also leads to stronger and new, non-trivial, hardness
results, e.g., for the fully-dynamic densest subgraph and diameter problems."
article_number: 21-30
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: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
- first_name: Thatchaphol
full_name: Saranurak, Thatchaphol
last_name: Saranurak
citation:
ama: 'Henzinger MH, Krinninger S, Nanongkai D, Saranurak T. Unifying and strengthening
hardness for dynamic problems via the online matrix-vector multiplication conjecture.
In: 47th Annual ACM Symposium on Theory of Computing. Association for Computing
Machinery; 2015. doi:10.1145/2746539.2746609'
apa: 'Henzinger, M. H., Krinninger, S., Nanongkai, D., & Saranurak, T. (2015).
Unifying and strengthening hardness for dynamic problems via the online matrix-vector
multiplication conjecture. In 47th Annual ACM Symposium on Theory of Computing.
Portland, OR, United States: Association for Computing Machinery. https://doi.org/10.1145/2746539.2746609'
chicago: Henzinger, Monika H, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol
Saranurak. “Unifying and Strengthening Hardness for Dynamic Problems via the Online
Matrix-Vector Multiplication Conjecture.” In 47th Annual ACM Symposium on Theory
of Computing. Association for Computing Machinery, 2015. https://doi.org/10.1145/2746539.2746609.
ieee: M. H. Henzinger, S. Krinninger, D. Nanongkai, and T. Saranurak, “Unifying
and strengthening hardness for dynamic problems via the online matrix-vector multiplication
conjecture,” in 47th Annual ACM Symposium on Theory of Computing, Portland,
OR, United States, 2015.
ista: 'Henzinger MH, Krinninger S, Nanongkai D, Saranurak T. 2015. Unifying and
strengthening hardness for dynamic problems via the online matrix-vector multiplication
conjecture. 47th Annual ACM Symposium on Theory of Computing. STOC: Symposium
on Theory of Computing, 21–30.'
mla: Henzinger, Monika H., et al. “Unifying and Strengthening Hardness for Dynamic
Problems via the Online Matrix-Vector Multiplication Conjecture.” 47th Annual
ACM Symposium on Theory of Computing, 21–30, Association for Computing Machinery,
2015, doi:10.1145/2746539.2746609.
short: M.H. Henzinger, S. Krinninger, D. Nanongkai, T. Saranurak, in:, 47th Annual
ACM Symposium on Theory of Computing, Association for Computing Machinery, 2015.
conference:
end_date: 2015-06-17
location: Portland, OR, United States
name: 'STOC: Symposium on Theory of Computing'
start_date: 2015-06-14
date_created: 2022-08-16T09:31:21Z
date_published: 2015-06-14T00:00:00Z
date_updated: 2023-02-17T11:09:54Z
day: '14'
doi: 10.1145/2746539.2746609
extern: '1'
external_id:
arxiv:
- '1511.06773'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1511.06773
month: '06'
oa: 1
oa_version: Preprint
publication: 47th Annual ACM Symposium on Theory of Computing
publication_identifier:
isbn:
- 978-145033536-2
issn:
- '0737.8017'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Unifying and strengthening hardness for dynamic problems via the online matrix-vector
multiplication conjecture
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '11869'
abstract:
- lang: eng
text: "While in many graph mining applications it is crucial to handle a stream
of updates efficiently in terms of both time and space, not much was known about
achieving such type of algorithm. In this paper we study this issue for a problem
which lies at the core of many graph mining applications called densest subgraph
problem. We develop an algorithm that achieves time- and space-efficiency for
this problem simultaneously. It is one of the first of its kind for graph problems
to the best of our knowledge.\r\n\r\nGiven an input graph, the densest subgraph
is the subgraph that maximizes the ratio between the number of edges and the number
of nodes. For any ε>0, our algorithm can, with high probability, maintain a (4+ε)-approximate
solution under edge insertions and deletions using ~O(n) space and ~O(1) amortized
time per update; here, $n$ is the number of nodes in the graph and ~O hides the
O(polylog_{1+ε} n) term. The approximation ratio can be improved to (2+ε) with
more time. It can be extended to a (2+ε)-approximation sublinear-time algorithm
and a distributed-streaming algorithm. Our algorithm is the first streaming algorithm
that can maintain the densest subgraph in one pass. Prior to this, no algorithm
could do so even in the special case of an incremental stream and even when there
is no time restriction. The previously best algorithm in this setting required
O(log n) passes [BahmaniKV12]. The space required by our algorithm is tight up
to a polylogarithmic factor."
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
- first_name: Charalampos
full_name: Tsourakakis, Charalampos
last_name: Tsourakakis
citation:
ama: 'Bhattacharya S, Henzinger MH, Nanongkai D, Tsourakakis C. Space- and time-efficient
algorithm for maintaining dense subgraphs on one-pass dynamic streams. In: 47th
Annual ACM Symposium on Theory of Computing. Association for Computing Machinery;
2015:173-182. doi:10.1145/2746539.2746592'
apa: 'Bhattacharya, S., Henzinger, M. H., Nanongkai, D., & Tsourakakis, C. (2015).
Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass
dynamic streams. In 47th Annual ACM Symposium on Theory of Computing (pp.
173–182). Portland, OR, United States: Association for Computing Machinery. https://doi.org/10.1145/2746539.2746592'
chicago: Bhattacharya, Sayan, Monika H Henzinger, Danupon Nanongkai, and Charalampos
Tsourakakis. “Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs
on One-Pass Dynamic Streams.” In 47th Annual ACM Symposium on Theory of Computing,
173–82. Association for Computing Machinery, 2015. https://doi.org/10.1145/2746539.2746592.
ieee: S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and C. Tsourakakis, “Space-
and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic
streams,” in 47th Annual ACM Symposium on Theory of Computing, Portland,
OR, United States, 2015, pp. 173–182.
ista: 'Bhattacharya S, Henzinger MH, Nanongkai D, Tsourakakis C. 2015. Space- and
time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams.
47th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of
Computing, 173–182.'
mla: Bhattacharya, Sayan, et al. “Space- and Time-Efficient Algorithm for Maintaining
Dense Subgraphs on One-Pass Dynamic Streams.” 47th Annual ACM Symposium on
Theory of Computing, Association for Computing Machinery, 2015, pp. 173–82,
doi:10.1145/2746539.2746592.
short: S. Bhattacharya, M.H. Henzinger, D. Nanongkai, C. Tsourakakis, in:, 47th
Annual ACM Symposium on Theory of Computing, Association for Computing Machinery,
2015, pp. 173–182.
conference:
end_date: 2015-06-17
location: Portland, OR, United States
name: 'STOC: Symposium on Theory of Computing'
start_date: 2015-06-14
date_created: 2022-08-16T09:36:48Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2023-02-17T11:17:03Z
day: '01'
doi: 10.1145/2746539.2746592
extern: '1'
external_id:
arxiv:
- '1504.02268'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.02268
month: '06'
oa: 1
oa_version: Preprint
page: 173 - 182
publication: 47th Annual ACM Symposium on Theory of Computing
publication_identifier:
isbn:
- 978-145033536-2
issn:
- 0737-8017
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass
dynamic streams
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '11837'
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 O(sqrt n)-approximation algorithm for
general concave externality functions,\r\n(ii) an O(\\log m)-approximation algorithm
for linear externality functions, and (iii) an (1-1/e)\\frac{1}{6}-approximation
algorithm for 2-hop step function externalities. We also improve the result from
[6] for 1-hop step function externalities by giving a (1-1/e)/2-approximation
algorithm."
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- first_name: Wolfgang
full_name: Dvorák, Wolfgang
last_name: Dvorá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, Dvorák W, Henzinger MH, Starnberger Martin. Welfare maximization
with friends-of-friends network externalities. In: 32nd International Symposium
on Theoretical Aspects of Computer Science. Vol 30. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2015:90-102. doi:10.4230/LIPICS.STACS.2015.90'
apa: 'Bhattacharya, S., Dvorák, W., Henzinger, M. H., & Starnberger, Martin.
(2015). Welfare maximization with friends-of-friends network externalities. In
32nd International Symposium on Theoretical Aspects of Computer Science
(Vol. 30, pp. 90–102). Garching, Germany: Schloss Dagstuhl - Leibniz-Zentrum für
Informatik. https://doi.org/10.4230/LIPICS.STACS.2015.90'
chicago: Bhattacharya, Sayan, Wolfgang Dvorák, Monika H Henzinger, and Martin Starnberger.
“Welfare Maximization with Friends-of-Friends Network Externalities.” In 32nd
International Symposium on Theoretical Aspects of Computer Science, 30:90–102.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. https://doi.org/10.4230/LIPICS.STACS.2015.90.
ieee: S. Bhattacharya, W. Dvorák, M. H. Henzinger, and Martin Starnberger, “Welfare
maximization with friends-of-friends network externalities,” in 32nd International
Symposium on Theoretical Aspects of Computer Science, Garching, Germany, 2015,
vol. 30, pp. 90–102.
ista: 'Bhattacharya S, Dvorák W, Henzinger MH, Starnberger Martin. 2015. Welfare
maximization with friends-of-friends network externalities. 32nd International
Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical
Aspects of Computer Science, LIPIcs, vol. 30, 90–102.'
mla: Bhattacharya, Sayan, et al. “Welfare Maximization with Friends-of-Friends Network
Externalities.” 32nd International Symposium on Theoretical Aspects of Computer
Science, vol. 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015,
pp. 90–102, doi:10.4230/LIPICS.STACS.2015.90.
short: S. Bhattacharya, W. Dvorák, M.H. Henzinger, Martin Starnberger, in:, 32nd
International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2015, pp. 90–102.
conference:
end_date: 2015-03-07
location: Garching, Germany
name: 'STACS: Symposium on Theoretical Aspects of Computer Science'
start_date: 2015-03-04
date_created: 2022-08-12T11:39:40Z
date_published: 2015-02-26T00:00:00Z
date_updated: 2023-02-21T16:32:37Z
day: '26'
doi: 10.4230/LIPICS.STACS.2015.90
extern: '1'
intvolume: ' 30'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPICS.STACS.2015.90
month: '02'
oa: 1
oa_version: Published Version
page: 90-102
publication: 32nd International Symposium on Theoretical Aspects of Computer Science
publication_identifier:
isbn:
- 978-3-939897-78-1
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '11903'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Welfare maximization with friends-of-friends network externalities
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2015'
...
---
_id: '11901'
abstract:
- lang: eng
text: We consider auctions of indivisible items to unit-demand bidders with budgets.
This setting was suggested as an expressive model for single sponsored search
auctions. Prior work presented mechanisms that compute bidder-optimal outcomes
and are truthful for a restricted set of inputs, i.e., inputs in so-called general
position. This condition is easily violated. We provide the first mechanism that
is truthful in expectation for all inputs and achieves for each bidder no worse
utility than the bidder-optimal outcome. Additionally we give a complete characterization
for which inputs mechanisms that compute bidder-optimal outcomes are truthful.
article_processing_charge: No
article_type: original
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: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: Henzinger MH, Loitzenbauer V. Truthful unit-demand auctions with budgets revisited.
Theoretical Computer Science. 2015;573:1-15. doi:10.1016/j.tcs.2015.01.033
apa: Henzinger, M. H., & Loitzenbauer, V. (2015). Truthful unit-demand auctions
with budgets revisited. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2015.01.033
chicago: Henzinger, Monika H, and Veronika Loitzenbauer. “Truthful Unit-Demand Auctions
with Budgets Revisited.” Theoretical Computer Science. Elsevier, 2015.
https://doi.org/10.1016/j.tcs.2015.01.033.
ieee: M. H. Henzinger and V. Loitzenbauer, “Truthful unit-demand auctions with budgets
revisited,” Theoretical Computer Science, vol. 573. Elsevier, pp. 1–15,
2015.
ista: Henzinger MH, Loitzenbauer V. 2015. Truthful unit-demand auctions with budgets
revisited. Theoretical Computer Science. 573, 1–15.
mla: Henzinger, Monika H., and Veronika Loitzenbauer. “Truthful Unit-Demand Auctions
with Budgets Revisited.” Theoretical Computer Science, vol. 573, Elsevier,
2015, pp. 1–15, doi:10.1016/j.tcs.2015.01.033.
short: M.H. Henzinger, V. Loitzenbauer, Theoretical Computer Science 573 (2015)
1–15.
date_created: 2022-08-17T09:06:53Z
date_published: 2015-03-30T00:00:00Z
date_updated: 2023-02-17T14:50:04Z
day: '30'
doi: 10.1016/j.tcs.2015.01.033
extern: '1'
intvolume: ' 573'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.tcs.2015.01.033
month: '03'
oa: 1
oa_version: None
page: 1-15
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Truthful unit-demand auctions with budgets revisited
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 573
year: '2015'
...
---
_id: '11962'
abstract:
- lang: eng
text: One of the rare alternative reagents for the reduction of carbon–carbon double
bonds is diimide (HNNH), which can be generated in situ from hydrazine hydrate
(N2H4⋅H2O) and O2. Although this selective method is extremely clean and powerful,
it is rarely used, as the rate-determining oxidation of hydrazine in the absence
of a catalyst is relatively slow using conventional batch protocols. A continuous
high-temperature/high-pressure methodology dramatically enhances the initial oxidation
step, at the same time allowing for a safe and scalable processing of the hazardous
reaction mixture. Simple alkenes can be selectively reduced within 10–20 min at
100–120 °C and 20 bar O2 pressure. The development of a multi-injection reactor
platform for the periodic addition of N2H4⋅H2O enables the reduction of less reactive
olefins even at lower reaction temperatures. This concept was utilized for the
highly selective reduction of artemisinic acid to dihydroartemisinic acid, the
precursor molecule for the semisynthesis of the antimalarial drug artemisinin.
The industrially relevant reduction was achieved by using four consecutive liquid
feeds (of N2H4⋅H2O) and residence time units resulting in a highly selective reduction
within approximately 40 min at 60 °C and 20 bar O2 pressure, providing dihydroartemisinic
acid in ≥93 % yield and ≥95 % selectivity.
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: Toma
full_name: Glasnov, Toma
last_name: Glasnov
- first_name: C. Oliver
full_name: Kappe, C. Oliver
last_name: Kappe
citation:
ama: Pieber B, Glasnov T, Kappe CO. Continuous flow reduction of artemisinic acid
utilizing multi-injection strategies-closing the gap towards a fully continuous
synthesis of antimalarial drugs. Chemistry - A European Journal. 2015;21(11):4368-4376.
doi:10.1002/chem.201406439
apa: Pieber, B., Glasnov, T., & Kappe, C. O. (2015). Continuous flow reduction
of artemisinic acid utilizing multi-injection strategies-closing the gap towards
a fully continuous synthesis of antimalarial drugs. Chemistry - A European
Journal. Wiley. https://doi.org/10.1002/chem.201406439
chicago: Pieber, Bartholomäus, Toma Glasnov, and C. Oliver Kappe. “Continuous Flow
Reduction of Artemisinic Acid Utilizing Multi-Injection Strategies-Closing the
Gap towards a Fully Continuous Synthesis of Antimalarial Drugs.” Chemistry
- A European Journal. Wiley, 2015. https://doi.org/10.1002/chem.201406439.
ieee: B. Pieber, T. Glasnov, and C. O. Kappe, “Continuous flow reduction of artemisinic
acid utilizing multi-injection strategies-closing the gap towards a fully continuous
synthesis of antimalarial drugs,” Chemistry - A European Journal, vol.
21, no. 11. Wiley, pp. 4368–4376, 2015.
ista: Pieber B, Glasnov T, Kappe CO. 2015. Continuous flow reduction of artemisinic
acid utilizing multi-injection strategies-closing the gap towards a fully continuous
synthesis of antimalarial drugs. Chemistry - A European Journal. 21(11), 4368–4376.
mla: Pieber, Bartholomäus, et al. “Continuous Flow Reduction of Artemisinic Acid
Utilizing Multi-Injection Strategies-Closing the Gap towards a Fully Continuous
Synthesis of Antimalarial Drugs.” Chemistry - A European Journal, vol.
21, no. 11, Wiley, 2015, pp. 4368–76, doi:10.1002/chem.201406439.
short: B. Pieber, T. Glasnov, C.O. Kappe, Chemistry - A European Journal 21 (2015)
4368–4376.
date_created: 2022-08-24T11:11:10Z
date_published: 2015-03-09T00:00:00Z
date_updated: 2023-02-21T10:09:30Z
day: '09'
doi: 10.1002/chem.201406439
extern: '1'
external_id:
pmid:
- '25655090'
intvolume: ' 21'
issue: '11'
language:
- iso: eng
month: '03'
oa_version: None
page: 4368-4376
pmid: 1
publication: Chemistry - A European Journal
publication_identifier:
eissn:
- 1521-3765
issn:
- 0947-6539
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Continuous flow reduction of artemisinic acid utilizing multi-injection strategies-closing
the gap towards a fully continuous synthesis of antimalarial drugs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2015'
...
---
_id: '11977'
abstract:
- lang: eng
text: The development of a continuous flow multistep strategy for the synthesis
of linear peptoids and their subsequent macrocyclization via Click chemistry is
described. The central transformation of this process is an Ugi four-component
reaction generating the peptidomimetic core structure. In order to avoid exposure
to the often toxic and malodorous isocyanide building blocks, the continuous approach
was telescoped by the dehydration of the corresponding formamide. In a concurrent
operation, the highly energetic azide moiety required for the subsequent intramolecular
copper-catalyzed azide–alkyne cycloaddition (Click reaction) was installed by
nucleophilic substitution from a bromide precursor. All steps yielding to the
linear core structures can be conveniently coupled without the need for purification
steps resulting in a single process generating the desired peptidomimetics in
good to excellent yields within a 25 min reaction time. The following macrocyclization
was realized in a coil reactor made of copper without any additional additive.
A careful process intensification study demonstrated that this transformation
occurs quantitatively within 25 min at 140 °C. Depending on the resulting ring
strain, either a dimeric or a monomeric form of the cyclic product was obtained.
article_processing_charge: No
article_type: original
author:
- first_name: Carlos Eduardo M.
full_name: Salvador, Carlos Eduardo M.
last_name: Salvador
- 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: Philipp M.
full_name: Neu, Philipp M.
last_name: Neu
- first_name: Ana
full_name: Torvisco, Ana
last_name: Torvisco
- first_name: Carlos
full_name: Kleber Z. Andrade, Carlos
last_name: Kleber Z. Andrade
- first_name: C. Oliver
full_name: Kappe, C. Oliver
last_name: Kappe
citation:
ama: Salvador CEM, Pieber B, Neu PM, Torvisco A, Kleber Z. Andrade C, Kappe CO.
A sequential Ugi multicomponent/Cu-catalyzed azide–alkyne cycloaddition approach
for the continuous flow generation of cyclic peptoids. The Journal of Organic
Chemistry. 2015;80(9):4590-4602. doi:10.1021/acs.joc.5b00445
apa: Salvador, C. E. M., Pieber, B., Neu, P. M., Torvisco, A., Kleber Z. Andrade,
C., & Kappe, C. O. (2015). A sequential Ugi multicomponent/Cu-catalyzed azide–alkyne
cycloaddition approach for the continuous flow generation of cyclic peptoids.
The Journal of Organic Chemistry. American Chemical Society. https://doi.org/10.1021/acs.joc.5b00445
chicago: Salvador, Carlos Eduardo M., Bartholomäus Pieber, Philipp M. Neu, Ana Torvisco,
Carlos Kleber Z. Andrade, and C. Oliver Kappe. “A Sequential Ugi Multicomponent/Cu-Catalyzed
Azide–Alkyne Cycloaddition Approach for the Continuous Flow Generation of Cyclic
Peptoids.” The Journal of Organic Chemistry. American Chemical Society,
2015. https://doi.org/10.1021/acs.joc.5b00445.
ieee: C. E. M. Salvador, B. Pieber, P. M. Neu, A. Torvisco, C. Kleber Z. Andrade,
and C. O. Kappe, “A sequential Ugi multicomponent/Cu-catalyzed azide–alkyne cycloaddition
approach for the continuous flow generation of cyclic peptoids,” The Journal
of Organic Chemistry, vol. 80, no. 9. American Chemical Society, pp. 4590–4602,
2015.
ista: Salvador CEM, Pieber B, Neu PM, Torvisco A, Kleber Z. Andrade C, Kappe CO.
2015. A sequential Ugi multicomponent/Cu-catalyzed azide–alkyne cycloaddition
approach for the continuous flow generation of cyclic peptoids. The Journal of
Organic Chemistry. 80(9), 4590–4602.
mla: Salvador, Carlos Eduardo M., et al. “A Sequential Ugi Multicomponent/Cu-Catalyzed
Azide–Alkyne Cycloaddition Approach for the Continuous Flow Generation of Cyclic
Peptoids.” The Journal of Organic Chemistry, vol. 80, no. 9, American Chemical
Society, 2015, pp. 4590–602, doi:10.1021/acs.joc.5b00445.
short: C.E.M. Salvador, B. Pieber, P.M. Neu, A. Torvisco, C. Kleber Z. Andrade,
C.O. Kappe, The Journal of Organic Chemistry 80 (2015) 4590–4602.
date_created: 2022-08-25T10:52:24Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2023-02-21T10:10:04Z
day: '01'
doi: 10.1021/acs.joc.5b00445
extern: '1'
external_id:
pmid:
- '25842982'
intvolume: ' 80'
issue: '9'
language:
- iso: eng
month: '05'
oa_version: None
page: 4590-4602
pmid: 1
publication: The Journal of Organic Chemistry
publication_identifier:
eissn:
- 1520-6904
issn:
- 0022-3263
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: A sequential Ugi multicomponent/Cu-catalyzed azide–alkyne cycloaddition approach
for the continuous flow generation of cyclic peptoids
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 80
year: '2015'
...
---
_id: '11989'
abstract:
- lang: eng
text: In recent years, the high demand for sustainable processes resulted in the
development of highly attractive oxidation protocols utilizing molecular oxygen
or even air instead of more uneconomic and often toxic reagents. The application
of these sustainable, gaseous oxidants in conventional batch reactors is often
associated with severe safety risks and process challenges especially on larger
scales. Continuous flow technology offers the possibility to minimize these safety
hazards and concurrently allows working in high-temperature/high-pressure regimes
to access highly efficient oxidation protocols. This review article critically
discusses recent literature examples of flow methodologies for selective aerobic
oxidations of organic compounds. Several technologies and reactor designs for
biphasic gas/liquid as well as supercritical reaction media are presented in detail.
© Springer International Publishing Switzerland 2015.
alternative_title:
- Topics in Organometallic Chemistry
article_processing_charge: No
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: C. Oliver
full_name: Kappe, C. Oliver
last_name: Kappe
citation:
ama: 'Pieber B, Kappe CO. Aerobic oxidations in continuous flow. In: Noël T, ed.
Organometallic Flow Chemistry. Vol 57. 1st ed. TOPORGAN. Cham: Springer
Nature; 2015:97–136. doi:10.1007/3418_2015_133'
apa: 'Pieber, B., & Kappe, C. O. (2015). Aerobic oxidations in continuous flow.
In T. Noël (Ed.), Organometallic Flow Chemistry (1st ed., Vol. 57, pp.
97–136). Cham: Springer Nature. https://doi.org/10.1007/3418_2015_133'
chicago: 'Pieber, Bartholomäus, and C. Oliver Kappe. “Aerobic Oxidations in Continuous
Flow.” In Organometallic Flow Chemistry, edited by Timothy Noël, 1st ed.,
57:97–136. TOPORGAN. Cham: Springer Nature, 2015. https://doi.org/10.1007/3418_2015_133.'
ieee: 'B. Pieber and C. O. Kappe, “Aerobic oxidations in continuous flow,” in Organometallic
Flow Chemistry, 1st ed., vol. 57, T. Noël, Ed. Cham: Springer Nature, 2015,
pp. 97–136.'
ista: 'Pieber B, Kappe CO. 2015.Aerobic oxidations in continuous flow. In: Organometallic
Flow Chemistry. Topics in Organometallic Chemistry, vol. 57, 97–136.'
mla: Pieber, Bartholomäus, and C. Oliver Kappe. “Aerobic Oxidations in Continuous
Flow.” Organometallic Flow Chemistry, edited by Timothy Noël, 1st ed.,
vol. 57, Springer Nature, 2015, pp. 97–136, doi:10.1007/3418_2015_133.
short: B. Pieber, C.O. Kappe, in:, T. Noël (Ed.), Organometallic Flow Chemistry,
1st ed., Springer Nature, Cham, 2015, pp. 97–136.
date_created: 2022-08-25T11:58:38Z
date_published: 2015-06-10T00:00:00Z
date_updated: 2023-02-21T10:10:35Z
day: '10'
doi: 10.1007/3418_2015_133
edition: '1'
editor:
- first_name: Timothy
full_name: Noël, Timothy
last_name: Noël
extern: '1'
intvolume: ' 57'
language:
- iso: eng
month: '06'
oa_version: None
page: 97–136
place: Cham
publication: Organometallic Flow Chemistry
publication_identifier:
eisbn:
- '9783319332437'
eissn:
- 1616-8534
isbn:
- '9783319332413'
issn:
- 1436-6002
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: TOPORGAN
status: public
title: Aerobic oxidations in continuous flow
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2015'
...
---
_id: '120'
abstract:
- lang: eng
text: Clustering of fine particles is of crucial importance in settings ranging
from the early stages of planet formation to the coagulation of industrial powders
and airborne pollutants. Models of such clustering typically focus on inelastic
deformation and cohesion. However, even in charge-neutral particle systems comprising
grains of the same dielectric material, tribocharging can generate large amounts
of net positive or negative charge on individual particles, resulting in long-range
electrostatic forces. The effects of such forces on cluster formation are not
well understood and have so far not been studied in situ. Here we report the first
observations of individual collide-and-capture events between charged submillimetre
particles, including Kepler-like orbits. Charged particles can become trapped
in their mutual electrostatic energy well and aggregate via multiple bounces.
This enables the initiation of clustering at relative velocities much larger than
the upper limit for sticking after a head-on collision, a long-standing issue
known from pre-planetary dust aggregation. Moreover, Coulomb interactions together
with dielectric polarization are found to stabilize characteristic molecule-like
configurations, providing new insights for the modelling of clustering dynamics
in a wide range of microscopic dielectric systems, such as charged polarizable
ions, biomolecules and colloids.
acknowledgement: This research was supported by NSF through DMR-1309611. The Chicago
MRSEC, supported by NSF DMR-1420709, is gratefully acknowledged for access to its
shared experimental facilities.
author:
- first_name: Victor
full_name: Lee, Victor
last_name: Lee
- 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: Marc
full_name: Miskin, Marc
last_name: Miskin
- first_name: Heinrich
full_name: Jaeger, Heinrich
last_name: Jaeger
citation:
ama: Lee V, Waitukaitis SR, Miskin M, Jaeger H. Direct observation of particle interactions
and clustering in charged granular streams. Nature Physics. 2015;11(9):733-737.
doi:10.1038/nphys3396
apa: Lee, V., Waitukaitis, S. R., Miskin, M., & Jaeger, H. (2015). Direct observation
of particle interactions and clustering in charged granular streams. Nature
Physics. Nature Publishing Group. https://doi.org/10.1038/nphys3396
chicago: Lee, Victor, Scott R Waitukaitis, Marc Miskin, and Heinrich Jaeger. “Direct
Observation of Particle Interactions and Clustering in Charged Granular Streams.”
Nature Physics. Nature Publishing Group, 2015. https://doi.org/10.1038/nphys3396.
ieee: V. Lee, S. R. Waitukaitis, M. Miskin, and H. Jaeger, “Direct observation of
particle interactions and clustering in charged granular streams,” Nature Physics,
vol. 11, no. 9. Nature Publishing Group, pp. 733–737, 2015.
ista: Lee V, Waitukaitis SR, Miskin M, Jaeger H. 2015. Direct observation of particle
interactions and clustering in charged granular streams. Nature Physics. 11(9),
733–737.
mla: Lee, Victor, et al. “Direct Observation of Particle Interactions and Clustering
in Charged Granular Streams.” Nature Physics, vol. 11, no. 9, Nature Publishing
Group, 2015, pp. 733–37, doi:10.1038/nphys3396.
short: V. Lee, S.R. Waitukaitis, M. Miskin, H. Jaeger, Nature Physics 11 (2015)
733–737.
date_created: 2018-12-11T11:44:44Z
date_published: 2015-07-13T00:00:00Z
date_updated: 2021-01-12T06:49:02Z
day: '13'
doi: 10.1038/nphys3396
extern: '1'
intvolume: ' 11'
issue: '9'
language:
- iso: eng
month: '07'
oa_version: None
page: 733 - 737
publication: Nature Physics
publication_status: published
publisher: Nature Publishing Group
publist_id: '7934'
quality_controlled: '1'
status: public
title: Direct observation of particle interactions and clustering in charged granular
streams
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2015'
...
---
_id: '121'
abstract:
- lang: eng
text: We show that the simplest building blocks of origami-based materials - rigid,
degree-four vertices - are generically multistable. The existence of two distinct
branches of folding motion emerging from the flat state suggests at least bistability,
but we show how nonlinearities in the folding motions allow generic vertex geometries
to have as many as five stable states. In special geometries with collinear folds
and symmetry, more branches emerge leading to as many as six stable states. Tuning
the fold energy parameters, we show how monostability is also possible. Finally,
we show how to program the stability features of a single vertex into a periodic
fold tessellation. The resulting metasheets provide a previously unanticipated
functionality - tunable and switchable shape and size via multistability.
acknowledgement: B. G. C. acknowledges support from FOM, and S. W. and M. v. H. acknowledge
support from NWO.
article_number: '055503'
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: Rémi
full_name: Menaut, Rémi
last_name: Menaut
- first_name: Bryan
full_name: Chen, Bryan
last_name: Chen
- first_name: Martin
full_name: Van Hecke, Martin
last_name: Van Hecke
citation:
ama: 'Waitukaitis SR, Menaut R, Chen B, Van Hecke M. Origami multistability: From
single vertices to metasheets. APS Physics, Physical Review Letters. 2015;114(5).
doi:10.1103/PhysRevLett.114.055503'
apa: 'Waitukaitis, S. R., Menaut, R., Chen, B., & Van Hecke, M. (2015). Origami
multistability: From single vertices to metasheets. APS Physics, Physical Review
Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.114.055503'
chicago: 'Waitukaitis, Scott R, Rémi Menaut, Bryan Chen, and Martin Van Hecke. “Origami
Multistability: From Single Vertices to Metasheets.” APS Physics, Physical
Review Letters. American Physical Society, 2015. https://doi.org/10.1103/PhysRevLett.114.055503.'
ieee: 'S. R. Waitukaitis, R. Menaut, B. Chen, and M. Van Hecke, “Origami multistability:
From single vertices to metasheets,” APS Physics, Physical Review Letters,
vol. 114, no. 5. American Physical Society, 2015.'
ista: 'Waitukaitis SR, Menaut R, Chen B, Van Hecke M. 2015. Origami multistability:
From single vertices to metasheets. APS Physics, Physical Review Letters. 114(5),
055503.'
mla: 'Waitukaitis, Scott R., et al. “Origami Multistability: From Single Vertices
to Metasheets.” APS Physics, Physical Review Letters, vol. 114, no. 5,
055503, American Physical Society, 2015, doi:10.1103/PhysRevLett.114.055503.'
short: S.R. Waitukaitis, R. Menaut, B. Chen, M. Van Hecke, APS Physics, Physical
Review Letters 114 (2015).
date_created: 2018-12-11T11:44:44Z
date_published: 2015-02-04T00:00:00Z
date_updated: 2021-01-12T06:49:07Z
day: '04'
doi: 10.1103/PhysRevLett.114.055503
extern: '1'
external_id:
arxiv:
- '1408.1607'
intvolume: ' 114'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1408.1607
month: '02'
oa: 1
oa_version: Preprint
publication: APS Physics, Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '7933'
quality_controlled: '1'
status: public
title: 'Origami multistability: From single vertices to metasheets'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 114
year: '2015'
...
---
_id: '1311'
abstract:
- lang: eng
text: In this paper, we develop an energy method to study finite speed of propagation
and waiting time phenomena for the stochastic porous media equation with linear
multiplicative noise in up to three spatial dimensions. Based on a novel iteration
technique and on stochastic counterparts of weighted integral estimates used in
the deterministic setting, we formulate a sufficient criterion on the growth of
initial data which locally guarantees a waiting time phenomenon to occur almost
surely. Up to a logarithmic factor, this criterion coincides with the optimal
criterion known from the deterministic setting. Our technique can be modified
to prove finite speed of propagation as well.
acknowledgement: The first author has been supported by the Lithuanian-Swiss co- operation
program under the project agreement No. CH-SMM-01/0.
author:
- first_name: Julian L
full_name: Julian Fischer
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
- first_name: Günther
full_name: Grün, Günther
last_name: Grün
citation:
ama: 'Fischer JL, Grün G. Finite speed of propagation and waiting times for the
stochastic porous medium equation: A unifying approach. SIAM Journal on Mathematical
Analysis. 2015;47(1):825-854. doi:10.1137/140960578'
apa: 'Fischer, J. L., & Grün, G. (2015). Finite speed of propagation and waiting
times for the stochastic porous medium equation: A unifying approach. SIAM
Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics
. https://doi.org/10.1137/140960578'
chicago: 'Fischer, Julian L, and Günther Grün. “Finite Speed of Propagation and
Waiting Times for the Stochastic Porous Medium Equation: A Unifying Approach.”
SIAM Journal on Mathematical Analysis. Society for Industrial and Applied
Mathematics , 2015. https://doi.org/10.1137/140960578.'
ieee: 'J. L. Fischer and G. Grün, “Finite speed of propagation and waiting times
for the stochastic porous medium equation: A unifying approach,” SIAM Journal
on Mathematical Analysis, vol. 47, no. 1. Society for Industrial and Applied
Mathematics , pp. 825–854, 2015.'
ista: 'Fischer JL, Grün G. 2015. Finite speed of propagation and waiting times for
the stochastic porous medium equation: A unifying approach. SIAM Journal on Mathematical
Analysis. 47(1), 825–854.'
mla: 'Fischer, Julian L., and Günther Grün. “Finite Speed of Propagation and Waiting
Times for the Stochastic Porous Medium Equation: A Unifying Approach.” SIAM
Journal on Mathematical Analysis, vol. 47, no. 1, Society for Industrial and
Applied Mathematics , 2015, pp. 825–54, doi:10.1137/140960578.'
short: J.L. Fischer, G. Grün, SIAM Journal on Mathematical Analysis 47 (2015) 825–854.
date_created: 2018-12-11T11:51:18Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:49:48Z
day: '01'
doi: 10.1137/140960578
extern: 1
intvolume: ' 47'
issue: '1'
month: '01'
page: 825 - 854
publication: SIAM Journal on Mathematical Analysis
publication_status: published
publisher: 'Society for Industrial and Applied Mathematics '
publist_id: '5958'
quality_controlled: 0
status: public
title: 'Finite speed of propagation and waiting times for the stochastic porous medium
equation: A unifying approach'
type: journal_article
volume: 47
year: '2015'
...
---
_id: '1314'
abstract:
- lang: eng
text: 'We derive a posteriori estimates for the modeling error caused by the assumption
of perfect incompressibility in the incompressible Navier-Stokes equation: Real
fluids are never perfectly incompressible but always feature at least some low
amount of compressibility. Thus, their behavior is described by the compressible
Navier-Stokes equation, the pressure being a steep function of the density. We
rigorously estimate the difference between an approximate solution to the incompressible
Navier-Stokes equation and any weak solution to the compressible Navier-Stokes
equation in the sense of Lions (without assuming any additional regularity of
solutions). Heuristics and numerical results suggest that our error estimates
are of optimal order in the case of "well-behaved" flows and divergence-free
approximations of the velocity field. Thus, we expect our estimates to justify
the idealization of fluids as perfectly incompressible also in practical situations.'
acknowledgement: The research of the author was supported by the Lithuanian-Swiss
cooperation program under the project agreement CH-SMM-01/0.
author:
- first_name: Julian L
full_name: Fischer, Julian L
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
citation:
ama: Fischer JL. A posteriori modeling error estimates for the assumption of perfect
incompressibility in the Navier-Stokes equation. SIAM Journal on Numerical
Analysis. 2015;53(5):2178-2205. doi:10.1137/140966654
apa: Fischer, J. L. (2015). A posteriori modeling error estimates for the assumption
of perfect incompressibility in the Navier-Stokes equation. SIAM Journal on
Numerical Analysis. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/140966654
chicago: Fischer, Julian L. “A Posteriori Modeling Error Estimates for the Assumption
of Perfect Incompressibility in the Navier-Stokes Equation.” SIAM Journal on
Numerical Analysis. Society for Industrial and Applied Mathematics , 2015.
https://doi.org/10.1137/140966654.
ieee: J. L. Fischer, “A posteriori modeling error estimates for the assumption of
perfect incompressibility in the Navier-Stokes equation,” SIAM Journal on Numerical
Analysis, vol. 53, no. 5. Society for Industrial and Applied Mathematics ,
pp. 2178–2205, 2015.
ista: Fischer JL. 2015. A posteriori modeling error estimates for the assumption
of perfect incompressibility in the Navier-Stokes equation. SIAM Journal on Numerical
Analysis. 53(5), 2178–2205.
mla: Fischer, Julian L. “A Posteriori Modeling Error Estimates for the Assumption
of Perfect Incompressibility in the Navier-Stokes Equation.” SIAM Journal on
Numerical Analysis, vol. 53, no. 5, Society for Industrial and Applied Mathematics
, 2015, pp. 2178–205, doi:10.1137/140966654.
short: J.L. Fischer, SIAM Journal on Numerical Analysis 53 (2015) 2178–2205.
date_created: 2018-12-11T11:51:19Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:49:49Z
day: '01'
doi: 10.1137/140966654
extern: '1'
intvolume: ' 53'
issue: '5'
language:
- iso: eng
month: '01'
oa_version: None
page: 2178 - 2205
publication: SIAM Journal on Numerical Analysis
publication_status: published
publisher: 'Society for Industrial and Applied Mathematics '
publist_id: '5957'
quality_controlled: '1'
status: public
title: A posteriori modeling error estimates for the assumption of perfect incompressibility
in the Navier-Stokes equation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 53
year: '2015'
...
---
_id: '1313'
abstract:
- lang: eng
text: We present an algorithm for the derivation of lower bounds on support propagation
for a certain class of nonlinear parabolic equations. We proceed by combining
the ideas in some recent papers by the author with the algorithmic construction
of entropies due to Jüngel and Matthes, reducing the problem to a quantifier elimination
problem. Due to its complexity, the quantifier elimination problem cannot be solved
by present exact algorithms. However, by tackling the quantifier elimination problem
numerically, in the case of the thin-film equation we are able to improve recent
results by the author in the regime of strong slippage n ∈ (1, 2). For certain
second-order doubly nonlinear parabolic equations, we are able to extend the known
lower bounds on free boundary propagation to the case of irregular oscillatory
initial data. Finally, we apply our method to a sixth-order quantum drift-diffusion
equation, resulting in an upper bound on the time which it takes for the support
to reach every point in the domain.
acknowledgement: This research was supported by the Lithuanian-Swiss cooperation program
under the project agreement No. CH-SMM-01/0.
author:
- first_name: Julian L
full_name: Julian Fischer
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
citation:
ama: 'Fischer JL. Estimates on front propagation for nonlinear higher-order parabolic
equations: An algorithmic approach. Interfaces and Free Boundaries. 2015;17(1):1-20.
doi:10.4171/IFB/331'
apa: 'Fischer, J. L. (2015). Estimates on front propagation for nonlinear higher-order
parabolic equations: An algorithmic approach. Interfaces and Free Boundaries.
European Mathematical Society Publishing House. https://doi.org/10.4171/IFB/331'
chicago: 'Fischer, Julian L. “Estimates on Front Propagation for Nonlinear Higher-Order
Parabolic Equations: An Algorithmic Approach.” Interfaces and Free Boundaries.
European Mathematical Society Publishing House, 2015. https://doi.org/10.4171/IFB/331.'
ieee: 'J. L. Fischer, “Estimates on front propagation for nonlinear higher-order
parabolic equations: An algorithmic approach,” Interfaces and Free Boundaries,
vol. 17, no. 1. European Mathematical Society Publishing House, pp. 1–20, 2015.'
ista: 'Fischer JL. 2015. Estimates on front propagation for nonlinear higher-order
parabolic equations: An algorithmic approach. Interfaces and Free Boundaries.
17(1), 1–20.'
mla: 'Fischer, Julian L. “Estimates on Front Propagation for Nonlinear Higher-Order
Parabolic Equations: An Algorithmic Approach.” Interfaces and Free Boundaries,
vol. 17, no. 1, European Mathematical Society Publishing House, 2015, pp. 1–20,
doi:10.4171/IFB/331.'
short: J.L. Fischer, Interfaces and Free Boundaries 17 (2015) 1–20.
date_created: 2018-12-11T11:51:19Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:49:48Z
day: '01'
doi: 10.4171/IFB/331
extern: 1
intvolume: ' 17'
issue: '1'
month: '01'
page: 1 - 20
publication: Interfaces and Free Boundaries
publication_status: published
publisher: European Mathematical Society Publishing House
publist_id: '5956'
quality_controlled: 0
status: public
title: 'Estimates on front propagation for nonlinear higher-order parabolic equations:
An algorithmic approach'
type: journal_article
volume: 17
year: '2015'
...
---
_id: '1316'
abstract:
- lang: eng
text: In the present work we introduce the notion of a renormalized solution for
reaction–diffusion systems with entropy-dissipating reactions. We establish the
global existence of renormalized solutions. In the case of integrable reaction
terms our notion of a renormalized solution reduces to the usual notion of a weak
solution. Our existence result in particular covers all reaction–diffusion systems
involving a single reversible reaction with mass-action kinetics and (possibly
species-dependent) Fick-law diffusion; more generally, it covers the case of systems
of reversible reactions with mass-action kinetics which satisfy the detailed balance
condition. For such equations the existence of any kind of solution in general
was an open problem, thereby motivating the study of renormalized solutions.
acknowledgement: This research was supported by the Lithuanian-Swiss cooperation program
under the project agreement No. CH-SMM-01/0.
author:
- first_name: Julian L
full_name: Julian Fischer
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
citation:
ama: Fischer JL. Global existence of renormalized solutions to entropy-dissipating
reaction–diffusion systems. Archive for Rational Mechanics and Analysis.
2015;218(1):553-587. doi:10.1007/s00205-015-0866-x
apa: Fischer, J. L. (2015). Global existence of renormalized solutions to entropy-dissipating
reaction–diffusion systems. Archive for Rational Mechanics and Analysis.
Springer. https://doi.org/10.1007/s00205-015-0866-x
chicago: Fischer, Julian L. “Global Existence of Renormalized Solutions to Entropy-Dissipating
Reaction–Diffusion Systems.” Archive for Rational Mechanics and Analysis.
Springer, 2015. https://doi.org/10.1007/s00205-015-0866-x.
ieee: J. L. Fischer, “Global existence of renormalized solutions to entropy-dissipating
reaction–diffusion systems,” Archive for Rational Mechanics and Analysis,
vol. 218, no. 1. Springer, pp. 553–587, 2015.
ista: Fischer JL. 2015. Global existence of renormalized solutions to entropy-dissipating
reaction–diffusion systems. Archive for Rational Mechanics and Analysis. 218(1),
553–587.
mla: Fischer, Julian L. “Global Existence of Renormalized Solutions to Entropy-Dissipating
Reaction–Diffusion Systems.” Archive for Rational Mechanics and Analysis,
vol. 218, no. 1, Springer, 2015, pp. 553–87, doi:10.1007/s00205-015-0866-x.
short: J.L. Fischer, Archive for Rational Mechanics and Analysis 218 (2015) 553–587.
date_created: 2018-12-11T11:51:20Z
date_published: 2015-10-01T00:00:00Z
date_updated: 2021-01-12T06:49:50Z
day: '01'
doi: 10.1007/s00205-015-0866-x
extern: 1
intvolume: ' 218'
issue: '1'
month: '10'
page: 553 - 587
publication: Archive for Rational Mechanics and Analysis
publication_status: published
publisher: Springer
publist_id: '5955'
quality_controlled: 0
status: public
title: Global existence of renormalized solutions to entropy-dissipating reaction–diffusion
systems
type: journal_article
volume: 218
year: '2015'
...
---
_id: '1383'
abstract:
- lang: eng
text: In plants, vacuolar H+-ATPase (V-ATPase) activity acidifies both the trans-Golgi
network/early endosome (TGN/EE) and the vacuole. This dual V-ATPase function has
impeded our understanding of how the pH homeostasis within the plant TGN/EE controls
exo- and endocytosis. Here, we show that the weak V-ATPase mutant deetiolated3
(det3) displayed a pH increase in the TGN/EE, but not in the vacuole, strongly
impairing secretion and recycling of the brassinosteroid receptor and the cellulose
synthase complexes to the plasma membrane, in contrast to mutants lacking tonoplast-localized
V-ATPase activity only. The brassinosteroid insensitivity and the cellulose deficiency
defects in det3 were tightly correlated with reduced Golgi and TGN/EE motility.
Thus, our results provide strong evidence that acidification of the TGN/EE, but
not of the vacuole, is indispensable for functional secretion and recycling in
plants.
article_number: '15094'
article_processing_charge: No
article_type: original
author:
- first_name: Luo
full_name: Yu, Luo
last_name: Yu
- first_name: Stefan
full_name: Scholl, Stefan
last_name: Scholl
- first_name: Anett
full_name: Doering, Anett
last_name: Doering
- first_name: Zhang
full_name: Yi, Zhang
last_name: Yi
- first_name: Niloufer
full_name: Irani, Niloufer
last_name: Irani
- first_name: Simone
full_name: Di Rubbo, Simone
last_name: Di Rubbo
- first_name: Lutz
full_name: Neumetzler, Lutz
last_name: Neumetzler
- first_name: Praveen
full_name: Krishnamoorthy, Praveen
last_name: Krishnamoorthy
- first_name: Isabelle
full_name: Van Houtte, Isabelle
last_name: Van Houtte
- first_name: Evelien
full_name: Mylle, Evelien
last_name: Mylle
- first_name: Volker
full_name: Bischoff, Volker
last_name: Bischoff
- first_name: Samantha
full_name: Vernhettes, Samantha
last_name: Vernhettes
- first_name: Johan
full_name: Winne, Johan
last_name: Winne
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: York
full_name: Stierhof, York
last_name: Stierhof
- first_name: Karin
full_name: Schumacher, Karin
last_name: Schumacher
- first_name: Staffan
full_name: Persson, Staffan
last_name: Persson
- first_name: Eugenia
full_name: Russinova, Eugenia
last_name: Russinova
citation:
ama: Yu L, Scholl S, Doering A, et al. V-ATPase activity in the TGN/EE is required
for exocytosis and recycling in Arabidopsis. Nature Plants. 2015;1(7).
doi:10.1038/nplants.2015.94
apa: Yu, L., Scholl, S., Doering, A., Yi, Z., Irani, N., Di Rubbo, S., … Russinova,
E. (2015). V-ATPase activity in the TGN/EE is required for exocytosis and recycling
in Arabidopsis. Nature Plants. Nature Publishing Group. https://doi.org/10.1038/nplants.2015.94
chicago: Yu, Luo, Stefan Scholl, Anett Doering, Zhang Yi, Niloufer Irani, Simone
Di Rubbo, Lutz Neumetzler, et al. “V-ATPase Activity in the TGN/EE Is Required
for Exocytosis and Recycling in Arabidopsis.” Nature Plants. Nature Publishing
Group, 2015. https://doi.org/10.1038/nplants.2015.94.
ieee: L. Yu et al., “V-ATPase activity in the TGN/EE is required for exocytosis
and recycling in Arabidopsis,” Nature Plants, vol. 1, no. 7. Nature Publishing
Group, 2015.
ista: Yu L, Scholl S, Doering A, Yi Z, Irani N, Di Rubbo S, Neumetzler L, Krishnamoorthy
P, Van Houtte I, Mylle E, Bischoff V, Vernhettes S, Winne J, Friml J, Stierhof
Y, Schumacher K, Persson S, Russinova E. 2015. V-ATPase activity in the TGN/EE
is required for exocytosis and recycling in Arabidopsis. Nature Plants. 1(7),
15094.
mla: Yu, Luo, et al. “V-ATPase Activity in the TGN/EE Is Required for Exocytosis
and Recycling in Arabidopsis.” Nature Plants, vol. 1, no. 7, 15094, Nature
Publishing Group, 2015, doi:10.1038/nplants.2015.94.
short: L. Yu, S. Scholl, A. Doering, Z. Yi, N. Irani, S. Di Rubbo, L. Neumetzler,
P. Krishnamoorthy, I. Van Houtte, E. Mylle, V. Bischoff, S. Vernhettes, J. Winne,
J. Friml, Y. Stierhof, K. Schumacher, S. Persson, E. Russinova, Nature Plants
1 (2015).
date_created: 2018-12-11T11:51:42Z
date_published: 2015-07-06T00:00:00Z
date_updated: 2021-01-12T06:50:18Z
day: '06'
department:
- _id: JiFr
doi: 10.1038/nplants.2015.94
external_id:
pmid:
- '27250258'
intvolume: ' 1'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4905525/
month: '07'
oa: 1
oa_version: Submitted Version
pmid: 1
publication: Nature Plants
publication_status: published
publisher: Nature Publishing Group
publist_id: '5827'
quality_controlled: '1'
scopus_import: 1
status: public
title: V-ATPase activity in the TGN/EE is required for exocytosis and recycling in
Arabidopsis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2015'
...
---
_id: '1425'
abstract:
- lang: eng
text: 'In this work we aim at extending the theoretical foundations of lifelong
learning. Previous work analyzing this scenario is based on the assumption that
learning tasks are sampled i.i.d. from a task environment or limited to strongly
constrained data distributions. Instead, we study two scenarios when lifelong
learning is possible, even though the observed tasks do not form an i.i.d. sample:
first, when they are sampled from the same environment, but possibly with dependencies,
and second, when the task environment is allowed to change over time in a consistent
way. In the first case we prove a PAC-Bayesian theorem that can be seen as a direct
generalization of the analogous previous result for the i.i.d. case. For the second
scenario we propose to learn an inductive bias in form of a transfer procedure.
We present a generalization bound and show on a toy example how it can be used
to identify a beneficial transfer algorithm.'
alternative_title:
- Advances in Neural Information Processing Systems
author:
- first_name: Anastasia
full_name: Pentina, Anastasia
id: 42E87FC6-F248-11E8-B48F-1D18A9856A87
last_name: Pentina
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Pentina A, Lampert C. Lifelong learning with non-i.i.d. tasks. In: Vol 2015.
Neural Information Processing Systems; 2015:1540-1548.'
apa: 'Pentina, A., & Lampert, C. (2015). Lifelong learning with non-i.i.d. tasks
(Vol. 2015, pp. 1540–1548). Presented at the NIPS: Neural Information Processing
Systems, Montreal, Canada: Neural Information Processing Systems.'
chicago: Pentina, Anastasia, and Christoph Lampert. “Lifelong Learning with Non-i.i.d.
Tasks,” 2015:1540–48. Neural Information Processing Systems, 2015.
ieee: 'A. Pentina and C. Lampert, “Lifelong learning with non-i.i.d. tasks,” presented
at the NIPS: Neural Information Processing Systems, Montreal, Canada, 2015, vol.
2015, pp. 1540–1548.'
ista: 'Pentina A, Lampert C. 2015. Lifelong learning with non-i.i.d. tasks. NIPS:
Neural Information Processing Systems, Advances in Neural Information Processing
Systems, vol. 2015, 1540–1548.'
mla: Pentina, Anastasia, and Christoph Lampert. Lifelong Learning with Non-i.i.d.
Tasks. Vol. 2015, Neural Information Processing Systems, 2015, pp. 1540–48.
short: A. Pentina, C. Lampert, in:, Neural Information Processing Systems, 2015,
pp. 1540–1548.
conference:
end_date: 2015-12-12
location: Montreal, Canada
name: 'NIPS: Neural Information Processing Systems'
start_date: 2015-12-07
date_created: 2018-12-11T11:51:57Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:39Z
day: '01'
department:
- _id: ChLa
ec_funded: 1
intvolume: ' 2015'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://papers.nips.cc/paper/6007-lifelong-learning-with-non-iid-tasks
month: '01'
oa: 1
oa_version: None
page: 1540 - 1548
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_status: published
publisher: Neural Information Processing Systems
publist_id: '5781'
quality_controlled: '1'
scopus_import: 1
status: public
title: Lifelong learning with non-i.i.d. tasks
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 2015
year: '2015'
...