Zobrazeno 1 - 10
of 94
pro vyhledávání: '"Mathematics of computing → Combinatorics"'
Autor:
Ibiapina, Allen, Silva, Ana
In the study of temporal graphs, only paths respecting the flow of time are relevant. In this context, many concepts of walks disjointness have been proposed over the years, and the validity of Menger’s Theorem, as well as the complexity of related
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04f85e4ed484d907e7e4b7a31cb0845c
http://arxiv.org/abs/2302.06653
http://arxiv.org/abs/2302.06653
Autor:
Richomme, Gwenaël, Rosenfeld, Matthieu
We study word reconstruction problems. Improving a previous result by P. Fleischmann, M. Lejeune, F. Manea, D. Nowotka and M. Rigo, we prove that, for any unknown word w of length n over an alphabet of cardinality k, w can be reconstructed from the n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7ddf9b607661e147e98ef45c95cf14f0
http://arxiv.org/abs/2301.01571
http://arxiv.org/abs/2301.01571
Autor:
Hoffmann, Michael, M. Reddy, Meghana
Publikováno v:
39th International Symposium on Computational Geometry
A graph is 2-planar if it has local crossing number two, that is, it can be drawn in the plane such that every edge has at most two crossings. A graph is maximal 2-planar if no edge can be added such that the resulting graph remains 2-planar. A 2-pla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2fc2f2c9840264a9432551615b283b17
Autor:
Jacobs, B.P.F., Stein, D.
Publikováno v:
Klin, B. (ed.), CSL 2023: 31st EACSL Annual Conference on Computer Science Logic, February 13-16, 2023, Warsaw, Poland, pp. 28:1-28:15
Lists, multisets and partitions are fundamental datatypes in mathematics and computing. There are basic transformations from lists to multisets (called "accumulation") and also from lists to partitions (called "matching"). We show how these transform
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c073b1544dc216297f25a018d4be8242
We prove that for any monotone class of finite relational structures, the first-order theory of the class is NIP in the sense of stability theory if, and only if, the collection of Gaifman graphs of structures in this class is nowhere dense. This gen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c7ea8ecbc34a58656eb2fe0a7baa7c2
Autor:
Bulteau, Laurent, Lipták, Zsuzsanna
LIPIcs, Volume 259, CPM 2023, Complete Volume
LIPIcs, Vol. 259, 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023), pages 1-472
LIPIcs, Vol. 259, 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023), pages 1-472
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b8239b9890ef3ece0d51fe9454979140
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 258, 39th International Symposium on Computational Geometry (SoCG 2023), pages 0:i-0:xx
LIPIcs, Vol. 258, 39th International Symposium on Computational Geometry (SoCG 2023), pages 0:i-0:xx
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c329e65dc282dcad7a71ecb30d85db2
LIPIcs, Volume 258, SoCG 2023, Complete Volume
LIPIcs, Vol. 258, 39th International Symposium on Computational Geometry (SoCG 2023), pages 1-1058
LIPIcs, Vol. 258, 39th International Symposium on Computational Geometry (SoCG 2023), pages 1-1058
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f0f1e75bd70ea7bad334926442c0f45
https://drops.dagstuhl.de/opus/volltexte/2023/17849/
https://drops.dagstuhl.de/opus/volltexte/2023/17849/
Autor:
Ito, Takehiro, Kakimura, Naonori, Kamiyama, Naoyuki, Kobayashi, Yusuke, Maezawa, Shun-ichi, Nozaki, Yuta, Okamoto, Yoshio
We prove that the computation of a combinatorial shortest path between two vertices of a graph associahedron, introduced by Carr and Devadoss, is NP-hard. This resolves an open problem raised by Cardinal. A graph associahedron is a generalization of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e303b08f7472c05194d34ea9d1a4fa4
Autor:
Schnider, Patrick, Soberón, Pablo
Publikováno v:
39th International Symposium on Computational Geometry
Regression depth, introduced by Rousseeuw and Hubert in 1999, is a notion that measures how good of a regression hyperplane a given query hyperplane is with respect to a set of data points. Under projective duality, this can be interpreted as a depth
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a53a6b44bbf50cfbf21802bcbfb96cf