activity
20082018
most citedApproximability and parameterized complexity of minmax values

2 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2017

Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs

Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano +2

Connectivity related concepts are of fundamental interest in graph theory. The area has received extensive attention over four decades, but many problems remain unsolved, especiall…