Uwe Schauz

Orcid: 0000-0002-3116-9402

According to our database1, Uwe Schauz authored at least 17 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Transformation invariance in the Combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices.
Discret. Math., November, 2023

2018
Computing the list chromatic index of graphs.
J. Discrete Algorithms, 2018

2017
Orientations of 1-Factors and the List Edge Coloring Conjecture.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2016
The tournament scheduling problem with absences.
Eur. J. Oper. Res., 2016

2014
The list-chromatic index of K<sub>6</sub>.
Discret. Math., 2014

Proof of the List Edge Coloring Conjecture for Complete Graphs of Prime Degree.
Electron. J. Comb., 2014

Some New Characterizations of Graph Colorability and of Blocking Sets of Projective Spaces.
Electron. J. Comb., 2014

2012
Critically paintable, choosable or colorable graphs.
Discret. Math., 2012

Anti-Codes in Terms of Berlekamp's Switching Game.
Electron. J. Comb., 2012

2011
Colorings and Nowhere-Zero Flows of Graphs in Terms of Berlekamp's Switching Game.
Electron. J. Comb., 2011

2010
Brooks' Theorem via the Alon-Tarsi Theorem.
Discret. Math., 2010

A Paintability Version of the Combinatorial Nullstellensatz, and List Colorings of <i>k</i>-partite <i>k</i>-uniform Hypergraphs.
Electron. J. Comb., 2010

Flexible Color Lists in Alon and Tarsi's Theorem, and Time Scheduling with Unreliable Participants.
Electron. J. Comb., 2010

2009
Mr. Paint and Mrs. Correct.
Electron. J. Comb., 2009

2008
On the Dispersions of the Polynomial Maps over Finite Fields.
Electron. J. Comb., 2008

Algebraically Solvable Problems: Describing Polynomials as Equivalent to Explicit Solutions.
Electron. J. Comb., 2008

2006
Colorings and Orientations of Matrices and Graphs.
Electron. J. Comb., 2006


  Loading...