Dario Cavallaro

According to our database, Dario Cavallaro authored at least 7 papers between 2021 and 2026.

Collaborative distances:

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

2026

Optimal Bounds for the k-Disjoint Paths Problem.

Dario Cavallaro, Maximilian Gorsky, Stephan Kreutzer, Dimitrios M. Thilikos, Sebastian Wiederrecht

CoRR, May, 2026

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width.

Dario Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer

CoRR, May, 2026

The Directed Disjoint Paths Problem with Congestion.

Matthias Bentert, Dario Cavallaro, Amelie Heindl, Ken-ichi Kawarabayashi, Stephan Kreutzer, Johannes Schröder

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Well-Quasi-Ordering Eulerian Digraphs Embeddable in Surfaces by Strong Immersion.

Dario Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer

CoRR, September, 2025

2024

Edge-Disjoint Paths in Eulerian Digraphs.

Dario Giuliano Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2021

3-Coloring on Regular, Planar, and Ordered Hamiltonian Graphs.

Dario Cavallaro, Till Fluschnik

CoRR, 2021

Feedback Vertex Set on Hamiltonian Graphs.

Dario Cavallaro, Till Fluschnik

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021