---
_id: '9790'
article_processing_charge: No
author:
- first_name: Victoria
full_name: Pokusaeva, Victoria
id: 3184041C-F248-11E8-B48F-1D18A9856A87
last_name: Pokusaeva
orcid: 0000-0001-7660-444X
- first_name: Dinara R.
full_name: Usmanova, Dinara R.
last_name: Usmanova
- first_name: Ekaterina V.
full_name: Putintseva, Ekaterina V.
last_name: Putintseva
- first_name: Lorena
full_name: Espinar, Lorena
last_name: Espinar
- first_name: Karen
full_name: Sarkisyan, Karen
id: 39A7BF80-F248-11E8-B48F-1D18A9856A87
last_name: Sarkisyan
orcid: 0000-0002-5375-6341
- first_name: Alexander S.
full_name: Mishin, Alexander S.
last_name: Mishin
- first_name: Natalya S.
full_name: Bogatyreva, Natalya S.
last_name: Bogatyreva
- first_name: Dmitry
full_name: Ivankov, Dmitry
id: 49FF1036-F248-11E8-B48F-1D18A9856A87
last_name: Ivankov
orcid: 0000-0002-8224-4118
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
orcid: 0000-0002-7840-5062
- first_name: Inna S.
full_name: Povolotskaya, Inna S.
last_name: Povolotskaya
- first_name: Guillaume J.
full_name: Filion, Guillaume J.
last_name: Filion
- first_name: Lucas B.
full_name: Carey, Lucas B.
last_name: Carey
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
citation:
ama: Pokusaeva V, Usmanova DR, Putintseva EV, et al. A statistical summary of segment
libraries and sequencing results. 2019. doi:10.1371/journal.pgen.1008079.s011
apa: Pokusaeva, V., Usmanova, D. R., Putintseva, E. V., Espinar, L., Sarkisyan,
K., Mishin, A. S., … Kondrashov, F. (2019). A statistical summary of segment libraries
and sequencing results. Public Library of Science. https://doi.org/10.1371/journal.pgen.1008079.s011
chicago: Pokusaeva, Victoria, Dinara R. Usmanova, Ekaterina V. Putintseva, Lorena
Espinar, Karen Sarkisyan, Alexander S. Mishin, Natalya S. Bogatyreva, et al. “A
Statistical Summary of Segment Libraries and Sequencing Results.” Public Library
of Science, 2019. https://doi.org/10.1371/journal.pgen.1008079.s011.
ieee: V. Pokusaeva et al., “A statistical summary of segment libraries and
sequencing results.” Public Library of Science, 2019.
ista: Pokusaeva V, Usmanova DR, Putintseva EV, Espinar L, Sarkisyan K, Mishin AS,
Bogatyreva NS, Ivankov D, Akopyan A, Avvakumov S, Povolotskaya IS, Filion GJ,
Carey LB, Kondrashov F. 2019. A statistical summary of segment libraries and sequencing
results, Public Library of Science, 10.1371/journal.pgen.1008079.s011.
mla: Pokusaeva, Victoria, et al. A Statistical Summary of Segment Libraries and
Sequencing Results. Public Library of Science, 2019, doi:10.1371/journal.pgen.1008079.s011.
short: V. Pokusaeva, D.R. Usmanova, E.V. Putintseva, L. Espinar, K. Sarkisyan, A.S.
Mishin, N.S. Bogatyreva, D. Ivankov, A. Akopyan, S. Avvakumov, I.S. Povolotskaya,
G.J. Filion, L.B. Carey, F. Kondrashov, (2019).
date_created: 2021-08-06T08:50:15Z
date_published: 2019-04-10T00:00:00Z
date_updated: 2026-04-03T09:45:18Z
day: '10'
department:
- _id: FyKo
doi: 10.1371/journal.pgen.1008079.s011
month: '04'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '6419'
relation: used_in_publication
status: public
status: public
title: A statistical summary of segment libraries and sequencing results
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2019'
...
---
_id: '9797'
article_processing_charge: No
author:
- first_name: Victoria
full_name: Pokusaeva, Victoria
id: 3184041C-F248-11E8-B48F-1D18A9856A87
last_name: Pokusaeva
orcid: 0000-0001-7660-444X
- first_name: Dinara R.
full_name: Usmanova, Dinara R.
last_name: Usmanova
- first_name: Ekaterina V.
full_name: Putintseva, Ekaterina V.
last_name: Putintseva
- first_name: Lorena
full_name: Espinar, Lorena
last_name: Espinar
- first_name: Karen
full_name: Sarkisyan, Karen
id: 39A7BF80-F248-11E8-B48F-1D18A9856A87
last_name: Sarkisyan
orcid: 0000-0002-5375-6341
- first_name: Alexander S.
full_name: Mishin, Alexander S.
last_name: Mishin
- first_name: Natalya S.
full_name: Bogatyreva, Natalya S.
last_name: Bogatyreva
- first_name: Dmitry
full_name: Ivankov, Dmitry
id: 49FF1036-F248-11E8-B48F-1D18A9856A87
last_name: Ivankov
orcid: 0000-0002-8224-4118
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Inna S.
full_name: Povolotskaya, Inna S.
last_name: Povolotskaya
- first_name: Guillaume J.
full_name: Filion, Guillaume J.
last_name: Filion
- first_name: Lucas B.
full_name: Carey, Lucas B.
last_name: Carey
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
citation:
ama: Pokusaeva V, Usmanova DR, Putintseva EV, et al. A statistical summary of segment
libraries and sequencing results. 2019. doi:10.1371/journal.pgen.1008079.s011
apa: Pokusaeva, V., Usmanova, D. R., Putintseva, E. V., Espinar, L., Sarkisyan,
K., Mishin, A. S., … Kondrashov, F. (2019). A statistical summary of segment libraries
and sequencing results. Public Library of Science. https://doi.org/10.1371/journal.pgen.1008079.s011
chicago: Pokusaeva, Victoria, Dinara R. Usmanova, Ekaterina V. Putintseva, Lorena
Espinar, Karen Sarkisyan, Alexander S. Mishin, Natalya S. Bogatyreva, et al. “A
Statistical Summary of Segment Libraries and Sequencing Results.” Public Library
of Science, 2019. https://doi.org/10.1371/journal.pgen.1008079.s011.
ieee: V. Pokusaeva et al., “A statistical summary of segment libraries and
sequencing results.” Public Library of Science, 2019.
ista: Pokusaeva V, Usmanova DR, Putintseva EV, Espinar L, Sarkisyan K, Mishin AS,
Bogatyreva NS, Ivankov D, Akopyan A, Povolotskaya IS, Filion GJ, Carey LB, Kondrashov
F. 2019. A statistical summary of segment libraries and sequencing results, Public
Library of Science, 10.1371/journal.pgen.1008079.s011.
mla: Pokusaeva, Victoria, et al. A Statistical Summary of Segment Libraries and
Sequencing Results. Public Library of Science, 2019, doi:10.1371/journal.pgen.1008079.s011.
short: V. Pokusaeva, D.R. Usmanova, E.V. Putintseva, L. Espinar, K. Sarkisyan, A.S.
Mishin, N.S. Bogatyreva, D. Ivankov, A. Akopyan, I.S. Povolotskaya, G.J. Filion,
L.B. Carey, F. Kondrashov, (2019).
date_created: 2021-08-06T11:08:20Z
date_published: 2019-04-10T00:00:00Z
date_updated: 2026-04-03T09:45:18Z
day: '10'
department:
- _id: FyKo
doi: 10.1371/journal.pgen.1008079.s011
month: '04'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '6419'
relation: used_in_publication
status: public
status: public
title: A statistical summary of segment libraries and sequencing results
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2019'
...
---
_id: '9789'
article_processing_charge: No
author:
- first_name: Victoria
full_name: Pokusaeva, Victoria
id: 3184041C-F248-11E8-B48F-1D18A9856A87
last_name: Pokusaeva
orcid: 0000-0001-7660-444X
- first_name: Dinara R.
full_name: Usmanova, Dinara R.
last_name: Usmanova
- first_name: Ekaterina V.
full_name: Putintseva, Ekaterina V.
last_name: Putintseva
- first_name: Lorena
full_name: Espinar, Lorena
last_name: Espinar
- first_name: Karen
full_name: Sarkisyan, Karen
id: 39A7BF80-F248-11E8-B48F-1D18A9856A87
last_name: Sarkisyan
orcid: 0000-0002-5375-6341
- first_name: Alexander S.
full_name: Mishin, Alexander S.
last_name: Mishin
- first_name: Natalya S.
full_name: Bogatyreva, Natalya S.
last_name: Bogatyreva
- first_name: Dmitry
full_name: Ivankov, Dmitry
id: 49FF1036-F248-11E8-B48F-1D18A9856A87
last_name: Ivankov
orcid: 0000-0002-8224-4118
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
orcid: 0000-0002-7840-5062
- first_name: Inna S.
full_name: Povolotskaya, Inna S.
last_name: Povolotskaya
- first_name: Guillaume J.
full_name: Filion, Guillaume J.
last_name: Filion
- first_name: Lucas B.
full_name: Carey, Lucas B.
last_name: Carey
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
citation:
ama: Pokusaeva V, Usmanova DR, Putintseva EV, et al. Multiple alignment of His3
orthologues. 2019. doi:10.1371/journal.pgen.1008079.s010
apa: Pokusaeva, V., Usmanova, D. R., Putintseva, E. V., Espinar, L., Sarkisyan,
K., Mishin, A. S., … Kondrashov, F. (2019). Multiple alignment of His3 orthologues.
Public Library of Science. https://doi.org/10.1371/journal.pgen.1008079.s010
chicago: Pokusaeva, Victoria, Dinara R. Usmanova, Ekaterina V. Putintseva, Lorena
Espinar, Karen Sarkisyan, Alexander S. Mishin, Natalya S. Bogatyreva, et al. “Multiple
Alignment of His3 Orthologues.” Public Library of Science, 2019. https://doi.org/10.1371/journal.pgen.1008079.s010.
ieee: V. Pokusaeva et al., “Multiple alignment of His3 orthologues.” Public
Library of Science, 2019.
ista: Pokusaeva V, Usmanova DR, Putintseva EV, Espinar L, Sarkisyan K, Mishin AS,
Bogatyreva NS, Ivankov D, Akopyan A, Avvakumov S, Povolotskaya IS, Filion GJ,
Carey LB, Kondrashov F. 2019. Multiple alignment of His3 orthologues, Public Library
of Science, 10.1371/journal.pgen.1008079.s010.
mla: Pokusaeva, Victoria, et al. Multiple Alignment of His3 Orthologues.
Public Library of Science, 2019, doi:10.1371/journal.pgen.1008079.s010.
short: V. Pokusaeva, D.R. Usmanova, E.V. Putintseva, L. Espinar, K. Sarkisyan, A.S.
Mishin, N.S. Bogatyreva, D. Ivankov, A. Akopyan, S. Avvakumov, I.S. Povolotskaya,
G.J. Filion, L.B. Carey, F. Kondrashov, (2019).
date_created: 2021-08-06T08:38:50Z
date_published: 2019-04-10T00:00:00Z
date_updated: 2026-04-03T09:45:18Z
day: '10'
department:
- _id: FyKo
doi: 10.1371/journal.pgen.1008079.s010
month: '04'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '6419'
relation: used_in_publication
status: public
status: public
title: Multiple alignment of His3 orthologues
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2019'
...
---
_id: '7202'
abstract:
- lang: eng
text: The cerebral cortex contains multiple areas with distinctive cytoarchitectonical
patterns, but the cellular mechanisms underlying the emergence of this diversity
remain unclear. Here, we have investigated the neuronal output of individual progenitor
cells in the developing mouse neocortex using a combination of methods that together
circumvent the biases and limitations of individual approaches. Our experimental
results indicate that progenitor cells generate pyramidal cell lineages with a
wide range of sizes and laminar configurations. Mathematical modelling indicates
that these outcomes are compatible with a stochastic model of cortical neurogenesis
in which progenitor cells undergo a series of probabilistic decisions that lead
to the specification of very heterogeneous progenies. Our findings support a mechanism
for cortical neurogenesis whose flexibility would make it capable to generate
the diverse cytoarchitectures that characterize distinct neocortical areas.
article_number: e51381
article_processing_charge: No
article_type: original
author:
- first_name: Alfredo
full_name: Llorca, Alfredo
last_name: Llorca
- first_name: Gabriele
full_name: Ciceri, Gabriele
last_name: Ciceri
- first_name: Robert J
full_name: Beattie, Robert J
id: 2E26DF60-F248-11E8-B48F-1D18A9856A87
last_name: Beattie
orcid: 0000-0002-8483-8753
- first_name: Fong Kuan
full_name: Wong, Fong Kuan
last_name: Wong
- first_name: Giovanni
full_name: Diana, Giovanni
last_name: Diana
- first_name: Eleni
full_name: Serafeimidou-Pouliou, Eleni
last_name: Serafeimidou-Pouliou
- first_name: Marian
full_name: Fernández-Otero, Marian
last_name: Fernández-Otero
- first_name: Carmen
full_name: Streicher, Carmen
id: 36BCB99C-F248-11E8-B48F-1D18A9856A87
last_name: Streicher
- first_name: Sebastian J.
full_name: Arnold, Sebastian J.
last_name: Arnold
- first_name: Martin
full_name: Meyer, Martin
last_name: Meyer
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Miguel
full_name: Maravall, Miguel
last_name: Maravall
- first_name: Oscar
full_name: Marín, Oscar
last_name: Marín
citation:
ama: Llorca A, Ciceri G, Beattie RJ, et al. A stochastic framework of neurogenesis
underlies the assembly of neocortical cytoarchitecture. eLife. 2019;8.
doi:10.7554/eLife.51381
apa: Llorca, A., Ciceri, G., Beattie, R. J., Wong, F. K., Diana, G., Serafeimidou-Pouliou,
E., … Marín, O. (2019). A stochastic framework of neurogenesis underlies the assembly
of neocortical cytoarchitecture. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.51381
chicago: Llorca, Alfredo, Gabriele Ciceri, Robert J Beattie, Fong Kuan Wong, Giovanni
Diana, Eleni Serafeimidou-Pouliou, Marian Fernández-Otero, et al. “A Stochastic
Framework of Neurogenesis Underlies the Assembly of Neocortical Cytoarchitecture.”
ELife. eLife Sciences Publications, 2019. https://doi.org/10.7554/eLife.51381.
ieee: A. Llorca et al., “A stochastic framework of neurogenesis underlies
the assembly of neocortical cytoarchitecture,” eLife, vol. 8. eLife Sciences
Publications, 2019.
ista: Llorca A, Ciceri G, Beattie RJ, Wong FK, Diana G, Serafeimidou-Pouliou E,
Fernández-Otero M, Streicher C, Arnold SJ, Meyer M, Hippenmeyer S, Maravall M,
Marín O. 2019. A stochastic framework of neurogenesis underlies the assembly of
neocortical cytoarchitecture. eLife. 8, e51381.
mla: Llorca, Alfredo, et al. “A Stochastic Framework of Neurogenesis Underlies the
Assembly of Neocortical Cytoarchitecture.” ELife, vol. 8, e51381, eLife
Sciences Publications, 2019, doi:10.7554/eLife.51381.
short: A. Llorca, G. Ciceri, R.J. Beattie, F.K. Wong, G. Diana, E. Serafeimidou-Pouliou,
M. Fernández-Otero, C. Streicher, S.J. Arnold, M. Meyer, S. Hippenmeyer, M. Maravall,
O. Marín, ELife 8 (2019).
date_created: 2019-12-22T23:00:42Z
date_published: 2019-11-18T00:00:00Z
date_updated: 2026-04-03T09:46:33Z
day: '18'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.7554/eLife.51381
ec_funded: 1
external_id:
isi:
- '000508156800001'
pmid:
- '31736464'
file:
- access_level: open_access
checksum: b460ecc33e1a68265e7adea775021f3a
content_type: application/pdf
creator: dernst
date_created: 2020-02-18T15:19:26Z
date_updated: 2020-07-14T12:47:53Z
file_id: '7503'
file_name: 2019_eLife_Llorca.pdf
file_size: 2960543
relation: main_file
file_date_updated: 2020-07-14T12:47:53Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 260018B0-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '725780'
name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
- _id: 264E56E2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02416
name: Molecular Mechanisms Regulating Gliogenesis in the Neocortex
publication: eLife
publication_identifier:
eissn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: A stochastic framework of neurogenesis underlies the assembly of neocortical
cytoarchitecture
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 8
year: '2019'
...
---
_id: '7180'
abstract:
- lang: eng
text: Arabidopsis PIN2 protein directs transport of the phytohormone auxin from
the root tip into the root elongation zone. Variation in hormone transport, which
depends on a delicate interplay between PIN2 sorting to and from polar plasma
membrane domains, determines root growth. By employing a constitutively degraded
version of PIN2, we identify brassinolides as antagonists of PIN2 endocytosis.
This response does not require de novo protein synthesis, but involves early events
in canonical brassinolide signaling. Brassinolide-controlled adjustments in PIN2
sorting and intracellular distribution governs formation of a lateral PIN2 gradient
in gravistimulated roots, coinciding with adjustments in auxin signaling and directional
root growth. Strikingly, simulations indicate that PIN2 gradient formation is
no prerequisite for root bending but rather dampens asymmetric auxin flow and
signaling. Crosstalk between brassinolide signaling and endocytic PIN2 sorting,
thus, appears essential for determining the rate of gravity-induced root curvature
via attenuation of differential cell elongation.
article_number: '5516'
article_processing_charge: No
article_type: original
author:
- first_name: Katarzyna
full_name: Retzer, Katarzyna
last_name: Retzer
- first_name: Maria
full_name: Akhmanova, Maria
id: 3425EC26-F248-11E8-B48F-1D18A9856A87
last_name: Akhmanova
orcid: 0000-0003-1522-3162
- first_name: Nataliia
full_name: Konstantinova, Nataliia
last_name: Konstantinova
- first_name: Kateřina
full_name: Malínská, Kateřina
last_name: Malínská
- first_name: Johannes
full_name: Leitner, Johannes
last_name: Leitner
- first_name: Jan
full_name: Petrášek, Jan
last_name: Petrášek
- first_name: Christian
full_name: Luschnig, Christian
last_name: Luschnig
citation:
ama: Retzer K, Akhmanova M, Konstantinova N, et al. Brassinosteroid signaling delimits
root gravitropism via sorting of the Arabidopsis PIN2 auxin transporter. Nature
Communications. 2019;10. doi:10.1038/s41467-019-13543-1
apa: Retzer, K., Akhmanova, M., Konstantinova, N., Malínská, K., Leitner, J., Petrášek,
J., & Luschnig, C. (2019). Brassinosteroid signaling delimits root gravitropism
via sorting of the Arabidopsis PIN2 auxin transporter. Nature Communications.
Springer Nature. https://doi.org/10.1038/s41467-019-13543-1
chicago: Retzer, Katarzyna, Maria Akhmanova, Nataliia Konstantinova, Kateřina Malínská,
Johannes Leitner, Jan Petrášek, and Christian Luschnig. “Brassinosteroid Signaling
Delimits Root Gravitropism via Sorting of the Arabidopsis PIN2 Auxin Transporter.”
Nature Communications. Springer Nature, 2019. https://doi.org/10.1038/s41467-019-13543-1.
ieee: K. Retzer et al., “Brassinosteroid signaling delimits root gravitropism
via sorting of the Arabidopsis PIN2 auxin transporter,” Nature Communications,
vol. 10. Springer Nature, 2019.
ista: Retzer K, Akhmanova M, Konstantinova N, Malínská K, Leitner J, Petrášek J,
Luschnig C. 2019. Brassinosteroid signaling delimits root gravitropism via sorting
of the Arabidopsis PIN2 auxin transporter. Nature Communications. 10, 5516.
mla: Retzer, Katarzyna, et al. “Brassinosteroid Signaling Delimits Root Gravitropism
via Sorting of the Arabidopsis PIN2 Auxin Transporter.” Nature Communications,
vol. 10, 5516, Springer Nature, 2019, doi:10.1038/s41467-019-13543-1.
short: K. Retzer, M. Akhmanova, N. Konstantinova, K. Malínská, J. Leitner, J. Petrášek,
C. Luschnig, Nature Communications 10 (2019).
date_created: 2019-12-15T23:00:43Z
date_published: 2019-12-01T00:00:00Z
date_updated: 2026-04-03T09:46:19Z
day: '01'
ddc:
- '570'
department:
- _id: DaSi
doi: 10.1038/s41467-019-13543-1
external_id:
isi:
- '000500508100001'
pmid:
- '31797871'
file:
- access_level: open_access
checksum: 77e8720a8e0f3091b98159f85be40893
content_type: application/pdf
creator: dernst
date_created: 2019-12-16T07:37:50Z
date_updated: 2020-07-14T12:47:52Z
file_id: '7184'
file_name: 2019_NatureComm_Retzer.pdf
file_size: 5156533
relation: main_file
file_date_updated: 2020-07-14T12:47:52Z
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 264CBBAC-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02379
name: Modeling epithelial tissue mechanics during cell invasion
publication: Nature Communications
publication_identifier:
eissn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Brassinosteroid signaling delimits root gravitropism via sorting of the Arabidopsis
PIN2 auxin transporter
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 10
year: '2019'
...
---
_id: '429'
abstract:
- lang: eng
text: We consider real symmetric or complex hermitian random matrices with correlated
entries. We prove local laws for the resolvent and universality of the local eigenvalue
statistics in the bulk of the spectrum. The correlations have fast decay but are
otherwise of general form. The key novelty is the detailed stability analysis
of the corresponding matrix valued Dyson equation whose solution is the deterministic
limit of the resolvent.
acknowledgement: "Open access funding provided by Institute of Science and Technology
(IST Austria).\r\n"
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Oskari H
full_name: Ajanki, Oskari H
id: 36F2FB7E-F248-11E8-B48F-1D18A9856A87
last_name: Ajanki
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
citation:
ama: Ajanki OH, Erdös L, Krüger TH. Stability of the matrix Dyson equation and random
matrices with correlations. Probability Theory and Related Fields. 2019;173(1-2):293–373.
doi:10.1007/s00440-018-0835-z
apa: Ajanki, O. H., Erdös, L., & Krüger, T. H. (2019). Stability of the matrix
Dyson equation and random matrices with correlations. Probability Theory and
Related Fields. Springer. https://doi.org/10.1007/s00440-018-0835-z
chicago: Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Stability of the
Matrix Dyson Equation and Random Matrices with Correlations.” Probability Theory
and Related Fields. Springer, 2019. https://doi.org/10.1007/s00440-018-0835-z.
ieee: O. H. Ajanki, L. Erdös, and T. H. Krüger, “Stability of the matrix Dyson equation
and random matrices with correlations,” Probability Theory and Related Fields,
vol. 173, no. 1–2. Springer, pp. 293–373, 2019.
ista: Ajanki OH, Erdös L, Krüger TH. 2019. Stability of the matrix Dyson equation
and random matrices with correlations. Probability Theory and Related Fields.
173(1–2), 293–373.
mla: Ajanki, Oskari H., et al. “Stability of the Matrix Dyson Equation and Random
Matrices with Correlations.” Probability Theory and Related Fields, vol.
173, no. 1–2, Springer, 2019, pp. 293–373, doi:10.1007/s00440-018-0835-z.
short: O.H. Ajanki, L. Erdös, T.H. Krüger, Probability Theory and Related Fields
173 (2019) 293–373.
corr_author: '1'
date_created: 2018-12-11T11:46:25Z
date_published: 2019-02-01T00:00:00Z
date_updated: 2026-04-03T09:46:51Z
day: '01'
ddc:
- '510'
department:
- _id: LaEr
doi: 10.1007/s00440-018-0835-z
ec_funded: 1
external_id:
isi:
- '000459396500007'
file:
- access_level: open_access
checksum: f9354fa5c71f9edd17132588f0dc7d01
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:12:08Z
date_updated: 2020-07-14T12:46:26Z
file_id: '5720'
file_name: 2018_ProbTheory_Ajanki.pdf
file_size: 1201840
relation: main_file
file_date_updated: 2020-07-14T12:46:26Z
has_accepted_license: '1'
intvolume: ' 173'
isi: 1
issue: 1-2
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 293–373
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Probability Theory and Related Fields
publication_identifier:
eissn:
- 1432-2064
issn:
- 0178-8051
publication_status: published
publisher: Springer
publist_id: '7394'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Stability of the matrix Dyson equation and random matrices with correlations
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 173
year: '2019'
...
---
_id: '7576'
abstract:
- lang: eng
text: We present the results of a friendly competition for formal verification of
continuous and hybrid systems with nonlinear continuous dynamics. The friendly
competition took place as part of the workshop Applied Verification for Continuous
and Hybrid Systems (ARCH) in 2019. In this year, 6 tools Ariadne, CORA, DynIbex,
Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. They are
applied to solve reachability analysis problems on four benchmark problems, one
of them with hybrid dynamics. We do not rank the tools based on the results, but
show the current status and discover the potential advantages of different tools.
article_processing_charge: No
author:
- first_name: Fabian
full_name: Immler, Fabian
last_name: Immler
- first_name: Matthias
full_name: Althoff, Matthias
last_name: Althoff
- first_name: Luis
full_name: Benet, Luis
last_name: Benet
- first_name: Alexandre
full_name: Chapoutot, Alexandre
last_name: Chapoutot
- first_name: Xin
full_name: Chen, Xin
last_name: Chen
- first_name: Marcelo
full_name: Forets, Marcelo
last_name: Forets
- first_name: Luca
full_name: Geretti, Luca
last_name: Geretti
- first_name: Niklas
full_name: Kochdumper, Niklas
last_name: Kochdumper
- first_name: David P.
full_name: Sanders, David P.
last_name: Sanders
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
citation:
ama: 'Immler F, Althoff M, Benet L, et al. ARCH-COMP19 Category Report: Continuous
and hybrid systems with nonlinear dynamics. In: EPiC Series in Computing.
Vol 61. EasyChair; 2019:41-61. doi:10.29007/m75b'
apa: 'Immler, F., Althoff, M., Benet, L., Chapoutot, A., Chen, X., Forets, M., …
Schilling, C. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems
with nonlinear dynamics. In EPiC Series in Computing (Vol. 61, pp. 41–61).
Montreal, Canada: EasyChair. https://doi.org/10.29007/m75b'
chicago: 'Immler, Fabian, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin
Chen, Marcelo Forets, Luca Geretti, Niklas Kochdumper, David P. Sanders, and Christian
Schilling. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear
Dynamics.” In EPiC Series in Computing, 61:41–61. EasyChair, 2019. https://doi.org/10.29007/m75b.'
ieee: 'F. Immler et al., “ARCH-COMP19 Category Report: Continuous and hybrid
systems with nonlinear dynamics,” in EPiC Series in Computing, Montreal,
Canada, 2019, vol. 61, pp. 41–61.'
ista: 'Immler F, Althoff M, Benet L, Chapoutot A, Chen X, Forets M, Geretti L, Kochdumper
N, Sanders DP, Schilling C. 2019. ARCH-COMP19 Category Report: Continuous and
hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International
Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 41–61.'
mla: 'Immler, Fabian, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid
Systems with Nonlinear Dynamics.” EPiC Series in Computing, vol. 61, EasyChair,
2019, pp. 41–61, doi:10.29007/m75b.'
short: F. Immler, M. Althoff, L. Benet, A. Chapoutot, X. Chen, M. Forets, L. Geretti,
N. Kochdumper, D.P. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair,
2019, pp. 41–61.
conference:
end_date: 2019-04-15
location: Montreal, Canada
name: 'ARCH: International Workshop on Applied Verification on Continuous and Hybrid
Systems'
start_date: 2019-04-15
corr_author: '1'
date_created: 2020-03-08T23:00:49Z
date_published: 2019-05-25T00:00:00Z
date_updated: 2026-04-03T09:51:13Z
day: '25'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.29007/m75b
file:
- access_level: open_access
checksum: 9138977a06fcd6a95976eb4bca875f0c
content_type: application/pdf
creator: dernst
date_created: 2020-03-24T07:36:36Z
date_updated: 2020-07-14T12:48:00Z
file_id: '7617'
file_name: 2019_ARCH19_Immler.pdf
file_size: 1934830
relation: main_file
file_date_updated: 2020-07-14T12:48:00Z
has_accepted_license: '1'
intvolume: ' 61'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 41-61
publication: EPiC Series in Computing
publication_identifier:
eissn:
- 2398-7340
publication_status: published
publisher: EasyChair
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear
dynamics'
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 61
year: '2019'
...
---
_id: '6795'
abstract:
- lang: eng
text: The green‐beard effect is one proposed mechanism predicted to underpin the
evolu‐tion of altruistic behavior. It relies on the recognition and the selective
help of altruists to each other in order to promote and sustain altruistic behavior.
However, this mechanism has often been dismissed as unlikely or uncommon, as it
is assumed that both the signaling trait and altruistic trait need to be encoded
by the same gene or through tightly linked genes. Here, we use models of indirect
genetic effects (IGEs) to find the minimum correlation between the signaling and
altruistic trait required for the evolution of the latter. We show that this correlation
threshold depends on the strength of the interaction (influence of the green beard
on the expression of the altruistic trait), as well as the costs and benefits
of the altruistic behavior. We further show that this correlation does not necessarily
have to be high and support our analytical results by simulations.
article_processing_charge: No
article_type: original
author:
- first_name: Barbora
full_name: Trubenova, Barbora
id: 42302D54-F248-11E8-B48F-1D18A9856A87
last_name: Trubenova
orcid: 0000-0002-6873-2967
- first_name: Reinmar
full_name: Hager, Reinmar
last_name: Hager
citation:
ama: Trubenova B, Hager R. Green beards in the light of indirect genetic effects.
Ecology and Evolution. 2019;9(17):9597-9608. doi:10.1002/ece3.5484
apa: Trubenova, B., & Hager, R. (2019). Green beards in the light of indirect
genetic effects. Ecology and Evolution. Wiley. https://doi.org/10.1002/ece3.5484
chicago: Trubenova, Barbora, and Reinmar Hager. “Green Beards in the Light of Indirect
Genetic Effects.” Ecology and Evolution. Wiley, 2019. https://doi.org/10.1002/ece3.5484.
ieee: B. Trubenova and R. Hager, “Green beards in the light of indirect genetic
effects,” Ecology and Evolution, vol. 9, no. 17. Wiley, pp. 9597–9608,
2019.
ista: Trubenova B, Hager R. 2019. Green beards in the light of indirect genetic
effects. Ecology and Evolution. 9(17), 9597–9608.
mla: Trubenova, Barbora, and Reinmar Hager. “Green Beards in the Light of Indirect
Genetic Effects.” Ecology and Evolution, vol. 9, no. 17, Wiley, 2019, pp.
9597–608, doi:10.1002/ece3.5484.
short: B. Trubenova, R. Hager, Ecology and Evolution 9 (2019) 9597–9608.
date_created: 2019-08-11T21:59:24Z
date_published: 2019-09-01T00:00:00Z
date_updated: 2026-04-03T09:50:31Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1002/ece3.5484
ec_funded: 1
external_id:
isi:
- '000479973400001'
file:
- access_level: open_access
checksum: adcb70af4901977d95b8747eeee01bd7
content_type: application/pdf
creator: dernst
date_created: 2019-08-12T07:30:30Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6799'
file_name: 2019_EcologyEvolution_Trubenova.pdf
file_size: 2839636
relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '17'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 9597-9608
project:
- _id: 25AEDD42-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '704172'
name: Rate of Adaptation in Changing Environment
publication: Ecology and Evolution
publication_identifier:
eissn:
- 2045-7758
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Green beards in the light of indirect genetic effects
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 9
year: '2019'
...
---
_id: '7606'
abstract:
- lang: eng
text: We derive a tight lower bound on equivocation (conditional entropy), or equivalently
a tight upper bound on mutual information between a signal variable and channel
outputs. The bound is in terms of the joint distribution of the signals and maximum
a posteriori decodes (most probable signals given channel output). As part of
our derivation, we describe the key properties of the distribution of signals,
channel outputs and decodes, that minimizes equivocation and maximizes mutual
information. This work addresses a problem in data analysis, where mutual information
between signals and decodes is sometimes used to lower bound the mutual information
between signals and channel outputs. Our result provides a corresponding upper
bound.
article_number: '8989292'
article_processing_charge: No
arxiv: 1
author:
- first_name: Michal
full_name: Hledik, Michal
id: 4171253A-F248-11E8-B48F-1D18A9856A87
last_name: Hledik
- first_name: Thomas R
full_name: Sokolowski, Thomas R
id: 3E999752-F248-11E8-B48F-1D18A9856A87
last_name: Sokolowski
orcid: 0000-0002-1287-3779
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
citation:
ama: 'Hledik M, Sokolowski TR, Tkačik G. A tight upper bound on mutual information.
In: IEEE Information Theory Workshop, ITW 2019. IEEE; 2019. doi:10.1109/ITW44776.2019.8989292'
apa: 'Hledik, M., Sokolowski, T. R., & Tkačik, G. (2019). A tight upper bound
on mutual information. In IEEE Information Theory Workshop, ITW 2019. Visby,
Sweden: IEEE. https://doi.org/10.1109/ITW44776.2019.8989292'
chicago: Hledik, Michal, Thomas R Sokolowski, and Gašper Tkačik. “A Tight Upper
Bound on Mutual Information.” In IEEE Information Theory Workshop, ITW 2019.
IEEE, 2019. https://doi.org/10.1109/ITW44776.2019.8989292.
ieee: M. Hledik, T. R. Sokolowski, and G. Tkačik, “A tight upper bound on mutual
information,” in IEEE Information Theory Workshop, ITW 2019, Visby, Sweden,
2019.
ista: Hledik M, Sokolowski TR, Tkačik G. 2019. A tight upper bound on mutual information.
IEEE Information Theory Workshop, ITW 2019. Information Theory Workshop, 8989292.
mla: Hledik, Michal, et al. “A Tight Upper Bound on Mutual Information.” IEEE
Information Theory Workshop, ITW 2019, 8989292, IEEE, 2019, doi:10.1109/ITW44776.2019.8989292.
short: M. Hledik, T.R. Sokolowski, G. Tkačik, in:, IEEE Information Theory Workshop,
ITW 2019, IEEE, 2019.
conference:
end_date: 2019-08-28
location: Visby, Sweden
name: Information Theory Workshop
start_date: 2019-08-25
date_created: 2020-03-22T23:00:47Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2026-04-07T12:59:24Z
day: '01'
department:
- _id: GaTk
doi: 10.1109/ITW44776.2019.8989292
ec_funded: 1
external_id:
arxiv:
- '1812.01475'
isi:
- '000540384500015'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1812.01475
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: IEEE Information Theory Workshop, ITW 2019
publication_identifier:
isbn:
- '9781538669006'
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '15020'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: A tight upper bound on mutual information
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '6831'
abstract:
- lang: eng
text: "* Understanding the mechanisms causing phenotypic differences between females
and males has long fascinated evolutionary biologists. An extensive literature
exists on animal sexual dimorphism but less information is known about sex differences
in plants, particularly the extent of geographical variation in sexual dimorphism
and its life‐cycle dynamics.\r\n* Here, we investigated patterns of genetically
based sexual dimorphism in vegetative and reproductive traits of a wind‐pollinated
dioecious plant, Rumex hastatulus, across three life‐cycle stages using open‐pollinated
families from 30 populations spanning the geographic range and chromosomal variation
(XY and XY1Y2) of the species.\r\n* The direction and degree of sexual dimorphism
was highly variable among populations and life‐cycle stages. Sex‐specific differences
in reproductive function explained a significant amount of temporal change in
sexual dimorphism. For several traits, geographical variation in sexual dimorphism
was associated with bioclimatic parameters, likely due to the differential responses
of the sexes to climate. We found no systematic differences in sexual dimorphism
between chromosome races.\r\n* Sex‐specific trait differences in dioecious plants
largely result from a balance between sexual and natural selection on resource
allocation. Our results indicate that abiotic factors associated with geographical
context also play a role in modifying sexual dimorphism during the plant life‐cycle."
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Gemma
full_name: Puixeu Sala, Gemma
id: 33AB266C-F248-11E8-B48F-1D18A9856A87
last_name: Puixeu Sala
orcid: 0000-0001-8330-1754
- first_name: Melinda
full_name: Pickup, Melinda
id: 2C78037E-F248-11E8-B48F-1D18A9856A87
last_name: Pickup
orcid: 0000-0001-6118-0541
- first_name: David
full_name: Field, David
last_name: Field
orcid: 0000-0002-4014-8478
- first_name: Spencer C.H.
full_name: Barrett, Spencer C.H.
last_name: Barrett
citation:
ama: 'Puixeu Sala G, Pickup M, Field D, Barrett SCH. Variation in sexual dimorphism
in a wind-pollinated plant: The influence of geographical context and life-cycle
dynamics. New Phytologist. 2019;224(3):1108-1120. doi:10.1111/nph.16050'
apa: 'Puixeu Sala, G., Pickup, M., Field, D., & Barrett, S. C. H. (2019). Variation
in sexual dimorphism in a wind-pollinated plant: The influence of geographical
context and life-cycle dynamics. New Phytologist. Wiley. https://doi.org/10.1111/nph.16050'
chicago: 'Puixeu Sala, Gemma, Melinda Pickup, David Field, and Spencer C.H. Barrett.
“Variation in Sexual Dimorphism in a Wind-Pollinated Plant: The Influence of Geographical
Context and Life-Cycle Dynamics.” New Phytologist. Wiley, 2019. https://doi.org/10.1111/nph.16050.'
ieee: 'G. Puixeu Sala, M. Pickup, D. Field, and S. C. H. Barrett, “Variation in
sexual dimorphism in a wind-pollinated plant: The influence of geographical context
and life-cycle dynamics,” New Phytologist, vol. 224, no. 3. Wiley, pp.
1108–1120, 2019.'
ista: 'Puixeu Sala G, Pickup M, Field D, Barrett SCH. 2019. Variation in sexual
dimorphism in a wind-pollinated plant: The influence of geographical context and
life-cycle dynamics. New Phytologist. 224(3), 1108–1120.'
mla: 'Puixeu Sala, Gemma, et al. “Variation in Sexual Dimorphism in a Wind-Pollinated
Plant: The Influence of Geographical Context and Life-Cycle Dynamics.” New
Phytologist, vol. 224, no. 3, Wiley, 2019, pp. 1108–20, doi:10.1111/nph.16050.'
short: G. Puixeu Sala, M. Pickup, D. Field, S.C.H. Barrett, New Phytologist 224
(2019) 1108–1120.
corr_author: '1'
date_created: 2019-08-25T22:00:51Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2026-04-07T13:25:33Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
- _id: BeVi
doi: 10.1111/nph.16050
ec_funded: 1
external_id:
isi:
- '000481376500001'
file:
- access_level: open_access
checksum: 6370e7567d96b7b562e77d8b89653f80
content_type: application/pdf
creator: apreinsp
date_created: 2019-08-27T12:44:54Z
date_updated: 2020-07-14T12:47:42Z
file_id: '6833'
file_name: 2019_NewPhytologist_Puixeu.pdf
file_size: 2314016
relation: main_file
file_date_updated: 2020-07-14T12:47:42Z
has_accepted_license: '1'
intvolume: ' 224'
isi: 1
issue: '3'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 1108-1120
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: New Phytologist
publication_identifier:
eissn:
- 1469-8137
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '9803'
relation: research_data
status: public
- id: '14058'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Variation in sexual dimorphism in a wind-pollinated plant: The influence of
geographical context and life-cycle dynamics'
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 224
year: '2019'
...
---
_id: '9803'
abstract:
- lang: eng
text: Understanding the mechanisms causing phenotypic differences between females
and males has long fascinated evolutionary biologists. An extensive literature
exists on animal sexual dimorphism but less is known about sex differences in
plants, particularly the extent of geographical variation in sexual dimorphism
and its life-cycle dynamics. Here, we investigate patterns of genetically-based
sexual dimorphism in vegetative and reproductive traits of a wind-pollinated dioecious
plant, Rumex hastatulus, across three life-cycle stages using open-pollinated
families from 30 populations spanning the geographic range and chromosomal variation
(XY and XY1Y2) of the species. The direction and degree of sexual dimorphism was
highly variable among populations and life-cycle stages. Sex-specific differences
in reproductive function explained a significant amount of temporal change in
sexual dimorphism. For several traits, geographical variation in sexual dimorphism
was associated with bioclimatic parameters, likely due to the differential responses
of the sexes to climate. We found no systematic differences in sexual dimorphism
between chromosome races. Sex-specific trait differences in dioecious plants largely
result from a balance between sexual and natural selection on resource allocation.
Our results indicate that abiotic factors associated with geographical context
also play a role in modifying sexual dimorphism during the plant life cycle.
article_processing_charge: No
author:
- first_name: Gemma
full_name: Puixeu Sala, Gemma
id: 33AB266C-F248-11E8-B48F-1D18A9856A87
last_name: Puixeu Sala
orcid: 0000-0001-8330-1754
- first_name: Melinda
full_name: Pickup, Melinda
id: 2C78037E-F248-11E8-B48F-1D18A9856A87
last_name: Pickup
orcid: 0000-0001-6118-0541
- first_name: David
full_name: Field, David
last_name: Field
- first_name: Spencer C.H.
full_name: Barrett, Spencer C.H.
last_name: Barrett
citation:
ama: 'Puixeu Sala G, Pickup M, Field D, Barrett SCH. Data from: Variation in sexual
dimorphism in a wind-pollinated plant: the influence of geographical context and
life-cycle dynamics. 2019. doi:10.5061/dryad.n1701c9'
apa: 'Puixeu Sala, G., Pickup, M., Field, D., & Barrett, S. C. H. (2019). Data
from: Variation in sexual dimorphism in a wind-pollinated plant: the influence
of geographical context and life-cycle dynamics. Dryad. https://doi.org/10.5061/dryad.n1701c9'
chicago: 'Puixeu Sala, Gemma, Melinda Pickup, David Field, and Spencer C.H. Barrett.
“Data from: Variation in Sexual Dimorphism in a Wind-Pollinated Plant: The Influence
of Geographical Context and Life-Cycle Dynamics.” Dryad, 2019. https://doi.org/10.5061/dryad.n1701c9.'
ieee: 'G. Puixeu Sala, M. Pickup, D. Field, and S. C. H. Barrett, “Data from: Variation
in sexual dimorphism in a wind-pollinated plant: the influence of geographical
context and life-cycle dynamics.” Dryad, 2019.'
ista: 'Puixeu Sala G, Pickup M, Field D, Barrett SCH. 2019. Data from: Variation
in sexual dimorphism in a wind-pollinated plant: the influence of geographical
context and life-cycle dynamics, Dryad, 10.5061/dryad.n1701c9.'
mla: 'Puixeu Sala, Gemma, et al. Data from: Variation in Sexual Dimorphism in
a Wind-Pollinated Plant: The Influence of Geographical Context and Life-Cycle
Dynamics. Dryad, 2019, doi:10.5061/dryad.n1701c9.'
short: G. Puixeu Sala, M. Pickup, D. Field, S.C.H. Barrett, (2019).
date_created: 2021-08-06T11:48:42Z
date_published: 2019-07-22T00:00:00Z
date_updated: 2026-04-07T13:25:33Z
day: '22'
department:
- _id: NiBa
- _id: BeVi
doi: 10.5061/dryad.n1701c9
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.n1701c9
month: '07'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '6831'
relation: used_in_publication
status: public
- id: '14058'
relation: used_in_publication
status: public
status: public
title: 'Data from: Variation in sexual dimorphism in a wind-pollinated plant: the
influence of geographical context and life-cycle dynamics'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2019'
...
---
_id: '6590'
abstract:
- lang: eng
text: 'Modern machine learning methods often require more data for training than
a single expert can provide. Therefore, it has become a standard procedure to
collect data from external sources, e.g. via crowdsourcing. Unfortunately, the
quality of these sources is not always guaranteed. As additional complications,
the data might be stored in a distributed way, or might even have to remain private.
In this work, we address the question of how to learn robustly in such scenarios.
Studying the problem through the lens of statistical learning theory, we derive
a procedure that allows for learning from all available sources, yet automatically
suppresses irrelevant or corrupted data. We show by extensive experiments that
our method provides significant improvements over alternative approaches from
robust statistics and distributed optimization. '
article_processing_charge: No
arxiv: 1
author:
- first_name: Nikola H
full_name: Konstantinov, Nikola H
id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87
last_name: Konstantinov
orcid: 0009-0009-5204-7621
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Konstantinov NH, Lampert C. Robust learning from untrusted sources. In: Proceedings
of the 36th International Conference on Machine Learning. Vol 97. ML Research
Press; 2019:3488-3498.'
apa: 'Konstantinov, N. H., & Lampert, C. (2019). Robust learning from untrusted
sources. In Proceedings of the 36th International Conference on Machine Learning
(Vol. 97, pp. 3488–3498). Long Beach, CA, USA: ML Research Press.'
chicago: Konstantinov, Nikola H, and Christoph Lampert. “Robust Learning from Untrusted
Sources.” In Proceedings of the 36th International Conference on Machine Learning,
97:3488–98. ML Research Press, 2019.
ieee: N. H. Konstantinov and C. Lampert, “Robust learning from untrusted sources,”
in Proceedings of the 36th International Conference on Machine Learning,
Long Beach, CA, USA, 2019, vol. 97, pp. 3488–3498.
ista: 'Konstantinov NH, Lampert C. 2019. Robust learning from untrusted sources.
Proceedings of the 36th International Conference on Machine Learning. ICML: International
Conference on Machine Learning vol. 97, 3488–3498.'
mla: Konstantinov, Nikola H., and Christoph Lampert. “Robust Learning from Untrusted
Sources.” Proceedings of the 36th International Conference on Machine Learning,
vol. 97, ML Research Press, 2019, pp. 3488–98.
short: N.H. Konstantinov, C. Lampert, in:, Proceedings of the 36th International
Conference on Machine Learning, ML Research Press, 2019, pp. 3488–3498.
conference:
end_date: 2919-06-15
location: Long Beach, CA, USA
name: 'ICML: International Conference on Machine Learning'
start_date: 2019-06-10
date_created: 2019-06-27T14:18:23Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2026-04-07T14:19:48Z
day: '01'
department:
- _id: ChLa
ec_funded: 1
external_id:
arxiv:
- '1901.10310'
intvolume: ' 97'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1901.10310
month: '06'
oa: 1
oa_version: Preprint
page: 3488-3498
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Proceedings of the 36th International Conference on Machine Learning
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
related_material:
record:
- id: '10799'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Robust learning from untrusted sources
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 97
year: '2019'
...
---
OA_place: publisher
OA_type: hybrid
_id: '10190'
abstract:
- lang: eng
text: 'The verification of concurrent programs remains an open challenge, as thread
interaction has to be accounted for, which leads to state-space explosion. Stateless
model checking battles this problem by exploring traces rather than states of
the program. As there are exponentially many traces, dynamic partial-order reduction
(DPOR) techniques are used to partition the trace space into equivalence classes,
and explore a few representatives from each class. The standard equivalence that
underlies most DPOR techniques is the happens-before equivalence, however recent
works have spawned a vivid interest towards coarser equivalences. The efficiency
of such approaches is a product of two parameters: (i) the size of the partitioning
induced by the equivalence, and (ii) the time spent by the exploration algorithm
in each class of the partitioning. In this work, we present a new equivalence,
called value-happens-before and show that it has two appealing features. First,
value-happens-before is always at least as coarse as the happens-before equivalence,
and can be even exponentially coarser. Second, the value-happens-before partitioning
is efficiently explorable when the number of threads is bounded. We present an
algorithm called value-centric DPOR (VCDPOR), which explores the underlying partitioning
using polynomial time per class. Finally, we perform an experimental evaluation
of VCDPOR on various benchmarks, and compare it against other state-of-the-art
approaches. Our results show that value-happens-before typically induces a significant
reduction in the size of the underlying partitioning, which leads to a considerable
reduction in the running time for exploring the whole partitioning.'
acknowledgement: "The authors would also like to thank anonymous referees for their
valuable comments and helpful suggestions. This work is supported by the Austrian
Science Fund (FWF) NFN grants S11407-N23 (RiSE/SHiNE) and S11402-N23 (RiSE/SHiNE),
by the Vienna Science and Technology Fund (WWTF) Project ICT15-003, and by the Austrian
Science Fund (FWF) Schrodinger grant J-4220.\r\n"
article_number: '124'
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: 'Chatterjee K, Pavlogiannis A, Toman V. Value-centric dynamic partial order
reduction. In: Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications. Vol 3. ACM; 2019. doi:10.1145/3360550'
apa: 'Chatterjee, K., Pavlogiannis, A., & Toman, V. (2019). Value-centric dynamic
partial order reduction. In Proceedings of the 34th ACM International Conference
on Object-Oriented Programming, Systems, Languages, and Applications (Vol.
3). Athens, Greece: ACM. https://doi.org/10.1145/3360550'
chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric
Dynamic Partial Order Reduction.” In Proceedings of the 34th ACM International
Conference on Object-Oriented Programming, Systems, Languages, and Applications,
Vol. 3. ACM, 2019. https://doi.org/10.1145/3360550.
ieee: K. Chatterjee, A. Pavlogiannis, and V. Toman, “Value-centric dynamic partial
order reduction,” in Proceedings of the 34th ACM International Conference on
Object-Oriented Programming, Systems, Languages, and Applications, Athens,
Greece, 2019, vol. 3.
ista: 'Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial
order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming,
Systems, Languages and Applications vol. 3, 124.'
mla: Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.”
Proceedings of the 34th ACM International Conference on Object-Oriented Programming,
Systems, Languages, and Applications, vol. 3, 124, ACM, 2019, doi:10.1145/3360550.
short: K. Chatterjee, A. Pavlogiannis, V. Toman, in:, Proceedings of the 34th ACM
International Conference on Object-Oriented Programming, Systems, Languages, and
Applications, ACM, 2019.
conference:
end_date: 2019-10-25
location: Athens, Greece
name: 'OOPSLA: Object-oriented Programming, Systems, Languages and Applications'
start_date: 2019-10-23
corr_author: '1'
date_created: 2021-10-27T14:57:06Z
date_published: 2019-10-10T00:00:00Z
date_updated: 2026-04-08T07:00:31Z
day: '10'
ddc:
- '000'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1145/3360550
external_id:
arxiv:
- '1909.00989'
file:
- access_level: open_access
checksum: 2149979c46964c4d117af06ccb6c0834
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-12T11:41:56Z
date_updated: 2021-11-12T11:41:56Z
file_id: '10278'
file_name: 2019_ACM_Chatterjee.pdf
file_size: 570829
relation: main_file
success: 1
file_date_updated: 2021-11-12T11:41:56Z
has_accepted_license: '1'
intvolume: ' 3'
keyword:
- safety
- risk
- reliability and quality
- software
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication: Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '10199'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Value-centric dynamic partial order reduction
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: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2019'
...
---
_id: '6673'
abstract:
- lang: eng
text: Several classic problems in graph processing and computational geometry are
solved via incremental algorithms, which split computation into a series of small
tasks acting on shared state, which gets updated progressively. While the sequential
variant of such algorithms usually specifies a fixed (but sometimes random) order
in which the tasks should be performed, a standard approach to parallelizing such
algorithms is to relax this constraint to allow for out-of-order parallel execution.
This is the case for parallel implementations of Dijkstra's single-source shortest-paths
(SSSP) algorithm, and for parallel Delaunay mesh triangulation. While many software
frameworks parallelize incremental computation in this way, it is still not well
understood whether this relaxed ordering approach can still provide any complexity
guarantees. In this paper, we address this problem, and analyze the efficiency
guarantees provided by a range of incremental algorithms when parallelized via
relaxed schedulers. We show that, for algorithms such as Delaunay mesh triangulation
and sorting by insertion, schedulers with a maximum relaxation factor of k in
terms of the maximum priority inversion allowed will introduce a maximum amount
of wasted work of O(łog n poly(k)), where n is the number of tasks to be executed.
For SSSP, we show that the additional work is O(poly(k), dmax / wmin), where dmax
is the maximum distance between two nodes, and wmin is the minimum such distance.
In practical settings where n >> k, this suggests that the overheads of relaxation
will be outweighed by the improved scalability of the relaxed scheduler. On the
negative side, we provide lower bounds showing that certain algorithms will inherently
incur a non-trivial amount of wasted work due to scheduler relaxation, even for
relatively benign relaxed schedulers.
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
orcid: 0000-0001-5634-0731
- first_name: Nikita
full_name: Koval, Nikita
id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87
last_name: Koval
citation:
ama: 'Alistarh D-A, Nadiradze G, Koval N. Efficiency guarantees for parallel incremental
algorithms under relaxed schedulers. In: 31st ACM Symposium on Parallelism
in Algorithms and Architectures. ACM; 2019:145-154. doi:10.1145/3323165.3323201'
apa: 'Alistarh, D.-A., Nadiradze, G., & Koval, N. (2019). Efficiency guarantees
for parallel incremental algorithms under relaxed schedulers. In 31st ACM Symposium
on Parallelism in Algorithms and Architectures (pp. 145–154). Phoenix, AZ,
United States: ACM. https://doi.org/10.1145/3323165.3323201'
chicago: Alistarh, Dan-Adrian, Giorgi Nadiradze, and Nikita Koval. “Efficiency Guarantees
for Parallel Incremental Algorithms under Relaxed Schedulers.” In 31st ACM
Symposium on Parallelism in Algorithms and Architectures, 145–54. ACM, 2019.
https://doi.org/10.1145/3323165.3323201.
ieee: D.-A. Alistarh, G. Nadiradze, and N. Koval, “Efficiency guarantees for parallel
incremental algorithms under relaxed schedulers,” in 31st ACM Symposium on
Parallelism in Algorithms and Architectures, Phoenix, AZ, United States, 2019,
pp. 145–154.
ista: 'Alistarh D-A, Nadiradze G, Koval N. 2019. Efficiency guarantees for parallel
incremental algorithms under relaxed schedulers. 31st ACM Symposium on Parallelism
in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms
and Architectures, 145–154.'
mla: Alistarh, Dan-Adrian, et al. “Efficiency Guarantees for Parallel Incremental
Algorithms under Relaxed Schedulers.” 31st ACM Symposium on Parallelism in
Algorithms and Architectures, ACM, 2019, pp. 145–54, doi:10.1145/3323165.3323201.
short: D.-A. Alistarh, G. Nadiradze, N. Koval, in:, 31st ACM Symposium on Parallelism
in Algorithms and Architectures, ACM, 2019, pp. 145–154.
conference:
end_date: 2019-06-24
location: Phoenix, AZ, United States
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
start_date: 2019-06-22
date_created: 2019-07-24T08:59:36Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2026-04-08T07:00:45Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3323165.3323201
ec_funded: 1
external_id:
arxiv:
- '2003.09363'
isi:
- '000507618500018'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2003.09363
month: '06'
oa: 1
oa_version: Preprint
page: 145-154
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 31st ACM Symposium on Parallelism in Algorithms and Architectures
publication_identifier:
isbn:
- '9781450361842'
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '10429'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Efficiency guarantees for parallel incremental algorithms under relaxed schedulers
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '7479'
abstract:
- lang: eng
text: "Multi-exit architectures, in which a stack of processing layers is interleaved
with early output layers, allow the processing of a test example to stop early
and thus save computation time and/or energy. In this work, we propose a new
training procedure for multi-exit architectures based on the principle of knowledge
distillation. The method encourage searly exits to mimic later, more accurate
exits, by matching their output probabilities.\r\nExperiments on CIFAR100 and
\ ImageNet show that distillation-based training significantly improves the
accuracy of early exits while maintaining state-of-the-art accuracy for late
\ ones. The method is particularly beneficial when training data is limited
\ and it allows a straightforward extension to semi-supervised learning,i.e.
making use of unlabeled data at training time. Moreover, it takes only afew lines
to implement and incurs almost no computational overhead at training time, and
none at all at test time."
article_processing_charge: No
author:
- first_name: Phuong
full_name: Bui Thi Mai, Phuong
id: 3EC6EE64-F248-11E8-B48F-1D18A9856A87
last_name: Bui Thi Mai
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Phuong M, Lampert C. Distillation-based training for multi-exit architectures.
In: IEEE International Conference on Computer Vision. Vol 2019-October.
IEEE; 2019:1355-1364. doi:10.1109/ICCV.2019.00144'
apa: 'Phuong, M., & Lampert, C. (2019). Distillation-based training for multi-exit
architectures. In IEEE International Conference on Computer Vision (Vol.
2019–October, pp. 1355–1364). Seoul, Korea: IEEE. https://doi.org/10.1109/ICCV.2019.00144'
chicago: Phuong, Mary, and Christoph Lampert. “Distillation-Based Training for Multi-Exit
Architectures.” In IEEE International Conference on Computer Vision, 2019–October:1355–64.
IEEE, 2019. https://doi.org/10.1109/ICCV.2019.00144.
ieee: M. Phuong and C. Lampert, “Distillation-based training for multi-exit architectures,”
in IEEE International Conference on Computer Vision, Seoul, Korea, 2019,
vol. 2019–October, pp. 1355–1364.
ista: 'Phuong M, Lampert C. 2019. Distillation-based training for multi-exit architectures.
IEEE International Conference on Computer Vision. ICCV: International Conference
on Computer Vision vol. 2019–October, 1355–1364.'
mla: Phuong, Mary, and Christoph Lampert. “Distillation-Based Training for Multi-Exit
Architectures.” IEEE International Conference on Computer Vision, vol.
2019–October, IEEE, 2019, pp. 1355–64, doi:10.1109/ICCV.2019.00144.
short: M. Phuong, C. Lampert, in:, IEEE International Conference on Computer Vision,
IEEE, 2019, pp. 1355–1364.
conference:
end_date: 2019-11-02
location: Seoul, Korea
name: 'ICCV: International Conference on Computer Vision'
start_date: 2019-10-27
date_created: 2020-02-11T09:06:57Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2026-04-08T07:01:16Z
day: '01'
ddc:
- '000'
department:
- _id: ChLa
doi: 10.1109/ICCV.2019.00144
ec_funded: 1
external_id:
isi:
- '000531438101047'
file:
- access_level: open_access
checksum: 7b77fb5c2d27c4c37a7612ba46a66117
content_type: application/pdf
creator: bphuong
date_created: 2020-02-11T09:06:39Z
date_updated: 2020-07-14T12:47:59Z
file_id: '7480'
file_name: main.pdf
file_size: 735768
relation: main_file
file_date_updated: 2020-07-14T12:47:59Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 1355-1364
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: IEEE International Conference on Computer Vision
publication_identifier:
isbn:
- '9781728148038'
issn:
- 1550-5499
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '9418'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Distillation-based training for multi-exit architectures
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2019-October
year: '2019'
...
---
_id: '6556'
abstract:
- lang: eng
text: 'Motivated by fixed-parameter tractable (FPT) problems in computational topology,
we consider the treewidth tw(M) of a compact, connected 3-manifold M, defined
to be the minimum treewidth of the face pairing graph of any triangulation T of
M. In this setting the relationship between the topology of a 3-manifold and its
treewidth is of particular interest. First, as a corollary of work of Jaco and
Rubinstein, we prove that for any closed, orientable 3-manifold M the treewidth
tw(M) is at most 4g(M)-2, where g(M) denotes Heegaard genus of M. In combination
with our earlier work with Wagner, this yields that for non-Haken manifolds the
Heegaard genus and the treewidth are within a constant factor. Second, we characterize
all 3-manifolds of treewidth one: These are precisely the lens spaces and a single
other Seifert fibered space. Furthermore, we show that all remaining orientable
Seifert fibered spaces over the 2-sphere or a non-orientable surface have treewidth
two. In particular, for every spherical 3-manifold we exhibit a triangulation
of treewidth at most two. Our results further validate the parameter of treewidth
(and other related parameters such as cutwidth or congestion) to be useful for
topological computing, and also shed more light on the scope of existing FPT-algorithms
in the field.'
alternative_title:
- LIPIcs
article_processing_charge: No
arxiv: 1
author:
- first_name: Kristóf
full_name: Huszár, Kristóf
id: 33C26278-F248-11E8-B48F-1D18A9856A87
last_name: Huszár
orcid: 0000-0002-5445-5057
- first_name: Jonathan
full_name: Spreer, Jonathan
last_name: Spreer
citation:
ama: 'Huszár K, Spreer J. 3-manifold triangulations with small treewidth. In: 35th
International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2019:44:1-44:20. doi:10.4230/LIPIcs.SoCG.2019.44'
apa: 'Huszár, K., & Spreer, J. (2019). 3-manifold triangulations with small
treewidth. In 35th International Symposium on Computational Geometry (Vol.
129, p. 44:1-44:20). Portland, Oregon, United States: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2019.44'
chicago: Huszár, Kristóf, and Jonathan Spreer. “3-Manifold Triangulations with Small
Treewidth.” In 35th International Symposium on Computational Geometry,
129:44:1-44:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPIcs.SoCG.2019.44.
ieee: K. Huszár and J. Spreer, “3-manifold triangulations with small treewidth,”
in 35th International Symposium on Computational Geometry, Portland, Oregon,
United States, 2019, vol. 129, p. 44:1-44:20.
ista: 'Huszár K, Spreer J. 2019. 3-manifold triangulations with small treewidth.
35th International Symposium on Computational Geometry. SoCG: Symposium on Computational
Geometry, LIPIcs, vol. 129, 44:1-44:20.'
mla: Huszár, Kristóf, and Jonathan Spreer. “3-Manifold Triangulations with Small
Treewidth.” 35th International Symposium on Computational Geometry, vol.
129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 44:1-44:20, doi:10.4230/LIPIcs.SoCG.2019.44.
short: K. Huszár, J. Spreer, in:, 35th International Symposium on Computational
Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 44:1-44:20.
conference:
end_date: 2019-06-21
location: Portland, Oregon, United States
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2019-06-18
corr_author: '1'
date_created: 2019-06-11T20:09:57Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2026-04-08T07:21:27Z
day: '01'
ddc:
- '516'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2019.44
external_id:
arxiv:
- '1812.05528'
file:
- access_level: open_access
checksum: 29d18c435368468aa85823dabb157e43
content_type: application/pdf
creator: kschuh
date_created: 2019-06-12T06:45:33Z
date_updated: 2020-07-14T12:47:33Z
file_id: '6557'
file_name: 2019_LIPIcs-Huszar.pdf
file_size: 905885
relation: main_file
file_date_updated: 2020-07-14T12:47:33Z
has_accepted_license: '1'
intvolume: ' 129'
keyword:
- computational 3-manifold topology
- fixed-parameter tractability
- layered triangulations
- structural graph theory
- treewidth
- cutwidth
- Heegaard genus
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 44:1-44:20
publication: 35th International Symposium on Computational Geometry
publication_identifier:
isbn:
- 978-3-95977-104-7
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '8032'
relation: part_of_dissertation
status: public
scopus_import: '1'
status: public
title: 3-manifold triangulations with small treewidth
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: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 129
year: '2019'
...
---
_id: '5986'
abstract:
- lang: eng
text: "Given a triangulation of a point set in the plane, a flip deletes an edge
e whose removal leaves a convex quadrilateral, and replaces e by the opposite
diagonal of the quadrilateral. It is well known that any triangulation of a point
set can be reconfigured to any other triangulation by some sequence of flips.
We explore this question in the setting where each edge of a triangulation has
a label, and a flip transfers the label of the removed edge to the new edge. It
is not true that every labelled triangulation of a point set can be reconfigured
to every other labelled triangulation via a sequence of flips, but we characterize
when this is possible. There is an obvious necessary condition: for each label
l, if edge e has label l in the first triangulation and edge f has label l in
the second triangulation, then there must be some sequence of flips that moves
label l from e to f, ignoring all other labels. Bose, Lubiw, Pathak and Verdonschot
formulated the Orbit Conjecture, which states that this necessary condition is
also sufficient, i.e. that all labels can be simultaneously mapped to their destination
if and only if each label individually can be mapped to its destination. We prove
this conjecture. Furthermore, we give a polynomial-time algorithm (with \U0001D442(\U0001D45B8)
being a crude bound on the run-time) to find a sequence of flips to reconfigure
one labelled triangulation to another, if such a sequence exists, and we prove
an upper bound of \U0001D442(\U0001D45B7) on the length of the flip sequence.
Our proof uses the topological result that the sets of pairwise non-crossing edges
on a planar point set form a simplicial complex that is homeomorphic to a high-dimensional
ball (this follows from a result of Orden and Santos; we give a different proof
based on a shelling argument). The dual cell complex of this simplicial ball,
called the flip complex, has the usual flip graph as its 1-skeleton. We use properties
of the 2-skeleton of the flip complex to prove the Orbit Conjecture."
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Anna
full_name: Lubiw, Anna
last_name: Lubiw
- first_name: Zuzana
full_name: Masárová, Zuzana
id: 45CFE238-F248-11E8-B48F-1D18A9856A87
last_name: Masárová
orcid: 0000-0002-6660-1322
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping
edge-labelled triangulations. Discrete & Computational Geometry. 2019;61(4):880-898.
doi:10.1007/s00454-018-0035-8
apa: Lubiw, A., Masárová, Z., & Wagner, U. (2019). A proof of the orbit conjecture
for flipping edge-labelled triangulations. Discrete & Computational Geometry.
Springer Nature. https://doi.org/10.1007/s00454-018-0035-8
chicago: Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture
for Flipping Edge-Labelled Triangulations.” Discrete & Computational Geometry.
Springer Nature, 2019. https://doi.org/10.1007/s00454-018-0035-8.
ieee: A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for
flipping edge-labelled triangulations,” Discrete & Computational Geometry,
vol. 61, no. 4. Springer Nature, pp. 880–898, 2019.
ista: Lubiw A, Masárová Z, Wagner U. 2019. A proof of the orbit conjecture for flipping
edge-labelled triangulations. Discrete & Computational Geometry. 61(4), 880–898.
mla: Lubiw, Anna, et al. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled
Triangulations.” Discrete & Computational Geometry, vol. 61, no. 4,
Springer Nature, 2019, pp. 880–98, doi:10.1007/s00454-018-0035-8.
short: A. Lubiw, Z. Masárová, U. Wagner, Discrete & Computational Geometry 61
(2019) 880–898.
corr_author: '1'
date_created: 2019-02-14T11:54:08Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2026-04-08T07:23:01Z
day: '01'
ddc:
- '000'
department:
- _id: UlWa
doi: 10.1007/s00454-018-0035-8
external_id:
arxiv:
- '1710.02741'
isi:
- '000466130000009'
file:
- access_level: open_access
checksum: e1bff88f1d77001b53b78c485ce048d7
content_type: application/pdf
creator: dernst
date_created: 2019-02-14T11:57:22Z
date_updated: 2020-07-14T12:47:14Z
file_id: '5988'
file_name: 2018_DiscreteGeometry_Lubiw.pdf
file_size: 556276
relation: main_file
file_date_updated: 2020-07-14T12:47:14Z
has_accepted_license: '1'
intvolume: ' 61'
isi: 1
issue: '4'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 880-898
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '683'
relation: earlier_version
status: public
- id: '7944'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: A proof of the orbit conjecture for flipping edge-labelled triangulations
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 61
year: '2019'
...
---
_id: '7093'
abstract:
- lang: eng
text: "In graph theory, as well as in 3-manifold topology, there exist several width-type
parameters to describe how \"simple\" or \"thin\" a given graph or 3-manifold
is. These parameters, such as pathwidth or treewidth for graphs, or the concept
of thin position for 3-manifolds, play an important role when studying algorithmic
problems; in particular, there is a variety of problems in computational 3-manifold
topology - some of them known to be computationally hard in general - that become
solvable in polynomial time as soon as the dual graph of the input triangulation
has bounded treewidth.\r\nIn view of these algorithmic results, it is natural
to ask whether every 3-manifold admits a triangulation of bounded treewidth. We
show that this is not the case, i.e., that there exists an infinite family of
closed 3-manifolds not admitting triangulations of bounded pathwidth or treewidth
(the latter implies the former, but we present two separate proofs).\r\nWe derive
these results from work of Agol, of Scharlemann and Thompson, and of Scharlemann,
Schultens and Saito by exhibiting explicit connections between the topology of
a 3-manifold M on the one hand and width-type parameters of the dual graphs of
triangulations of M on the other hand, answering a question that had been raised
repeatedly by researchers in computational 3-manifold topology. In particular,
we show that if a closed, orientable, irreducible, non-Haken 3-manifold M has
a triangulation of treewidth (resp. pathwidth) k then the Heegaard genus of M
is at most 18(k+1) (resp. 4(3k+1))."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Kristóf
full_name: Huszár, Kristóf
id: 33C26278-F248-11E8-B48F-1D18A9856A87
last_name: Huszár
orcid: 0000-0002-5445-5057
- first_name: Jonathan
full_name: Spreer, Jonathan
last_name: Spreer
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Huszár K, Spreer J, Wagner U. On the treewidth of triangulated 3-manifolds.
Journal of Computational Geometry. 2019;10(2):70–98. doi:10.20382/JOGC.V10I2A5
apa: Huszár, K., Spreer, J., & Wagner, U. (2019). On the treewidth of triangulated
3-manifolds. Journal of Computational Geometry. Computational Geometry
Laborartoy. https://doi.org/10.20382/JOGC.V10I2A5
chicago: Huszár, Kristóf, Jonathan Spreer, and Uli Wagner. “On the Treewidth of
Triangulated 3-Manifolds.” Journal of Computational Geometry. Computational
Geometry Laborartoy, 2019. https://doi.org/10.20382/JOGC.V10I2A5.
ieee: K. Huszár, J. Spreer, and U. Wagner, “On the treewidth of triangulated 3-manifolds,”
Journal of Computational Geometry, vol. 10, no. 2. Computational Geometry
Laborartoy, pp. 70–98, 2019.
ista: Huszár K, Spreer J, Wagner U. 2019. On the treewidth of triangulated 3-manifolds.
Journal of Computational Geometry. 10(2), 70–98.
mla: Huszár, Kristóf, et al. “On the Treewidth of Triangulated 3-Manifolds.” Journal
of Computational Geometry, vol. 10, no. 2, Computational Geometry Laborartoy,
2019, pp. 70–98, doi:10.20382/JOGC.V10I2A5.
short: K. Huszár, J. Spreer, U. Wagner, Journal of Computational Geometry 10 (2019)
70–98.
date_created: 2019-11-23T12:14:09Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2026-04-08T07:21:27Z
day: '01'
ddc:
- '514'
department:
- _id: UlWa
doi: 10.20382/JOGC.V10I2A5
external_id:
arxiv:
- '1712.00434'
file:
- access_level: open_access
checksum: c872d590d38d538404782bca20c4c3f5
content_type: application/pdf
creator: khuszar
date_created: 2019-11-23T12:35:16Z
date_updated: 2020-07-14T12:47:49Z
file_id: '7094'
file_name: 479-1917-1-PB.pdf
file_size: 857590
relation: main_file
file_date_updated: 2020-07-14T12:47:49Z
has_accepted_license: '1'
intvolume: ' 10'
issue: '2'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 70–98
publication: Journal of Computational Geometry
publication_identifier:
issn:
- 1920-180X
publication_status: published
publisher: Computational Geometry Laborartoy
quality_controlled: '1'
related_material:
record:
- id: '285'
relation: earlier_version
status: public
- id: '8032'
relation: part_of_dissertation
status: public
scopus_import: '1'
status: public
title: On the treewidth of triangulated 3-manifolds
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10
year: '2019'
...
---
_id: '7950'
abstract:
- lang: eng
text: "The input to the token swapping problem is a graph with vertices v1, v2,
. . . , vn, and n tokens with labels 1,2, . . . , n, one on each vertex. The
goal is to get token i to vertex vi for all i= 1, . . . , n using a minimum number
of swaps, where a swap exchanges the tokens on the endpoints of an edge.Token
swapping on a tree, also known as “sorting with a transposition tree,” is not
known to be in P nor NP-complete. We present some partial results:\r\n1. An
optimum swap sequence may need to perform a swap on a leaf vertex that has the
correct token (a “happy leaf”), disproving a conjecture of Vaughan.\r\n2. Any
algorithm that fixes happy leaves—as all known approximation algorithms for the
problem do—has approximation factor at least 4/3. Furthermore, the two best-known
2-approximation algorithms have approximation factor exactly 2.\r\n3. A generalized
problem—weighted coloured token swapping—is NP-complete on trees, but solvable
in polynomial time on paths and stars. In this version, tokens and vertices
\ have colours, and colours have weights. The goal is to get every
token to a vertex of the same colour, and the cost of a swap is the sum of the
weights of the two tokens involved."
article_number: '1903.06981'
article_processing_charge: No
arxiv: 1
author:
- first_name: Ahmad
full_name: Biniaz, Ahmad
last_name: Biniaz
- first_name: Kshitij
full_name: Jain, Kshitij
last_name: Jain
- first_name: Anna
full_name: Lubiw, Anna
last_name: Lubiw
- first_name: Zuzana
full_name: Masárová, Zuzana
id: 45CFE238-F248-11E8-B48F-1D18A9856A87
last_name: Masárová
orcid: 0000-0002-6660-1322
- first_name: Tillmann
full_name: Miltzow, Tillmann
last_name: Miltzow
- first_name: Debajyoti
full_name: Mondal, Debajyoti
last_name: Mondal
- first_name: Anurag Murty
full_name: Naredla, Anurag Murty
last_name: Naredla
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Alexi
full_name: Turcotte, Alexi
last_name: Turcotte
citation:
ama: Biniaz A, Jain K, Lubiw A, et al. Token swapping on trees. arXiv. doi:10.48550/arXiv.1903.06981
apa: Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., … Turcotte,
A. (n.d.). Token swapping on trees. arXiv. https://doi.org/10.48550/arXiv.1903.06981
chicago: Biniaz, Ahmad, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow,
Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, and Alexi Turcotte. “Token
Swapping on Trees.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1903.06981.
ieee: A. Biniaz et al., “Token swapping on trees,” arXiv. .
ista: Biniaz A, Jain K, Lubiw A, Masárová Z, Miltzow T, Mondal D, Naredla AM, Tkadlec
J, Turcotte A. Token swapping on trees. arXiv, 1903.06981.
mla: Biniaz, Ahmad, et al. “Token Swapping on Trees.” ArXiv, 1903.06981,
doi:10.48550/arXiv.1903.06981.
short: A. Biniaz, K. Jain, A. Lubiw, Z. Masárová, T. Miltzow, D. Mondal, A.M. Naredla,
J. Tkadlec, A. Turcotte, ArXiv (n.d.).
date_created: 2020-06-08T12:25:25Z
date_published: 2019-03-16T00:00:00Z
date_updated: 2026-04-08T07:23:00Z
day: '16'
department:
- _id: HeEd
- _id: UlWa
- _id: KrCh
doi: 10.48550/arXiv.1903.06981
external_id:
arxiv:
- '1903.06981'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1903.06981
month: '03'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
record:
- id: '12833'
relation: later_version
status: public
- id: '7944'
relation: dissertation_contains
status: public
status: public
title: Token swapping on trees
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '6608'
abstract:
- lang: eng
text: We use the canonical bases produced by the tri-partition algorithm in (Edelsbrunner
and Ölsböck, 2018) to open and close holes in a polyhedral complex, K. In a concrete
application, we consider the Delaunay mosaic of a finite set, we let K be an Alpha
complex, and we use the persistence diagram of the distance function to guide
the hole opening and closing operations. The dependences between the holes define
a partial order on the cells in K that characterizes what can and what cannot
be constructed using the operations. The relations in this partial order reveal
structural information about the underlying filtration of complexes beyond what
is expressed by the persistence diagram.
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Katharina
full_name: Ölsböck, Katharina
id: 4D4AA390-F248-11E8-B48F-1D18A9856A87
last_name: Ölsböck
orcid: 0000-0002-4672-8297
citation:
ama: Edelsbrunner H, Ölsböck K. Holes and dependences in an ordered complex. Computer
Aided Geometric Design. 2019;73:1-15. doi:10.1016/j.cagd.2019.06.003
apa: Edelsbrunner, H., & Ölsböck, K. (2019). Holes and dependences in an ordered
complex. Computer Aided Geometric Design. Elsevier. https://doi.org/10.1016/j.cagd.2019.06.003
chicago: Edelsbrunner, Herbert, and Katharina Ölsböck. “Holes and Dependences in
an Ordered Complex.” Computer Aided Geometric Design. Elsevier, 2019. https://doi.org/10.1016/j.cagd.2019.06.003.
ieee: H. Edelsbrunner and K. Ölsböck, “Holes and dependences in an ordered complex,”
Computer Aided Geometric Design, vol. 73. Elsevier, pp. 1–15, 2019.
ista: Edelsbrunner H, Ölsböck K. 2019. Holes and dependences in an ordered complex.
Computer Aided Geometric Design. 73, 1–15.
mla: Edelsbrunner, Herbert, and Katharina Ölsböck. “Holes and Dependences in an
Ordered Complex.” Computer Aided Geometric Design, vol. 73, Elsevier, 2019,
pp. 1–15, doi:10.1016/j.cagd.2019.06.003.
short: H. Edelsbrunner, K. Ölsböck, Computer Aided Geometric Design 73 (2019) 1–15.
date_created: 2019-07-07T21:59:20Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2026-04-08T07:23:21Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1016/j.cagd.2019.06.003
ec_funded: 1
external_id:
isi:
- '000485207800001'
file:
- access_level: open_access
checksum: 7c99be505dc7533257d42eb1830cef04
content_type: application/pdf
creator: kschuh
date_created: 2019-07-08T15:24:26Z
date_updated: 2020-07-14T12:47:34Z
file_id: '6624'
file_name: Elsevier_2019_Edelsbrunner.pdf
file_size: 2665013
relation: main_file
file_date_updated: 2020-07-14T12:47:34Z
has_accepted_license: '1'
intvolume: ' 73'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: 1-15
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication: Computer Aided Geometric Design
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '7460'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Holes and dependences in an ordered complex
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 73
year: '2019'
...