A Satisfiability Formulation of Problems on Level Graphs-Reference-Cited by-同舟云学术

A Satisfiability Formulation of Problems on Level Graphs

Published:2001-06 Issue: Volume:9 Page:269-277
ISSN:1571-0653
Container-title:Electronic Notes in Discrete Mathematics
language:en
Short-container-title:Electronic Notes in Discrete Mathematics

Author:

Randerath Bert,Speckenmeyer Ewald,Boros Endre,Hammer Peter,Kogan Alex,Makino Kazuhisa,Simeone Bruno,Cepek Ondrej

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference12 articles.

1. Hierarchies and planarity theory;Di Battista;IEEE Transactions on Systems, Man and Cybernetics,1988

2. Graph Drawing;Di Battista,1998

3. On an edge crossing problem;Eades;Proc. 9th Australian Computer Science Conference, Australian National University,1986

4. Crossing number is NP-complete;Garey;SIAM Journal on Algebraic and Discrete Methods,1983

5. L. Heath and S. Pemmaraju, Recognizing leveled-planar dags in linear time, In F. J. Brandenburg, editor, Proc. Graph Drawing 95', vol. 1027 of Lecture Notes in Computer Science, Springer Verlag, pp. 300-311.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Level-Planarity: Transitivity vs. Even Crossings;The Electronic Journal of Combinatorics;2022-11-04

2. Beyond level planarity: Cyclic, torus, and simultaneous level planarity;Theoretical Computer Science;2020-01

3. An SPQR-Tree-Like Embedding Representation for Upward Planarity;Lecture Notes in Computer Science;2019

4. Level Planarity: Transitivity vs. Even Crossings;Lecture Notes in Computer Science;2018

5. Beyond Level Planarity;Lecture Notes in Computer Science;2016