default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJayme Luiz Szwarcfiter
Person information
- affiliation: Federal University of Rio de Janeiro, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j182]Flavia Bonomo-Braberman, Julliano R. Nascimento
, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Linear-time algorithms for eliminating claws in graphs. Int. Trans. Oper. Res. 31(1): 296-315 (2024)- [j181]Flavia Bonomo-Braberman, Eric Brandwein, Fabiano de S. Oliveira, Moysés S. Sampaio Jr., Agustín Sansone, Jayme Luiz Szwarcfiter:
Thinness and its variations on some graph families and coloring graphs of bounded thinness. RAIRO Oper. Res. 58(2): 1681-1702 (2024) - [j180]Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Vinícius G. P. de Sá, Jayme Luiz Szwarcfiter:
Structured Watermarks for Structured Software. SN Comput. Sci. 5(5): 568 (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) - 2023
- [j179]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) - [j178]Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Disconnected matchings. Theor. Comput. Sci. 956: 113821 (2023) - [c37]Lívia Salgado Medeiros, Fabiano de S. Oliveira, Abilio Lucena, Jayme Luiz Szwarcfiter:
Mixed integer programming and quadratic programming formulations for the interval count problem. LAGOS 2023: 283-291 - [i29]Flavia Bonomo-Braberman, Eric Brandwein, Fabiano de S. Oliveira, Moysés S. Sampaio Jr., Agustín Sansone, Jayme Luiz Szwarcfiter:
Thinness and its variations on some graph families and coloring graphs of bounded thinness. CoRR abs/2303.06070 (2023) - 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) - [j176]Flavia Bonomo-Braberman, Carolina Lucía Gonzalez, Fabiano de Souza Oliveira, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter:
Thinness of product graphs. Discret. Appl. Math. 312: 52-71 (2022) - [j175]Flavia Bonomo-Braberman, Fabiano de S. Oliveira, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter:
Precedence thinness in graphs. Discret. Appl. Math. 323: 76-95 (2022) - [j174]Mathew C. Francis, Lívia Salgado Medeiros, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
On subclasses of interval count two and on Fishburn's conjecture. Discret. Appl. Math. 323: 236-251 (2022) - [j173]Vitor Tocci F. de Luca, Nestaly Marín, Fabiano de S. Oliveira, Adriana Ramírez-Vigueras, Oriol Andreu Solé-Pi, Jayme Luiz Szwarcfiter, Jorge Urrutia:
Grid straight-line embeddings of trees with a minimum number of bends per path. Inf. Process. Lett. 174: 106210 (2022) - [j172]Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Jayme Luiz Szwarcfiter:
A polynomial time algorithm for geodetic hull number for complementary prisms. RAIRO Theor. Informatics Appl. 56: 1 (2022) - [j171]Min Chih Lin, Fabiano de S. Oliveira, Paulo E. D. Pinto, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter:
Restricted Hamming-Huffman trees. RAIRO Oper. Res. 56(3): 1823-1839 (2022) - [c36]Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Weighted Connected Matchings. LATIN 2022: 54-70 - [i28]Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Weighted Connected Matchings. CoRR abs/2202.04746 (2022) - [i27]Vitor Tocci Ferreira de Luca, María Pía Mazzoleni, Fabiano de S. Oliveira, Tanilson D. Santos, Jayme Luiz Szwarcfiter:
Edge Intersection Graphs of Paths on a Triangular Grid. CoRR abs/2203.04250 (2022) - [i26]Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter:
Some New Results on Efficient and Perfect Edge Domination of Graphs. CoRR abs/2204.11785 (2022) - [i25]Isac M. Lacerda, Eber A. Schmitz, Jayme Luiz Szwarcfiter, Rosiane de Freitas:
Empirical Evaluation of Project Scheduling Algorithms for Maximization of the Net Present Value. CoRR abs/2207.03330 (2022) - 2021
- [j170]Julliano R. Nascimento, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Partitioning a Graph into Complementary Subgraphs. Graphs Comb. 37(4): 1311-1331 (2021) - [j169]Rosiane de Freitas Rodrigues, Bruno Dias, Nelson Maculan, Jayme Luiz Szwarcfiter:
On distance graph coloring problems. Int. Trans. Oper. Res. 28(3): 1213-1241 (2021) - [c35]Guilherme de Castro Mendes Gomes, Vinícius Fernandes dos Santos, Murilo V. G. da Silva, Jayme Luiz Szwarcfiter:
FPT and Kernelization Algorithms for the Induced Tree Problem. CIAC 2021: 158-172 - [c34]Guilherme de C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Disconnected Matchings. COCOON 2021: 579-590 - [c33]Vitor Tocci Ferreira de Luca, Fabiano de Souza Oliveira, Jayme Luiz Szwarcfiter:
Minimum Number of Bends of Paths of Trees in a Grid Embedding. LAGOS 2021: 118-126 - [i24]Vitor Tocci F. de Luca, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
B1-EPG representations using block-cutpoint trees. CoRR abs/2106.05312 (2021) - [i23]Vitor Tocci F. de Luca, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
Minimum Number of Bends of Paths of Trees in a Grid Embedding. CoRR abs/2109.02733 (2021) - [i22]Guilherme de C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Disconnected Matchings. CoRR abs/2112.09248 (2021) - 2020
- [j168]Marcos Kiwi, Yoshiharu Kohayakawa, Sergio Rajsbaum, Francisco Rodríguez-Henríquez, Jayme Luiz Szwarcfiter, Alfredo Viola:
A perspective on theoretical computer science in Latin America. Commun. ACM 63(11): 102-107 (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) - [j166]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) - [j165]Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter:
Modelling and solving the perfect edge domination problem. Optim. Lett. 14(2): 369-394 (2020) - [c32]Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Linear-Time Algorithms for Eliminating Claws in Graphs. COCOON 2020: 14-26 - [c31]Julliano Rosa Nascimento, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Partitioning a Graph into Complementary Subgraphs. WALCOM 2020: 223-235 - [i21]Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Linear-time Algorithms for Eliminating Claws in Graphs. CoRR abs/2004.05672 (2020) - [i20]Flavia Bonomo-Braberman, Carolina Lucía Gonzalez, Fabiano de S. Oliveira, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter:
Thinness of product graphs. CoRR abs/2006.16887 (2020) - [i19]Flavia Bonomo-Braberman, Fabiano de S. Oliveira, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter:
Precedence thinness in graphs. CoRR abs/2006.16991 (2020) - [i18]Guilherme de C. M. Gomes, Vinícius Fernandes dos Santos, Murilo V. G. da Silva, Jayme Luiz Szwarcfiter:
FPT and kernelization algorithms for the k-in-a-tree problem. CoRR abs/2007.04468 (2020)
2010 – 2019
- 2019
- [j164]Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Full Characterization of a Class of Graphs Tailored for Software Watermarking. Algorithmica 81(7): 2899-2916 (2019) - [j163]Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Jayme Luiz Szwarcfiter:
On the P3-hull number of some products of graphs. Discret. Appl. Math. 253: 2-13 (2019) - [j162]Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Flávio Keidi Miyazawa, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Dijkstra graphs. Discret. Appl. Math. 261: 52-62 (2019) - [j161]Jucele Franca de Alencar Vasconcellos, Edson Norberto Cáceres, Henrique Mongelli, Siang Wun Song, Frank Dehne, Jayme Luiz Szwarcfiter:
New BSP/CGM algorithms for spanning trees. Int. J. High Perform. Comput. Appl. 33(3) (2019) - [c30]Moisés T. Carvalho, Simone Dantas, Mitre Costa Dourado, Daniel F. D. Posner, Jayme Luiz Szwarcfiter:
On the Computational Complexity of the Helly Number in the P3 and Related Convexities. LAGOS 2019: 285-297 - [c29]Lívia Salgado Medeiros, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
Two Problems on Interval Counting. LAGOS 2019: 625-643 - [i17]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) - 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) - [j159]Min Chih Lin, Vadim V. Lozin, Veronica A. Moyano, Jayme Luiz Szwarcfiter:
Perfect edge domination: hard and solvable cases. Ann. Oper. Res. 264(1-2): 287-305 (2018) - [j158]Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
On the resilience of canonical reducible permutation graphs. Discret. Appl. Math. 234: 32-46 (2018) - [j157]Rafael T. Araújo, Rudini M. Sampaio, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
The convexity of induced paths of order three and applications: Complexity aspects. Discret. Appl. Math. 237: 33-42 (2018) - [j156]Carlos Vinícius G. C. Lima, Leonardo I. L. Oliveira, Valmir C. Barbosa, Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
A computational study of f-reversible processes on graphs. Discret. Appl. Math. 245: 77-93 (2018) - [j155]Guillermo Durán, Fernando Fernández Slezak, Luciano N. Grippo, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
Recognition and characterization of unit interval graphs with integer endpoints. Discret. Appl. Math. 245: 168-176 (2018) - [c28]Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Bipartizing with a Matching. COCOA 2018: 198-213 - [i16]Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Jayme Luiz Szwarcfiter:
On the Geodetic Hull Number of Complementary Prisms. CoRR abs/1807.08295 (2018) - 2017
- [j154]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Exact Algorithms for Minimum Weighted Dominating Induced Matching. Algorithmica 77(3): 642-660 (2017) - [j153]Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter:
On recognition of threshold tolerance graphs and their complements. Discret. Appl. Math. 216: 171-180 (2017) - [j152]Marina Groshaus, Min Chih Lin, Jayme Luiz Szwarcfiter:
On neighborhood-Helly graphs. Discret. Appl. Math. 216: 191-202 (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) - [i15]Min Chih Lin, Vadim V. Lozin, Veronica A. Moyano, Jayme Luiz Szwarcfiter:
Perfect Edge Domination: Hard and Solvable Cases. CoRR abs/1705.08379 (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) - [j147]Raphael C. S. Machado, Davidson R. Boccardo, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Software control and intellectual property protection in cyber-physical systems. EURASIP J. Inf. Secur. 2016: 8 (2016) - [j146]Julliano R. Nascimento, Erika M. M. Coelho, Hebert Coelho, Jayme Luiz Szwarcfiter:
On the Complexity of the P3-Hull Number of the Cartesian Product of Graphs. Electron. Notes Discret. Math. 55: 169-172 (2016) - [i13]Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Dijkstra Graphs. CoRR abs/1602.08653 (2016) - [i12]Rosiane de Freitas Rodrigues, Bruno Dias, Nelson Maculan, Jayme Luiz Szwarcfiter:
Distance geometry approach for special graph coloring problems. CoRR abs/1606.04978 (2016) - 2015
- [j145]Victor A. Campos, Rudini Menezes Sampaio, Ana Silva, Jayme Luiz Szwarcfiter:
Graphs with few P4's under the convexity of paths of order three. Discret. Appl. Math. 192: 28-39 (2015) - [j144]Flavia Bonomo, Celina Miraglia Herrera de Figueiredo, Guillermo Alfredo Durán, Luciano Norberto Grippo, Martín Darío Safe, Jayme Luiz Szwarcfiter:
On probe co-bipartite and probe diamond-free graphs. Discret. Math. Theor. Comput. Sci. 17(1): 187-200 (2015) - [j143]Mitre Costa Dourado, Carlos Vinícius G. C. Lima, Jayme Luiz Szwarcfiter:
On f-Reversible Processes on Graphs. Electron. Notes Discret. Math. 50: 231-236 (2015) - [j142]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Efficient and Perfect domination on circular-arc graphs. Electron. Notes Discret. Math. 50: 307-312 (2015) - [j141]Guillermo Durán, Fernando Fernández Slezak, Luciano N. Grippo, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
On unit interval graphs with integer endpoints. Electron. Notes Discret. Math. 50: 445-450 (2015) - [j140]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
A faster algorithm for the cluster editing problem on proper interval graphs. Inf. Process. Lett. 115(12): 913-916 (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) - [c27]Raphael C. S. Machado, Davidson R. Boccardo, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Fair Fingerprinting Protocol for Attesting Software Misuses. ARES 2015: 110-119 - [i11]Lucila M. S. Bento, Davidson R. Boccardo, Raphael Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
The Graphs of Structured Programming. CTW 2015: 105-108 - [i10]Vinícius Fernandes dos Santos, Murilo V. G. da Silva, Jayme Luiz Szwarcfiter:
Polynomial time algorithm for the k-in-a-tree problem on chordal graphs. CTW 2015: 242-245 - [i9]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Efficient and Perfect domination on circular-arc graphs. CoRR abs/1502.01523 (2015) - [i8]Maise Dantas da Silva, Fábio Protti, Jayme Luiz Szwarcfiter:
Parameterized mixed cluster editing via modular decomposition. CoRR abs/1506.00944 (2015) - 2014
- [j138]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
On Helly Hypergraphs with Variable Intersection Sizes. Ars Comb. 114: 185-191 (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) - [j136]Rosiane de Freitas Rodrigues, Mitre Costa Dourado, Jayme Luiz Szwarcfiter:
Scheduling problem with multi-purpose parallel machines. Discret. Appl. Math. 164: 313-319 (2014) - [j135]Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon:
LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011. Discret. Appl. Math. 164: 357-359 (2014) - [j134]Flavia Bonomo, Jayme Luiz Szwarcfiter:
Characterization of classical graph classes by weighted clique graphs. Discret. Appl. Math. 165: 83-95 (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) - [j132]Igor da Fonseca Ramos, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Complexity aspects of the computation of the rank of a graph. Discret. Math. Theor. Comput. Sci. 16(2): 73-86 (2014) - [j131]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Fast algorithms for some dominating induced matching problems. Inf. Process. Lett. 114(10): 524-528 (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) - [c26]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
O(n) Time Algorithms for Dominating Induced Matching Problems. LATIN 2014: 399-408 - 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) - [j128]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Normal Helly circular-arc graphs and its subclasses. Discret. Appl. Math. 161(7-8): 1037-1059 (2013) - [j127]Danilo Artigas, Simone Dantas, Mitre Costa Dourado, Jayme Luiz Szwarcfiter, Sei-ichi Yamaguchi:
On the contour of graphs. Discret. Appl. Math. 161(10-11): 1356-1362 (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) - [j125]Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter:
Isomorphism of graph classes related to the circular-ones property. Discret. Math. Theor. Comput. Sci. 15(1): 157-182 (2013) - [j124]Rafael T. Araújo, Rudini Menezes Sampaio, Jayme Luiz Szwarcfiter:
The convexity of induced paths of order three. Electron. Notes Discret. Math. 44: 109-114 (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) - [j121]Carlos Eduardo Rodrigues Alves, E. N. Cáceres, Amaury Antônio de Castro Jr., Siang Wun Song, Jayme Luiz Szwarcfiter:
Parallel transitive closure algorithm. J. Braz. Comput. Soc. 19(2): 161-166 (2013) - [j120]Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Unit Interval Graphs of Open and Closed Intervals. J. Graph Theory 72(4): 418-429 (2013) - [j119]J. Adrian Bondy, Jayme Luiz Szwarcfiter:
Induced Decompositions of Graphs. J. Graph Theory 72(4): 462-477 (2013) - [j118]Adriana P. Figueiredo, Michel Habib, Sulamita Klein, Jayme Luiz Szwarcfiter:
The Arboreal Jump Number of an Order. Order 30(1): 339-350 (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) - [c25]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching. ISAAC 2013: 558-567 - [c24]Lucila Maria Souza Bento, Davidson R. Boccardo, Raphael Carlos Santos Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Towards a Provably Resilient Scheme for Graph-Based Watermarking. WG 2013: 50-63 - [i7]Danilo Artigas, Simone Dantas, Mitre Costa Dourado, Jayme Luiz Szwarcfiter:
Geodetic sets and periphery. CTW 2013: 15-18 - [i6]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Exact algorithms for dominating induced matchings. CoRR abs/1301.7602 (2013) - [i5]Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Towards a provably robust graph-based watermarking scheme. CoRR abs/1302.7262 (2013) - [i4]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
An $O^*(1.1939^n)$ time algorithm for minimum weighted dominating induced matching. CoRR abs/1303.0035 (2013) - 2012
- [j116]Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Unit and single point interval graphs. Discret. Appl. Math. 160(10-11): 1601-1609 (2012) - [j115]Carlos Eduardo Ferreira, Fábio Protti, Jayme Luiz Szwarcfiter:
V Latin-American Algorithms, Graphs, and Optimization Symposium - Gramado, Brazil, 2009. Discret. Appl. Math. 160(18): 2499-2501 (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) - [j112]Rommel M. Barbosa, Erika M. M. Coelho, Mitre Costa Dourado, Jayme Luiz Szwarcfiter:
The colorful Helly theorem and general hypergraphs. Eur. J. Comb. 33(5): 743-749 (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) - [j109]Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter:
Graph theory and algorithms - Fourth Latin-American Workshop on Cliques in Graphs. J. Braz. Comput. Soc. 18(2): 83-84 (2012) - [j108]Márcia R. Cerioli, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
The interval count of interval graphs and orders: a short survey. J. Braz. Comput. Soc. 18(2): 103-112 (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) - [j106]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Arboricity, h-index, and dynamic algorithms. Theor. Comput. Sci. 426: 75-90 (2012) - [j105]Paulo Eustáquio Duarte Pinto, Fábio Protti, Jayme Luiz Szwarcfiter:
Exact and approximation algorithms for error-detecting even codes. Theor. Comput. Sci. 440-441: 60-72 (2012) - [j104]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Reversible iterative graph processes. Theor. Comput. Sci. 460: 16-25 (2012) - [c23]Victor A. Campos, Rudini Menezes Sampaio, Ana Silva, Jayme Luiz Szwarcfiter:
Graphs with Few P4's Under the Convexity of Paths of Order Three. CTW 2012: 60-63 - [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 - [i3]Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter:
Isomorphism of graph classes related to the circular-ones property. CoRR abs/1203.4822 (2012) - 2011
- [j103]Benson L. Joeris, Min Chih Lin, Ross M. McConnell, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter:
Linear-Time Recognition of Helly Circular-Arc Models and Graphs. Algorithmica 59(2): 215-239 (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) - [j100]Márcia R. Cerioli, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
On counting interval lengths of interval graphs. Discret. Appl. Math. 159(7): 532-543 (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) - [j98]Danilo Artigas, Simone Dantas, Mitre Costa Dourado, Jayme Luiz Szwarcfiter:
Partitioning a graph into convex sets. Discret. Math. 311(17): 1968-1977 (2011) - [j97]Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon:
LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium. Electron. Notes Discret. Math. 37: 1-2 (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) - [j93]Marina Groshaus, Jayme Luiz Szwarcfiter:
Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs, . RAIRO Oper. Res. 45(3): 209-222 (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) - [c21]Flavia Bonomo, Jayme Luiz Szwarcfiter:
Characterization of classical graph classes by weighted clique graphs. CTW 2011: 84-87 - [c20]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
The South Zone: Distributed Algorithms for Alliances. SSS 2011: 178-192 - [i2]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Subclasses of Normal Helly Circular-Arc Graphs. CoRR abs/1103.3732 (2011) - 2010
- [j91]Márcia R. Cerioli, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
Extreme Cliques in Interval Graphs. Ars Comb. 94 (2010) - [j90]Guillermo Durán, Thomas M. Liebling, Martín Matamala, Jayme Luiz Szwarcfiter:
Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007. Discret. Appl. Math. 158(12): 1213-1215 (2010) - [j89]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
The clique operator on circular-arc graphs. Discret. Appl. Math. 158(12): 1259-1267 (2010) - [j88]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
Complexity results related to monophonic convexity. Discret. Appl. Math. 158(12): 1268-1274 (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) - [j84]Mitre Costa Dourado, Rosiane de Freitas Rodrigues, Jayme Luiz Szwarcfiter:
Scheduling on parallel machines considering job-machine dependency constraints. Electron. Notes Discret. Math. 36: 431-438 (2010) - [j83]Edson Norberto Cáceres, Siang Wun Song, Jayme Luiz Szwarcfiter:
Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search. RAIRO Theor. Informatics Appl. 44(3): 293-311 (2010) - [j82]Marina Groshaus, Jayme Luiz Szwarcfiter:
Biclique graphs and biclique matrices. J. Graph Theory 63(1): 1-16 (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 - [i1]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Arboricity, h-Index, and Dynamic Algorithms. CoRR abs/1005.2211 (2010)
2000 – 2009
- 2009
- [j80]Mitre Costa Dourado, Rosiane de Freitas Rodrigues, Jayme Luiz Szwarcfiter:
Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs. Ann. Oper. Res. 169(1): 81-91 (2009) - [j79]Min Chih Lin, Jayme Luiz Szwarcfiter:
Characterizations and recognition of circular-arc graphs and subclasses: A survey. Discret. Math. 309(18): 5618-5635 (2009) - [j78]Mitre Costa Dourado, John G. Gimbel, Jan Kratochvíl, Fábio Protti, Jayme Luiz Szwarcfiter:
On the computation of the hull number of a graph. Discret. Math. 309(18): 5668-5674 (2009) - [j77]Carmen C. Centeno, Mitre Costa Dourado, Jayme Luiz Szwarcfiter:
On the Convexity of Paths of Length Two in Undirected Graphs. Electron. Notes Discret. Math. 32: 11-18 (2009) - [j76]Rommel M. Barbosa, Mitre Costa Dourado, Erika M. Martins, Jayme Luiz Szwarcfiter:
The Colorful Helly Property for Hypergraphs. Electron. Notes Discret. Math. 34: 647-651 (2009) - [j75]Thomas M. Liebling, Jayme Luiz Szwarcfiter, Carlos Eduardo Ferreira, Fábio Protti:
Preface. Electron. Notes Discret. Math. 35: 1-2 (2009) - [j74]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Short Models for Unit Interval Graphs. Electron. Notes Discret. Math. 35: 247-255 (2009) - [j73]Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter:
Applying Modular Decomposition to Parameterized Cluster Editing Problems. Theory Comput. Syst. 44(1): 91-104 (2009) - [c18]Paulo Eustáquio Duarte Pinto, Fábio Protti, Jayme Luiz Szwarcfiter:
Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code. TAMC 2009: 311-324 - [c17]Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Cycles, Paths, Connectivity and Diameter in Distance Graphs. WG 2009: 320-328 - 2008
- [j72]Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter:
Algorithms for finding clique-transversals of graphs. Ann. Oper. Res. 157(1): 37-45 (2008) - [j71]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
On the strong p-Helly property. Discret. Appl. Math. 156(7): 1053-1057 (2008) - [j70]Marina Groshaus, Jayme Luiz Szwarcfiter:
On Hereditary Helly Classes of Graphs. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - [j69]Thomas M. Liebling, Jayme Luiz Szwarcfiter, Guillermo Durán, Martín Matamala:
Preface. Electron. Notes Discret. Math. 30: 1-2 (2008) - [j68]Márcia R. Cerioli, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
Linear-Interval Dimension and PI Orders. Electron. Notes Discret. Math. 30: 111-116 (2008) - [j67]Min Chih Lin, Ross M. McConnell, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
On cliques of Helly Circular-arc Graphs. Electron. Notes Discret. Math. 30: 117-122 (2008) - [j66]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
Algorithmic Aspects of Monophonic Convexity. Electron. Notes Discret. Math. 30: 177-182 (2008) - [j65]Marisa Gutierrez, Jayme Luiz Szwarcfiter, Silvia B. Tondato:
Clique trees of chordal graphs: leafage and 3-asteroidals. Electron. Notes Discret. Math. 30: 237-242 (2008) - [j64]Mitre Costa Dourado, Min Chih Lin, Fábio Protti, Jayme Luiz Szwarcfiter:
Improved algorithms for recognizing p. Inf. Process. Lett. 108(4): 247-250 (2008) - [j63]Min Chih Lin, Jayme Luiz Szwarcfiter:
Unit Circular-Arc Graph Representations and Feasible Circulations. SIAM J. Discret. Math. 22(1): 409-423 (2008) - [c16]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs. SWAT 2008: 355-366 - 2007
- [j62]Vânia M. Félix Dias, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter:
On the generation of bicliques of a graph. Discret. Appl. Math. 155(14): 1826-1832 (2007) - [j61]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
Characterization and recognition of generalized clique-Helly graphs. Discret. Appl. Math. 155(18): 2435-2443 (2007) - [j60]Danilo Artigas, Mitre Costa Dourado, Jayme Luiz Szwarcfiter:
Convex Partitions of Graphs. Electron. Notes Discret. Math. 29: 147-151 (2007) - [j59]Marina Groshaus, Jayme Luiz Szwarcfiter:
Biclique-Helly Graphs. Graphs Comb. 23(6): 633-645 (2007) - [j58]Maria Patricia Dobson, Marisa Gutierrez, Michel Habib, Jayme Luiz Szwarcfiter:
On transitive orientations with restricted covering graphs. Inf. Process. Lett. 101(3): 119-125 (2007) - [j57]Min Chih Lin, Jayme Luiz Szwarcfiter:
Faster recognition of clique-Helly and hereditary clique-Helly graphs. Inf. Process. Lett. 103(1): 40-43 (2007) - [c15]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Proper Helly Circular-Arc Graphs. WG 2007: 248-257 - 2006
- [j56]Márcia R. Cerioli, Jayme Luiz Szwarcfiter:
Characterizing Intersection Graphs of Substars of a Star. Ars Comb. 79 (2006) - [j55]Flavia Bonomo, Guillermo Durán, Marina Groshaus, Jayme Luiz Szwarcfiter:
On clique-perfect and K-perfect graphs. Ars Comb. 80 (2006) - [j54]Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter:
Algorithms for clique-independent sets on subclasses of circular-arc graphs. Discret. Appl. Math. 154(13): 1783-1790 (2006) - [j53]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
Complexity aspects of generalized Helly hypergraphs. Inf. Process. Lett. 99(1): 13-18 (2006) - [j52]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
Computational Aspects of the Helly Property: a Survey. J. Braz. Comput. Soc. 12(1): 7-33 (2006) - [j51]Flavia Bonomo, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter:
On Balanced Graphs. Math. Program. 105(2-3): 233-250 (2006) - [c14]Min Chih Lin, Jayme Luiz Szwarcfiter:
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs. COCOON 2006: 73-82 - [c13]Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter:
Applying Modular Decomposition to Parameterized Bicluster Editing. IWPEC 2006: 1-12 - [c12]Min Chih Lin, Jayme Luiz Szwarcfiter:
Efficient construction of unit circular-arc models. SODA 2006: 309-315 - 2005
- [j50]Ricardo C. Corrêa, Jayme Luiz Szwarcfiter:
On extensions, linear extensions, upsets and downsets of ordered sets. Discret. Math. 295(1-3): 13-30 (2005) - [j49]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
The Helly property on subhypergraphs. Electron. Notes Discret. Math. 19: 71-77 (2005) - [j48]Silvia B. Tondato, Marisa Gutierrez, Jayme Luiz Szwarcfiter:
A forbidden subgraph characterization of path graphs. Electron. Notes Discret. Math. 19: 281-287 (2005) - [j47]Noemi C. dos Santos, Sulamita Klein, Jayme Luiz Szwarcfiter:
A representation for the modular-pairs of a P4-reducible graph by modular decomposition. Electron. Notes Discret. Math. 22: 267-270 (2005) - [j46]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
The Helly property on subfamilies of limited size. Inf. Process. Lett. 93(2): 53-56 (2005) - [j45]Paulo Eustáquio Duarte Pinto, Fábio Protti, Jayme Luiz Szwarcfiter:
Parity codes. RAIRO Theor. Informatics Appl. 39(1): 263-278 (2005) - [j44]Vânia M. Félix Dias, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter:
Generating bicliques of a graph in lexicographic order. Theor. Comput. Sci. 337(1-3): 240-248 (2005) - 2004
- [j43]Bruce A. Reed, Siang W. Song, Jayme Luiz Szwarcfiter:
Preface. Discret. Appl. Math. 141(1-3): 1 (2004) - [j42]Vânia M. Félix Dias, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter:
On the generation of bicliques of a graph. Electron. Notes Discret. Math. 17: 123-127 (2004) - [j41]Maria Patricia Dobson, Marisa Gutierrez, Jayme Luiz Szwarcfiter:
Treelike Comparability Graphs. Electron. Notes Discret. Math. 18: 97-102 (2004) - [j40]Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter:
Clique-independent sets of Helly circular-arc graphs. Electron. Notes Discret. Math. 18: 103-108 (2004) - [j39]Sulamita Klein, Noemi C. dos Santos, Jayme Luiz Szwarcfiter:
A representation for the modular-pairs of a cograph by modular decomposition. Electron. Notes Discret. Math. 18: 165-169 (2004) - [c11]Vânia M. Félix Dias, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter:
On the Generation of Bicliques of a Graph. CTW 2004: 109-113 - [c10]Edson Norberto Cáceres, Frank K. H. A. Dehne, Henrique Mongelli, Siang W. Song, Jayme Luiz Szwarcfiter:
A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components. Euro-Par 2004: 828-831 - [c9]Paulo Eustáquio Duarte Pinto, Fábio Protti, Jayme Luiz Szwarcfiter:
A Huffman-Based Error Detecting Code. WEA 2004: 446-457 - [c8]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
Characterization and Recognition of Generalized Clique-Helly Graphs. WG 2004: 344-354 - 2003
- [j38]Sulamita Klein, Jayme Luiz Szwarcfiter:
A Representation for the Modules of a Graph and applications. J. Braz. Comput. Soc. 9(1): 9-16 (2003) - [j37]J. Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter:
Self-clique graphs and matrix permutations. J. Graph Theory 44(3): 178-192 (2003) - [j36]Jayme Luiz Szwarcfiter, Gonzalo Navarro, Ricardo A. Baeza-Yates, Joísa de S. Oliveira, Walter Cunto, Nivio Ziviani:
Optimal binary search trees with costs depending on the access paths. Theor. Comput. Sci. 290(3): 1799-1814 (2003) - [j35]Vânia M. Félix Dias, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter:
The stable marriage problem with restricted pairs. Theor. Comput. Sci. 306(1-3): 391-405 (2003) - [c7]Jayme Luiz Szwarcfiter:
Optimal Binary Search Trees with Costs Depending on the Access Paths. CIAC 2003: 2 - [c6]Jayme Luiz Szwarcfiter:
On the Generation of Extensions of a Partially Ordered Set. CIAC 2003: 3 - [c5]Jayme Luiz Szwarcfiter:
Generating All Forest Extensions of a Partially Ordered Set. CIAC 2003: 132-139 - [c4]Carlos E. R. Alves, Edson Cáceres, Amaury Antônio de Castro Jr., Siang W. Song, Jayme Luiz Szwarcfiter:
Efficient Parallel Implementation of Transitive Closure of Digraphs. PVM/MPI 2003: 126-133 - 2002
- [j34]Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter:
On Clique-Transversals and Clique-Independent Sets. Ann. Oper. Res. 116(1-4): 71-77 (2002) - [j33]Celina M. H. de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter:
A note on transitive orientations with maximum sets of sources and sinks. Discret. Appl. Math. 120(1-3): 91-95 (2002) - [j32]Márcia R. Cerioli, Jayme Luiz Szwarcfiter:
Edge clique graphs and some classes of chordal graphs. Discret. Math. 242(1-3): 31-39 (2002) - [c3]Edson Norberto Cáceres, Siang W. Song, Jayme Luiz Szwarcfiter:
A Parallel Algorithm for Transitive Closure. IASTED PDCS 2002: 114-116 - 2001
- [j31]Márcia R. Cerioli, Jayme Luiz Szwarcfiter:
A Characterization of Edge Clique Graphs. Ars Comb. 60 (2001) - [j30]Jayme Luiz Szwarcfiter:
Preface: Volume 7. Electron. Notes Discret. Math. 7: 1 (2001) - [j29]Vânia M. Félix Dias, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter:
Stable marriages with restricted pairs. Electron. Notes Discret. Math. 7: 14-17 (2001) - [j28]J. Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter:
A sufficient condition for self-clique graphs. Electron. Notes Discret. Math. 7: 174-177 (2001) - [j27]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
On the helly defect of a graph. J. Braz. Comput. Soc. 7(3): 48-52 (2001) - [c2]Edson Cáceres, Siang W. Song, Jayme Luiz Szwarcfiter:
A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs. International Conference on Computational Science (2) 2001: 638-647 - 2000
- [j26]Ricardo C. Corrêa, Jayme Luiz Szwarcfiter:
On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets (Extended Abstract). Electron. Notes Discret. Math. 5: 71-74 (2000) - [j25]Fábio Protti, Jayme Luiz Szwarcfiter:
Clique-inverse graphs of K3-free and K4-free graphs. J. Graph Theory 35(4): 257-272 (2000)
1990 – 1999
- 1999
- [j24]Celina M. H. de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter:
Even and Odd Pairs in Comparability and in P4-comparability Graphs. Discret. Appl. Math. 91(1-3): 293-297 (1999) - [j23]Erich Prisner, Jayme Luiz Szwarcfiter:
Recognizing Clique Graphs of Directed and Rooted Path Graphs. Discret. Appl. Math. 94(1-3): 321-328 (1999) - [j22]Celina M. H. de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter:
Linear-time Algorithms for Maximum Sets of Sources and sinks. Electron. Notes Discret. Math. 3: 230-234 (1999) - [j21]Valmir Carneiro Barbosa, Jayme Luiz Szwarcfiter:
Generating all the Acyclic Orientations of an Undirected Graph. Inf. Process. Lett. 72(1-2): 71-74 (1999) - 1998
- [j20]Carmen Ortiz, Nelson Maculan, Jayme Luiz Szwarcfiter:
Characterizing and Edge-colouring Split-indifference Graphs. Discret. Appl. Math. 82(1-3): 209-217 (1998) - [j19]Cláudio Leonardo Lucchesi, Célia Picinin de Mello, Jayme Luiz Szwarcfiter:
On clique-complete graphs. Discret. Math. 183(1-3): 247-254 (1998) - [j18]Claudson F. Bornstein, Jayme Luiz Szwarcfiter:
Iterated clique graphs with increasing diameters. J. Graph Theory 28(3): 147-154 (1998) - 1997
- [j17]Jayme Luiz Szwarcfiter:
Recognizing Clique-Helly Graphs. Ars Comb. 45 (1997) - [c1]Fábio Protti, Felipe M. G. França, Jayme Luiz Szwarcfiter:
On Computing All Maximal Cliques Distributedly. IRREGULAR 1997: 37-48 - 1995
- [j16]Jayme Luiz Szwarcfiter:
On edge transitivity of directed graphs. Discret. Math. 141(1-3): 227-235 (1995) - [j15]Claudson F. Bornstein, Jayme Luiz Szwarcfiter:
On clique convergent graphs. Graphs Comb. 11(3): 213-220 (1995) - 1994
- [j14]Jayme Luiz Szwarcfiter, Guy Chaty:
Enumerating the Kernels of a Directed Graph with no Odd Circuits. Inf. Process. Lett. 51(3): 149-153 (1994) - [j13]Jayme Luiz Szwarcfiter, Claudson F. Bornstein:
Clique Graphs of Chordal and Path Graphs. SIAM J. Discret. Math. 7(2): 331-336 (1994) - 1993
- [j12]Edson Cáceres, Narsingh Deo, Shivakumar Sastry, Jayme Luiz Szwarcfiter:
On Finding Euler Tours in Parallel. Parallel Process. Lett. 3: 223-231 (1993)
1980 – 1989
- 1987
- [j11]Jacek Blazewicz, Wieslaw Kubiak, Hans Röck, Jayme Luiz Szwarcfiter:
Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints. Acta Informatica 24(5): 513-524 (1987) - [j10]Jayme Luiz Szwarcfiter:
Job shop scheduling with unit time operations under resource constraints and release dates. Discret. Appl. Math. 18(2): 227-233 (1987) - [j9]Jayme Luiz Szwarcfiter:
A Note on the Computation of the k-Closure of a Graph. Inf. Process. Lett. 24(4): 279-280 (1987) - 1985
- [j8]Jayme Luiz Szwarcfiter, Ronaldo C. M. Persiano, Antonio A. F. Oliveira:
Orientations with single source and sink. Discret. Appl. Math. 10(3): 313-321 (1985) - [j7]Jayme Luiz Szwarcfiter:
On digraphs with a rooted tree structure. Networks 15(1): 49-57 (1985) - 1984
- [j6]Jayme Luiz Szwarcfiter:
Optimal Multiway Search Trees for Variable Size Keys. Acta Informatica 21: 47-60 (1984) - 1982
- [j5]Alon Itai, Christos H. Papadimitriou, Jayme Luiz Szwarcfiter:
Hamilton Paths in Grid Graphs. SIAM J. Comput. 11(4): 676-686 (1982)
1970 – 1979
- 1979
- [j4]Jayme Luiz Szwarcfiter:
Systems of Distinct Representatives for k Families of Sets. Inf. Process. Lett. 9(5): 195-196 (1979) - 1978
- [j3]Jayme Luiz Szwarcfiter, L. B. Wilson:
Some Properties of Ternary Trees. Comput. J. 21(1): 66-72 (1978) - 1974
- [j2]Donald E. Knuth, Jayme Luiz Szwarcfiter:
A Structured Program to Generate all Topological Sorting Arrangements. Inf. Process. Lett. 2(6): 153-157 (1974) - [j1]Donald E. Knuth, Jayme Luiz Szwarcfiter:
Erratum: A Structured Program to Generate all Topological Sorting Arrangements. Inf. Process. Lett. 3(2): 64 (1974)
Coauthor Index
Flavia Bonomo-Braberman
aka: Flavia Bonomo
aka: Flavia Bonomo
Guillermo Durán
aka: Guillermo Alfredo Durán
aka: Guillermo Alfredo Durán
Celina M. H. de Figueiredo
aka: Celina Miraglia Herrera de Figueiredo
aka: Celina Miraglia Herrera de Figueiredo
Carlos V. G. C. Lima
aka: Carlos Vinícius G. C. Lima
aka: Carlos Vinícius G. C. Lima
Julliano Rosa Nascimento
aka: Julliano R. Nascimento
aka: Julliano R. Nascimento
Fabiano de S. Oliveira
aka: Fabiano de Souza Oliveira
aka: Fabiano de Souza Oliveira
Paulo E. D. Pinto
aka: Paulo Eustáquio Duarte Pinto
aka: Paulo Eustáquio Duarte Pinto
Vinícius G. P. de Sá
aka: Vinícius Gusmão Pereira de Sá
aka: Vinícius Gusmão Pereira de Sá
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 2024-12-02 22:29 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:
