Luérbio Faria

ORCID: 0000-0003-0000-6990
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Graph Theory Research
  • Complexity and Algorithms in Graphs
  • Graph Labeling and Dimension Problems
  • Limits and Structures in Graph Theory
  • graph theory and CDMA systems
  • Computational Geometry and Mesh Generation
  • Graph theory and applications
  • Optimization and Search Problems
  • Interconnection Networks and Systems
  • Digital Image Processing Techniques
  • Algorithms and Data Compression
  • VLSI and FPGA Design Techniques
  • Logic, programming, and type systems
  • Scheduling and Optimization Algorithms
  • Genome Rearrangement Algorithms
  • Constraint Satisfaction and Optimization
  • Computer Graphics and Visualization Techniques
  • Power Line Communications and Noise
  • Sociology and Education in Brazil
  • Medical Coding and Health Information
  • Numerical Methods and Algorithms
  • Advancements in Solid Oxide Fuel Cells
  • Data Management and Algorithms
  • Mathematical Approximation and Integration
  • Optimization and Variational Analysis

Universidad Complutense de Madrid
2025

Universidade do Estado do Rio de Janeiro
2014-2023

John Wiley & Sons (United States)
2016

Hudson Institute
2016

Universidade Federal do Rio de Janeiro
2001-2013

A parametric experimental study was carried out to the influence of temperature (25-40°C), concentration (0.15-6 wt. % methanol in water) and rate flow (1.12-8.65 g/s) on performance a single mini-direct fuel cell (DMFC) operating semi passive mode with cathode active anode. Open circuit voltage, maximum power density efficiency were analyzed. To this purpose, open voltage current-voltage curves measured different conditions. Results indicate that is most decisive parameter increase DMFC...

10.20944/preprints202501.0827.v1 preprint EN 2025-01-11

10.5540/03.2025.011.01.0488 article DE Proceeding Series of the Brazilian Society of Computational and Applied Mathematics 2025-01-20

10.5540/03.2025.011.01.0490 article EN Proceeding Series of the Brazilian Society of Computational and Applied Mathematics 2025-01-20

Este artigo examina a disparidade entre formação pedagógica de professores universitários e eficácia na comunicação suas pesquisas. Utilizando uma metodologia qualitativa, pesquisa inclui revisão literatura abrangente sobre evolução da no ensino superior, além analisar materiais didáticos práticas pedagógicas em diferentes instituições. A estrutura do estudo é dividida capítulos que abordam, inicialmente, história os conceitos fundamentais pedagogia universitária. Segue com análise crítica...

10.26668/indexlawjournals/2525-9636/2024.v10i2.11042 article PT cc-by-nc Revista de Pesquisa e Educação Jurídica 2025-02-25

Direct methanol fuel cells (DMFCs) typically operate in passive mode, where is distributed across the membrane electrode assembly through natural diffusion. Usual concentrations range from 1% to 5% by weight (wt.%), although this can vary depending on specific configuration and application. In work, effect of an additional pumping system supply has been analyzed varying flow rate within pump’s range. To end, a parametric experimental study was carried out influence temperature (25–40 °C),...

10.3390/fuels6020021 article EN cc-by Fuels 2025-03-24

10.1016/j.tcs.2009.01.018 article EN publisher-specific-oa Theoretical Computer Science 2009-01-31

10.1016/j.dam.2004.02.008 article EN publisher-specific-oa Discrete Applied Mathematics 2004-04-02

A unit disk graph is the intersection of a family disks in plane. If do not overlap, it also coin or penny graph. It known that finding maximum independent set NP-hard problem. In this work we extend result to graphs. Furthermore, prove minimum clique partition NP-hard, and present two linear-time approximation algorithms for computation partitions: 3-approximation algorithm graphs 2-approximation

10.1051/ita/2011106 article EN RAIRO - Theoretical Informatics and Applications 2011-07-01

A fullerene graph is a cubic bridgeless plane with all faces of size $5$ and $6$. We show that every on $n$ vertices can be made bipartite by deleting at most $\sqrt{12n/5}$ edges has an independent set least $n/2-\sqrt{3n/5}$ vertices. Both bounds are sharp, we characterize the extremal graphs. This proves conjectures Došlić Vukičević Daugherty. deduce two further independence number graphs, as well new upper bound smallest eigenvalue graph.

10.1137/120870463 article EN SIAM Journal on Discrete Mathematics 2012-01-01

10.1016/s0166-218x(00)00220-1 article EN Discrete Applied Mathematics 2001-02-01
Coming Soon ...