default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLilian Markenzon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]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): 231 (2024)- 2022
- [j25]Lilian Markenzon, Christina Fraga Esteves Maciel Waga:
The Scattering Number of Strictly Chordal Graphs: Linear Time Determination. Graphs Comb. 38(3): 102 (2022) - 2021
- [c4]Luérbio Faria, André Luiz Pires Guedes, Lilian Markenzon:
On feedback vertex set in reducible flow hypergraphs. LAGOS 2021: 212-220 - 2020
- [j24]Lilian Markenzon:
Non-inclusion and other subclasses of chordal graphs. Discret. Appl. Math. 272: 43-47 (2020) - [i2]Nair Abreu, Cláudia Marcela Justel, Lilian Markenzon:
Integer Laplacian eigenvalues of strictly chordal graphs. CoRR abs/2007.06681 (2020)
2010 – 2019
- 2019
- [j23]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: 60-67 (2019) - [j22]Lilian Markenzon, Christina Fraga Esteves Maciel Waga:
Toughness and Hamiltonicity of strictly chordal graphs. Int. Trans. Oper. Res. 26(2): 725-731 (2019) - [i1]Nair Maria Maia de Abreu, Cláudia Marcela Justel, Lilian Markenzon:
Integer Laplacian Eigenvalues of Chordal Graphs. CoRR abs/1907.04979 (2019) - 2018
- [j21]Nair Maria Maia de Abreu, Lilian Markenzon:
Vulnerability of Subclasses of Chordal Graphs. Electron. Notes Discret. Math. 64: 55-63 (2018) - 2017
- [j20]Lilian Markenzon, Christina Fraga Esteves Maciel Waga:
Counting and enumerating unlabeled split-indifference graphs. Discret. Math. Algorithms Appl. 9(4): 1750055:1-1750055:8 (2017) - 2016
- [j19]Lilian Markenzon, Christina Fraga Esteves Maciel Waga:
Strictly Interval Graphs: Characterization and Linear Time Recognition. Electron. Notes Discret. Math. 52: 181-188 (2016) - 2015
- [j18]Lilian Markenzon, Christina Fraga Esteves Maciel Waga:
New results on ptolemaic graphs. Discret. Appl. Math. 196: 135-140 (2015) - 2014
- [j17]Paulo Renato da Costa Pereira, Alex Garcia, Lilian Markenzon:
Generating and counting unlabeled k-path graphs. Discret. Appl. Math. 164: 297-303 (2014) - 2013
- [j16]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: 193-204 (2013) - [j15]Lilian Markenzon, Paulo Renato da Costa Pereira, Christina Fraga Esteves Maciel Waga:
k-separator chordal graphs: leafage and subfamilies. Int. Trans. Oper. Res. 20(5): 681-688 (2013) - [j14]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): 331-335 (2013) - 2011
- [j13]André Luiz Pires Guedes, Lilian Markenzon, Luérbio Faria:
Flow hypergraph reducibility. Discret. Appl. Math. 159(16): 1775-1785 (2011) - 2010
- [j12]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): 683-690 (2010)
2000 – 2009
- 2009
- [c3]André Luiz Pires Guedes, Lilian Markenzon, Luérbio Faria:
Recognition of Reducible Flow Hypergraphs. CTW 2009: 229-232 - 2008
- [j11]Lilian Markenzon, Oswaldo Vernet, Luiz Henrique Araujo:
Two methods for the generation of chordal graphs. Ann. Oper. Res. 157(1): 47-60 (2008) - [j10]Paulo Renato da Costa Pereira, Lilian Markenzon, Oswaldo Vernet:
A clique-difference encoding scheme for labelled k-path graphs. Discret. Appl. Math. 156(17): 3216-3222 (2008) - [j9]André Luiz Pires Guedes, Lilian Markenzon, Luérbio Faria:
Flow Hypergraph Reducibility. Electron. Notes Discret. Math. 30: 255-260 (2008) - [c2]Lilian Markenzon, Paulo Renato da Costa Pereira:
A Compact Representation for Chordal Graphs. CTW 2008: 174-176 - 2006
- [j8]Lilian Markenzon, Cláudia Marcela Justel, N. Paciornik:
Subclasses of k-trees: Characterization and recognition. Discret. Appl. Math. 154(5): 818-825 (2006) - 2005
- [j7]Paulo Renato da Costa Pereira, Lilian Markenzon, Oswaldo Vernet:
The Reduced Prüfer Code for Rooted Labelled k-Trees. Electron. Notes Discret. Math. 22: 135-139 (2005) - 2004
- [j6]Oswaldo Vernet, Lilian Markenzon:
Solving problems for maximal reducible flowgraphs. Discret. Appl. Math. 136(2-3): 341-348 (2004) - 2001
- [j5]Oswaldo Vernet, Lilian Markenzon:
Solving Problems for Maximal Reducible Flowgraphs. Electron. Notes Discret. Math. 8: 111-114 (2001) - [j4]S. Strauss, Lilian Markenzon:
A Cryptographic Code Based on Digraphs. Electron. Notes Discret. Math. 10: 268-271 (2001)
1990 – 1999
- 1999
- [j3]Lilian Markenzon, N. Paciornik:
Equilateral Drawing of 2-Connected Planar Chordal Graphs. Electron. Notes Discret. Math. 3: 128-132 (1999) - [j2]R. M. N. D. Rodrigues, N. M. M. Abreu, Lilian Markenzon:
Maxregularity and Maximal Outerplanar Graphs. Electron. Notes Discret. Math. 3: 171-175 (1999) - 1998
- [j1]S. Nguyen, Daniele Pretolani, Lilian Markenzon:
On Some Path Problems on Oriented Hypergraphs. RAIRO Theor. Informatics Appl. 32(1-3): 1-20 (1998) - 1997
- [c1]Oswaldo Vernet, Lilian Markenzon:
Hamiltonian Problems for Reducible Flowgraphs. SCCC 1997: 264-267
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
