Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Böttcher, Julia
and
Vilenchik, Dan
2008.
On the tractability of coloring semirandom graphs.
Information Processing Letters,
Vol. 108,
Issue. 3,
p.
143.
Bläser, Markus
and
Manthey, Bodo
2012.
Mathematical Foundations of Computer Science 2012.
Vol. 7464,
Issue. ,
p.
198.
Pak, Igor
and
Vilenchik, Dan
2013.
Constructing Uniquely Realizable Graphs.
Discrete & Computational Geometry,
Vol. 50,
Issue. 4,
p.
1051.
Bläser, Markus
and
Manthey, Bodo
2015.
Smoothed Complexity Theory.
ACM Transactions on Computation Theory,
Vol. 7,
Issue. 2,
p.
1.