default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaudson F. Bornstein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Claudson F. Bornstein, Gila Morgenstern, Tanilson D. Santos, Uéverton S. Souza
, Jayme Luiz Szwarcfiter:
Helly and strong Helly numbers of Bk-EPG and Bk-VPG graphs. Discuss. Math. Graph Theory 43(4): 1237-1252 (2023)- 2020
- [j12]Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Constant threshold intersection graphs of orthodox paths in trees. Discret. Appl. Math. 281: 61-68 (2020) - [j11]Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
The Complexity of Helly-B1 EPG Graph Recognition. Discret. Math. Theor. Comput. Sci. 22(1) (2020)
2010 – 2019
- 2019
- [i1]Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
The Complexity of Helly-B1 EPG Graph Recognition. CoRR abs/1906.11185 (2019) - 2017
- [j10]Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach:
Intersection Graphs of Orthodox Paths in Trees. Electron. Notes Discret. Math. 62: 99-104 (2017) - 2016
- [j9]Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Forbidden induced subgraphs for bounded p-intersection number. Discret. Math. 339(2): 533-538 (2016) - 2011
- [j8]Eduardo Sany Laber, Claudson F. Bornstein, Cristina G. Fernandes:
Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN). Algorithmica 59(1): 1-2 (2011)
2000 – 2009
- 2008
- [e1]Eduardo Sany Laber, Claudson F. Bornstein, Loana Tito Nogueira, Luérbio Faria:
LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings. Lecture Notes in Computer Science 4957, Springer 2008, ISBN 978-3-540-78772-3 [contents] - 2006
- [j7]Claudson F. Bornstein, Celina M. H. de Figueiredo, Vinícius G. P. de Sá:
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem. Inf. Process. Lett. 98(3): 87-91 (2006) - [c7]Claudson F. Bornstein, Eduardo Sany Laber, Marcelo Mas:
On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions. LATIN 2006: 211-223 - 2005
- [j6]Claudson F. Bornstein, Eduardo Sany Laber, Marcelo Albuquerque Fernandes Más:
Randomized mechanisms for limited supply multi-item auctions. Electron. Notes Discret. Math. 19: 141-147 (2005) - 2004
- [j5]Claudson F. Bornstein, Santosh S. Vempala:
Flow metrics. Theor. Comput. Sci. 321(1): 13-24 (2004) - 2002
- [c6]Claudson F. Bornstein, Santosh S. Vempala:
Flow Metrics. LATIN 2002: 516-527
1990 – 1999
- 1999
- [c5]Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi:
Redeeming Nested Dissection: Parallelism Implies Fill. PP 1999 - [c4]Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller:
Tradeoffs Between Parallelism and Fill in Nested Dissection. SPAA 1999: 191-200 - 1998
- [j4]Claudson F. Bornstein, Jayme Luiz Szwarcfiter:
Iterated clique graphs with increasing diameters. J. Graph Theory 28(3): 147-154 (1998) - [c3]Claudson F. Bornstein, Ami Litman, Bruce M. Maggs, Ramesh K. Sitaraman, Tal Yatzkar:
On the Bisection Width and Expansion of Butterfly Networks. IPPS/SPDP 1998: 144-150 - 1997
- [c2]Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi:
Parallelizing Elimination Orders with Linear Fill. FOCS 1997: 274-283 - 1995
- [j3]Claudson F. Bornstein, Jayme Luiz Szwarcfiter:
On clique convergent graphs. Graphs Comb. 11(3): 213-220 (1995) - 1994
- [j2]Jayme Luiz Szwarcfiter, Claudson F. Bornstein:
Clique Graphs of Chordal and Path Graphs. SIAM J. Discret. Math. 7(2): 331-336 (1994) - [c1]Claudson F. Bornstein, Peter Steenkiste:
Data Reshuffling in Support of Fast I/O for Distributed-Memory Machines. HPDC 1994: 227-235 - 1992
- [j1]Edil S. T. Fernandes, Claudson F. Bornstein, Cláudia M. D. Pereira:
Parallel code generation for super-scalar architectures. Microprocess. Microprogramming 34(1-5): 223-226 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
