Lilian Markenzon

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 11

Top Topics

Graph Laplacian

Graph Theoretic

Top Venues

Discret. Appl. Math.

Electron. Notes Discret. Math.

Comput. Appl. Math.

Publications

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