Jayme Luiz Szwarcfiter
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
24
Venues
13
Active years
2001–2023
Best venue rank
A*
Where they publish
Papers
24 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2023 | LAGOS | Mixed integer programming and quadratic programming formulations for the interval count problem. | Lvia Salgado Medeiros, Fabiano de S. Oliveira, Abilio Lucena, Jayme Luiz Szwarcfiter |
| 2022 | LATIN | Weighted Connected Matchings. | Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vincius Fernandes dos Santos, Jayme Luiz Szwarcfiter |
| 2021 | CIAC | FPT and Kernelization Algorithms for the Induced Tree Problem. | Guilherme de Castro Mendes Gomes, Vincius Fernandes dos Santos, Murilo V. G. da Silva, Jayme Luiz Szwarcfiter |
| 2021 | COCOON | Disconnected Matchings. | Guilherme de C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vincius Fernandes dos Santos, Jayme Luiz Szwarcfiter |
| 2021 | LAGOS | Minimum Number of Bends of Paths of Trees in a Grid Embedding. | Vitor Tocci Ferreira de Luca, Fabiano de Souza Oliveira, Jayme Luiz Szwarcfiter |
| 2020 | COCOON | Linear-Time Algorithms for Eliminating Claws in Graphs. | Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uverton S. Souza, Jayme Luiz Szwarcfiter |
| 2020 | WALCOM | Partitioning a Graph into Complementary Subgraphs. | Julliano Rosa Nascimento, Uverton S. Souza, Jayme Luiz Szwarcfiter |
| 2018 | COCOA | Bipartizing with a Matching. | Carlos V. G. C. Lima, Dieter Rautenbach, Uverton S. Souza, Jayme Luiz Szwarcfiter |
| 2014 | LATIN | O(n) Time Algorithms for Dominating Induced Matching Problems. | Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter |
| 2013 | ISAAC | An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching. | Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter |
| 2013 | WG | Towards a Provably Resilient Scheme for Graph-Based Watermarking. | Lucila Maria Souza Bento, Davidson R. Boccardo, Raphael Carlos Santos Machado, Vincius Gusmo Pereira de S, Jayme Luiz Szwarcfiter |
| 2012 | LATIN | On the Radon Number for P 3-Convexity. | Mitre Costa Dourado, Dieter Rautenbach, Vincius Fernandes dos Santos, Philipp Matthias Schfer, Jayme Luiz Szwarcfiter, Alexandre Toman |
| 2011 | SSS | The South Zone: Distributed Algorithms for Alliances. | Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter |
| 2009 | TAMC | Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code. | Paulo Eustquio Duarte Pinto, Fbio Protti, Jayme Luiz Szwarcfiter |
| 2009 | WG | Cycles, Paths, Connectivity and Diameter in Distance Graphs. | Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter |
| 2007 | WG | Proper Helly Circular-Arc Graphs. | Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter |
| 2006 | COCOON | Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs. | Min Chih Lin, Jayme Luiz Szwarcfiter |
| 2006 | SODA | Efficient construction of unit circular-arc models. | Min Chih Lin, Jayme Luiz Szwarcfiter |
| 2004 | EuroPar | A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components. | Edson Norberto Cceres, Frank K. H. A. Dehne, Henrique Mongelli, Siang W. Song, Jayme Luiz Szwarcfiter |
| 2004 | WG | Characterization and Recognition of Generalized Clique-Helly Graphs. | Mitre Costa Dourado, Fbio Protti, Jayme Luiz Szwarcfiter |
| 2003 | CIAC | Optimal Binary Search Trees with Costs Depending on the Access Paths. | Jayme Luiz Szwarcfiter |
| 2003 | CIAC | On the Generation of Extensions of a Partially Ordered Set. | Jayme Luiz Szwarcfiter |
| 2003 | CIAC | Generating All Forest Extensions of a Partially Ordered Set. | Jayme Luiz Szwarcfiter |
| 2001 | ICCS | A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs. | Edson Cceres, Siang W. Song, Jayme Luiz Szwarcfiter |