Unit Interval Graphs of Open and Closed Intervals von Rautenbach, Dieter, Szwarcfiter, Jayme L.

Volltext

Irreversible conversion of graphs von Centeno, Carmen C., Dourado, Mitre C., Penso, Lucia Draque, Rautenbach, Dieter, Szwarcfiter, Jayme L.

Volltext

Complexity results related to monophonic convexity von Dourado, Mitre C., Protti, Fábio, Szwarcfiter, Jayme L.

Volltext

On the computational complexity of the bipartizing matching problem von Lima, Carlos V. G. C., Rautenbach, Dieter, Souza, Uéverton S., Szwarcfiter, Jayme L.

Volltext

Thinness of product graphs von Bonomo-Braberman, Flavia, Gonzalez, Carolina L., Oliveira, Fabiano S., Jr, Moysés S. Sampaio, Szwarcfiter, Jayme L.

Volltext

On counting interval lengths of interval graphs von Cerioli, Márcia R., Oliveira, Fabiano de S., Szwarcfiter, Jayme L.

Volltext

Perfect edge domination: hard and solvable cases von Lin, Min Chih, Lozin, Vadim, Moyano, Veronica A., Szwarcfiter, Jayme L.

Volltext

Linear‐time algorithms for eliminating claws in graphs von Bonomo‐Braberman, Flavia, Nascimento, Julliano R., Oliveira, Fabiano S., Souza, Uéverton S., Szwarcfiter, Jayme L.

Volltext

Partitioning a Graph into Complementary Subgraphs von Nascimento, Julliano R., Souza, Uéverton S., Szwarcfiter, Jayme L.

Volltext

On the P3-hull number of some products of graphs von Coelho, Erika M.M., Coelho, Hebert, Nascimento, Julliano R., Szwarcfiter, Jayme L.

Volltext

A polynomial time algorithm for geodetic hull number for complementary prisms von Coelho, Erika M.M., Coelho, Hebert, Nascimento, Julliano R., Szwarcfiter, Jayme L.

Volltext

Normal Helly circular-arc graphs and its subclasses von Lin, Min Chih, Soulignac, Francisco J., Szwarcfiter, Jayme L.

Volltext

Complexity aspects of the computation of the rank of a graph von Ramos, Igor, Santos, Vinícius F., Szwarcfiter, Jayme L.

Volltext

Exact Algorithms for Minimum Weighted Dominating Induced Matching von Lin, Min Chih, Mizrahi, Michel J., Szwarcfiter, Jayme L.

Volltext

On neighborhood-Helly graphs von Groshaus, Marina, Lin, Min Chih, Szwarcfiter, Jayme L.

Volltext

Some remarks on the geodetic number of a graph von Dourado, Mitre C., Protti, Fábio, Rautenbach, Dieter, Szwarcfiter, Jayme L.

Volltext

And/or-convexity: a graph convexity based on processes and deadlock models von Lima, Carlos V. G. C., Protti, Fábio, Rautenbach, Dieter, Souza, Uéverton S., Szwarcfiter, Jayme L.

Volltext

The convexity of induced paths of order three and applications: Complexity aspects von Araújo, Rafael T., Sampaio, Rudini M., dos Santos, Vinícius F., Szwarcfiter, Jayme L.

Volltext

Dijkstra graphs von Bento, Lucila M.S., Boccardo, Davidson R., Machado, Raphael C.S., Miyazawa, Flávio K., Pereira de Sá, Vinícius G., Szwarcfiter, Jayme L.

Volltext

Structured Watermarks for Structured Software von Bento, Lucila M. S., Boccardo, Davidson R., Machado, Raphael C. S., Pereira de Sá, Vinícius G., Szwarcfiter, Jayme L.

Volltext