Veit Wiechert
Veit Wiechert
Verified email at math.tu-berlin.de - Homepage
Title
Cited by
Cited by
Year
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
282017
The dimension of posets with planar cover graphs
S Felsner, WT Trotter, V Wiechert
Graphs and Combinatorics 31 (4), 927-939, 2015
262015
Sparsity and dimension
G Joret, P Micek, V Wiechert
Combinatorica 38 (5), 1129-1148, 2018
212018
On the queue-number of graphs with bounded tree-width
V Wiechert
arXiv preprint arXiv:1608.06091, 2016
202016
Grid intersection graphs and order dimension
S Chaplick, S Felsner, U Hoffmann, V Wiechert
Order 35 (2), 363-391, 2018
172018
Topological minors of cover graphs and dimension
P Micek, V Wiechert
Journal of Graph Theory 86 (3), 295-314, 2017
162017
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
102017
Nowhere dense graph classes and dimension
G Joret, P Micek, PO de Mendez, V Wiechert
Combinatorica 39 (5), 1055-1079, 2019
62019
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
62018
On the dimension of posets with cover graphs of treewidth 2. Submitted
G Joret, P Micek, WT Trotter, R Wang, V Wiechert
arXiv preprint arXiv:1406.3397, 0
6
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
52018
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
32017
Cover graphs and order dimension
V Wiechert
32017
A note on concurrent graph sharing games
S Chaplick, P Micek, T Ueckerdt, V Wiechert
arXiv preprint arXiv:1411.1021, 2014
32014
Boxicity, poset dimension, and excluded minors
L Esperet, V Wiechert
arXiv preprint arXiv:1804.00850, 2018
22018
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
22017
An On-line Competitive Algorithm for Coloring -free Bipartite Graphs
P Micek, V Wiechert
International Symposium on Algorithms and Computation, 516-527, 2014
22014
Posets with outerplanar cover graphs
S Felsner, WT Trotter, V Wiechert
Graphs and Combinatorics, 2013
22013
An on-line competitive algorithm for coloring bipartite graphs without long induced paths
P Micek, V Wiechert
Algorithmica 77 (4), 1060-1070, 2017
12017
Sparsity i dimension
J Gwenaël, P Micek, V Wiechert
Combinatorica 38 (5), 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–20