#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2007

2018

- This year (1)
- Last 5 years (13)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn 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)

- Francisco J. Soulignac
- Algorithmica
- 2013

We present a fully dynamic algorithm for the recognition of proper circular-arc (PCA) graphs. The allowed operations on the graph involve the insertion and removal of vertices (together with itsâ€¦ (More)

- Marina Groshaus, Francisco J. Soulignac, Pablo Terlisky
- J. Graph Algorithms Appl.
- 2014

A biclique of a graph G is an induced complete bipartite graph. A star of G is a biclique contained in the closed neighborhood of a vertex. A star (biclique) k-coloring of G is a k-coloring of G thatâ€¦ (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)

A circular-arc model M = (C,A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has the same lengthâ€¦ (More)

- Andrew R. Curtis, Min Chih Lin, +4 authors Jayme Luiz Szwarcfiter
- Discrete Mathematics & Theoretical Computerâ€¦
- 2013

We give a linear-time algorithm that checks for isomorphism between two 0âˆ’ 1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for relatedâ€¦ (More)

- Francisco J. Soulignac, Gabriel Sueiro
- Annals OR
- 2009

A graph G is coordinated if the minimum number of colors that can be assigned to the cliques of H in such a way that no two cliques with non-empty intersection receive the same color is equal to theâ€¦ (More)

- Martiniano EguÃa, Francisco J. Soulignac
- Discrete Mathematics & Theoretical Computerâ€¦
- 2013

A biclique is a set of vertices that induce a bipartite complete graph. A graph G is biclique-Helly when its family of maximal bicliques satisfies the Helly property. If every induced subgraph of Gâ€¦ (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)