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

Ethics

Nostalgia

精確

Parameterized Computational Geometry via Decomposition Theoremse field largely focused on problems arising from studies of graphs and networks. However, lately the focus has changed substantially and it has started to permeate into other fields such as computational geometry, and computational social choice theory. In this article, we will survey some exciting

混合物

maintenance

Topological Stability of Kinetic ,-centers cover . at every time step, such that the disks are as small as possible at any point in time. Whereas the optimal solution over time may exhibit discontinuous changes, many practical applications require the solution to be .: the disks must move smoothly over time. Existing results on this problem

太空

Graph Profile Realizations and Applications to Social Networksetween the individual and its neighbors. In this paper, we consider various criteria that measure social status and the extent in which individuals are satisfied with their social status. We study these criteria from the point of view of network realization: given a satisfaction specification, decid

Crohns-disease

Maximum-Width Empty Square and Rectangular Annulusnulus of a certain shape with the maximum possible width that avoids a given set of . points in the plane. This problem can also be interpreted as the problem of finding an optimal location of a ring-shaped obnoxious facility among the input points. In this paper, we study square and rectangular var

Prognosis

和藹

Hard and Easy Instances of L-Tromino Tilingsitrary region in general is NP-complete, nonetheless, we identify restrictions to the problem where it either remains NP-complete or has a polynomial time algorithm. First, we characterize the possibility of when an Aztec rectangle has an L-tromino tiling, and hence also an Aztec diamond; if an Azte

beta-carotene

-Gatherings on a Starter contains at least . points. The .-gather clustering problem asks to find an .-gather clustering which minimizes the maximum distance between any two points in a cluster. An .-gathering of . is an assignment of each customer . to a facility . such that each open facility has zero or at least . cu