List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs Networks | 2024-09-05 | Paper |
| Maximum cut on interval graphs of interval count four is NP-complete Discrete & Computational Geometry | 2024-04-02 | Paper |
| On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems Networks | 2023-12-11 | Paper |
| MaxCut on permutation graphs is NP‐complete Journal of Graph Theory | 2023-10-10 | Paper |
| scientific article; zbMATH DE number 7724211 (Why is no real title available?) (available as arXiv preprint) | 2023-08-08 | Paper |
| On the computational difficulty of the terminal connection problem RAIRO - Theoretical Informatics and Applications | 2023-05-25 | Paper |
| On the terminal connection problem | 2022-03-24 | Paper |
| Computing the zig-zag number of directed graphs Discrete Applied Mathematics | 2022-03-24 | Paper |
Research outcomes over time
This page was built for person: Alexsander A. de Melo
