dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Therese C. Biedl (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


111Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMd. Jawaherul Alam, Therese C. Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt: Computing cartograms with optimal complexity. Symposium on Computational Geometry 2012: 21-30
109Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMd. Jawaherul Alam, Therese C. Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt: Computing Cartograms with Optimal Complexity CoRR abs/1201.0066: (2012)
105Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMuhammad Jawaherul Alam, Therese C. Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov: Proportional Contact Representations of Planar Graphs. Graph Drawing 2011: 26-38
104Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMuhammad Jawaherul Alam, Therese C. Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov: Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations. ISAAC 2011: 281-291
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTherese C. Biedl, Michael Kaufmann, Petra Mutzel: Drawing Planar Partitions II: HH-Drawings. WG 1998: 124-136
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTherese C. Biedl, Michael Kaufmann: Area-Efficient Static and Incremental Graph Drawings. ESA 1997: 37-52
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTherese C. Biedl, Goos Kant, Michael Kaufmann: On Triangulating Planar Graphs Under the Four-Connectivity Constraint. Algorithmica 19(4): 427-446 (1997)
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTherese C. Biedl, Goos Kant, Michael Kaufmann: On Triangulating Planar Graphs under the Four-Connectivity Constraint. SWAT 1994: 83-94

Selection of 8 from 113 records - Therese C. Biedl has 84 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page