JournalTOCs

Cadernos do IME : Série Informática
Number of Followers: 0

This is an Open Access Journal

Open Access journal
ISSN (Print) 1413-9014 - ISSN (Online) 2317-2193
Published by Universidade do Estado do Rio de Janeiro

[43 journals]

Apresentação
- Authors: Fabiano de Souza Oliveira
  Pages: 1 - 7
  PubDate: 2022-10-18
  DOI: 10.12957/cadinf.2022.70605
  Issue No: Vol. 47 (2022)
Solving Jayme’s favorite problem through a triangle catwalk
- Authors: Liliana Alcon, Luerbio Faria, Celina Figueiredo, Marisa Gutierrez
  Pages: 8 - 10
  Abstract: This is an account of our pursuit to solve the recognition of clique graphs, a problem open for 40 years, and one of Jayme's favorite problems.
  PubDate: 2022-10-18
  DOI: 10.12957/cadinf.2022.70577
  Issue No: Vol. 47 (2022)
Geodesic Convexity of graphs: partition and geodetic sets
- Authors: Danilo Artigas, Simone Dantas, Mitre Dourado
  Pages: 11 - 13
  Abstract: This work describes the contribution of Artigas, Dantas, Dourado, and Szwarcfiter on the topic of convexity in the context of geodesic convex partitions, covers and geodetic sets from 2008 to 2013.
  PubDate: 2022-10-18
  DOI: 10.12957/cadinf.2022.70578
  Issue No: Vol. 47 (2022)
Software watermarking: contributions that transcend the theme
- Authors: Lucila Bento, Davidson Boccardo, Raphael Machado, Felipe Simoes, Vinícius Pereira de Sá
  Pages: 14 - 18
  Abstract: Software watermarking is the embedding of data in the graphs that represent the execution of a computer program. Such structures are important technology tools, but also bring interesting combinatorial problems. In the present paper, we describe the advances in software watermarking during the last two decades, highlighting the important contributions of Prof. Jayme Szwarcfiter
  PubDate: 2022-10-18
  DOI: 10.12957/cadinf.2022.70579
  Issue No: Vol. 47 (2022)
What can weighted clique graphs tell us about graph classes'
- Authors: Flavia Bonomo-Braberman
  Pages: 19 - 21
  Abstract: In this paper, I will briefly survey the joint work with Jayme on weighted clique graphs, and how they are a tool to characterize graph classes.
  PubDate: 2022-10-18
  DOI: 10.12957/cadinf.2022.70580
  Issue No: Vol. 47 (2022)
Jayme’s scientific contributions in the area of Convexity in Graphs
- Authors: Erika Coelho, Mitre Dourado, Julliano Nascimento, Vinicius dos Santos
  Pages: 22 - 29
  Abstract: We survey some of the contributions of Professor Jayme Luiz Szwarcfiter in the area of graph convexity, in celebration of his 80th birthday.
  PubDate: 2022-10-18
  DOI: 10.12957/cadinf.2022.70581
  Issue No: Vol. 47 (2022)
Generating bicliques of a graph
- Authors: Celina Figueiredo, Vânia Dias
  Pages: 30 - 32
  Abstract: This is an account of the collaboration and research with Jayme Luiz Szwarcfiter and Celina Miraglia Herrera de Figueiredo during the development of the thesis of Vânia Maria Felix Dias at COPPE, "Geração de Bicliques em Grafos", finished in 2004, and its two subsequent journal papers.
  PubDate: 2022-10-18
  DOI: 10.12957/cadinf.2022.70582
  Issue No: Vol. 47 (2022)
Indifference orders and split-indifference graphs: thirty years of
productive collaborative work
- Authors: Celina Figueiredo, Sulamita Klein, Mónica Villanueva
  Pages: 33 - 34
  Abstract: This is an account of our years as students of Jayme Luiz Szwarcfiter, during the years 1990. Two articles perfectly represent our experience as students, young researchers, and young authors.
  PubDate: 2022-10-18
  DOI: 10.12957/cadinf.2022.70583
  Issue No: Vol. 47 (2022)
Generating interval and semi-order extensions of partially ordered sets
- Authors: Celina Figueiredo, Aquiles Queiroz
  Pages: 35 - 39
  Abstract: This is an account of the collaboration and the research conduction by Prof. Jayme Luiz Szwarcfiter, during the development of the thesis of Aquiles Braga de Queiroz at COPPE/UFRJ, "Algoritmos para a Geração de Classes de Extensões de Conjuntos Parcialmente Ordenados", completed in 2005.
  PubDate: 2022-10-18
  DOI: 10.12957/cadinf.2022.70584
  Issue No: Vol. 47 (2022)
Why are they called Trivially Perfect Graphs'
- Authors: Martin Charles Golumbic
  Pages: 40 - 45
  Abstract: Trivially perfect graphs are graphs for which the stability number equals the number of (maximal) cliques, for every induced subgraph. Trivially perfect graphs are equivalent to the {C_4, P_4}-free graphs, and to the comparability graphs orders whose Hasse diagram is a rooted tree. We survey classical and recent results on this fascinating and highly non-trivial graph family.
  PubDate: 2022-10-18
  DOI: 10.12957/cadinf.2022.70585
  Issue No: Vol. 47 (2022)
When Biclique graphs were born
- Authors: Marina Groshaus
  Pages: 46 - 49
  Abstract: This paper is a survey of my work about biclique graph and biclique properties developed during my PhD with Jayme Szwarcfiter and some related results.
  PubDate: 2022-10-18
  DOI: 10.12957/cadinf.2022.70586
  Issue No: Vol. 47 (2022)
Chordal graphs through clique trees
- Authors: Marisa Gutierrez, Silvia Tondato
  Pages: 50 - 52
  Abstract: Here we present a part of the work in collaboration with Jayme Luiz Szwarcfiter and Marisa Gutierrez, during the development of the thesis of Silvia Tondato at Facultad de Ciencias Exactas (UNLP), "Grafos Cordales: árboles cliques y representaciones canónicas'', finished in 2009.
  PubDate: 2022-10-18
  DOI: 10.12957/cadinf.2022.70587
  Issue No: Vol. 47 (2022)
Interval Count of Interval Graphs
- Authors: Fabiano de Souza Oliveira
  Pages: 53 - 56
  Abstract: The interval count problem is that of determining the smallest number of distinct interval lengths that is sufficient to represent an interval model of a given interval graph. The class of interval graphs is well known, with several applications. This article briefly summarizes my doctorate thesis done on the subject with supervision of Prof. Jayme Szwarcfiter, in his honor, on the occasion of his 80th birthday.
  PubDate: 2022-10-18
  DOI: 10.12957/cadinf.2022.70588
  Issue No: Vol. 47 (2022)
Arboreal Extension of an Order
- Authors: Adriana Pimenta, Sulamita Klein
  Pages: 57 - 60
  Abstract: This article describes the contribution of Adriana Pimenta, Jayme Szwarcfiter, Michel Habib and Sulamita Klein on arboreal extensions of partial orders, started in 2008. The quantity to be determined is about the minimum number of arboreal jumps of a partial order.
  PubDate: 2022-10-18
  DOI: 10.12957/cadinf.2022.70589
  Issue No: Vol. 47 (2022)
Codes for Compression and Error Detection
- Authors: Paulo Pinto
  Pages: 61 - 64
  Abstract: This article summarizes the main results about codes that combine the data compression power of Huffman trees with the error detection mechanisms proposed by Hamming. Two methods are described: the even trees method and the Hamming-Huffman trees method. Most of the works are the result of a close collaboration with Jayme Luiz Szwarcfiter.
  PubDate: 2022-10-18
  DOI: 10.12957/cadinf.2022.70590
  Issue No: Vol. 47 (2022)