9 citations · 16 across the 10 of their papers we have counts for
11 papers
Avoiding Monochromatic Solutions to 3-term Equations
Kevin P. Costello, Gabriel Elvin
Given an equation, the integers as inputs, and the colors red and blue, how can we color in order to minimize the number of monochromatic solutions…
An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs
Alexander Choi, Marek Chrobak, Kevin Costello
A set is -universal if all -vertex planar graphs have a planar straight-line embedding into . We prove that if consists of poi…
Information Gathering in Ad-Hoc Radio Networks
Marek Chrobak, Kevin Costello, Leszek Gasieniec
In the ad-hoc radio network model, nodes communicate with their neighbors via radio signals, without knowing the topology of the graph. We study the information gathering problem,…
Faster Information Gathering in Ad-Hoc Radio Tree Networks
Marek Chrobak, Kevin P. Costello
We study information gathering in ad-hoc radio networks. Initially, each node of the network has a piece of information called a rumor, and the overall objective is to gather all t…
Information Gathering in Ad-Hoc Radio Networks with Tree Topology
Marek Chrobak, Kevin Costello, Leszek Gasieniec +1
We study the problem of information gathering in ad-hoc radio networks without collision detection, focussing on the case when the network forms a tree, with edges directed towards…
Matching with Commitments
Kevin Costello, Prasad Tetali, Pushkar Tripathi
We consider the following stochastic optimization problem first introduced by Chen et al. in \cite{chen}. We are given a vertex set of a random graph where each possible edge is pr…