![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Therese Biedl
aka: Therese C. Biedl
University of Waterloo, Cheriton School of Computer Science, Waterloo, ON, Canada
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 270 matches
- 2024
- Therese Biedl, Prosenjit Bose, Babak Miraftab:
On the Independence Number of 1-Planar Graphs. SWAT 2024: 13:1-13:13 - Therese Biedl, Prashant Gokhale:
Finding maximum matchings in RDV graphs efficiently. CoRR abs/2406.03632 (2024) - 2023
- Therese Biedl, David Eppstein, Torsten Ueckerdt:
On the complexity of embedding in graph products. CCCG 2023: 77-88 - Therese Biedl, Karthik Murali:
On Computing the Vertex Connectivity of 1-Plane Graphs. ICALP 2023: 23:1-23:16 - Therese Biedl, John Wittnebel:
Large Matchings in Maximal 1-planar graphs. CoRR abs/2301.01394 (2023) - Therese Biedl, David Eppstein, Torsten Ueckerdt:
On the complexity of embedding in graph products. CoRR abs/2303.17028 (2023) - 2022
- Therese Biedl
:
Horton-Strahler number, rooted pathwidth and upward drawings of trees. Inf. Process. Lett. 175: 106230 (2022) - Therese Biedl:
Drawing outer-1-planar graphs revisited. J. Graph Algorithms Appl. 26(1): 59-73 (2022) - Therese Biedl, Milap Sheth:
Drawing Halin-graphs with small height. J. Graph Algorithms Appl. 26(1): 473-502 (2022) - Therese Biedl
, John Wittnebel:
Matchings in 1-planar graphs with large minimum degree. J. Graph Theory 99(2): 217-230 (2022) - Therese Biedl:
Drawing complete outer-1-planar graphs in linear area. CCCG 2022: 48-54 - Therese Biedl
:
Visibility Representations of Toroidal and Klein-bottle Graphs. GD 2022: 404-417 - Oswin Aichholzer
, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, Yushi Uno:
Reconfiguration of Non-crossing Spanning Trees. CoRR abs/2206.03879 (2022) - Therese Biedl:
Visibility Representations of Toroidal and Klein-bottle Graphs. CoRR abs/2209.00576 (2022) - Therese Biedl, Karthik Murali:
On computing the vertex connectivity of 1-plane graphs. CoRR abs/2212.06782 (2022) - 2021
- Therese Biedl, Saeed Mehrabi:
On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth. Algorithmica 83(2): 641-666 (2021) - Therese Biedl, Ahmad Biniaz, Anna Lubiw
:
Minimum ply covering of points with disks and squares. Comput. Geom. 94: 101712 (2021) - Therese Biedl:
A note on 1-planar graphs with minimum degree 7. Discret. Appl. Math. 289: 230-232 (2021) - Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
Generalized LR-Drawings of Trees. CCCG 2021: 78-88 - Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud:
Distant Representatives for Rectangles in the Plane. ESA 2021: 17:1-17:18 - Therese Biedl
, Giuseppe Liotta
, Jayson Lynch
, Fabrizio Montecchiani
:
Optimal-Area Visibility Representations of Outer-1-Plane Graphs. GD 2021: 287-303 - Sam Barr, Therese Biedl:
Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest. ISAAC 2021: 16:1-16:15 - Sam Barr, Therese Biedl:
All Subgraphs of a Wheel Are 5-Coupled-Choosable. IWOCA 2021: 78-91 - Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud:
Dispersion for Intervals: A Geometric Approach. SOSA 2021: 37-44 - Sam Barr, Therese Biedl:
All Subgraphs of a Wheel are 5-Coupled-Choosable. CoRR abs/2102.02918 (2021) - Sam Barr, Therese Biedl:
Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest. CoRR abs/2104.12286 (2021) - Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
Generalized LR-drawings of trees. CoRR abs/2105.06992 (2021) - Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud:
Distant Representatives for Rectangles in the Plane. CoRR abs/2108.07751 (2021) - Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
Optimal-area visibility representations of outer-1-plane graphs. CoRR abs/2108.11768 (2021) - Therese Biedl, Karthik Murali:
Computing the vertex connectivity of a locally maximal 1-plane graph in linear time. CoRR abs/2112.06306 (2021)
skipping 240 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-27 01:36 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint