Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Oliver Korten"'
Autor:
Hugo A. Akitaya, Matthew D. Jones, Matias Korman, Oliver Korten, Christopher Meierfrankenfeld, Michael J. Munje, Diane L. Souvaine, Michael Thramann, Csaba D. Tóth
Publikováno v:
Journal of Graph Theory. 102:35-66
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3019ae6a4dec57a23637088a7ad08d92
https://doi.org/10.1002/jgt.22856
https://doi.org/10.1002/jgt.22856
Publikováno v:
Theoretical Computer Science. 923:13-26
Motivated by applications in gerrymandering detection, we study a reconfiguration problem on connected partitions of a connected graph $G$. A partition of $V(G)$ is \emph{connected} if every part induces a connected subgraph. In many applications, it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::feab7c9262b0ad70ed654f9b833407a3
https://doi.org/10.1016/j.tcs.2022.04.049
https://doi.org/10.1016/j.tcs.2022.04.049
Autor:
Hugo A. Akitaya, Matias Korman, Oliver Korten, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth
Publikováno v:
Discrete & Computational Geometry. 68:218-254
Given a planar straight-line graph $G=(V,E)$ in $\mathbb{R}^2$, a \emph{circumscribing polygon} of $G$ is a simple polygon $P$ whose vertex set is $V$, and every edge in $E$ is either an edge or an internal diagonal of $P$. A circumscribing polygon i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::156009ce4098eb15a8dcdcca8ceff821
https://doi.org/10.1007/s00454-021-00355-8
https://doi.org/10.1007/s00454-021-00355-8
Autor:
Lily Chung, Dylan H. Hendrickson, Jeffrey Bosboom, Michael J. Coulombe, Erik D. Demaine, Zhezheng Luo, William Hu, Calvin Hsu, Lillian Zhang, Oliver Korten, Spencer Compton, Adam Hesterberg, Martin L. Demaine, Ivan Tadeu Ferreira Antunes Filho, Charlotte Chen
Publikováno v:
Journal of Information Processing. 28:987-1007
We analyze the computational complexity of several new variants of edge-matching puzzles. First we analyze inequality (instead of equality) constraints between adjacent tiles, proving the problem NP-complete for strict inequalities but polynomial for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d531d412a1e17c202fd34a347a74e85
https://doi.org/10.2197/ipsjjip.28.987
https://doi.org/10.2197/ipsjjip.28.987
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030752415
CIAC
CIAC
Motivated by applications in gerrymandering detection, we study a reconfiguration problem on connected partitions of a connected graph G. A partition of V(G) is connected if every part induces a connected subgraph. In many applications, it is desirab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2d0314539d956ad4bf6efb0f1a89e52
https://doi.org/10.1007/978-3-030-75242-2_4
https://doi.org/10.1007/978-3-030-75242-2_4
