Mikhail Slabodkin

According to our database1, Mikhail Slabodkin authored at least 3 papers between 2014 and 2016.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles.
Fundam. Informaticae, 2016

2015
Resolution Complexity of Perfect Matching Principles for Sparse Graphs.
Proceedings of the Computer Science - Theory and Applications, 2015

2014
Resolution complexity of perfect mathcing principles for sparse graphs.
Electron. Colloquium Comput. Complex., 2014


  Loading...