| Publication | Date of Publication | Type |
|---|
| Algorithms for the metric ring star problem with fixed edge-cost ratio | 2021-11-25 | Paper |
| Privacy-preserving attribute-keyword based data publish-subscribe service on cloud platforms | 2020-02-06 | Paper |
| The extra connectivity and extra diagnosability of regular interconnection networks | 2020-01-29 | Paper |
| Reliability analysis of data center networks based on precise and imprecise diagnosis strategies | 2020-01-29 | Paper |
| The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell | 2019-03-14 | Paper |
| Mechanism design for two-opposite-facility location games with penalties on distance | 2018-11-08 | Paper |
| Converter placement supporting broadcast in WDM optical networks | 2018-07-09 | Paper |
| Using traffic regulation to meet end-to-end deadlines in ATM networks | 2018-07-09 | Paper |
| Optimal RSUs placement with delay bounded message dissemination in vehicular networks | 2017-08-03 | Paper |
| New analysis and computational study for the planar connected dominating set problem | 2016-10-20 | Paper |
| A Sensor Deployment Strategy in Bus-Based Hybrid Ad-Hoc Networks | 2016-02-05 | Paper |
| An efficient algorithm to construct disjoint path covers of DCell networks | 2015-12-08 | Paper |
| Hamiltonian properties of honeycomb meshes | 2015-09-23 | Paper |
| One-to-one disjoint path covers on alternating group graphs | 2014-12-02 | Paper |
| Independent spanning trees in crossed cubes | 2014-04-16 | Paper |
| Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes | 2014-04-02 | Paper |
| The spined cube: a new hypercube variant with smaller diameter | 2013-03-28 | Paper |
| An algorithm to construct independent spanning trees on parity cubes | 2013-01-07 | Paper |
| Independent spanning trees on twisted cubes | 2012-02-14 | Paper |
| An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges | 2011-07-14 | Paper |
| Efficient unicast in bijective connection networks with the restricted faulty node set | 2011-06-22 | Paper |
| Embedding meshes into twisted-cubes | 2011-06-22 | Paper |
| Computational Study for Planar Connected Dominating Set Problem | 2011-01-10 | Paper |
| Computational study on planar dominating set problem | 2009-11-25 | Paper |
| Design and analysis of a self-tuning feedback controller for the internet | 2009-10-28 | Paper |
| Node-pancyclicity and edge-pancyclicity of crossed cubes | 2009-08-27 | Paper |
| Computational Study on Dominating Set Problem of Planar Graphs | 2009-01-27 | Paper |
| Inapproximability and approximability of minimal tree routing and coloring | 2008-08-08 | Paper |
| Embedding of cycles in twisted cubes with edge-pancyclic | 2008-07-01 | Paper |
| Edge-pancyclicity and path-embeddability of bijective connection graphs | 2008-01-11 | Paper |
| Non-unique probe selection and group testing | 2007-09-03 | Paper |
| Embedding meshes into crossed cubes | 2007-07-25 | Paper |
| Optimal fault-tolerant embedding of paths in twisted cubes | 2007-02-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Complete path embeddings in crossed cubes | 2006-10-19 | Paper |
| Maximal lifetime scheduling for \(k\) to 1 sensor-target surveillance networks | 2006-10-10 | Paper |
| Improving construction for connected dominating set with Steiner tree in wireless sensor networks | 2006-09-26 | Paper |
| On a minimum linear classification problem | 2006-09-26 | Paper |
| On optimal placement of relay nodes for reliable connectivity in wireless sensor networks | 2006-08-14 | Paper |
| Minimum connected dominating sets and maximal independent sets in unit disk graphs | 2006-03-24 | Paper |
| A note on optical network with nonsplitting nodes | 2006-02-08 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| Power assignment for \(k\)-connectivity in wireless ad hoc networks | 2005-06-08 | Paper |
| A greedy approximation for minimum connected dominating sets | 2005-02-09 | Paper |
| Routing algorithm for multicast under multi-tree model in optical networks | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736227 | 2004-08-09 | Paper |
| Coloring of double disk graphs | 2004-03-15 | Paper |
| On shortest \(k\)-edge-connected Steiner networks in metric spaces | 2004-02-18 | Paper |
| Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420338 | 2003-08-17 | Paper |
| A polynomial time approximation scheme for the grade of service Steiner minimum tree problem | 2003-06-09 | Paper |
| An integrated routing and admission control mechanism for real-time multicast connections in ATM networks | 2003-05-19 | Paper |
| Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1 | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4786436 | 2002-12-16 | Paper |
| Optimization of wavelength assignment for QoS multicast in WDM networks | 2002-11-25 | Paper |
| Rivest-Vuillemin conjecture is true for monotone Boolean functions with twelve variables | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4550356 | 2002-08-21 | Paper |
| Placement of data replicas for optimal data availability in ring networks | 2002-07-31 | Paper |
| Clustering Non-uniform-sized Spatial Objects to Reduce I/O Cost for Spatial-join Processing | 2002-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2751944 | 2002-02-27 | Paper |
| Optimal Placement of Web Proxies for Replicated Web Servers in the Internet | 2002-02-27 | Paper |
| Monotone routing in multirate rearrangeable Clos networks | 2002-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2751928 | 2001-10-21 | Paper |
| A schedule of join operations to reduce I/O cost in spatial database systems | 2000-10-26 | Paper |
| Minimizing number of wavelengths in multicast routing trees in WDM networks | 2000-09-14 | Paper |
| Fixed topology Steiner trees and spanning forests | 1999-04-28 | Paper |
