Search for persons
X
?
Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science ,
5
Tight Algorithms for Connectivity Problems Parameterized by..:
, In:
?
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing ,
6
Directed flow-augmentation:
, In:
?
Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms ,
8
Solving hard cut problems via flow-augmentation:
, In:
?
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) ,
9
Solving hard cut problems via flow-augmentation:
, In:
?
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) ,
10
Optimal Discretization is Fixed-parameter Tractable:
, In:
?
Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms ,
11