---
_id: '11080'
abstract:
- lang: eng
text: The spindle assembly checkpoint prevents separation of sister chromatids until
each kinetochore is attached to the mitotic spindle. Rodriguez-Bravo et al. report
that the nuclear pore complex scaffolds spindle assembly checkpoint signaling
in interphase, providing a store of inhibitory signals that limits the speed of
the subsequent mitosis.
article_processing_charge: No
article_type: original
author:
- first_name: Abigail
full_name: Buchwalter, Abigail
last_name: Buchwalter
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: Buchwalter A, Hetzer M. Nuclear pores set the speed limit for mitosis. Cell.
2014;156(5):868-869. doi:10.1016/j.cell.2014.02.004
apa: Buchwalter, A., & Hetzer, M. (2014). Nuclear pores set the speed limit
for mitosis. Cell. Elsevier. https://doi.org/10.1016/j.cell.2014.02.004
chicago: Buchwalter, Abigail, and Martin Hetzer. “Nuclear Pores Set the Speed Limit
for Mitosis.” Cell. Elsevier, 2014. https://doi.org/10.1016/j.cell.2014.02.004.
ieee: A. Buchwalter and M. Hetzer, “Nuclear pores set the speed limit for mitosis,”
Cell, vol. 156, no. 5. Elsevier, pp. 868–869, 2014.
ista: Buchwalter A, Hetzer M. 2014. Nuclear pores set the speed limit for mitosis.
Cell. 156(5), 868–869.
mla: Buchwalter, Abigail, and Martin Hetzer. “Nuclear Pores Set the Speed Limit
for Mitosis.” Cell, vol. 156, no. 5, Elsevier, 2014, pp. 868–69, doi:10.1016/j.cell.2014.02.004.
short: A. Buchwalter, M. Hetzer, Cell 156 (2014) 868–869.
date_created: 2022-04-07T07:50:04Z
date_published: 2014-02-27T00:00:00Z
date_updated: 2022-07-18T08:44:33Z
day: '27'
doi: 10.1016/j.cell.2014.02.004
extern: '1'
external_id:
pmid:
- '24581486'
intvolume: ' 156'
issue: '5'
keyword:
- General Biochemistry
- Genetics and Molecular Biology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.cell.2014.02.004
month: '02'
oa: 1
oa_version: Published Version
page: 868-869
pmid: 1
publication: Cell
publication_identifier:
issn:
- 0092-8674
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nuclear pores set the speed limit for mitosis
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 156
year: '2014'
...
---
_id: '11082'
abstract:
- lang: eng
text: The nuclear pore complex (NPC) plays a critical role in gene expression by
mediating import of transcription regulators into the nucleus and export of RNA
transcripts to the cytoplasm. Emerging evidence suggests that in addition to mediating
transport, a subset of nucleoporins (Nups) engage in transcriptional activation
and elongation at genomic loci that are not associated with NPCs. The underlying
mechanism and regulation of Nup mobility on and off nuclear pores remain unclear.
Here we show that Nup50 is a mobile Nup with a pronounced presence both at the
NPC and in the nucleoplasm that can move between these different localizations.
Strikingly, the dynamic behavior of Nup50 in both locations is dependent on active
transcription by RNA polymerase II and requires the N-terminal half of the protein,
which contains importin α– and Nup153-binding domains. However, Nup50 dynamics
are independent of importin α, Nup153, and Nup98, even though the latter two proteins
also exhibit transcription-dependent mobility. Of interest, depletion of Nup50
from C2C12 myoblasts does not affect cell proliferation but inhibits differentiation
into myotubes. Taken together, our results suggest a transport-independent role
for Nup50 in chromatin biology that occurs away from the NPC.
article_processing_charge: No
article_type: original
author:
- first_name: Abigail L.
full_name: Buchwalter, Abigail L.
last_name: Buchwalter
- first_name: Yun
full_name: Liang, Yun
last_name: Liang
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: Buchwalter AL, Liang Y, Hetzer M. Nup50 is required for cell differentiation
and exhibits transcription-dependent dynamics. Molecular Biology of the Cell.
2014;25(16):2472-2484. doi:10.1091/mbc.e14-04-0865
apa: Buchwalter, A. L., Liang, Y., & Hetzer, M. (2014). Nup50 is required for
cell differentiation and exhibits transcription-dependent dynamics. Molecular
Biology of the Cell. American Society for Cell Biology. https://doi.org/10.1091/mbc.e14-04-0865
chicago: Buchwalter, Abigail L., Yun Liang, and Martin Hetzer. “Nup50 Is Required
for Cell Differentiation and Exhibits Transcription-Dependent Dynamics.” Molecular
Biology of the Cell. American Society for Cell Biology, 2014. https://doi.org/10.1091/mbc.e14-04-0865.
ieee: A. L. Buchwalter, Y. Liang, and M. Hetzer, “Nup50 is required for cell differentiation
and exhibits transcription-dependent dynamics,” Molecular Biology of the Cell,
vol. 25, no. 16. American Society for Cell Biology, pp. 2472–2484, 2014.
ista: Buchwalter AL, Liang Y, Hetzer M. 2014. Nup50 is required for cell differentiation
and exhibits transcription-dependent dynamics. Molecular Biology of the Cell.
25(16), 2472–2484.
mla: Buchwalter, Abigail L., et al. “Nup50 Is Required for Cell Differentiation
and Exhibits Transcription-Dependent Dynamics.” Molecular Biology of the Cell,
vol. 25, no. 16, American Society for Cell Biology, 2014, pp. 2472–84, doi:10.1091/mbc.e14-04-0865.
short: A.L. Buchwalter, Y. Liang, M. Hetzer, Molecular Biology of the Cell 25 (2014)
2472–2484.
date_created: 2022-04-07T07:50:24Z
date_published: 2014-08-15T00:00:00Z
date_updated: 2022-07-18T08:45:20Z
day: '15'
doi: 10.1091/mbc.e14-04-0865
extern: '1'
intvolume: ' 25'
issue: '16'
keyword:
- Cell Biology
- Molecular Biology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1091/mbc.e14-04-0865
month: '08'
oa: 1
oa_version: Published Version
page: 2472-2484
publication: Molecular Biology of the Cell
publication_identifier:
issn:
- 1059-1524
- 1939-4586
publication_status: published
publisher: American Society for Cell Biology
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nup50 is required for cell differentiation and exhibits transcription-dependent
dynamics
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 25
year: '2014'
...
---
_id: '11081'
abstract:
- lang: eng
text: In eukaryotic cells the nuclear genome is enclosed by the nuclear envelope
(NE). In metazoans, the NE breaks down in mitosis and it has been assumed that
the physical barrier separating nucleoplasm and cytoplasm remains intact during
the rest of the cell cycle and cell differentiation. However, recent studies suggest
that nonmitotic NE remodeling plays a critical role in development, virus infection,
laminopathies, and cancer. Although the mechanisms underlying these NE restructuring
events are currently being defined, one common theme is activation of protein
kinase C family members in the interphase nucleus to disrupt the nuclear lamina,
demonstrating the importance of the lamina in maintaining nuclear integrity.
article_processing_charge: No
article_type: review
author:
- first_name: Emily
full_name: Hatch, Emily
last_name: Hatch
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: Hatch E, Hetzer M. Breaching the nuclear envelope in development and disease.
Journal of Cell Biology. 2014;205(2):133-141. doi:10.1083/jcb.201402003
apa: Hatch, E., & Hetzer, M. (2014). Breaching the nuclear envelope in development
and disease. Journal of Cell Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.201402003
chicago: Hatch, Emily, and Martin Hetzer. “Breaching the Nuclear Envelope in Development
and Disease.” Journal of Cell Biology. Rockefeller University Press, 2014.
https://doi.org/10.1083/jcb.201402003.
ieee: E. Hatch and M. Hetzer, “Breaching the nuclear envelope in development and
disease,” Journal of Cell Biology, vol. 205, no. 2. Rockefeller University
Press, pp. 133–141, 2014.
ista: Hatch E, Hetzer M. 2014. Breaching the nuclear envelope in development and
disease. Journal of Cell Biology. 205(2), 133–141.
mla: Hatch, Emily, and Martin Hetzer. “Breaching the Nuclear Envelope in Development
and Disease.” Journal of Cell Biology, vol. 205, no. 2, Rockefeller University
Press, 2014, pp. 133–41, doi:10.1083/jcb.201402003.
short: E. Hatch, M. Hetzer, Journal of Cell Biology 205 (2014) 133–141.
date_created: 2022-04-07T07:50:13Z
date_published: 2014-04-21T00:00:00Z
date_updated: 2022-07-18T08:45:09Z
day: '21'
doi: 10.1083/jcb.201402003
extern: '1'
external_id:
pmid:
- '24751535'
intvolume: ' 205'
issue: '2'
keyword:
- Cell Biology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1083/jcb.201402003
month: '04'
oa: 1
oa_version: Published Version
page: 133-141
pmid: 1
publication: Journal of Cell Biology
publication_identifier:
issn:
- 1540-8140
- 0021-9525
publication_status: published
publisher: Rockefeller University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Breaching the nuclear envelope in development and disease
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 205
year: '2014'
...
---
_id: '11583'
abstract:
- lang: eng
text: 'Candidate galaxies at redshifts of z ∼ 10 are now being found in extremely
deep surveys, probing very small areas. As a consequence, candidates are very
faint, making spectroscopic confirmation practically impossible. In order to overcome
such limitations, we have undertaken the CF-HiZELS survey, which is a large-area,
medium-depth near-infrared narrow-band survey targeted at z = 8.8 Lyman α (Lyα)
emitters (LAEs) and covering 10 deg2 in part of the SSA22 field with the Canada–France–Hawaii
Telescope (CFHT). We surveyed a comoving volume of 4.7 × 106 Mpc3 to a Lyα luminosity
limit of 6.3 × 1043舁erg舁s−1. We look for Lyα candidates by applying the following
criteria: (i) clear emission-line source, (ii) no optical detections (ugriz from
CFHTLS), (iii) no visible detection in the optical stack (ugriz > 27), (iv) visually
checked reliable NBJ and J detections and (v) J − K ≤ 0. We compute photometric
redshifts and remove a significant amount of dusty lower redshift line-emitters
at z ∼ 1.4 or 2.2. A total of 13 Lyα candidates were found, of which two are marked
as strong candidates, but the majority have very weak constraints on their spectral
energy distributions. Using follow-up observations with SINFONI/VLT, we are able
to exclude the most robust candidates as LAEs. We put a strong constraint on the
Lyα luminosity function at z ∼ 9 and make realistic predictions for ongoing and
future surveys. Our results show that surveys for the highest redshift LAEs are
susceptible of multiple contaminations and that spectroscopic follow-up is absolutely
necessary.'
acknowledgement: We thank the anonymous referee for the comments and suggestions which
improved both the quality and clarity of this work. DS acknowledges financial support
from the Netherlands Organisation for Scientific Research (NWO) through a Veni fellowship.
IRS acknowledges support from STFC (ST/I001573/1), a Leverhulme Fellowship, the
ERC Advanced Investigator programme DUSTYGAL 321334 and a Royal Society/Wolfson
Merit Award. PNB acknowledges support from the Leverhulme Trust. JWK acknowledges
the support from the Creative Research Initiative Program, no. 2008- 0060544, of
the National Research Foundation of Korea (NRF) funded by the Korean government
(MSIP). JPUF and BMJ acknowledge support from the ERC-StG grant EGGS-278202. The
Dark Cosmology Centre is funded by the Danish National Research Foundation. This
work is based in part on data obtained as part of the UKIRT Infrared Deep Sky Survey.
Based on observations obtained with MegaPrime/MegaCam, a joint project of CFHT and
CEA/IRFU, at the Canada–France–Hawaii Telescope (CFHT) which is operated by the
National Research Council (NRC) of Canada, the Institut National des Science de
l’Univers of the Centre National de la Recherche Scientifique (CNRS) of France and
the University of Hawaii. This work is based in part on data products produced at
Terapix available at the Canadian Astronomy Data Centre as part of the Canada-France-Hawaii
Telescope Legacy Survey, a collaborative project of NRC and CNRS. This work was
only possible due to OPTICON/FP7 and the access that it granted to the CFHT telescope.
The authors also wish to acknowledge the CFHTLS and UKIDSS surveys for their excellent
legacy and complementary value – without such high-quality data sets, this research
would not have been possible.
article_processing_charge: No
article_type: original
author:
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: David
full_name: Sobral, David
last_name: Sobral
- first_name: A. M.
full_name: Swinbank, A. M.
last_name: Swinbank
- first_name: Ian
full_name: Smail, Ian
last_name: Smail
- first_name: P. N.
full_name: Best, P. N.
last_name: Best
- first_name: Jae-Woo
full_name: Kim, Jae-Woo
last_name: Kim
- first_name: Marijn
full_name: Franx, Marijn
last_name: Franx
- first_name: Bo
full_name: Milvang-Jensen, Bo
last_name: Milvang-Jensen
- first_name: Johan
full_name: Fynbo, Johan
last_name: Fynbo
citation:
ama: 'Matthee JJ, Sobral D, Swinbank AM, et al. A 10 deg2 Lyman α survey at z=8.8
with spectroscopic follow-up: Strong constraints on the luminosity function and
implications for other surveys. Monthly Notices of the Royal Astronomical Society.
2014;440(3):2375-2387. doi:10.1093/mnras/stu392'
apa: 'Matthee, J. J., Sobral, D., Swinbank, A. M., Smail, I., Best, P. N., Kim,
J.-W., … Fynbo, J. (2014). A 10 deg2 Lyman α survey at z=8.8 with spectroscopic
follow-up: Strong constraints on the luminosity function and implications for
other surveys. Monthly Notices of the Royal Astronomical Society. Oxford
University Press. https://doi.org/10.1093/mnras/stu392'
chicago: 'Matthee, Jorryt J, David Sobral, A. M. Swinbank, Ian Smail, P. N. Best,
Jae-Woo Kim, Marijn Franx, Bo Milvang-Jensen, and Johan Fynbo. “A 10 Deg2 Lyman
α Survey at Z=8.8 with Spectroscopic Follow-up: Strong Constraints on the Luminosity
Function and Implications for Other Surveys.” Monthly Notices of the Royal
Astronomical Society. Oxford University Press, 2014. https://doi.org/10.1093/mnras/stu392.'
ieee: 'J. J. Matthee et al., “A 10 deg2 Lyman α survey at z=8.8 with spectroscopic
follow-up: Strong constraints on the luminosity function and implications for
other surveys,” Monthly Notices of the Royal Astronomical Society, vol.
440, no. 3. Oxford University Press, pp. 2375–2387, 2014.'
ista: 'Matthee JJ, Sobral D, Swinbank AM, Smail I, Best PN, Kim J-W, Franx M, Milvang-Jensen
B, Fynbo J. 2014. A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up:
Strong constraints on the luminosity function and implications for other surveys.
Monthly Notices of the Royal Astronomical Society. 440(3), 2375–2387.'
mla: 'Matthee, Jorryt J., et al. “A 10 Deg2 Lyman α Survey at Z=8.8 with Spectroscopic
Follow-up: Strong Constraints on the Luminosity Function and Implications for
Other Surveys.” Monthly Notices of the Royal Astronomical Society, vol.
440, no. 3, Oxford University Press, 2014, pp. 2375–87, doi:10.1093/mnras/stu392.'
short: J.J. Matthee, D. Sobral, A.M. Swinbank, I. Smail, P.N. Best, J.-W. Kim, M.
Franx, B. Milvang-Jensen, J. Fynbo, Monthly Notices of the Royal Astronomical
Society 440 (2014) 2375–2387.
date_created: 2022-07-14T12:33:24Z
date_published: 2014-05-21T00:00:00Z
date_updated: 2022-08-19T08:30:30Z
day: '21'
doi: 10.1093/mnras/stu392
extern: '1'
external_id:
arxiv:
- '1402.6697'
intvolume: ' 440'
issue: '3'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: evolution'
- 'galaxies: high-redshift'
- 'cosmology: observations'
- dark ages
- reionization
- first stars
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1402.6697
month: '05'
oa: 1
oa_version: Preprint
page: 2375-2387
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints
on the luminosity function and implications for other surveys'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 440
year: '2014'
...
---
_id: '11582'
abstract:
- lang: eng
text: We have observed a sample of typical z ∼ 1 star-forming galaxies, selected
from the HiZELS survey, with the new K-band Multi-Object Spectrograph (KMOS) near-infrared,
multi-integral field unit instrument on the Very Large Telescope (VLT), in order
to obtain their dynamics and metallicity gradients. The majority of our galaxies
have a metallicity gradient consistent with being flat or negative (i.e. higher
metallicity cores than outskirts). Intriguingly, we find a trend between metallicity
gradient and specific star formation rate (sSFR), such that galaxies with a high
sSFR tend to have relatively metal poor centres, a result which is strengthened
when combined with data sets from the literature. This result appears to explain
the discrepancies reported between different high-redshift studies and varying
claims for evolution. From a galaxy evolution perspective, the trend we see would
mean that a galaxy's sSFR is governed by the amount of metal-poor gas that can
be funnelled into its core, triggered either by merging or through efficient accretion.
In fact, merging may play a significant role as it is the starburst galaxies at
all epochs, which have the more positive metallicity gradients. Our results may
help to explain the origin of the fundamental metallicity relation, in which galaxies
at a fixed mass are observed to have lower metallicities at higher star formation
rates, especially if the metallicity is measured in an aperture encompassing only
the central regions of the galaxy. Finally, we note that this study demonstrates
the power of KMOS as an efficient instrument for large-scale resolved galaxy surveys.
acknowledgement: First, we acknowledge the referee for their comments, which have
improved the clarity of this paper. JPS and IRS acknowledge support from STFC (ST/I001573/1).
IRS also acknowledges support from the ERC Advanced Investigator programme DUSTYGAL
and a Royal Society/Wolfson Merit Award. DS acknowledges financial support from
NWO through a Veni fellowship and from FCT through the award of an FCT-IF starting
grant. PNB acknowledges STFC for financial support.
article_processing_charge: No
article_type: original
author:
- first_name: John P.
full_name: Stott, John P.
last_name: Stott
- first_name: David
full_name: Sobral, David
last_name: Sobral
- first_name: A. M.
full_name: Swinbank, A. M.
last_name: Swinbank
- first_name: Ian
full_name: Smail, Ian
last_name: Smail
- first_name: Richard
full_name: Bower, Richard
last_name: Bower
- first_name: Philip N.
full_name: Best, Philip N.
last_name: Best
- first_name: Ray M.
full_name: Sharples, Ray M.
last_name: Sharples
- first_name: James E.
full_name: Geach, James E.
last_name: Geach
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
citation:
ama: Stott JP, Sobral D, Swinbank AM, et al. A relationship between specific star
formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS.
Monthly Notices of the Royal Astronomical Society. 2014;443(3):2695-2704.
doi:10.1093/mnras/stu1343
apa: Stott, J. P., Sobral, D., Swinbank, A. M., Smail, I., Bower, R., Best, P. N.,
… Matthee, J. J. (2014). A relationship between specific star formation rate and
metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. Monthly Notices
of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stu1343
chicago: Stott, John P., David Sobral, A. M. Swinbank, Ian Smail, Richard Bower,
Philip N. Best, Ray M. Sharples, James E. Geach, and Jorryt J Matthee. “A Relationship
between Specific Star Formation Rate and Metallicity Gradient within z ∼ 1 Galaxies
from KMOS-HiZELS.” Monthly Notices of the Royal Astronomical Society. Oxford
University Press, 2014. https://doi.org/10.1093/mnras/stu1343.
ieee: J. P. Stott et al., “A relationship between specific star formation
rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS,” Monthly
Notices of the Royal Astronomical Society, vol. 443, no. 3. Oxford University
Press, pp. 2695–2704, 2014.
ista: Stott JP, Sobral D, Swinbank AM, Smail I, Bower R, Best PN, Sharples RM, Geach
JE, Matthee JJ. 2014. A relationship between specific star formation rate and
metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. Monthly Notices of
the Royal Astronomical Society. 443(3), 2695–2704.
mla: Stott, John P., et al. “A Relationship between Specific Star Formation Rate
and Metallicity Gradient within z ∼ 1 Galaxies from KMOS-HiZELS.” Monthly Notices
of the Royal Astronomical Society, vol. 443, no. 3, Oxford University Press,
2014, pp. 2695–704, doi:10.1093/mnras/stu1343.
short: J.P. Stott, D. Sobral, A.M. Swinbank, I. Smail, R. Bower, P.N. Best, R.M.
Sharples, J.E. Geach, J.J. Matthee, Monthly Notices of the Royal Astronomical
Society 443 (2014) 2695–2704.
date_created: 2022-07-14T12:16:10Z
date_published: 2014-09-21T00:00:00Z
date_updated: 2022-08-19T08:27:25Z
day: '21'
doi: 10.1093/mnras/stu1343
extern: '1'
external_id:
arxiv:
- '1407.1047'
intvolume: ' 443'
issue: '3'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: abundances'
- 'galaxies: evolution'
- 'galaxies: kinematics and dynamics'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1407.1047
month: '09'
oa: 1
oa_version: Preprint
page: 2695-2704
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: A relationship between specific star formation rate and metallicity gradient
within z ∼ 1 galaxies from KMOS-HiZELS
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 443
year: '2014'
...
---
_id: '11750'
abstract:
- lang: eng
text: We report on the magnetic properties of a hot-pressed FeSb 2 sample. We find
a significant increase in the magnetic susceptibility in our sample when compared
with the values previously reported for the polycrystalline sample. The pronounced
Curie tail at low temperature corresponds to 0.2% of Fe 2+ impurities per mole.
In the intrinsic conductivity region, the susceptibility due to free carriers
shows thermally activated behavior and is consistent with the data reported for
single crystal FeSb 2 . Based on our data and analysis, while the enhanced magnetic
susceptibility in our sample comes mainly from a small amount of unreacted Fe,
the contribution from the enhanced carrier density due to lattice and strain defects
arising from the ball milling process is also significant. Existence of an unreacted
Fe phase is evidenced by small coercivity values of ~100 observed at 50 and 300
K.
article_number: '6675864'
article_processing_charge: No
article_type: original
author:
- first_name: Mani
full_name: Pokharel, Mani
last_name: Pokharel
- first_name: Huaizhou
full_name: Zhao, Huaizhou
last_name: Zhao
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: Zhifeng
full_name: Ren, Zhifeng
last_name: Ren
- first_name: Cyril
full_name: Opeil, Cyril
last_name: Opeil
citation:
ama: Pokharel M, Zhao H, Modic KA, Ren Z, Opeil C. Magnetic properties of hot-pressed
FeSb2. IEEE Transactions on Magnetics. 2014;50(5). doi:10.1109/TMAG.2013.2292607
apa: Pokharel, M., Zhao, H., Modic, K. A., Ren, Z., & Opeil, C. (2014). Magnetic
properties of hot-pressed FeSb2. IEEE Transactions on Magnetics. Institute
of Electrical and Electronics Engineers. https://doi.org/10.1109/TMAG.2013.2292607
chicago: Pokharel, Mani, Huaizhou Zhao, Kimberly A Modic, Zhifeng Ren, and Cyril
Opeil. “Magnetic Properties of Hot-Pressed FeSb2.” IEEE Transactions on Magnetics.
Institute of Electrical and Electronics Engineers, 2014. https://doi.org/10.1109/TMAG.2013.2292607.
ieee: M. Pokharel, H. Zhao, K. A. Modic, Z. Ren, and C. Opeil, “Magnetic properties
of hot-pressed FeSb2,” IEEE Transactions on Magnetics, vol. 50, no. 5.
Institute of Electrical and Electronics Engineers, 2014.
ista: Pokharel M, Zhao H, Modic KA, Ren Z, Opeil C. 2014. Magnetic properties of
hot-pressed FeSb2. IEEE Transactions on Magnetics. 50(5), 6675864.
mla: Pokharel, Mani, et al. “Magnetic Properties of Hot-Pressed FeSb2.” IEEE
Transactions on Magnetics, vol. 50, no. 5, 6675864, Institute of Electrical
and Electronics Engineers, 2014, doi:10.1109/TMAG.2013.2292607.
short: M. Pokharel, H. Zhao, K.A. Modic, Z. Ren, C. Opeil, IEEE Transactions on
Magnetics 50 (2014).
date_created: 2022-08-08T08:26:02Z
date_published: 2014-05-01T00:00:00Z
date_updated: 2022-08-11T09:51:22Z
day: '01'
doi: 10.1109/TMAG.2013.2292607
extern: '1'
intvolume: ' 50'
issue: '5'
language:
- iso: eng
month: '05'
oa_version: None
publication: IEEE Transactions on Magnetics
publication_identifier:
eissn:
- 1941-0069
issn:
- 0018-9464
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Magnetic properties of hot-pressed FeSb2
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 50
year: '2014'
...
---
_id: '11789'
abstract:
- lang: eng
text: "We study a weighted online bipartite matching problem: G(V 1, V 2, E) is
a weighted bipartite graph where V 1 is known beforehand and the vertices of V
2 arrive online. The goal is to match vertices of V 2 as they arrive to vertices
in V 1, so as to maximize the sum of weights of edges in the matching. If assignments
to V 1 cannot be changed, no bounded competitive ratio is achievable. We study
the weighted online matching problem with free disposal, where vertices in V 1
can be assigned multiple times, but only get credit for the maximum weight edge
assigned to them over the course of the algorithm. For this problem, the greedy
algorithm is 0.5-competitive and determining whether a better competitive ratio
is achievable is a well known open problem.\r\n\r\nWe identify an interesting
special case where the edge weights are decomposable as the product of two factors,
one corresponding to each end point of the edge. This is analogous to the well
studied related machines model in the scheduling literature, although the objective
functions are different. For this case of decomposable edge weights, we design
a 0.5664 competitive randomized algorithm in complete bipartite graphs. We show
that such instances with decomposable weights are non-trivial by establishing
upper bounds of 0.618 for deterministic and 0.8 for randomized algorithms.\r\n\r\nA
tight competitive ratio of 1 − 1/e ≈ 0.632 was known previously for both the 0-1
case as well as the case where edge weights depend on the offline vertices only,
but for these cases, reassignments cannot change the quality of the solution.
Beating 0.5 for weighted matching where reassignments are necessary has been a
significant challenge. We thus give the first online algorithm with competitive
ratio strictly better than 0.5 for a non-trivial case of weighted matching with
free disposal."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Moses
full_name: Charikar, Moses
last_name: Charikar
- 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: Huy L.
full_name: Nguyễn, Huy L.
last_name: Nguyễn
citation:
ama: 'Charikar M, Henzinger MH, Nguyễn HL. Online bipartite matching with decomposable
weights. In: 22nd Annual European Symposium on Algorithms. Vol 8737. Springer
Nature; 2014:260-271. doi:10.1007/978-3-662-44777-2_22'
apa: 'Charikar, M., Henzinger, M. H., & Nguyễn, H. L. (2014). Online bipartite
matching with decomposable weights. In 22nd Annual European Symposium on Algorithms
(Vol. 8737, pp. 260–271). Wroclaw, Poland: Springer Nature. https://doi.org/10.1007/978-3-662-44777-2_22'
chicago: Charikar, Moses, Monika H Henzinger, and Huy L. Nguyễn. “Online Bipartite
Matching with Decomposable Weights.” In 22nd Annual European Symposium on Algorithms,
8737:260–71. Springer Nature, 2014. https://doi.org/10.1007/978-3-662-44777-2_22.
ieee: M. Charikar, M. H. Henzinger, and H. L. Nguyễn, “Online bipartite matching
with decomposable weights,” in 22nd Annual European Symposium on Algorithms,
Wroclaw, Poland, 2014, vol. 8737, pp. 260–271.
ista: 'Charikar M, Henzinger MH, Nguyễn HL. 2014. Online bipartite matching with
decomposable weights. 22nd Annual European Symposium on Algorithms. ESA: Annual
European Symposium on Algorithms, LNCS, vol. 8737, 260–271.'
mla: Charikar, Moses, et al. “Online Bipartite Matching with Decomposable Weights.”
22nd Annual European Symposium on Algorithms, vol. 8737, Springer Nature,
2014, pp. 260–71, doi:10.1007/978-3-662-44777-2_22.
short: M. Charikar, M.H. Henzinger, H.L. Nguyễn, in:, 22nd Annual European Symposium
on Algorithms, Springer Nature, 2014, pp. 260–271.
conference:
end_date: 2014-09-10
location: Wroclaw, Poland
name: 'ESA: Annual European Symposium on Algorithms'
start_date: 2014-09-08
date_created: 2022-08-11T10:41:47Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2023-02-13T11:16:24Z
day: '01'
doi: 10.1007/978-3-662-44777-2_22
extern: '1'
external_id:
arxiv:
- '1409.2139'
intvolume: ' 8737'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1409.2139
month: '09'
oa: 1
oa_version: Preprint
page: 260 - 271
publication: 22nd Annual European Symposium on Algorithms
publication_identifier:
isbn:
- 978-366244776-5
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Online bipartite matching with decomposable weights
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8737
year: '2014'
...
---
_id: '11790'
abstract:
- lang: eng
text: "Assume a seller wants to sell a digital product in a social network where
a buyer’s valuation of the item has positive network externalities from her neighbors
that already have the item. The goal of the seller is to maximize his revenue.
Previous work on this problem [7] studies the case where clients are offered the
item in sequence and have to pay personalized prices. This is highly infeasible
in large scale networks such as the Facebook graph: (1) Offering items to the
clients one after the other consumes a large amount of time, and (2) price-discrimination
of clients could appear unfair to them and result in negative client reaction
or could conflict with legal requirements.\r\n\r\nWe study a setting dealing with
these issues. Specifically, the item is offered in parallel to multiple clients
at the same time and at the same price. This is called a round. We show that with
O(logn) rounds, where n is the number of clients, a constant factor of the revenue
with price discrimination can be achieved and that this is not possible with o(logn)
rounds. Moreover we show that it is APX-hard to maximize the revenue and we give
constant factor approximation algorithms for various further settings of limited
price discrimination."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Luděk
full_name: Cigler, Luděk
last_name: Cigler
- 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: 'Cigler L, Dvořák W, Henzinger MH, Starnberger M. Limiting price discrimination
when selling products with positive network externalities. In: 10th International
Conference of Web and Internet Economics. Vol 8877. Springer Nature; 2014:44-57.
doi:10.1007/978-3-319-13129-0_4'
apa: 'Cigler, L., Dvořák, W., Henzinger, M. H., & Starnberger, M. (2014). Limiting
price discrimination when selling products with positive network externalities.
In 10th International Conference of Web and Internet Economics (Vol. 8877,
pp. 44–57). Beijing, China: Springer Nature. https://doi.org/10.1007/978-3-319-13129-0_4'
chicago: Cigler, Luděk, Wolfgang Dvořák, Monika H Henzinger, and Martin Starnberger.
“Limiting Price Discrimination When Selling Products with Positive Network Externalities.”
In 10th International Conference of Web and Internet Economics, 8877:44–57.
Springer Nature, 2014. https://doi.org/10.1007/978-3-319-13129-0_4.
ieee: L. Cigler, W. Dvořák, M. H. Henzinger, and M. Starnberger, “Limiting price
discrimination when selling products with positive network externalities,” in
10th International Conference of Web and Internet Economics, Beijing, China,
2014, vol. 8877, pp. 44–57.
ista: 'Cigler L, Dvořák W, Henzinger MH, Starnberger M. 2014. Limiting price discrimination
when selling products with positive network externalities. 10th International
Conference of Web and Internet Economics. WINE: International Conference on Web
and Internet Economics, LNCS, vol. 8877, 44–57.'
mla: Cigler, Luděk, et al. “Limiting Price Discrimination When Selling Products
with Positive Network Externalities.” 10th International Conference of Web
and Internet Economics, vol. 8877, Springer Nature, 2014, pp. 44–57, doi:10.1007/978-3-319-13129-0_4.
short: L. Cigler, W. Dvořák, M.H. Henzinger, M. Starnberger, in:, 10th International
Conference of Web and Internet Economics, Springer Nature, 2014, pp. 44–57.
conference:
end_date: 2014-12-17
location: Beijing, China
name: 'WINE: International Conference on Web and Internet Economics'
start_date: 2014-12-14
date_created: 2022-08-11T10:58:44Z
date_published: 2014-12-01T00:00:00Z
date_updated: 2023-02-13T11:18:30Z
day: '01'
doi: 10.1007/978-3-319-13129-0_4
extern: '1'
intvolume: ' 8877'
language:
- iso: eng
month: '12'
oa_version: None
page: 44 - 57
publication: 10th International Conference of Web and Internet Economics
publication_identifier:
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Limiting price discrimination when selling products with positive network externalities
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8877
year: '2014'
...
---
_id: '118'
abstract:
- lang: eng
text: While the penetration of objects into granular media is well-studied, there
is little understanding of how objects settle in gravities, geff, different from
that of Earth - a scenario potentially relevant to the geomorphology of planets
and asteroids and also to their exploration using man-made devices. By conducting
experiments in an accelerating frame, we explore geff ranging from 0.4 g to 1.2
g. Surprisingly, we find that the rest depth is independent of geff and also that
the time required for the object to come to rest scales like geff-1/2. With discrete
element modeling simulations, we reproduce the experimental results and extend
the range of geff to objects as small as asteroids and as large as Jupiter. Our
results shed light on the initial stage of sedimentation into dry granular media
across a range of celestial bodies and also have implications for the design of
man-made, extraterrestrial vehicles and structures. Key Points The settling depth
in granular media is independent of gravity The settling time scales like g-1/2
Layering driven by granular sedimentation should be similar.
acknowledgement: 'The Spanish MINECO project FIS2011-26675, the PIUNA program (U.
Navarra), and the Project 29942WL (Fonds de Solidarité Prioritaire France-Cuba)
have partially supported this research. '
author:
- first_name: Ernesto
full_name: Altshuler, Ernesto
last_name: Altshuler
- first_name: H
full_name: Torres, H
last_name: Torres
- first_name: A
full_name: González_Pita, A
last_name: González_Pita
- first_name: Colina G
full_name: Sánchez, Colina G
last_name: Sánchez
- first_name: Carlos
full_name: Pérez Penichet, Carlos
last_name: Pérez Penichet
- 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: Rauól
full_name: Hidalgo, Rauól
last_name: Hidalgo
citation:
ama: Altshuler E, Torres H, González_Pita A, et al. Settling into dry granular media
in different gravities. Geophysical Research Letters. 2014;41(9):3032-3037.
doi:10.1002/2014GL059229
apa: Altshuler, E., Torres, H., González_Pita, A., Sánchez, C. G., Pérez Penichet,
C., Waitukaitis, S. R., & Hidalgo, R. (2014). Settling into dry granular media
in different gravities. Geophysical Research Letters. Wiley-Blackwell.
https://doi.org/10.1002/2014GL059229
chicago: Altshuler, Ernesto, H Torres, A González_Pita, Colina G Sánchez, Carlos
Pérez Penichet, Scott R Waitukaitis, and Rauól Hidalgo. “Settling into Dry Granular
Media in Different Gravities.” Geophysical Research Letters. Wiley-Blackwell,
2014. https://doi.org/10.1002/2014GL059229.
ieee: E. Altshuler et al., “Settling into dry granular media in different
gravities,” Geophysical Research Letters, vol. 41, no. 9. Wiley-Blackwell,
pp. 3032–3037, 2014.
ista: Altshuler E, Torres H, González_Pita A, Sánchez CG, Pérez Penichet C, Waitukaitis
SR, Hidalgo R. 2014. Settling into dry granular media in different gravities.
Geophysical Research Letters. 41(9), 3032–3037.
mla: Altshuler, Ernesto, et al. “Settling into Dry Granular Media in Different Gravities.”
Geophysical Research Letters, vol. 41, no. 9, Wiley-Blackwell, 2014, pp.
3032–37, doi:10.1002/2014GL059229.
short: E. Altshuler, H. Torres, A. González_Pita, C.G. Sánchez, C. Pérez Penichet,
S.R. Waitukaitis, R. Hidalgo, Geophysical Research Letters 41 (2014) 3032–3037.
date_created: 2018-12-11T11:44:43Z
date_published: 2014-05-16T00:00:00Z
date_updated: 2021-01-12T06:48:53Z
day: '16'
doi: 10.1002/2014GL059229
extern: '1'
intvolume: ' 41'
issue: '9'
language:
- iso: eng
month: '05'
oa_version: None
page: 3032 - 3037
publication: Geophysical Research Letters
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7936'
quality_controlled: '1'
status: public
title: Settling into dry granular media in different gravities
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 41
year: '2014'
...
---
_id: '11855'
abstract:
- lang: eng
text: 'The decremental single-source shortest paths (SSSP) problem concerns maintaining
the distances between a given source node s to every node in an n-node m-edge
graph G undergoing edge deletions. While its static counterpart can be easily
solved in near-linear time, this decremental problem is much more challenging
even in the undirected unweighted case. In this case, the classic O(mn) total
update time of Even and Shiloach (JACM 1981) has been the fastest known algorithm
for three decades. With the loss of a (1 + ε)-approximation factor, the running
time was recently improved to O(n 2+o(1) ) by Bernstein and Roditty (SODA 2011),
and more recently to O(n 1.8+o(1) + m 1+o(1) ) by Henzinger, Krinninger, and Nanongkai
(SODA 2014). In this paper, we finally bring the running time of this case down
to near-linear: We give a (1 + ε)-approximation algorithm with O(m 1+o(1) ) total
update time, thus obtaining near-linear time. Moreover, we obtain O(m 1+o(1) log
W) time for the weighted case, where the edge weights are integers from 1 to W.
The only prior work on weighted graphs in o(mn log W) time is the O(mn 0.986 log
W)-time algorithm by Henzinger, Krinninger, and Nanongkai (STOC 2014) which works
for the general weighted directed case. In contrast to the previous results which
rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called
sparse (d, ε)-hop set introduced by Cohen (JACM 2000) in the PRAM literature.
A (d, ε)-hop set of a graph G = (V, E) is a set E'' of weighted edges such that
the distance between any pair of nodes in G can be (1 + ε)-approximated by their
d-hop distance (given by a path containing at most d edges) on G''=(V, E∪E'').
Our algorithm can maintain an (n o(1) , ε)-hop set of near-linear size in near-linear
time under edge deletions. It is the first of its kind to the best of our knowledge.
To maintain the distances on this hop set, we develop a monotone bounded-hop Even-Shiloach
tree. It results from extending and combining the monotone Even-Shiloach tree
of Henzinger, Krinninger, and Nanongkai (FOCS 2013) with the bounded-hop SSSP
technique of Bernstein (STOC 2013). These two new tools might 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: 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. Decremental single-source shortest
paths on undirected graphs in near-linear total update time. In: 55th Annual
Symposium on Foundations of Computer Science. Institute of Electrical and
Electronics Engineers; 2014:146-155. doi:10.1109/focs.2014.24'
apa: 'Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). Decremental
single-source shortest paths on undirected graphs in near-linear total update
time. In 55th Annual Symposium on Foundations of Computer Science (pp.
146–155). Philadelphia, PA, United States: Institute of Electrical and Electronics
Engineers. https://doi.org/10.1109/focs.2014.24'
chicago: Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Decremental
Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update
Time.” In 55th Annual Symposium on Foundations of Computer Science, 146–55.
Institute of Electrical and Electronics Engineers, 2014. https://doi.org/10.1109/focs.2014.24.
ieee: M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source
shortest paths on undirected graphs in near-linear total update time,” in 55th
Annual Symposium on Foundations of Computer Science, Philadelphia, PA, United
States, 2014, pp. 146–155.
ista: 'Henzinger MH, Krinninger S, Nanongkai D. 2014. Decremental single-source
shortest paths on undirected graphs in near-linear total update time. 55th Annual
Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations
of Computer Science, 146–155.'
mla: Henzinger, Monika H., et al. “Decremental Single-Source Shortest Paths on Undirected
Graphs in near-Linear Total Update Time.” 55th Annual Symposium on Foundations
of Computer Science, Institute of Electrical and Electronics Engineers, 2014,
pp. 146–55, doi:10.1109/focs.2014.24.
short: M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 55th Annual Symposium on
Foundations of Computer Science, Institute of Electrical and Electronics Engineers,
2014, pp. 146–155.
conference:
end_date: 2014-10-21
location: Philadelphia, PA, United States
name: 'FOCS: Annual Symposium on Foundations of Computer Science'
start_date: 2014-10-18
date_created: 2022-08-16T08:14:33Z
date_published: 2014-10-01T00:00:00Z
date_updated: 2023-02-21T16:27:34Z
day: '01'
doi: 10.1109/focs.2014.24
extern: '1'
external_id:
arxiv:
- '1402.0054'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1402.0054
month: '10'
oa: 1
oa_version: Preprint
page: 146-155
publication: 55th Annual Symposium on Foundations of Computer Science
publication_identifier:
eisbn:
- 978-1-4799-6517-5
issn:
- 0272-5428
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
related_material:
record:
- id: '11768'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Decremental single-source shortest paths on undirected graphs in near-linear
total update time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '11870'
abstract:
- lang: eng
text: "We consider dynamic algorithms for maintaining Single-Source Reachability
(SSR) and approximate Single-Source Shortest Paths (SSSP) on n-node m-edge directed
graphs under edge deletions (decremental algorithms). The previous fastest algorithm
for SSR and SSSP goes back three decades to Even and Shiloach (JACM 1981); it
has O(1) query time and O(mn) total update time (i.e., linear amortized update
time if all edges are deleted). This algorithm serves as a building block for
several other dynamic algorithms. The question whether its total update time can
be improved is a major, long standing, open problem.\r\n\r\nIn this paper, we
answer this question affirmatively. We obtain a randomized algorithm which, in
a simplified form, achieves an Õ(mn0.984) expected total update time for SSR and
(1 + ε)-approximate SSSP, where Õ(·) hides poly log n. We also extend our algorithm
to achieve roughly the same running time for Strongly Connected Components (SCC),
improving the algorithm of Roditty and Zwick (FOCS 2002), and an algorithm that
improves the Õ (mn log W)-time algorithm of Bernstein (STOC 2013) for approximating
SSSP on weighted directed graphs, where the edge weights are integers from 1 to
W. All our algorithms have constant query time in the worst case."
article_number: 674 - 683
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. Sublinear-time decremental algorithms
for single-source reachability and shortest paths on directed graphs. In: 46th
Annual ACM Symposium on Theory of Computing. Association for Computing Machinery;
2014. doi:10.1145/2591796.2591869'
apa: 'Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). Sublinear-time
decremental algorithms for single-source reachability and shortest paths on directed
graphs. In 46th Annual ACM Symposium on Theory of Computing. New York,
NY, United States: Association for Computing Machinery. https://doi.org/10.1145/2591796.2591869'
chicago: Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time
Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed
Graphs.” In 46th Annual ACM Symposium on Theory of Computing. Association
for Computing Machinery, 2014. https://doi.org/10.1145/2591796.2591869.
ieee: M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time decremental
algorithms for single-source reachability and shortest paths on directed graphs,”
in 46th Annual ACM Symposium on Theory of Computing, New York, NY, United
States, 2014.
ista: 'Henzinger MH, Krinninger S, Nanongkai D. 2014. Sublinear-time decremental
algorithms for single-source reachability and shortest paths on directed graphs.
46th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of
Computing, 674–683.'
mla: Henzinger, Monika H., et al. “Sublinear-Time Decremental Algorithms for Single-Source
Reachability and Shortest Paths on Directed Graphs.” 46th Annual ACM Symposium
on Theory of Computing, 674–683, Association for Computing Machinery, 2014,
doi:10.1145/2591796.2591869.
short: M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 46th Annual ACM Symposium
on Theory of Computing, Association for Computing Machinery, 2014.
conference:
end_date: 2014-06-03
location: New York, NY, United States
name: 'STOC: Symposium on Theory of Computing'
start_date: 2014-05-31
date_created: 2022-08-16T09:41:57Z
date_published: 2014-05-01T00:00:00Z
date_updated: 2023-02-17T11:18:52Z
day: '01'
doi: 10.1145/2591796.2591869
extern: '1'
external_id:
arxiv:
- '1504.07959'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.07959
month: '05'
oa: 1
oa_version: Preprint
publication: 46th Annual ACM Symposium on Theory of Computing
publication_identifier:
isbn:
- 978-145032710-7
issn:
- 0737-8017
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sublinear-time decremental algorithms for single-source reachability and shortest
paths on directed graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '11876'
abstract:
- lang: eng
text: "We study dynamic (1 + ∊)-approximation algorithms for the single-source shortest
paths problem in an unweighted undirected n-node m-edge graph under edge deletions.
The fastest algorithm for this problem is an algorithm with O(n2+o(1)) total update
time and constant query time by Bernstein and Roditty (SODA 2011). In this paper,
we improve the total update time to O(n1.8+o(1) + m1+o(1)) while keeping the query
time constant. This running time is essentially tight when m = Ω(n1.8) since we
need Ω(m) time even in the static setting. For smaller values of m, the running
time of our algorithm is subquadratic, and is the first that breaks through the
quadratic time barrier.\r\n\r\nIn obtaining this result, we develop a fast algorithm
for what we call center cover data structure. We also make non-trivial extensions
to our previous techniques called lazy-update and monotone Even-Shiloach trees
(ICALP 2013 and FOCS 2013). As by-products of our new techniques, we obtain two
new results for the decremental all-pairs shortest-paths problem. Our first result
is the first approximation algorithm whose total update time is faster than Õ(mn)
for all values of m. Our second result is a new trade-off between the total update
time and the additive approximation guarantee."
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. A subquadratic-time algorithm for
decremental single-source shortest paths. In: 25th Annual ACM-SIAM Symposium
on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2014:1053-1072.
doi:10.1137/1.9781611973402.79'
apa: 'Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). A subquadratic-time
algorithm for decremental single-source shortest paths. In 25th Annual ACM-SIAM
Symposium on Discrete Algorithms (pp. 1053–1072). Portland, OR, United States:
Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973402.79'
chicago: Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “A Subquadratic-Time
Algorithm for Decremental Single-Source Shortest Paths.” In 25th Annual ACM-SIAM
Symposium on Discrete Algorithms, 1053–72. Society for Industrial and Applied
Mathematics, 2014. https://doi.org/10.1137/1.9781611973402.79.
ieee: M. H. Henzinger, S. Krinninger, and D. Nanongkai, “A subquadratic-time algorithm
for decremental single-source shortest paths,” in 25th Annual ACM-SIAM Symposium
on Discrete Algorithms, Portland, OR, United States, 2014, pp. 1053–1072.
ista: 'Henzinger MH, Krinninger S, Nanongkai D. 2014. A subquadratic-time algorithm
for decremental single-source shortest paths. 25th Annual ACM-SIAM Symposium on
Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1053–1072.'
mla: Henzinger, Monika H., et al. “A Subquadratic-Time Algorithm for Decremental
Single-Source Shortest Paths.” 25th Annual ACM-SIAM Symposium on Discrete Algorithms,
Society for Industrial and Applied Mathematics, 2014, pp. 1053–72, doi:10.1137/1.9781611973402.79.
short: M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 25th Annual ACM-SIAM Symposium
on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014,
pp. 1053–1072.
conference:
end_date: 2014-01-07
location: Portland, OR, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2014-01-05
date_created: 2022-08-16T12:58:31Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-17T11:58:42Z
day: '01'
doi: 10.1137/1.9781611973402.79
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1137/1.9781611973402.79
month: '01'
oa: 1
oa_version: Published Version
page: 1053-1072
publication: 25th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- 978-1-61197-340-2
isbn:
- 978-1-61197-338-9
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: A subquadratic-time algorithm for decremental single-source shortest paths
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '11875'
abstract:
- lang: eng
text: We present the first deterministic data structures for maintaining approximate
minimum vertex cover and maximum matching in a fully dynamic graph in time per
update. In particular, for minimum vertex cover we provide deterministic data
structures for maintaining a (2 + ε) approximation in O(log n/ε2) amortized time
per update. For maximum matching, we show how to maintain a (3 + e) approximation
in O(m1/3/ε2) amortized time per update, and a (4 + ε) approximation in O(m1/3/ε2)
worst-case time per update. Our data structure for fully dynamic minimum vertex
cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld
[13].
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. Deterministic fully dynamic data
structures for vertex cover and matching. In: 26th Annual ACM-SIAM Symposium
on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2014:785-804.
doi:10.1137/1.9781611973730.54'
apa: 'Bhattacharya, S., Henzinger, M. H., & Italiano, G. F. (2014). Deterministic
fully dynamic data structures for vertex cover and matching. In 26th Annual
ACM-SIAM Symposium on Discrete Algorithms (pp. 785–804). San Diego, CA, United
States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973730.54'
chicago: Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Deterministic
Fully Dynamic Data Structures for Vertex Cover and Matching.” In 26th Annual
ACM-SIAM Symposium on Discrete Algorithms, 785–804. Society for Industrial
and Applied Mathematics, 2014. https://doi.org/10.1137/1.9781611973730.54.
ieee: S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully
dynamic data structures for vertex cover and matching,” in 26th Annual ACM-SIAM
Symposium on Discrete Algorithms, San Diego, CA, United States, 2014, pp.
785–804.
ista: 'Bhattacharya S, Henzinger MH, Italiano GF. 2014. Deterministic fully dynamic
data structures for vertex cover and matching. 26th Annual ACM-SIAM Symposium
on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 785–804.'
mla: Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for
Vertex Cover and Matching.” 26th Annual ACM-SIAM Symposium on Discrete Algorithms,
Society for Industrial and Applied Mathematics, 2014, pp. 785–804, doi:10.1137/1.9781611973730.54.
short: S. Bhattacharya, M.H. Henzinger, G.F. Italiano, in:, 26th Annual ACM-SIAM
Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics,
2014, pp. 785–804.
conference:
end_date: 2015-01-06
location: San Diego, CA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2015-01-04
date_created: 2022-08-16T12:36:42Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-21T16:32:06Z
day: '01'
doi: 10.1137/1.9781611973730.54
extern: '1'
external_id:
arxiv:
- '1412.1318'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1412.1318
month: '01'
oa: 1
oa_version: Preprint
page: 785-804
publication: 26th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- 978-1-61197-373-0
isbn:
- 978-1-61197-374-7
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '11890'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Deterministic fully dynamic data structures for vertex cover and matching
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '119'
abstract:
- lang: eng
text: Observations of flowing granular matter have suggested that same-material
tribocharging depends on particle size, typically rendering large grains positive
and small ones negative. Models assuming the transfer of trapped electrons can
account for this trend, but have not been validated. Tracking individual grains
in an electric field, we show quantitatively that charge is transferred based
on size between materially identical grains. However, the surface density of trapped
electrons, measured independently by thermoluminescence techniques, is orders
of magnitude too small to account for the scale of charge transferred. This reveals
that trapped electrons are not a necessary ingredient for same-material tribocharging.
acknowledgement: This work was supported by the NSF through DMR-1309611. Access to
the shared experimental facilities provided by the NSF-supported Chicago MRSEC (DMR-0820054)
is gratefully acknowledged. S. L. F. and J. L. P. acknowledge funding from UIC NSF
Grants No. 0850830 and No. 0602308. S. R. W. acknowledges support from a University
of Chicago Millikan Fellowship and from Mrs. Joan Winstein through the Winstein
Prize for Instrumentation.
article_number: '218001'
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: Victor
full_name: Lee, Victor
last_name: Lee
- first_name: James
full_name: Pierson, James
last_name: Pierson
- first_name: Steven
full_name: Forman, Steven
last_name: Forman
- first_name: Heinrich
full_name: Jaeger, Heinrich
last_name: Jaeger
citation:
ama: Waitukaitis SR, Lee V, Pierson J, Forman S, Jaeger H. Size-dependent same-material
tribocharging in insulating grains. APS Physics, Physical Review Letters.
2014;112(21). doi:10.1103/PhysRevLett.112.218001
apa: Waitukaitis, S. R., Lee, V., Pierson, J., Forman, S., & Jaeger, H. (2014).
Size-dependent same-material tribocharging in insulating grains. APS Physics,
Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.112.218001
chicago: Waitukaitis, Scott R, Victor Lee, James Pierson, Steven Forman, and Heinrich
Jaeger. “Size-Dependent Same-Material Tribocharging in Insulating Grains.” APS
Physics, Physical Review Letters. American Physical Society, 2014. https://doi.org/10.1103/PhysRevLett.112.218001.
ieee: S. R. Waitukaitis, V. Lee, J. Pierson, S. Forman, and H. Jaeger, “Size-dependent
same-material tribocharging in insulating grains,” APS Physics, Physical Review
Letters, vol. 112, no. 21. American Physical Society, 2014.
ista: Waitukaitis SR, Lee V, Pierson J, Forman S, Jaeger H. 2014. Size-dependent
same-material tribocharging in insulating grains. APS Physics, Physical Review
Letters. 112(21), 218001.
mla: Waitukaitis, Scott R., et al. “Size-Dependent Same-Material Tribocharging in
Insulating Grains.” APS Physics, Physical Review Letters, vol. 112, no.
21, 218001, American Physical Society, 2014, doi:10.1103/PhysRevLett.112.218001.
short: S.R. Waitukaitis, V. Lee, J. Pierson, S. Forman, H. Jaeger, APS Physics,
Physical Review Letters 112 (2014).
date_created: 2018-12-11T11:44:44Z
date_published: 2014-05-30T00:00:00Z
date_updated: 2021-01-12T06:48:58Z
day: '30'
doi: 10.1103/PhysRevLett.112.218001
extern: '1'
external_id:
arxiv:
- '1309.2578'
intvolume: ' 112'
issue: '21'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1309.2578
month: '05'
oa: 1
oa_version: Submitted Version
publication: APS Physics, Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '7935'
quality_controlled: '1'
status: public
title: Size-dependent same-material tribocharging in insulating grains
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2014'
...
---
_id: '11968'
abstract:
- lang: eng
text: 'Membrane phospholipids typically contain fatty acids (FAs) of 16 and 18 carbon
atoms. This particular chain length is evolutionarily highly conserved and presumably
provides maximum stability and dynamic properties to biological membranes in response
to nutritional or environmental cues. Here, we show that the relative proportion
of C16 versus C18 FAs is regulated by the activity of acetyl-CoA carboxylase (Acc1),
the first and rate-limiting enzyme of FA de novo synthesis. Acc1 activity is attenuated
by AMPK/Snf1-dependent phosphorylation, which is required to maintain an appropriate
acyl-chain length distribution. Moreover, we find that the transcriptional repressor
Opi1 preferentially binds to C16 over C18 phosphatidic acid (PA) species: thus,
C16-chain containing PA sequesters Opi1 more effectively to the ER, enabling AMPK/Snf1
control of PA acyl-chain length to determine the degree of derepression of Opi1
target genes. These findings reveal an unexpected regulatory link between the
major energy-sensing kinase, membrane lipid composition, and transcription.'
article_processing_charge: No
article_type: original
author:
- first_name: Harald F.
full_name: Hofbauer, Harald F.
last_name: Hofbauer
- first_name: Florian H.
full_name: Schopf, Florian H.
last_name: Schopf
- first_name: Hannes
full_name: Schleifer, Hannes
last_name: Schleifer
- first_name: Oskar L.
full_name: Knittelfelder, Oskar L.
last_name: Knittelfelder
- 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: Gerald N.
full_name: Rechberger, Gerald N.
last_name: Rechberger
- first_name: Heimo
full_name: Wolinski, Heimo
last_name: Wolinski
- first_name: Maria L.
full_name: Gaspar, Maria L.
last_name: Gaspar
- first_name: C. Oliver
full_name: Kappe, C. Oliver
last_name: Kappe
- first_name: Johannes
full_name: Stadlmann, Johannes
last_name: Stadlmann
- first_name: Karl
full_name: Mechtler, Karl
last_name: Mechtler
- first_name: Alexandra
full_name: Zenz, Alexandra
last_name: Zenz
- first_name: Karl
full_name: Lohner, Karl
last_name: Lohner
- first_name: Oksana
full_name: Tehlivets, Oksana
last_name: Tehlivets
- first_name: Susan A.
full_name: Henry, Susan A.
last_name: Henry
- first_name: Sepp D.
full_name: Kohlwein, Sepp D.
last_name: Kohlwein
citation:
ama: Hofbauer HF, Schopf FH, Schleifer H, et al. Regulation of gene expression through
a transcriptional repressor that senses acyl-chain length in membrane phospholipids.
Developmental Cell. 2014;29(6):P729-739. doi:10.1016/j.devcel.2014.04.025
apa: Hofbauer, H. F., Schopf, F. H., Schleifer, H., Knittelfelder, O. L., Pieber,
B., Rechberger, G. N., … Kohlwein, S. D. (2014). Regulation of gene expression
through a transcriptional repressor that senses acyl-chain length in membrane
phospholipids. Developmental Cell. Elsevier. https://doi.org/10.1016/j.devcel.2014.04.025
chicago: Hofbauer, Harald F., Florian H. Schopf, Hannes Schleifer, Oskar L. Knittelfelder,
Bartholomäus Pieber, Gerald N. Rechberger, Heimo Wolinski, et al. “Regulation
of Gene Expression through a Transcriptional Repressor That Senses Acyl-Chain
Length in Membrane Phospholipids.” Developmental Cell. Elsevier, 2014.
https://doi.org/10.1016/j.devcel.2014.04.025.
ieee: H. F. Hofbauer et al., “Regulation of gene expression through a transcriptional
repressor that senses acyl-chain length in membrane phospholipids,” Developmental
Cell, vol. 29, no. 6. Elsevier, pp. P729-739, 2014.
ista: Hofbauer HF, Schopf FH, Schleifer H, Knittelfelder OL, Pieber B, Rechberger
GN, Wolinski H, Gaspar ML, Kappe CO, Stadlmann J, Mechtler K, Zenz A, Lohner K,
Tehlivets O, Henry SA, Kohlwein SD. 2014. Regulation of gene expression through
a transcriptional repressor that senses acyl-chain length in membrane phospholipids.
Developmental Cell. 29(6), P729-739.
mla: Hofbauer, Harald F., et al. “Regulation of Gene Expression through a Transcriptional
Repressor That Senses Acyl-Chain Length in Membrane Phospholipids.” Developmental
Cell, vol. 29, no. 6, Elsevier, 2014, pp. P729-739, doi:10.1016/j.devcel.2014.04.025.
short: H.F. Hofbauer, F.H. Schopf, H. Schleifer, O.L. Knittelfelder, B. Pieber,
G.N. Rechberger, H. Wolinski, M.L. Gaspar, C.O. Kappe, J. Stadlmann, K. Mechtler,
A. Zenz, K. Lohner, O. Tehlivets, S.A. Henry, S.D. Kohlwein, Developmental Cell
29 (2014) P729-739.
date_created: 2022-08-25T08:42:42Z
date_published: 2014-06-23T00:00:00Z
date_updated: 2023-02-21T10:09:45Z
day: '23'
doi: 10.1016/j.devcel.2014.04.025
extern: '1'
external_id:
pmid:
- '24960695'
intvolume: ' 29'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.devcel.2014.04.025
month: '06'
oa: 1
oa_version: Published Version
page: P729-739
pmid: 1
publication: Developmental Cell
publication_identifier:
eissn:
- 1878-1551
issn:
- 1534-5807
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Regulation of gene expression through a transcriptional repressor that senses
acyl-chain length in membrane phospholipids
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2014'
...
---
_id: '11967'
abstract:
- lang: eng
text: An experimentally easy to perform method for the generation of alumina-supported
Fe3O4 nanoparticles [(6±1) nm size, 0.67 wt %]and the use of this material in
hydrazine-mediated heterogeneously catalyzed reductions of nitroarenes to anilines
under batch and continuous-flow conditions is presented. The bench-stable, reusable
nano-Fe3O4@Al2O3 catalyst can selectively reduce functionalized nitroarenes at
1 mol % catalyst loading by using a 20 mol % excess of hydrazine hydrate in an
elevated temperature regime (150 °C, reaction time 2–6 min in batch). For continuous-flow
processing, the catalyst material is packed into dedicated cartridges and used
in a commercially available high-temperature/-pressure flow device. In continuous
mode, reaction times can be reduced to less than 1 min at 150 °C (30 bar back
pressure) in a highly intensified process. The nano-Fe3O4@Al2O3 catalyst demonstrated
stable reduction of nitrobenzene (0.5 M in MeOH) for more than 10 h on stream
at a productivity of 30 mmol h−1 (0.72 mol per day). Importantly, virtually no
leaching of the catalytically active material could be observed by inductively
coupled plasma MS monitoring.
article_processing_charge: No
article_type: original
author:
- first_name: Mojtaba Mirhosseini
full_name: Moghaddam, Mojtaba Mirhosseini
last_name: Moghaddam
- 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: Moghaddam MM, Pieber B, Glasnov T, Kappe CO. Immobilized iron oxide nanoparticles
as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous
flow. ChemSusChem. 2014;7(11):3122-3131. doi:10.1002/cssc.201402455
apa: Moghaddam, M. M., Pieber, B., Glasnov, T., & Kappe, C. O. (2014). Immobilized
iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated
nitro reductions in continuous flow. ChemSusChem. Wiley. https://doi.org/10.1002/cssc.201402455
chicago: Moghaddam, Mojtaba Mirhosseini, Bartholomäus Pieber, Toma Glasnov, and
C. Oliver Kappe. “Immobilized Iron Oxide Nanoparticles as Stable and Reusable
Catalysts for Hydrazine-Mediated Nitro Reductions in Continuous Flow.” ChemSusChem.
Wiley, 2014. https://doi.org/10.1002/cssc.201402455.
ieee: M. M. Moghaddam, B. Pieber, T. Glasnov, and C. O. Kappe, “Immobilized iron
oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro
reductions in continuous flow,” ChemSusChem, vol. 7, no. 11. Wiley, pp.
3122–3131, 2014.
ista: Moghaddam MM, Pieber B, Glasnov T, Kappe CO. 2014. Immobilized iron oxide
nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions
in continuous flow. ChemSusChem. 7(11), 3122–3131.
mla: Moghaddam, Mojtaba Mirhosseini, et al. “Immobilized Iron Oxide Nanoparticles
as Stable and Reusable Catalysts for Hydrazine-Mediated Nitro Reductions in Continuous
Flow.” ChemSusChem, vol. 7, no. 11, Wiley, 2014, pp. 3122–31, doi:10.1002/cssc.201402455.
short: M.M. Moghaddam, B. Pieber, T. Glasnov, C.O. Kappe, ChemSusChem 7 (2014) 3122–3131.
date_created: 2022-08-25T08:36:54Z
date_published: 2014-11-01T00:00:00Z
date_updated: 2023-02-21T10:09:42Z
day: '01'
doi: 10.1002/cssc.201402455
extern: '1'
external_id:
pmid:
- '25209099'
intvolume: ' 7'
issue: '11'
language:
- iso: eng
month: '11'
oa_version: None
page: 3122-3131
pmid: 1
publication: ChemSusChem
publication_identifier:
eissn:
- 1864-564X
issn:
- 1864-5631
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated
nitro reductions in continuous flow
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2014'
...
---
_id: '11987'
abstract:
- lang: eng
text: A method for the direct lithiation of terminal alkynes and heterocycles with
subsequent carboxylation in a continuous flow format was developed. This method
provides carboxylic acids at ambient conditions within less than five seconds
with only little excess of the organometallic base and CO2.
article_number: '13430'
article_processing_charge: No
article_type: letter_note
author:
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
- first_name: Toma
full_name: Glasnov, Toma
last_name: Glasnov
- first_name: C. O.
full_name: Kappe, C. O.
last_name: Kappe
citation:
ama: 'Pieber B, Glasnov T, Kappe CO. Flash carboxylation: Fast lithiation–carboxylation
sequence at room temperature in continuous flow. RSC Advances. 2014;4(26).
doi:10.1039/c4ra01442a'
apa: 'Pieber, B., Glasnov, T., & Kappe, C. O. (2014). Flash carboxylation: Fast
lithiation–carboxylation sequence at room temperature in continuous flow. RSC
Advances. Royal Society of Chemistry. https://doi.org/10.1039/c4ra01442a'
chicago: 'Pieber, Bartholomäus, Toma Glasnov, and C. O. Kappe. “Flash Carboxylation:
Fast Lithiation–Carboxylation Sequence at Room Temperature in Continuous Flow.”
RSC Advances. Royal Society of Chemistry, 2014. https://doi.org/10.1039/c4ra01442a.'
ieee: 'B. Pieber, T. Glasnov, and C. O. Kappe, “Flash carboxylation: Fast lithiation–carboxylation
sequence at room temperature in continuous flow,” RSC Advances, vol. 4,
no. 26. Royal Society of Chemistry, 2014.'
ista: 'Pieber B, Glasnov T, Kappe CO. 2014. Flash carboxylation: Fast lithiation–carboxylation
sequence at room temperature in continuous flow. RSC Advances. 4(26), 13430.'
mla: 'Pieber, Bartholomäus, et al. “Flash Carboxylation: Fast Lithiation–Carboxylation
Sequence at Room Temperature in Continuous Flow.” RSC Advances, vol. 4,
no. 26, 13430, Royal Society of Chemistry, 2014, doi:10.1039/c4ra01442a.'
short: B. Pieber, T. Glasnov, C.O. Kappe, RSC Advances 4 (2014).
date_created: 2022-08-25T11:48:19Z
date_published: 2014-03-03T00:00:00Z
date_updated: 2023-02-21T10:10:31Z
day: '03'
doi: 10.1039/c4ra01442a
extern: '1'
intvolume: ' 4'
issue: '26'
language:
- iso: eng
month: '03'
oa_version: None
publication: RSC Advances
publication_identifier:
eissn:
- 2046-2069
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature
in continuous flow'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2014'
...
---
_id: '1309'
abstract:
- lang: eng
text: We show that weak solutions of the Derrida-Lebowitz-Speer-Spohn (DLSS) equation
display infinite speed of support propagation. We apply our method to the case
of the quantum drift-diffusion equation which augments the DLSS equation with
a drift term and possibly a second-order diffusion term. The proof is accomplished
using weighted entropy estimates, Hardy's inequality and a family of singular
weight functions to derive a differential inequality; the differential inequality
shows exponential growth of the weighted entropy, with the growth constant blowing
up very fast as the singularity of the weight becomes sharper. To the best of
our knowledge, this is the first example of a nonnegativity-preserving higher-order
parabolic equation displaying infinite speed of support propagation.
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. Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn
equation and quantum drift-diffusion models. Nonlinear Differential Equations
and Applications. 2014;21(1):27-50. doi:10.1007/s00030-013-0235-0
apa: Fischer, J. L. (2014). Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn
equation and quantum drift-diffusion models. Nonlinear Differential Equations
and Applications. Birkhäuser. https://doi.org/10.1007/s00030-013-0235-0
chicago: Fischer, Julian L. “Infinite Speed of Support Propagation for the Derrida-Lebowitz-Speer-Spohn
Equation and Quantum Drift-Diffusion Models.” Nonlinear Differential Equations
and Applications. Birkhäuser, 2014. https://doi.org/10.1007/s00030-013-0235-0.
ieee: J. L. Fischer, “Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn
equation and quantum drift-diffusion models,” Nonlinear Differential Equations
and Applications, vol. 21, no. 1. Birkhäuser, pp. 27–50, 2014.
ista: Fischer JL. 2014. Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn
equation and quantum drift-diffusion models. Nonlinear Differential Equations
and Applications. 21(1), 27–50.
mla: Fischer, Julian L. “Infinite Speed of Support Propagation for the Derrida-Lebowitz-Speer-Spohn
Equation and Quantum Drift-Diffusion Models.” Nonlinear Differential Equations
and Applications, vol. 21, no. 1, Birkhäuser, 2014, pp. 27–50, doi:10.1007/s00030-013-0235-0.
short: J.L. Fischer, Nonlinear Differential Equations and Applications 21 (2014)
27–50.
date_created: 2018-12-11T11:51:17Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:49:47Z
day: '01'
doi: 10.1007/s00030-013-0235-0
extern: 1
intvolume: ' 21'
issue: '1'
month: '01'
page: 27 - 50
publication: Nonlinear Differential Equations and Applications
publication_status: published
publisher: Birkhäuser
publist_id: '5960'
quality_controlled: 0
status: public
title: Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn
equation and quantum drift-diffusion models
type: journal_article
volume: 21
year: '2014'
...
---
_id: '1312'
abstract:
- lang: eng
text: We derive upper bounds on the waiting time of solutions to the thin-film equation
in the regime of weak slippage n ∈ [2, 32\11). In particular, we give sufficient
conditions on the initial data for instantaneous forward motion of the free boundary.
For n ∈ (2, 32\11), our estimates are sharp, for n = 2, they are sharp up to a
logarithmic correction term. Note that the case n = 2 corresponds-with a grain
of salt-to the assumption of the Navier slip condition at the fluid-solid interface.
We also obtain results in the regime of strong slippage n ∈ (1,2); however, in
this regime we expect them not to be optimal. Our method is based on weighted
backward entropy estimates, Hardy's inequality and singular weight functions;
we deduce a differential inequality which would enforce blowup of the weighted
entropy if the contact line were to remain stationary for too long.
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. Upper bounds on waiting times for the Thin-film equation: The
case of weak slippage. Archive for Rational Mechanics and Analysis. 2014;211(3):771-818.
doi:10.1007/s00205-013-0690-0'
apa: 'Fischer, J. L. (2014). Upper bounds on waiting times for the Thin-film equation:
The case of weak slippage. Archive for Rational Mechanics and Analysis.
Springer. https://doi.org/10.1007/s00205-013-0690-0'
chicago: 'Fischer, Julian L. “Upper Bounds on Waiting Times for the Thin-Film Equation:
The Case of Weak Slippage.” Archive for Rational Mechanics and Analysis.
Springer, 2014. https://doi.org/10.1007/s00205-013-0690-0.'
ieee: 'J. L. Fischer, “Upper bounds on waiting times for the Thin-film equation:
The case of weak slippage,” Archive for Rational Mechanics and Analysis,
vol. 211, no. 3. Springer, pp. 771–818, 2014.'
ista: 'Fischer JL. 2014. Upper bounds on waiting times for the Thin-film equation:
The case of weak slippage. Archive for Rational Mechanics and Analysis. 211(3),
771–818.'
mla: 'Fischer, Julian L. “Upper Bounds on Waiting Times for the Thin-Film Equation:
The Case of Weak Slippage.” Archive for Rational Mechanics and Analysis,
vol. 211, no. 3, Springer, 2014, pp. 771–818, doi:10.1007/s00205-013-0690-0.'
short: J.L. Fischer, Archive for Rational Mechanics and Analysis 211 (2014) 771–818.
date_created: 2018-12-11T11:51:18Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:49:48Z
day: '01'
doi: 10.1007/s00205-013-0690-0
extern: 1
intvolume: ' 211'
issue: '3'
month: '01'
page: 771 - 818
publication: Archive for Rational Mechanics and Analysis
publication_status: published
publisher: Springer
publist_id: '5959'
quality_controlled: 0
status: public
title: 'Upper bounds on waiting times for the Thin-film equation: The case of weak
slippage'
type: journal_article
volume: 211
year: '2014'
...
---
_id: '1375'
abstract:
- lang: eng
text: 'We consider directed graphs where each edge is labeled with an integer weight
and study the fundamental algorithmic question of computing the value of a cycle
with minimum mean weight. Our contributions are twofold: (1) First we show that
the algorithmic question is reducible to the problem of a logarithmic number of
min-plus matrix multiplications of n×n-matrices, where n is the number of vertices
of the graph. (2) Second, when the weights are nonnegative, we present the first
(1+ε)-approximation algorithm for the problem and the running time of our algorithm
is Õ(nωlog3(nW/ε)/ε),1 where O(nω) is the time required for the classic n×n-matrix
multiplication and W is the maximum value of the weights. With an additional O(log(nW/ε))
factor in space a cycle with approximately optimal weight can be computed within
the same time bound.'
article_processing_charge: No
article_type: original
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: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
- first_name: Michael
full_name: Raskin, Michael
last_name: Raskin
citation:
ama: Chatterjee K, Henzinger MH, Krinninger S, Loitzenbauer V, Raskin M. Approximating
the minimum cycle mean. Theoretical Computer Science. 2014;547(C):104-116.
doi:10.1016/j.tcs.2014.06.031
apa: Chatterjee, K., Henzinger, M. H., Krinninger, S., Loitzenbauer, V., & Raskin,
M. (2014). Approximating the minimum cycle mean. Theoretical Computer Science.
Elsevier. https://doi.org/10.1016/j.tcs.2014.06.031
chicago: Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, Veronika
Loitzenbauer, and Michael Raskin. “Approximating the Minimum Cycle Mean.” Theoretical
Computer Science. Elsevier, 2014. https://doi.org/10.1016/j.tcs.2014.06.031.
ieee: K. Chatterjee, M. H. Henzinger, S. Krinninger, V. Loitzenbauer, and M. Raskin,
“Approximating the minimum cycle mean,” Theoretical Computer Science, vol.
547, no. C. Elsevier, pp. 104–116, 2014.
ista: Chatterjee K, Henzinger MH, Krinninger S, Loitzenbauer V, Raskin M. 2014.
Approximating the minimum cycle mean. Theoretical Computer Science. 547(C), 104–116.
mla: Chatterjee, Krishnendu, et al. “Approximating the Minimum Cycle Mean.” Theoretical
Computer Science, vol. 547, no. C, Elsevier, 2014, pp. 104–16, doi:10.1016/j.tcs.2014.06.031.
short: K. Chatterjee, M.H. Henzinger, S. Krinninger, V. Loitzenbauer, M. Raskin,
Theoretical Computer Science 547 (2014) 104–116.
date_created: 2018-12-11T11:51:40Z
date_published: 2014-08-28T00:00:00Z
date_updated: 2022-09-09T11:50:58Z
day: '28'
department:
- _id: KrCh
doi: 10.1016/j.tcs.2014.06.031
ec_funded: 1
external_id:
arxiv:
- '1307.4473'
intvolume: ' 547'
issue: C
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1307.4473
month: '08'
oa: 1
oa_version: Preprint
page: 104 - 116
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: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Theoretical Computer Science
publication_status: published
publisher: Elsevier
publist_id: '5836'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Approximating the minimum cycle mean
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 547
year: '2014'
...