Parallel code generation for super-scalar architectures. - Edil S. T. Fernandes; Claudson F. Bornstein; Cláudia M. D. Pereira (Microprocess. Microprogramming, 1992)

Data Reshuffling in Support of Fast I/O for Distributed-Memory Machines. - Claudson F. Bornstein; Peter Steenkiste (HPDC, 1994)

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

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

Parallelizing Elimination Orders with Linear Fill. - Claudson F. Bornstein; Bruce M. Maggs; Gary L. Miller; R. Ravi 001 (FOCS, 1997)

On the Bisection Width and Expansion of Butterfly Networks. - Claudson F. Bornstein; Ami Litman; Bruce M. Maggs; Ramesh K. Sitaraman; Tal Yatzkar (IPPS/SPDP, 1998)

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

Redeeming Nested Dissection: Parallelism Implies Fill. - Claudson F. Bornstein; Bruce M. Maggs; Gary L. Miller; R. Ravi 001 (PP, 1999)

Tradeoffs Between Parallelism and Fill in Nested Dissection. - Claudson F. Bornstein; Bruce M. Maggs; Gary L. Miller (SPAA, 1999)

Flow Metrics. - Claudson F. Bornstein; Santosh S. Vempala (LATIN, 2002)

Randomized mechanisms for limited supply multi-item auctions. - Claudson F. Bornstein; Eduardo Sany Laber; Marcelo Albuquerque Fernandes Más (Electron. Notes Discret. Math., 2005)

On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions. - Claudson F. Bornstein; Eduardo Sany Laber; Marcelo Mas (LATIN, 2006)

The Pair Completion algorithm for the Homogeneous Set Sandwich Problem. - Claudson F. Bornstein; Celina M. H. de Figueiredo; Vinícius G. P. de Sá (Inf. Process. Lett., 2006)

Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN). - Eduardo Sany Laber; Claudson F. Bornstein; Cristina G. Fernandes (Algorithmica, 2011)

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

Intersection Graphs of Orthodox Paths in Trees. - Claudson F. Bornstein; José Wilson Coura Pinto; Dieter Rautenbach (Electron. Notes Discret. Math., 2017)

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)

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)