Search for persons
X
?
Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms ,
1
Embeddability of simplicial complexes is undecidable:
, In:
?
Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms ,
2
Connectivity of triangulation flip graphs in the plane (par..:
, In:
?
Proceedings of the thirtieth annual symposium on Computational geometry ,
3
Eliminating Tverberg Points, I. An Analogue of the Whitney ..:
, In:
?
Proceedings of the thirtieth annual symposium on Computational geometry ,
4
Embeddability in the 3-sphere is decidable:
, In:
?
Proceedings of the forty-fifth annual ACM symposium on Theory of Computing ,
5
Extending continuous maps : polynomiality and undecidabi..:
, In:
?
Proceedings of the twenty-eighth annual symposium on Computational geometry ,
6
On laplacians of random complexes:
, In:
?
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms ,
7
Computing all maps into a sphere:
, In:
?
Proceedings of the twenty-seventh annual symposium on Computational geometry ,
8
Minors in random and expanding hypergraphs:
, In:
?
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms ,
9
Hardness of embedding simplicial complexes in Rd:
, In:
?
Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms ,
10
Online conflict-free coloring for intervals:
, In:
?
Proceedings of the nineteenth annual symposium on Computational geometry ,
11
Shape dimension and intrinsic metric from samples of manifo..:
, In:
?
Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms ,
12
On the rectilinear crossing number of complete graphs:
, In:
?
Proceedings of the sixteenth annual symposium on Computational geometry ,
13
Origin-embracing distributions or a continuous analogue of ..:
, In:
?
2022 IEEE 49th Photovoltaics Specialists Conference (PVSC) ,
14
Potentiostatic Photoluminescence Imaging of Charge Extracti..:
, In:
?
Proceedings; 20. Internationales Stuttgarter Symposium ,
15