{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:43:19Z","timestamp":1740123799834,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T00:00:00Z","timestamp":1684108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T00:00:00Z","timestamp":1684108800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"crossref","award":["CIN\/AEI\/10.13039\/501100011033\/(PID2020-114154RB-I00)"],"award-info":[{"award-number":["CIN\/AEI\/10.13039\/501100011033\/(PID2020-114154RB-I00)"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sk\u0142odowska-Curie Actions","doi-asserted-by":"publisher","award":["734922"],"award-info":[{"award-number":["734922"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Simons Collaboration Grant","award":["525039"],"award-info":[{"award-number":["525039"]}]},{"name":"University of Denver Evans Research Fund"},{"DOI":"10.13039\/501100003141","name":"Consejo Nacional de Ciencia y Tecnolog\u00eda","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006087","name":"Direcci\u00f3n General de Asuntos del Personal Acad\u00e9mico, Universidad Nacional Aut\u00f3noma de M\u00e9xico","doi-asserted-by":"crossref","award":["PAPIIT IN105221","PAPIIT IN105221"],"award-info":[{"award-number":["PAPIIT IN105221","PAPIIT IN105221"]}],"id":[{"id":"10.13039\/501100006087","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A collection <jats:inline-formula><jats:alternatives><jats:tex-math>$$S=\\{S_i, \\ldots , S_n\\}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>S<\/mml:mi>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mo>{<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>S<\/mml:mi>\n                      <mml:mi>i<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mo>\u2026<\/mml:mo>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>S<\/mml:mi>\n                      <mml:mi>n<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>}<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> of disjoint closed convex sets in <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathbb {R}^d$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>R<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mi>d<\/mml:mi>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is <jats:italic>separable<\/jats:italic> if there exists a direction (a non-zero vector) <jats:inline-formula><jats:alternatives><jats:tex-math>$$ \\overrightarrow{v}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mover>\n                    <mml:mi>v<\/mml:mi>\n                    <mml:mo>\u2192<\/mml:mo>\n                  <\/mml:mover>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathbb {R}^d$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>R<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mi>d<\/mml:mi>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> such that the elements of <jats:italic>S<\/jats:italic> can be removed, one at a time, by translating them an arbitrarily large distance in the direction <jats:inline-formula><jats:alternatives><jats:tex-math>$$ \\overrightarrow{v}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mover>\n                    <mml:mi>v<\/mml:mi>\n                    <mml:mo>\u2192<\/mml:mo>\n                  <\/mml:mover>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> without hitting another element of <jats:italic>S<\/jats:italic>. We say that <jats:inline-formula><jats:alternatives><jats:tex-math>$$S_i \\prec S_j$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>S<\/mml:mi>\n                      <mml:mi>i<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>\u227a<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>S<\/mml:mi>\n                      <mml:mi>j<\/mml:mi>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> if <jats:inline-formula><jats:alternatives><jats:tex-math>$$S_j$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>S<\/mml:mi>\n                    <mml:mi>j<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> has to be removed before we can remove <jats:inline-formula><jats:alternatives><jats:tex-math>$$S_i$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>S<\/mml:mi>\n                    <mml:mi>i<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. The relation <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\prec $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mo>\u227a<\/mml:mo>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> defines a partial order <jats:inline-formula><jats:alternatives><jats:tex-math>$$P(S,\\prec )$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>P<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>S<\/mml:mi>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mo>\u227a<\/mml:mo>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> on <jats:italic>S<\/jats:italic> which we call the <jats:italic>separability order<\/jats:italic> of <jats:italic>S<\/jats:italic> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$ \\overrightarrow{v}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mover>\n                    <mml:mi>v<\/mml:mi>\n                    <mml:mo>\u2192<\/mml:mo>\n                  <\/mml:mover>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. A partial order <jats:inline-formula><jats:alternatives><jats:tex-math>$$P(X, \\prec ')$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>P<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>X<\/mml:mi>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:msup>\n                      <mml:mo>\u227a<\/mml:mo>\n                      <mml:mo>\u2032<\/mml:mo>\n                    <\/mml:msup>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> on <jats:inline-formula><jats:alternatives><jats:tex-math>$$X=\\{x_1, \\ldots , x_n\\}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>X<\/mml:mi>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mo>{<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>x<\/mml:mi>\n                      <mml:mn>1<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mo>\u2026<\/mml:mo>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>x<\/mml:mi>\n                      <mml:mi>n<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>}<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is called a <jats:italic>separability order<\/jats:italic> if there is a collection of convex sets <jats:italic>S<\/jats:italic> and a vector <jats:inline-formula><jats:alternatives><jats:tex-math>$$ \\overrightarrow{v}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mover>\n                    <mml:mi>v<\/mml:mi>\n                    <mml:mo>\u2192<\/mml:mo>\n                  <\/mml:mover>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> in some <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathbb {R}^d$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>R<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mi>d<\/mml:mi>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> such that <jats:inline-formula><jats:alternatives><jats:tex-math>$$x_i \\prec ' x_j$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>x<\/mml:mi>\n                      <mml:mi>i<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:msup>\n                      <mml:mo>\u227a<\/mml:mo>\n                      <mml:mo>\u2032<\/mml:mo>\n                    <\/mml:msup>\n                    <mml:msub>\n                      <mml:mi>x<\/mml:mi>\n                      <mml:mi>j<\/mml:mi>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> in <jats:inline-formula><jats:alternatives><jats:tex-math>$$P(X, \\prec ')$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>P<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>X<\/mml:mi>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:msup>\n                      <mml:mo>\u227a<\/mml:mo>\n                      <mml:mo>\u2032<\/mml:mo>\n                    <\/mml:msup>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> if and only if <jats:inline-formula><jats:alternatives><jats:tex-math>$$S_i \\prec S_j$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>S<\/mml:mi>\n                      <mml:mi>i<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>\u227a<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>S<\/mml:mi>\n                      <mml:mi>j<\/mml:mi>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> in <jats:inline-formula><jats:alternatives><jats:tex-math>$$P(S,\\prec )$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>P<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>S<\/mml:mi>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mo>\u227a<\/mml:mo>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. We prove that every partial order is the separability order of a collection of convex sets in <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathbb {R}^4$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>R<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mn>4<\/mml:mn>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, and that any poset of dimension <jats:bold>2<\/jats:bold> is the separability order of a set of line segments in <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathbb {R}^3$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>R<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mn>3<\/mml:mn>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. We then study the case when the convex sets are restricted to be boxes in <jats:italic>d<\/jats:italic>-dimensional spaces. We prove that any partial order is the separability order of a family of disjoint boxes in <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathbb {R}^d$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>R<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mi>d<\/mml:mi>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> for some <jats:inline-formula><jats:alternatives><jats:tex-math>$$d \\le \\lfloor \\frac{n}{2} \\rfloor +1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>d<\/mml:mi>\n                    <mml:mo>\u2264<\/mml:mo>\n                    <mml:mo>\u230a<\/mml:mo>\n                    <mml:mfrac>\n                      <mml:mi>n<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:mfrac>\n                    <mml:mo>\u230b<\/mml:mo>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. We prove that every poset of dimension <jats:bold>3<\/jats:bold> has a subdivision that is the separability order of boxes in <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathbb {R}^3$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>R<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mn>3<\/mml:mn>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, that there are partial orders of dimension <jats:bold>2<\/jats:bold> that cannot be realized as box separability in <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathbb {R}^3$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>R<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mn>3<\/mml:mn>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and that for any <jats:italic>d<\/jats:italic> there are posets with dimension <jats:italic>d<\/jats:italic> that are separability orders of boxes in <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathbb {R}^3$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>R<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mn>3<\/mml:mn>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. We also prove that for any <jats:italic>d<\/jats:italic> there are partial orders with box separability dimension <jats:italic>d<\/jats:italic>; that is, <jats:italic>d<\/jats:italic> is the smallest dimension for which they are separable orders of sets of boxes in <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathbb {R}^d$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>R<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mi>d<\/mml:mi>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/s11083-023-09628-8","type":"journal-article","created":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T13:57:02Z","timestamp":1684159022000},"page":"699-712","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Separability, Boxicity, and Partial Orders"],"prefix":"10.1007","volume":"40","author":[{"given":"Jos\u00e9-Miguel","family":"D\u00edaz-B\u00e1\u00f1ez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Horn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario A.","family":"Lopez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nestaly","family":"Mar\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adriana","family":"Ram\u00edrez-Vigueras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8399-3321","authenticated-orcid":false,"given":"Oriol","family":"Sol\u00e9-Pi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Stevens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"Urrutia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,15]]},"reference":[{"issue":"9","key":"9628_CR1","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1002\/j.1538-7305.1966.tb01713.x","volume":"45","author":"FW Sinden","year":"1966","unstructured":"Sinden, F.W.: Topology of thin film rc circuits. Bell Syst. Tech. J. 45(9), 1639\u20131662 (1966)","journal-title":"Bell Syst. Tech. J."},{"issue":"1","key":"9628_CR2","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0095-8956(76)90022-8","volume":"21","author":"G Ehrlich","year":"1976","unstructured":"Ehrlich, G., Even, S., Tarjan, R.E.: Intersection graphs of curves in the plane. Journal of Combinatorial Theory, Series B 21(1), 8\u201320 (1976)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"9628_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01693778","volume":"16","author":"H Tietze","year":"1905","unstructured":"Tietze, H.: \u00dcber das problem der nachbargebiete im raum. Monatshefte f\u00fcr Mathematik und Physik 16(1), 211\u2013216 (1905)","journal-title":"Monatshefte f\u00fcr Mathematik und Physik"},{"key":"9628_CR4","first-page":"301","volume":"1","author":"FS Roberts","year":"1969","unstructured":"Roberts, F.S.: On the boxicity and cubicity of a graph. Recent progress in combinatorics 1, 301\u2013310 (1969)","journal-title":"Recent progress in combinatorics"},{"issue":"1\u20133","key":"9628_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0012-365X(81)90203-X","volume":"35","author":"D Kelly","year":"1981","unstructured":"Kelly, D.: On the dimension of partially ordered sets. Discret. Math. 35(1\u20133), 135\u2013156 (1981)","journal-title":"Discret. Math."},{"issue":"1","key":"9628_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/0025570X.1984.11977071","volume":"57","author":"R Dawson","year":"1984","unstructured":"Dawson, R.: On removing a ball without disturbing the others. Math. Mag. 57(1), 27\u201330 (1984)","journal-title":"Math. Mag."},{"issue":"2","key":"9628_CR7","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s11083-017-9437-0","volume":"35","author":"S Chaplick","year":"2018","unstructured":"Chaplick, S., Felsner, S., Hoffmann, U., Wiechert, V.: Grid intersection graphs and order dimension. Order 35(2), 363\u2013391 (2018)","journal-title":"Order"},{"issue":"2","key":"9628_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1137\/0404015","volume":"4","author":"F Al-Thukair","year":"1991","unstructured":"Al-Thukair, F., Pelc, A., Rival, I., Urrutia, J.: Motion planning, two-directional point representation, and ordered sets. SIAM J. Discret. Math. 4(2), 151\u2013163 (1991)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"9628_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00714475","volume":"4","author":"I Rival","year":"1988","unstructured":"Rival, I., Urrutia, J.: Representing orders on the plane by translating convex figures. Order 4(4), 319\u2013339 (1988)","journal-title":"Order"},{"issue":"1\u20132","key":"9628_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0166-218X(90)90135-Y","volume":"27","author":"R Nowakowski","year":"1990","unstructured":"Nowakowski, R., Rival, I., Urrutia, J.: Representing orders on the plane by translating points and lines. Discret. Appl. Math. 27(1\u20132), 147\u2013156 (1990)","journal-title":"Discret. Appl. Math."},{"key":"9628_CR11","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Yao, F.F.: On translating a set of rectangles. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, pp. 154\u2013160 (1980)","DOI":"10.1145\/800141.804663"},{"key":"9628_CR12","first-page":"335","volume":"2","author":"GT Toussaint","year":"1985","unstructured":"Toussaint, G.T.: Movable separability of sets. Mach. Intelligence Pattern Recogn. 2, 335\u2013375 (1985)","journal-title":"Mach. Intelligence Pattern Recogn."},{"key":"9628_CR13","first-page":"121","volume":"626","author":"X Viennot","year":"1985","unstructured":"Viennot, X.: Probl\u00e8mes combinatoires pos\u00e9s par la physique statistique. S\u00e9minaire Bourbaki no 626, 121\u2013122 (1985)","journal-title":"S\u00e9minaire Bourbaki no"},{"key":"9628_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.comgeo.2015.08.003","volume":"51","author":"JM D\u00edaz-B\u00e1\u00f1ez","year":"2016","unstructured":"D\u00edaz-B\u00e1\u00f1ez, J.M., Heredia, M.A., Pel\u00e1ez, C., Sellar\u00e8s, J.A., Urrutia, J., Ventura, I.: Convex blocking and partial orders on the plane. Comput. Geom. 51, 55\u201366 (2016)","journal-title":"Comput. Geom."},{"issue":"2","key":"9628_CR15","first-page":"77","volume":"1","author":"T Hiraguchi","year":"1951","unstructured":"Hiraguchi, T.: On the dimension of partially ordered sets. The science reports of the Kanazawa University 1(2), 77\u201394 (1951)","journal-title":"The science reports of the Kanazawa University"},{"issue":"1","key":"9628_CR16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF00143892","volume":"5","author":"N Alon","year":"1988","unstructured":"Alon, N., Scheinerman, E.R.: Degrees of freedom versus dimension for containment orders. Order 5(1), 11\u201316 (1988)","journal-title":"Order"},{"issue":"4","key":"9628_CR17","doi-asserted-by":"publisher","first-page":"1687","DOI":"10.1137\/100786290","volume":"25","author":"A Adiga","year":"2011","unstructured":"Adiga, A., Bhowmick, D., Chandran, L.S.: Boxicity and poset dimension. SIAM J. Discret. Math. 25(4), 1687\u20131698 (2011)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"9628_CR18","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0012-365X(79)90137-7","volume":"28","author":"WT Trotter Jr","year":"1979","unstructured":"Trotter, W.T., Jr.: A characterization of robert\u2019s inequality for boxicity. Discret. Math. 28(3), 303\u2013313 (1979)","journal-title":"Discret. Math."},{"issue":"2","key":"9628_CR19","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF00337619","volume":"5","author":"JP Spinrad","year":"1988","unstructured":"Spinrad, J.P.: Edge subdivision and dimension. Order 5(2), 143\u2013147 (1988)","journal-title":"Order"},{"issue":"1","key":"9628_CR20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00373-010-0962-5","volume":"27","author":"MC Francis","year":"2011","unstructured":"Francis, M.C., Mathew, R.: Boxicity of leaf powers. Graphs and Combinatorics 27(1), 61\u201372 (2011)","journal-title":"Graphs and Combinatorics"},{"key":"9628_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0012-365X(93)90354-V","volume":"114","author":"SJ Bellantoni","year":"1993","unstructured":"Bellantoni, S.J., Hartman, I.B.-A., Przytycka, T.M., Whitesides, S.: Grid intersection graphs and boxicity. Discret. Math. 114, 41\u201349 (1993)","journal-title":"Discret. Math."},{"key":"9628_CR22","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02483890","volume":"12","author":"L Babai","year":"1981","unstructured":"Babai, L., Duffus, D.: Dimension and automorphism groups of lattices. Algebra Universalis 12, 279\u2013289 (1981)","journal-title":"Algebra Universalis"},{"issue":"4","key":"9628_CR23","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/jgt.20081","volume":"49","author":"S Felsner","year":"2005","unstructured":"Felsner, S., Trotter, W.T.: Posets and planar graphs. Journal of Graph Theory 49(4), 273\u2013284 (2005)","journal-title":"Journal of Graph Theory"},{"issue":"3","key":"9628_CR24","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(94)90143-0","volume":"52","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J.: A special planar satisfiability problem and a consequence of its NP-completeness. Discret. Appl. Math. 52(3), 233\u2013252 (1994)","journal-title":"Discret. Appl. Math."},{"key":"9628_CR25","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s00453-008-9163-5","volume":"56","author":"LS Chandran","year":"2008","unstructured":"Chandran, L.S., Francis, M.C., Sivadasan, N.: Geometric representation of graphs in low dimension using axis parallel boxes. Algorithmica 56, 129\u2013140 (2008)","journal-title":"Algorithmica"},{"key":"9628_CR26","doi-asserted-by":"crossref","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. In: Classic Papers in Combinatorics, pp. 139\u2013144. Springer, Boston, MA (2009)","DOI":"10.1007\/978-0-8176-4842-8_10"},{"issue":"2","key":"9628_CR27","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/A:1006110326269","volume":"15","author":"PC Fishburn","year":"1998","unstructured":"Fishburn, P.C., Trotter, W.T.: Geometric containment orders: A survey. Order 15(2), 167\u2013182 (1998)","journal-title":"Order"},{"issue":"1","key":"9628_CR28","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1017\/S0004972700019201","volume":"63","author":"JG Lee","year":"2001","unstructured":"Lee, J.G., Liu, W.-P., Nowakowski, R., Rival, I.: Dimension invariance of subdivisions. Bull. Aust. Math. Soc. 63(1), 141\u2013150 (2001)","journal-title":"Bull. Aust. Math. Soc."},{"issue":"4","key":"9628_CR29","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BF01190783","volume":"29","author":"R Nowakowski","year":"1992","unstructured":"Nowakowski, R., Rival, I., Urrutia, J.: Lattices contained in planar orders are planar. Algebra Universalis 29(4), 580\u2013588 (1992)","journal-title":"Algebra Universalis"},{"issue":"4","key":"9628_CR30","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF00353652","volume":"5","author":"W Schnyder","year":"1989","unstructured":"Schnyder, W.: Planar graphs and poset dimension. Order 5(4), 323\u2013343 (1989)","journal-title":"Order"},{"key":"9628_CR31","doi-asserted-by":"crossref","unstructured":"Trotter, W.T., Moore, J.I., Sumner, D.P.: The dimension of a comparability graph. Proceedings of the American Mathematical Society 60(1), 35\u201338 (1976)","DOI":"10.1090\/S0002-9939-1976-0417001-6"},{"key":"9628_CR32","doi-asserted-by":"crossref","unstructured":"K\u0159\u00ed\u017e, I., Ne\u0161et\u0159il, J.: Chromatic number of Hasse diagrams, eyebrows and dimension. Order 8, 41\u201348 (1991). Springer","DOI":"10.1007\/BF00385813"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-023-09628-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11083-023-09628-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-023-09628-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T07:07:14Z","timestamp":1701414434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11083-023-09628-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,15]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["9628"],"URL":"https:\/\/doi.org\/10.1007\/s11083-023-09628-8","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"type":"print","value":"0167-8094"},{"type":"electronic","value":"1572-9273"}],"subject":[],"published":{"date-parts":[[2023,5,15]]},"assertion":[{"value":"2 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}