We stand with Ukraine  

Yaroslav Shitov

Orcid: 0000-0002-2264-083X

According to our database1, Yaroslav Shitov authored at least 30 papers between 2013 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
More on Tensors with Different Rank and Symmetric Rank.
[BibTeX]
[DOI]
Yaroslav Shitov
SIAM J. Matrix Anal. Appl., March, 2024

2023
Linear mappings preserving the completely positive rank.
[BibTeX]
[DOI]
Yaroslav Shitov
Eur. J. Comb., 2023

2021
The Waring Rank of the 3 x 3 Permanent.
[BibTeX]
[DOI]
Yaroslav Shitov
SIAM J. Appl. Algebra Geom., 2021

Nonnegative rank depends on the field.
[BibTeX]
[DOI]
Yaroslav Shitov
Math. Program., 2021

A sign pattern with all diagonal entries nonzero whose minimal rank realizations are not diagonalizable over ℂ.
[BibTeX]
[DOI]
Yaroslav Shitov
Discret. Math., 2021

2020
Factoring a band matrix over a semiring.
[BibTeX]
[DOI]
Yaroslav Shitov
Fuzzy Sets Syst., 2020

2019
Quantum Version of Wielandt's Inequality Revisited.
[BibTeX]
[DOI]
Mateusz Michalek
,
Yaroslav Shitov
IEEE Trans. Inf. Theory, 2019

An Improvement to a Recent Upper Bound for Synchronizing Words of Finite Automata.
[BibTeX]
[DOI]
Yaroslav Shitov
J. Autom. Lang. Comb., 2019

Euclidean Distance Matrices and Separations in Communication Complexity Theory.
[BibTeX]
[DOI]
Yaroslav Shitov
Discret. Comput. Geom., 2019

2018
Matrices of Bounded Psd Rank are Easy to Detect.
[BibTeX]
[DOI]
Yaroslav Shitov
SIAM J. Optim., 2018

A Counterexample to Comon's Conjecture.
[BibTeX]
[DOI]
Yaroslav Shitov
SIAM J. Appl. Algebra Geom., 2018

On the complexity of graph coloring with additional local conditions.
[BibTeX]
[DOI]
Yaroslav Shitov
Inf. Process. Lett., 2018

2017
A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length.
[BibTeX]
[DOI]
Yaroslav Shitov
Theor. Comput. Sci., 2017

On the complexity of failed zero forcing.
[BibTeX]
[DOI]
Yaroslav Shitov
Theor. Comput. Sci., 2017

The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions.
[BibTeX]
[DOI]
Yaroslav Shitov
SIAM Rev., 2017

The Complexity of Positive Semidefinite Matrix Factorization.
[BibTeX]
[DOI]
Yaroslav Shitov
SIAM J. Optim., 2017

Coloring the Power Graph of a Semigroup.
[BibTeX]
[DOI]
Yaroslav Shitov
Graphs Comb., 2017

Column subset selection is NP-complete.
[BibTeX]
[DOI]
Yaroslav Shitov
CoRR, 2017

Low-Rank Matrix Approximation in the Infinity Norm.
[BibTeX]
[DOI]
Nicolas Gillis
,
Yaroslav Shitov
CoRR, 2017

2016
The Diameter of Chess Grows Exponentially.
[BibTeX]
[DOI]
Yaroslav Shitov
Am. Math. Mon., 2016

A matrix ring with commuting graph of maximal diameter.
[BibTeX]
[DOI]
Yaroslav Shitov
J. Comb. Theory, Ser. A, 2016

A short proof that NMF is NP-hard.
[BibTeX]
[DOI]
Yaroslav Shitov
CoRR, 2016

2015
Tropical lower bounds for extended formulations.
[BibTeX]
[DOI]
Yaroslav Shitov
Math. Program., 2015

Mixtures of star trees and deficiency graphs.
[BibTeX]
[DOI]
Yaroslav Shitov
Eur. J. Comb., 2015

2014
Detecting matrices of combinatorial rank three.
[BibTeX]
[DOI]
Yaroslav Shitov
J. Comb. Theory, Ser. A, 2014

An upper bound for nonnegative rank.
[BibTeX]
[DOI]
Yaroslav Shitov
J. Comb. Theory, Ser. A, 2014

How many Boolean polynomials are irreducible?
[BibTeX]
[DOI]
Yaroslav Shitov
Int. J. Algebra Comput., 2014

Sign patterns of rational matrices with large rank.
[BibTeX]
[DOI]
Yaroslav Shitov
Eur. J. Comb., 2014

2013
When do the r-by-r minors of a matrix form a tropical basis?
[BibTeX]
[DOI]
Yaroslav Shitov
J. Comb. Theory, Ser. A, 2013

On the complexity of Boolean matrix ranks.
[BibTeX]
[DOI]
Yaroslav Shitov
CoRR, 2013


  Loading...