| Publication | Date of Publication | Type |
|---|
| O(n2) algorithms for graph planarization | 2024-02-28 | Paper |
| The spectral determination of the connected multicone graphs | 2021-11-15 | Paper |
| Symmetric PMC model of diagnosis, \(b\)-matchings in graphs and fault identification in \(t\)-diagnosable systems | 2021-10-21 | Paper |
| On the spectral determinations of the connected multicone graphs | 2021-10-05 | Paper |
| The spectral characterization of the connected multicone graphs | 2021-10-05 | Paper |
| Hybrid PMC (HPMC) fault model and diagnosability of interconnection networks | 2021-09-01 | Paper |
| Fault tolerance of hypercube like networks: spanning laceability under edge faults | 2020-08-17 | Paper |
| Failure propagation modeling and analysis via system interfaces | 2018-10-12 | Paper |
| Computing the shortest network under a fixed topology | 2018-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635966 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635961 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635975 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635971 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635968 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635955 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635956 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635957 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635962 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635963 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635983 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635995 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635996 | 2018-04-23 | Paper |
| Constrained shortest link-disjoint paths selection: a network programming based approach | 2017-11-20 | Paper |
| Dominator sequences in bipartite graphs | 2017-09-12 | Paper |
| Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes | 2017-07-12 | Paper |
| Conditional diagnosability of a class of matching composition networks under the comparison model | 2017-05-12 | Paper |
| Diagnosis in a network of processors: centralized and distributed models and algorithms | 2013-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3615802 | 2009-03-24 | Paper |
| Identifying codes of cycles with odd orders | 2008-09-04 | Paper |
| On the partial path protection scheme for WDM optical networks and polynomial time computability of primary and secondary paths | 2008-02-11 | Paper |
| The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm | 2007-09-10 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization | 2006-05-09 | Paper |
| Global optimization properties of parallel cooperative search algorithms: A simulation study | 2002-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525722 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4004084 | 1992-09-18 | Paper |
| MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis | 1989-01-01 | Paper |
| Planar embedding: linear-time algorithms for vertex placement and edge orderings | 1988-01-01 | Paper |
| Structure of the submarking-reachability problem and network programming | 1988-01-01 | Paper |
| Maximum-weight markings in marked graphs: Algorithms and interpretations based on the simplex method | 1987-01-01 | Paper |
| Structure of the reachability problem for (0,l)-capacitated marked graphs | 1987-01-01 | Paper |
| On maximal planarization of nonplanar graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3323860 | 1984-01-01 | Paper |
| Complexity of computation of a spanning tree enumeration algorithm | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3309631 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3934423 | 1981-01-01 | Paper |
| (n +p)-node realizability of Y-matrices of (n + 1)-node resistancen-port networks | 1978-01-01 | Paper |
| Continuously equivalent realizations of 3rd-order paramount matrices | 1977-01-01 | Paper |
| On the number of conductances required for realizingY andK matrices | 1977-01-01 | Paper |
| (n+2)-node resistive n-port realizability of Y-matrices | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4053515 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4178928 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4067000 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4105597 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4105598 | 1972-01-01 | Paper |
