Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Andrea Francke"'
Autor:
Andrea Francke, Ross Jardine
Publikováno v:
Parse Journal, Vol Management, Iss 5 (2017)
Externí odkaz:
https://doaj.org/article/86ff9cc2a2d34c488c1f1f060dc11a0c
Autor:
Andrea Francke, Csaba D. Tóth
Publikováno v:
Symposium on Computational Geometry
We study vertex-labeled graphs that can be embedded on a given point set such that every edge is a polyline with $k$ bends per edge, where $k\in \mathbb{N}$. It is shown that on every $n$-element point set in the plane, at most $\exp(O(n\log(2+k)))$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::79353ddb76782e2d80f17bbcfe93f04f
https://doi.org/10.1137/15m1046484
https://doi.org/10.1137/15m1046484
Publikováno v:
Inappropriate Bodies
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::620f909a00eb385595b812eca1e37915
https://doi.org/10.2307/j.ctvpg860f.21
https://doi.org/10.2307/j.ctvpg860f.21
Autor:
Andrea Francke, Kim Dhillon
Publikováno v:
Studies in the Maternal; Vol 8, No 2 (2016): Performing Everyday Maternal Practice; 12
Studies in the Maternal, Vol 8, Iss 2 (2016)
Studies in the Maternal, Vol 8, Iss 2 (2016)
The ideals of second wave feminism questioned the family and attempted to reconstruct an understanding of motherhood as a social category. These questions have been overshadowed by a neoliberal discourse of childcare that is constructed around partic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5a68ec488bc8e2258635659575a6656
https://doi.org/10.16995/sim.226
https://doi.org/10.16995/sim.226
We consider the following cake cutting game: Alice chooses a set P of n points in the square (cake) [ 0 , 1 ] 2 , where ( 0 , 0 ) ∈ P ; Bob cuts out n axis-parallel rectangles with disjoint interiors, each of them having a point of P as the lower l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2f507c9ed41c12980d6d316eced2ade
Autor:
Andrea Francke, Michael Hoffmann
Publikováno v:
Symposium on Computational Geometry
We show that it is an NP-hard problem to decide for a given set P of n points in the Euclidean plane and a given parameter k∈R, whether P admits a spanning tree of maximum vertex degree four whose sum of edge lengths does not exceed k.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::240a3b62209c4a466953dfdd22d128a6
https://doi.org/10.1145/1542362.1542399
https://doi.org/10.1145/1542362.1542399