Dmitrii V. Pasechnik

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 5

Top Topics

Bipartite Graph

Mutual Reinforcement

Cooperative Game

Top Venues

LMS J. Comput. Math.

Des. Codes Cryptogr.

Discret. Appl. Math.

Publications

William Atherton, Dmitrii V. Pasechnik
Decline and Fall of the ICALP 2008 Modular Decomposition algorithm. CoRR (2024)
Kaashif Hymabaccus, Dmitrii V. Pasechnik
RepnDecomp: A GAP package for decomposing linear representations of finite groups. J. Open Source Softw. 5 (50) (2020)
Yoram Bachrach, Edith Elkind, Enrico Malizia, Reshef Meir, Dmitrii V. Pasechnik, Jeffrey S. Rosenschein, Jörg Rothe, Michael Zuckerman
Bounds on the Cost of Stabilizing a Cooperative Game. J. Artif. Intell. Res. 63 (2018)
Nathann Cohen, Dmitrii V. Pasechnik
Implementing Brouwer's database of strongly regular graphs. Des. Codes Cryptogr. 84 (1-2) (2017)
Nathann Cohen, Dmitrii V. Pasechnik
Implementing Brouwer's database of strongly regular graphs. CoRR (2016)
Susan Margulies, Shmuel Onn, Dmitrii V. Pasechnik
On the complexity of Hilbert refutations for partition. J. Symb. Comput. 66 (2015)
David Bremner, Mathieu Dutour Sikiric, Dmitrii V. Pasechnik, Thomas Rehn, Achill Schürmann
Computing symmetry groups of polyhedra. LMS J. Comput. Math. 17 (1) (2014)
Etienne de Klerk, Dmitrii V. Pasechnik, Gelasio Salazar
Book drawings of complete bipartite graphs. Discret. Appl. Math. 167 (2014)
Edith Elkind, Dmitrii V. Pasechnik, Michael J. Wooldridge
Strategic considerations in the design of committees. AAMAS (2013)
Martianus Frederic Ezerman, Somphong Jitman, San Ling, Dmitrii V. Pasechnik
CSS-Like Constructions of Asymmetric Quantum Codes. IEEE Trans. Inf. Theory 59 (10) (2013)
Edith Elkind, Dmitrii V. Pasechnik, Yair Zick
Dynamic weighted voting games. AAMAS (2013)
Etienne de Klerk, Dmitrii V. Pasechnik, Gelasio Salazar
Improved Lower Bounds on Book Crossing Numbers of Complete Graphs. SIAM J. Discret. Math. 27 (2) (2013)
Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov, Cristian Dobre
On semidefinite programming relaxations of maximum $$k$$ -section. Math. Program. 136 (2) (2012)
Martianus Frederic Ezerman, Somphong Jitman, San Ling, Dmitrii V. Pasechnik
CSS-like Constructions of Asymmetric Quantum Codes CoRR (2012)
Nick Gravin, Jean B. Lasserre, Dmitrii V. Pasechnik, Sinai Robins
The Inverse Moment Problem for Convex Polytopes. Discret. Comput. Geom. 48 (3) (2012)
Etienne de Klerk, Dmitrii V. Pasechnik
via Semidefinite Programming. SIAM J. Optim. 22 (2) (2012)
Nick Gravin, Jean B. Lasserre, Dmitrii V. Pasechnik, Sinai Robins
The inverse moment problem for convex polytopes CoRR (2011)
Etienne de Klerk, Cristian Dobre, Dmitrii V. Pasechnik
Numerical block diagonalization of matrix *-algebras with application to semidefinite programming. Math. Program. 129 (1) (2011)
Dmitrii V. Pasechnik, Keshav Kini
A GAP Package for Computation with Coherent Configurations. ICMS (2010)
Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii V. Pasechnik, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein
The Cost of Stability in Coalitional Games. SAGT (2009)
Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii V. Pasechnik, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein
The Cost of Stability in Coalitional Games CoRR (2009)
Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov
Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem. SIAM J. Optim. 20 (2) (2009)
Edith Elkind, Dmitrii V. Pasechnik
Computing the nucleolus of weighted voting games. SODA (2009)
Etienne de Klerk, M. W. Newman, Dmitrii V. Pasechnik, Renata Sotirov
On the Lovász theta-number of almost regular graphs with application to Erdos-Rényi graphs. Eur. J. Comb. 30 (4) (2009)
Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov
On Semidefinite Programming Relaxations of the Traveling Salesman Problem. SIAM J. Optim. 19 (4) (2008)
Edith Elkind, Dmitrii V. Pasechnik
Computing the nucleolus of weighted voting games CoRR (2008)
Etienne de Klerk, Dmitrii V. Pasechnik
A linear programming reformulation of the standard quadratic optimization problem. J. Glob. Optim. 37 (1) (2007)
Etienne de Klerk, Dmitrii V. Pasechnik, Alexander Schrijver
Reduction of symmetric semidefinite programs using the regular *-representation. Math. Program. 109 (2-3) (2007)
Saugata Basu, Dmitrii V. Pasechnik, Marie-Françoise Roy
Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials CoRR (2007)
Etienne de Klerk, Dmitrii V. Pasechnik
A note on the stability number of an orthogonality graph. Eur. J. Comb. 28 (7) (2007)
Etienne de Klerk, John Maharry, Dmitrii V. Pasechnik, R. Bruce Richter, Gelasio Salazar
. SIAM J. Discret. Math. 20 (1) (2006)
Stanislav Busygin, Dmitrii V. Pasechnik
-hardness of the clique partition - Independence number gap recognition and related problems. Discret. Math. 306 (4) (2006)
Dima Grigoriev, Dmitrii V. Pasechnik
Polynomial-time computing over quadratic maps i: sampling in real algebraic sets. Comput. Complex. 14 (1) (2005)
Etienne de Klerk, Dmitrii V. Pasechnik, Joost P. Warners
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function. J. Comb. Optim. 8 (3) (2004)
Etienne de Klerk, Dmitrii V. Pasechnik
Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms. Eur. J. Oper. Res. 157 (1) (2004)
Dima Grigoriev, Dmitrii V. Pasechnik
Polynomial-time computing over quadratic maps I. Sampling in real algebraic sets CoRR (2004)
Stanislav Busygin, Dmitrii V. Pasechnik
On ~chi(G)-alpha(G)>0 gap recognition and alpha(G)-upper bounds Electron. Colloquium Comput. Complex. (052) (2003)
Alexandre A. Ivanov, Dmitrii V. Pasechnik
(2)-building. Discret. Math. 264 (1-3) (2003)
Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik
Exponential Lower Bound for Static Semi-algebraic Proofs. ICALP (2002)
Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik
Complexity of Semi-algebraic Proofs. STACS (2002)
Etienne de Klerk, Dmitrii V. Pasechnik
Approximation of the Stability Number of a Graph via Copositive Programming. SIAM J. Optim. 12 (4) (2002)
Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik
Complexity of semi-algebraic proofs Electron. Colloquium Comput. Complex. (103) (2001)
Philippe Cara, Serge Lehman, Dmitrii V. Pasechnik
On the number of inductively minimal geometries. Theor. Comput. Sci. 263 (1-2) (2001)
Dmitrii V. Pasechnik
On computing Hilbert bases via the Elliot-MacMahon algorithm. Theor. Comput. Sci. 263 (1-2) (2001)
Antoine Deza, Komei Fukuda, Dmitrii V. Pasechnik, Masanori Sato
On the Skeleton of the Metric Polytope. JCDCG (2000)
Dmitrii V. Pasechnik
Bipartite sandwiches: semide?nite relaxations for maximum biclique. Electron. Notes Discret. Math. 3 (1999)
Alberto Del Fra, Dmitrii V. Pasechnik, Antonio Pasini
A New Family of Extended Generalized Quadrangles. Eur. J. Comb. 18 (2) (1997)
Barbara Baumeister, Dmitrii V. Pasechnik
The Universal Covers of Certain Semibiplanes. Eur. J. Comb. 18 (5) (1997)
Barbara Baumeister, Dmitrii V. Pasechnik
The Universal Covers of the Sporadic Semibiplanes. Eur. J. Comb. 17 (7) (1996)
Leonid Brailovsky, Dmitrii V. Pasechnik, Cheryl E. Praeger
Classified of 2-quasi-invariant subsets. Ars Comb. 42 (1996)
Dmitrii V. Pasechnik
The Extensions of the Generalized Quadrangle of Order (3, 9). Eur. J. Comb. 17 (8) (1996)
Dmitrii V. Pasechnik
Extending Polar Spaces of Rank at Least 3. J. Comb. Theory, Ser. A 72 (2) (1995)
Dmitrii V. Pasechnik
. J. Comb. Theory, Ser. A 68 (1) (1994)
Dmitrii V. Pasechnik
Geometric Characterization of Graphs from the Suzuki Chain. Eur. J. Comb. 14 (5) (1993)
Dmitrii V. Pasechnik
Affine extensions of the petersen graph and 2-arc-transitive graphs of girth 5. Eur. J. Comb. 13 (4) (1992)
Dmitrii V. Pasechnik
Dual Linear Extensions of Generalised Quadrangles. Eur. J. Comb. 12 (6) (1991)
Irene V. Chuvaeva, Dmitrii V. Pasechnik
and Projective Planes. Eur. J. Comb. 11 (4) (1990)