Distance-transitive Graphs of Type q. Kq, q and Projective Planes. - Irene V. Chuvaeva; Dmitrii V. Pasechnik (Eur. J. Comb., 1990)

Dual Linear Extensions of Generalised Quadrangles. - Dmitrii V. Pasechnik (Eur. J. Comb., 1991)

Affine extensions of the petersen graph and 2-arc-transitive graphs of girth 5. - Dmitrii V. Pasechnik (Eur. J. Comb., 1992)

Geometric Characterization of Graphs from the Suzuki Chain. - Dmitrii V. Pasechnik (Eur. J. Comb., 1993)

Geometric Characterization of the Sporadic Groups Fi22, Fi23, and Fi24. - Dmitrii V. Pasechnik (J. Comb. Theory A, 1994)

Extending Polar Spaces of Rank at Least 3. - Dmitrii V. Pasechnik (J. Comb. Theory A, 1995)

Classified of 2-quasi-invariant subsets. - Leonid Brailovsky; Dmitrii V. Pasechnik; Cheryl E. Praeger (Ars Comb., 1996)

The Universal Covers of the Sporadic Semibiplanes. - Barbara Baumeister; Dmitrii V. Pasechnik (Eur. J. Comb., 1996)

The Extensions of the Generalized Quadrangle of Order (3, 9). - Dmitrii V. Pasechnik (Eur. J. Comb., 1996)

The Universal Covers of Certain Semibiplanes. - Barbara Baumeister; Dmitrii V. Pasechnik (Eur. J. Comb., 1997)

A New Family of Extended Generalized Quadrangles. - Alberto Del Fra; Dmitrii V. Pasechnik; Antonio Pasini (Eur. J. Comb., 1997)

Bipartite sandwiches: semide?nite relaxations for maximum biclique. - Dmitrii V. Pasechnik (Electron. Notes Discret. Math., 1999)

On the Skeleton of the Metric Polytope. - Antoine Deza; Komei Fukuda; Dmitrii V. Pasechnik; Masanori Sato (JCDCG, 2000)

Complexity of semi-algebraic proofs - Dima Grigoriev; Edward A. Hirsch; Dmitrii V. Pasechnik (Electron. Colloquium Comput. Complex., 2001)

On the number of inductively minimal geometries. - Philippe Cara; Serge Lehman; Dmitrii V. Pasechnik (Theor. Comput. Sci., 2001)

On computing Hilbert bases via the Elliot-MacMahon algorithm. - Dmitrii V. Pasechnik (Theor. Comput. Sci., 2001)

Exponential Lower Bound for Static Semi-algebraic Proofs. - Dima Grigoriev; Edward A. Hirsch; Dmitrii V. Pasechnik (ICALP, 2002)

Approximation of the Stability Number of a Graph via Copositive Programming. - Etienne de Klerk; Dmitrii V. Pasechnik (SIAM J. Optim., 2002)

C-Extensions of the F4(2)-building. - Alexandre A. Ivanov; Dmitrii V. Pasechnik (Discret. Math., 2003)

On chi(G)-alpha(G)>0 gap recognition and alpha(G)-upper bounds - Stanislav Busygin; Dmitrii V. Pasechnik (Electron. Colloquium Comput. Complex., 2003)

Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms. - Etienne de Klerk; Dmitrii V. Pasechnik (Eur. J. Oper. Res., 2004)

On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function. - Etienne de Klerk; Dmitrii V. Pasechnik; Joost P. Warners (J. Comb. Optim., 2004)

Polynomial-time computing over quadratic maps i: sampling in real algebraic sets. - Dima Grigoriev; Dmitrii V. Pasechnik (Comput. Complex., 2005)

On NP-hardness of the clique partition - Independence number gap recognition and related problems. - Stanislav Busygin; Dmitrii V. Pasechnik (Discret. Math., 2006)

Improved Bounds for the Crossing Numbers of Km, n and Kn. - Etienne de Klerk; John Maharry; Dmitrii V. Pasechnik; R. Bruce Richter; Gelasio Salazar (SIAM J. Discret. Math., 2006)

Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials - Saugata Basu; Dmitrii V. Pasechnik; Marie-Françoise Roy (CoRR, 2007)

A note on the stability number of an orthogonality graph. - Etienne de Klerk; Dmitrii V. Pasechnik (Eur. J. Comb., 2007)

A linear programming reformulation of the standard quadratic optimization problem. - Etienne de Klerk; Dmitrii V. Pasechnik (J. Glob. Optim., 2007)

Reduction of symmetric semidefinite programs using the regular *-representation. - Etienne de Klerk; Dmitrii V. Pasechnik; Alexander Schrijver (Math. Program., 2007)

On Semidefinite Programming Relaxations of the Traveling Salesman Problem. - Etienne de Klerk; Dmitrii V. Pasechnik; Renata Sotirov (SIAM J. Optim., 2008)

The Cost of Stability in Coalitional Games. - Yoram Bachrach; Edith Elkind; Reshef Meir; Dmitrii V. Pasechnik; Michael Zuckerman; Jörg Rothe; Jeffrey S. Rosenschein (SAGT, 2009)

Computing the nucleolus of weighted voting games. - Edith Elkind; Dmitrii V. Pasechnik (SODA, 2009)

On the Lovász theta-number of almost regular graphs with application to Erdos-Rényi graphs. - Etienne de Klerk; Michael W. Newman; Dmitrii V. Pasechnik; Renata Sotirov (Eur. J. Comb., 2009)

Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem. - Etienne de Klerk; Dmitrii V. Pasechnik; Renata Sotirov (SIAM J. Optim., 2009)

A GAP Package for Computation with Coherent Configurations. - Dmitrii V. Pasechnik; Keshav Kini (ICMS, 2010)

Numerical block diagonalization of matrix *-algebras with application to semidefinite programming. - Etienne de Klerk; Cristian Dobre; Dmitrii V. Pasechnik (Math. Program., 2011)

The Inverse Moment Problem for Convex Polytopes. - Nick Gravin; Jean B. Lasserre; Dmitrii V. Pasechnik; Sinai Robins (Discret. Comput. Geom., 2012)

On semidefinite programming relaxations of maximum $$k$$ -section. - Etienne de Klerk; Dmitrii V. Pasechnik; Renata Sotirov; Cristian Dobre (Math. Program., 2012)

Improved Lower Bounds for the 2-Page Crossing Numbers of Km, n and Kn via Semidefinite Programming. - Etienne de Klerk; Dmitrii V. Pasechnik (SIAM J. Optim., 2012)

Strategic considerations in the design of committees. - Edith Elkind; Dmitrii V. Pasechnik; Michael J. Wooldridge (AAMAS, 2013)

Dynamic weighted voting games. - Edith Elkind; Dmitrii V. Pasechnik; Yair Zick (AAMAS, 2013)

Improved Lower Bounds on Book Crossing Numbers of Complete Graphs. - Etienne de Klerk; Dmitrii V. Pasechnik; Gelasio Salazar (SIAM J. Discret. Math., 2013)

CSS-Like Constructions of Asymmetric Quantum Codes. - Martianus Frederic Ezerman; Somphong Jitman; San Ling; Dmitrii V. Pasechnik (IEEE Trans. Inf. Theory, 2013)

Book drawings of complete bipartite graphs. - Etienne de Klerk; Dmitrii V. Pasechnik; Gelasio Salazar (Discret. Appl. Math., 2014)

Computing symmetry groups of polyhedra. - David Bremner; Mathieu Dutour Sikiric; Dmitrii V. Pasechnik; Thomas Rehn; Achill Schürmann (LMS J. Comput. Math., 2014)

On the complexity of Hilbert refutations for partition. - Susan Margulies; Shmuel Onn; Dmitrii V. Pasechnik (J. Symb. Comput., 2015)

Implementing Brouwer's database of strongly regular graphs. - Nathann Cohen; Dmitrii V. Pasechnik (Des. Codes Cryptogr., 2017)

Bounds on the Cost of Stabilizing a Cooperative Game. - Yoram Bachrach; Edith Elkind; Enrico Malizia; Reshef Meir; Dmitrii V. Pasechnik; Jeffrey S. Rosenschein; Jörg Rothe; Michael Zuckerman (J. Artif. Intell. Res., 2018)

RepnDecomp: A GAP package for decomposing linear representations of finite groups. - Kaashif Hymabaccus; Dmitrii V. Pasechnik (J. Open Source Softw., 2020)

Decline and Fall of the ICALP 2008 Modular Decomposition algorithm. - William Atherton; Dmitrii V. Pasechnik (CoRR, 2024)

A database of constructions of Hadamard matrices. - Matteo Cati; Dmitrii V. Pasechnik (CoRR, 2024)