default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitry N. Kozlov
Person information
- affiliation: University of Bremen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Dmitry N. Kozlov:
Homology and Euler characteristic of generalized anchored configuration spaces of graphs. J. Appl. Comput. Topol. 8(4): 1053-1067 (2024)- [i12]Pawel Dlotko, Dmitry Feichtner-Kozlov, Anastasios Stefanou, Yusu Wang, Jan F. Senge:
Applied and Combinatorial Topology (Dagstuhl Seminar 24092). Dagstuhl Reports 14(2): 206-239 (2024) - 2023
- [j18]Dmitry N. Kozlov:
Stirling complexes. J. Appl. Comput. Topol. 7(1): 57-74 (2023) - 2020
- [j17]Dmitry N. Kozlov
:
A combinatorial method to compute explicit homology cycles using Discrete Morse Theory. J. Appl. Comput. Topol. 4(1): 79-100 (2020)
2010 – 2019
- 2017
- [j16]Dmitry N. Kozlov:
Witness structures and immediate snapshot complexes. Discret. Math. Theor. Comput. Sci. 19(3) (2017) - [j15]Dmitry N. Kozlov:
All binomial identities are orderable. Eur. J. Comb. 61: 276-281 (2017) - [j14]Dmitry N. Kozlov:
The First Cheeger Constant of a Simplex. Graphs Comb. 33(6): 1543-1564 (2017) - [j13]Dmitry N. Kozlov:
Structure theory of flip graphs with applications to Weak Symmetry Breaking. J. Appl. Comput. Topol. 1(1): 1-55 (2017) - 2016
- [i11]Dmitry N. Kozlov:
All binomial identities are orderable. CoRR abs/1603.08743 (2016) - [i10]Dmitry Feichtner-Kozlov, Damien Imbs:
Topological Methods in Distributed Computing (Dagstuhl Seminar 16282). Dagstuhl Reports 6(7): 31-41 (2016) - 2015
- [j12]Dmitry N. Kozlov:
Weak symmetry breaking and abstract simplex paths. Math. Struct. Comput. Sci. 25(6): 1432-1462 (2015) - [i9]Dmitry N. Kozlov:
Combinatorial topology of the standard chromatic subdivision and Weak Symmetry Breaking for 6 processes. CoRR abs/1506.03944 (2015) - [i8]Dmitry N. Kozlov:
Structure theory of flip graphs with applications to Weak Symmetry Breaking. CoRR abs/1511.00457 (2015) - 2014
- [i7]Dmitry N. Kozlov:
Standard protocol complexes for the immediate snapshot read/write model. CoRR abs/1402.4707 (2014) - [i6]Dmitry N. Kozlov:
Witness structures and immediate snapshot complexes. CoRR abs/1404.4250 (2014) - [i5]Dmitry N. Kozlov:
Topology the immediate snapshot complexes. CoRR abs/1404.5813 (2014) - 2013
- [b2]Maurice Herlihy, Dmitry N. Kozlov, Sergio Rajsbaum:
Distributed Computing Through Combinatorial Topology. Morgan Kaufmann 2013, ISBN 978-0-12-404578-1 - [i4]Dmitry N. Kozlov:
Topology of the view complex. CoRR abs/1311.7283 (2013) - [i3]Dmitry N. Kozlov:
Weak symmetry breaking and abstract simplex paths. CoRR abs/1311.7289 (2013) - 2012
- [j11]Dmitry N. Kozlov:
Gathering identical autonomous systems on a circle using stigmergy. Distributed Comput. 25(6): 461-472 (2012) - [i2]Lisbeth Fajstrup, Dmitry Feichtner-Kozlov, Maurice Herlihy:
Applications of Combinatorial Topology to Computer Science (Dagstuhl Seminar 12121). Dagstuhl Reports 2(3): 50-66 (2012) - 2010
- [c2]Dmitry N. Kozlov:
Some Conjectures Concerning Complexity of PL subdivisions. GETCO 2010: 153-157
2000 – 2009
- 2008
- [b1]Dmitry N. Kozlov:
Combinatorial Algebraic Topology. Algorithms and computation in mathematics 21, Springer 2008, ISBN 978-3-540-73051-4, pp. I-XIX, 1-389 - 2006
- [j10]Sonja Lj. Cukic, Dmitry N. Kozlov:
Homotopy Type of Complexes of Graph Homomorphisms between Cycles. Discret. Comput. Geom. 36(2): 313-329 (2006) - [j9]Dmitry N. Kozlov:
Collapsing along monotone poset maps. Int. J. Math. Math. Sci. 2006: 79858:1-79858:8 (2006) - 2005
- [i1]Dmitry N. Kozlov:
Discrete Morse Theory for free chain complexes. CoRR abs/cs/0504090 (2005) - 2004
- [j8]Dmitry N. Kozlov:
Directed Trees in a String, Real Polynomials with Triple Roots, and Chain Mails. Discret. Comput. Geom. 32(3): 373-382 (2004) - 2000
- [j7]Eva Maria Feichtner, Dmitry N. Kozlov:
On subspace arrangements of type D. Discret. Math. 210(1-3): 27-54 (2000)
1990 – 1999
- 1999
- [j6]Dmitry N. Kozlov:
Maximizing the Möbius Function of a Poset and the Sum of the Betti Numbers of the Order Complex. Comb. 19(4): 533-548 (1999) - [j5]Dmitry N. Kozlov:
A Class of Hypergraph Arrangements with Shellable Intersection Lattice. J. Comb. Theory A 86(1): 169-176 (1999) - [j4]Dmitry N. Kozlov:
Complexes of Directed Trees. J. Comb. Theory A 88(1): 112-122 (1999) - 1997
- [j3]Dmitry N. Kozlov:
Convex Hulls of f- and $\beta$-Vectors. Discret. Comput. Geom. 18(4): 421-431 (1997) - [j2]Noga Alon, Dmitry N. Kozlov:
Coins with Arbitrary Weights. J. Algorithms 25(1): 162-176 (1997) - [j1]Dmitry N. Kozlov, Van H. Vu:
Coins and Cones. J. Comb. Theory A 78(1): 1-14 (1997) - 1996
- [c1]Noga Alon, Dmitry N. Kozlov, Van H. Vu:
The Geometry of Coin-Weighing Problems. FOCS 1996: 524-532
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-10-16 20:32 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:
