Zobrazeno 1 - 10
of 136
pro vyhledávání: '"Therese C. Biedl"'
Autor:
Saeed Mehrabi, Therese C. Biedl
Publikováno v:
Algorithmica. 83:641-666
There exist many variants of guarding an orthogonal polygon in an orthogonal fashion: sometimes a guard can see within a rectangle, along a staircase, or along an orthogonal path with at most k bends. In this paper, we study all these guarding models
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66999edcdd48744c37b49de343bca369
https://doi.org/10.1007/s00453-020-00769-5
https://doi.org/10.1007/s00453-020-00769-5
Autor:
Dirk Nowotka, Robert Cummings, Ahmad Biniaz, Jeffrey Shallit, Therese C. Biedl, Florin Manea, Anna Lubiw
Publikováno v:
SIAM Journal on Discrete Mathematics. 33:845-861
A rollercoaster is a sequence of real numbers for which every maximal contiguous subsequence---increasing or decreasing---has length at least three. By translating this sequence to a set of points ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0865f3a3f3c63276d23c2c95f47ddd6
https://doi.org/10.1137/18m1192226
https://doi.org/10.1137/18m1192226
Autor:
Therese C. Biedl, Sam Barr
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030799861
IWOCA
IWOCA
A wheel graph consists of a cycle along with a center vertex connected to every vertex in the cycle. In this paper we show that every subgraph of a wheel graph has list coupled chromatic number at most 5, and this coloring can be found in linear time
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e55cf94df6a7695042aade354baf8482
https://doi.org/10.1007/978-3-030-79987-8_6
https://doi.org/10.1007/978-3-030-79987-8_6
Publikováno v:
Trends in Mathematics ISBN: 9783030838225
We introduce a class of graphs called OAT graphs that generalizes \(P_4\)-sparse, chordal bipartite, and compact graphs. We prove that if G is a k-colourable OAT graph then G is \((k+1)\)-mixing and the \((k+1)\)-recolouring diameter of G is \(O(n^2)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f6016c75b8d8bc254fa8379a846d738
https://doi.org/10.1007/978-3-030-83823-2_45
https://doi.org/10.1007/978-3-030-83823-2_45
Autor:
Therese C. Biedl
Publikováno v:
Information Processing Letters. 175:106230
An upward drawing of a rooted tree is a drawing such that no parents are below their children. It is well-known that every rooted tree has a planar straight-line upward drawing of width at most log 2 ( n + 1 ) . This is class-optimal, i.e., there
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08fa71a19ffcc6b264ddd8fd526cddaf
https://doi.org/10.1016/j.ipl.2021.106230
https://doi.org/10.1016/j.ipl.2021.106230
Autor:
Andreas Kerren, Therese C. Biedl
Publikováno v:
Journal of Graph Algorithms and Applications. 23:459-461
Special issue of selected papers from the 26th international symposium on graph drawing and network visualization (GD 2018) : guest editors' foreword
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4830ac3f57e8ca61909d9e1b30f5dbc1
https://doi.org/10.7155/jgaa.00498
https://doi.org/10.7155/jgaa.00498
Publikováno v:
Discrete & Computational Geometry. 60:345-380
A (weak) rectangle visibility representation, or simply an RVR, of a graph consists of an assignment of axis-aligned rectangles to vertices such that for every edge there exists a horizontal or vertical line of sight between the rectangles assigned t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4fb5727332a97fc321d49cea7ded8ee3
https://doi.org/10.1007/s00454-017-9939-y
https://doi.org/10.1007/s00454-017-9939-y
Autor:
Therese C. Biedl
Publikováno v:
Journal of Graph Algorithms and Applications. 21:631-648
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d09a658ca13f74eddc9b8ed365778c3f
https://doi.org/10.7155/jgaa.00432
https://doi.org/10.7155/jgaa.00432
Autor:
John Wittnebel, Therese C. Biedl
In 1979, Nishizeki and Baybars showed that every planar graph with minimum degree 3 has a matching of size $\frac{n}{3}+c$ (where the constant $c$ depends on the connectivity), and even better bounds hold for planar graphs with minimum degree 4 and 5
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4689efb6f3327174ba04d18549745869
http://arxiv.org/abs/1911.04603
http://arxiv.org/abs/1911.04603
Autor:
Therese C. Biedl
It is well-known that 1-planar graphs have minimum degree at most 7, and not hard to see that some 1-planar graphs have minimum degree exactly 7. In this note we show that any such 1-planar graph has at least 24 vertices, and this is tight.
4 pa
4 pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5937afc853c4998cac35381c819f62e6
http://arxiv.org/abs/1910.01683
http://arxiv.org/abs/1910.01683