05191 Abstracts Collection -- Graph Drawing

From 08.05.05 to 13.05.05, the Dagstuhl Seminar 05191 ``Graph Drawing\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity

Computing planar orthogonal drawings with the minimum number of bends is one of the most relevant topics in Graph Drawing. The problem is known to be NP-hard, even when we want to test the existence of a rectilinear planar drawing, i.e., an orthogonal drawing without bends (Garg and Tamassia, 2001). From the parameterized complexity perspective, the problem is fixed-parameter tractable when parameterized by the sum of three parameters: the number of bends, the number of vertices of degree at most two, and the treewidth of the input graph (Di Giacomo et al., 2022). We improve this last result by showing that the problem remains fixed-parameter tractable when parameterized only by the number of vertices of degree at most two plus the number of bends. As a consequence, rectilinear planarity testing lies in \FPT~parameterized by the number of vertices of degree at most two.Comment: Appears in the Proceedings of the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023

New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings & Constrained Planarity

Drawings of graphs are often used to represent a given data set in a human-readable way. In this thesis, we consider different classic algorithmic problems that arise when automatically generating graph drawings. More specifically, we solve some open problems in the context of orthogonal drawings and advance the current state of research on the problems clustered planarity and simultaneous planarity

Rectilinear Planarity of Partial 2-Trees

A graph is rectilinear planar if it admits a planar orthogonal drawing without bends. While testing rectilinear planarity is NP-hard in general (Garg and Tamassia, 2001), it is a long-standing open problem to establish a tight upper bound on its complexity for partial 2-trees, i.e., graphs whose biconnected components are series-parallel. We describe a new O(n^2)-time algorithm to test rectilinear planarity of partial 2-trees, which improves over the current best bound of O(n^3 \log n) (Di Giacomo et al., 2022). Moreover, for partial 2-trees where no two parallel-components in a biconnected component share a pole, we are able to achieve optimal O(n)-time complexity. Our algorithms are based on an extensive study and a deeper understanding of the notion of orthogonal spirality, introduced several years ago (Di Battista et al, 1998) to describe how much an orthogonal drawing of a subgraph is rolled-up in an orthogonal drawing of the graph.Comment: arXiv admin note: substantial text overlap with arXiv:2110.00548 Appears in the Proceedings of the 30th International Symposium on Graph Drawing and Network Visualization (GD 2022

LIPIcs, Volume 258, SoCG 2023, Complete Volume

LIPIcs, Volume 258, SoCG 2023, Complete Volum

NCUWM Talk Abstracts 2010

Dr. Bryna Kra, Northwestern University “From Ramsey Theory to Dynamical Systems and Back” Dr. Karen Vogtmann, Cornell University “Ping-Pong in Outer Space” Lindsay Baun, College of St. Benedict Danica Belanus, University of North Dakota Hayley Belli, University of Oregon Tiffany Bradford, Saint Francis University Kathryn Bryant, Northern Arizona University Laura Buggy, College of St. Benedict Katharina Carella, Ithaca College Kathleen Carroll, Wheaton College Elizabeth Collins-Wildman, Carleton College Rebecca Dorff, Brigham Young University Melisa Emory, University of Nebraska at Omaha Avis Foster, George Mason University Xiaojing Fu, Clarkson University Jennifer Garbett, Kenyon College Nicki Gaswick, University of Nebraska-Lincoln Rita Gnizak, Fort Hays State University Kailee Gray, University of South Dakota Samantha Hilker, Sam Houston State University Ruthi Hortsch, University of Michigan Jennifer Iglesias, Harvey Mudd College Laura Janssen, University of Nebraska-Lincoln Laney Kuenzel, Stanford University Ellen Le, Pomona College Thu Le, University of the South Shauna Leonard, Arkansas State University Tova Lindberg, Bethany Lutheran College Lisa Moats, Concordia College Kaitlyn McConville, Westminster College Jillian Neeley, Ithaca College Marlene Ouayoro, George Mason University Kelsey Quarton, Bradley University Brooke Quisenberry, Hope College Hannah Ross, Kenyon College Karla Schommer, College of St. Benedict Rebecca Scofield, University of Iowa April Scudere, Westminster College Natalie Sheils, Seattle University Kaitlin Speer, Baylor University Meredith Stevenson, Murray State University Kiri Sunde, University of North Carolina Kaylee Sutton, John Carroll University Frances Tirado, University of Florida Anna Tracy, University of the South Kelsey Uherka, Morningside College Danielle Wheeler, Coe College Lindsay Willett, Grove City College Heather Williamson, Rice University Chengcheng Yang, Rice University Jie Zeng, Michigan Technological Universit

An interaction paradigm for impact analysis

The Aerospace industry is concerned with huge software projects. Software development is an evolving process resulting in larger and larger software systems. As systems grow in size, they become more complex and hence harder to maintain. Thus it appears that the maintenance of software systems is the most expensive part of the software life-cycle, often consuming 50-90% of a project total budget. Yet while there has been much research carried out on the problems of program and system development very little work has been done on the problem of maintaining developed programs. Thus it will be essential to improve the software maintenance process and the environment for maintenance. Historically, the term Software Maintenance has been applied to the process of modifying a software program after it has been delivered and during its life time. The high cost of software during its life cycle can be attributed largely to software maintenance activities, and a major part of these activities is to deal with the modifications of the software. These modifications may involve changes at any level of abstraction of a software system (i.e design, specification, code,...). Software Maintenance has to deal with modifications which can have severe Ripple Effects at other points in the software system. Impact Analysis addresses the problem and attempts to localize these Ripple Effects. In this thesis the Software Maintenance process and more specifically the Impact Analysis process is examined. The different parts of the implementation for the Impact Analysis System are explained. The main results of the thesis are the dependencies generation and the graph tool used to visualize these dependencies as well as the impacts on general dependency graph for impact analysis purpose