Evgeny V. Shchepin

Orcid: 0000-0003-4340-6732

According to our database1, Evgeny V. Shchepin authored at least 10 papers between 1991 and 2023.

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

2023
Search of Fractal Space-Filling Curves with Minimal Dilation.
Discret. Comput. Geom., July, 2023

2020
About the Serpinsky-Knopp curve.
CoRR, 2020

2012
A Topological Code for Plane Images
CoRR, 2012

2011
A note on the proof of the complexity of the little-preemptive open-shop problem.
Ann. Oper. Res., 2011

2008
On the geometry, preemptions and complexity of multiprocessor and shop scheduling.
Ann. Oper. Res., 2008

2005
An optimal rounding gives a better approximation for scheduling unrelated machines.
Oper. Res. Lett., 2005

2002
Little-Preemptive Scheduling on Unrelated Processors.
J. Math. Model. Algorithms, 2002

2000
Task Distributions on Multiprocessor Systems.
Proceedings of the Theoretical Computer Science, 2000

1993
On the Method of Critical Points in Character Recognition.
Proceedings of the Computer Analysis of Images and Patterns, 5th International Conference, 1993

1991
Character recognition via critical points.
Int. J. Imaging Syst. Technol., 1991


  Loading...