default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomasz Kaczynski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Guillaume Brouillette, Madjid Allili, Tomasz Kaczynski:
Multiparameter discrete Morse theory. J. Appl. Comput. Topol. 8(7): 2155-2196 (2024)- 2020
- [j10]Bogdan Batko
, Tomasz Kaczynski, Marian Mrozek, Thomas Wanner:
Linking Combinatorial and Classical Dynamics: Conley Index and Morse Decompositions. Found. Comput. Math. 20(5): 967-1012 (2020)
2010 – 2019
- 2019
- [j9]Madjid Allili, Tomasz Kaczynski, Claudia Landi, Filippo Masoni:
Acyclic Partial Matchings for Multidimensional Persistence: Algorithm and Combinatorial Interpretation. J. Math. Imaging Vis. 61(2): 174-192 (2019) - 2017
- [j8]Madjid Allili, Tomasz Kaczynski, Claudia Landi:
Reducing complexes in multidimensional persistent homology theory. J. Symb. Comput. 78: 61-75 (2017) - [c2]Madjid Allili, Tomasz Kaczynski, Claudia Landi, Filippo Masoni:
Algorithmic Construction of Acyclic Partial Matchings for Multidimensional Persistence. DGCI 2017: 375-387 - 2015
- [i3]Madjid Allili, Tomasz Kaczynski, Claudia Landi, Filippo Masoni:
A New Matching Algorithm for Multidimensional Persistence. CoRR abs/1511.05427 (2015) - 2014
- [j7]Marc Ethier, Tomasz Kaczynski:
Suspension models for testing shape similarity methods. Comput. Vis. Image Underst. 121: 13-20 (2014) - 2013
- [j6]Niccolò Cavazza, Marc Ethier, Patrizio Frosini, Tomasz Kaczynski, Claudia Landi:
Comparison of persistent homologies for vector functions: From continuous to discrete and back. Comput. Math. Appl. 66(4): 560-573 (2013) - [j5]Tomasz Kaczynski, Marian Mrozek:
The Cubical Cohomology Ring: An Algorithmic Approach. Found. Comput. Math. 13(5): 789-818 (2013) - [i2]Madjid Allili, Tomasz Kaczynski, Claudia Landi:
Reducing complexes in multidimensional persistent homology theory. CoRR abs/1310.8089 (2013) - 2012
- [i1]Niccolò Cavazza, Marc Ethier, Patrizio Frosini, Tomasz Kaczynski, Claudia Landi:
Comparison of Persistent Homologies for Vector Functions: from continuous to discrete and back. CoRR abs/1201.3217 (2012) - 2011
- [j4]Madjid Allili, David Corriveau, Sara Derivière, Marc Ethier, Tomasz Kaczynski:
Detecting critical regions in multidimensional data sets. Comput. Math. Appl. 61(2): 499-512 (2011) - [j3]Pawel Dlotko, Tomasz Kaczynski, Marian Mrozek, Thomas Wanner:
Coreduction Homology Algorithm for Regular CW-Complexes. Discret. Comput. Geom. 46(2): 361-388 (2011) - 2010
- [c1]Madjid Allili, Marc Ethier, Tomasz Kaczynski:
Critical region analysis of scalar fields in arbitrary dimensions. VDA 2010: 753008
2000 – 2009
- 2007
- [j2]Madjid Allili, David Corriveau, Sara Derivière, Tomasz Kaczynski, Anik Trahan:
Discrete Dynamical System Framework for Construction of Connections between Critical Regions in Lattice Height Data. J. Math. Imaging Vis. 28(2): 99-111 (2007) - 2001
- [j1]Madjid Allili, Tomasz Kaczynski:
Geometric Construction of a Coboundary of a Cycle. Discret. Comput. Geom. 25(1): 125-140 (2001)
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-11-13 23:42 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:
