| 词条 | Therese Biedl |
| 释义 |
| name = Therese Biedl | image = | nationality = Austrian | alma_mater = Rutgers University | known_for = Computational geometry, planar graphs | awards = Ross & Muriel Cheriton Faculty Fellow, 2011 | website = https://cs.uwaterloo.ca/~biedl/ }}Therese Charlotte Biedl is an Austrian computer scientist known for her research in computational geometry and graph drawing. Currently she is a professor at the University of Waterloo in Canada.[1] EducationBiedl received her Diploma in Mathematics at the Technical University of Berlin, graduating in 1996 and earned a Ph.D. from Rutgers University in 1997 under the supervision of Endre Boros.[1][2][3] ResearchBiedl's research is in developing algorithms related to graphs and geometry. Planar graphs are graphs that can be drawn without crossings. Biedl develops algorithms that minimize or approximate the area and the height of such drawings.{{ran|A}} With Alam, Felsner, Gerasch, Kaufmann, and Kobourov, Biedl found provably optimal linear time algorithms for proportional contact representation of a maximal planar graph.{{ran|C}} AwardsBiedl was named a Ross & Muriel Cheriton Faculty Fellow in 2011, a recognition of the reach and importance of her scholarly works.[4] Selected publications{{rma|A|{{cite conference|last1=Biedl|first1=Therese|title=On Area-Optimal Planar Graph Drawings|booktitle=Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8–11, 2014, Proceedings, Part I|year=2014|pages=198–210|doi=10.1007/978-3-662-43948-7_17|publisher=Springer|series=Lecture Notes in Computer Science|volume=8572}}}}{{rma|B|{{cite journal|last1=Alam|first1=Md Jawaherul|last2=Biedl|first2=Therese|last3=Felsner|first3=Stefan|last4=Kaufmann|first4=Michael|last5=Kobourov|first5=Stephen G.|last6=Ueckerdt|first6=Torsten|title=Computing Cartograms with Optimal Complexity|journal=Discrete & Computational Geometry|date=1 October 2013|volume=50|issue=3|pages=784–810|doi=10.1007/s00454-013-9521-1|arxiv=1201.0066}}}}{{rma|C|{{cite conference|last1=Alam|first1=Muhammad Jawaherul|last2=Biedl|first2=Therese|last3=Felsner|first3=Stefan|last4=Gerasch|first4=Andreas|last5=Kaufmann|first5=Michael|last6=Kobourov|first6=Stephen G.|title=Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations|booktitle=Algorithms and Computation: 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5–8, 2011, Proceedings|year=2011|pages=281–291|doi=10.1007/978-3-642-25591-5_30|publisher=Springer|series=Lecture Notes in Computer Science|volume=7074}}}}{{rma|D|{{cite conference| last = Biedl | first = Therese | title = Drawing outer-planar graphs in O(n log n) area | doi = 10.1007/3-540-36151-0_6 | mr = 2063411 | pages = 54–65 | publisher = Springer | series = Lecture Notes in Computer Science | booktitle = Graph Drawing:10th International Symposium, GD 2002, Irvine, CA, USA, August 26–28, 2002, Revised Papers | volume = 2528 | year = 2002}}}}{{rma|E|{{cite journal|last1=Biedl|first1=Therese C.|last2=Bose|first2=Prosenjit|last3=Demaine|first3=Erik D.|last4=Lubiw|first4=Anna|title=Efficient Algorithms for Petersen's Matching Theorem|journal=Journal of Algorithms|volume=38|issue=1|pages=110–134|doi=10.1006/jagm.2000.1132|year=2000}}}}{{rma|F|{{cite journal|last1=Biedl|first1=Therese|last2=Kant|first2=Goos|title=A better heuristic for orthogonal graph drawings|journal=Computational Geometry|volume=9|issue=3|pages=159–180|doi=10.1016/s0925-7721(97)00026-6|year=1998}}}} References1. ^1 [https://cs.uwaterloo.ca/people-profiles/therese-biedl Faculty profile], Univ. of Waterloo, retrieved 2017-12-08. 2. ^{{mathgenealogy|name=Therese Biedl|id=96437}} 3. ^[https://cs.uwaterloo.ca/~biedl/research/cv.pdf Curriculum Vitae], Univ. of Waterloo, retrieved 2017-12-08. 4. ^{{cite web|title=Ross & Muriel Cheriton Faculty Fellowship {{!}} Cheriton School of Computer Science|url=https://cs.uwaterloo.ca/about/faculty-fellowships-and-awards/ross-muriel-cheriton-faculty-fellowship|website=Cheriton School of Computer Science|accessdate=9 December 2017|language=en|date=10 February 2017}} External links
9 : Canadian computer scientists|Researchers in geometric algorithms|University of Waterloo faculty|Living people|Canadian women computer scientists|Graph drawing people|Austrian computer scientists|Austrian women computer scientists|Year of birth missing (living people) |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。