Dmitrii V. Pasechnik

58 papers A* 2A 3B 1Journal 50Unranked 2

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