![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Jens Schreyer
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j9]Erika Fecková Skrabul'áková
, Iztok Peterin
, Jens Schreyer, Andrej Taranenko:
A note on the Thue chromatic number of lexicographic produts of graphs. Discuss. Math. Graph Theory 38(3): 635-643 (2018) - 2016
- [j8]Jakub Przybylo, Jens Schreyer, Erika Skrabul'áková
:
On the Facial Thue Choice Number of Plane Graphs Via Entropy Compression Method. Graphs Comb. 32(3): 1137-1153 (2016) - 2013
- [c3]Franz Girlich, Michael Rossberg, Guenter Schaefer, Thomas Böhme, Jens Schreyer:
Bounds for the Security of the Vivaldi Network Coordinate System. NetSys 2013: 66-75 - 2012
- [j7]Jens Schreyer, Erika Skrabul'áková
:
On the facial Thue choice index of plane graphs. Discret. Math. 312(10): 1713-1721 (2012) - [p1]Thomas Böhme, Jens Schreyer, Erika Skrabul'áková
:
A Note on Semi-steady States in Stochastic Cellular Automata. Autonomous Systems: Developments and Trends 2012: 313-323 - 2011
- [c2]Thomas Böhme, Jens Schreyer:
Local Computation of Vertex Colorings. CTW 2011: 76-79
2000 – 2009
- 2009
- [c1]Thomas Böhme, Jens Schreyer:
A Game Theoretic Approach to Graph Probleras. IICS 2009: 149-156 - 2007
- [j6]Jens Schreyer:
Almost every graph is vertex-oblique. Discret. Math. 307(7-8): 983-989 (2007) - [j5]Jens Schreyer, Hansjoachim Walther, Leonid S. Melnikov:
Vertex-oblique graphs. Discret. Math. 307(11-12): 1538-1544 (2007) - 2005
- [j4]Anja Kohl, Jens Schreyer, Zsolt Tuza, Margit Voigt:
List version of L(d, s)-labelings. Theor. Comput. Sci. 349(1): 92-98 (2005) - 2004
- [j3]Jens Schreyer, Hansjoachim Walther:
Edge-oblique polyhedral graphs. Discret. Appl. Math. 136(2-3): 315-327 (2004) - 2002
- [j2]Andrey A. Dobrynin
, Leonid S. Melnikov, Jens Schreyer, Hansjoachim Walther:
Some news about oblique graphs. Discuss. Math. Graph Theory 22(1): 39-50 (2002) - 2001
- [j1]Jens Schreyer, Hansjoachim Walther:
Edge-Oblique Polyhedral Graphs. Electron. Notes Discret. Math. 8: 90-93 (2001)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint