#### Filter Results:

- Full text PDF available (18)

#### Publication Year

2001

2018

- This year (3)
- Last 5 years (19)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
- Theor. Comput. Sci.
- 2012

In this paper we present a modification of a technique by Chiba and Nishizeki [Chiba and Nishizeki: Arboricity and Subgraph Listing Algorithms, SIAM J. Comput. 14(1), pp. 210â€“223 (1985)]. Based onâ€¦ (More)

- Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
- Discrete Applied Mathematics
- 2013

A Helly circular-arc modelM = (C,A) is a circle C together with a Helly family A of arcs of C. If no arc is contained in any other, thenM is a proper Helly circular-arc model, if every arc has theâ€¦ (More)

- Min Chih Lin, Jayme Luiz Szwarcfiter
- SIAM J. Discrete Math.
- 2008

In a recent paper, DurÃ¡n, Gravano, McConnell, Spinrad and Tucker described an algorithm of complexity O(n2) for recognizing whether a graph G with n vertices and m edges is a unit circular-arc (UCA)â€¦ (More)

- John Adrian Bondy, Guillermo DurÃ¡n, Min Chih Lin, Jayme Luiz Szwarcfiter
- Journal of Graph Theory
- 2003

The clique graph of a graph is the intersection graph of its (maximal) cliques. A graph is self-clique when it is isomorphic with its clique graph, and is clique-Helly when its cliques satisfy theâ€¦ (More)

- Min Chih Lin, Jayme Luiz Szwarcfiter
- Inf. Process. Lett.
- 2007

A family of subsets of a set is Helly when every subfamily of it, which is formed by pairwise intersecting subsets contains a common element. A graph G is clique-Helly when the family of itsâ€¦ (More)

- Flavia Bonomo, Guillermo DurÃ¡n, Min Chih Lin, Jayme Luiz Szwarcfiter
- Math. Program.
- 2006

Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this concept applied to graphs, and call a graph to be balanced when its clique matrix is balanced.â€¦ (More)

- Benson L. Joeris, Min Chih Lin, Ross M. McConnell, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
- Algorithmica
- 2009

A circular-arc model â„³ is a circle C together with a collection $\mathcal{A}$ of arcs of C. If $\mathcal{A}$ satisfies the Helly Property then â„³ is a Helly circular-arc model. A (Helly) circular-arcâ€¦ (More)

- Min Chih Lin, Jayme Luiz Szwarcfiter
- SODA
- 2006

In a recent paper, DurÃ¡n, Gravano, McConnell, Spinrad and Tucker described an algorithm of complexity O(n2) for recognizing whether a graph G with n vertices is a unit circular-arc (UCA) graph.â€¦ (More)

- Min Chih Lin, Dieter Rautenbach, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
- Discrete Applied Mathematics
- 2011

In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations for both powers ofâ€¦ (More)

- Guillermo DurÃ¡n, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter
- Electronic Notes in Discrete Mathematics
- 2004

A circular-arc graph is the intersection graph of arcs of a circle. A Helly circular-arc graph is a circular-arc graph admitting a model whose arcs satisfy the Helly property. A clique-independentâ€¦ (More)