Jakub Zelek

According to our database, Jakub Zelek authored at least 4 papers between 2025 and 2026.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2026

Computational Complexity of Edge Coverage Problem for Constrained Control Flow Graphs.

Jakub Ruszil, Artur Polanski, Adam Roman, Jakub Zelek

CoRR, February, 2026

Efficient Dynamic Test Case Generation for Path-Based Coverage Criteria.

Jakub Zelek, Jakub Ruszil, Adam Roman, Artur Polanski

CoRR, February, 2026

2025

Diblob: A Python framework for computations on digraphs as software models with focus on effective test case design.

Jakub Zelek, Adam Roman

SoftwareX, 2025

Optimal solutions for variants of graph coverage-related problems in software test design.

Artur Polanski, Adam Roman, Jakub Zelek

Expert Syst. Appl., 2025