Claudson F. Bornstein

According to our database, Claudson F. Bornstein authored at least 19 papers between 1992 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Helly and strong Helly numbers of B_k-EPG and B_k-VPG graphs.

Claudson F. Bornstein, Gila Morgenstern, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter

Discuss. Math. Graph Theory, 2023

2020

The Complexity of Helly-B₁ 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

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

2017

Intersection Graphs of Orthodox Paths in Trees.

Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach

Electron. Notes Discret. Math., 2017

2016

Forbidden induced subgraphs for bounded p-intersection number.

Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach, Jayme Luiz Szwarcfiter

Discret. Math., 2016

2011

Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN).

Eduardo Sany Laber, Claudson F. Bornstein, Cristina G. Fernandes

Algorithmica, 2011

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

On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions.

Claudson F. Bornstein, Eduardo Sany Laber, Marcelo Mas

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

Randomized mechanisms for limited supply multi-item auctions.

Claudson F. Bornstein, Eduardo Sany Laber, Marcelo Albuquerque Fernandes Más

Electron. Notes Discret. Math., 2005

2004

Flow metrics.

Claudson F. Bornstein, Santosh S. Vempala

Theor. Comput. Sci., 2004

1999

Tradeoffs Between Parallelism and Fill in Nested Dissection.

Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller

Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

Redeeming Nested Dissection: Parallelism Implies Fill.

Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi

Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, 1999

1998

Iterated clique graphs with increasing diameters.

Claudson F. Bornstein, Jayme Luiz Szwarcfiter

J. Graph Theory, 1998

On the Bisection Width and Expansion of Butterfly Networks.

Claudson F. Bornstein, Ami Litman, Bruce M. Maggs, Ramesh K. Sitaraman, Tal Yatzkar

Proceedings of the 12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing (IPPS/SPDP '98), March 30, 1998

1997

Parallelizing Elimination Orders with Linear Fill.

Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1995

On clique convergent graphs.

Claudson F. Bornstein, Jayme Luiz Szwarcfiter

Graphs Comb., 1995

1994

Clique Graphs of Chordal and Path Graphs.

Jayme Luiz Szwarcfiter, Claudson F. Bornstein

SIAM J. Discret. Math., 1994

Data Reshuffling in Support of Fast I/O for Distributed-Memory Machines.

Claudson F. Bornstein, Peter Steenkiste

Proceedings of the Third International Symposium on High Performance Distributed Computing, 1994

1992

Parallel code generation for super-scalar architectures.

Edil S. T. Fernandes, Claudson F. Bornstein, Cláudia M. D. Pereira

Microprocess. Microprogramming, 1992