D. Pasechnik

activity

19992023

most citedImproved bounds for the crossing numbers of K_m,n and K_n

66 citations · 448 across the 34 of their papers we have counts for

collaborators

Showing 2014Show all

3 papers · 1 filter

math.CO2014★ 11 cited

Edge-dominating cycles, k-walks and Hamilton prisms in $2 K_{2}$ -free graphs

Gao Mou, Dmitrii Pasechnik

We show that an edge-dominating cycle in a $2 K_{2}$ -free graph can be found in polynomial time; this implies that every 1/(k-1)-tough $2 K_{2}$ -free graph admits a k-walk, and it can be…

math.NA2014★ 3 cited

The inverse moment problem for convex polytopes: implementation aspects

Nick Gravin, Danny Nguyen, Dmitrii Pasechnik +1

We give a detailed technical report on the implementation of the algorithm presented in Gravin et al. (Discrete & Computational Geometry'12) for reconstructing an $N$ -vertex convex…

math.CO2014★ 7 cited

Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields

Swee Hong Chan, Henk D. L. Hollmann, Dmitrii V. Pasechnik

A maximal minor $M$ of the Laplacian of an $n$ -vertex Eulerian digraph $Γ$ gives rise to a finite group $Z^{n - 1} / Z^{n - 1} M$ known as the sandpile (or critical) gro…

Edge-dominating cycles, k-walks and Hamilton prisms in 2K2​-free graphs

The inverse moment problem for convex polytopes: implementation aspects

Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields

Edge-dominating cycles, k-walks and Hamilton prisms in $2 K_{2}$ -free graphs