Ignat I. Kolesnichenko

According to our database, Ignat I. Kolesnichenko authored at least 5 papers between 2010 and 2018.

Collaborative distances:

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

2018

External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs.

Maxim A. Babenko, Ignat I. Kolesnichenko

Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

2017

Cascade Heap: Towards Time-Optimal Extractions.

Maxim A. Babenko, Ignat I. Kolesnichenko, Ivan Smirnov

Proceedings of the Computer Science - Theory and Applications, 2017

2016

Computing minimal and maximal suffixes of a substring.

Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Ignat I. Kolesnichenko, Tatiana Starikovskaya

Theor. Comput. Sci., 2016

2013

On Minimal and Maximal Suffixes of a Substring.

Maxim A. Babenko, Ignat I. Kolesnichenko, Tatiana Starikovskaya

Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2010

A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks.

Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010