Dmitrii (Dima) Pasechnik
Dmitrii (Dima) Pasechnik
Computer Science, Oxford
Verified email at - Homepage
Cited by
Cited by
Approximation of the stability number of a graph via copositive programming
E De Klerk, DV Pasechnik
SIAM Journal on Optimization 12 (4), 875-892, 2002
Reduction of symmetric semidefinite programs using the regular -representation
E De Klerk, DV Pasechnik, A Schrijver
Mathematical programming 109 (2), 613-624, 2007
The cost of stability in coalitional games
Y Bachrach, E Elkind, R Meir, D Pasechnik, M Zuckerman, J Rothe, ...
International Symposium on Algorithmic Game Theory, 122-134, 2009
Complexity of semi-algebraic proofs
D Grigoriev, E Hirsch, D Pasechnik
On approximate graph colouring and max-k-cut algorithms based on the θ-function
E de Klerk, DV Pasechnik, JP Warners
Journal of Combinatorial Optimization 8 (3), 267-294, 2004
Improved bounds for the crossing numbers of Km, n and Kn
E De Klerk, J Maharry, DV Pasechnik, RB Richter, G Salazar
SIAM Journal on Discrete Mathematics 20 (1), 189-202, 2006
The inverse moment problem for convex polytopes
N Gravin, J Lasserre, DV Pasechnik, S Robins
Discrete & Computational Geometry 48 (3), 596-621, 2012
Majorana representations of the symmetric group of degree 4
AA Ivanov, DV Pasechnik, Á Seress, S Shpectorov
Journal of Algebra 324 (9), 2432-2463, 2010
On semidefinite programming relaxations of the traveling salesman problem
E De Klerk, DV Pasechnik, R Sotirov
SIAM Journal on Optimization 19 (4), 1559-1573, 2009
Exploiting group symmetry in truss topology optimization
Y Bai, E de Klerk, D Pasechnik, R Sotirov
Optimization and Engineering 10 (3), 331-349, 2009
Polynomial-time computing over quadratic maps i: sampling in real algebraic sets
D Grigoriev, DV Pasechnik
Computational complexity 14 (1), 20-52, 2005
CSS-like constructions of asymmetric quantum codes
MF Ezerman, S Jitman, S Ling, DV Pasechnik
IEEE transactions on information theory 59 (10), 6732-6754, 2013
Computing the nucleolus of weighted voting games
E Elkind, D Pasechnik
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
Algebraic combinatorics in mathematical chemistry. Methods and algorithms. II. Program implementation of the Weisfeiler-Leman algorithm
L Babel, IV Chuvaeva, M Klin, DV Pasechnik
arXiv preprint arXiv:1002.1921, 2010
Computing symmetry groups of polyhedra
D Bremner, MD Sikirić, DV Pasechnik, T Rehn, A Schürmann
LMS Journal of computation and mathematics 17 (1), 565-581, 2014
Numerical block diagonalization of matrix*-algebras with application to semidefinite programming
E de Klerk, C Dobre, DV Ṗasechnik
Mathematical programming 129 (1), 91-111, 2011
On the skeleton of the metric polytope
A Deza, K Fukuda, D Pasechnik, M Sato
Japanese conference on discrete and computational geometry, 125-136, 2000
The automorphism group and the convex subgraphs of the quadratic forms graph in characteristic 2
A Munemasa, DV Pasechnik, SV Shpectorov
Journal of Algebraic Combinatorics 2 (4), 411-419, 1993
Extending polar spaces of rank at least 3
DV Pasechnik
Journal of Combinatorial Theory, Series A 72 (2), 232-242, 1995
Non-abelian representations of some sporadic geometries
AA Ivanov, DV Pasechnik, SV Shpectorov
Journal of Algebra 181 (2), 523-557, 1996
The system can't perform the operation now. Try again later.
Articles 1–20