| Publication | Date of Publication | Type |
|---|
| Revisiting the random subset sum problem | 2025-01-06 | Paper |
A random growth model with any real or theoretical degree distribution
Theoretical Computer Science | 2023-04-20 | Paper |
Interest clustering coefficient: a new metric for directed networks like twitter
Journal of Complex Networks | 2022-03-01 | Paper |
| Preferential attachment hypergraph with high modularity | 2021-03-01 | Paper |
Grid spanners with low forwarding index for energy efficient networks
Discrete Applied Mathematics | 2018-06-27 | Paper |
On the complexity of equal shortest path routing
Networks | 2018-06-13 | Paper |
| Energy-efficient service function chain provisioning | 2018-04-11 | Paper |
On the complexity of compressing two dimensional routing tables with order
Algorithmica | 2018-02-28 | Paper |
Maintaining balanced trees for structured distributed streaming systems
Discrete Applied Mathematics | 2017-10-17 | Paper |
| Compressing two-dimensional routing tables with order | 2016-10-18 | Paper |
Grid spanners with low forwarding index for energy efficient networks
Electronic Notes in Discrete Mathematics | 2016-10-18 | Paper |
How to design graphs with low forwarding index and limited number of edges
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Connected surveillance game
Theoretical Computer Science | 2015-05-22 | Paper |
To satisfy impatient web surfers is hard
Theoretical Computer Science | 2014-03-13 | Paper |
Maintaining balanced trees for structured distributed streaming systems
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Connected surveillance game
Structural Information and Communication Complexity | 2013-12-17 | Paper |
| On the hull number of some graph classes | 2013-11-01 | Paper |
Good edge-labelling of graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
On the hull number of some graph classes
Theoretical Computer Science | 2013-03-04 | Paper |
Weighted improper colouring
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Good edge-labelling of graphs
Discrete Applied Mathematics | 2012-11-22 | Paper |
Weighted Improper Colouring
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Minimal selectors and fault tolerant networks
Networks | 2010-11-24 | Paper |
Edge-simple circuits through 10 ordered vertices in square grids
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Order statistics and estimating cardinalities of massive data sets
Discrete Applied Mathematics | 2009-03-04 | Paper |
Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions
Structural Information and Communication Complexity | 2007-11-15 | Paper |
| Order statistics and estimating cardinalities of massive data sets | 2006-08-29 | Paper |
Revisiting the Random Subset Sum problem
(available as arXiv preprint) | N/A | Paper |
