Jens Schreyer

According to our database1, Jens Schreyer authored at least 12 papers between 2001 and 2018.

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

2018
A note on the Thue chromatic number of lexicographic produts of graphs.
Discuss. Math. Graph Theory, 2018

2016
On the Facial Thue Choice Number of Plane Graphs Via Entropy Compression Method.
Graphs Comb., 2016

2013
Bounds for the Security of the Vivaldi Network Coordinate System.
Proceedings of the 2013 Conference on Networked Systems, 2013

2012
A Note on Semi-steady States in Stochastic Cellular Automata.
Proceedings of the Autonomous Systems: Developments and Trends, 2012

On the facial Thue choice index of plane graphs.
Discret. Math., 2012

2011
Local Computation of Vertex Colorings.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2009
A Game Theoretic Approach to Graph Probleras.
Proceedings of the 9th International Conference on Innovative Coummunity Systems, 2009

2007
Vertex-oblique graphs.
Discret. Math., 2007

Almost every graph is vertex-oblique.
Discret. Math., 2007

2005
List version of <i>L</i>(<i>d</i>, <i>s</i>)-labelings.
Theor. Comput. Sci., 2005

2002
Some news about oblique graphs.
Discuss. Math. Graph Theory, 2002

2001
Edge-Oblique Polyhedral Graphs.
Electron. Notes Discret. Math., 2001


  Loading...