Alexsander A. de Melo

From MaRDI portal
Person:831819

Available identifiers

zbMath Open de-melo.alexsander-aMaRDI QIDQ831819

List of research outcomes





PublicationDate of PublicationType
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs2024-09-05Paper
Maximum cut on interval graphs of interval count four is NP-complete2024-04-02Paper
On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems2023-12-11Paper
MaxCut on permutation graphs is NP‐complete2023-10-10Paper
https://portal.mardi4nfdi.de/entity/Q61684532023-08-08Paper
On the computational difficulty of the terminal connection problem2023-05-25Paper
On the terminal connection problem2022-03-24Paper
Computing the zig-zag number of directed graphs2022-03-24Paper

Research outcomes over time

This page was built for person: Alexsander A. de Melo

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:831819&oldid=6042321"
Powered by MediaWiki