A Structured Program to Generate all Topological Sorting Arrangements. - Donald E. Knuth; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 1974)

Erratum: A Structured Program to Generate all Topological Sorting Arrangements. - Donald E. Knuth; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 1974)

Some Properties of Ternary Trees. - Jayme Luiz Szwarcfiter; L. B. Wilson (Comput. J., 1978)

Systems of Distinct Representatives for k Families of Sets. - Jayme Luiz Szwarcfiter (Inf. Process. Lett., 1979)

Hamilton Paths in Grid Graphs. - Alon Itai; Christos H. Papadimitriou; Jayme Luiz Szwarcfiter (SIAM J. Comput., 1982)

Optimal Multiway Search Trees for Variable Size Keys. - Jayme Luiz Szwarcfiter (Acta Informatica, 1984)

Orientations with single source and sink. - Jayme Luiz Szwarcfiter; Ronaldo C. M. Persiano; Antonio A. F. Oliveira (Discret. Appl. Math., 1985)

On digraphs with a rooted tree structure. - Jayme Luiz Szwarcfiter (Networks, 1985)

Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints. - Jacek Blazewicz; Wieslaw Kubiak; Hans Röck; Jayme Luiz Szwarcfiter (Acta Informatica, 1987)

Job shop scheduling with unit time operations under resource constraints and release dates. - Jayme Luiz Szwarcfiter (Discret. Appl. Math., 1987)

A Note on the Computation of the k-Closure of a Graph. - Jayme Luiz Szwarcfiter (Inf. Process. Lett., 1987)

On Finding Euler Tours in Parallel. - Edson Cáceres; Narsingh Deo; Shivakumar Sastry; Jayme Luiz Szwarcfiter (Parallel Process. Lett., 1993)

Enumerating the Kernels of a Directed Graph with no Odd Circuits. - Jayme Luiz Szwarcfiter; Guy Chaty (Inf. Process. Lett., 1994)

Clique Graphs of Chordal and Path Graphs. - Jayme Luiz Szwarcfiter; Claudson F. Bornstein (SIAM J. Discret. Math., 1994)

On edge transitivity of directed graphs. - Jayme Luiz Szwarcfiter (Discret. Math., 1995)

On clique convergent graphs. - Claudson F. Bornstein; Jayme Luiz Szwarcfiter (Graphs Comb., 1995)

On Computing All Maximal Cliques Distributedly. - Fábio Protti; Felipe M. G. França; Jayme Luiz Szwarcfiter (IRREGULAR, 1997)

Recognizing Clique-Helly Graphs. - Jayme Luiz Szwarcfiter (Ars Comb., 1997)

Characterizing and Edge-colouring Split-indifference Graphs. - Carmen Ortiz; Nelson Maculan; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 1998)

On clique-complete graphs. - Cláudio Leonardo Lucchesi; Célia Picinin de Mello; Jayme Luiz Szwarcfiter (Discret. Math., 1998)

Iterated clique graphs with increasing diameters. - Claudson F. Bornstein; Jayme Luiz Szwarcfiter (J. Graph Theory, 1998)

Even and Odd Pairs in Comparability and in P4-comparability Graphs. - Celina M. H. de Figueiredo; John G. Gimbel; Célia Picinin de Mello; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 1999)

Recognizing Clique Graphs of Directed and Rooted Path Graphs. - Erich Prisner; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 1999)

Linear-time Algorithms for Maximum Sets of Sources and sinks. - Celina M. H. de Figueiredo; John G. Gimbel; Célia Picinin de Mello; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 1999)

Generating all the Acyclic Orientations of an Undirected Graph. - Valmir Carneiro Barbosa; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 1999)

On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets (Extended Abstract). - Ricardo C. Corrêa; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2000)

Clique-inverse graphs of K3-free and K4-free graphs. - Fábio Protti; Jayme Luiz Szwarcfiter (J. Graph Theory, 2000)

A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs. - Edson Cáceres; Siang W. Song; Jayme Luiz Szwarcfiter (International Conference on Computational Science (2), 2001)

A Characterization of Edge Clique Graphs. - Márcia R. Cerioli; Jayme Luiz Szwarcfiter (Ars Comb., 2001)

A sufficient condition for self-clique graphs. - J. Adrian Bondy; Guillermo Durán; Min Chih Lin; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2001)

Stable marriages with restricted pairs. - Vânia M. Félix Dias; Guilherme Dias da Fonseca; Celina M. H. de Figueiredo; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2001)

Preface: Volume 7. - Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2001)

On the helly defect of a graph. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (J. Braz. Comput. Soc., 2001)

A Parallel Algorithm for Transitive Closure. - Edson Norberto Cáceres; Siang W. Song; Jayme Luiz Szwarcfiter (IASTED PDCS, 2002)

On Clique-Transversals and Clique-Independent Sets. - Guillermo Durán; Min Chih Lin; Jayme Luiz Szwarcfiter (Ann. Oper. Res., 2002)

A note on transitive orientations with maximum sets of sources and sinks. - Celina M. H. de Figueiredo; John G. Gimbel; Célia Picinin de Mello; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2002)

Edge clique graphs and some classes of chordal graphs. - Márcia R. Cerioli; Jayme Luiz Szwarcfiter (Discret. Math., 2002)

Optimal Binary Search Trees with Costs Depending on the Access Paths. - Jayme Luiz Szwarcfiter (CIAC, 2003)

On the Generation of Extensions of a Partially Ordered Set. - Jayme Luiz Szwarcfiter (CIAC, 2003)

Generating All Forest Extensions of a Partially Ordered Set. - Jayme Luiz Szwarcfiter (CIAC, 2003)

Efficient Parallel Implementation of Transitive Closure of Digraphs. - Carlos E. R. Alves; Edson Cáceres; Amaury Antônio de Castro Jr.; Siang W. Song; Jayme Luiz Szwarcfiter (PVM/MPI, 2003)

A Representation for the Modules of a Graph and applications. - Sulamita Klein; Jayme Luiz Szwarcfiter (J. Braz. Comput. Soc., 2003)

Self-clique graphs and matrix permutations. - J. Adrian Bondy; Guillermo Durán; Min Chih Lin; Jayme Luiz Szwarcfiter (J. Graph Theory, 2003)

The stable marriage problem with restricted pairs. - Vânia M. Félix Dias; Guilherme Dias da Fonseca; Celina M. H. de Figueiredo; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2003)

Optimal binary search trees with costs depending on the access paths. - Jayme Luiz Szwarcfiter; Gonzalo Navarro 001; Ricardo A. Baeza-Yates; Joísa de S. Oliveira; Walter Cunto; Nivio Ziviani (Theor. Comput. Sci., 2003)

A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components. - Edson Norberto Cáceres; Frank K. H. A. Dehne; Henrique Mongelli; Siang W. Song; Jayme Luiz Szwarcfiter (Euro-Par, 2004)

A Huffman-Based Error Detecting Code. - Paulo Eustáquio Duarte Pinto; Fábio Protti; Jayme Luiz Szwarcfiter (WEA, 2004)

Preface. - Bruce A. Reed; Siang W. Song; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2004)

Treelike Comparability Graphs. - Maria Patricia Dobson; Marisa Gutierrez; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2004)

Clique-independent sets of Helly circular-arc graphs. - Guillermo Durán; Min Chih Lin; Sergio Mera; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2004)

A representation for the modular-pairs of a cograph by modular decomposition. - Sulamita Klein; Noemi C. dos Santos; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2004)

On extensions, linear extensions, upsets and downsets of ordered sets. - Ricardo C. Corrêa; Jayme Luiz Szwarcfiter (Discret. Math., 2005)

The Helly property on subhypergraphs. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2005)

A representation for the modular-pairs of a P4-reducible graph by modular decomposition. - Noemi C. dos Santos; Sulamita Klein; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2005)

A forbidden subgraph characterization of path graphs. - Silvia B. Tondato; Marisa Gutierrez; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2005)

The Helly property on subfamilies of limited size. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2005)

Parity codes. - Paulo Eustáquio Duarte Pinto; Fábio Protti; Jayme Luiz Szwarcfiter (RAIRO Theor. Informatics Appl., 2005)

Generating bicliques of a graph in lexicographic order. - Vânia M. Félix Dias; Celina M. H. de Figueiredo; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2005)

Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs. - Min Chih Lin; Jayme Luiz Szwarcfiter (COCOON, 2006)

Applying Modular Decomposition to Parameterized Bicluster Editing. - Fábio Protti; Maise Dantas da Silva; Jayme Luiz Szwarcfiter (IWPEC, 2006)

Efficient construction of unit circular-arc models. - Min Chih Lin; Jayme Luiz Szwarcfiter (SODA, 2006)

On clique-perfect and K-perfect graphs. - Flavia Bonomo; Guillermo Durán; Marina Groshaus; Jayme Luiz Szwarcfiter (Ars Comb., 2006)

Characterizing Intersection Graphs of Substars of a Star. - Márcia R. Cerioli; Jayme Luiz Szwarcfiter (Ars Comb., 2006)

Algorithms for clique-independent sets on subclasses of circular-arc graphs. - Guillermo Durán; Min Chih Lin; Sergio Mera; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2006)

Complexity aspects of generalized Helly hypergraphs. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2006)

Computational Aspects of the Helly Property: a Survey. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (J. Braz. Comput. Soc., 2006)

On Balanced Graphs. - Flavia Bonomo; Guillermo Durán; Min Chih Lin; Jayme Luiz Szwarcfiter (Math. Program., 2006)

Proper Helly Circular-Arc Graphs. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (WG, 2007)

On the generation of bicliques of a graph. - Vânia M. Félix Dias; Celina M. H. de Figueiredo; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2007)

Characterization and recognition of generalized clique-Helly graphs. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2007)

Convex Partitions of Graphs. - Danilo Artigas; Mitre Costa Dourado; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2007)

Biclique-Helly Graphs. - Marina Groshaus; Jayme Luiz Szwarcfiter (Graphs Comb., 2007)

On transitive orientations with restricted covering graphs. - Maria Patricia Dobson; Marisa Gutierrez; Michel Habib; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2007)

Faster recognition of clique-Helly and hereditary clique-Helly graphs. - Min Chih Lin; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2007)

A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (SWAT, 2008)

Algorithms for finding clique-transversals of graphs. - Guillermo Durán; Min Chih Lin; Sergio Mera; Jayme Luiz Szwarcfiter (Ann. Oper. Res., 2008)

On the strong p-Helly property. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2008)

On Hereditary Helly Classes of Graphs. - Marina Groshaus; Jayme Luiz Szwarcfiter (Discret. Math. Theor. Comput. Sci., 2008)

Linear-Interval Dimension and PI Orders. - Márcia R. Cerioli; Fabiano de S. Oliveira; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2008)

Algorithmic Aspects of Monophonic Convexity. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2008)

Clique trees of chordal graphs: leafage and 3-asteroidals. - Marisa Gutierrez; Jayme Luiz Szwarcfiter; Silvia B. Tondato (Electron. Notes Discret. Math., 2008)

Preface. - Thomas M. Liebling; Jayme Luiz Szwarcfiter; Guillermo Durán; Martín Matamala (Electron. Notes Discret. Math., 2008)

On cliques of Helly Circular-arc Graphs. - Min Chih Lin; Ross M. McConnell; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2008)

Improved algorithms for recognizing p. - Mitre Costa Dourado; Min Chih Lin; Fábio Protti; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2008)

Unit Circular-Arc Graph Representations and Feasible Circulations. - Min Chih Lin; Jayme Luiz Szwarcfiter (SIAM J. Discret. Math., 2008)

Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code. - Paulo Eustáquio Duarte Pinto; Fábio Protti; Jayme Luiz Szwarcfiter (TAMC, 2009)

Cycles, Paths, Connectivity and Diameter in Distance Graphs. - Lucia Draque Penso; Dieter Rautenbach; Jayme Luiz Szwarcfiter (WG, 2009)

Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs. - Mitre Costa Dourado; Rosiane de Freitas Rodrigues; Jayme Luiz Szwarcfiter (Ann. Oper. Res., 2009)

On the computation of the hull number of a graph. - Mitre Costa Dourado; John G. Gimbel; Jan Kratochvíl; Fábio Protti; Jayme Luiz Szwarcfiter (Discret. Math., 2009)

Characterizations and recognition of circular-arc graphs and subclasses: A survey. - Min Chih Lin; Jayme Luiz Szwarcfiter (Discret. Math., 2009)

The Colorful Helly Property for Hypergraphs. - Rommel M. Barbosa; Mitre Costa Dourado; Erika M. Martins; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2009)

On the Convexity of Paths of Length Two in Undirected Graphs. - Carmen C. Centeno; Mitre Costa Dourado; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2009)

Preface. - Thomas M. Liebling; Jayme Luiz Szwarcfiter; Carlos Eduardo Ferreira; Fábio Protti (Electron. Notes Discret. Math., 2009)

Short Models for Unit Interval Graphs. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2009)

Applying Modular Decomposition to Parameterized Cluster Editing Problems. - Fábio Protti; Maise Dantas da Silva; Jayme Luiz Szwarcfiter (Theory Comput. Syst., 2009)

Brief Announcement: On Reversible and Irreversible Conversions. - Mitre Costa Dourado; Lucia Draque Penso; Dieter Rautenbach; Jayme Luiz Szwarcfiter (DISC, 2010)

Extreme Cliques in Interval Graphs. - Márcia R. Cerioli; Fabiano de S. Oliveira; Jayme Luiz Szwarcfiter (Ars Comb., 2010)

Complexity results related to monophonic convexity. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2010)

Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007. - Guillermo Durán; Thomas M. Liebling; Martín Matamala; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2010)

The clique operator on circular-arc graphs. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2010)

Some remarks on the geodetic number of a graph. - Mitre Costa Dourado; Fábio Protti; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Discret. Math., 2010)

Long cycles and paths in distance graphs. - Lucia Draque Penso; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Discret. Math., 2010)

Convex Partitions of Graphs induced by Paths of Order Three. - Carmen C. Centeno; Simone Dantas; Mitre Costa Dourado; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Discret. Math. Theor. Comput. Sci., 2010)

Scheduling on parallel machines considering job-machine dependency constraints. - Mitre Costa Dourado; Rosiane de Freitas Rodrigues; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2010)

Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search. - Edson Norberto Cáceres; Siang Wun Song; Jayme Luiz Szwarcfiter (RAIRO Theor. Informatics Appl., 2010)

Biclique graphs and biclique matrices. - Marina Groshaus; Jayme Luiz Szwarcfiter (J. Graph Theory, 2010)

On the Hull Number of Triangle-Free Graphs. - Mitre Costa Dourado; Fábio Protti; Dieter Rautenbach; Jayme Luiz Szwarcfiter (SIAM J. Discret. Math., 2010)

The South Zone: Distributed Algorithms for Alliances. - Mitre Costa Dourado; Lucia Draque Penso; Dieter Rautenbach; Jayme Luiz Szwarcfiter (SSS, 2011)

Linear-Time Recognition of Helly Circular-Arc Models and Graphs. - Benson L. Joeris; Min Chih Lin; Ross M. McConnell; Jeremy P. Spinrad; Jayme Luiz Szwarcfiter (Algorithmica, 2011)

On subbetweennesses of trees: Hardness, algorithms, and characterizations. - Dieter Rautenbach; Vinícius Fernandes dos Santos; Philipp Matthias Schäfer; Jayme Luiz Szwarcfiter (Comput. Math. Appl., 2011)

Subclasses of Normal Helly Circular-Arc Graphs - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (CoRR, 2011)

On counting interval lengths of interval graphs. - Márcia R. Cerioli; Fabiano de S. Oliveira; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2011)

Powers of cycles, powers of paths, and distance graphs. - Min Chih Lin; Dieter Rautenbach; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2011)

Characterization and representation problems for intersection betweennesses. - Dieter Rautenbach; Vinícius Fernandes dos Santos; Philipp Matthias Schäfer; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2011)

Partitioning a graph into convex sets. - Danilo Artigas; Simone Dantas; Mitre Costa Dourado; Jayme Luiz Szwarcfiter (Discret. Math., 2011)

On the Carathéodory Number for the Convexity of Paths of Order Three. - Rommel M. Barbosa; Erika M. M. Coelho; Mitre Costa Dourado; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2011)

LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium. - Flavia Bonomo; Thomas M. Liebling; Javier Marenco; Jayme Luiz Szwarcfiter; Mario Valencia-Pabon (Electron. Notes Discret. Math., 2011)

Unit Interval Graphs: A Story with Open Ends. - Dieter Rautenbach; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2011)

Connectivity and diameter in distance graphs. - Lucia Draque Penso; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Networks, 2011)

Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs, . - Marina Groshaus; Jayme Luiz Szwarcfiter (RAIRO Oper. Res., 2011)

Irreversible conversion of graphs. - Carmen C. Centeno; Mitre Costa Dourado; Lucia Draque Penso; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2011)

Graphs with Few P4's Under the Convexity of Paths of Order Three. - Victor A. Campos; Rudini Menezes Sampaio; Ana Silva 001; Jayme Luiz Szwarcfiter (CTW, 2012)

On the Radon Number for P 3-Convexity. - Mitre Costa Dourado; Dieter Rautenbach; Vinícius Fernandes dos Santos; Philipp Matthias Schäfer; Jayme Luiz Szwarcfiter; Alexandre Toman (LATIN, 2012)

V Latin-American Algorithms, Graphs, and Optimization Symposium - Gramado, Brazil, 2009. - Carlos Eduardo Ferreira; Fábio Protti; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2012)

Unit and single point interval graphs. - Dieter Rautenbach; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2012)

Mixed unit interval graphs. - Mitre Costa Dourado; Van Bang Le; Fábio Protti; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Discret. Math., 2012)

An upper bound on the P3-Radon number. - Mitre Costa Dourado; Dieter Rautenbach; Vinícius Fernandes dos Santos; Philipp Matthias Schäfer; Jayme Luiz Szwarcfiter; Alexandre Toman (Discret. Math., 2012)

The colorful Helly theorem and general hypergraphs. - Rommel M. Barbosa; Erika M. M. Coelho; Mitre Costa Dourado; Jayme Luiz Szwarcfiter (Eur. J. Comb., 2012)

On the Convexity Number of Graphs. - Mitre Costa Dourado; Fábio Protti; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Graphs Comb., 2012)

Characterization and recognition of Radon-independent sets in split graphs. - Mitre Costa Dourado; Dieter Rautenbach; Vinícius Fernandes dos Santos; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2012)

The interval count of interval graphs and orders: a short survey. - Márcia R. Cerioli; Fabiano de S. Oliveira; Jayme Luiz Szwarcfiter (J. Braz. Comput. Soc., 2012)

Graph theory and algorithms - Fourth Latin-American Workshop on Cliques in Graphs. - Celina M. H. de Figueiredo; Jayme Luiz Szwarcfiter (J. Braz. Comput. Soc., 2012)

Reversible iterative graph processes. - Mitre Costa Dourado; Lucia Draque Penso; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2012)

Arboricity, h-index, and dynamic algorithms. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2012)

Exact and approximation algorithms for error-detecting even codes. - Paulo Eustáquio Duarte Pinto; Fábio Protti; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2012)

Geodetic sets and periphery. - Danilo Artigas; Simone Dantas; Mitre Costa Dourado; Jayme Luiz Szwarcfiter (CTW, 2013)

An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching. - Min Chih Lin; Michel J. Mizrahi; Jayme Luiz Szwarcfiter (ISAAC, 2013)

Towards a Provably Resilient Scheme for Graph-Based Watermarking. - Lucila Maria Souza Bento; Davidson R. Boccardo; Raphael Carlos Santos Machado; Vinícius Gusmão Pereira de Sá; Jayme Luiz Szwarcfiter (WG, 2013)

Algorithmic and structural aspects of the P 3-Radon number. - Mitre Costa Dourado; Dieter Rautenbach; Vinícius Fernandes dos Santos; Philipp Matthias Schäfer; Jayme Luiz Szwarcfiter; Alexandre Toman (Ann. Oper. Res., 2013)

Exact algorithms for dominating induced matchings - Min Chih Lin; Michel J. Mizrahi; Jayme Luiz Szwarcfiter (CoRR, 2013)

Towards a provably robust graph-based watermarking scheme - Lucila M. S. Bento; Davidson R. Boccardo; Raphael C. S. Machado; Vinícius Gusmão Pereira de Sá; Jayme Luiz Szwarcfiter (CoRR, 2013)

On the contour of graphs. - Danilo Artigas; Simone Dantas; Mitre Costa Dourado; Jayme Luiz Szwarcfiter; Sei-ichi Yamaguchi (Discret. Appl. Math., 2013)

Normal Helly circular-arc graphs and its subclasses. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2013)

On the geodetic Radon number of grids. - Mitre Costa Dourado; Dieter Rautenbach; Vinícius Gusmão Pereira de Sá; Jayme Luiz Szwarcfiter (Discret. Math., 2013)

Isomorphism of graph classes related to the circular-ones property. - Andrew R. Curtis; Min Chih Lin; Ross M. McConnell; Yahav Nussbaum; Francisco J. Soulignac; Jeremy P. Spinrad; Jayme Luiz Szwarcfiter (Discret. Math. Theor. Comput. Sci., 2013)

The convexity of induced paths of order three. - Rafael T. Araújo; Rudini Menezes Sampaio; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2013)

On Minimal and Minimum Hull Sets. - Rommel M. Barbosa; Dieter Rautenbach; Vinícius Fernandes dos Santos; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2013)

Polynomial time algorithm for the Radon number of grids in the geodetic convexity. - Mitre Costa Dourado; Dieter Rautenbach; Vinícius Gusmão Pereira de Sá; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2013)

Parallel transitive closure algorithm. - Carlos Eduardo Rodrigues Alves; E. N. Cáceres; Amaury Antônio de Castro Jr.; Siang Wun Song; Jayme Luiz Szwarcfiter (J. Braz. Comput. Soc., 2013)

Induced Decompositions of Graphs. - J. Adrian Bondy; Jayme Luiz Szwarcfiter (J. Graph Theory, 2013)

Unit Interval Graphs of Open and Closed Intervals. - Dieter Rautenbach; Jayme Luiz Szwarcfiter (J. Graph Theory, 2013)

The Arboreal Jump Number of an Order. - Adriana P. Figueiredo; Michel Habib; Sulamita Klein; Jayme Luiz Szwarcfiter (Order, 2013)

On the Carathéodory number of interval and graph convexities. - Mitre Costa Dourado; Dieter Rautenbach; Vinícius Fernandes dos Santos; Philipp Matthias Schäfer; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2013)

O(n) Time Algorithms for Dominating Induced Matching Problems. - Min Chih Lin; Michel J. Mizrahi; Jayme Luiz Szwarcfiter (LATIN, 2014)

On Helly Hypergraphs with Variable Intersection Sizes. - Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Ars Comb., 2014)

LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011. - Flavia Bonomo; Thomas M. Liebling; Javier Marenco; Jayme Luiz Szwarcfiter; Mario Valencia-Pabon (Discret. Appl. Math., 2014)

Characterization of classical graph classes by weighted clique graphs. - Flavia Bonomo; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2014)

The Carathéodory number of the P3 convexity of chordal graphs. - Erika M. M. Coelho; Mitre Costa Dourado; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2014)

On defensive alliances and strong global offensive alliances. - Mitre Costa Dourado; Luérbio Faria; Miguel A. Pizaña; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2014)

Scheduling problem with multi-purpose parallel machines. - Rosiane de Freitas Rodrigues; Mitre Costa Dourado; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2014)

Complexity aspects of the computation of the rank of a graph. - Igor da Fonseca Ramos; Vinícius Fernandes dos Santos; Jayme Luiz Szwarcfiter (Discret. Math. Theor. Comput. Sci., 2014)

Graphs of interval count two with a given partition. - Felix Joos; Christian Löwenstein; Fabiano de S. Oliveira; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2014)

Fast algorithms for some dominating induced matching problems. - Min Chih Lin; Michel J. Mizrahi; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2014)

Fair Fingerprinting Protocol for Attesting Software Misuses. - Raphael C. S. Machado; Davidson R. Boccardo; Vinícius Gusmão Pereira de Sá; Jayme Luiz Szwarcfiter (ARES, 2015)

The Graphs of Structured Programming. - Lucila M. S. Bento; Davidson R. Boccardo; Raphael Machado; Vinícius Gusmão Pereira de Sá; Jayme Luiz Szwarcfiter (CTW, 2015)

Polynomial time algorithm for the k-in-a-tree problem on chordal graphs. - Vinícius Fernandes dos Santos; Murilo V. G. da Silva; Jayme Luiz Szwarcfiter (CTW, 2015)

Parameterized mixed cluster editing via modular decomposition. - Maise Dantas da Silva; Fábio Protti; Jayme Luiz Szwarcfiter (CoRR, 2015)

Graphs with few P4's under the convexity of paths of order three. - Victor A. Campos; Rudini Menezes Sampaio; Ana Silva 001; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2015)

On probe co-bipartite and probe diamond-free graphs. - Flavia Bonomo; Celina Miraglia Herrera de Figueiredo; Guillermo Alfredo Durán; Luciano Norberto Grippo; Martín Darío Safe; Jayme Luiz Szwarcfiter (Discret. Math. Theor. Comput. Sci., 2015)

On f-Reversible Processes on Graphs. - Mitre Costa Dourado; Carlos Vinícius G. C. Lima; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2015)

On unit interval graphs with integer endpoints. - Guillermo Durán; Fernando Fernández Slezak; Luciano N. Grippo; Fabiano de S. Oliveira; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2015)

Efficient and Perfect domination on circular-arc graphs. - Min Chih Lin; Michel J. Mizrahi; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2015)

A faster algorithm for the cluster editing problem on proper interval graphs. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2015)

The Maximum Number of Dominating Induced Matchings. - Min Chih Lin; Veronica A. Moyano; Dieter Rautenbach; Jayme Luiz Szwarcfiter (J. Graph Theory, 2015)

Dijkstra Graphs. - Lucila M. S. Bento; Davidson R. Boccardo; Raphael C. S. Machado; Vinícius Gusmão Pereira de Sá; Jayme Luiz Szwarcfiter (CoRR, 2016)

Distance geometry approach for special graph coloring problems. - Rosiane de Freitas Rodrigues; Bruno Dias; Nelson Maculan; Jayme Luiz Szwarcfiter (CoRR, 2016)

Near-linear-time algorithm for the geodetic Radon number of grids. - Mitre Costa Dourado; Vinícius Gusmão Pereira de Sá; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2016)

Forbidden induced subgraphs for bounded p-intersection number. - Claudson F. Bornstein; José Wilson Coura Pinto; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Discret. Math., 2016)

Software control and intellectual property protection in cyber-physical systems. - Raphael C. S. Machado; Davidson R. Boccardo; Vinícius Gusmão Pereira de Sá; Jayme Luiz Szwarcfiter (EURASIP J. Inf. Secur., 2016)

On the Complexity of the P3-Hull Number of the Cartesian Product of Graphs. - Julliano R. Nascimento; Erika M. M. Coelho; Hebert Coelho; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2016)

Exact Algorithms for Minimum Weighted Dominating Induced Matching. - Min Chih Lin; Michel J. Mizrahi; Jayme Luiz Szwarcfiter (Algorithmica, 2017)

Eliminating Odd Cycles by Removing a Matching. - Carlos Vinícius G. C. Lima; Dieter Rautenbach; Uéverton S. Souza; Jayme Luiz Szwarcfiter (CoRR, 2017)

On recognition of threshold tolerance graphs and their complements. - Petr A. Golovach; Pinar Heggernes; Nathan Lindzey; Ross M. McConnell; Vinícius Fernandes dos Santos; Jeremy P. Spinrad; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2017)

On neighborhood-Helly graphs. - Marina Groshaus; Min Chih Lin; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2017)

Decycling with a matching. - Carlos Vinícius G. C. Lima; Dieter Rautenbach; Uéverton S. Souza; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2017)

Generalized threshold processes on graphs. - Carlos Vinícius G. C. Lima; Dieter Rautenbach; Uéverton S. Souza; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2017)

Bipartizing with a Matching. - Carlos V. G. C. Lima; Dieter Rautenbach; Uéverton S. Souza; Jayme Luiz Szwarcfiter (COCOA, 2018)

And/or-convexity: a graph convexity based on processes and deadlock models. - Carlos Vinícius G. C. Lima; Fábio Protti; Dieter Rautenbach; Uéverton S. Souza; Jayme Luiz Szwarcfiter (Ann. Oper. Res., 2018)

Perfect edge domination: hard and solvable cases. - Min Chih Lin; Vadim V. Lozin; Veronica A. Moyano; Jayme Luiz Szwarcfiter (Ann. Oper. Res., 2018)

On the Geodetic Hull Number of Complementary Prisms. - Erika M. M. Coelho; Hebert Coelho; Julliano R. Nascimento; Jayme Luiz Szwarcfiter (CoRR, 2018)

The convexity of induced paths of order three and applications: Complexity aspects. - Rafael T. Araújo; Rudini M. Sampaio; Vinícius Fernandes dos Santos; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2018)

On the resilience of canonical reducible permutation graphs. - Lucila M. S. Bento; Davidson R. Boccardo; Raphael C. S. Machado; Vinícius Gusmão Pereira de Sá; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2018)

Recognition and characterization of unit interval graphs with integer endpoints. - Guillermo Durán; Fernando Fernández Slezak; Luciano N. Grippo; Fabiano de S. Oliveira; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2018)

A computational study of f-reversible processes on graphs. - Carlos Vinícius G. C. Lima; Leonardo I. L. Oliveira; Valmir C. Barbosa; Mitre Costa Dourado; Fábio Protti; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2018)

Full Characterization of a Class of Graphs Tailored for Software Watermarking. - Lucila M. S. Bento; Davidson R. Boccardo; Raphael C. S. Machado; Vinícius Gusmão Pereira de Sá; Jayme Luiz Szwarcfiter (Algorithmica, 2019)

Dijkstra graphs. - Lucila M. S. Bento; Davidson R. Boccardo; Raphael C. S. Machado; Flávio Keidi Miyazawa; Vinícius Gusmão Pereira de Sá; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2019)

On the P3-hull number of some products of graphs. - Erika M. M. Coelho; Hebert Coelho; Julliano R. Nascimento; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2019)

On the Computational Complexity of the Helly Number in the P3 and Related Convexities. - Moisés T. Carvalho; Simone Dantas; Mitre Costa Dourado; Daniel F. D. Posner; Jayme Luiz Szwarcfiter (LAGOS, 2019)

Two Problems on Interval Counting. - Lívia Salgado Medeiros; Fabiano de S. Oliveira; Jayme Luiz Szwarcfiter (LAGOS, 2019)

New BSP/CGM algorithms for spanning trees. - Jucele Franca de Alencar Vasconcellos; Edson Norberto Cáceres; Henrique Mongelli; Siang Wun Song; Frank Dehne; Jayme Luiz Szwarcfiter (Int. J. High Perform. Comput. Appl., 2019)

A perspective on theoretical computer science in Latin America. - Marcos Kiwi; Yoshiharu Kohayakawa; Sergio Rajsbaum; Francisco Rodríguez-Henríquez; Jayme Luiz Szwarcfiter; Alfredo Viola (Commun. ACM, 2020)

FPT and kernelization algorithms for the k-in-a-tree problem. - Guilherme de C. M. Gomes; Vinícius Fernandes dos Santos; Murilo V. G. da Silva; Jayme Luiz Szwarcfiter (CoRR, 2020)

Constant threshold intersection graphs of orthodox paths in trees. - Claudson F. Bornstein; José Wilson Coura Pinto; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2020)

The Complexity of Helly-B1 EPG Graph Recognition. - Claudson F. Bornstein; Martin Charles Golumbic; Tanilson D. Santos; Uéverton S. Souza; Jayme Luiz Szwarcfiter (Discret. Math. Theor. Comput. Sci., 2020)

Modelling and solving the perfect edge domination problem. - Vinicius Leal do Forte; Min Chih Lin; Abilio Lucena; Nelson Maculan; Veronica A. Moyano; Jayme Luiz Szwarcfiter (Optim. Lett., 2020)

FPT and Kernelization Algorithms for the Induced Tree Problem. - Guilherme de Castro Mendes Gomes; Vinícius Fernandes dos Santos; Murilo V. G. da Silva; Jayme Luiz Szwarcfiter (CIAC, 2021)

Minimum Number of Bends of Paths of Trees in a Grid Embedding. - Vitor Tocci Ferreira de Luca; Fabiano de Souza Oliveira; Jayme Luiz Szwarcfiter (LAGOS, 2021)

B1-EPG representations using block-cutpoint trees. - Vitor Tocci F. de Luca; Fabiano de S. Oliveira; Jayme Luiz Szwarcfiter (CoRR, 2021)

Partitioning a Graph into Complementary Subgraphs. - Julliano R. Nascimento; Uéverton S. Souza; Jayme Luiz Szwarcfiter (Graphs Comb., 2021)

On distance graph coloring problems. - Rosiane de Freitas Rodrigues; Bruno Dias; Nelson Maculan; Jayme Luiz Szwarcfiter (Int. Trans. Oper. Res., 2021)

On the computational complexity of the bipartizing matching problem. - Carlos V. G. C. Lima; Dieter Rautenbach; Uéverton S. Souza; Jayme Luiz Szwarcfiter (Ann. Oper. Res., 2022)

Edge Intersection Graphs of Paths on a Triangular Grid. - Vitor Tocci Ferreira de Luca; María Pía Mazzoleni; Fabiano de S. Oliveira; Tanilson D. Santos; Jayme Luiz Szwarcfiter (CoRR, 2022)

Some New Results on Efficient and Perfect Edge Domination of Graphs. - Vinicius Leal do Forte; Min Chih Lin; Abilio Lucena; Nelson Maculan; Veronica A. Moyano; Jayme Luiz Szwarcfiter (CoRR, 2022)

Empirical Evaluation of Project Scheduling Algorithms for Maximization of the Net Present Value. - Isac M. Lacerda; Eber A. Schmitz; Jayme Luiz Szwarcfiter; Rosiane de Freitas (CoRR, 2022)

Thinness of product graphs. - Flavia Bonomo-Braberman; Carolina Lucía Gonzalez; Fabiano de Souza Oliveira; Moysés S. Sampaio Jr.; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2022)

Precedence thinness in graphs. - Flavia Bonomo-Braberman; Fabiano de S. Oliveira; Moysés S. Sampaio Jr.; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2022)

On subclasses of interval count two and on Fishburn's conjecture. - Mathew C. Francis; Lívia Salgado Medeiros; Fabiano de S. Oliveira; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2022)

Grid straight-line embeddings of trees with a minimum number of bends per path. - Vitor Tocci F. de Luca; Nestaly Marín; Fabiano de S. Oliveira; Adriana Ramírez-Vigueras; Oriol Andreu Solé-Pi; Jayme Luiz Szwarcfiter; Jorge Urrutia (Inf. Process. Lett., 2022)

A polynomial time algorithm for geodetic hull number for complementary prisms. - Erika M. M. Coelho; Hebert Coelho; Julliano R. Nascimento; Jayme Luiz Szwarcfiter (RAIRO Theor. Informatics Appl., 2022)

Restricted Hamming-Huffman trees. - Min Chih Lin; Fabiano de S. Oliveira; Paulo E. D. Pinto; Moysés S. Sampaio Jr.; Jayme Luiz Szwarcfiter (RAIRO Oper. Res., 2022)

Mixed integer programming and quadratic programming formulations for the interval count problem. - Lívia Salgado Medeiros; Fabiano de S. Oliveira; Abilio Lucena; Jayme Luiz Szwarcfiter (LAGOS, 2023)

Helly and strong Helly numbers of Bk-EPG and Bk-VPG graphs. - Claudson F. Bornstein; Gila Morgenstern; Tanilson D. Santos; Uéverton S. Souza; Jayme Luiz Szwarcfiter (Discuss. Math. Graph Theory, 2023)

Disconnected matchings. - Guilherme C. M. Gomes; Bruno Porto Masquio; Paulo E. D. Pinto; Vinícius Fernandes dos Santos; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2023)

Complexity of Deciding the Equality of Matching Numbers. - Guilherme C. M. Gomes; Bruno Porto Masquio; Paulo E. D. Pinto; Dieter Rautenbach; Vinícius Fernandes dos Santos; Jayme Luiz Szwarcfiter; Florian Werner 003 (CoRR, 2024)

Thinness and its variations on some graph families and coloring graphs of bounded thinness. - Flavia Bonomo-Braberman; Eric Brandwein; Fabiano de S. Oliveira; Moysés S. Sampaio Jr.; Agustín Sansone; Jayme Luiz Szwarcfiter (RAIRO Oper. Res., 2024)

Linear-time algorithms for eliminating claws in graphs. - Flavia Bonomo-Braberman; Julliano R. Nascimento; Fabiano de S. Oliveira; Uéverton S. Souza; Jayme Luiz Szwarcfiter (Int. Trans. Oper. Res., 2024)

Structured Watermarks for Structured Software. - Lucila M. S. Bento; Davidson R. Boccardo; Raphael C. S. Machado; Vinícius G. P. de Sá; Jayme Luiz Szwarcfiter (SN Comput. Sci., 2024)

Weighted connected matchings. - Guilherme C. M. Gomes; Bruno Porto Masquio; Paulo E. D. Pinto; Vinícius Fernandes dos Santos; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2025)