Personensuche
X
?
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing ,
2
A quasipolynomial (2 + ε)-approximation for planar sparsest..:
, In:
?
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) ,
3
On Light Spanners, Low-treewidth Embeddings and Efficient T..:
, In:
?
Proceedings of the 28th International Conference on Advances in Geographic Information Systems ,
4
The impact of highly compact algorithmic redistricting on t..:
, In:
?
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing ,
5
New hardness results for planar graph problems in p and an ..:
, In:
?
Lecture Notes in Computer Science; Algorithms and Data Structures ,
7
A PTAS for Bounded-Capacity Vehicle Routing in Planar Graph:
, In:
?
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms ,
8
Embedding planar graphs into low-treewidth graphs with appl..:
, In:
?
Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems ,
9
Balanced centroidal power diagrams for redistricting:
, In:
?
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing ,
12
Approximating connectivity domination in weighted bounded-g..:
, In:
?
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing ,
14