Jayme Luiz Szwarcfiter
Orcid: 0000-0002-7538-7305Affiliations:
- Federal University of Rio de Janeiro, Brazil
According to our database1,
Jayme Luiz Szwarcfiter
authored at least 226 papers
between 1974 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
Int. Trans. Oper. Res., January, 2024
2023
Discuss. Math. Graph Theory, 2023
Thinness and its variations on some graph families and coloring graphs of bounded thinness.
CoRR, 2023
Mixed integer programming and quadratic programming formulations for the interval count problem.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023
2022
RAIRO Theor. Informatics Appl., 2022
Inf. Process. Lett., 2022
Discret. Appl. Math., 2022
Empirical Evaluation of Project Scheduling Algorithms for Maximization of the Net Present Value.
CoRR, 2022
Ann. Oper. Res., 2022
Proceedings of the LATIN 2022: Theoretical Informatics, 2022
2021
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021
2020
Discret. Math. Theor. Comput. Sci., 2020
Discret. Appl. Math., 2020
2019
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
On the Computational Complexity of the Helly Number in the <i>P</i><sub>3</sub> and Related Convexities.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
Algorithmica, 2019
2018
Discret. Appl. Math., 2018
Discret. Appl. Math., 2018
Discret. Appl. Math., 2018
Discret. Appl. Math., 2018
Ann. Oper. Res., 2018
Proceedings of the Combinatorial Optimization and Applications, 2018
2017
Discret. Appl. Math., 2017
Algorithmica, 2017
2016
On the Complexity of the P<sub>3</sub>-Hull Number of the Cartesian Product of Graphs.
Electron. Notes Discret. Math., 2016
EURASIP J. Inf. Secur., 2016
Discret. Appl. Math., 2016
2015
Inf. Process. Lett., 2015
Electron. Notes Discret. Math., 2015
Discret. Math. Theor. Comput. Sci., 2015
Discret. Appl. Math., 2015
Polynomial time algorithm for the k-in-a-tree problem on chordal graphs.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
The Graphs of Structured Programming.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
Proceedings of the 10th International Conference on Availability, Reliability and Security, 2015
2014
Inf. Process. Lett., 2014
Discret. Math. Theor. Comput. Sci., 2014
Discret. Appl. Math., 2014
Discret. Appl. Math., 2014
Discret. Appl. Math., 2014
LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011.
Discret. Appl. Math., 2014
On Helly Hypergraphs with Variable Intersection Sizes.
Ars Comb., 2014
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014
2013
Theor. Comput. Sci., 2013
Electron. Notes Discret. Math., 2013
Discret. Math. Theor. Comput. Sci., 2013
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013
Geodetic sets and periphery.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013
2012
Theor. Comput. Sci., 2012
J. Braz. Comput. Soc., 2012
J. Braz. Comput. Soc., 2012
Inf. Process. Lett., 2012
V Latin-American Algorithms, Graphs, and Optimization Symposium - Gramado, Brazil, 2009.
Discret. Appl. Math., 2012
Proceedings of the LATIN 2012: Theoretical Informatics, 2012
Graphs with Few P4's Under the Convexity of Paths of Order Three.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012
2011
RAIRO Oper. Res., 2011
Electron. Notes Discret. Math., 2011
Electron. Notes Discret. Math., 2011
Discret. Appl. Math., 2011
Comput. Math. Appl., 2011
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011
2010
Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search.
RAIRO Theor. Informatics Appl., 2010
Electron. Notes Discret. Math., 2010
Discret. Math. Theor. Comput. Sci., 2010
Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007.
Discret. Appl. Math., 2010
Extreme Cliques in Interval Graphs.
Ars Comb., 2010
Proceedings of the Distributed Computing, 24th International Symposium, 2010
2009
Theory Comput. Syst., 2009
Electron. Notes Discret. Math., 2009
Discret. Math., 2009
Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs.
Ann. Oper. Res., 2009
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009
2008
SIAM J. Discret. Math., 2008
Electron. Notes Discret. Math., 2008
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs.
Proceedings of the Algorithm Theory, 2008
2007
Inf. Process. Lett., 2007
Inf. Process. Lett., 2007
Discret. Appl. Math., 2007
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007
2006
Discret. Appl. Math., 2006
Characterizing Intersection Graphs of Substars of a Star.
Ars Comb., 2006
On clique-perfect and K-perfect graphs.
Ars Comb., 2006
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006
2005
Electron. Notes Discret. Math., 2005
A representation for the modular-pairs of a P<sub>4</sub>-reducible graph by modular decomposition.
Electron. Notes Discret. Math., 2005
Discret. Math., 2005
2004
Electron. Notes Discret. Math., 2004
Electron. Notes Discret. Math., 2004
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004
Proceedings of the Euro-Par 2004 Parallel Processing, 2004
2003
Theor. Comput. Sci., 2003
J. Braz. Comput. Soc., 2003
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface,10th European PVM/MPI Users' Group Meeting, Venice, Italy, September 29, 2003
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003
2002
Discret. Appl. Math., 2002
A Parallel Algorithm for Transitive Closure.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002
2001
On the helly defect of a graph.
J. Braz. Comput. Soc., 2001
A Characterization of Edge Clique Graphs.
Ars Comb., 2001
Proceedings of the Computational Science - ICCS 2001, 2001
2000
Clique-inverse graphs of <i>K</i><sub>3</sub>-free and <i>K</i><sub>4</sub>-free graphs.
J. Graph Theory, 2000
On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets (Extended Abstract).
Electron. Notes Discret. Math., 2000
1999
Inf. Process. Lett., 1999
Electron. Notes Discret. Math., 1999
Discret. Appl. Math., 1999
Discret. Appl. Math., 1999
1998
Discret. Appl. Math., 1998
1997
Recognizing Clique-Helly Graphs.
Ars Comb., 1997
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997
1995
1994
Inf. Process. Lett., 1994
1993
1987
Job shop scheduling with unit time operations under resource constraints and release dates.
Discret. Appl. Math., 1987
Acta Informatica, 1987
1985
1984
1982
1979
Inf. Process. Lett., 1979
1978
1974
Erratum: A Structured Program to Generate all Topological Sorting Arrangements.
Inf. Process. Lett., 1974
Inf. Process. Lett., 1974