Jayme Luiz Szwarcfiter
机构: Universidade Federal do Rio de Janeiro
每年引用次数
引用次数
引用: 5,337
H-指数: 33
I10-指数 : 115
出版物: 373
Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs,
Marina Groshaus , Jayme Luis Szwarcfiter
Rairo-operations Research 45 ( 3) 209 -222
2011
A parallel algorithm for transitive closure
Jayme Luiz Szwarcfiter , Siang Wun Song , Edson Norberto Cáceres
IASTED PDCS 114 -116
4
2002
A Characterization of Edge Clique Graphs.
Márcia R. Cerioli , Jayme Luiz Szwarcfiter
Ars Combinatoria 60
10
2001
On clique-perfect and k-perfect graphs
Marina Groshaus , Jayme Luiz Szwarcfiter , Guillermo Durán , Flavia Bonomo
Ars Combinatoria 80
32
2006
Recognizing Clique-Helly Graphs.
Jayme Luiz Szwarcfiter
Ars Combinatoria 45
44
1997
Convex Partitions of Graphs induced by Paths of Order Three
Dieter Rautenbach , Jayme Luiz Szwarcfiter , Mitre Costa Dourado , Carmen C. Centeno
Discrete Mathematics & Theoretical Computer Science 12 ( 5) 175 -184
17
2010
On Hereditary Helly Classes of Graphs
Marina Groshaus , Jayme Luiz Szwarcfiter
Discrete Mathematics & Theoretical Computer Science 10 ( 1)
11
2008
Isomorphism of graph classes related to the circular-ones property
Yahav Nussbaum , Francisco Juan Soulignac , Jayme Luiz Szwarcfiter , Min Chih Lin
Discrete Mathematics & Theoretical Computer Science 15 ( 1) 157 -182
24
2013
On probe co-bipartite and probe diamond-free graphs
Luciano Norberto Grippo , Jayme Luiz Szwarcfiter , Martín Darío Safe , Guillermo Alfredo Durán
Discrete Mathematics & Theoretical Computer Science 17 ( 1) 187 -200
2015
Extreme Cliques in Interval Graphs.
Márcia R. Cerioli , Jayme Luiz Szwarcfiter , Fabiano de S. Oliveira
Ars Combinatoria 94
2
2010
On Helly Hypergraphs with Variable Intersection Sizes.
Fábio Protti , Jayme Luiz Szwarcfiter , Mitre Costa Dourado
Ars Combinatoria 114 185 -191
2
2014
Characterization and recognition of generalized Clique-Helly graphs
Fabio Protti , Jayme Luiz Szwarcfiter , Mitre Costa Dourado
Lecture Notes in Computer Science 344 -354
2004
On a min-max conjecture for reducible digraphs
Jayme Luiz Szwarcfiter
Brasil
1986
On minimum cuts of cycles by vertices and vertex disjoint cycles
Jayme Luiz Szwarcfiter
Relatório Técnico NCE ( 0287)
1987
Uma sistematização do processamento de dados: aplicação em automatização de bibliotecas
Jayme Luiz Szwarcfiter
Universidade Federal do Rio de Janeiro
1971
FPT and Kernelization Algorithms for the Induced Tree Problem
Jayme Luiz Szwarcfiter , Jayme Luiz Szwarcfiter , Vinícius Fernandes dos Santos , Guilherme de Castro Mendes Gomes
international conference on algorithms and complexity 158 -172
2021
SOME ILLUSTRATIVE EXAMPLES ON THE USE OF HASH TABLES
Lucila Maria de Souza Bento , Vinícius Gusmão Pereira de Sá , Jayme Luiz Szwarcfiter
Pesquisa Operacional 35 ( 2) 423 -437
1
2015
On the geodetic Radon number of grids
Mitre Costa Dourado , Dieter Rautenbach , Vinícius Gusmão Pereira de Sá , Jayme Luiz Szwarcfiter
Discrete Mathematics 313 ( 1) 111 -121
5
2013
Connectivity and diameter in distance graphs
Lucia Draque Penso , Dieter Rautenbach , Jayme Luiz Szwarcfiter
Networks 57 ( 4) 310 -315
9
2011
Cycles, Paths, Connectivity and Diameter in Distance Graphs
Lucia Draque Penso , Dieter Rautenbach , Jayme Luiz Szwarcfiter
workshop on graph-theoretic concepts in computer science 320 -328
4
2009