Titlebook: Algorithms and Discrete Applied Mathematics; 10th International C Subrahmanyam Kalyanasundaram,Anil Maheshwari Conference proceedings 2024

maroon

Parameterized Aspects of Distinct Kemeny Rank Aggregationtional task of finding a Kemeny ranking has been studied under the lens of parameterized complexity with respect to many parameters. We study the parameterized complexity of the problem of computing all distinct Kemeny rankings. We consider the target Kemeny score, number of candidates, average dist

Ancillary

concise

geometrician

On Query Complexity Measures and Their Relations for Symmetric Functionsial and adversary method. There have been considerable efforts to give lower bounds using these methods, and to compare/relate them with other measures based on the decision tree..We explore the value of these lower bounds on quantum query complexity and their relation with other decision tree based

Isometric

cartilage

接合

archetype

Semi-total Domination in Unit Disk GraphsA set . is said to be a semi-total dominating set if (.) . is a dominating set, and (.) for every vertex ., there exists a vertex . such that the distance between . and . in . is within 2. Given a graph ., the semi-total domination problem is to find a semi-total dominating set of minimum cardinalit

Madrigal

搜集

Unique Least Common Ancestors and Clusters in Directed Acyclic Graphsing unique least common ancestors for certain subsets of their minimal elements since these are of interest, particularly as models of phylogenetic networks. Here, we use the close connection between the canonical .-ary transit function and the closure function on a set system to show that pre-.-ary