default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark Pankov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j19]Mark Pankov
, Krzysztof Petelczyc, Mariusz Zynel:
Point-line geometries related to binary equidistant codes. J. Comb. Theory, Ser. A 210: 105962 (2025)- 2023
- [j18]Mark Pankov:
On the graph of non-degenerate linear [n,2]2 codes. Finite Fields Their Appl. 92: 102282 (2023) - [j17]Mark Pankov:
The graphs of non-degenerate linear codes. J. Comb. Theory A 195: 105720 (2023) - [i1]Mark Pankov:
On the graph of non-degenerate linear [n, 2]2 codes. CoRR abs/2301.06012 (2023) - 2021
- [j16]Mark Pankov, Krzysztof Petelczyc, Mariusz Zynel:
Automorphisms and Some Geodesic Properties of Ortho-Grassmann Graphs. Electron. J. Comb. 28(4) (2021) - [j15]Mark Pankov, Adam Tyc:
z-Knotted Triangulations of Surfaces. Discret. Comput. Geom. 66(2): 636-658 (2021) - 2020
- [j14]Mariusz Kwiatkowski, Mark Pankov:
The graph of 4-ary simplex codes of dimension 2. Finite Fields Their Appl. 67: 101709 (2020)
2010 – 2019
- 2019
- [j13]Mark Pankov, Adam Tyc:
On two types of Z-monodromy in triangulations of surfaces. Discret. Math. 342(9): 2549-2558 (2019) - [j12]Mark Pankov, Adam Tyc:
Connected sums of z-knotted triangulations. Eur. J. Comb. 80: 326-338 (2019) - 2018
- [j11]Michel Deza, Mark Pankov:
Zigzag Structure of Thin Chamber Complexes. Discret. Comput. Geom. 59(2): 363-382 (2018) - [j10]Mariusz Kwiatkowski, Mark Pankov, Antonio Pasini:
The graphs of projective codes. Finite Fields Their Appl. 54: 15-29 (2018) - 2017
- [j9]Mariusz Kwiatkowski, Mark Pankov:
Chow's theorem for linear codes. Finite Fields Their Appl. 46: 147-162 (2017) - 2016
- [j8]Mark Pankov:
A note on automorphisms of halved Cayley graphs of Coxeter systems. Ars Math. Contemp. 11(1): 101-106 (2016) - [j7]Mariusz Kwiatkowski, Mark Pankov:
On the distance between linear codes. Finite Fields Their Appl. 39: 251-263 (2016) - 2014
- [j6]Mark Pankov:
Isometric Embeddings of Half-Cube Graphs in Half-Spin Grassmannians. Electron. J. Comb. 21(4): 4 (2014) - 2013
- [j5]Mark Pankov:
Automorphisms of infinite Johnson graphs. Discret. Math. 313(5): 721-725 (2013) - 2012
- [j4]Mark Pankov:
A Note on Automorphisms of the Infinite-Dimensional Hypercube Graph. Electron. J. Comb. 19(4): 23 (2012) - 2011
- [j3]Mark Pankov:
Metric characterization of apartments in dual polar spaces. J. Comb. Theory A 118(4): 1313-1321 (2011) - 2010
- [b1]Mark Pankov:
Grassmannians of Classical Buildings. Algebra and Discrete Mathematics 2, World Scientific 2010, ISBN 978-981-4317-56-6, pp. 1-224
2000 – 2009
- 2007
- [j2]Mark Pankov:
Base subsets of Grassmannians: Infinite-dimensional case. Eur. J. Comb. 28(1): 26-32 (2007) - [j1]Mark Pankov:
Base subsets of polar Grassmannians. J. Comb. Theory A 114(8): 1394-1406 (2007)
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 2025-01-04 03:03 CET 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:
