| 2008 |
|---|
| 12 | | Lilian Markenzon,
Paulo Renato da Costa Pereira:
A Compact Representation for Chordal Graphs.
CTW 2008: 174-176 |
| 11 | EE | Lilian Markenzon,
Oswaldo Vernet,
Luiz Henrique Araujo:
Two methods for the generation of chordal graphs.
Annals OR 157(1): 47-60 (2008) |
| 10 | EE | Paulo Renato da Costa Pereira,
Lilian Markenzon,
Oswaldo Vernet:
A clique-difference encoding scheme for labelled k-path graphs.
Discrete Applied Mathematics 156(17): 3216-3222 (2008) |
| 9 | EE | André Luiz Pires Guedes,
Lilian Markenzon,
L. Faria:
Flow Hypergraph Reducibility.
Electronic Notes in Discrete Mathematics 30: 255-260 (2008) |
| 2006 |
|---|
| 8 | EE | Lilian Markenzon,
C. M. Justel,
N. Paciornik:
Subclasses of k-trees: Characterization and recognition.
Discrete Applied Mathematics 154(5): 818-825 (2006) |
| 2005 |
|---|
| 7 | EE | Paulo Renato da Costa Pereira,
Lilian Markenzon,
Oswaldo Vernet:
The Reduced Prüfer Code for Rooted Labelled k-Trees.
Electronic Notes in Discrete Mathematics 22: 135-139 (2005) |
| 2004 |
|---|
| 6 | EE | Oswaldo Vernet,
Lilian Markenzon:
Solving problems for maximal reducible flowgraphs.
Discrete Applied Mathematics 136(2-3): 341-348 (2004) |
| 2001 |
|---|
| 5 | EE | S. Strauss,
Lilian Markenzon:
A Cryptographic Code Based on Digraphs.
Electronic Notes in Discrete Mathematics 10: 268-271 (2001) |
| 4 | EE | Oswaldo Vernet,
Lilian Markenzon:
Solving Problems for Maximal Reducible Flowgraphs.
Electronic Notes in Discrete Mathematics 8: 111-114 (2001) |
| 1999 |
|---|
| 3 | EE | Lilian Markenzon,
N. Paciornik:
Equilateral Drawing of 2-Connected Planar Chordal Graphs.
Electronic Notes in Discrete Mathematics 3: 128-132 (1999) |
| 2 | EE | R. M. N. D. Rodrigues,
N. M. M. Abreu,
Lilian Markenzon:
Maxregularity and Maximal Outerplanar Graphs.
Electronic Notes in Discrete Mathematics 3: 171-175 (1999) |
| 1997 |
|---|
| 1 | EE | Oswaldo Vernet,
Lilian Markenzon:
Hamiltonian Problems for Reducible Flowgraphs.
SCCC 1997: 264-267 |
