| Publication | Date of Publication | Type |
|---|
| Temporal cliques admit sparse spanners | 2022-07-21 | Paper |
Temporal cliques admit sparse spanners
Journal of Computer and System Sciences | 2021-07-06 | Paper |
Temporal cliques admit sparse spanners
Journal of Computer and System Sciences | 2021-07-06 | Paper |
Fast and frugal targeting with incentives
Theoretical Computer Science | 2020-02-20 | Paper |
Computing parameters of sequence-based dynamic graphs
Theory of Computing Systems | 2019-06-27 | Paper |
Time-bounded influence diffusion with incentives
(available as arXiv preprint) | 2019-01-30 | Paper |
Optimal odd gossiping
Discrete Applied Mathematics | 2018-09-06 | Paper |
Time-Bounded Influence Diffusion with Incentives
(available as arXiv preprint) | 2018-07-18 | Paper |
| A generic framework for computing parameters of sequence-based dynamic graphs | 2018-04-12 | Paper |
Odd gossiping
Discrete Applied Mathematics | 2017-03-15 | Paper |
Deterministic small-world communication networks
Information Processing Letters | 2016-06-16 | Paper |
Efficiently testing \(T\)-interval connectivity in dynamic graphs
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Spread of influence in weighted networks under time and budget constraints
Theoretical Computer Science | 2015-05-26 | Paper |
Influence diffusion in social networks under time window constraints
Theoretical Computer Science | 2015-05-22 | Paper |
A characterization of oblivious message adversaries for which consensus is solvable
Theoretical Computer Science | 2015-05-22 | Paper |
Influence Diffusion in Social Networks under Time Window Constraints
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Optimal gathering in radio grids with interference
Theoretical Computer Science | 2012-10-11 | Paper |
Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults
Structural Information and Communication Complexity | 2011-08-19 | Paper |
Efficient domination in circulant graphs with two chord lengths
Information Processing Letters | 2010-01-29 | Paper |
Neighborhood Broadcasting in Hypercubes
SIAM Journal on Discrete Mathematics | 2008-12-05 | Paper |
| Constructing incremental sequences in graphs | 2007-08-13 | Paper |
Exchanging messages of different sizes
Journal of Parallel and Distributed Computing | 2006-05-22 | Paper |
Minimum chromaticity of circulant graphs
Discrete Mathematics | 2005-10-10 | Paper |
Reliable broadcasting in double loop networks
Networks | 2005-09-22 | Paper |
Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs
Networks | 2002-09-19 | Paper |
Line broadcasting in cycles
Discrete Applied Mathematics | 1998-07-28 | Paper |
Bounded depth broadcasting
Discrete Applied Mathematics | 1996-11-05 | Paper |
Antepenultimate broadcasting
Networks | 1996-10-07 | Paper |
Spanners of Hypercube-Derived Networks
SIAM Journal on Discrete Mathematics | 1996-07-02 | Paper |
Reliable broadcasting
Discrete Applied Mathematics | 1995-03-05 | Paper |
Regularity and locality in \(k\)-terminal graphs
Discrete Applied Mathematics | 1994-11-28 | Paper |
Minimum broadcast digraphs
Discrete Applied Mathematics | 1993-01-16 | Paper |
Sparse broadcast graphs
Discrete Applied Mathematics | 1992-09-27 | Paper |
Broadcasting in Bounded Degree Graphs
SIAM Journal on Discrete Mathematics | 1992-06-28 | Paper |
Broadcast Networks of Bounded Degree
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
Lower Bounds on Time-Accuracy Trade-Offs for the 0-1 Knapsack Problem
Mathematics of Operations Research | 1988-01-01 | Paper |
Parallel approximation schemes for subset sum and knapsack problems
Acta Informatica | 1987-01-01 | Paper |
Sequential Estimation Algorithm Using a Continuous UDU' Covariance Factorization
Journal of Guidance and Control | 1980-01-01 | Paper |
Implementation of samplesort: A minimal storage tree sort
BIT | 1975-01-01 | Paper |
