Artur Polanski

Orcid: 0000-0002-3302-2551

According to our database1, Artur Polanski authored at least 4 papers between 2021 and 2026.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of five.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Computational Complexity of Edge Coverage Problem for Constrained Control Flow Graphs.
CoRR, February, 2026

Efficient Dynamic Test Case Generation for Path-Based Coverage Criteria.
CoRR, February, 2026

2025
Optimal solutions for variants of graph coverage-related problems in software test design.
Expert Syst. Appl., 2025

2021
Detecting a single fault in a deterministic finite automaton.
CoRR, 2021


  Loading...