default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJayme Luiz Szwarcfiter
Publications
- 2024
[i30]Guilherme C. M. Gomes
, Bruno Porto Masquio, Paulo E. D. Pinto, Dieter Rautenbach, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter, Florian Werner:
Complexity of Deciding the Equality of Matching Numbers. CoRR abs/2409.04855 (2024)- 2022
- [j177]Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
On the computational complexity of the bipartizing matching problem. Ann. Oper. Res. 316(2): 1235-1256 (2022) - 2020
- [j167]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) - 2018
- [j160]Carlos Vinícius G. C. Lima, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
And/or-convexity: a graph convexity based on processes and deadlock models. Ann. Oper. Res. 264(1-2): 267-286 (2018) - [c28]Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Bipartizing with a Matching. COCOA 2018: 198-213 - 2017
- [j151]Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Decycling with a matching. Inf. Process. Lett. 124: 26-29 (2017) - [j150]Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Generalized threshold processes on graphs. Theor. Comput. Sci. 689: 27-35 (2017) - [i14]Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Eliminating Odd Cycles by Removing a Matching. CoRR abs/1710.07741 (2017) - 2016
- [j149]Mitre Costa Dourado, Vinícius Gusmão Pereira de Sá, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Near-linear-time algorithm for the geodetic Radon number of grids. Discret. Appl. Math. 210: 277-283 (2016) - [j148]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) - 2015
- [j139]Min Chih Lin, Veronica A. Moyano, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
The Maximum Number of Dominating Induced Matchings. J. Graph Theory 78(4): 258-268 (2015) - 2014
- [j137]Mitre Costa Dourado, Luérbio Faria, Miguel A. Pizaña, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
On defensive alliances and strong global offensive alliances. Discret. Appl. Math. 163: 136-141 (2014) - [j133]Erika M. M. Coelho, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
The Carathéodory number of the P3 convexity of chordal graphs. Discret. Appl. Math. 172: 104-108 (2014) - [j130]Felix Joos, Christian Löwenstein, Fabiano de S. Oliveira, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Graphs of interval count two with a given partition. Inf. Process. Lett. 114(10): 542-546 (2014) - 2013
- [j129]Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter, Alexandre Toman:
Algorithmic and structural aspects of the P 3-Radon number. Ann. Oper. Res. 206(1): 75-91 (2013) - [j126]Mitre Costa Dourado, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
On the geodetic Radon number of grids. Discret. Math. 313(1): 111-121 (2013) - [j123]Rommel M. Barbosa, Dieter Rautenbach, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
On Minimal and Minimum Hull Sets. Electron. Notes Discret. Math. 44: 207-212 (2013) - [j122]Mitre Costa Dourado, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Polynomial time algorithm for the Radon number of grids in the geodetic convexity. Electron. Notes Discret. Math. 44: 371-376 (2013) - [j120]Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Unit Interval Graphs of Open and Closed Intervals. J. Graph Theory 72(4): 418-429 (2013) - [j117]Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter:
On the Carathéodory number of interval and graph convexities. Theor. Comput. Sci. 510: 127-135 (2013) - 2012
- [j116]Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Unit and single point interval graphs. Discret. Appl. Math. 160(10-11): 1601-1609 (2012) - [j114]Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter, Alexandre Toman:
An upper bound on the P3-Radon number. Discret. Math. 312(16): 2433-2437 (2012) - [j113]Mitre Costa Dourado, Van Bang Le, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Mixed unit interval graphs. Discret. Math. 312(22): 3357-3363 (2012) - [j111]Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
On the Convexity Number of Graphs. Graphs Comb. 28(3): 333-345 (2012) - [j110]Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Characterization and recognition of Radon-independent sets in split graphs. Inf. Process. Lett. 112(24): 948-952 (2012) - [j107]Rommel M. Barbosa, Erika M. M. Coelho, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
On the Carathéodory Number for the Convexity of Paths of Order Three. SIAM J. Discret. Math. 26(3): 929-939 (2012) - [j104]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Reversible iterative graph processes. Theor. Comput. Sci. 460: 16-25 (2012) - [c22]Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter, Alexandre Toman:
On the Radon Number for P 3-Convexity. LATIN 2012: 267-278 - 2011
- [j102]Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter:
On subbetweennesses of trees: Hardness, algorithms, and characterizations. Comput. Math. Appl. 62(12): 4674-4681 (2011) - [j101]Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter:
Characterization and representation problems for intersection betweennesses. Discret. Appl. Math. 159(5): 389-395 (2011) - [j99]Min Chih Lin, Dieter Rautenbach, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Powers of cycles, powers of paths, and distance graphs. Discret. Appl. Math. 159(7): 621-627 (2011) - [j96]Rommel M. Barbosa, Erika M. M. Coelho, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
On the Carathéodory Number for the Convexity of Paths of Order Three. Electron. Notes Discret. Math. 38: 105-110 (2011) - [j95]Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Unit Interval Graphs: A Story with Open Ends. Electron. Notes Discret. Math. 38: 737-742 (2011) - [j94]Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Connectivity and diameter in distance graphs. Networks 57(4): 310-315 (2011) - [j92]Carmen C. Centeno, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Irreversible conversion of graphs. Theor. Comput. Sci. 412(29): 3693-3700 (2011) - [c20]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
The South Zone: Distributed Algorithms for Alliances. SSS 2011: 178-192 - 2010
- [j87]Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Some remarks on the geodetic number of a graph. Discret. Math. 310(4): 832-837 (2010) - [j86]Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Long cycles and paths in distance graphs. Discret. Math. 310(23): 3417-3420 (2010) - [j85]Carmen C. Centeno, Simone Dantas, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Convex Partitions of Graphs induced by Paths of Order Three. Discret. Math. Theor. Comput. Sci. 12(5): 175-184 (2010) - [j81]Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
On the Hull Number of Triangle-Free Graphs. SIAM J. Discret. Math. 23(4): 2163-2172 (2010) - [c19]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Brief Announcement: On Reversible and Irreversible Conversions. DISC 2010: 395-397 - 2009
- [c17]Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Cycles, Paths, Connectivity and Diameter in Distance Graphs. WG 2009: 320-328
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-07-06 18:40 CEST 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:
