default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitrii V. Pasechnik
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]William Atherton, Dmitrii V. Pasechnik:
Decline and Fall of the ICALP 2008 Modular Decomposition algorithm. CoRR abs/2404.14049 (2024)- 2020
- [j39]Kaashif Hymabaccus
, Dmitrii V. Pasechnik:
RepnDecomp: A GAP package for decomposing linear representations of finite groups. J. Open Source Softw. 5(50): 1835 (2020)
2010 – 2019
- 2018
- [j38]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: 987-1023 (2018) - 2017
- [j37]Nathann Cohen, Dmitrii V. Pasechnik:
Implementing Brouwer's database of strongly regular graphs. Des. Codes Cryptogr. 84(1-2): 223-235 (2017) - 2016
- [i9]Nathann Cohen, Dmitrii V. Pasechnik:
Implementing Brouwer's database of strongly regular graphs. CoRR abs/1601.00181 (2016) - 2015
- [j36]Susan Margulies, Shmuel Onn, Dmitrii V. Pasechnik:
On the complexity of Hilbert refutations for partition. J. Symb. Comput. 66: 70-83 (2015) - 2014
- [j35]Etienne de Klerk, Dmitrii V. Pasechnik, Gelasio Salazar:
Book drawings of complete bipartite graphs. Discret. Appl. Math. 167: 80-93 (2014) - [j34]David Bremner, Mathieu Dutour Sikiric, Dmitrii V. Pasechnik, Thomas Rehn, Achill Schürmann:
Computing symmetry groups of polyhedra. LMS J. Comput. Math. 17(1): 565-581 (2014) - 2013
- [j33]Etienne de Klerk, Dmitrii V. Pasechnik, Gelasio Salazar:
Improved Lower Bounds on Book Crossing Numbers of Complete Graphs. SIAM J. Discret. Math. 27(2): 619-633 (2013) - [j32]Martianus Frederic Ezerman, Somphong Jitman, San Ling, Dmitrii V. Pasechnik:
CSS-Like Constructions of Asymmetric Quantum Codes. IEEE Trans. Inf. Theory 59(10): 6732-6754 (2013) - [c8]Edith Elkind, Dmitrii V. Pasechnik, Michael J. Wooldridge:
Strategic considerations in the design of committees. AAMAS 2013: 439-446 - [c7]Edith Elkind, Dmitrii V. Pasechnik, Yair Zick:
Dynamic weighted voting games. AAMAS 2013: 515-522 - 2012
- [j31]Nick Gravin, Jean B. Lasserre, Dmitrii V. Pasechnik, Sinai Robins:
The Inverse Moment Problem for Convex Polytopes. Discret. Comput. Geom. 48(3): 596-621 (2012) - [j30]Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov, Cristian Dobre:
On semidefinite programming relaxations of maximum $$k$$ -section. Math. Program. 136(2): 253-278 (2012) - [j29]Etienne de Klerk, Dmitrii V. Pasechnik:
Improved Lower Bounds for the 2-Page Crossing Numbers of Km, n and Kn via Semidefinite Programming. SIAM J. Optim. 22(2): 581-595 (2012) - [i8]Martianus Frederic Ezerman, Somphong Jitman, San Ling, Dmitrii V. Pasechnik:
CSS-like Constructions of Asymmetric Quantum Codes. CoRR abs/1207.6512 (2012) - 2011
- [j28]Etienne de Klerk, Cristian Dobre, Dmitrii V. Pasechnik:
Numerical block diagonalization of matrix *-algebras with application to semidefinite programming. Math. Program. 129(1): 91-111 (2011) - [i7]Nick Gravin, Jean B. Lasserre, Dmitrii V. Pasechnik, Sinai Robins:
The inverse moment problem for convex polytopes. CoRR abs/1106.5723 (2011) - 2010
- [c6]Dmitrii V. Pasechnik, Keshav Kini:
A GAP Package for Computation with Coherent Configurations. ICMS 2010: 69-72
2000 – 2009
- 2009
- [j27]Etienne de Klerk, Michael 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): 879-888 (2009) - [j26]Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov:
Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem. SIAM J. Optim. 20(2): 1132 (2009) - [c5]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: 122-134 - [c4]Edith Elkind, Dmitrii V. Pasechnik:
Computing the nucleolus of weighted voting games. SODA 2009: 327-335 - [i6]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 abs/0907.4385 (2009) - 2008
- [j25]Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov:
On Semidefinite Programming Relaxations of the Traveling Salesman Problem. SIAM J. Optim. 19(4): 1559-1573 (2008) - [i5]Edith Elkind, Dmitrii V. Pasechnik:
Computing the nucleolus of weighted voting games. CoRR abs/0808.0298 (2008) - 2007
- [j24]Etienne de Klerk, Dmitrii V. Pasechnik:
A note on the stability number of an orthogonality graph. Eur. J. Comb. 28(7): 1971-1979 (2007) - [j23]Etienne de Klerk, Dmitrii V. Pasechnik:
A linear programming reformulation of the standard quadratic optimization problem. J. Glob. Optim. 37(1): 75-84 (2007) - [j22]Etienne de Klerk, Dmitrii V. Pasechnik, Alexander Schrijver:
Reduction of symmetric semidefinite programs using the regular *-representation. Math. Program. 109(2-3): 613-624 (2007) - [i4]Saugata Basu, Dmitrii V. Pasechnik, Marie-Françoise Roy:
Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials. CoRR abs/0708.3522 (2007) - 2006
- [j21]Stanislav Busygin, Dmitrii V. Pasechnik:
On NP-hardness of the clique partition - Independence number gap recognition and related problems. Discret. Math. 306(4): 460-463 (2006) - [j20]Etienne de Klerk, John Maharry, Dmitrii V. Pasechnik, R. Bruce Richter, Gelasio Salazar:
Improved Bounds for the Crossing Numbers of Km, n and Kn. SIAM J. Discret. Math. 20(1): 189-202 (2006) - 2005
- [j19]Dima Grigoriev, Dmitrii V. Pasechnik:
Polynomial-time computing over quadratic maps i: sampling in real algebraic sets. Comput. Complex. 14(1): 20-52 (2005) - 2004
- [j18]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): 39-45 (2004) - [j17]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): 267-294 (2004) - [i3]Dima Grigoriev, Dmitrii V. Pasechnik:
Polynomial-time computing over quadratic maps I. Sampling in real algebraic sets. CoRR cs.SC/0403008 (2004) - 2003
- [j16]Alexandre A. Ivanov, Dmitrii V. Pasechnik:
C-Extensions of the F4(2)-building. Discret. Math. 264(1-3): 91-110 (2003) - [i2]Stanislav Busygin, Dmitrii V. Pasechnik:
On ~chi(G)-alpha(G)>0 gap recognition and alpha(G)-upper bounds. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j15]Etienne de Klerk, Dmitrii V. Pasechnik:
Approximation of the Stability Number of a Graph via Copositive Programming. SIAM J. Optim. 12(4): 875-892 (2002) - [c3]Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik:
Exponential Lower Bound for Static Semi-algebraic Proofs. ICALP 2002: 257-268 - [c2]Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik:
Complexity of Semi-algebraic Proofs. STACS 2002: 419-430 - 2001
- [j14]Philippe Cara, Serge Lehman, Dmitrii V. Pasechnik:
On the number of inductively minimal geometries. Theor. Comput. Sci. 263(1-2): 31-35 (2001) - [j13]Dmitrii V. Pasechnik:
On computing Hilbert bases via the Elliot-MacMahon algorithm. Theor. Comput. Sci. 263(1-2): 37-46 (2001) - [i1]Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik:
Complexity of semi-algebraic proofs. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c1]Antoine Deza, Komei Fukuda, Dmitrii V. Pasechnik, Masanori Sato:
On the Skeleton of the Metric Polytope. JCDCG 2000: 125-136
1990 – 1999
- 1999
- [j12]Dmitrii V. Pasechnik:
Bipartite sandwiches: semide?nite relaxations for maximum biclique. Electron. Notes Discret. Math. 3: 157-161 (1999) - 1997
- [j11]Alberto Del Fra, Dmitrii V. Pasechnik, Antonio Pasini:
A New Family of Extended Generalized Quadrangles. Eur. J. Comb. 18(2): 155-169 (1997) - [j10]Barbara Baumeister, Dmitrii V. Pasechnik:
The Universal Covers of Certain Semibiplanes. Eur. J. Comb. 18(5): 491-496 (1997) - 1996
- [j9]Leonid Brailovsky, Dmitrii V. Pasechnik, Cheryl E. Praeger:
Classified of 2-quasi-invariant subsets. Ars Comb. 42 (1996) - [j8]Barbara Baumeister, Dmitrii V. Pasechnik:
The Universal Covers of the Sporadic Semibiplanes. Eur. J. Comb. 17(7): 595-604 (1996) - [j7]Dmitrii V. Pasechnik:
The Extensions of the Generalized Quadrangle of Order (3, 9). Eur. J. Comb. 17(8): 751-755 (1996) - 1995
- [j6]Dmitrii V. Pasechnik:
Extending Polar Spaces of Rank at Least 3. J. Comb. Theory A 72(2): 232-242 (1995) - 1994
- [j5]Dmitrii V. Pasechnik:
Geometric Characterization of the Sporadic Groups Fi22, Fi23, and Fi24. J. Comb. Theory A 68(1): 100-114 (1994) - 1993
- [j4]Dmitrii V. Pasechnik:
Geometric Characterization of Graphs from the Suzuki Chain. Eur. J. Comb. 14(5): 491-499 (1993) - 1992
- [j3]Dmitrii V. Pasechnik:
Affine extensions of the petersen graph and 2-arc-transitive graphs of girth 5. Eur. J. Comb. 13(4): 279-290 (1992) - 1991
- [j2]Dmitrii V. Pasechnik:
Dual Linear Extensions of Generalised Quadrangles. Eur. J. Comb. 12(6): 541-548 (1991) - 1990
- [j1]Irene V. Chuvaeva, Dmitrii V. Pasechnik:
Distance-transitive Graphs of Type q. Kq, q and Projective Planes. Eur. J. Comb. 11(4): 341-346 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
