Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Saidur Rahman, Md.
Nishizeki, Takao
and
Ghosh, Shubhashis
2002.
Graph Drawing.
Vol. 2528,
Issue. ,
p.
244.
Rahman, Md. Saidur
Miura, Kazuyuki
and
Nishizeki, Takao
2004.
Graph-Theoretic Concepts in Computer Science.
Vol. 3353,
Issue. ,
p.
320.
Rahman, Md.Saidur
Nishizeki, Takao
and
Ghosh, Shubhashis
2004.
Rectangular drawings of planar graphs.
Journal of Algorithms,
Vol. 50,
Issue. 1,
p.
62.
Cahit, I.
and
Kheddouci, H.
2005.
Embedding Plane Graphs in the Grids.
p.
670.
de Berg, Mark
Mumford, Elena
and
Speckmann, Bettina
2006.
Graph Drawing.
Vol. 3843,
Issue. ,
p.
61.
Rahman, Md. Saidur
Miura, Kazuyuki
and
Nishizeki, Takao
2009.
Octagonal drawings of plane graphs with prescribed face areas.
Computational Geometry,
Vol. 42,
Issue. 3,
p.
214.
de Berg, Mark
Mumford, Elena
and
Speckmann, Bettina
2009.
On rectilinear duals for vertex-weighted plane graphs.
Discrete Mathematics,
Vol. 309,
Issue. 7,
p.
1794.
Biedl, Therese
and
Ruiz Velázquez, Lesvia Elena
2010.
Graph Drawing.
Vol. 5849,
Issue. ,
p.
316.
Alam, Muhammad Jawaherul
Biedl, Therese
Felsner, Stefan
Gerasch, Andreas
Kaufmann, Michael
and
Kobourov, Stephen G.
2011.
Algorithms and Computation.
Vol. 7074,
Issue. ,
p.
281.
Biedl, Therese
and
Ruiz Velázquez, Lesvia Elena
2011.
Algorithms and Data Structures.
Vol. 6844,
Issue. ,
p.
98.
Alam, M. Jawaherul
Biedl, Therese
Felsner, Stefan
Gerasch, Andreas
Kaufmann, Michael
and
Kobourov, Stephen G.
2013.
Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations.
Algorithmica,
Vol. 67,
Issue. 1,
p.
3.
Biedl, Therese
and
Ruiz Velázquez, Lesvia Elena
2013.
Drawing planar 3-trees with given face areas.
Computational Geometry,
Vol. 46,
Issue. 3,
p.
276.
Biedl, Therese
and
Ruiz Velázquez, Lesvia Elena
2014.
Orthogonal cartograms with at most 12 corners per face.
Computational Geometry,
Vol. 47,
Issue. 2,
p.
282.
Felsner, Stefan
2015.
Gems of Combinatorial Optimization and Graph Algorithms.
p.
1.
Kleist, Linda
2018.
Graph Drawing and Network Visualization.
Vol. 11282,
Issue. ,
p.
333.
Dobbins, Michael Gene
Kleist, Linda
Miltzow, Tillmann
and
Rzążewski, Paweł
2018.
Graph-Theoretic Concepts in Computer Science.
Vol. 11159,
Issue. ,
p.
164.
Dobbins, Michael Gene
Kleist, Linda
Miltzow, Tillmann
and
Rzążewski, Paweł
2023.
Completeness for the Complexity Class $$\forall \exists \mathbb {R}$$ and Area-Universality.
Discrete & Computational Geometry,
Vol. 70,
Issue. 1,
p.
154.