Search
Now showing items 361-370 of 376
Improved approximation bounds on maximum edge q coloring of dense graphs
The anti-Ramsey number ar(G,H) with input graph G and pattern graph H, is the maximum
positive integer k such that there exists an edge coloring of G using k colors, in which there are
no rainbow subgraphs isomorphic to ...
Algortihms for Individual and Collective Fairness Measures
The problem of fair allocation has been a central topic in economic theory, and the literature on fair division has provided fundamental insights on how to allocate resources among agents in a fair manner. By drawing upon ...
Algorithms for Geometric Packing and Covering Problems
We study two fundamental problems related to geometric packing and covering, and design
algorithms with improved worst-case performance guarantees for them. These problems have
numerous applications in resource allocation, ...
Fragile Interpretations and Interpretable models in NLP
Deploying deep learning models in critical areas where the cost of making a wrong decision
leads to a substantial financial loss, like in the banking domain, or even loss of life, like in the
medical field, is significantly ...
Secure Computation Protocol Suite for Privacy-Conscious Applications
As an alternative to performing analytics in the clear, there is an increasing demand for developing privacy-preserving solutions that aim to protect sensitive data while still allowing for its efficient analysis. Among ...
Temporal Point Processes for Forecasting Events in Higher-Order Networks
Real-world systems consisting of interacting entities can be effectively represented as time-evolving networks or graphs, where the entities are depicted as nodes, and the interactions between them are represented as ...
Improved Algorithms for Variants of Bin Packing and Knapsack
We study variants of two classical optimization problems: Bin Packing and Knapsack. Both bin packing and knapsack fall under the regime of "Packing and Covering Problems". In bin packing, we are given a set of input items, ...
Maximum Independent Set of Rectangles - An Empirical Study
We study the Maximum Independent Set of Rectangles (MISR) problem. The problem involves a collection of n axis-parallel rectangles in 2D with weights. For the unweighted case, the goal is to find the maximum number of ...
Specification Synthesis with Constrained Horn Clauses
Many practical problems in software development, verification and testing rely on specifications. The problem of specification synthesis is to automatically find relational constraints for undefined functions, called ...
Algorithmic Problems on Vertex Deletion and Graph Coloring
In the thesis, we mainly discuss variants of two well-studied graph theoretical problems - vertex deletion problem and graph coloring problem - both have been used to tackle many real-world problems in diverse fields.
Vertex ...