Lilian Markenzon

According to our database, Lilian Markenzon authored at least 30 papers between 1997 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

A new characterization of k-trees and some applications.

Lilian Markenzon, Allana S. S. de Oliveira, Cybele T. M. Vinagre

Comput. Appl. Math., 2024

2022

The Scattering Number of Strictly Chordal Graphs: Linear Time Determination.

Lilian Markenzon, Christina Fraga Esteves Maciel Waga

Graphs Comb., 2022

2021

On feedback vertex set in reducible flow hypergraphs.

Luérbio Faria, André Luiz Pires Guedes, Lilian Markenzon

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

Non-inclusion and other subclasses of chordal graphs.

Lilian Markenzon

Discret. Appl. Math., 2020

Integer Laplacian eigenvalues of strictly chordal graphs.

Nair Abreu, Cláudia Marcela Justel, Lilian Markenzon

CoRR, 2020

2019

Toughness and Hamiltonicity of strictly chordal graphs.

Lilian Markenzon, Christina Fraga Esteves Maciel Waga

Int. Trans. Oper. Res., 2019

Block-indifference graphs: Characterization, structural and spectral properties.

Nair Maria Maia de Abreu, Cláudia Marcela Justel, Lilian Markenzon, Carla Silva Oliveira, Christina Fraga Esteves Maciel Waga

Discret. Appl. Math., 2019

Integer Laplacian Eigenvalues of Chordal Graphs.

Nair Maria Maia de Abreu, Cláudia Marcela Justel, Lilian Markenzon

CoRR, 2019

2018

Vulnerability of Subclasses of Chordal Graphs.

Nair Maria Maia de Abreu, Lilian Markenzon

Electron. Notes Discret. Math., 2018

2017

Counting and enumerating unlabeled split-indifference graphs.

Lilian Markenzon, Christina Fraga Esteves Maciel Waga

Discret. Math. Algorithms Appl., 2017

2016

Strictly Interval Graphs: Characterization and Linear Time Recognition.

Lilian Markenzon, Christina Fraga Esteves Maciel Waga

Electron. Notes Discret. Math., 2016

2015

New results on ptolemaic graphs.

Lilian Markenzon, Christina Fraga Esteves Maciel Waga

Discret. Appl. Math., 2015

2014

Generating and counting unlabeled k-path graphs.

Paulo Renato da Costa Pereira, Alex Garcia, Lilian Markenzon

Discret. Appl. Math., 2014

2013

An efficient representation of chordal graphs.

Lilian Markenzon, Christina Fraga Esteves Maciel Waga, Paulo Renato da Costa Pereira, Clícia Valladares Peixoto Friedmann, Abel Rodolfo Garcia Lozano

Oper. Res. Lett., 2013

<i>k</i>-separator chordal graphs: leafage and subfamilies.

Lilian Markenzon, Paulo Renato da Costa Pereira, Christina Fraga Esteves Maciel Waga

Int. Trans. Oper. Res., 2013

Matching Preclusion Number in Cartesian Product of Graphs and its Application to Interconnection Networks.

Aline Ribeiro de Almeida, Fábio Protti, Lilian Markenzon

Ars Comb., 2013

2011

Flow hypergraph reducibility.

André Luiz Pires Guedes, Lilian Markenzon, Luérbio Faria

Discret. Appl. Math., 2011

2010

One-phase algorithm for the determination of minimal vertex separators of chordal graphs.

Lilian Markenzon, Paulo Renato da Costa Pereira

Int. Trans. Oper. Res., 2010

2009

Recognition of Reducible Flow Hypergraphs.

André Luiz Pires Guedes, Lilian Markenzon, Luérbio Faria

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

A clique-difference encoding scheme for labelled k-path graphs.

Paulo Renato da Costa Pereira, Lilian Markenzon, Oswaldo Vernet

Discret. Appl. Math., 2008

Two methods for the generation of chordal graphs.

Lilian Markenzon, Oswaldo Vernet, Luiz Henrique Araujo

Ann. Oper. Res., 2008

A Compact Representation for Chordal Graphs.

Lilian Markenzon, Paulo Renato da Costa Pereira

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2006

Subclasses of <i>k</i>-trees: Characterization and recognition.

Lilian Markenzon, Cláudia Marcela Justel, N. Paciornik

Discret. Appl. Math., 2006

2005

The Reduced Prüfer Code for Rooted Labelled k-Trees.

Paulo Renato da Costa Pereira, Lilian Markenzon, Oswaldo Vernet

Electron. Notes Discret. Math., 2005

2004

Solving problems for maximal reducible flowgraphs.

Oswaldo Vernet, Lilian Markenzon

Discret. Appl. Math., 2004

2001

A Cryptographic Code Based on Digraphs.

S. Strauss, Lilian Markenzon

Electron. Notes Discret. Math., 2001

1999

Maxregularity and Maximal Outerplanar Graphs.

R. M. N. D. Rodrigues, N. M. M. Abreu, Lilian Markenzon

Electron. Notes Discret. Math., 1999

Equilateral Drawing of 2-Connected Planar Chordal Graphs.

Lilian Markenzon, N. Paciornik

Electron. Notes Discret. Math., 1999

1998

On Some Path Problems on Oriented Hypergraphs.

S. Nguyen, Daniele Pretolani, Lilian Markenzon

RAIRO Theor. Informatics Appl., 1998

1997

Hamiltonian Problems for Reducible Flowgraphs.

Oswaldo Vernet, Lilian Markenzon

Proceedings of 17th International Conference of the Chilean Computer Science Society (SCCC '97), 1997