{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T18:24:19Z","timestamp":1765045459570},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T00:00:00Z","timestamp":1569974400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T00:00:00Z","timestamp":1569974400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00493-019-3892-8","type":"journal-article","created":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T16:17:55Z","timestamp":1572020275000},"page":"1055-1079","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Nowhere Dense Graph Classes and Dimension"],"prefix":"10.1007","volume":"39","author":[{"given":"Gwena\u00ebl","family":"Joret","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Micek","sequence":"additional","affiliation":[]},{"given":"Patrice","family":"Ossona de Mendez","sequence":"additional","affiliation":[]},{"given":"Veit","family":"Wiechert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,2]]},"reference":[{"key":"3892_CR1","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/j.ejc.2013.06.048","volume":"36","author":"H Adler","year":"2014","unstructured":"H. Adler and I. Adler: Interpreting nowhere dense graph classes as a classical notion of model theory, European Journal of Combinatorics36 (2014), 322\u2013330.","journal-title":"European Journal of Combinatorics"},{"key":"3892_CR2","volume-title":"Graph theory, volume 173 of Graduate Texts in Mathematics","author":"R Diestel","year":"2010","unstructured":"R. Diestel: Graph theory, volume 173 of Graduate Texts in Mathematics, Springer, Heidelberg, fourth edition, 2010."},{"key":"3892_CR3","volume-title":"volume 80 of Leibniz International Proceedings in Informatics (LIPIcs)","author":"K Eickmeyer","year":"2017","unstructured":"K. Eickmeyer, A. C. Giannopoulou, S. Kreutzer, O. Kwon, M. Pilipczuk, R. Rabinovich and S. Siebertz: Neighborhood complexity and kernelization for nowhere dense classes of graphs, in: Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl, editors, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), volume 80 of Leibniz International Proceedings in Informatics (LIPIcs), 1\u201314, Dagstuhl, Germany, 2017. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"3892_CR4","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/s00373-014-1430-4","volume":"31","author":"S Felsner","year":"2015","unstructured":"S. Felsner, W. T. Trotter and V. Wiechert: The Dimension of Posets with Planar Cover Graphs, Graphs Combin. 31 (2015), 927\u2013939.","journal-title":"Graphs Combin"},{"key":"3892_CR5","first-page":"325","volume-title":"Graph-Theoretic Concepts in Computer Science 41st International Workshop, WG 2015","author":"M Grohe","year":"2015","unstructured":"M. Grohe, S. Kreutzer, R. Rabinovich, S. Siebertz and K. Stavropoulos: Colouring and covering nowhere dense graphs, in: Graph-Theoretic Concepts in Computer Science 41st International Workshop, WG 2015, 325\u2013338, 2015."},{"key":"3892_CR6","volume-title":"33nd International Conference on Foundations of Software Technology and Theoretical Computer Science, volume 24 of LIPIcs. Leibniz Int. Proc. Inform.","author":"M Grohe","year":"2013","unstructured":"M. Grohe, S. Kreutzer and S. Siebertz: Characterisations of nowhere dense graphs, in: 33nd International Conference on Foundations of Software Technology and Theoretical Computer Science, volume 24 of LIPIcs. Leibniz Int. Proc. Inform., 21\u201340. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2013."},{"key":"3892_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3051095","volume":"64","author":"M Grohe","year":"2017","unstructured":"M. Grohe, S. Kreutzer and S. Siebertz: Deciding first-order properties of nowhere dense graphs, J. ACM64 (2017), 1\u201332.","journal-title":"J. ACM"},{"key":"3892_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.ejc.2017.06.019","volume":"66","author":"J van den Heuvel","year":"2017","unstructured":"J. van den Heuvel, P. Ossona de Mendez, D. Quiroz, R. Rabinovich and S. Siebertz: On the generalised colouring numbers of graphs that exclude a fixed minor, European Journal of Combinatorics66 (Supplement C) (2017), 129\u2013144.","journal-title":"European Journal of Combinatorics"},{"key":"3892_CR9","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00493-014-3081-8","volume":"36","author":"G Joret","year":"2016","unstructured":"G. Joret, P. Micek, K. G. Milans, W. T. Trotter, B. Walczak and R. Wang: Tree-width and dimension, Combinatorica36 (2016), 431\u2013450.","journal-title":"Combinatorica"},{"key":"3892_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s11083-016-9395-y","volume":"34","author":"G Joret","year":"2017","unstructured":"G. Joret, P. Micek, W. T. Trotter, R. Wang and V. Wiechert: On the dimension of posets with cover graphs of treewidth 2, Order34 (2017), 185\u2013234. arXiv:1406.3397.","journal-title":"Order"},{"key":"3892_CR11","doi-asserted-by":"publisher","first-page":"2754","DOI":"10.1137\/17M111300X","volume":"31","author":"G Joret","year":"2018","unstructured":"G. Joret, P. Micek and V. Wiechert: Planar posets have dimension at most linear in their height, SIAM J. Discrete Math.31 (2018), 2754\u20132790.","journal-title":"SIAM J. Discrete Math."},{"key":"3892_CR12","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1007\/s00493-017-3638-4","volume":"38","author":"G Joret","year":"2018","unstructured":"G. Joret, P. Micek and V. Wiechert: Sparsity and dimension, Combinatorica38 (2018), 1129\u20131148.","journal-title":"Combinatorica"},{"key":"3892_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0012-365X(81)90203-X","volume":"35","author":"D Kelly","year":"1981","unstructured":"D. Kelly: On the dimension of partially ordered sets, Discrete Math.35 (1981), 135\u2013156.","journal-title":"Discrete Math."},{"key":"3892_CR14","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1023\/B:ORDE.0000026489.93166.cb","volume":"20","author":"H A Kierstead","year":"2003","unstructured":"H. A. Kierstead and D. Yang: Orderings on graphs and game coloring number, Order20 (2003), 255\u2013264.","journal-title":"Order"},{"key":"3892_CR15","volume-title":"41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), volume 58 of Leibniz International Proceedings in Informatics (LIPIcs)","author":"S Kreutzer","year":"2016","unstructured":"S. Kreutzer, M. Pilipczuk, R. Rabinovich and S. Siebertz: The generalised colouring numbers on classes of bounded expansion, in: Piotr Faliszewski, Anca Muscholl, and Rolf Niedermeier, editors, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), volume 58 of Leibniz International Proceedings in Informatics (LIPIcs), 1\u201313, Dagstuhl, Germany, 2016. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"3892_CR16","first-page":"1533","volume-title":"Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"S Kreutzer","year":"2017","unstructured":"S. Kreutzer, R. Rabinovich and S. Siebertz: Polynomial kernels and wideness properties of nowhere dense graph classes, in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '17, 1533\u20131545, 2017."},{"key":"3892_CR17","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/jgt.22127","volume":"86","author":"P Micek","year":"2017","unstructured":"P. Micek and V. Wiechert: Topological minors of cover graphs and dimension, Journal of Graph Theory86 (2017), 295\u2013314.","journal-title":"Journal of Graph Theory"},{"key":"3892_CR18","unstructured":"J. Ne\u0161setr\u0159il and P. P. Ossona de Mendez: Existence of modeling limits for sequences of sparse structures, arXiv:1608.00146."},{"key":"3892_CR19","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.ejc.2006.07.013","volume":"29","author":"J Ne\u0161setr\u0159il","year":"2008","unstructured":"J. Ne\u0161setr\u0159il and P. Ossona de Mendez: Grad and classes with bounded expansion. I. Decompositions, European J. Combin.29 (2008), 760\u2013776.","journal-title":"European J. Combin."},{"key":"3892_CR20","doi-asserted-by":"publisher","first-page":"868","DOI":"10.2178\/jsl\/1278682204","volume":"75","author":"J Ne\u0161setr\u0159il","year":"2010","unstructured":"J. Ne\u0161setr\u0159il and P. Ossona de Mendez: First order properties on nowhere dense structures, J. Symbolic Logic75 (2010), 868\u2013887.","journal-title":"J. Symbolic Logic"},{"key":"3892_CR21","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1016\/j.ejc.2011.03.007","volume":"32","author":"J Ne\u0161setr\u0159il","year":"2011","unstructured":"J. Ne\u0161setr\u0159il and P. Ossona de Mendez: How many F's are there in G? European Journal of Combinatorics32 (2011), 1126\u20131141.","journal-title":"European Journal of Combinatorics"},{"key":"3892_CR22","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ejc.2011.01.006","volume":"32","author":"J Ne\u0161setr\u0159il","year":"2011","unstructured":"J. Ne\u0161setr\u0159il and P. Ossona de Mendez: On nowhere dense graphs, European J. Combin.32 (2011), 600\u2013617.","journal-title":"European J. Combin."},{"key":"3892_CR23","volume-title":"Sparsity, volume 28 of Algorithms and Combinatorics","author":"J Ne\u0161setr\u0159il","year":"2012","unstructured":"J. Ne\u0161setr\u0159il and P. Ossona de Mendez: Sparsity, volume 28 of Algorithms and Combinatorics, Springer, Heidelberg, 2012. Graphs, structures, and algorithms."},{"key":"3892_CR24","doi-asserted-by":"publisher","first-page":"85","DOI":"10.4213\/rm9688","volume":"71","author":"J Ne\u0161setr\u0159il","year":"2016","unstructured":"J. Ne\u0161setr\u0159il and P. Ossona de Mendez: Structural sparsity, Uspekhi Matematich-eskikh Nauk71 (2016), 85\u2013116. (Russian Math. Surveys 71 79-107).","journal-title":"Uspekhi Matematich-eskikh Nauk"},{"key":"3892_CR25","unstructured":"M. Pilipczuk, S. Siebertz and Sz. Toru\u0144czyk: On wideness and stability, arXiv:1705.09336."},{"key":"3892_CR26","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/j.ejc.2013.06.017","volume":"35","author":"N Streib","year":"2014","unstructured":"N. Streib and W. T. Trotter: Dimension and height for posets with planar cover graphs, European J. Combin.35 (2014), 474\u2013489.","journal-title":"European J. Combin."},{"key":"3892_CR27","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/0095-8956(77)90048-X","volume":"22","author":"W T Trotter Jr.","year":"1977","unstructured":"W. T. Trotter, Jr. and J. I. Moore, Jr: The dimension of planar posets, J. Combinatorial Theory Ser. B22 (1977), 54\u201367.","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"3892_CR28","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1016\/j.jctb.2016.09.001","volume":"122","author":"B Walczak","year":"2017","unstructured":"B. Walczak: Minors and dimension, J. Combin. Theory Ser. B122 (2017), 668\u2013689. Extended abstract in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '15). arXiv:1407.4066.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3892_CR29","unstructured":"V. Wiechert: Cover graphs and order dimension, PhD thesis, TU Berlin, 2018. \nhttps:\/\/depositonce.tu-berlin.de\/bitstream\/11303\/6248\/5\/wiechert_veit.pdf."},{"key":"3892_CR30","doi-asserted-by":"publisher","first-page":"5562","DOI":"10.1016\/j.disc.2008.03.024","volume":"309","author":"X Zhu","year":"2009","unstructured":"X. Zhu: Colouring graphs with bounded generalized colouring number. Discrete Math.309 (2009), 5562\u20135568.","journal-title":"Discrete Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-019-3892-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-019-3892-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-019-3892-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T23:23:04Z","timestamp":1601508184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-019-3892-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,2]]},"references-count":30,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["3892"],"URL":"https:\/\/doi.org\/10.1007\/s00493-019-3892-8","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,2]]},"assertion":[{"value":"27 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}