Konstantin Yu. Gorbunov

According to our database, Konstantin Yu. Gorbunov authored at least 13 papers between 1998 and 2020.

Collaborative distances:

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

2020

An Almost Exact Linear Complexity Algorithm of the Shortest Transformation of Chain-Cycle Graphs.

Konstantin Yu. Gorbunov, Vassily A. Lyubetsky

CoRR, 2020

2018

A Linear Algorithm for Restructuring a Graph.

Konstantin Yu. Gorbunov, Vassily A. Lyubetsky

Autom. Remote. Control., 2018

2017

Linear algorithm for minimal rearrangement of structures.

Konstantin Yu. Gorbunov, Vassily A. Lyubetsky

Probl. Inf. Transm., 2017

Chromosome structures: reduction of certain problems with unequal gene content and gene paralogs to integer linear programming.

Vassily A. Lyubetsky, Roman Gershgorin, Konstantin Yu. Gorbunov

BMC Bioinform., 2017

2016

Algorithms for reconstruction of chromosomal structures.

Vassily A. Lyubetsky, Roman Gershgorin, Alexander V. Seliverstov, Konstantin Yu. Gorbunov

BMC Bioinform., 2016

2015

Algorithmic aspects of decomposition and equivalence of finite-valued transducers.

Andrei A. Muchnik, Konstantin Yu. Gorbunov

Probl. Inf. Transm., 2015

2012

Geometric relationship between parallel hyperplanes, quadrics, and vertices of a hypercube.

Konstantin Yu. Gorbunov, Alexander V. Seliverstov, Vassily A. Lyubetsky

Probl. Inf. Transm., 2012

2011

The tree nearest on average to a given set of trees.

Konstantin Yu. Gorbunov, Vassily A. Lyubetsky

Probl. Inf. Transm., 2011

2010

Evolution of Regulatory Motifs of Bacterial Transcription Factors.

Konstantin Yu. Gorbunov, Olga N. Laikova, Dmitry A. Rodionov, Mikhail S. Gelfand, Vassily A. Lyubetsky

Silico Biol., 2010

2007

Bound on the cardinality of a covering of an arbitrary randomness test by frequency tests.

Konstantin Yu. Gorbunov

Probl. Inf. Transm., 2007

1999

Highly Connected Sets and the Excluded Grid Theorem.

Reinhard Diestel, Tommy R. Jensen, Konstantin Yu. Gorbunov, Carsten Thomassen

J. Comb. Theory, Ser. B, 1999

1998

On a Complexity of the Formula (<i>A</i> vee <i>B</i>) ===> <i>C</i>.

Konstantin Yu. Gorbunov

Theor. Comput. Sci., 1998

An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor.

Konstantin Yu. Gorbunov

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998