( en | de | ru )

 

Disambiguation of "Binucci, Carla"

Author of the publication

copydeleteadd this publication to your clipboard
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus.

, , , , , , , and . J. Graph Algorithms Appl., 21 (1): 81-102 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sabine Carland

Carla Jennewein

Regulation of peroxisome proliferator-activated receptor γ gamma in macrophages during inflammatory processes. Uni Frankfurt Main, (2010)

Carla Kellermann

Carla Conci

Carla Neumann

 

Other publications of authors with the same name

Properties and Complexity of Fan-Planarity., , , , , and . CoRR, (2014)Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods., and . WALCOM, volume 8344 of Lecture Notes in Computer Science, page 298-309. Springer, (2014)Designing the Content Analyzer of a Travel Recommender System., , , , and . Expert Syst. Appl., (2017)Computing Quasi-Upward Planar Drawings of Mixed Graphs., and . Comput. J., 59 (1): 133-150 (2016)Orthogonal drawings of graphs with vertex and edge labels., , , and . Comput. Geom., 32 (2): 71-114 (2005)An Experimental Study of a 1-Planarity Testing and Embedding Algorithm., , and . WALCOM, volume 12049 of Lecture Notes in Computer Science, page 329-335. Springer, (2020)A Software System for Computing Labeled Orthogonal Drawings of Graphs., and . GraBaTs, volume 72 of Electronic Notes in Theoretical Computer Science, page 81-90. Elsevier, (2002)On Directed Graphs with an Upward Straight-line., , , , , , and . CCCG, page 21-24. (2009)Drawing Non-Planar Graphs with Crossing-Free Subgraphs., , , , , , , and . GD, volume 8242 of Lecture Notes in Computer Science, page 292-303. Springer, (2013)1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge., , , and . IWOCA, volume 9538 of Lecture Notes in Computer Science, page 38-51. Springer, (2015)