Claudson F. Bornstein - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 20 from 20

2023

k-VPG graphsClaudson F. Bornstein, Gila Morgenstern, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter. dmgt, 43(4):1237-1252, 2023. [doi]

2020

The Complexity of Helly-$B_{1}$ EPG Graph RecognitionClaudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter. dmtcs, 22(1), 2020. [doi]

Constant threshold intersection graphs of orthodox paths in treesClaudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach, Jayme Luiz Szwarcfiter. DAM, 281:61-68, 2020. [doi]

2017

Intersection Graphs of Orthodox Paths in TreesClaudson F. Bornstein, José W. C. Pinto, Dieter Rautenbach. endm, 62:99-104, 2017. [doi]

2016

Forbidden induced subgraphs for bounded p-intersection numberClaudson F. Bornstein, José W. C. Pinto, Dieter Rautenbach, Jayme Luiz Szwarcfiter. DM, 339(2):533-538, 2016. [doi]

2011

Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN)Eduardo Sany Laber, Claudson F. Bornstein, Cristina G. Fernandes. algorithmica, 59(1):1-2, 2011. [doi]

2006

The Pair Completion algorithm for the Homogeneous Set Sandwich ProblemClaudson F. Bornstein, Celina M. Herrera de Figueiredo, Vinícius G. P. de Sá. ipl, 98(3):87-91, 2006. [doi]

On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand AuctionsClaudson F. Bornstein, Eduardo Sany Laber, Marcelo Mas. latin 2006: 211-223 [doi]

2005

Randomized mechanisms for limited supply multi-item auctionsClaudson F. Bornstein, Eduardo Sany Laber, Marcelo Albuquerque Fernandes Más. endm, 19:141-147, 2005. [doi]

2004

Flow metricsClaudson F. Bornstein, Santosh Vempala. TCS, 321(1):13-24, 2004. [doi]

2002

Flow MetricsClaudson F. Bornstein, Santosh Vempala. latin 2002: 516-527 [doi]

1999

Tradeoffs Between Parallelism and Fill in Nested DissectionClaudson F. Bornstein, Bruce M. Maggs, Gary L. Miller. spaa 1999: 191-200 [doi]

Redeeming Nested Dissection: Parallelism Implies FillClaudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi. ppsc 1999:

1998

Iterated clique graphs with increasing diametersClaudson F. Bornstein, Jayme Luiz Szwarcfiter. jgt, 28(3):147-154, 1998. [doi]

On the Bisection Width and Expansion of Butterfly NetworksClaudson F. Bornstein, Ami Litman, Bruce M. Maggs, Ramesh K. Sitaraman, Tal Yatzkar. ipps 1998: 144-150 [doi]

1997

Parallelizing Elimination Orders with Linear FillClaudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi. focs 1997: 274-283 [doi]

1995

On clique convergent graphsClaudson F. Bornstein, Jayme Luiz Szwarcfiter. gc, 11(3):213-220, 1995. [doi]

1994

Data Reshuffling in Support of Fast I/O for Distributed-Memory MachinesClaudson F. Bornstein, Peter Steenkiste. hpdc 1994: 227-235

Clique Graphs of Chordal and Path GraphsJayme Luiz Szwarcfiter, Claudson F. Bornstein. siamdm, 7(2):331-336, 1994. [doi]

1992

Parallel code generation for super-scalar architecturesEdil S. T. Fernandes, Claudson F. Bornstein, Cláudia M. D. Pereira. jsa, 34(1-5):223-226, 1992. [doi]

Sign in or sign up to see more results.

runs on WebDSL