Selected 10 papers in top journals and conferences
 2022 : D.Widdowson, V.Kurlin. Resolving the data ambiguity for periodic crystals.
Proceedings of NeurIPS 2022: Neural Information Processing Systems, the top conference in the entire Computer Science.
This paper justified the Crystal Isometry Principle extending Mendeleev's table to a continuous space of periodic crystals.
 2022 : Q.Zhu, J.Johal, D.Widdowson, Z.Pang, B.Li, C.Kane, V.Kurlin, G.Day, M.Little, A.I.Cooper.
Analogy Powered by Prediction and Structural Invariants.
J Am. Chem. Soc. 2022, 144, 22, 9893–9901.
This paper reported new material based on invariants from the NeurIPS 2022 paper above.
 2022 : D.Widdowson, M.Mosca, A.Pulido, V.Kurlin, A.I.Cooper.
Average Minimum Distances  foundational invariants for mapping all periodic crystals.
MATCH Communications in Mathematical and in Computer Chemistry, v.87(3), p.529559, 2022.
This paper introduced the sequence of continuous isometry invariants (AMD) for mapping all periodic crystals.
 2021 : P.Smith, V.Kurlin. Skeletonisation algorithms for unorganised point clouds with high levels of noise.
Pattern Recognition, v.115 (2021), 107902.
This paper proves guarantees for a Homologically Persistent Skeleton (HoPeS), my key contribution to Topological Data Analysis.
 2020 : C.Hargreaves, M.Dyer, M.Gaultois, V.Kurlin, M.Rosseinsky.
The Earth Mover’s Distance as a Metric for the Space of Inorganic Compositions.
Chemistry of Materials, v. 32 (24), p.1061010620.
This paper has presented the first visualisation of 125,627 chemical compositions from the ICSD on the cover page of the journal issue 24 in December 2020.
 2019 : S.Kalisnik, V.Kurlin, D.Lesnik. A higherdimensional Homologically Persistent Skeleton.
Advances in Applied Mathematics, v.102 (2019), p.113142.
This paper has received the highest praise from colleagues (ranked as 4* in the departmental assessment for REF 2021).
 2014 : V. Kurlin, A fast and robust algorithm to count topologically persistent holes in noisy clouds.
Proceedings of CVPR 2014:
Computer Vision and Pattern Recognition, p. 14581463.
This paper is in the top 3 conference in Computer Science, the highest hindex conference in any field.
 2008 : C. Kearton, V. Kurlin,
All 2dimensional links live inside a universal 3dimensional polyhedron.
AGT : Algebraic and Geometric Topology, v. 8 (2008), no. 3, p. 12231247.
This highly cited paper in pure mathematics developed the singularity theory for 2dimensional links.
 2005 : V. Kurlin. Compressed Drinfeld associators.
Journal of Algebra, v. 292 (2005), no. 1, p. 184242.
This paper discovered a compressed formula for log(e^x e^y) modulo commutators of commutators, motivated by knots.
 2000 : V. Kurlin.
Basic embeddings into a product of graphs.
Topology and Its Applications, v. 102 (2000), p. 113137.
This paper was completed during the 2nd year of the undergraduate degree and formed the first half of my PhD.
Back to Top of this page  Back to Home page
All papers by research topics and chronologically (Google scholar, arXiv)
2022
2021
2020
2019
2018
2017
2016
2015
20112014
20082010
20052007
20012004
19992000

Since 2020 : new area Geometric Data Science
for applications in Rigid Shapes, Crystallography, and Materials
 Periodic Geometry :
NeurIPS 2022 
MATCH 2022 
ISVC 2022 
DGMM 2022 
SoCG 2021 
DGMM 2021 
CRaT 2020
 Comp. Materials Science :
JACS 2022 
Dig. Discovery 2022 
DAMDID 2022 
Chem. Sci. 2021 
Chem. Mat. 2020
 Fast algorithms for nearest neighbor search in metric spaces : TopoInVis 2022
 The latest work on continuous isometry invariants and computable metrics for finite and periodic point sets is regularly discussed at the annual conference MACSMIN, the weekly MIF++ seminar on zoom, and the DSTA group seminar.
Introduction to Periodic Geometry and Topology, this draft book (June 2021 version) will be updated in late 2022.
 Finite sets: Generic families of sets with identical 1D persistence, the latest pdf, an early version in arxiv:2202.00577
Computable complete invariants for finite clouds of unlabeled points, the latest pdf, an early version in arxiv:2207.08502
 Dimension 2 : Mathematics of 2dimensional lattices, the latest pdf, an early version in arxiv:2201.05150
Geographicstyle maps for 2dimensional lattices, the latest pdf, an early version in
arxiv:2109.10885
Densest crystallographic symmetry group packings, the latest pdf, an early version in arxiv:2202.11959
Densest plane group packings of regular polygons, the latest pdf, an early version in arxiv:2207.08959
 Dimension 3 : A classification of 3dimensional lattices, the latest pdf, an early version in arxiv:2201.10543
Welcome to a continuous world of 3dimensional lattices, the latest pdf, an early version in
arxiv:2109.11538
 Any dimension :
Continuous metrics on periodic crystals, the latest pdf, an early version in arxiv:2205.15298
Continuous metrics on finite and 1periodic sequences, the latest pdf, an early version in arxiv:2205.04388
 Since 2011 : Applied Mathematics for Topological Data Analysis, Computer Vision, Robotics, and Climate
 19992010 : Pure Mathematics (graphs, topology, noncommutative algebra)
 2008  2010 :
singularity theory related to knots and links
 2005  2007 :
postdoctoral work on noncommutative algebra
 2001  2004 :
PhD work on classifications of embedded graphs
 1999  2000 : MSc work
on link invariants and basic embeddings
Back to All papers 
Back to Top of this page 
Back to Home page

 Dan Widdowson, Vitaliy Kurlin.
 Resolving the data ambiguity for periodic crystals.
 Proceedings of NeurIPS 2022: Neural Information Processing Systems.

[extended, 26 pages, 3.9M]
[project page]
[reference]


 Qiang Zhu, Jay Johal, Dan Widdowson, Zhongfu Pang, Boyu Li, Christopher M. Kane, Vitaliy Kurlin, Graeme Day, Marc Little, Andrew I Cooper.
 Analogy Powered by Prediction and Structural Invariants: ComputationallyLed Discovery of a Mesoporous HydrogenBonded Organic Cage Crystal.
 JACS (J Amer. Chem. Society), 2022, 144, 22, 9893–9901.

[9 pages, 3M]
[project page]
[reference]


 Dan Widdowson, Marco M Mosca, Angeles Pulido, Vitaliy Kurlin, Andrew I Cooper.
 Average Minimum Distances of periodic point sets  foundational invariants for mapping all periodic crystals.
 MATCH Communications in Mathematical and in Computer Chemistry, v.87(3), p.529559, 2022.

[24 pages, 2.6M]
[project page]
[reference]


 Aikaterini Vriza, Ioana Sovago, Dan Widdowson, Peter Wood, Vitaliy Kurlin, Matthew Dyer.
 Molecular Set Transformer: Attending to the cocrystals in the Cambridge Structural Database.
 Digital Discovery, 2022.

[21 pages, 3.8M]
[project page]
[reference]


 Phil Smith, Vitaliy Kurlin.
 A practical algorithm for degreek Voronoi domains of threedimensional periodic point sets.
 Proceedings of ISVC 2022 : International Symposium on Visual Computing, to appear in Lecture Notes in Computer Science.

[15 pages, 2M]
[project page]
[reference]


 Jakob Ropers, Marco Mosca, Olga Anosova, Vitaliy Kurlin,
Andrew Cooper.
 Fast predictions of lattice energies by continuous isometry invariants of crystal structures.
 Proceedings of DAMDID : Data Analytics and Management in Data Intensive Domains.

[early version]
[project page]
[reference]


 Yury Elkin, Vitaliy Kurlin.
 Counterexamples expose gaps in the proof of time complexity for cover trees introduced in 2006.
 Proceedings of TopoInVis 2022 : IEEE Workshop on Topological Data Analysis and Visualization.

[early version]
[9 pages, 240K]


 Grzegorz Muszynski, Vitaliy Kurlin, Dmitriy Morozov, Michael Wehner, Karthik Kashinath, Prabhat Ram
 Topological Methods for Pattern Detection in Climate Data.
 Big Data Analytics in Earth, Atmospheric and Ocean Sciences, p. 227242, Wiley.

[official link]

Back to Top of this page  Back to Home page

 Yury Elkin, Vitaliy Kurlin.
 Isometry invariant shape recognition of projectively perturbed point clouds by the mergegram extending 0D persistence.
 Mathematics, 2021, 9(17), 2121.

[17 pages, 1.5M]
[project page]
[reference]


 Phil Smith, Vitaliy Kurlin.
 Skeletonisation algorithms with theoretical guarantees for unorganised point clouds with high levels of noise.
 Pattern Recognition, v.115 (2021), 107902.

[extended, 48 pages, 7.6M]
[project page]
[reference]


 Aikaterini Vriza, Angelos Canaj, Rebecca Vismara, Laurence Cook, Troy Manning, Michael Gaultois, Peter Wood, Vitaliy Kurlin, Neil Berry, Matthew Dyer and Matthew Rosseinsky.
 One class classification as a practical approach for accelerating ππ cocrystal discovery.
 Chemical Science, v.12 (2021), p.17021719.

[18 pages, 2.7M]
[project page]
[reference]


 G. Muszynski, Prabhat, J. Balewski, K. Kashinath, M. Wehner, V. Kurlin.
 Atmospheric Blocking Pattern Recognition in Global Climate Model Simulation Data.
 Proceedings of ICPR : International Conference on Pattern Recognition.

[8 pages, 5.9M]
[project page]
[reference]

Back to Top of this page  Back to Home page

 Cameron Hargreaves, Matthew Dyer, Michael Gaultois, Vitaliy Kurlin, Matthew Rosseinsky.
 The Earth Mover’s Distance as a Metric for the Space of Inorganic Compositions.
 Chemistry of Materials, volume 32 (24), p.1061010620 (December 2020).

[11 pages, 3.5M]
[project page]
[reference]


 Arshad Siddiqui, Vitaliy Kurlin.
 Polygonal Meshes of Noisy Images based on a new Thinning Algorithm with Theoretical Guarantees.
 Proceedings of VISAPP 2020 (International Conference on Computer Vision Theory and Applications).

[10 pages, 16M]
[project page]
[reference]
[official link]


 Thomas Welsch, Vitaliy Kurlin.
 Synthesis through Unification Genetic Programming.
 Proceedings of GECCO : Genetic and Evolutionary Computation Conference.

[8 pages, 414K]
[official link]

Back to All papers 
Back to Top of this page 
Back to Home page

 Jonathan Rutz et al.
 The Atmospheric River Tracking Method Intercomparison Project (ARTMIP): Quantifying Uncertainties in Atmospheric River Climatology.
 Journal of Geophysical Research: Atmospheres, v. 124 (24), 2019, p. 1377713802.

[50 pages, 5.5M]
[project page]
[reference]


 Sara Kalisnik, Vitaliy Kurlin, Davorin Lesnik.
 A higherdimensional Homologically Persistent Skeleton.
 Advances in Applied Mathematics, v.102 (2019), p.113142.

[30 pages, 1M]
[project page]
[reference]


 Yury Elkin, Di Liu, Vitaliy Kurlin.
 A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space.
 Proceedings of TopoInVis 2019 : Topologybased methods In Visualization.
To appear as a chapter in a refereed book by Springer in 2021.

[19 pages, 6.8M]
[project page]
[reference]


 Grzegorz Muszynski, Karthik Kashinath, Vitaliy Kurlin, Michael Wehner, Prabhat
 Topological Data Analysis and Machine Learning for Recognizing Atmospheric River Patterns in Large Climate Datasets.
 Geoscientific Model Development, v. 12, p. 613628, 2019.

[24 pages, 7.4M]
[project page]
[reference]
[official link]


 Naohiko Ban, Wataru Yamazaki, Vitaliy Kurlin.
 Development of a Reconstruction Method for Major Vortex Structure around Tandem Flapping Wing Object via Vortex Trajectory Method.
 American Institute of Aeronautics and Astronautics SciTech Forum (2019).

[37 pages, 7.2M]
[project page]
[reference]
[official link]


 Vitaliy Kurlin, Grzegorz Muszynski.
 A persistencebased approach to automatic detection of line segments in images.
 Proceedings of CTIC 2019 (Computational Topology in Image Context)
Lecture Notes in Computer Science, v. 11382 (2019), p. 137150.

[14 pages, 2.7M]
[project page]
[reference]
[official link]

Back to All papers 
Back to Top of this page 
Back to Home page

 Jonathan Rutz et al.
 The Atmospheric River Tracking Method Intercomparison Project (ARTMIP): project goals and experimental design.
 Geoscientific Model Development, v. 11, 24552474, 2018.

[20 pages, 5.3M]
[project page]
[reference]

Back to All papers 
Back to Top of this page 
Back to Home page

 Vitaliy Kurlin, Donald Harvey.
 Superpixels Optimized by Color and Shape (SOCS).
 Proceedings of EMMCVPR 2017 (Energy Minimization Methods in Computer Vision and Pattern Recognition), LNCS 10746, p. 297311, Springer.

[14 pages, 4.9M]
[project page]
[reference]

vs


Back to All papers 
Back to Top of this page 
Back to Home page

 Jeremy Forsythe, Vitaliy Kurlin,
Andrew Fitzgibbon.
 Resolutionindependent superpixels based on convex constrained meshes without small angles.
 Proceedings of ISVC 2016: International Symposium on Visual Computing.
 Lecture Notes in Computer Science, v. 10072, p. 223233.

[10 pages, 3.7M]
[project page]
[reference]


 Vitaliy Kurlin.
 A fast persistencebased segmentation of noisy 2D clouds with provable guarantees.
 Pattern Recognition Letters, v. 83 (2016), p. 312.

[full version: 16 pages, 4.2M]
[project page]
[reference]
[official]

Back to All papers 
Back to Top of this page 
Back to Home page

 Vitaliy Kurlin.
 A onedimensional Homologically Persistent Skeleton of a point cloud in any metric space.
 Computer Graphics Forum, v. 34, no. 5 (2015), p. 253262.
 A special issue devoted to SGP 2015:
Eurographics Symposium on Geometry Processing.

[10 pages, 3.2M]
[project page]
[reference]
[official link]


 Vitaliy Kurlin.
 A Homologically Persistent Skeleton is a fast and robust descriptor of interest points in 2D images.
 Lecture Notes in Computer Science, v. 9256 (2015), p. 606617.
 (Proceedings of
CAIP 2015: Computer Analysis of Images and Patterns).

[12 pages, 1.2M]
[project page]
[reference]
[official link]


 Herbert Edelsbrunner, Mabel IglesiasHam, Vitaliy Kurlin.
 Relaxed disk packing.
 Proceedings of CCCG 2015:
Canadian Conference on Computational Geometry, p.128135.

[8 pages, 390K]
[arXiv:1505.03402]
[proceedings in pdf, 30M]

@inproceedings{EIHK15CCCG,
author = {Edelsbrunner, E. and IglesiasHam, M. and Kurlin, V.},
title = {Relaxed disk packing},
booktitle = {Proceedings of CCCG 2015: Canadian Conference on Computational Geometry},
year = {2015}
}

 Vitaliy Kurlin.
 A linear time algorithm for visualizing knotted structures in 3 pages.
 Proceedings of IVAPP 2015:
Information Visualization Theory and Applications, p. 516.

[12 pages, 2.5M]
[project page]
[reference]
[official link]

Back to All papers 
Back to Top of this page 
Back to Home page

 Vitaliy Kurlin.
 A fast and robust algorithm to count topologically persistent holes in noisy clouds.
 Proceedings of CVPR 2014:
Computer Vision and Pattern Recognition, p. 14581463
(top 3 conference in Computer Science, the highest hindex conference in any field).

[extended: 10 pages, 1.6M]
[project page]
[reference]


 Vitaliy Kurlin.
 Autocompletion of contours in sketches, maps and sparse 2D images based on persistence.
 Proceedings of workshop CTIC (Computational Topology in Image Context) at SYNASC 2014
 (Symposium on Symbolic and Numeric Algorithms for Scientific Computing), p. 594601.

[8 pages, 1.1M]
[project page]
[reference]
[code: betaversion]


 Vitaliy Kurlin, Marjan SafiSamghabadi.
 Computing a skeleton of the configuration space of 2 round robots on a metric graph.
 Proceedings of ICRoM 2014:
International Conference on Robotics and Mechatronics, p. 723729.

[7 pages, 370K]
Slides [pdf, 32 pages, 1.6M]
[official link]

@inproceedings{kurlin2014computing,
author = {Kurlin, V. and SafiSamghabadi, M.},
title = {Computing a skeleton of the configuration space of 2 round robots on a metric graph},
booktitle = {Proceedings of ICRoM 2014: International Conference on Robotics and Mechatronics},
pages = {723729},
year = {2014}
}
 Input: a radius r of two robots and a metric graph G with fixed lengths of edges.
 Output: connected components of the configuration space of two robots in G.
 Running time: O(n^{4}) for the number n of vertices in the given graph G.
 Abstract. A connected metric graph G with n vertices and without loops and multiple edges can be represented as an nbyn matrix whose entries are length of edges of G. A robot in the metric graph G is a metric ball with a centre x in G and a radius r>0. The configuration space OC(G,r) of two robots in G is the set of all centers (x,y) such that the centres x,y are at least 2r away from each other. We introduce the configuration skeleton CS(G,r) that captures all connectivity information of the space OC(G,r). As a consequence we get a polynomial time algorithm to find all connected components of OC(G,r) that are maximal subsets of all positions (x,y) connectable by collisionfree motions.
Back to All papers 
Back to Top of this page 
Back to Home page
 Vitaliy Kurlin, Ludmila Mihaylova.
How many wireless sensors are needed to guarantee connectivity
of a 1D network with random internode spacings?
Journal of Applied Probability and Statistics,
v. 8 (2013), no. 2, p. 2750.
(1M, 24 pages).

Alexey Chernov, Vitaliy Kurlin.
Reconstructing persistent graph structures from noisy images.
Journal ImageA,
v. 3 (2013), no. 5, p. 1922.
(229K, 4 pages).
Back to All papers 
Back to Top of this page 
Back to Home page
2012 :
HHA
 Vitaliy Kurlin.
Computing braid groups of graphs with applications to robot motion planning.
Homology, Homotopy and Applications,
v. 14 (2012), no. 1, p. 159180.
(249K, 22 pages).
Back to All papers 
Back to Top of this page 
Back to Home page
2008  2010 : singularity theory applied to knots and links
 Thomas Fiedler, Vitaliy Kurlin.
Recognizing trace graphs of closed braids.
Osaka Journal of Mathematics,
v. 47 (2010), no. 4, p. 885909.
(1.8M, 25 pages).
 Thomas Fiedler, Vitaliy Kurlin.
A oneparameter approach to links in a solid torus.
Journal of the Mathematical Society of Japan,
v. 62 (2010), no. 1, p. 167211.
(1.8M, 45 pages).
 Thomas Fiedler, Vitaliy Kurlin.
Fiber quadrisecants in knot isotopies.
J
Knot Theory Ramifications, v. 17 (2008), no. 11, p. 14151428.
(780K, 14 pages).
 Cherry Kearton, Vitaliy Kurlin.
All 2dimensional links live inside a universal 3dimensional polyhedron.
Algebraic & Geometric Topology, v. 8 (2008), no. 3, p. 12231247.
(560K, 25 pages).
 Vitaliy Kurlin.
Gauss paragraphs of classical links and a characterization of virtual link groups.
Math. Proc. Cambridge Phil. Society, v. 145 (2008), no. 1, p. 129140.
(223K, 12 pages).
Back to All papers 
Back to Top of this page 
Back to Home page
2005  2007 : postdoctoral work on noncommutative algebra
 Vitaliy Kurlin, Daniel Lines.
Peripherally specified homomorphs of link groups.
J Knot Theory Ramifications, v. 16 (2007), no. 6, p. 719740.
(435K, 22 pages).
 Vitaliy Kurlin.
The BakerCampbellHausdorff formula in the free metabelian Lie algebra.
Journal of Lie Theory, v. 17 (2007), no. 3, p. 525538.
(190K, 14 pages).
 Vitaliy Kurlin.
Threepage encoding and complexity theory for spatial graphs.
J Knot Theory Ramifications, v. 16 (2007), no. 1, p. 59102.
(800K, 44 pages).
 Vitaliy Kurlin.
Compressed Drinfeld associators.
Journal of Algebra, v. 292 (2005), no. 1, p. 184242.
(400M, 59 pages).
Back to All papers 
Back to Top of this page 
Back to Home page
2001  2004 : PhD work on a classification of embedded graphs
 Vitaliy Kurlin, Vladimir Vershinin.
Threepage embeddings of singular knots.
Functional Analysis and Its Applications, v. 38 (2004), no. 1, p. 1427.
(200K, 14 pages).
 Vitaliy Kurlin.
Basic embeddings and 3page embeddings of graphs.
Russian Mathematical Surveys, v. 58 (2003), no. 2, p. 372374.
(116K, 3 pages).
 Vitaliy Kurlin.
Threepage Dynnikov's diagrams of spatial 3valent graphs.
Functional Analysis and Its Applications, v. 35 (2001), no. 3, p. 230233.
(96K, 4 pages).
Back to All papers 
Back to Top of this page 
Back to Home page
1999  2000 : MSc work on link invariants and basic embeddings
 Vitaliy Kurlin.
Basic embeddings into a product of graphs.
Topology and Its Applications, v. 102 (2000), no. 2, p. 113137.
(225K, 25 pages).
 Vitaliy Kurlin.
Reduction of framed links to ordinary links.
Russian Mathematical Surveys, v. 54 (1999), no. 4, p. 845846.
(244K, 2 pages).
 Vitaliy Kurlin.
Invariants of colored links.
Moscow University Math. Bulletin, v. 54 (1999), no. 3, p. 4244.
(670K, 3 pages).
Back to All papers 
Back to Top of this page 
Back to Home page
Invited lectures at international conferences
2022 
20202021 
2019 
20172018 
2016 
2015 
20112014 
20072010 
20052006 
19992004
Videos of past talks, see also the most recent
 The Crystal Isometry Principle (48 min) at MACSMIN: Maths & Computer Science for Materials Innovation, Sep 2021.
 A unique and continuous code of all periodic crystals (16 min) at MS65 of the IUCr congress (online), August 2021.
 Introduction to invariantbased machine learning for periodic crystals (20 min) at the IUCr congress, August 2021.
 Introduction to Periodic Geometry and Topology (32 min) at the Geometric Topology Workshop (online), June 2021.
 Introduction to Periodic Geometry and Topology (44 min) at Geometry and Topology behind fabrics (online), May 2021.
 Introduction to Periodic Geometry (25 min) at MACSMIN: Maths & Computer Science for Materials Innovation, Sep 2020.
 The mergegram of a dendrogram (24 min) at Mathematical Foundations of Computer Science (online), August 2020.
 Peristencebased image skeletonization (30 min) at the SIAM symposium Topological Image Analysis (online), June 2020.
 Skeletonization algorithms with theoretical guarantees for unorganized point clouds (1 hour) at AATRN (US), May 2018.
 Topological methods for a faster materials discovery (47 min) at Applied Topology,
Bedlewo (Poland), June 2017.
 1min video spotlight
at CVPR 2014
(Computer Vision and Pattern Recognition), Columbus, Ohio (USA), June 2014.

Applications of Topological Data Analysis to Computer Vision (1h),
Microsoft
Research, Cambridge (UK), February 2014.

Reconstruction of plane graphs from noisy samples (1 hour),
Informatics Forum, Edinburgh University, April 2013.
Oral presentations in 2022
Oral presentations in 20202021
Back to All lectures 
Back to Top of this page 
Back to Home page
Oral presentations in 2019
Back to All lectures 
Back to Top of this page 
Back to Home page
Oral presentations in 20172018
Back to All lectures 
Back to Top of this page 
Back to Home page
Oral presentations in 2016
 August 2016 : BTM 2016 (British Topology Meeting), Glasgow University (UK).
Title : Graph reconstruction from noisy scans based on persistence (1hour keynote lecture).
 July 2016 : ATMCS 8 (Applied Topology: Methods, Computation, Science), Turin (Italy).
Title : Graph reconstruction from noisy point samples (30min software demo).
 July 2016 : 7 ECM (European Congress of Mathematics), Berlin (Germany).
Title : Topological Computer Vision (20min contributed talk).
 April 2016 : symposium Today's Data Predicting Tomorrow, Loughborough (UK).
Title : Applications of Topological Data Analysis (25min invited talk).
 April 2016 : BAMC 2016: British Applied Mathematical Colloquium, Oxford (UK).
Title : Convex constrained meshes of superpixels (20min contributed talk).
 January 2016 : ATI workshop
Mathematical Foundations of Learning for nonEuclidean Objects, London (UK).
Title : Topological Computer Vision (20min invited talk).
 January 2016 : Prospects in Data Science, Southampton (UK).
Title : Topological Computer Vision (40min keynote lecture).
Back to All lectures 
Back to Top of this page 
Back to Home page
Oral presentations in 2015
 October 2015 :
Computational Geometric and Algebraic Topology, Oberwolfach (Germany).
Title : HoPeS (cloud segmentations and persistent skeletons): (15min software demo).
 September 2015 :
CAT 2015:
Computational Algebraic Topology, Oxford (UK).
Title : Topological Computer Vision is a new area in Topological Data Analysis (25min invited talk).
 July 2015 :
ACA 2015:
Applications of Computer Algebra, Kalamata (Greece).
Title : Fast and stable topological profiles of noisy 2D images (30min contributed talk).
 July 2015 :
ACAT 2015:
Applied and Computational Algebraic Topology, IST Austria.
Title : A homologically persistent skeleton of an unstructured point cloud (40min contributed talk).
 July 2015 :
SGP 2015:
Eurographics Symposium on Geometry Processing, Graz (Austria).
Title : A homologically persistent skeleton of an unstructured point cloud (30min talk with the accepted paper).
 June 2015 :
DyToComp 2015:
Dynamics, Topology, and Computation, Bedlewo (Poland).
Title : A Homologically Persistent Skeleton in Computer Vision and beyond (30min contributed talk).
 May 2015 :
MMMDS:
Mathematical Methods for Massive Data Sets, Edinburgh (UK).
Title : Topological Data Analysis. Applications to Computer Vision (45min invited talk).
 May 2015 :
TopoInVis 2015:
TopologyBased Methods in Visualization, Annweiler (Germany).
Title : Computing invariants of knotted graphs given by sequences of 3D points (25min talk with the accepted paper).
 April 2015 :
BAMC:
British Applied Mathematical Colloquium, Cambridge (UK).
Title : Topological Data Analysis. Applications to Computer Vision (20min contributed talk).
 March 2015 :
IVAPP:
Information Visualization Theory and Applications, Berlin (Germany).
Title : A linear time algorithm for visualizing knotted structures in 3 pages (30min talk with the accepted paper).
 February 2015 :
Algebraic Topology: Computation, Data Analysis, and Applications
workshop at the Oxford Mathematical Institute (United Kingdom).
Title : Homologically persistent skeleton (20min invited talk).
 January 2015 :
Applied
Algebraic Topology network, Queen Mary University of London (UK).
Title : Topological Data Analysis. Applications to Computer Vision (45min invited talk).
 January 2015 :
Transpennine
Topology Triangle meeting, University of Sheffield (UK).
Title : Topological Data Analysis. Applications to Computer Vision (1 hour).
 January 2015 : Winter School on Lowdimensional Topology, La Llagonne (France).
Title : Topological Data Analysis. Applications to Computer Vision (45min invited talk).
Back to All lectures 
Back to Top of this page 
Back to Home page
Oral presentations in 20112014
 September 2014 :
CTIC: Computational Topology in Image Context, Timisoara (Romania).
Title 1 : Autocompletion of closed contours based on topological persistence (20 min).
Title 2 : Drawing a graph in 3 pages within its isotopy class in a linear time (20 min).
 September 2014 :
British Topology Meeting,
Southampton (United Kingdom).
Title : Topological Data Analysis. Applications to Computer Vision (30 min).
 July 2014 :
Applied Algebraic Topology,
CIEM, Castro Urdiales (Spain).
Title : Homologically Persistent Skeleton for visualizing highdimensional data (45 min).
 July 2013,
Applied Topology,
Bedlewo Conference Centre (Poland).
Title : Reconstructing persistent structures from
noisy images of graphs in a metric space (40 min).
 July 2013 :
Applied
and Computational Algebraic Topology, Bremen (Germany).
Title : Persistent homotopy types of noisy samples of graphs in the plane (30 min).
Back to All lectures 
Back to Top of this page 
Back to Home page
Oral presentations in 20072010
Back to All lectures 
Back to Top of this page 
Back to Home page
Oral presentations in 20052006
 September 2006 :
Lowdimensional Manifolds,
Burgo de Osma (Spain).
Title : Compressed Drinfeld associators (25 min).
 August 2006 :
International
Congress of Mathematicians 2006,
Madrid (Spain).
Title : Compressed BakerCampbellHausdorff formula
(20min oral communication).
 May 2006 :
Knots,
Groups and 3Manifolds,
Marseille (France).
Title : Peripherally specified homomorphs of link groups (20 min).
 April 2006 :
54th
Transpennine Topology Triangle meeting,
Sheffield (UK).
Title : Compressed BakerCampbellHausdorff formula (1 hour).
 April 2006 :
Algebraic Geometry,
Singularities, Knots,
Liverpool (UK).
Title : Topological approach to the conjugacy of braids (1 hour).
 April 2006 :
British Mathematical Colloquium 2006,
Newcastle (UK).
Title : Compressed BakerCampbellHausdorff formula (25 min).
 November 2005 :
Combinatorial Braid Theory, Brighton (UK).
Title : Oneparameter approach to knot theory (45+45 min).
 June 2005, Rencontres du GDR Tresses (braids), Luminy (France).
Title : Fiedler's 1parameter approach to knot theory (30 min).
Back to All lectures 
Back to Top of this page 
Back to Home page
Oral presentations in 19992004
 September 2004 :
Rencontres du GDR Tresses (braids), Tatihou (France).
Title : Description of compressed Drinfeld associators (40 min).
 July 2004 :
Geometry, Topology and Combinatorics (satellite of
ECM 2004), Stockholm (Sweden).
Title : Computing compressed Drinfeld associators (30 min).
 June 2004 : Rencontres du GDR Tresses (braids), Autrans (France).
Title : A program to compute Drinfeld associators (30 min).
 May 2003 : Kolmogorov and Contemporary Mathematics, Moscow.
Title : Basic embeddings of graphs (20 min).
 June 2001 : Knot Theory and Algebraic Geometry, Liverpool (UK).
Title : Threepage embeddings of spatial 3valent graphs (30 min).
 October 2000 :
Combinatorcs, Dynamics and Probability, Stockholm (Sweden).
Title : Algebraic classification of spatial 3valent graphs (30 min).
 March 2000 :
Geometry and Applications,
Novosibirsk.
Title : Diagrams of spatial 3valent graphs (20 min).
 August 1999 : Lowdimensional topology and combinatorial group theory,
Chelyabinsk.
Title : Reduction of framed links to ordinary ones (30 min).
Back to All lectures 
Back to Top of this page 
Back to Home page
Smaller research grants, see also larger awards

Faculty summer bursaries (value 2×1K GBP) at the University of Liverpool for 2nd year undergraduates Cristian Badoi and Wenkai Zhang (2019). 

Since 2017 the organiser of the network Applied Algebraic Topology covering 3 meetings per year at the Universities of Liverpool, Queen Mary (G.Bianconi, M.Farber) and Southampton (J.Brodzki, J.Grbić), funded by the London Mathematical Society (value 5.7K GBP in 20172020).


EPSRC vacation bursaries (value 2×2.7K GBP) at the University of Liverpool for 2nd year undergraduates Simon Hirst (2017) and Gee Jack (2018). 

Summer bursary of the London Mathematical Society for Philip Smith (value 1.1K GBP)
to work on the project Superpixel meshes for faster image and video processing in August  September 2016, closely related to the collaboration with
Microsoft Research Cambridge. 

Christopherson/Knott fellowship at
Institute of Advanced Study (left after moving to Liverpool, UK). Title : Optimal meshes of superpixels for faster image processing (7.5K GBP 3month teaching replacement). 

Conference grant (3K GBP, jointly with M.Grinfeld and
M.Haw) to run the ATI strategic workshop on 14 March 2016 : Topological Data Analysis in Materials Science and Engineering. 

Travel grant of the London Mathematical Society to give the contributed 20min talk
Topological Computer Vision in the section Mathematical Image and Signal Processing at 7ECM (European Congress of Mathematicians) at
TU Berlin on 1822 July 2016. 

Travel grant (1.7K Euros) by the ACAT
(Applied and Computational Algebraic Topology) network of ESF (European Science Foundation) to visit IST Austria (March 2015). 

INTAS
PhD Fellowship (10K Euros) at
Moscow State University,
March 2001  February 2003, covered research collaboration at
Universities of Montpellier II, Liverpool, Dijon, Toulouse III, Paris VII. 
Back to Top of this page  Back to Home page
Coauthors in the alphabetical order (last updated in 2016)
 Alexey Chernov : Senior Lecturer in Statistics at University of Brighton, UK
 Herbert Edelsbrunner : Professor at IST Austria
 Thomas Fiedler : Professor at University of Toulouse III, France
 Andrew Fitzgibbon: Principal Researcher at Microsoft Research Cambridge, UK
 Jeremy Forsythe : former final year project student, UK
 Donald Harvey : former final year project student, UK
 Mabel IglesiasHam : PhD graduate from IST Austria
 Cherry Kearton : retired Reader, UK
 Daniel Lines : retired Professor at University of Burgundy, Dijon, France
 Ludmila Mihaylova : Professor at University of Sheffield, UK
 Marjan SafiSamghabadi :
Lecturer at International Imam Khomeini University, Iran
 Christopher Smithers : former PhD student, UK
 Vladimir Vershinin : Professor at University of Montpellier II, France
Back to Top of this page 
Back to Home page