#### Filter Results:

- Full text PDF available (67)

#### Publication Year

1974

2017

- This year (4)
- Last 5 years (62)
- Last 10 years (117)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Alon Itai, Christos H. Papadimitriou, Jayme Luiz Szwarcfiter
- SIAM J. Comput.
- 1982

A grid graph is a node-induced finite subgraph of the infinite grid. It is rectangular if its set of nodes is the product of two intervals. Given a rectangular grid graph and two of its nodes, we give necessary and sufficient conditions for the graph to have a Hamilton path between these two nodes. In contrast, the Hamilton path (and circuit) problem for… (More)

- Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter
- Theory of Computing Systems
- 2007

A graph G is said to be a bicluster graph if G is a disjoint union of bicliques (complete bipartite subgraphs), and a cluster graph if G is a disjoint union of cliques (complete subgraphs). In this work, we study the parameterized versions of the NP-hard Bicluster Graph Editing and Cluster Graph Editing problems. The former consists of obtaining a bicluster… (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 graph is the intersection graph of a (Helly) circular-arc model. Circular-arc graphs and their subclasses have been the object of a great deal of attention in… (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 it, we design a data structure suitable for dynamic graph algorithms. We employ the data structure to formulate new algorithms for several problems , including… (More)

- Mitre Costa Dourado, John G. Gimbel, Jan Kratochvíl, Fábio Protti, Jayme Luiz Szwarcfiter
- Discrete Mathematics
- 2009

- Dieter Rautenbach, Jayme Luiz Szwarcfiter
- Journal of Graph Theory
- 2013

- Min Chih Lin, Jayme Luiz Szwarcfiter
- Discrete Mathematics
- 2009

Circular graphs are intersection graphs of arcs on a circle. These graphs are reported to have been studied since 1964, and they have been received considerable attention since a series of papers by Tucker in the 1970's. Various subclasses of circular-arc graphs have been also studied. Among these are the proper circular-arc graphs, unit circular-arc… (More)

- Jayme Luiz Szwarcfiter
- Ars Comb.
- 1997

- Vânia M. F. Dias, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter
- Theor. Comput. Sci.
- 2003

A stable matching is a complete matching of men and women such that no man and woman who are not partners both prefer each other to their actual partners under the matching. In an instance of the STABLE MARRIAGE problem, each of the n men and n women ranks the members of the opposite sex in order of preference. It is well known that at least one stable… (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 <i>O</i>(<i>n</i><sup>2</sup>) for recognizing whether a graph <i>G</i> with <i>n</i> vertices is a unit circular-arc (UCA) graph. Furthermore the following open questions were posed in the above paper: (<i>i</i>) Is it possible to construct a UCA… (More)