Assistant Professor Dmitrii V Pasechnik

2009

1. Numerical block diagonalization of matrix *-algebras with application to semidefinite programming (with E. de Klerk and C. Dobre) e-print nr. 2009-02-2244 at Optimization online, submitted.
2. The cost of stability in coalitional games (with Y. Bachrach, E. Elkind, R. Meir, M. Zuckerman, J. Rothe, J. Rosenschein) Proceedings of SAGT 2009 (2nd International Symposium on Algorithmic Game Theory), LNCS, 5814, 122-134 , Springer-Verlag, Berlin, 2009, arXiv.org preprint cs.GT/0907.4385
3. On semidefinite programming relaxations of association schemes with application to combinatorial optimization problems (with E. de Klerk) CentER Discussion Paper 2009-54

2008

1. Computing the nucleolus of weighted voting games (with E. Elkind), COMSOC-08, presented at SODA 2009, in the SODA 2009 Proc., pp. 327-335, arXiv.org preprint cs.GT/0808.0298
2. Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials (with S. Basu and M.-F. Roy), arXiv.org e-print math.GT/0806.3911, Journal of Algebra 321(2009) 2206-2229
3. On semidefinite programming relaxations of the traveling salesman problem (with E. de Klerk, and R. Sotirov), arXiv.org e-print math.OC/0902.1843 (a typo (wrong picture) in the journal version corrected, cf. erratum in SIAM J. Opt. 20(2009) p.1132 ), jorunal version: SIAM J. Opt. 19(2008) 1559-1573

2007

1. Exploiting group symmetry in truss topology optimization (with Y.-Q. Bai, E. De Klerk, and R. Sotirov), e-print nr. 2007-04-1639 at Optimization online, Optimization and Engineering 10(2009), 331-349
2. Bounding the Betti numbers and computing the Euler-Poincare characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials (with S. Basu and M.-F. Roy), arXiv.org preprint math.AG/0708.3522, a shortened version will appear in J. European Math. Soc.

2006

1. On the Lov�sz theta-number of almost regular graphs with application to Erd�s--R�nyi graphs (with E. De Klerk, M.W. Newman and R. Sotirov), e-print nr. 2006-09-1476 at Optimization Online, Eur. J. Comb. 30(2009) 879-888

2005

1. A note on the stability number of an orthogonality graph (with E. de Klerk), CentER Discussion Paper 2005, nr. 66, arXiv.org preprint math.CO/0505038, Eur. J. Comb. 28(2007) 1971-1979
2. Reduction of symmetric semidefinite programs using the regular *-representation (with E. de Klerk and A. Schrijver), e-print nr. 2005-03-1083 at Optimization Online, Math. Prog. B 109(2007) 613-624 (link via Springer)
3. A linear programming reformulation of the standard quadratic optimization problem (with E. de Klerk), CentER Discussion Paper 2005, nr. 24, J. Global Optim. 37(2007), 75-84 (link via Springer)
4. Solving SDP's in non-commutative algebras part I: the dual-scaling algorithm (with E. de Klerk), CentER Discussion Paper 2005, nr. 17

2004

1. On the irreducibility of a truncated binomial expansion (with M. Filaseta and A. Kumchev), e-print math.NT/0409523 at arXiv.org, Rocky Mountains J. Math. 37(2007), 455-464
2. Improved bounds for the crossing numbers of K_m,n and K_n (with E. de Klerk, J. Maharry, B. Richter and G. Salazar), e-print math.CO/0404142 at arXiv.org, SIAM J. Discr. Math. 20(2006), 189-202
3. Polynomial-time computing over quadratic maps I. Sampling in real algebraic sets (with D. Grigoriev) e-print cs.SC/0403008 at arXiv.org, Computational Complexity 14(2005) 20-52 via SpringerLink

2003

1. Recent Progress on Turan's Brickyard Problem: improved lower bounds for the crossing numbers of K_m,n and K_n (with E. de Klerk, J. Maharry, B. Richter and G. Salazar). Presented at Advances in Graph and Matroid Theory
2. Minimal representations of locally projective amalgams (with A.A. Ivanov), J. London Math. Soc. (2) 70(2004) 142-164
3. On NP-hardness of the clique partition - Independence number gap recognition and related problems (with S. Busygin), Report TR03-052 at Electronic Colloquium on Computational Complexity, Discr. Math. 306(2006) 460-463
4. The isometries of the cut, metric and hypermetric cones (with A. Deza and B. Goldengorin). e-print math.MG/0306049 at arXiv.org, J. Algebraic Combinatorics23(2006) 197-203

2001

• Products of positive forms, linear matrix inequalities, and Hilbert 17-th problem for ternary forms (with E. de Klerk). Eur. J. Oper. Res. 157(2004) 39-45
• Approximation of the stability number of a graph via copositive programming (with E. de Klerk). SIAM J. Opt. 12(2002) 875-892
• Complexity of semi-algebraic proofs. (with D. Grigoriev and E.A. Hirsch). Electronic Colloquium on Computational Complexity, Report TR01-103 (2001). Appeared in Moscow Math. J. 2(2002) 647-679. An extended abstract appeared in the proceedings of STACS'02, LNCS 2285, 419-430, Springer-Verlag, Berlin 2002

2000

• Extended F₄-buildings and the Baby Monster (with A.A. Ivanov and S.V. Shpectorov). Invent. Math. 144(2001) 399-433
• On the Skeleton of the Metric Polytope (with A. Deza, K. Fukuda, and M. Sato). LNCS 2098, 125-136, Springer-Verlag, Berlin 2001
• c-extensions of the F₄(2)-building (with A.A. Ivanov). Discr. Math. 264(2003), 91-110
• Generating vertices with symmetries (with A. Deza, K. Fukuda, and M. Sato) Proc. of the 5th Japan-Korea Joint Workshop on Algorithms and Computation, Tokyo University, pp. 1--8, Tokyo 2000.
• Approximate graph colouring and MAX-k-CUT algorithms based on the theta-function (with E. de Klerk and J.P. Warners). J. Comb. Opt. 8(2004), 267-294
• CGAL Installation Guide (with M. Hoffmann and W. Wesselink), in CGAL Reference Manual

1. Local Characterizations of Geometries. PhD thesis, The University of Western Australia, 1994, available at http://arXiv.org/abs/math.GR/0103121
2. Computing covariants of binary forms and related topics. Preprint 1995,
   available at http://stuwww.uvt.nl/~dpasech/misc/impl.dvi
3. On the nullcone and Hironaka decompositions of the invariants of a torus.
   Preprint 1996, available at http://stuwww.uvt.nl/~dpasech/misc/torus.ps
4. A construction of locally homogeneous graphs ("Weetman's construction"). (with A. Kasikova). Preprint 1996.
5. Algebraic combinatorics in mathematical chemistry. Methods and algorithms. II. Program implementation of the Weisfeiler-Leman algorithm. (with L. Babel, I.V. Chuvaeva and M. Klin). Report TUM-M9701 (local copy), 1997, Fakultaet fuer Mathematik, TU Muenchen
   
6. An interior point approximtion algorithm for a class of combinatorial optimization problems: implementation and enhancements, Preprint 1998,
   available at http://stuwww.uvt.nl/~dpasech/misc/fap.ps
7. Optimal disjoint prefect matchings on a pair of weighted bipartite graphs. (with B. Goldengorin and F. Sharifov) Preprint 2003, available at http://stuwww.uvt.nl/~dpasech/misc/disjointmatchings.ps
8. Solving SDP's in non-commutative algebras part I: the dual-scaling algorithm. (with E. de Klerk) CentER Discussion Paper 2005, nr. 17, available at http://greywww.kub.nl:2080/greyfiles/center/2005/17.html