Michal Adamaszek

According to our database, Michal Adamaszek authored at least 24 papers between 2008 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

On Vietoris-Rips complexes of hypercube graphs.

Michal Adamaszek, Henry Adams

J. Appl. Comput. Topol., 2022

2020

On homotopy types of Vietoris-Rips complexes of metric gluings.

Michal Adamaszek, Henry Adams, Ellen Gasparovic, Maria Gommel, Emilie Purvine, Radmila Sazdanovic, Bei Wang, Yusu Wang, Lori Ziegelmeier

J. Appl. Comput. Topol., 2020

2018

Metric Reconstruction Via Optimal Transport.

Michal Adamaszek, Henry Adams, Florian Frick

SIAM J. Appl. Algebra Geom., 2018

Vietoris-Rips and Cech Complexes of Metric Gluings.

Michal Adamaszek, Henry Adams, Ellen Gasparovic, Maria Gommel, Emilie Purvine, Radmila Sazdanovic, Bei Wang, Yusu Wang, Lori Ziegelmeier

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

On Homotopy Types of Euclidean Rips Complexes.

Michal Adamaszek, Florian Frick, Adrien Vakili

Discret. Comput. Geom., 2017

A Note on Independence Complexes of Chordal Graphs and Dismantling.

Michal Adamaszek

Electron. J. Comb., 2017

Random cyclic dynamical systems.

Michal Adamaszek, Henry Adams, Francis C. Motta

Adv. Appl. Math., 2017

2016

Lower Bounds for Locally Highly Connected Graphs.

Anna Adamaszek, Michal Adamaszek, Matthias Mnich, Jens M. Schmidt

Graphs Comb., 2016

Nerve Complexes of Circular Arcs.

Michal Adamaszek, Henry Adams, Florian Frick, Chris Peterson, Corrine Previte-Johnson

Discret. Comput. Geom., 2016

Complexity of simplicial homology and independence complexes of chordal graphs.

Michal Adamaszek, Juraj Stacho

Comput. Geom., 2016

2015

Face Numbers of Down-Sets.

Michal Adamaszek

Am. Math. Mon., 2015

The Vietoris-Rips complexes of a circle.

Michal Adamaszek, Henry Adams

CoRR, 2015

2014

The smallest nonevasive graph property.

Michal Adamaszek

Discuss. Math. Graph Theory, 2014

Extremal problems related to Betti numbers of flag complexes.

Michal Adamaszek

Discret. Appl. Math., 2014

2012

Splittings of independence complexes and the powers of cycles.

Michal Adamaszek

J. Comb. Theory, Ser. A, 2012

Vertex decompositions of two-dimensional complexes and graphs.

Michal Adamaszek

Contributions Discret. Math., 2012

Algorithmic complexity of finding cross-cycles in flag complexes.

Michal Adamaszek, Juraj Stacho

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

On a lower bound for the connectivity of the independence complex of a graph.

Michal Adamaszek, Jonathan Ariel Barmak

Discret. Math., 2011

Uniqueness of Graph Square Roots of Girth Six.

Anna Adamaszek, Michal Adamaszek

Electron. J. Comb., 2011

2010

Large-Girth Roots of Graphs.

Anna Adamaszek, Michal Adamaszek

SIAM J. Discret. Math., 2010

Combinatorics of the change-making problem.

Anna Adamaszek, Michal Adamaszek

Eur. J. Comb., 2010

Testing Monotone Continuous Distributions on High-dimensional Real Cubes.

Michal Adamaszek, Artur Czumaj, Christian Sohler

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Testing Monotone Continuous Distributions on High-Dimensional Real Cubes.

Michal Adamaszek, Artur Czumaj, Christian Sohler

Proceedings of the Property Testing - Current Research and Surveys, 2010

2008

VIPER, a Student-Friendly Visual Interpreter of Pascal.

Michal Adamaszek, Piotr Chrzastowski-Wachtel, Anna Niewiarowska

Proceedings of the Informatics Education - Supporting Computational Thinking, Third International Conference on Informatics in Secondary Schools, 2008