Michal Adamaszek

Publication Activity (10 Years)

Years Active: 2008-2022
Publications (10 Years): 11

Top Topics

Highly Connected

Top Venues

Discret. Comput. Geom.

J. Appl. Comput. Topol.

Publications

Michal Adamaszek, Henry Adams
On Vietoris-Rips complexes of hypercube graphs. J. Appl. Comput. Topol. 6 (2) (2022)
Michal Adamaszek, Henry Adams, Ellen Gasparovic, Maria Gommel, Emilie Purvine, Radmila Sazdanovic, Bei Wang, Yusu Wang, Lori Ziegelmeier
On homotopy types of Vietoris-Rips complexes of metric gluings. J. Appl. Comput. Topol. 4 (3) (2020)
Michal Adamaszek, Henry Adams, Ellen Gasparovic, Maria Gommel, Emilie Purvine, Radmila Sazdanovic, Bei Wang, Yusu Wang, Lori Ziegelmeier
Vietoris-Rips and Cech Complexes of Metric Gluings. SoCG (2018)
Michal Adamaszek, Henry Adams, Florian Frick
Metric Reconstruction Via Optimal Transport. SIAM J. Appl. Algebra Geom. 2 (4) (2018)
Michal Adamaszek, Henry Adams, Francis C. Motta
Random cyclic dynamical systems. Adv. Appl. Math. 83 (2017)
Michal Adamaszek, Florian Frick, Adrien Vakili
On Homotopy Types of Euclidean Rips Complexes. Discret. Comput. Geom. 58 (3) (2017)
Michal Adamaszek
A Note on Independence Complexes of Chordal Graphs and Dismantling. Electron. J. Comb. 24 (2) (2017)
Michal Adamaszek, Henry Adams, Ellen Gasparovic, Maria Gommel, Emilie Purvine, Radmila Sazdanovic, Bei Wang, Yusu Wang, Lori Ziegelmeier
Vietoris-Rips and Cech Complexes of Metric Gluings. CoRR (2017)
Anna Adamaszek, Michal Adamaszek, Matthias Mnich, Jens M. Schmidt
Lower Bounds for Locally Highly Connected Graphs. Graphs Comb. 32 (5) (2016)
Michal Adamaszek, Henry Adams, Florian Frick, Chris Peterson, Corrine Previte-Johnson
Nerve Complexes of Circular Arcs. Discret. Comput. Geom. 56 (2) (2016)
Michal Adamaszek, Juraj Stacho
Complexity of simplicial homology and independence complexes of chordal graphs. Comput. Geom. 57 (2016)
Michal Adamaszek
Face Numbers of Down-Sets. Am. Math. Mon. 122 (4) (2015)
Michal Adamaszek, Henry Adams
The Vietoris-Rips complexes of a circle. CoRR (2015)
Michal Adamaszek
Extremal problems related to Betti numbers of flag complexes. Discret. Appl. Math. 173 (2014)
Michal Adamaszek
The smallest nonevasive graph property. Discuss. Math. Graph Theory 34 (4) (2014)
Michal Adamaszek
The smallest nonevasive graph property CoRR (2013)
Michal Adamaszek
Splittings of independence complexes and the powers of cycles. J. Comb. Theory, Ser. A 119 (5) (2012)
Michal Adamaszek, Juraj Stacho
Algorithmic complexity of finding cross-cycles in flag complexes. SCG (2012)
Michal Adamaszek
Vertex decompositions of two-dimensional complexes and graphs. Contributions Discret. Math. 7 (2) (2012)
Michal Adamaszek, Jonathan Ariel Barmak
On a lower bound for the connectivity of the independence complex of a graph. Discret. Math. 311 (21) (2011)
Anna Adamaszek, Michal Adamaszek
Uniqueness of Graph Square Roots of Girth Six. Electron. J. Comb. 18 (1) (2011)
Anna Adamaszek, Michal Adamaszek
Combinatorics of the change-making problem. Eur. J. Comb. 31 (1) (2010)
Anna Adamaszek, Michal Adamaszek
Large-Girth Roots of Graphs. STACS (2010)
Anna Adamaszek, Michal Adamaszek
Large-Girth Roots of Graphs. SIAM J. Discret. Math. 24 (4) (2010)
Michal Adamaszek, Artur Czumaj, Christian Sohler
Testing Monotone Continuous Distributions on High-dimensional Real Cubes. SODA (2010)
Anna Adamaszek, Michal Adamaszek
Large-girth roots of graphs CoRR (2009)
Michal Adamaszek, Piotr Chrzastowski-Wachtel, Anna Niewiarowska
VIPER, a Student-Friendly Visual Interpreter of Pascal. ISSEP (2008)