Titlebook: WALCOM: Algorithms and Computation; 13th International C Gautam K. Das,Partha S. Mandal,Shin-ichi Nakano Conference proceedings 2019 Spring

Arteriography

Drawing Clustered Graphs on Disk Arrangementsster. This result can be seen as an extension of the result by Alam et al. [.] who solely consider biconnected clusters. Moreover, we prove that it is .-hard to decide whether a clustered graph has such a straight-line drawing, if we permit pipe-disk intersections.

陶醉

ABASH

变异

Amendment

Pde5-Inhibitors

(,, ,)-Planarity: A Relaxation of Hybrid Planarityarity testing and (2, 2)-planarity testing are NP-complete problems. Finally, we prove that neither the class of (2, 2)-planar graphs nor the class of 1-planar graphs contains the other, indicating that the (., .)-planar graphs are a large and novel class.

去掉

Graph Profile Realizations and Applications to Social Networkse satisfied with their social status. We study these criteria from the point of view of network realization: given a satisfaction specification, decide whether there exists a network realizing this specification.

损坏

Graph Profile Realizations and Applications to Social Networkse satisfied with their social status. We study these criteria from the point of view of network realization: given a satisfaction specification, decide whether there exists a network realizing this specification.

canvass

A Linear Time Algorithm for the ,-Gathering Problem on the Line (Extended Abstract) .. The .-gathering problem computes the .-gathering minimizing the cost. In this paper we study the .-gathering problem when . and . are on a line and present a .-time algorithm to solve the problem. Our solution is optimal since any algorithm needs to read . and . at least once.

Humble

Conference proceedings 2019topical headings on the facility location problem; computational geometry; graph drawing; graph algorithms; approximation algorithms; miscellaneous; data structures; parallel and distributed algorithms; and packing and covering..