| Publication | Date of Publication | Type |
|---|
| An FPT algorithm for spanning trees with few branch vertices parameterized by modular-width | 2024-12-03 | Paper |
| Graph burning in community-based networks | 2024-11-12 | Paper |
| Getting linear time in graphs of bounded neighborhood diversity | 2024-09-05 | Paper |
| Parameterized complexity for iterated type partitions and modular-width | 2024-04-10 | Paper |
| Spanning trees with few branch vertices in graphs of bounded neighborhood diversity | 2024-01-11 | Paper |
| Groups burning: analyzing spreading processes in community-based networks | 2023-11-24 | Paper |
| Immunization in the threshold model: a parameterized complexity study | 2023-11-17 | Paper |
| Pervasive domination | 2023-08-03 | Paper |
| Speeding up networks mining via neighborhood diversity | 2023-02-07 | Paper |
| Communication complexity of gossiping by packets | 2022-12-09 | Paper |
| Concurrent multicast in weighted networks | 2022-12-09 | Paper |
| Space-Optimal Proportion Consensus with Population Protocols | 2022-11-04 | Paper |
| Iterated Type Partitions | 2022-10-13 | Paper |
| Parameterized complexity of immunization in the threshold model | 2022-07-13 | Paper |
| Dual domination problems in graphs | 2022-05-16 | Paper |
| Parameterized Complexity of Immunization in the Threshold Model | 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 | 2020-02-20 | Paper |
| Whom to befriend to influence people | 2020-02-06 | Paper |
| Low-weight superimposed codes and related combinatorial structures: bounds and applications | 2020-01-16 | Paper |
| Minimum-Entropy Couplings and Their Applications | 2019-07-19 | Paper |
| Active influence spreading in social networks | 2019-03-13 | Paper |
| Time-bounded influence diffusion with incentives | 2019-01-30 | Paper |
| Fast gossiping by short messages | 2019-01-10 | Paper |
| Evangelism in social networks: Algorithms and complexity | 2018-09-04 | Paper |
| Time-Bounded Influence Diffusion with Incentives | 2018-07-18 | Paper |
| Colouring paths in directed symmetric trees with applications to WDM routing | 2018-07-04 | Paper |
| Bounds on the Entropy of a Function of a Random Variable and Their Applications | 2018-06-27 | Paper |
| Discovering small target sets in social networks: a fast and effective algorithm | 2018-06-01 | Paper |
| On \(k\)-strong conflict-free multicoloring | 2018-03-26 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| Multi-level dynamo and opinion spreading | 2017-04-04 | Paper |
| Whom to befriend to influence people | 2016-12-01 | Paper |
| On Finding Small Sets that Influence Large Networks | 2016-10-16 | Paper |
| Evangelism in Social Networks | 2016-09-29 | Paper |
| A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks | 2016-02-05 | Paper |
| Optimizing Spread of Influence in Social Networks via Partial Incentives | 2016-01-08 | Paper |
| Spread of influence in weighted networks under time and budget constraints | 2015-05-26 | Paper |
| Influence diffusion in social networks under time window constraints | 2015-05-22 | Paper |
| Strong conflict-free coloring for intervals | 2015-01-19 | Paper |
| Complexity of conflict-free colorings of graphs | 2015-01-06 | Paper |
| Latency-bounded target set selection in social networks | 2014-04-29 | Paper |
| Optimal time data gathering in wireless networks with multidirectional antennas | 2014-01-13 | Paper |
| Influence Diffusion in Social Networks under Time Window Constraints | 2013-12-17 | Paper |
| Latency-Bounded Target Set Selection in Social Networks | 2013-08-05 | Paper |
| Strong Conflict-Free Coloring for Intervals | 2013-03-21 | Paper |
| Spider covers and their applications | 2013-02-21 | Paper |
| Minimum Weight Dynamo and Fast Opinion Spreading | 2012-11-06 | Paper |
| A note on submodular set cover on matroids | 2009-12-15 | Paper |
| Navigable small-world networks with few random bits | 2009-11-06 | Paper |
| Degree-optimal routing for P2P systems | 2009-09-18 | Paper |
| Collision-free path coloring with application to minimum-delay gathering in sensor networks | 2009-06-24 | Paper |
| A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes | 2008-12-21 | Paper |
| F-Chord: Improved uniform routing on Chord | 2008-12-17 | Paper |
| Gathering with Minimum Delay in Tree Sensor Networks | 2008-07-10 | Paper |
| How Much Independent Should Individual Contacts Be to Form a Small–World? | 2008-04-24 | Paper |
| Optimally Fast Data Gathering in Sensor Networks | 2007-09-05 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Asynchronous deterministic rendezvous in graphs | 2006-04-28 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| On searching strategies, parallel questions, and delayed answers | 2005-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818867 | 2004-09-24 | Paper |
| Spanning spiders and light-splitting switches | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737170 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449221 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766680 | 2002-07-22 | Paper |
| Coloring all directed paths in a symmetric tree, with an application to optical networks | 2002-07-11 | Paper |
| Sparse and limited wavelength conversion in all-optical tree networks | 2002-03-03 | Paper |
| Efficient communication in unknown networks | 2001-10-14 | Paper |
| Concurrent multicast in weighted networks | 2001-08-20 | Paper |
| Efficient algorithms for chemical threshold testing problems | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4946041 | 2000-09-04 | Paper |
| Efficient collective communciation in optical networks | 2000-08-23 | Paper |
| Fast collective communication by packets in the postal model | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954414 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4950446 | 2000-03-30 | Paper |
| Efficient generation of fair dice with few biased coins | 1999-11-21 | Paper |
| Group testing with unreliable tests | 1999-05-18 | Paper |
| Communication complexity of fault-tolerant information diffusion | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218414 | 1998-11-11 | Paper |
| Optimal sequential gossiping by short messages | 1998-11-03 | Paper |
| Minimum time broadcast in faulty star networks | 1998-10-08 | Paper |
| Fast Gossiping by Short Messages | 1998-09-20 | Paper |
| Communication complexity of gossiping by packets | 1997-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348003 | 1997-11-09 | Paper |
| On the information rate of secret sharing schemes | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5689764 | 1997-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858441 | 1996-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858451 | 1995-12-13 | Paper |
| On the capacity of Boolean graph formulæ | 1995-09-11 | Paper |
| Optimal detection of a counterfeit coin with multi-arms balances | 1995-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318691 | 1995-03-30 | Paper |
| Capacities: From information theory to extremal set theory | 1995-03-05 | Paper |
| Reliable broadcasting | 1995-03-05 | Paper |
| A fast algorithm for the unique decipherability of multivalued encodings | 1995-01-09 | Paper |
| Different capacities of a digraph | 1994-09-26 | Paper |
| On the size of shares for secret sharing schemes | 1994-01-03 | Paper |
| Fault—tolerant hypercube broadcasting via information dispersal | 1993-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694740 | 1993-06-29 | Paper |
| Sperner capacities | 1993-06-29 | Paper |
| Fault tolerant routing in the star and pancake interconnection networks | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035710 | 1993-05-18 | Paper |
| Qualitative independence and Sperner problems for directed graphs | 1993-01-17 | Paper |
| Tighter time bounds on fault-tolerant broadcasting and gossiping | 1992-10-13 | Paper |
| Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults | 1992-09-27 | Paper |
| Search problems for two irregular coins with incomplete feedback: The underweight model | 1992-09-27 | Paper |
| An improved algorithm for quantitative group testing | 1992-09-27 | Paper |
| On the construction of statistically synchronizable codes | 1992-06-28 | Paper |
| Efficient \(q\)-ary immutable codes | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3985385 | 1992-06-27 | Paper |
| Decoders with initial state invariance for multivalued encodings | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033705 | 1990-01-01 | Paper |
| On the construction of minimal broadcast networks | 1989-01-01 | Paper |
| An efficient algorithm for testing immutability of variable-length codes | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3491466 | 1988-01-01 | Paper |
| On the characterization of statistically synchronizable variable-length codes | 1988-01-01 | Paper |
