| Publication | Date of Publication | Type |
|---|
| Gossiping in Cayley graphs by packets | 2024-07-05 | 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 |
Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between
Algorithmica | 2021-04-19 | Paper |
Assigning labels in an unknown anonymous network with a leader
Distributed Computing | 2020-12-03 | Paper |
| Study of a combinatorial game in graphs through linear programming | 2020-11-25 | Paper |
Sequential metric dimension
Algorithmica | 2020-10-12 | Paper |
Study of a combinatorial game in graphs through linear programming
Algorithmica | 2020-04-09 | Paper |
| Eternal domination in grids | 2020-02-06 | Paper |
Sequential metric dimension
Approximation and Online Algorithms | 2019-01-15 | Paper |
Colouring paths in directed symmetric trees with applications to WDM routing
Automata, Languages and Programming | 2018-07-04 | 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 |
Spy-game on graphs: complexity and simple topologies
Theoretical Computer Science | 2018-05-15 | Paper |
Maintaining balanced trees for structured distributed streaming systems
Discrete Applied Mathematics | 2017-10-17 | Paper |
| Spy-game on graphs | 2017-07-17 | Paper |
Bin packing with colocations
Approximation and Online Algorithms | 2017-04-04 | Paper |
| Combinatorial optimization in networks with shared risk link groups | 2017-03-03 | Paper |
| Weighted coloring in trees | 2017-03-03 | Paper |
Exclusive graph searching vs. pathwidth
Information and Computation | 2016-12-22 | 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 |
Memory requirement for routing in distributed networks
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 | 2015-09-11 | Paper |
Connected surveillance game
Theoretical Computer Science | 2015-05-22 | Paper |
Weighted coloring in trees
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
Assigning labels in unknown anonymous networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
Design of fault-tolerant on-board networks with variable switch sizes
Theoretical Computer Science | 2014-12-02 | Paper |
Directed acyclic graphs with the unique dipath property
Theoretical Computer Science | 2014-01-16 | Paper |
Optimal time data gathering in wireless networks with multidirectional antennas
Theoretical Computer Science | 2014-01-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 |
From balls and bins to points and vertices
Algorithmic Operations Research | 2013-12-11 | Paper |
Connectivity inference in mass spectrometry based structure determination
Lecture Notes in Computer Science | 2013-09-17 | Paper |
GATHERING RADIO MESSAGES IN THE PATH
Discrete Mathematics, Algorithms and Applications | 2013-06-11 | Paper |
On the approximability of some degree-constrained subgraph problems
Discrete Applied Mathematics | 2012-08-14 | Paper |
GMPLS label space minimization through hypergraph layouts
Theoretical Computer Science | 2012-08-10 | Paper |
Cross line and column generation for the cut covering problem in wireless networks
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Minimal selectors and fault tolerant networks
Networks | 2010-11-24 | Paper |
Fractional path coloring in bounded degree trees with applications
Algorithmica | 2010-09-16 | Paper |
On the path-width of planar graphs
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
Designing hypergraph layouts to GMPLS routing strategies
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Hardness and approximation of traffic grooming
Theoretical Computer Science | 2009-09-10 | Paper |
Disjoint paths in symmetric digraphs
Discrete Applied Mathematics | 2009-03-04 | Paper |
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Approximation and Online Algorithms | 2009-02-12 | Paper |
Neighborhood Broadcasting in Hypercubes
SIAM Journal on Discrete Mathematics | 2008-12-05 | Paper |
On the complexity of bandwidth allocation in radio networks
Theoretical Computer Science | 2008-11-12 | Paper |
The “real” approximation factor of the MST heuristic for the minimum energy broadcasting
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
Asymptotically optimal solutions for small world graphs
Theory of Computing Systems | 2008-06-06 | Paper |
Hardness and Approximation of Traffic Grooming
Algorithms and Computation | 2008-05-27 | Paper |
Improved approximation results for the minimum energy broadcasting problem
Algorithmica | 2008-02-18 | Paper |
Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions
Structural Information and Communication Complexity | 2007-11-15 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Distributed Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Virtual network embedding in the cycle
Discrete Applied Mathematics | 2005-02-23 | Paper |
Lower bounds on systolic gossip
Information and Computation | 2005-02-22 | Paper |
Hierarchical ring network design
Theory of Computing Systems | 2005-02-11 | Paper |
Approximate constrained bipartite edge coloring
Discrete Applied Mathematics | 2004-11-23 | Paper |
Distance labeling in graphs
Journal of Algorithms | 2004-11-12 | Paper |
SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
| scientific article; zbMATH DE number 2102779 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2044917 (Why is no real title available?) | 2004-02-18 | Paper |
Deadlock prevention by acyclic orientations
Discrete Applied Mathematics | 2003-07-30 | Paper |
The minimum range assignment problem on linear radio networks
Algorithmica | 2003-06-02 | Paper |
Directed virtual path layouts in ATM networks
Theoretical Computer Science | 2003-05-14 | Paper |
Isomorphisms of the De Bruijn digraph and free‐space optical networks
Networks | 2002-12-17 | 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 |
| scientific article; zbMATH DE number 1754632 (Why is no real title available?) | 2002-06-12 | Paper |
| Distance labeling in graphs (extended abstract) | 2002-03-14 | Paper |
| scientific article; zbMATH DE number 1670654 (Why is no real title available?) | 2001-12-18 | Paper |
Efficient communication in unknown networks
Networks | 2001-10-14 | Paper |
Complete rotations in Cayley graphs
European Journal of Combinatorics | 2001-07-09 | Paper |
On the optimality of general lower bounds for broadcasting and gossiping
SIAM Journal on Discrete Mathematics | 2001-06-21 | Paper |
Efficient collective communciation in optical networks
Theoretical Computer Science | 2000-08-23 | Paper |
Symmetric flows and broadcasting in hypercubes
Annales de l’institut Fourier | 1999-07-12 | Paper |
Symmetric flows and broadcasting in hypercubes
Annales de l’institut Fourier | 1999-07-12 | Paper |
Optimal sequential gossiping by short messages
Discrete Applied Mathematics | 1998-11-03 | Paper |
Hamilton circuits in the directed wrapped Butterfly network
Discrete Applied Mathematics | 1998-10-18 | Paper |
| scientific article; zbMATH DE number 1107721 (Why is no real title available?) | 1998-09-27 | Paper |
Optimal wavelength-routed multicasting
Discrete Applied Mathematics | 1998-07-28 | Paper |
Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
Discrete Applied Mathematics | 1998-07-28 | Paper |
A Note on the Dimensionality of Modified Knödel Graphs
International Journal of Foundations of Computer Science | 1997-11-20 | Paper |
A proof of Jean de Rumeur's conjecture
Discrete Applied Mathematics | 1997-08-31 | Paper |
