| Publication | Date of Publication | Type |
|---|
On the existence of \delta-temporal cliques in random simple temporal graphs
(available as arXiv preprint) | N/A | Paper |
| scientific article; zbMATH DE number 7788601 (Why is no real title available?) | 2024-01-15 | Paper |
Near-optimal dominating sets in dense random graphs in polynomial expected time
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Mobility-aware, adaptive algorithms for wireless power transfer in ad hoc networks
Algorithms for Sensor Systems | 2023-10-20 | Paper |
Selected combinatorial problems through the prism of random intersection graphs models
Lecture Notes in Computer Science | 2023-10-04 | Paper |
MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems
Algorithmica | 2023-09-27 | Paper |
A spectral algorithm for finding maximum cliques in dense random intersection graphs
Lecture Notes in Computer Science | 2023-08-14 | Paper |
| How fast can we reach a target vertex in stochastic temporal graphs? | 2022-07-21 | Paper |
Maximum cliques in graphs with small intersection number and random intersection graphs
Computer Science Review | 2021-12-20 | Paper |
An extension of the Moran process using type-specific connection graphs
Journal of Computer and System Sciences | 2021-11-25 | Paper |
How fast can we reach a target vertex in stochastic temporal graphs?
Journal of Computer and System Sciences | 2020-09-07 | Paper |
How fast can we reach a target vertex in stochastic temporal graphs?
Journal of Computer and System Sciences | 2020-09-07 | Paper |
Mutants and residents with different connection graphs in the Moran process
Lecture Notes in Computer Science | 2020-02-12 | Paper |
Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing
Automata, Languages and Programming | 2019-04-29 | Paper |
Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time
Automata, Languages and Programming | 2019-01-10 | Paper |
Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks
Algorithms | 2018-08-20 | Paper |
| Stably Computing Order Statistics with Arithmetic Population Protocols | 2018-03-21 | Paper |
Strategic contention resolution with limited feedback
(available as arXiv preprint) | 2018-03-02 | Paper |
A 3-player protocol preventing persistence in strategic contention with limited feedback
(available as arXiv preprint) | 2018-02-13 | Paper |
Expander properties in random regular graphs with edge faults
STACS 95 | 2017-12-04 | Paper |
On the chromatic number of non-sparse random intersection graphs
Theory of Computing Systems | 2017-03-31 | Paper |
Determining majority in networks with local interactions and very small local memory
Distributed Computing | 2017-03-29 | Paper |
A glimpse at Paul G. Spirakis
Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations
Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
On Some Combinatorial Properties of Random Intersection Graphs
Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
On the structure of equilibria in basic network formation
Theoretical Computer Science | 2015-06-10 | Paper |
Connectivity properties in random regular graphs with edge faults
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
On the energy balance problem in distributed sensor networks
Computer Science Review | 2014-10-24 | Paper |
Book review of: Y. Shoham and K. Leyton-Brown, Multiagent systems. Algorithmic, game-theoretic, and logical foundations.
Computer Science Review | 2014-10-24 | Paper |
Determining majority in networks with local interactions and very small local memory
Automata, Languages, and Programming | 2014-07-01 | Paper |
Determining majority in networks with local interactions and very small local memory
Automata, Languages, and Programming | 2014-07-01 | Paper |
On the Structure of Equilibria in Basic Network Formation
Fundamentals of Computation Theory | 2013-08-16 | Paper |
A guided tour in random intersection graphs
Automata, Languages, and Programming | 2013-08-07 | Paper |
Natural models for evolution on networks
Theoretical Computer Science | 2013-04-17 | Paper |
Maximum cliques in graphs with small intersection number and random intersection graphs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
On the independence number and Hamiltonicity of uniform random intersection graphs
Theoretical Computer Science | 2011-12-07 | Paper |
Selected Combinatorial Properties of Random Intersection Graphs
Algebraic Foundations in Computer Science | 2011-11-11 | Paper |
Probabilistic data propagation in wireless sensor networks
Monographs in Theoretical Computer Science | 2011-04-05 | Paper |
Energy-Balanced Data Propagation inWireless Sensor Networks
Monographs in Theoretical Computer Science. An EATCS Series | 2011-04-05 | Paper |
Stochastic models and adaptive algorithms for energy balance in sensor networks
Theory of Computing Systems | 2010-10-06 | Paper |
Expander properties and the cover time of random intersection graphs
Theoretical Computer Science | 2009-11-06 | Paper |
Colouring Non-sparse Random Intersection Graphs
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
| scientific article; zbMATH DE number 5604064 (Why is no real title available?) | 2009-09-15 | Paper |
| scientific article; zbMATH DE number 5604106 (Why is no real title available?) | 2009-09-15 | Paper |
The survival of the weakest in networks
Computational & Mathematical Organization Theory | 2009-08-06 | Paper |
Large independent sets in general random intersection graphs
Theoretical Computer Science | 2008-11-12 | Paper |
Expander Properties and the Cover Time of Random Intersection Graphs
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
Algebraic Informatics | 2008-09-04 | Paper |
Efficient sensor network design for continuous monitoring of moving objects
Theoretical Computer Science | 2008-08-14 | Paper |
The Survival of the Weakest in Networks
Approximation and Online Algorithms | 2008-02-21 | Paper |
Adaptive energy management for incremental deployment of heterogeneous wireless sensors
Theory of Computing Systems | 2008-02-18 | Paper |
A mobility aware protocol synthesis for efficient routing in ad hoc mobile networks
Computer Networks | 2007-12-17 | Paper |
Algorithms for Wireless Sensor Networks: Design, Analysis and Experimental Evaluation
Experimental Algorithms | 2007-09-14 | Paper |
Fault-tolerant and efficient data propagation in wireless sensor networks using local, additional network information
Journal of Parallel and Distributed Computing | 2007-04-26 | Paper |
| scientific article; zbMATH DE number 5145345 (Why is no real title available?) | 2007-04-23 | Paper |
The infection time of graphs
Discrete Applied Mathematics | 2007-01-09 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
Journal of Discrete Algorithms | 2006-10-31 | Paper |
The impact of network structure on the stability of greedy protocols
Theory of Computing Systems | 2006-02-08 | Paper |
Radiocoloring in planar graphs: Complexity and approximations
Theoretical Computer Science | 2005-09-22 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
| scientific article; zbMATH DE number 2156278 (Why is no real title available?) | 2005-04-15 | Paper |
Attack propagation in networks
Theory of Computing Systems | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2090691 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2080866 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2013824 (Why is no real title available?) | 2003-12-07 | Paper |
| scientific article; zbMATH DE number 2011861 (Why is no real title available?) | 2003-12-02 | Paper |
| scientific article; zbMATH DE number 2006659 (Why is no real title available?) | 2003-11-23 | Paper |
| scientific article; zbMATH DE number 1982173 (Why is no real title available?) | 2003-09-16 | Paper |
Distributed communication algorithms for ad hoc mobile networks.
Journal of Parallel and Distributed Computing | 2003-08-07 | Paper |
| scientific article; zbMATH DE number 1953881 (Why is no real title available?) | 2003-07-28 | Paper |
| scientific article; zbMATH DE number 1953096 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1929928 (Why is no real title available?) | 2003-06-18 | Paper |
| scientific article; zbMATH DE number 1857646 (Why is no real title available?) | 2003-06-02 | Paper |
| scientific article; zbMATH DE number 1862255 (Why is no real title available?) | 2003-01-30 | Paper |
On the robustness of interconnections in random graphs: a symbolic approach.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1848400 (Why is no real title available?) | 2003-01-05 | Paper |
| scientific article; zbMATH DE number 1819633 (Why is no real title available?) | 2002-12-10 | Paper |
| scientific article; zbMATH DE number 1759469 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1760005 (Why is no real title available?) | 2002-11-06 | Paper |
| scientific article; zbMATH DE number 1759423 (Why is no real title available?) | 2002-11-04 | Paper |
