Browse by Classification
Number of items at this level: 13. Kyncl, Jan (2008) The Complexity of Several Realizability Problems for Abstract Topological Graphs. [Conference Paper] Estrella-Balderrama, Alejandro and Fowler, J. Joseph and Kobourov, Stephen G. (2007) Characterization of Unlabeled Level Planar (ULP) Trees. [Conference Paper] Demaine, Erik D. and Hajiaghayi, MohammadTaghi (2004) Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. [Conference Paper] Marcus, Adam and Tardos, Gábor (2004) Intersection Reverse Sequences and Geometric Applications. [Conference Paper] Newton, Matthew and Sýkora, Ondrej and Uzovic, Martin and Vrt'o, Imrich (2004) New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes. [Conference Paper] Miura, Kazuyuki and Miyazawa, Ayako and Nishizeki, Takao (2002) Extended Rectangular Drawings of Plane Graphs with Designated Corners (Extended Abstract). [Conference Paper] Dean, Alice M. (2001) A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band. [Conference Paper] de Fraysseix, Hubert and Ossona de Mendez, Patrice (2001) On topological aspects of orientations. [Journal (Paginated)] Pach, János and Tóth, Géza (2001) Unavoidable Configurations in Complete Topological Graphs. [Conference Paper] Dornheim, Christoph (1999) Graph Embedding with Topological Cycle-Constraints. [Conference Paper] Kratochvíl, Jan (1998) Crossing Number of Abstract Topological Graphs. [Conference Paper] Agarwal, Pankaj K. and Aronov, Boris and Pach, János and Pollack, Richard and Sharir, Micha (1996) Quasi-Planar Graphs Have a Linear Number of Edges. [Conference Paper] Hashemi, S. Mehdi and Kisielewicz, Andrzej and Rival, Ivan (1996) Upward Drawings on Planes and Spheres. [Conference Paper] |