On the queue-number of graphs with bounded tree-width V Wiechert
arXiv preprint arXiv:1608.06091, 2016
29 2016 On the dimension of posets with cover graphs of treewidth 2 G Joret, P Micek, WT Trotter, R Wang, V Wiechert
Order 34 (2), 185-234, 2017
28 2017 The dimension of posets with planar cover graphs S Felsner, WT Trotter, V Wiechert
Graphs and Combinatorics 31 (4), 927-939, 2015
26 2015 Grid intersection graphs and order dimension S Chaplick, S Felsner, U Hoffmann, V Wiechert
Order 35 (2), 363-391, 2018
22 2018 Sparsity and dimension G Joret, P Micek, V Wiechert
Combinatorica 38 (5), 1129-1148, 2018
21 2018 Topological minors of cover graphs and dimension P Micek, V Wiechert
Journal of Graph Theory 86 (3), 295-314, 2017
16 2017 Nowhere dense graph classes and dimension G Joret, P Micek, P Ossona de Mendez, V Wiechert
Combinatorica 39 (5), 1055-1079, 2019
14 2019 Planar posets have dimension at most linear in their height G Joret, P Micek, V Wiechert
SIAM journal on discrete mathematics 31 (4), 2754-2790, 2017
11 2017 A minimum-change version of the Chung–Feller theorem for Dyck paths T Mütze, C Standke, V Wiechert
European Journal of Combinatorics 69, 260-275, 2018
7 2018 Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane T Mütze, B Walczak, V Wiechert
arXiv preprint arXiv:1802.09969, 2018
7 2018 On the dimension of posets with cover graphs of tree-width 2, submitted G Joret, P Micek, WT Trotter, R Wang, V Wiechert
arXiv preprint arXiv:1406.3397, 0
6 A note on concurrent graph sharing games S Chaplick, P Micek, T Ueckerdt, V Wiechert
arXiv preprint arXiv:1411.1021, 2014
5 2014 Boxicity, poset dimension, and excluded minors L Esperet, V Wiechert
arXiv preprint arXiv:1804.00850, 2018
4 2018 Cover graphs and order dimension V Wiechert
PQDT-Global, 2017
4 2017 Burling graphs, chromatic number, and orthogonal tree-decompositions S Felsner, G Joret, P Micek, WT Trotter, V Wiechert
Electronic Notes in Discrete Mathematics 61, 415-420, 2017
3 2017 An On-line Competitive Algorithm for Coloring P Micek, V Wiechert
International Symposium on Algorithms and Computation, 516-527, 2014
3 2014 A minimum-change version of the Chung-Feller theorem for Dyck paths T Mütze, C Standke, V Wiechert
Electronic Notes in Discrete Mathematics 61, 901-907, 2017
2 2017 An on-line competitive algorithm for coloring bipartite graphs without long induced paths P Micek, V Wiechert
Algorithmica 77 (4), 1060-1070, 2017
2 2017 Posets with outerplanar cover graphs S Felsner, WT Trotter, V Wiechert
Graphs and Combinatorics, 2013
2 2013 Sparsity i dimension J Gwenaël, P Micek, V Wiechert
Combinatorica 38 (5), 2018
2018 