Bence Deák

According to our database1, Bence Deák authored at least 2 papers between 2025 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Asymptotically faster algorithms for recognizing (k,ℓ)-sparse graphs.
CoRR, April, 2026

2025
Quadratic-Time Algorithm for the Maximum-Weight (k, ℓ)-Sparse Subgraph Problem.
CoRR, November, 2025


  Loading...