Lilian Markenzon

32 papers C 3Journal 28Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Structural and Spectral Properties of Strictly Interval Graphs.
CoRR
Lilian Markenzon, Cláudia Marcela Justel
2024 J jnl
A new characterization of k-trees and some applications.
Comput. Appl. Math.
Lilian Markenzon, Allana S. S. de Oliveira, Cybele T. M. Vinagre
2022 J jnl
The Scattering Number of Strictly Chordal Graphs: Linear Time Determination.
Graphs Comb.
Lilian Markenzon, Christina Fraga Esteves Maciel Waga
2021 C conf
On feedback vertex set in reducible flow hypergraphs.
LAGOS
Luérbio Faria, André Luiz Pires Guedes, Lilian Markenzon
2020 J jnl
Integer Laplacian eigenvalues of strictly chordal graphs.
CoRR
Nair Abreu, Cláudia Marcela Justel, Lilian Markenzon
2020 J jnl
Non-inclusion and other subclasses of chordal graphs.
Discret. Appl. Math.
Lilian Markenzon
2019 J jnl
Block-indifference graphs: Characterization, structural and spectral properties.
Discret. Appl. Math.
Nair Maria Maia de Abreu, Cláudia Marcela Justel, Lilian Markenzon, Carla Silva Oliveira, Christina Fraga Esteves Maciel Waga
2019 J jnl
Integer Laplacian Eigenvalues of Chordal Graphs.
CoRR
Nair Maria Maia de Abreu, Cláudia Marcela Justel, Lilian Markenzon
2019 J jnl
Toughness and Hamiltonicity of strictly chordal graphs.
Int. Trans. Oper. Res.
Lilian Markenzon, Christina Fraga Esteves Maciel Waga
2018 J jnl
Vulnerability of Subclasses of Chordal Graphs.
Electron. Notes Discret. Math.
Nair Maria Maia de Abreu, Lilian Markenzon
2017 J jnl
Counting and enumerating unlabeled split-indifference graphs.
Discret. Math. Algorithms Appl.
Lilian Markenzon, Christina Fraga Esteves Maciel Waga
2016 J jnl
Strictly Interval Graphs: Characterization and Linear Time Recognition.
Electron. Notes Discret. Math.
Lilian Markenzon, Christina Fraga Esteves Maciel Waga
2015 J jnl
New results on ptolemaic graphs.
Discret. Appl. Math.
Lilian Markenzon, Christina Fraga Esteves Maciel Waga
2014 J jnl
Generating and counting unlabeled k-path graphs.
Discret. Appl. Math.
Paulo Renato da Costa Pereira, Alex Garcia, Lilian Markenzon
2013 J jnl
An efficient representation of chordal graphs.
Oper. Res. Lett.
Lilian Markenzon, Christina Fraga Esteves Maciel Waga, Paulo Renato da Costa Pereira, Clícia Valladares Peixoto Friedmann, Abel Rodolfo Garcia Lozano
2013 J jnl
Matching Preclusion Number in Cartesian Product of Graphs and its Application to Interconnection Networks.
Ars Comb.
Aline Ribeiro de Almeida, Fábio Protti, Lilian Markenzon
2011 J jnl
Flow hypergraph reducibility.
Discret. Appl. Math.
André Luiz Pires Guedes, Lilian Markenzon, Luérbio Faria
2010 J jnl
One-phase algorithm for the determination of minimal vertex separators of chordal graphs.
Int. Trans. Oper. Res.
Lilian Markenzon, Paulo Renato da Costa Pereira
2009 C conf
Recognition of Reducible Flow Hypergraphs.
CTW
André Luiz Pires Guedes, Lilian Markenzon, Luérbio Faria
2008 C conf
A Compact Representation for Chordal Graphs.
CTW
Lilian Markenzon, Paulo Renato da Costa Pereira
2008 J jnl
A clique-difference encoding scheme for labelled k-path graphs.
Discret. Appl. Math.
Paulo Renato da Costa Pereira, Lilian Markenzon, Oswaldo Vernet
2008 J jnl
Flow Hypergraph Reducibility.
Electron. Notes Discret. Math.
André Luiz Pires Guedes, Lilian Markenzon, Luérbio Faria
2008 J jnl
Two methods for the generation of chordal graphs.
Ann. Oper. Res.
Lilian Markenzon, Oswaldo Vernet, Luiz Henrique Araujo
2006 J jnl
Subclasses of
Discret. Appl. Math.
Lilian Markenzon, Cláudia Marcela Justel, N. Paciornik
2005 J jnl
The Reduced Prüfer Code for Rooted Labelled k-Trees.
Electron. Notes Discret. Math.
Paulo Renato da Costa Pereira, Lilian Markenzon, Oswaldo Vernet
2004 J jnl
Solving problems for maximal reducible flowgraphs.
Discret. Appl. Math.
Oswaldo Vernet, Lilian Markenzon
2001 J jnl
A Cryptographic Code Based on Digraphs.
Electron. Notes Discret. Math.
S. Strauss, Lilian Markenzon
2001 J jnl
Solving Problems for Maximal Reducible Flowgraphs.
Electron. Notes Discret. Math.
Oswaldo Vernet, Lilian Markenzon
1999 J jnl
Equilateral Drawing of 2-Connected Planar Chordal Graphs.
Electron. Notes Discret. Math.
Lilian Markenzon, N. Paciornik
1999 J jnl
Maxregularity and Maximal Outerplanar Graphs.
Electron. Notes Discret. Math.
R. M. N. D. Rodrigues, N. M. M. Abreu, Lilian Markenzon
1998 J jnl
On Some Path Problems on Oriented Hypergraphs.
RAIRO Theor. Informatics Appl.
S. Nguyen, Daniele Pretolani, Lilian Markenzon
1997 — conf
Hamiltonian Problems for Reducible Flowgraphs.
SCCC
Oswaldo Vernet, Lilian Markenzon