Jayme Luiz Szwarcfiter

Jayme Luiz Szwarcfiter

Universidade Federal do Rio de Janeiro

H-index: 34

Latin America-Brazil

About Jayme Luiz Szwarcfiter

Jayme Luiz Szwarcfiter, With an exceptional h-index of 34 and a recent h-index of 17 (since 2020), a distinguished researcher at Universidade Federal do Rio de Janeiro, specializes in the field of computer science, discrete mathematics.

His recent articles reflect a diverse array of research interests and contributions to the field:

Linear‐time algorithms for eliminating claws in graphs

Thinness and its variations on some graph families and coloring graphs of bounded thinness

HELLY AND STRONG HELLY NUMBERS OF Bk-EPG AND Bk-VPG GRAPHS.

Disconnected matchings

A CONTAGEM DE INTERVALO DE UMA CLASSE DE GRAFOS SPLIT

Mixed integer programming and quadratic programming formulations for the interval count problem

Emparelhamento conexo ponderado é np-completo

On subclasses of interval count two and on Fishburn’s conjecture

Jayme Luiz Szwarcfiter Information

University

Position

___

Citations(all)

5234

Citations(since 2020)

1516

Cited By

4330

hIndex(all)

34

hIndex(since 2020)

17

i10Index(all)

115

i10Index(since 2020)

44

Email

University Profile Page

Universidade Federal do Rio de Janeiro

Google Scholar

View Google Scholar Profile

Jayme Luiz Szwarcfiter Skills & Research Interests

computer science

discrete mathematics

Top articles of Jayme Luiz Szwarcfiter

Title

Journal

Author(s)

Publication Date

Linear‐time algorithms for eliminating claws in graphs

International Transactions in Operational Research

Flavia Bonomo‐Braberman

Julliano R Nascimento

Fabiano S Oliveira

Uéverton S Souza

Jayme L Szwarcfiter

2024/1

Thinness and its variations on some graph families and coloring graphs of bounded thinness

arXiv preprint arXiv:2303.06070

Flavia Bonomo-Braberman

Eric Brandwein

Fabiano S Oliveira

Moysés S Sampaio Jr

Agustin Sansone

...

2023/3/10

HELLY AND STRONG HELLY NUMBERS OF Bk-EPG AND Bk-VPG GRAPHS.

Discussiones Mathematicae: Graph Theory

Claudson F Bornstein

Gila Morgenstern

Tanilson D Santos

Uéverton S Souza

Jayme L Szwarcfiter

2023/10/1

Disconnected matchings

Theoretical Computer Science

Guilherme CM Gomes

Bruno P Masquio

Paulo ED Pinto

Vinicius F dos Santos

Jayme L Szwarcfiter

2023/5/4

A CONTAGEM DE INTERVALO DE UMA CLASSE DE GRAFOS SPLIT

Lívia Medeiros

Fabiano Oliveira

Jayme Luiz Szwarcfiter

2023

Mixed integer programming and quadratic programming formulations for the interval count problem

Procedia Computer Science

Lívia Medeiros

Fabiano Oliveira

Abilio Lucena

Jayme Szwarcfiter

2023/1/1

Emparelhamento conexo ponderado é np-completo

Guilherme de CM Gomes

Bruno P Masquio

Paulo ED Pinto

Vinicius F Santos

Jayme L Szwarcfiter

2022/7/31

On subclasses of interval count two and on Fishburn’s conjecture

Discrete Applied Mathematics

Mathew C Francis

Lívia S Medeiros

Fabiano S Oliveira

Jayme L Szwarcfiter

2022/12/31

WITHDRAWN: On the unit interval number of certain graphs

G Durán

F Fernández Slezak

LN Grippo

FS Oliveira

JL Szwarcfiter

2022/4/22

Relação entre classes de grafos com contagem de intervalo k

Lívia S Medeiros

Fabiano S Oliveira

Jayme L Szwarcfiter

2022/7/31

Precedence thinness in graphs

Flavia Bonomo

Fabiano de Souza Oliveira

Moysés S Sampaio Jr

Jayme L Szwarcfiter

2022

Edge Intersection Graphs of Paths on a Triangular Grid

arXiv preprint arXiv:2203.04250

Vitor TF de Luca

María Pía Mazzoleni

Fabiano S Oliveira

Tanilson D Santos

Jayme L Szwarcfiter

2022/3/8

Empirical Evaluation of Project Scheduling Algorithms for Maximization of the Net Present Value

arXiv preprint arXiv:2207.03330

Isac M Lacerda

Eber A Schmitz

Jayme L Szwarcfiter

Rosiane de Freitas

2022/7/5

Connected and Disconnected Matchings

Bruno Porto Masquio

2022/11/18

Grid straight-line embeddings of trees with a minimum number of bends per path

Information Processing Letters

VTF Luca

Nestaly Marín

Fabiano de S Oliveira

Adriana Ramírez-Vigueras

O Solé-Pi

...

2022/3/1

Thinness of product graphs

Discrete Applied Mathematics

Flavia Bonomo-Braberman

Carolina L Gonzalez

Fabiano S Oliveira

Moysés S Sampaio Jr

Jayme L Szwarcfiter

2022/5/15

Weighted connected matchings

Guilherme CM Gomes

Bruno P Masquio

Paulo ED Pinto

Vinicius F dos Santos

Jayme L Szwarcfiter

2022/10/29

A polynomial time algorithm for geodetic hull number for complementary prisms

RAIRO-Theoretical Informatics and Applications

Erika MM Coelho

Hebert Coelho

Julliano R Nascimento

Jayme L Szwarcfiter

2022

Restricted Hamming–Huffman trees

RAIRO-Operations Research

Min C Lin

Fabiano S Oliveira

Paulo ED Pinto

Moysés S Sampaio

Jayme L Szwarcfiter

2022/5/1

On the computational complexity of the bipartizing matching problem

Annals of Operations Research

Carlos VGC Lima

Dieter Rautenbach

Uéverton S Souza

Jayme L Szwarcfiter

2022/9

See List of Professors in Jayme Luiz Szwarcfiter University(Universidade Federal do Rio de Janeiro)