#### Filter Results:

#### Publication Year

2013

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Given a universe U := U 1 · · ·U r , and a r-uniform family F ⊆ U 1 ×· · ·×U r , the r-dimensional matching problem asks if F admits a collection of k mutually disjoint sets. The special case when r = 3 is the classic 3D-Matching problem. Recently, several improvements have been suggested for these (and closely related) problems in the setting of randomized… (More)

Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on n vertices and a positive integer parameter k, find if there exist k edges (arcs) whose deletion results in a graph that satisfies some specified parity constraints. In particular, when the objective is to… (More)

In this paper, we introduce and study the Non-Uniform k-Center (NUkC) problem. Given a finite metric space (X, d) and a collection of balls of radii {r 1 ≥ · · · ≥ r k }, the NUkC problem is to find a placement of their centers on the metric space and find the minimum dilation α, such that the union of balls of radius α · r i around the ith center covers… (More)

- Prachi Goyal, I. K. Pandit, Neeraj Gugnani, Monica Gupta, Richa Goel, Ramandeep Singh Gambhir
- European journal of dentistry
- 2016

OBJECTIVE
To evaluate and compare the efficacy of ferric sulfate, glutaraldehyde, and mineral trioxide aggregate (MTA) as pulpotomy medicaments in primary molars.
MATERIALS AND METHODS
This was a perspective randomized clinical trial. A total of 90 molars from 42 children aged 4-8 years were selected for pulpotomy procedure. Teeth were randomly divided… (More)

This work is a follow up to [2, FUN 2010], which initiated a detailed analysis of the popular game of UNO R. We consider the solitaire version of the game, which was shown to be NP-complete. In [2], the authors also demonstrate a n O(c 2) algorithm, where c is the number of colors across all the cards, which implies, in particular that the problem is… (More)

We investigate the parameterized complexity of the following edge coloring problem motivated by the problem of channel assignment in wireless networks. For an integer q 2 and a graph G, the goal is to find a coloring of the edges of G with the maximum number of colors such that every vertex of the graph sees at most q colors. This problem is NP-hard for q… (More)

We investigate the parameterized complexity of the following edge coloring problem motivated by the problem of channel assignment in wireless networks. For an integer q ≥ 2 and a graph G, the goal is to find a coloring of the edges of G with the maximum number of colors such that every vertex of the graph sees at most q colors. This problem is NP-hard for q… (More)

- ‹
- 1
- ›