Cerasela Tanasescu
From MaRDI portal
Person:2255040
Available identifiers
zbMath Open tanasescu.ceraselaMaRDI QIDQ2255040
List of research outcomes
| Publication | Date of Publication | Type |
|---|---|---|
| https://portal.mardi4nfdi.de/entity/Q5741889 | 2019-05-16 | Paper |
| Incidence Graphs of Bipartite G-Graphs | 2017-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2827155 | 2016-10-12 | Paper |
| On some applications of the selective graph coloring problem | 2016-07-06 | Paper |
| About some robustness and complexity properties of \(G\)-graphs networks | 2015-02-06 | Paper |
| Hardness and approximation of minimum maximal matchings | 2014-12-29 | Paper |
| G-graphs Characterisation and Incidence Graphs | 2014-05-13 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
| Property | Value |
|---|---|
| MaRDI profile type | MaRDI person profile |
| instance of | human |
This page was built for person: Cerasela Tanasescu
