Michal Certík

According to our database, Michal Certík authored at least 4 papers between 2025 and 2026.

Collaborative distances:

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

2026

Complexity Aspects of Homomorphisms of Ordered Graphs.

Michal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski

Proceedings of the SOFSEM 2026: Theory and Practice of Computer Science, 2026

On Computational Aspects of Cores of Ordered Graphs.

Michal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski

Proceedings of the Relational and Algebraic Methods in Computer Science, 2026

2025

Communications: Duality, chi-Boundedness and Order Density of Homomorphisms of Ordered Graphs.

Michal Certík, Jaroslav Nesetril

Proceedings of the 26th Italian Conference on Theoretical Computer Science, 2025

On Computational Aspects of Ordered Matching Problems.

Michal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski

Proceedings of the Theoretical Aspects of Computing - ICTAC 2025, 2025