Jayme Luiz Szwarcfiter | Academic Influence

Jayme Luiz Szwarcfiter's AcademicInfluence.com Rankings

Jayme Luiz Szwarcfiter

Computer Science

#3604

World Rank

#3786

Historical Rank

computer-science Degrees

Jayme Luiz Szwarcfiter

Mathematics

#7741

World Rank

#10507

Historical Rank

Combinatorics

#95

World Rank

#103

Historical Rank

Graph Theory

#112

World Rank

#120

Historical Rank

Measure Theory

#3060

World Rank

#3629

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Jayme Luiz Szwarcfiter's Degrees

Bachelors Mathematics Federal University of Rio de Janeiro

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Jayme Luiz Szwarcfiter Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jayme Luiz Szwarcfiter is a computer scientist in Brazil. Biography Szwarcfiter graduated in 1967 in electronic engineering from the Federal University of Rio de Janeiro . He received his MA in 1971 from COPPE. In 1975 he obtained his PhD in computer science from the University of Newcastle Upon Tyne, England, under supervision of Leslie Blackett Wilson. He is currently a professor emeritus at UFRJ. The Journal of the Brazilian Computer Society dedicated a special edition in 2001 to Szwarcfiter's major publications. Among others, he has written joint articles with Donald E. Knuth and Christos Papadimitriou.

(See a Problem?)

Jayme Luiz Szwarcfiter's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Hamilton Paths in Grid Graphs (1982) (477)
Irreversible conversion of graphs (2011) (116)
A Structured Program to Generate all Topological Sorting Arrangements (1974) (93)
On the computation of the hull number of a graph (2009) (84)
Complexity results related to monophonic convexity (2010) (82)
Applying Modular Decomposition to Parameterized Cluster Editing Problems (2008) (69)
A Survey on Clique Graphs (2003) (63)
Some remarks on the geodetic number of a graph (2010) (60)
On Balanced Graphs (2006) (59)
Recognizing Clique-Helly Graphs (1997) (52)
Characterizations and recognition of circular-arc graphs and subclasses: A survey (2009) (48)
On the generation of bicliques of a graph (2007) (46)
Clique Graphs of Chordal and Path Graphs (1994) (45)
A search strategy for the elementary cycles of a directed graph (1976) (44)
Generating bicliques of a graph in lexicographic order (2005) (43)
On Clique-Transversals and Clique-Independent Sets (2002) (42)
On the Carathéodory Number for the Convexity of Paths of Order Three (2011) (40)
On the Hull Number of Triangle-Free Graphs (2009) (38)
Generating all the Acyclic Orientations of an Undirected Graph (1999) (36)
Isomorphism of graph classes related to the circular-ones property (2012) (35)
Arboricity, h-index, and dynamic algorithms (2010) (34)
Biclique graphs and biclique matrices (2010) (33)
On Finding Euler Tours in Parallel (1993) (31)
Linear-Time Recognition of Helly Circular-Arc Models and Graphs (2011) (31)
On clique-perfect and K-perfect graphs (2006) (31)
Complexity aspects of the Helly property: graphs and hypergraphs. (2009) (29)
Characterizing and Edge-colouring Split-indifference Graphs (1998) (29)
Partitioning a graph into convex sets (2011) (28)
The stable marriage problem with restricted pairs (2003) (28)
Minimizing mean flow-time with parallel processors and resource constraints (1987) (27)
Normal Helly circular-arc graphs and its subclasses (2013) (27)
Algorithmic Aspects of Monophonic Convexity (2008) (27)
On clique-complete graphs (1998) (25)
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs (2006) (25)
On clique convergent graphs (1995) (24)
Convex Partitions of Graphs induced by Paths of Order Three (2010) (24)
On the Convexity Number of Graphs (2012) (24)
The clique operator on circular-arc graphs (2010) (23)
Applying Modular Decomposition to Parameterized Bicluster Editing (2006) (22)
Graphs with few P4's under the convexity of paths of order three (2015) (22)
Self‐clique graphs and matrix permutations (2003) (21)
Faster recognition of clique-Helly and hereditary clique-Helly graphs (2007) (21)
Powers of cycles, powers of paths, and distance graphs (2011) (20)
Unit Interval Graphs of Open and Closed Intervals (2013) (20)
On the Carathéodory number of interval and graph convexities (2013) (20)
On the Convexity of Paths of Length Two in Undirected Graphs (2009) (20)
Unit Circular-Arc Graph Representations and Feasible Circulations (2008) (20)
Proper Helly Circular-Arc Graphs (2007) (18)
Recognizing Clique Graphs of Directed and Rooted Path Graphs (1999) (17)
The convexity of induced paths of order three (2013) (17)
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (2008) (17)
Scheduling unit — time tasks on flow — shops under resource constraints (1988) (16)
Efficient construction of unit circular-arc models (2006) (16)
Biclique-Helly Graphs (2007) (15)
On Hereditary Helly Classes of Graphs (2008) (15)
The Carathéodory number of the P3 convexity of chordal graphs (2014) (14)
Even and Odd Pairs in Comparability and in P4-comparability Graphs (1999) (14)
Mixed unit interval graphs (2012) (14)
Characterizing Intersection Graphs of Substars of a Star (2006) (14)
On the geodetic rank of a graph (2017) (14)
Algorithms for clique-independent sets on subclasses of circular-arc graphs (2006) (13)
Enumerating the Kernels of a Directed Graph with no Odd Circuits (1994) (13)
Chapter 3 – SCHEDULING INDEPENDENT FIXED-TYPE TASKS (1989) (13)
Algorithms for finding clique-transversals of graphs (2007) (13)
On the contour of graphs (2013) (13)
Computational aspects of the Helly property: a survey (2006) (13)
Linear-Interval Dimension and PI Orders (2008) (12)
A Characterization of Edge Clique Graphs (2001) (12)
Edge clique graphs and some classes of chordal graphs (2002) (12)
On counting interval lengths of interval graphs (2011) (12)
Iterated clique graphs with increasing diameters (1998) (12)
Fast algorithms for some dominating induced matching problems (2014) (11)
Short Models for Unit Interval Graphs (2009) (11)
Optimal binary search trees with costs depending on the access paths (2003) (11)
An upper bound on the P3-Radon number (2012) (11)
Clique-inverse graphs of bipartite graphs (2004) (11)
Towards a Provably Resilient Scheme for Graph-Based Watermarking (2013) (11)
On cliques of Helly Circular-arc Graphs (2008) (11)
Exact algorithms for dominating induced matchings (2013) (10)
Algorithmic and structural aspects of the P3-Radon number (2013) (10)
Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components (2004) (10)
On the strong p-Helly property (2008) (10)
Software control and intellectual property protection in cyber-physical systems (2016) (10)
An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching (2013) (10)
Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs (2009) (10)
Connectivity and diameter in distance graphs (2011) (10)
Convex Partitions of Graphs (2007) (9)
The convexity of induced paths of order three and applications: Complexity aspects (2017) (9)
Characterization and recognition of generalized clique-Helly graphs (2004) (9)
On recognition of threshold tolerance graphs and their complements (2017) (9)
Decycling with a matching (2017) (8)
Scheduling problem with multi-purpose parallel machines (2014) (8)
A sufficient condition for self-clique graphs (2001) (8)
An upper bound on the P 3-Radon number Mitre (2012) (8)
Complexity aspects of the computation of the rank of a graph (2014) (8)
Efficient Parallel Implementation of Transitive Closure of Digraphs (2003) (8)
Sources and Sinks in Comparability Graphs (1997) (7)
Complexity aspects of generalized Helly hypergraphs (2006) (7)
And/or-convexity: a graph convexity based on processes and deadlock models (2018) (7)
On the geodetic Radon number of grids (2013) (7)
The South Zone: Distributed Algorithms for Alliances (2011) (7)
Unit and single point interval graphs (2012) (7)
Induced Decompositions of Graphs (2013) (7)
Efficient and Perfect domination on circular-arc graphs (2015) (7)
On a conjecture concerning helly circle graphs (2003) (7)
Reversible iterative graph processes (2012) (7)
A Huffman-Based Error Detecting Code (2004) (6)
Graphs of interval count two with a given partition (2014) (6)
Clique-inverse graphs of K 3 -free and K 4 -free graphs (2000) (6)
On digraphs with a rooted tree structure (1985) (6)
A Parallel Algorithm for Transitive Closure (2002) (6)
On unit interval graphs with integer endpoints (2015) (6)
Near-linear-time algorithm for the geodetic Radon number of grids (2016) (6)
Clique‐inverse graphs of K3‐free and K4‐free graphs (2000) (6)
Exact Algorithms for Minimum Weighted Dominating Induced Matching (2017) (6)
Full Characterization of a Class of Graphs Tailored for Software Watermarking (2019) (6)
Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007 (2010) (6)
Distance geometry approach for special graph coloring problems (2016) (6)
Some Properties of Ternary Trees (1978) (6)
A Note on the Computation of the k-Closure of a Graph (1987) (6)
A Theoretical Framework to Formalize AGI-Hard Problems (2010) (6)
On Computing All Maximal Cliques Distributedly (1997) (6)
Long cycles and paths in distance graphs (2010) (6)
The Maximum Number of Dominating Induced Matchings (2015) (5)
The Helly property on subfamilies of limited size (2005) (5)
Exact and approximation algorithms for error-detecting even codes (2012) (5)
On the resilience of canonical reducible permutation graphs (2018) (5)
Improved algorithms for recognizing p (2008) (5)
Thinness of product graphs (2020) (5)
Orientations with single source and sink (1985) (5)
The interval count of interval graphs and orders: a short survey (2012) (5)
On the Geodetic Hull Number of Complementary Prisms (2018) (5)
On the P3-hull number of some products of graphs (2019) (5)
On the Radon Number for P 3-Convexity (2012) (5)
Treelike Comparability Graphs (2004) (4)
Partitioning a Graph into Complementary Subgraphs (2020) (4)
Characterization and recognition of Radon-independent sets in split graphs (2012) (4)
Linear-time Algorithms for Eliminating Claws in Graphs (2020) (4)
A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs (2001) (4)
A randomized graph-based scheme for software watermarking (2014) (4)
Clique-independent sets of Helly circular-arc graphs (2004) (4)
Perfect edge domination: hard and solvable cases (2017) (4)
Cycles, Paths, Connectivity and Diameter in Distance Graphs (2009) (4)
On distance graph coloring problems (2021) (4)
Job shop scheduling with unit time operations under resource constraints and release dates (1987) (3)
Forbidden induced subgraphs for bounded p-intersection number (2015) (3)
On the helly defect of a graph (2001) (3)
Improved Algorithms for Recognizing p-Helly and Hereditary p-Helly Hypergraphs Mitre (2008) (3)
Clique-inverse graphs of K3-free and K4-free graphs (2000) (3)
Preface: Volume 7 (2001) (3)
A forbidden subgraph characterization of path graphs (2005) (3)
The Complexity of Helly-B1 EPG Graph Recognition (2019) (3)
The kina-tree problem for chordal graphs (2015) (3)
LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium (2011) (3)
V Latin-American Algorithms, Graphs, and Optimization Symposium - Gramado, Brazil, 2009 (2012) (3)
On Minimal and Minimum Hull Sets (2013) (3)
Self-clique graphs and matrix permutations (2003) (3)
Precedence thinness in graphs (2020) (3)
Clique trees of chordal graphs: leafage and 3-asteroidals (2008) (3)
On the Computational Complexity of the Helly Number in the P3 and Related Convexities (2019) (2)
Polynomial time algorithm for the Radon number of grids in the geodetic convexity (2013) (2)
Extreme Cliques in Interval Graphs (2010) (2)
On Helly Hypergraphs with Variable Intersection Sizes (2014) (2)
Optimal multiway search trees for variable size keys (1982) (2)
The colorful Helly theorem and general hypergraphs (2012) (2)
On edge transitivity of directed graphs (1995) (2)
Unit Interval Graphs: A Story with Open Ends (2011) (2)
Parity codes (2005) (2)
Characterization of classical graph classes by weighted clique graphs (2014) (2)
Parallel transitive closure algorithm (2013) (2)
Modelling and solving the perfect edge domination problem (2018) (2)
On extensions, linear extensions, upsets and downsets of ordered sets (2005) (2)
O(n) Time Algorithms for Dominating Induced Matching Problems (2014) (2)
Subclasses of Normal Helly Circular-Arc Graphs (2011) (2)
FPT and Kernelization Algorithms for the Induced Tree Problem (2021) (2)
On the computational complexity of the bipartizing matching problem (2017) (2)
Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code (2006) (2)
Brief Announcement: On Reversible and Irreversible Conversions (2010) (2)
On defensive alliances and strong global offensive alliances (2014) (2)
A perspective on theoretical computer science in Latin America (2020) (1)
The Helly property on subhypergraphs (2005) (1)
New BSP/CGM algorithms for spanning trees (2018) (1)
Weighted Connected Matchings (2022) (1)
The Colorful Helly Property for Hypergraphs (2009) (1)
Exact Algorithms for Minimum Weighted Dominating Induced Matching (2015) (1)
On weighted clique graphs (2013) (1)
Helly and strong Helly numbers of Bk-EPG and Bk-VPG graphs (2021) (1)
On the Complexity of the P3-Hull Number of the Cartesian Product of Graphs (2016) (1)
Fair Fingerprinting Protocol for Attesting Software Misuses (2015) (1)
On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets (Extended Abstract) (2000) (1)
On transitive orientations with restricted covering graphs (2007) (1)
On neighborhood-Helly graphs (2017) (1)
A randomized scheme for software watermarking (2014) (1)
Recognition and characterization of unit interval graphs with integer endpoints (2017) (1)
On subclasses of interval count two and on Fishburn's conjecture (2022) (1)
Generating All Forest Extensions of a Partially Ordered Set (2003) (1)
Minimum Number of Bends of Paths of Trees in a Grid Embedding (2021) (1)
On optimal and near-optimal algorithms for some computational graph problems (1975) (1)
Two Problems on Interval Counting (2019) (1)
Towards a provably robust graph-based watermarking scheme (2013) (1)
A representation for the modular-pairs of a cograph by modular decomposition (2004) (1)
The Arboreal Jump Number of an Order (2013) (1)
Exact and heuristic algorithms for MinMax Channel Assignment Problems modeled as distance geometry graph coloring (2015) (1)
On the Helly Property of Some Intersection Graphs (2021) (1)
Generalized threshold processes on graphs (2017) (1)
SOME ILLUSTRATIVE EXAMPLES ON THE USE OF HASH TABLES (2015) (1)
The Graphs of Structured Programming (2015) (1)
Disconnected Matchings (2021) (1)
On a min-max conjecture for reducible digraphs (1986) (1)
Thinness and its variations on some graph families and coloring graphs of bounded thinness (2023) (1)
Parallel transitive closure algorithm (2012) (0)
On f-Reversible Processes on Graphs (2015) (0)
Perfect edge domination: hard and solvable cases (2017) (0)
Preface (2008) (0)
On subbetweennesses of trees: Hardness, algorithms, and characterizations (2011) (0)
Empirical Evaluation of Project Scheduling Algorithms for Maximization of the Net Present Value (2022) (0)
Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search (2010) (0)
A representation for the modular-pairs of a P4-reducible graph by modular decomposition (2005) (0)
A Representation for the Modules of a Graph and applications (2003) (0)
And/or-convexity: a graph convexity based on processes and deadlock models (2017) (0)
Scheduling in Parallel Machines with Small / Large Communication Delays (2014) (0)
Randomized watermarks for structured programs (2016) (0)
Bipartizing with a Matching (2018) (0)
Algorithmic and structural aspects of the P3-Radon number (2013) (0)
On the unit interval number of certain graphs (2022) (0)
FPT and kernelization algorithms for the k-in-a-tree problem (2020) (0)
Polynomial time algorithm for the k-in-a-tree problem on chordal graphs (2015) (0)
The Arboreal Jump Number of an Order (2012) (0)
Stable marriages with restricted pairs (2001) (0)
Preface (2004) (0)
Algorithms for two scheduling problems (1992) (0)
Scheduling on parallel machines considering job-machine dependency constraints (2010) (0)
On probe 2-clique graphs and probe diamond-free graphs (2015) (0)
A computational study of f-reversible processes on graphs (2017) (0)
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs 1 (2018) (0)
Graph Convexity Parameters : Complexity and Applications (2015) (0)
The interval count of interval graphs and orders: a short survey (2011) (0)
A note on transitive orientations with maximum sets of sources and sinks (2002) (0)
Preface (2009) (0)
On minimum cuts of cycles by vertices and vertex disjoint cycles (1987) (0)
Edge Intersection Graphs of Paths on a Triangular Grid (2022) (0)
D M ] 2 3 M ay 2 01 7 Perfect Edge Domination : Hard and Solvable Cases (2017) (0)
A polynomial time algorithm for geodetic hull number for complementary prisms (2022) (0)
Graph theory and algorithms (2012) (0)
Geodetic sets and periphery (2013) (0)
Full Characterization of a Class of Graphs Tailored for Software Watermarking (2019) (0)
Some New Results on Efficient and Perfect Edge Domination of Graphs (2022) (0)
On probe co-bipartite and probe diamond-free graphs (2015) (0)
On Embedding Trees in Grids (2020) (0)
Parameterized mixed cluster editing via modular decomposition (2015) (0)
Linear-time Algorithms for Maximum Sets of Sources and sinks (1999) (0)
Long cycles and paths in distance graphs Preprint (2009) (0)
On the Generation of Extensions of a Partially Ordered Set (2003) (0)
Graph theory and algorithms (2012) (0)
On the Helly Number in P3-Convexity in Graphs (2018) (0)
Data Compression and Error Detection Integration (2003) (0)
Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs, (2011) (0)
Restricted Hamming-Huffman trees (2022) (0)
Characterization and representation problems for intersection betweennesses (2011) (0)
A faster algorithm for the cluster editing problem on proper interval graphs (2015) (0)
Modelling and solving the perfect edge domination problem (2018) (0)
On the Convexity Number of Graphs (2011) (0)
B1-EPG representations using block-cutpoint trees (2021) (0)
Eliminating Odd Cycles by Removing a Matching (2017) (0)
Constant threshold intersection graphs of orthodox paths in trees (2017) (0)
Grid straight-line embeddings of trees with a minimum number of bends per path (2022) (0)
Systems of Distinct Representatives for k Families of Sets (1979) (0)
LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011 (2014) (0)

This paper list is powered by the following services:

Other Resources About Jayme Luiz Szwarcfiter

en.wikipedia.org

What Schools Are Affiliated With Jayme Luiz Szwarcfiter?

Jayme Luiz Szwarcfiter is affiliated with the following schools: