Luérbio Faria

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Lilian Markenzon

> Home > Persons > Luérbio Faria

Publications

2021
[c21]
- view
  authority control:
- export record
  dblp key:
  - conf/lagos/FariaGM21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lagos/FariaGM21
Luérbio Faria, André Luiz Pires Guedes, Lilian Markenzon:
On feedback vertex set in reducible flow hypergraphs. LAGOS 2021: 212-220
2011
[j26]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/GuedesMF11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/GuedesMF11
André Luiz Pires Guedes, Lilian Markenzon, Luérbio Faria:
Flow hypergraph reducibility. Discret. Appl. Math. 159(16): 1775-1785 (2011)
2009
[c10]
- view
  - electronic edition @ polytechnique.fr
  - no references & citations available
- export record
  dblp key:
  - conf/colognetwente/GuedesMF09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/colognetwente/GuedesMF09
André Luiz Pires Guedes, Lilian Markenzon, Luérbio Faria:
Recognition of Reducible Flow Hypergraphs. CTW 2009: 229-232
2008
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/endm/GuedesMF08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/GuedesMF08
André Luiz Pires Guedes, Lilian Markenzon, Luérbio Faria:
Flow Hypergraph Reducibility. Electron. Notes Discret. Math. 30: 255-260 (2008)

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.