---
_id: '10071'
alternative_title:
- Early Career
article_processing_charge: No
article_type: letter_note
author:
- first_name: Henry
full_name: Adams, Henry
last_name: Adams
- first_name: Hana
full_name: Kourimska, Hana
id: D9B8E14C-3C26-11EA-98F5-1F833DDC885E
last_name: Kourimska
- first_name: Teresa
full_name: Heiss, Teresa
id: 4879BB4E-F248-11E8-B48F-1D18A9856A87
last_name: Heiss
orcid: 0000-0002-1780-2689
- first_name: Sarah
full_name: Percival, Sarah
last_name: Percival
- first_name: Lori
full_name: Ziegelmeier, Lori
last_name: Ziegelmeier
citation:
ama: Adams H, Kourimska H, Heiss T, Percival S, Ziegelmeier L. How to tutorial-a-thon.
Notices of the American Mathematical Society. 2021;68(9):1511-1514. doi:10.1090/noti2349
apa: Adams, H., Kourimska, H., Heiss, T., Percival, S., & Ziegelmeier, L. (2021).
How to tutorial-a-thon. Notices of the American Mathematical Society. American
Mathematical Society. https://doi.org/10.1090/noti2349
chicago: Adams, Henry, Hana Kourimska, Teresa Heiss, Sarah Percival, and Lori Ziegelmeier.
“How to Tutorial-a-Thon.” Notices of the American Mathematical Society.
American Mathematical Society, 2021. https://doi.org/10.1090/noti2349.
ieee: H. Adams, H. Kourimska, T. Heiss, S. Percival, and L. Ziegelmeier, “How to
tutorial-a-thon,” Notices of the American Mathematical Society, vol. 68,
no. 9. American Mathematical Society, pp. 1511–1514, 2021.
ista: Adams H, Kourimska H, Heiss T, Percival S, Ziegelmeier L. 2021. How to tutorial-a-thon.
Notices of the American Mathematical Society. 68(9), 1511–1514.
mla: Adams, Henry, et al. “How to Tutorial-a-Thon.” Notices of the American Mathematical
Society, vol. 68, no. 9, American Mathematical Society, 2021, pp. 1511–14,
doi:10.1090/noti2349.
short: H. Adams, H. Kourimska, T. Heiss, S. Percival, L. Ziegelmeier, Notices of
the American Mathematical Society 68 (2021) 1511–1514.
date_created: 2021-10-03T22:01:22Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2021-12-03T07:31:26Z
day: '01'
department:
- _id: HeEd
doi: 10.1090/noti2349
intvolume: ' 68'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ams.org/notices/
month: '10'
oa: 1
oa_version: Published Version
page: 1511-1514
publication: Notices of the American Mathematical Society
publication_identifier:
eissn:
- 1088-9477
issn:
- 0002-9920
publication_status: published
publisher: American Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: How to tutorial-a-thon
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 68
year: '2021'
...
---
_id: '10367'
abstract:
- lang: eng
text: How information is created, shared and consumed has changed rapidly in recent
decades, in part thanks to new social platforms and technologies on the web. With
ever-larger amounts of unstructured and limited labels, organizing and reconciling
information from different sources and modalities is a central challenge in machine
learning. This cutting-edge tutorial aims to introduce the multimodal entailment
task, which can be useful for detecting semantic alignments when a single modality
alone does not suffice for a whole content understanding. Starting with a brief
overview of natural language processing, computer vision, structured data and
neural graph learning, we lay the foundations for the multimodal sections to follow.
We then discuss recent multimodal learning literature covering visual, audio and
language streams, and explore case studies focusing on tasks which require fine-grained
understanding of visual and linguistic semantics question answering, veracity
and hatred classification. Finally, we introduce a new dataset for recognizing
multimodal entailment, exploring it in a hands-on collaborative section. Overall,
this tutorial gives an overview of multimodal learning, introduces a multimodal
entailment dataset, and encourages future research in the topic.
acknowledgement: "We would like to thank Abby Schantz, Abe Ittycheriah, Aliaksei Severyn,
Allan Heydon, Aly\r\nGrealish, Andrey Vlasov, Arkaitz Zubiaga, Ashwin Kakarla, Chen
Sun, Clayton Williams, Cong\r\nYu, Cordelia Schmid, Da-Cheng Juan, Dan Finnie, Dani
Valevski, Daniel Rocha, David Price, David Sklar, Devi Krishna, Elena Kochkina,
Enrique Alfonseca, Franc¸oise Beaufays, Isabelle Augenstein, Jialu Liu, John Cantwell,
John Palowitch, Jordan Boyd-Graber, Lei Shi, Luis Valente, Maria Voitovich, Mehmet
Aktuna, Mogan Brown, Mor Naaman, Natalia P, Nidhi Hebbar, Pete Aykroyd, Rahul Sukthankar,
Richa Dixit, Steve Pucci, Tania Bedrax-Weiss, Tobias Kaufmann, Tom Boulos, Tu Tsao,
Vladimir Chtchetkine, Yair Kurzion, Yifan Xu and Zach Hynes."
article_processing_charge: No
author:
- first_name: Cesar
full_name: Ilharco, Cesar
last_name: Ilharco
- first_name: Afsaneh
full_name: Shirazi, Afsaneh
last_name: Shirazi
- first_name: Arjun
full_name: Gopalan, Arjun
last_name: Gopalan
- first_name: Arsha
full_name: Nagrani, Arsha
last_name: Nagrani
- first_name: Blaž
full_name: Bratanič, Blaž
last_name: Bratanič
- first_name: Chris
full_name: Bregler, Chris
last_name: Bregler
- first_name: Christina
full_name: Liu, Christina
last_name: Liu
- first_name: Felipe
full_name: Ferreira, Felipe
last_name: Ferreira
- first_name: Gabriek
full_name: Barcik, Gabriek
last_name: Barcik
- first_name: Gabriel
full_name: Ilharco, Gabriel
last_name: Ilharco
- first_name: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
- first_name: Jannis
full_name: Bulian, Jannis
last_name: Bulian
- first_name: Jared
full_name: Frank, Jared
last_name: Frank
- first_name: Lucas
full_name: Smaira, Lucas
last_name: Smaira
- first_name: Qin
full_name: Cao, Qin
last_name: Cao
- first_name: Ricardo
full_name: Marino, Ricardo
last_name: Marino
- first_name: Roma
full_name: Patel, Roma
last_name: Patel
- first_name: Thomas
full_name: Leung, Thomas
last_name: Leung
- first_name: Vaiva
full_name: Imbrasaite, Vaiva
last_name: Imbrasaite
citation:
ama: 'Ilharco C, Shirazi A, Gopalan A, et al. Recognizing multimodal entailment.
In: 59th Annual Meeting of the Association for Computational Linguistics and
the 11th International Joint Conference on Natural Language Processing, Tutorial
Abstracts. Association for Computational Linguistics; 2021:29-30. doi:10.18653/v1/2021.acl-tutorials.6'
apa: 'Ilharco, C., Shirazi, A., Gopalan, A., Nagrani, A., Bratanič, B., Bregler,
C., … Imbrasaite, V. (2021). Recognizing multimodal entailment. In 59th Annual
Meeting of the Association for Computational Linguistics and the 11th International
Joint Conference on Natural Language Processing, Tutorial Abstracts (pp. 29–30).
Bangkok, Thailand: Association for Computational Linguistics. https://doi.org/10.18653/v1/2021.acl-tutorials.6'
chicago: Ilharco, Cesar, Afsaneh Shirazi, Arjun Gopalan, Arsha Nagrani, Blaž Bratanič,
Chris Bregler, Christina Liu, et al. “Recognizing Multimodal Entailment.” In 59th
Annual Meeting of the Association for Computational Linguistics and the 11th International
Joint Conference on Natural Language Processing, Tutorial Abstracts, 29–30.
Association for Computational Linguistics, 2021. https://doi.org/10.18653/v1/2021.acl-tutorials.6.
ieee: C. Ilharco et al., “Recognizing multimodal entailment,” in 59th
Annual Meeting of the Association for Computational Linguistics and the 11th International
Joint Conference on Natural Language Processing, Tutorial Abstracts, Bangkok,
Thailand, 2021, pp. 29–30.
ista: 'Ilharco C, Shirazi A, Gopalan A, Nagrani A, Bratanič B, Bregler C, Liu C,
Ferreira F, Barcik G, Ilharco G, Osang GF, Bulian J, Frank J, Smaira L, Cao Q,
Marino R, Patel R, Leung T, Imbrasaite V. 2021. Recognizing multimodal entailment.
59th Annual Meeting of the Association for Computational Linguistics and the 11th
International Joint Conference on Natural Language Processing, Tutorial Abstracts.
ACL: Association for Computational Linguistics ; IJCNLP: International Joint Conference
on Natural Language Processing, 29–30.'
mla: Ilharco, Cesar, et al. “Recognizing Multimodal Entailment.” 59th Annual
Meeting of the Association for Computational Linguistics and the 11th International
Joint Conference on Natural Language Processing, Tutorial Abstracts, Association
for Computational Linguistics, 2021, pp. 29–30, doi:10.18653/v1/2021.acl-tutorials.6.
short: C. Ilharco, A. Shirazi, A. Gopalan, A. Nagrani, B. Bratanič, C. Bregler,
C. Liu, F. Ferreira, G. Barcik, G. Ilharco, G.F. Osang, J. Bulian, J. Frank, L.
Smaira, Q. Cao, R. Marino, R. Patel, T. Leung, V. Imbrasaite, in:, 59th Annual
Meeting of the Association for Computational Linguistics and the 11th International
Joint Conference on Natural Language Processing, Tutorial Abstracts, Association
for Computational Linguistics, 2021, pp. 29–30.
conference:
end_date: 2021-08-06
location: Bangkok, Thailand
name: 'ACL: Association for Computational Linguistics ; IJCNLP: International Joint
Conference on Natural Language Processing'
start_date: 2021-08-01
date_created: 2021-11-28T23:01:30Z
date_published: 2021-08-01T00:00:00Z
date_updated: 2022-01-26T14:26:36Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.18653/v1/2021.acl-tutorials.6
file:
- access_level: open_access
checksum: b14052a025a6ecf675bdfe51db98c0d7
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-29T08:41:00Z
date_updated: 2021-11-29T08:41:00Z
file_id: '10368'
file_name: 2021_ACL_Ilharco.pdf
file_size: 1227703
relation: main_file
success: 1
file_date_updated: 2021-11-29T08:41:00Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://aclanthology.org/2021.acl-tutorials.6/
month: '08'
oa: 1
oa_version: Published Version
page: 29-30
publication: 59th Annual Meeting of the Association for Computational Linguistics
and the 11th International Joint Conference on Natural Language Processing, Tutorial
Abstracts
publication_identifier:
isbn:
- 9-781-9540-8557-2
publication_status: published
publisher: Association for Computational Linguistics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Recognizing multimodal entailment
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10608'
abstract:
- lang: eng
text: We consider infinite-dimensional properties in coarse geometry for hyperspaces
consisting of finite subsets of metric spaces with the Hausdorff metric. We see
that several infinite-dimensional properties are preserved by taking the hyperspace
of subsets with at most n points. On the other hand, we prove that, if a metric
space contains a sequence of long intervals coarsely, then its hyperspace of finite
subsets is not coarsely embeddable into any uniformly convex Banach space. As
a corollary, the hyperspace of finite subsets of the real line is not coarsely
embeddable into any uniformly convex Banach space. It is also shown that every
(not necessarily bounded geometry) metric space with straight finite decomposition
complexity has metric sparsification property.
acknowledgement: We would like to thank the referees for their careful reading and
the comments that improved our work. The third named author would like to thank
the Division of Mathematics, Physics and Earth Sciences of the Graduate School of
Science and Engineering of Ehime University and the second named author for hosting
his visit in June 2018. Open access funding provided by Institute of Science and
Technology (IST Austria).
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Thomas
full_name: Weighill, Thomas
last_name: Weighill
- first_name: Takamitsu
full_name: Yamauchi, Takamitsu
last_name: Yamauchi
- first_name: Nicolò
full_name: Zava, Nicolò
id: c8b3499c-7a77-11eb-b046-aa368cbbf2ad
last_name: Zava
citation:
ama: Weighill T, Yamauchi T, Zava N. Coarse infinite-dimensionality of hyperspaces
of finite subsets. European Journal of Mathematics. 2021. doi:10.1007/s40879-021-00515-3
apa: Weighill, T., Yamauchi, T., & Zava, N. (2021). Coarse infinite-dimensionality
of hyperspaces of finite subsets. European Journal of Mathematics. Springer
Nature. https://doi.org/10.1007/s40879-021-00515-3
chicago: Weighill, Thomas, Takamitsu Yamauchi, and Nicolò Zava. “Coarse Infinite-Dimensionality
of Hyperspaces of Finite Subsets.” European Journal of Mathematics. Springer
Nature, 2021. https://doi.org/10.1007/s40879-021-00515-3.
ieee: T. Weighill, T. Yamauchi, and N. Zava, “Coarse infinite-dimensionality of
hyperspaces of finite subsets,” European Journal of Mathematics. Springer
Nature, 2021.
ista: Weighill T, Yamauchi T, Zava N. 2021. Coarse infinite-dimensionality of hyperspaces
of finite subsets. European Journal of Mathematics.
mla: Weighill, Thomas, et al. “Coarse Infinite-Dimensionality of Hyperspaces of
Finite Subsets.” European Journal of Mathematics, Springer Nature, 2021,
doi:10.1007/s40879-021-00515-3.
short: T. Weighill, T. Yamauchi, N. Zava, European Journal of Mathematics (2021).
date_created: 2022-01-09T23:01:27Z
date_published: 2021-12-30T00:00:00Z
date_updated: 2022-01-10T08:36:55Z
day: '30'
ddc:
- '500'
department:
- _id: HeEd
doi: 10.1007/s40879-021-00515-3
file:
- access_level: open_access
checksum: c435dcfa1ad3aadc5cdd7366bc7f4e98
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-10T08:33:22Z
date_updated: 2022-01-10T08:33:22Z
file_id: '10610'
file_name: 2021_EuJournalMath_Weighill.pdf
file_size: 384908
relation: main_file
success: 1
file_date_updated: 2022-01-10T08:33:22Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication: European Journal of Mathematics
publication_identifier:
eissn:
- 2199-6768
issn:
- 2199-675X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Coarse infinite-dimensionality of hyperspaces of finite subsets
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '9296'
abstract:
- lang: eng
text: ' matching is compatible to two or more labeled point sets of size n with
labels {1,…,n} if its straight-line drawing on each of these point sets is
crossing-free. We study the maximum number of edges in a matching compatible to
two or more labeled point sets in general position in the plane. We show that
for any two labeled convex sets of n points there exists a compatible matching
with ⌊2n−−√⌋ edges. More generally, for any ℓ labeled point sets we construct
compatible matchings of size Ω(n1/ℓ) . As a corresponding upper bound, we use
probabilistic arguments to show that for any ℓ given sets of n points there
exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1)) edges.
Finally, we show that Θ(logn) copies of any set of n points are necessary and
sufficient for the existence of a labeling such that any compatible matching consists
only of a single edge.'
acknowledgement: 'A.A. funded by the Marie Skłodowska-Curie grant agreement No. 754411.
Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant
no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative
DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported
by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by
ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23
(RiSE).'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Oswin
full_name: Aichholzer, Oswin
last_name: Aichholzer
- first_name: Alan M
full_name: Arroyo Guevara, Alan M
id: 3207FDC6-F248-11E8-B48F-1D18A9856A87
last_name: Arroyo Guevara
orcid: 0000-0003-2401-8670
- 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: Irene
full_name: Parada, Irene
last_name: Parada
- first_name: Daniel
full_name: Perz, Daniel
last_name: Perz
- first_name: Alexander
full_name: Pilz, Alexander
last_name: Pilz
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Birgit
full_name: Vogtenhuber, Birgit
last_name: Vogtenhuber
citation:
ama: 'Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings.
In: 15th International Conference on Algorithms and Computation. Vol 12635.
Springer Nature; 2021:221-233. doi:10.1007/978-3-030-68211-8_18'
apa: 'Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D.,
Pilz, A., … Vogtenhuber, B. (2021). On compatible matchings. In 15th International
Conference on Algorithms and Computation (Vol. 12635, pp. 221–233). Yangon,
Myanmar: Springer Nature. https://doi.org/10.1007/978-3-030-68211-8_18'
chicago: Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada,
Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible
Matchings.” In 15th International Conference on Algorithms and Computation,
12635:221–33. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-68211-8_18.
ieee: O. Aichholzer et al., “On compatible matchings,” in 15th International
Conference on Algorithms and Computation, Yangon, Myanmar, 2021, vol. 12635,
pp. 221–233.
ista: 'Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec
J, Vogtenhuber B. 2021. On compatible matchings. 15th International Conference
on Algorithms and Computation. WALCOM: Algorithms and Computation, LNCS, vol.
12635, 221–233.'
mla: Aichholzer, Oswin, et al. “On Compatible Matchings.” 15th International
Conference on Algorithms and Computation, vol. 12635, Springer Nature, 2021,
pp. 221–33, doi:10.1007/978-3-030-68211-8_18.
short: O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz,
J. Tkadlec, B. Vogtenhuber, in:, 15th International Conference on Algorithms and
Computation, Springer Nature, 2021, pp. 221–233.
conference:
end_date: 2021-03-02
location: Yangon, Myanmar
name: 'WALCOM: Algorithms and Computation'
start_date: 2021-02-28
date_created: 2021-03-28T22:01:41Z
date_published: 2021-02-16T00:00:00Z
date_updated: 2023-02-21T16:33:44Z
day: '16'
department:
- _id: UlWa
- _id: HeEd
- _id: KrCh
doi: 10.1007/978-3-030-68211-8_18
ec_funded: 1
external_id:
arxiv:
- '2101.03928'
intvolume: ' 12635'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2101.03928
month: '02'
oa: 1
oa_version: Preprint
page: 221-233
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: The Wittgenstein Prize
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _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
publication: 15th International Conference on Algorithms and Computation
publication_identifier:
eissn:
- '16113349'
isbn:
- '9783030682101'
issn:
- '03029743'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '11938'
relation: later_version
status: public
scopus_import: '1'
status: public
title: On compatible matchings
type: conference
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 12635
year: '2021'
...
---
_id: '9465'
abstract:
- lang: eng
text: "Given a locally finite set \U0001D44B⊆ℝ\U0001D451 and an integer \U0001D458≥0,
we consider the function \U0001D430\U0001D458:Del\U0001D458(\U0001D44B)→ℝ on the
dual of the order-k Voronoi tessellation, whose sublevel sets generalize the notion
of alpha shapes from order-1 to order-k (Edelsbrunner et al. in IEEE Trans Inf
Theory IT-29:551–559, 1983; Krasnoshchekov and Polishchuk in Inf Process Lett
114:76–83, 2014). While this function is not necessarily generalized discrete
Morse, in the sense of Forman (Adv Math 134:90–145, 1998) and Freij (Discrete
Math 309:3821–3829, 2009), we prove that it satisfies similar properties so that
its increments can be meaningfully classified into critical and non-critical steps.
This result extends to the case of weighted points and sheds light on k-fold covers
with balls in Euclidean space."
article_number: '15'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Anton
full_name: Nikitenko, Anton
id: 3E4FF1BA-F248-11E8-B48F-1D18A9856A87
last_name: Nikitenko
- first_name: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
citation:
ama: Edelsbrunner H, Nikitenko A, Osang GF. A step in the Delaunay mosaic of order
k. Journal of Geometry. 2021;112(1). doi:10.1007/s00022-021-00577-4
apa: Edelsbrunner, H., Nikitenko, A., & Osang, G. F. (2021). A step in the Delaunay
mosaic of order k. Journal of Geometry. Springer Nature. https://doi.org/10.1007/s00022-021-00577-4
chicago: Edelsbrunner, Herbert, Anton Nikitenko, and Georg F Osang. “A Step in the
Delaunay Mosaic of Order K.” Journal of Geometry. Springer Nature, 2021.
https://doi.org/10.1007/s00022-021-00577-4.
ieee: H. Edelsbrunner, A. Nikitenko, and G. F. Osang, “A step in the Delaunay mosaic
of order k,” Journal of Geometry, vol. 112, no. 1. Springer Nature, 2021.
ista: Edelsbrunner H, Nikitenko A, Osang GF. 2021. A step in the Delaunay mosaic
of order k. Journal of Geometry. 112(1), 15.
mla: Edelsbrunner, Herbert, et al. “A Step in the Delaunay Mosaic of Order K.” Journal
of Geometry, vol. 112, no. 1, 15, Springer Nature, 2021, doi:10.1007/s00022-021-00577-4.
short: H. Edelsbrunner, A. Nikitenko, G.F. Osang, Journal of Geometry 112 (2021).
date_created: 2021-06-06T22:01:29Z
date_published: 2021-04-01T00:00:00Z
date_updated: 2022-05-12T11:41:45Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s00022-021-00577-4
file:
- access_level: open_access
checksum: e52a832f1def52a2b23d21bcc09e646f
content_type: application/pdf
creator: kschuh
date_created: 2021-06-11T13:16:26Z
date_updated: 2021-06-11T13:16:26Z
file_id: '9544'
file_name: 2021_Geometry_Edelsbrunner.pdf
file_size: 694706
relation: main_file
success: 1
file_date_updated: 2021-06-11T13:16:26Z
has_accepted_license: '1'
intvolume: ' 112'
issue: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
publication: Journal of Geometry
publication_identifier:
eissn:
- '14208997'
issn:
- '00472468'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A step in the Delaunay mosaic of order k
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2021'
...