| Publication | Date of Publication | Type |
|---|
| Red-blue unshared dominators | 2026-02-26 | Paper |
(t, r)-broadcast domination in graphs
Discrete Applied Mathematics | 2026-02-11 | Paper |
Spanning trees minimizing branching costs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-01-13 | Paper |
| Parameterized complexity of (d, r)-domination via modular decomposition | 2025-04-15 | Paper |
| An FPT algorithm for spanning trees with few branch vertices parameterized by modular-width | 2024-12-03 | Paper |
Graph burning in community-based networks
Journal of Graph Algorithms and Applications | 2024-11-12 | Paper |
Getting linear time in graphs of bounded neighborhood diversity
Networks | 2024-09-05 | Paper |
Parameterized complexity for iterated type partitions and modular-width
Discrete Applied Mathematics | 2024-04-10 | Paper |
Spanning trees with few branch vertices in graphs of bounded neighborhood diversity
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Groups burning: analyzing spreading processes in community-based networks
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Immunization in the threshold model: a parameterized complexity study
Algorithmica | 2023-11-17 | Paper |
Pervasive domination
Lecture Notes in Computer Science | 2023-08-03 | Paper |
| Speeding up networks mining via neighborhood diversity | 2023-02-07 | Paper |
Communication complexity of gossiping by packets
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Concurrent multicast in weighted networks
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Space-optimal proportion consensus with population protocols
Lecture Notes in Computer Science | 2022-11-04 | Paper |
Iterated Type Partitions
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Parameterized complexity of immunization in the threshold model
(available as arXiv preprint) | 2022-07-13 | Paper |
Dual domination problems in graphs
Journal of Computer and System Sciences | 2022-05-16 | Paper |
Parameterized Complexity of Immunization in the Threshold Model
(available as arXiv preprint) | 2021-02-06 | Paper |
| Low-weight superimposed codes and their applications | 2020-07-07 | Paper |
| Dual Domination | 2020-02-25 | Paper |
Fast and frugal targeting with incentives
Theoretical Computer Science | 2020-02-20 | Paper |
Whom to befriend to influence people
Theoretical Computer Science | 2020-02-06 | Paper |
Low-weight superimposed codes and related combinatorial structures: bounds and applications
Theoretical Computer Science | 2020-01-16 | Paper |
Minimum-Entropy Couplings and Their Applications
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Active influence spreading in social networks
Theoretical Computer Science | 2019-03-13 | Paper |
Time-bounded influence diffusion with incentives
(available as arXiv preprint) | 2019-01-30 | Paper |
Fast gossiping by short messages
Automata, Languages and Programming | 2019-01-10 | Paper |
Evangelism in social networks: algorithms and complexity
Networks | 2018-09-04 | Paper |
Time-Bounded Influence Diffusion with Incentives
(available as arXiv preprint) | 2018-07-18 | Paper |
Colouring paths in directed symmetric trees with applications to WDM routing
Automata, Languages and Programming | 2018-07-04 | Paper |
Bounds on the Entropy of a Function of a Random Variable and Their Applications
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Discovering small target sets in social networks: a fast and effective algorithm
Algorithmica | 2018-06-01 | Paper |
| On \(k\)-strong conflict-free multicoloring | 2018-03-26 | Paper |
Brief Announcement
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Multi-level dynamo and opinion spreading
Mathematical Structures in Computer Science | 2017-04-04 | Paper |
| On Finding Small Sets that Influence Large Networks | 2016-10-16 | Paper |
Evangelism in social networks
Lecture Notes in Computer Science | 2016-09-29 | Paper |
A fast and effective heuristic for discovering small target sets in social networks
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Optimizing spread of influence in social networks via partial incentives
Structural Information and Communication Complexity | 2016-01-08 | 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 |
Strong conflict-free coloring for intervals
Algorithmica | 2015-01-19 | Paper |
Complexity of conflict-free colorings of graphs
Theoretical Computer Science | 2015-01-06 | Paper |
Latency-bounded target set selection in social networks
Theoretical Computer Science | 2014-04-29 | Paper |
Optimal time data gathering in wireless networks with multidirectional antennas
Theoretical Computer Science | 2014-01-13 | Paper |
Influence Diffusion in Social Networks under Time Window Constraints
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Latency-bounded target set selection in social networks
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Strong conflict-free coloring for intervals
Algorithms and Computation | 2013-03-21 | Paper |
Spider covers and their applications
ISRN Discrete Mathematics | 2013-02-21 | Paper |
Minimum Weight Dynamo and Fast Opinion Spreading
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
A note on submodular set cover on matroids
Discrete Mathematics | 2009-12-15 | Paper |
Navigable small-world networks with few random bits
Theoretical Computer Science | 2009-11-06 | Paper |
Degree-optimal routing for P2P systems
Theory of Computing Systems | 2009-09-18 | Paper |
Collision-free path coloring with application to minimum-delay gathering in sensor networks
Discrete Applied Mathematics | 2009-06-24 | Paper |
A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
F-Chord: Improved uniform routing on Chord
Networks | 2008-12-17 | Paper |
Gathering with Minimum Delay in Tree Sensor Networks
Structural Information and Communication Complexity | 2008-07-10 | Paper |
How Much Independent Should Individual Contacts Be to Form a Small–World?
Algorithms and Computation | 2008-04-24 | Paper |
Optimally Fast Data Gathering in Sensor Networks
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science | 2006-04-28 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
On searching strategies, parallel questions, and delayed answers
Discrete Applied Mathematics | 2005-02-23 | Paper |
| scientific article; zbMATH DE number 2102779 (Why is no real title available?) | 2004-09-24 | Paper |
Spanning spiders and light-splitting switches
Discrete Mathematics | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 2086635 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2038756 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1696532 (Why is no real title available?) | 2002-07-22 | Paper |
Coloring all directed paths in a symmetric tree, with an application to optical networks
Journal of Graph Theory | 2002-07-11 | Paper |
Sparse and limited wavelength conversion in all-optical tree networks
Theoretical Computer Science | 2002-03-03 | Paper |
Efficient communication in unknown networks
Networks | 2001-10-14 | Paper |
Efficient algorithms for chemical threshold testing problems
Theoretical Computer Science | 2001-08-20 | Paper |
Concurrent multicast in weighted networks
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1421019 (Why is no real title available?) | 2000-09-04 | Paper |
Efficient collective communciation in optical networks
Theoretical Computer Science | 2000-08-23 | Paper |
| Fast collective communication by packets in the postal model | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1456816 (Why is no real title available?) | 2000-06-07 | Paper |
| scientific article; zbMATH DE number 1426190 (Why is no real title available?) | 2000-03-30 | Paper |
Efficient generation of fair dice with few biased coins
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Group testing with unreliable tests
Information Sciences | 1999-05-18 | Paper |
Communication complexity of fault-tolerant information diffusion
Theoretical Computer Science | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 1222826 (Why is no real title available?) | 1998-11-11 | Paper |
Optimal sequential gossiping by short messages
Discrete Applied Mathematics | 1998-11-03 | Paper |
Minimum time broadcast in faulty star networks
Discrete Applied Mathematics | 1998-10-08 | Paper |
Fast Gossiping by Short Messages
SIAM Journal on Computing | 1998-09-20 | Paper |
Communication complexity of gossiping by packets
Journal of Parallel and Distributed Computing | 1997-12-17 | Paper |
| scientific article; zbMATH DE number 1047923 (Why is no real title available?) | 1997-11-09 | Paper |
On the information rate of secret sharing schemes
Theoretical Computer Science | 1997-02-28 | Paper |
| scientific article; zbMATH DE number 961881 (Why is no real title available?) | 1997-01-07 | Paper |
| scientific article; zbMATH DE number 826055 (Why is no real title available?) | 1996-05-27 | Paper |
| scientific article; zbMATH DE number 826065 (Why is no real title available?) | 1995-12-13 | Paper |
On the capacity of Boolean graph formulæ
Graphs and Combinatorics | 1995-09-11 | Paper |
Optimal detection of a counterfeit coin with multi-arms balances
Discrete Applied Mathematics | 1995-08-27 | Paper |
| scientific article; zbMATH DE number 708803 (Why is no real title available?) | 1995-03-30 | Paper |
Capacities: From information theory to extremal set theory
Journal of Combinatorial Theory. Series A | 1995-03-05 | Paper |
Reliable broadcasting
Discrete Applied Mathematics | 1995-03-05 | Paper |
A fast algorithm for the unique decipherability of multivalued encodings
Theoretical Computer Science | 1995-01-09 | Paper |
Different capacities of a digraph
Graphs and Combinatorics | 1994-09-26 | Paper |
On the size of shares for secret sharing schemes
Journal of Cryptology | 1994-01-03 | Paper |
Fault—tolerant hypercube broadcasting via information dispersal
Networks | 1993-08-23 | Paper |
| scientific article; zbMATH DE number 219254 (Why is no real title available?) | 1993-06-29 | Paper |
Sperner capacities
Graphs and Combinatorics | 1993-06-29 | Paper |
Fault tolerant routing in the star and pancake interconnection networks
Information Processing Letters | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 176543 (Why is no real title available?) | 1993-05-18 | Paper |
Qualitative independence and Sperner problems for directed graphs
Journal of Combinatorial Theory. Series A | 1993-01-17 | Paper |
Tighter time bounds on fault-tolerant broadcasting and gossiping
Networks | 1992-10-13 | Paper |
Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
SIAM Journal on Discrete Mathematics | 1992-09-27 | Paper |
Search problems for two irregular coins with incomplete feedback: The underweight model
Discrete Applied Mathematics | 1992-09-27 | Paper |
An improved algorithm for quantitative group testing
Discrete Applied Mathematics | 1992-09-27 | Paper |
On the construction of statistically synchronizable codes
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 30329 (Why is no real title available?) | 1992-06-27 | Paper |
Efficient q-ary immutable codes
Discrete Applied Mathematics | 1992-06-27 | Paper |
Decoders with initial state invariance for multivalued encodings
Theoretical Computer Science | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4132092 (Why is no real title available?) | 1990-01-01 | Paper |
On the construction of minimal broadcast networks
Networks | 1989-01-01 | Paper |
An efficient algorithm for testing immutability of variable-length codes
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4164724 (Why is no real title available?) | 1988-01-01 | Paper |
On the characterization of statistically synchronizable variable-length codes
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
