| Publication | Date of Publication | Type |
|---|
| A random growth model with any real or theoretical degree distribution | 2023-04-20 | Paper |
| Interest clustering coefficient: a new metric for directed networks like Twitter | 2022-03-01 | Paper |
| Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between | 2021-04-19 | Paper |
| Assigning labels in an unknown anonymous network with a leader | 2020-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136239 | 2020-11-25 | Paper |
| Sequential metric dimension | 2020-10-12 | Paper |
| Study of a combinatorial game in graphs through linear programming | 2020-04-09 | Paper |
| Eternal domination in grids | 2020-02-06 | Paper |
| Sequential metric dimension | 2019-01-15 | Paper |
| Colouring paths in directed symmetric trees with applications to WDM routing | 2018-07-04 | Paper |
| Grid spanners with low forwarding index for energy efficient networks | 2018-06-27 | Paper |
| On the complexity of equal shortest path routing | 2018-06-13 | Paper |
| Spy-game on graphs: complexity and simple topologies | 2018-05-15 | Paper |
| Maintaining balanced trees for structured distributed streaming systems | 2017-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5282808 | 2017-07-17 | Paper |
| Bin Packing with Colocations | 2017-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2965473 | 2017-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2965980 | 2017-03-03 | Paper |
| Exclusive graph searching vs. pathwidth | 2016-12-22 | Paper |
| Grid spanners with low forwarding index for energy efficient networks | 2016-10-18 | Paper |
| How to Design Graphs with Low Forwarding Index and Limited Number of Edges | 2016-04-04 | Paper |
| Memory requirement for routing in distributed networks | 2015-09-11 | Paper |
| Connected surveillance game | 2015-05-22 | Paper |
| Weighted Coloring in Trees | 2015-04-17 | Paper |
| Assigning labels in unknown anonymous networks (extended abstract) | 2015-03-03 | Paper |
| Design of fault-tolerant on-board networks with variable switch sizes | 2014-12-02 | Paper |
| Directed acyclic graphs with the unique dipath property | 2014-01-16 | Paper |
| Optimal time data gathering in wireless networks with multidirectional antennas | 2014-01-13 | Paper |
| Connected Surveillance Game | 2013-12-17 | Paper |
| Maintaining Balanced Trees for Structured Distributed Streaming Systems | 2013-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2867370 | 2013-12-11 | Paper |
| Connectivity Inference in Mass Spectrometry Based Structure Determination | 2013-09-17 | Paper |
| GATHERING RADIO MESSAGES IN THE PATH | 2013-06-11 | Paper |
| On the approximability of some degree-constrained subgraph problems | 2012-08-14 | Paper |
| GMPLS label space minimization through hypergraph layouts | 2012-08-10 | Paper |
| Cross line and column generation for the cut covering problem in wireless networks | 2012-05-13 | Paper |
| Minimal selectors and fault tolerant networks | 2010-11-24 | Paper |
| Fractional path coloring in bounded degree trees with applications | 2010-09-16 | Paper |
| On the Path-Width of Planar Graphs | 2010-08-27 | Paper |
| Designing Hypergraph Layouts to GMPLS Routing Strategies | 2010-02-24 | Paper |
| Hardness and approximation of traffic grooming | 2009-09-10 | Paper |
| Disjoint paths in symmetric digraphs | 2009-03-04 | Paper |
| Degree-Constrained Subgraph Problems: Hardness and Approximation Results | 2009-02-12 | Paper |
| Neighborhood Broadcasting in Hypercubes | 2008-12-05 | Paper |
| On the complexity of bandwidth allocation in radio networks | 2008-11-12 | Paper |
| The “real” approximation factor of the MST heuristic for the minimum energy broadcasting | 2008-06-20 | Paper |
| Asymptotically optimal solutions for small world graphs | 2008-06-06 | Paper |
| Hardness and Approximation of Traffic Grooming | 2008-05-27 | Paper |
| Improved approximation results for the minimum energy broadcasting problem | 2008-02-18 | Paper |
| Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions | 2007-11-15 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols | 2005-02-28 | Paper |
| Virtual network embedding in the cycle | 2005-02-23 | Paper |
| Lower bounds on systolic gossip | 2005-02-22 | Paper |
| Hierarchical ring network design | 2005-02-11 | Paper |
| Approximate constrained bipartite edge coloring | 2004-11-23 | Paper |
| Distance labeling in graphs | 2004-11-12 | Paper |
| SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818867 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448743 | 2004-02-18 | Paper |
| Deadlock prevention by acyclic orientations | 2003-07-30 | Paper |
| The minimum range assignment problem on linear radio networks | 2003-06-02 | Paper |
| Directed virtual path layouts in ATM networks | 2003-05-14 | Paper |
| Isomorphisms of the De Bruijn digraph and free‐space optical networks | 2002-12-17 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4535060 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768294 | 2002-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753931 | 2001-12-18 | Paper |
| Efficient communication in unknown networks | 2001-10-14 | Paper |
| Complete rotations in Cayley graphs | 2001-07-09 | Paper |
| On the Optimality of General Lower Bounds for Broadcasting and Gossiping | 2001-06-21 | Paper |
| Efficient collective communciation in optical networks | 2000-08-23 | Paper |
| Symmetric flows and broadcasting in hypercubes | 1999-07-12 | Paper |
| Optimal sequential gossiping by short messages | 1998-11-03 | Paper |
| Hamilton circuits in the directed wrapped Butterfly network | 1998-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373669 | 1998-09-27 | Paper |
| Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks | 1998-07-28 | Paper |
| Optimal wavelength-routed multicasting | 1998-07-28 | Paper |
| A Note on the Dimensionality of Modified Knödel Graphs | 1997-11-20 | Paper |
| A proof of Jean de Rumeur's conjecture | 1997-08-31 | Paper |
