Marina Simakov

According to our database, Marina Simakov authored at least 5 papers between 2015 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

Selecting and covering colored points.

Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov

Discret. Appl. Math., 2018

2017

Tracking Paths.

Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2015

Choice Is Hard.

Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Bottleneck Segment Matching.

Aritra Banik, Matthew J. Katz, Marina Simakov

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Conflict-free Covering.

Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015