The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dmitrii V. Pasechnik: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik
    Exponential Lower Bound for Static Semi-algebraic Proofs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:257-268 [Conf]
  2. Antoine Deza, Komei Fukuda, Dmitrii V. Pasechnik, Masanori Sato
    On the Skeleton of the Metric Polytope. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:125-136 [Conf]
  3. Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik
    Complexity of Semi-algebraic Proofs. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:419-430 [Conf]
  4. Leonid Brailovsky, Dmitrii V. Pasechnik, Cheryl E. Praeger
    Classified of 2-quasi-invariant subsets. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  5. Dima Grigoriev, Dmitrii V. Pasechnik
    Polynomial-time computing over quadratic maps i: sampling in real algebraic sets. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:1, pp:20-52 [Journal]
  6. Dima Grigoriev, Dmitrii V. Pasechnik
    Polynomial-time computing over quadratic maps I. Sampling in real algebraic sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  7. Stanislav Busygin, Dmitrii V. Pasechnik
    On NP-hardness of the clique partition - Independence number gap recognition and related problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:4, pp:460-463 [Journal]
  8. Alexandre A. Ivanov, Dmitrii V. Pasechnik
    C-Extensions of the F4(2)-building. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:264, n:1-3, pp:91-110 [Journal]
  9. Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik
    Complexity of semi-algebraic proofs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:103, pp:- [Journal]
  10. Stanislav Busygin, Dmitrii V. Pasechnik
    On ~chi(G)-alpha(G)>0 gap recognition and alpha(G)-upper bounds [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:052, pp:- [Journal]
  11. Barbara Baumeister, Dmitrii V. Pasechnik
    The Universal Covers of Certain Semibiplanes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1997, v:18, n:5, pp:491-496 [Journal]
  12. Barbara Baumeister, Dmitrii V. Pasechnik
    The Universal Covers of the Sporadic Semibiplanes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:7, pp:595-604 [Journal]
  13. Alberto Del Fra, Dmitrii V. Pasechnik, Antonio Pasini
    A New Family of Extended Generalized Quadrangles. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1997, v:18, n:2, pp:155-169 [Journal]
  14. Dmitrii V. Pasechnik
    Geometric Characterization of Graphs from the Suzuki Chain. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:5, pp:491-499 [Journal]
  15. Dmitrii V. Pasechnik
    The Extensions of the Generalized Quadrangle of Order (3, 9). [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:8, pp:751-755 [Journal]
  16. Etienne de Klerk, Dmitrii V. Pasechnik, Joost P. Warners
    On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2004, v:8, n:3, pp:267-294 [Journal]
  17. Dmitrii V. Pasechnik
    Geometric Characterization of the Sporadic Groups Fi22, Fi23, and Fi24. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:68, n:1, pp:100-114 [Journal]
  18. Dmitrii V. Pasechnik
    Extending Polar Spaces of Rank at Least 3. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1995, v:72, n:2, pp:232-242 [Journal]
  19. Etienne de Klerk, Dmitrii V. Pasechnik, Alexander Schrijver
    Reduction of symmetric semidefinite programs using the regular *-representation. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:109, n:2-3, pp:613-624 [Journal]
  20. Etienne de Klerk, John Maharry, Dmitrii V. Pasechnik, R. Bruce Richter, Gelasio Salazar
    Improved Bounds for the Crossing Numbers of Km, n and Kn. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2006, v:20, n:1, pp:189-202 [Journal]
  21. Philippe Cara, Serge Lehman, Dmitrii V. Pasechnik
    On the number of inductively minimal geometries. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:31-35 [Journal]
  22. Dmitrii V. Pasechnik
    On computing Hilbert bases via the Elliot-MacMahon algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:37-46 [Journal]
  23. Etienne de Klerk, Dmitrii V. Pasechnik
    Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:157, n:1, pp:39-45 [Journal]
  24. Saugata Basu, Dmitrii V. Pasechnik, Marie-Françoise Roy
    Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  25. A GAP Package for Computation with Coherent Configurations. [Citation Graph (, )][DBLP]


  26. Computing the nucleolus of weighted voting games. [Citation Graph (, )][DBLP]


  27. The Cost of Stability in Coalitional Games. [Citation Graph (, )][DBLP]


  28. Computing the nucleolus of weighted voting games [Citation Graph (, )][DBLP]


  29. The Cost of Stability in Coalitional Games [Citation Graph (, )][DBLP]


  30. A note on the stability number of an orthogonality graph. [Citation Graph (, )][DBLP]


  31. On the Lovász theta-number of almost regular graphs with application to Erdos-Rényi graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002