Efficient generation of plane triangulations without repetitionsZHANGJIAN LI; NAKANO, Shin-Ichi.Lecture notes in computer science. 2001, pp 433-443, issn 0302-9743, isbn 3-540-42287-0Conference Paper

An efficient parallel algorithm for the general planar monotone circuit value problemVIJAYA RAMACHANDRAN; HONGHUA YANG.SIAM journal on computing (Print). 1996, Vol 25, Num 2, pp 312-339, issn 0097-5397Article

Drawing graphs with large vertices and thick edgesBAREQUET, Gill; GOODRICH, Michael T; RILEY, Chris et al.Lecture notes in computer science. 2003, pp 281-293, issn 0302-9743, isbn 3-540-40545-3, 13 p.Conference Paper

A linear-time algorithm for finding tree-decompositions of small treewidthBODLAENDER, H. L.SIAM journal on computing (Print). 1996, Vol 25, Num 6, pp 1305-1317, issn 0097-5397Article

Minimum path basesHARTVIGSEN, D.Journal of algorithms (Print). 1993, Vol 15, Num 1, pp 125-142, issn 0196-6774Article

The coefficients of the Tutte polynomial are not unimodalSCHWÄRZLER, W.Journal of combinatorial theory. Series B. 1993, Vol 58, Num 2, pp 240-242, issn 0095-8956Article

Constructing compact rectilinear planar layouts using canonical representation of planar graphsNUMMENMAA, J.Theoretical computer science. 1992, Vol 99, Num 2, pp 213-230, issn 0304-3975Article

A note on planar graphs and circle ordersSCHEINERMAN, E. R.SIAM journal on discrete mathematics (Print). 1991, Vol 4, Num 3, pp 448-451, issn 0895-4801Article

Cycle lengths and graph orientationsPRETZEL, O; YOUNGS, D.SIAM journal on discrete mathematics (Print). 1990, Vol 3, Num 4, pp 544-553, issn 0895-4801Article

A constructive enumeration of nanotube capsBRINKMANN, G; NATHUSIUS, U. V; PALSER, A. H. R et al.Discrete applied mathematics. 2002, Vol 116, Num 1-2, pp 55-71, issn 0166-218XArticle

Planarity testing of graphs on base of a spring modelHOTZ, Günter; LOHSE, Steffen.Lecture notes in computer science. 2002, pp 471-472, issn 0302-9743, isbn 3-540-43309-0Conference Paper

New algorithms for k-face cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphsKLOKS, Ton; LEE, C. M; JIPING LIU et al.Lecture notes in computer science. 2002, pp 282-295, issn 0302-9743, isbn 3-540-00331-2, 14 p.Conference Paper

A note on packing paths in planar graphsFRANK, A; SZIGETI, Z.Mathematical programming. 1995, Vol 70, Num 2, pp 201-209, issn 0025-5610Article

On magic labelings of honeycombBACA, M.Discrete mathematics. 1992, Vol 105, Num 1-3, pp 305-311, issn 0012-365XArticle

Optimal 1-planar graphs which triangulate other surfacesSUZUKI, Yusuke.Discrete mathematics. 2010, Vol 310, Num 1, pp 6-11, issn 0012-365X, 6 p.Article

On the 3-colorability of planar graphs without 4-, 7- and 9-cyclesHUAJING LU; YINGQIAN WANG; WEIFAN WANG et al.Discrete mathematics. 2009, Vol 309, Num 13, pp 4596-4607, issn 0012-365X, 12 p.Article

A note on class one graphs with maximum degree sixXUECHAO LI; RONG LUO; JIANBING NIU et al.Discrete mathematics. 2006, Vol 306, Num 13, pp 1450-1455, issn 0012-365X, 6 p.Article

A note on 3-choosability of planar graphs without certain cyclesLI ZHANG; BAOYINDURENG WU.Discrete mathematics. 2005, Vol 297, Num 1-3, pp 206-209, issn 0012-365X, 4 p.Article

Preservation under extensions on well-behaved finite structuresATSERIAS, Albert; DAWAR, Anuj; GROHE, Martin et al.Lecture notes in computer science. 2005, pp 1437-1449, issn 0302-9743, isbn 3-540-27580-0, 13 p.Conference Paper

Treewidth lower bounds with bramblesBODLAENDER, Hans L; GRIGORIEV, Alexander; KOSTER, Arie M. C. A et al.Lecture notes in computer science. 2005, pp 391-402, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper

Dominating sets and local treewidthFOMIN, Fedor V; THILIKOS, Dimtirios M.Lecture notes in computer science. 2003, pp 221-229, issn 0302-9743, isbn 3-540-20064-9, 9 p.Conference Paper

Drawing outer-planar graphs in O(n log n) areaBIEDL, Therese.Lecture notes in computer science. 2002, pp 54-65, issn 0302-9743, isbn 3-540-00158-1, 12 p.Conference Paper

On-line planarity testingDI BATTISTA, G; TAMASSIA, R.SIAM journal on computing (Print). 1996, Vol 25, Num 5, pp 956-997, issn 0097-5397Article

Subgraphs of 4-Regular Planar GraphsDOWDEN, Chris; ADDARIO-BERRY, Louigi.Algorithmica. 2011, Vol 61, Num 3, pp 758-776, issn 0178-4617, 19 p.Article

Augmenting the Connectivity of Outerplanar GraphsGARCIA, A; HURTADO, F; NOY, M et al.Algorithmica. 2010, Vol 56, Num 2, pp 160-179, issn 0178-4617, 20 p.Article