Veit Wiechert

According to our database1, Veit Wiechert authored at least 16 papers between 2014 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Nowhere Dense Graph Classes and Dimension.
Comb., 2019

2018
Grid Intersection Graphs and Order Dimension.
Order, 2018

Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane.
CoRR, 2018

Boxicity, Poset Dimension, and Excluded Minors.
Electron. J. Comb., 2018

Sparsity and Dimension.
Comb., 2018

2017
Planar Posets Have Dimension at Most Linear in Their Height.
SIAM J. Discret. Math., 2017

On the Dimension of Posets with Cover Graphs of Treewidth 2.
Order, 2017

Topological Minors of Cover Graphs and Dimension.
J. Graph Theory, 2017

A minimum-change version of the Chung-Feller theorem for Dyck paths.
Electron. Notes Discret. Math., 2017

Burling graphs, chromatic number, and orthogonal tree-decompositions.
Electron. Notes Discret. Math., 2017

On the Queue-Number of Graphs with Bounded Tree-Width.
Electron. J. Comb., 2017

An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths.
Algorithmica, 2017

2016
A Note on Concurrent Graph Sharing Games.
Integers, 2016

2015
Erratum to: Antimatroids and Balanced Pairs.
Order, 2015

The Dimension of Posets with Planar Cover Graphs.
Graphs Comb., 2015

2014
An On-line Competitive Algorithm for Coloring P_8 -free Bipartite Graphs.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014


  Loading...