Jayme Luiz Szwarcfiter

According to our database1, Jayme Luiz Szwarcfiter authored at least 208 papers between 1974 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Modelling and solving the perfect edge domination problem.
Optim. Lett., 2020

The Complexity of Helly-$B_{1}$ EPG Graph Recognition.
Discret. Math. Theor. Comput. Sci., 2020

Constant threshold intersection graphs of orthodox paths in trees.
Discret. Appl. Math., 2020

Precedence thinness in graphs.
CoRR, 2020

Thinness of product graphs.
CoRR, 2020

Linear-time Algorithms for Eliminating Claws in Graphs.
CoRR, 2020

Partitioning a Graph into Complementary Subgraphs.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

2019
New BSP/CGM algorithms for spanning trees.
Int. J. High Perform. Comput. Appl., 2019

Two Problems on Interval Counting.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On the Computational Complexity of the Helly Number in the P3 and Related Convexities.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On the P3-hull number of some products of graphs.
Discret. Appl. Math., 2019

Dijkstra graphs.
Discret. Appl. Math., 2019

The Complexity of Helly-B1 EPG Graph Recognition.
CoRR, 2019

Full Characterization of a Class of Graphs Tailored for Software Watermarking.
Algorithmica, 2019

2018
A computational study of f-reversible processes on graphs.
Discret. Appl. Math., 2018

Recognition and characterization of unit interval graphs with integer endpoints.
Discret. Appl. Math., 2018

On the resilience of canonical reducible permutation graphs.
Discret. Appl. Math., 2018

The convexity of induced paths of order three and applications: Complexity aspects.
Discret. Appl. Math., 2018

On the Geodetic Hull Number of Complementary Prisms.
CoRR, 2018

Perfect edge domination: hard and solvable cases.
Annals OR, 2018

And/or-convexity: a graph convexity based on processes and deadlock models.
Annals OR, 2018

Bipartizing with a Matching.
Proceedings of the Combinatorial Optimization and Applications, 2018

2017
Generalized threshold processes on graphs.
Theor. Comput. Sci., 2017

Decycling with a matching.
Inf. Process. Lett., 2017

On neighborhood-Helly graphs.
Discret. Appl. Math., 2017

On recognition of threshold tolerance graphs and their complements.
Discret. Appl. Math., 2017

Eliminating Odd Cycles by Removing a Matching.
CoRR, 2017

Exact Algorithms for Minimum Weighted Dominating Induced Matching.
Algorithmica, 2017

2016
On the Complexity of the P3-Hull Number of the Cartesian Product of Graphs.
Electron. Notes Discret. Math., 2016

Software control and intellectual property protection in cyber-physical systems.
EURASIP J. Inf. Secur., 2016

Forbidden induced subgraphs for bounded p-intersection number.
Discret. Math., 2016

Near-linear-time algorithm for the geodetic Radon number of grids.
Discret. Appl. Math., 2016

Distance geometry approach for special graph coloring problems.
CoRR, 2016

Dijkstra Graphs.
CoRR, 2016

2015
The Maximum Number of Dominating Induced Matchings.
Journal of Graph Theory, 2015

A faster algorithm for the cluster editing problem on proper interval graphs.
Inf. Process. Lett., 2015

Efficient and Perfect domination on circular-arc graphs.
Electron. Notes Discret. Math., 2015

On unit interval graphs with integer endpoints.
Electron. Notes Discret. Math., 2015

On f-Reversible Processes on Graphs.
Electron. Notes Discret. Math., 2015

On probe co-bipartite and probe diamond-free graphs.
Discret. Math. Theor. Comput. Sci., 2015

Graphs with few P4's under the convexity of paths of order three.
Discret. Appl. Math., 2015

Parameterized mixed cluster editing via modular decomposition.
CoRR, 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

Fair Fingerprinting Protocol for Attesting Software Misuses.
Proceedings of the 10th International Conference on Availability, Reliability and Security, 2015

2014
Fast algorithms for some dominating induced matching problems.
Inf. Process. Lett., 2014

Graphs of interval count two with a given partition.
Inf. Process. Lett., 2014

Complexity aspects of the computation of the rank of a graph.
Discret. Math. Theor. Comput. Sci., 2014

Scheduling problem with multi-purpose parallel machines.
Discret. Appl. Math., 2014

On defensive alliances and strong global offensive alliances.
Discret. Appl. Math., 2014

The Carathéodory number of the P3 convexity of chordal graphs.
Discret. Appl. Math., 2014

Characterization of classical graph classes by weighted clique graphs.
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

O(n) Time Algorithms for Dominating Induced Matching Problems.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013
On the Carathéodory number of interval and graph convexities.
Theor. Comput. Sci., 2013

The Arboreal Jump Number of an Order.
Order, 2013

Unit Interval Graphs of Open and Closed Intervals.
Journal of Graph Theory, 2013

Induced Decompositions of Graphs.
Journal of Graph Theory, 2013

Parallel transitive closure algorithm.
J. Braz. Comput. Soc., 2013

Polynomial time algorithm for the Radon number of grids in the geodetic convexity.
Electron. Notes Discret. Math., 2013

On Minimal and Minimum Hull Sets.
Electron. Notes Discret. Math., 2013

The convexity of induced paths of order three.
Electron. Notes Discret. Math., 2013

Isomorphism of graph classes related to the circular-ones property.
Discret. Math. Theor. Comput. Sci., 2013

On the geodetic Radon number of grids.
Discret. Math., 2013

Normal Helly circular-arc graphs and its subclasses.
Discret. Appl. Math., 2013

On the contour of graphs.
Discret. Appl. Math., 2013

Towards a provably robust graph-based watermarking scheme
CoRR, 2013

Exact algorithms for dominating induced matchings
CoRR, 2013

Algorithmic and structural aspects of the P 3-Radon number.
Annals OR, 2013

Towards a Provably Resilient Scheme for Graph-Based Watermarking.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching.
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
Exact and approximation algorithms for error-detecting even codes.
Theor. Comput. Sci., 2012

Arboricity, h-index, and dynamic algorithms.
Theor. Comput. Sci., 2012

Reversible iterative graph processes.
Theor. Comput. Sci., 2012

Graph theory and algorithms - Fourth Latin-American Workshop on Cliques in Graphs.
J. Braz. Comput. Soc., 2012

The interval count of interval graphs and orders: a short survey.
J. Braz. Comput. Soc., 2012

Characterization and recognition of Radon-independent sets in split graphs.
Inf. Process. Lett., 2012

On the Convexity Number of Graphs.
Graphs Comb., 2012

The colorful Helly theorem and general hypergraphs.
Eur. J. Comb., 2012

An upper bound on the P3-Radon number.
Discret. Math., 2012

Mixed unit interval graphs.
Discret. Math., 2012

Unit and single point interval graphs.
Discret. Appl. Math., 2012

V Latin-American Algorithms, Graphs, and Optimization Symposium - Gramado, Brazil, 2009.
Discret. Appl. Math., 2012

On the Radon Number for P 3-Convexity.
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
Irreversible conversion of graphs.
Theor. Comput. Sci., 2011

Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs, .
RAIRO - Operations Research, 2011

Connectivity and diameter in distance graphs.
Networks, 2011

Unit Interval Graphs: A Story with Open Ends.
Electron. Notes Discret. Math., 2011

LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium.
Electron. Notes Discret. Math., 2011

On the Carathéodory Number for the Convexity of Paths of Order Three.
Electron. Notes Discret. Math., 2011

Partitioning a graph into convex sets.
Discret. Math., 2011

Characterization and representation problems for intersection betweennesses.
Discret. Appl. Math., 2011

Powers of cycles, powers of paths, and distance graphs.
Discret. Appl. Math., 2011

On counting interval lengths of interval graphs.
Discret. Appl. Math., 2011

Subclasses of Normal Helly Circular-Arc Graphs
CoRR, 2011

On subbetweennesses of trees: Hardness, algorithms, and characterizations.
Comput. Math. Appl., 2011

Linear-Time Recognition of Helly Circular-Arc Models and Graphs.
Algorithmica, 2011

The South Zone: Distributed Algorithms for Alliances.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

2010
On the Hull Number of Triangle-Free Graphs.
SIAM J. Discret. Math., 2010

Biclique graphs and biclique matrices.
Journal of Graph Theory, 2010

Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search.
RAIRO Theor. Informatics Appl., 2010

Scheduling on parallel machines considering job-machine dependency constraints.
Electron. Notes Discret. Math., 2010

Convex Partitions of Graphs induced by Paths of Order Three.
Discret. Math. Theor. Comput. Sci., 2010

Long cycles and paths in distance graphs.
Discret. Math., 2010

Some remarks on the geodetic number of a graph.
Discret. Math., 2010

The clique operator on circular-arc graphs.
Discret. Appl. Math., 2010

Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007.
Discret. Appl. Math., 2010

Complexity results related to monophonic convexity.
Discret. Appl. Math., 2010

Extreme Cliques in Interval Graphs.
Ars Comb., 2010

Brief Announcement: On Reversible and Irreversible Conversions.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

2009
Applying Modular Decomposition to Parameterized Cluster Editing Problems.
Theory Comput. Syst., 2009

Short Models for Unit Interval Graphs.
Electron. Notes Discret. Math., 2009

Preface.
Electron. Notes Discret. Math., 2009

On the Convexity of Paths of Length Two in Undirected Graphs.
Electron. Notes Discret. Math., 2009

The Colorful Helly Property for Hypergraphs.
Electron. Notes Discret. Math., 2009

Characterizations and recognition of circular-arc graphs and subclasses: A survey.
Discret. Math., 2009

On the computation of the hull number of a graph.
Discret. Math., 2009

Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs.
Annals OR, 2009

Cycles, Paths, Connectivity and Diameter in Distance Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

2008
Unit Circular-Arc Graph Representations and Feasible Circulations.
SIAM J. Discret. Math., 2008

Improved algorithms for recognizing p.
Inf. Process. Lett., 2008

On cliques of Helly Circular-arc Graphs.
Electron. Notes Discret. Math., 2008

Preface.
Electron. Notes Discret. Math., 2008

Clique trees of chordal graphs: leafage and 3-asteroidals.
Electron. Notes Discret. Math., 2008

Algorithmic Aspects of Monophonic Convexity.
Electron. Notes Discret. Math., 2008

Linear-Interval Dimension and PI Orders.
Electron. Notes Discret. Math., 2008

On Hereditary Helly Classes of Graphs.
Discret. Math. Theor. Comput. Sci., 2008

On the strong p-Helly property.
Discret. Appl. Math., 2008

Algorithms for finding clique-transversals of graphs.
Annals OR, 2008

A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs.
Proceedings of the Algorithm Theory, 2008

2007
Faster recognition of clique-Helly and hereditary clique-Helly graphs.
Inf. Process. Lett., 2007

On transitive orientations with restricted covering graphs.
Inf. Process. Lett., 2007

Biclique-Helly Graphs.
Graphs Comb., 2007

Convex Partitions of Graphs.
Electron. Notes Discret. Math., 2007

Characterization and recognition of generalized clique-Helly graphs.
Discret. Appl. Math., 2007

Proper Helly Circular-Arc Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

2006
On Balanced Graphs.
Math. Program., 2006

Computational Aspects of the Helly Property: a Survey.
J. Braz. Comput. Soc., 2006

Complexity aspects of generalized Helly hypergraphs.
Inf. Process. Lett., 2006

Algorithms for clique-independent sets on subclasses of circular-arc graphs.
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

Efficient construction of unit circular-arc models.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Applying Modular Decomposition to Parameterized Bicluster Editing.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005
Generating bicliques of a graph in lexicographic order.
Theor. Comput. Sci., 2005

Parity codes.
RAIRO Theor. Informatics Appl., 2005

The Helly property on subfamilies of limited size.
Inf. Process. Lett., 2005

A forbidden subgraph characterization of path graphs.
Electron. Notes Discret. Math., 2005

A representation for the modular-pairs of a P4-reducible graph by modular decomposition.
Electron. Notes Discret. Math., 2005

The Helly property on subhypergraphs.
Electron. Notes Discret. Math., 2005

On extensions, linear extensions, upsets and downsets of ordered sets.
Discret. Math., 2005

2004
A representation for the modular-pairs of a cograph by modular decomposition.
Electron. Notes Discret. Math., 2004

Clique-independent sets of Helly circular-arc graphs.
Electron. Notes Discret. Math., 2004

Treelike Comparability Graphs.
Electron. Notes Discret. Math., 2004

On the generation of bicliques of a graph.
Electron. Notes Discret. Math., 2004

Preface.
Discret. Appl. Math., 2004

A Huffman-Based Error Detecting Code.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components.
Proceedings of the Euro-Par 2004 Parallel Processing, 2004

2003
Optimal binary search trees with costs depending on the access paths.
Theor. Comput. Sci., 2003

The stable marriage problem with restricted pairs.
Theor. Comput. Sci., 2003

Self-clique graphs and matrix permutations.
Journal of Graph Theory, 2003

A Representation for the Modules of a Graph and applications.
J. Braz. Comput. Soc., 2003

Efficient Parallel Implementation of Transitive Closure of Digraphs.
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

Generating All Forest Extensions of a Partially Ordered Set.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

On the Generation of Extensions of a Partially Ordered Set.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

Optimal Binary Search Trees with Costs Depending on the Access Paths.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002
Edge clique graphs and some classes of chordal graphs.
Discret. Math., 2002

A note on transitive orientations with maximum sets of sources and sinks.
Discret. Appl. Math., 2002

On Clique-Transversals and Clique-Independent Sets.
Annals OR, 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

Preface: Volume 7.
Electron. Notes Discret. Math., 2001

Stable marriages with restricted pairs.
Electron. Notes Discret. Math., 2001

A sufficient condition for self-clique graphs.
Electron. Notes Discret. Math., 2001

A Characterization of Edge Clique Graphs.
Ars Comb., 2001

A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs.
Proceedings of the Computational Science - ICCS 2001, 2001

2000
Clique-inverse graphs of K3-free and K4-free graphs.
Journal of Graph Theory, 2000

On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets (Extended Abstract).
Electron. Notes Discret. Math., 2000

1999
Generating all the Acyclic Orientations of an Undirected Graph.
Inf. Process. Lett., 1999

Linear-time Algorithms for Maximum Sets of Sources and sinks.
Electron. Notes Discret. Math., 1999

Recognizing Clique Graphs of Directed and Rooted Path Graphs.
Discret. Appl. Math., 1999

Even and Odd Pairs in Comparability and in P4-comparability Graphs.
Discret. Appl. Math., 1999

1998
Iterated clique graphs with increasing diameters.
Journal of Graph Theory, 1998

On clique-complete graphs.
Discret. Math., 1998

Characterizing and Edge-colouring Split-indifference Graphs.
Discret. Appl. Math., 1998

1997
Recognizing Clique-Helly Graphs.
Ars Comb., 1997

On Computing All Maximal Cliques Distributedly.
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997

1995
On clique convergent graphs.
Graphs Comb., 1995

On edge transitivity of directed graphs.
Discret. Math., 1995

1994
Clique Graphs of Chordal and Path Graphs.
SIAM J. Discret. Math., 1994

Enumerating the Kernels of a Directed Graph with no Odd Circuits.
Inf. Process. Lett., 1994

1993
On Finding Euler Tours in Parallel.
Parallel Process. Lett., 1993

1987
A Note on the Computation of the k-Closure of a Graph.
Inf. Process. Lett., 1987

Job shop scheduling with unit time operations under resource constraints and release dates.
Discret. Appl. Math., 1987

Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints.
Acta Informatica, 1987

1985
On digraphs with a rooted tree structure.
Networks, 1985

Orientations with single source and sink.
Discret. Appl. Math., 1985

1984
Optimal Multiway Search Trees for Variable Size Keys.
Acta Informatica, 1984

1982
Hamilton Paths in Grid Graphs.
SIAM J. Comput., 1982

1979
Systems of Distinct Representatives for k Families of Sets.
Inf. Process. Lett., 1979

1978
Some Properties of Ternary Trees.
Comput. J., 1978

1974
Erratum: A Structured Program to Generate all Topological Sorting Arrangements.
Inf. Process. Lett., 1974

A Structured Program to Generate all Topological Sorting Arrangements.
Inf. Process. Lett., 1974


  Loading...