Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Ballinger, Brad"'
Autor:
Aichholzer, Oswin, Ballinger, Brad, Biedl, Therese, Damian, Mirela, Demaine, Erik D., Korman, Matias, Lubiw, Anna, Lynch, Jayson, Tkadlec, Josef, Uno, Yushi
For a set $P$ of $n$ points in the plane in general position, a non-crossing spanning tree is a spanning tree of the points where every edge is a straight-line segment between a pair of points and no two edges intersect except at a common endpoint. W
Externí odkaz:
http://arxiv.org/abs/2206.03879
Autor:
Ballinger, Brad, Damian, Mirela, Eppstein, David, Flatland, Robin, Ginepro, Jessica, Hull, Thomas
Publikováno v:
ACM-SIAM Symposium on Discrete Algorithms (SODA15), (2015), 136-147
We introduce the study of forcing sets in mathematical origami. The origami material folds flat along straight line segments called creases, each of which is assigned a folding direction of mountain or valley. A subset $F$ of creases is forcing if th
Externí odkaz:
http://arxiv.org/abs/1410.2231
Autor:
Ballinger, Brad.
Publikováno v:
For electronic version search Digital dissertations database. Restricted to UC campuses. Access is free to UC campus dissertations..
Thesis (Ph. D.)--University of California, Davis, 2003.
Degree granted in Mathematics. Also available via the World Wide Web. (Restricted to UC campuses)
Degree granted in Mathematics. Also available via the World Wide Web. (Restricted to UC campuses)
Externí odkaz:
http://uclibs.org/PID/11984
Autor:
Aloupis, Greg, Ballinger, Brad, Collette, Sébastien, Langerman, Stefan, Pór, Attila, Wood, David R.
Publikováno v:
In Thirty Essays on Geometric Graph Theory (J\'anos Pach, ed.), 31-48, Springer, 2012
This paper studies problems related to visibility among points in the plane. A point $x$ \emph{blocks} two points $v$ and $w$ if $x$ is in the interior of the line segment $\bar{vw}$. A set of points $P$ is \emph{$k$-blocked} if each point in $P$ is
Externí odkaz:
http://arxiv.org/abs/1002.0190
Autor:
Abel, Zachary, Ballinger, Brad, Bose, Prosenjit, Collette, Sébastien, Dujmović, Vida, Hurtado, Ferran, Kominers, Scott D., Langerman, Stefan, Pór, Attila, Wood, David R.
Publikováno v:
Graphs and Combinatorics 27(1), (2011), 47-60
We prove the following generalised empty pentagon theorem: for every integer $\ell \geq 2$, every sufficiently large set of points in the plane contains $\ell$ collinear points or an empty pentagon. As an application, we settle the next open case of
Externí odkaz:
http://arxiv.org/abs/0904.0262
Autor:
Abel, Zachary1 zabel@fas.harvard.edu, Ballinger, Brad2 bjb86@humboldt.edu, Bose, Prosenjit3 jit@scs.carleton.ca, Collette, Sébastien4 sebastien.collette@ulb.ac.be, Dujmović, Vida3 vida@scs.carleton.ca, Hurtado, Ferran5 ferran.hurtado@upc.edu, Kominers, Scott6 kominers@fas.harvard.edu, Langerman, Stefan7 stefan.langerman@ulb.ac.be, Pór, Attila8 attila.por@wku.edu, Wood, David9 woodd@unimelb.edu.au
Publikováno v:
Graphs & Combinatorics. Jan2011, Vol. 27 Issue 1, p47-60. 14p.
Autor:
Ballinger, Brad, Charlton, David, Demaine, Erik D., Demaine, Martin L., Iacono, John, Liu, Ching-Hao, Poon, Sheung-Hung
Publikováno v:
MIT web domain
Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties needed for planar trees to lock, with a focus on finding the smallest
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od________88::b04692526b37f2af3ad973e3e8664ed0
http://hdl.handle.net/1721.1/61781
http://hdl.handle.net/1721.1/61781
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Aloupis, Greg, Ballinger, Brad, Collette, Sébastien, Langerman, Stefan, Pór, Attila, Wood, David R.
Publikováno v:
Thirty Essays on Geometric Graph Theory; 2013, p31-48, 18p
Autor:
Ballinger, Brad, Benbernou, Nadia, Bose, Prosenjit, Damian, Mirela, Demaine, Erik D., Dujmović, Vida, Flatland, Robin, Hurtado, Ferran, Iacono, John, Lubiw, Anna, Morin, Pat, Sacristán, Vera, Souvaine, Diane, Uehara, Ryuhei
Publikováno v:
Combinatorial Optimization & Applications: 4th International Conference, Cocoa 2010, Kailua-kona, Hi, Usa, December 18-20, 2010, Proceedings, Part II; 2010, p1-15, 15p