Claudson F. Bornstein

22 papers A* 1A 1B 4Journal 14Unranked 2
YearRankTypeTitle / Venue / Authors
2023 J jnl
Helly and strong Helly numbers of B
Discuss. Math. Graph Theory
Claudson F. Bornstein, Gila Morgenstern, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2020 J jnl
Constant threshold intersection graphs of orthodox paths in trees.
Discret. Appl. Math.
Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2020 J jnl
The Complexity of Helly-B
Discret. Math. Theor. Comput. Sci.
Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2019 J jnl
The Complexity of Helly-B
CoRR
Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter
2017 J jnl
Intersection Graphs of Orthodox Paths in Trees.
Electron. Notes Discret. Math.
Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach
2016 J jnl
Forbidden induced subgraphs for bounded p-intersection number.
Discret. Math.
Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2011 J jnl
Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN).
Algorithmica
Eduardo Sany Laber, Claudson F. Bornstein, Cristina G. Fernandes
2008 B ed.
LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings
Eduardo Sany Laber, Claudson F. Bornstein, Loana Tito Nogueira, Luérbio Faria
2006 B conf
On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions.
LATIN
Claudson F. Bornstein, Eduardo Sany Laber, Marcelo Mas
2006 J jnl
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem.
Inf. Process. Lett.
Claudson F. Bornstein, Celina M. H. de Figueiredo, Vinícius G. P. de Sá
2005 J jnl
Randomized mechanisms for limited supply multi-item auctions.
Electron. Notes Discret. Math.
Claudson F. Bornstein, Eduardo Sany Laber, Marcelo Albuquerque Fernandes Más
2004 J jnl
Flow metrics.
Theor. Comput. Sci.
Claudson F. Bornstein, Santosh S. Vempala
2002 B conf
Flow Metrics.
LATIN
Claudson F. Bornstein, Santosh S. Vempala
1999 — conf
Redeeming Nested Dissection: Parallelism Implies Fill.
PP
Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi
1999 B conf
Tradeoffs Between Parallelism and Fill in Nested Dissection.
SPAA
Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller
1998 J jnl
Iterated clique graphs with increasing diameters.
J. Graph Theory
Claudson F. Bornstein, Jayme Luiz Szwarcfiter
1998 — conf
On the Bisection Width and Expansion of Butterfly Networks.
IPPS/SPDP
Claudson F. Bornstein, Ami Litman, Bruce M. Maggs, Ramesh K. Sitaraman, Tal Yatzkar
1997 A* conf
Parallelizing Elimination Orders with Linear Fill.
FOCS
Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi
1995 J jnl
On clique convergent graphs.
Graphs Comb.
Claudson F. Bornstein, Jayme Luiz Szwarcfiter
1994 J jnl
Clique Graphs of Chordal and Path Graphs.
SIAM J. Discret. Math.
Jayme Luiz Szwarcfiter, Claudson F. Bornstein
1994 A conf
Data Reshuffling in Support of Fast I/O for Distributed-Memory Machines.
HPDC
Claudson F. Bornstein, Peter Steenkiste
1992 J jnl
Parallel code generation for super-scalar architectures.
Microprocess. Microprogramming
Edil S. T. Fernandes, Claudson F. Bornstein, Cláudia M. D. Pereira