Jayme Luiz Szwarcfiter

From MaRDI portal
Person:712274

Available identifiers

zbMath Open szwarcfiter.jayme-luizWikidataQ10306481 ScholiaQ10306481MaRDI QIDQ712274

List of research outcomes

PublicationDate of PublicationType
Linear‐time algorithms for eliminating claws in graphs2023-11-29Paper
On distance graph coloring problems2023-11-21Paper
Weighted connected matchings2023-07-26Paper
Disconnected matchings2023-04-26Paper
Disconnected matchings2023-03-30Paper
FPT and kernelization algorithms for the induced tree problem2023-03-22Paper
Precedence thinness in graphs2022-11-02Paper
On subclasses of interval count two and on Fishburn's conjecture2022-11-02Paper
On the computational complexity of the bipartizing matching problem2022-09-26Paper
Restricted Hamming–Huffman trees2022-07-22Paper
On the computational complexity of the Helly number in the \(P_3\) and related convexities2022-04-27Paper
Two problems on interval counting2022-04-27Paper
Thinness of product graphs2022-03-24Paper
A polynomial time algorithm for geodetic hull number for complementary prisms2022-02-28Paper
Minimum Number of Bends of Paths of Trees in a Grid Embedding2021-09-06Paper
Partitioning a graph into complementary subgraphs2021-07-28Paper
B1-EPG representations using block-cutpoint trees2021-06-09Paper
Linear-time algorithms for eliminating claws in graphs2021-04-21Paper
https://portal.mardi4nfdi.de/entity/Q33866162021-01-05Paper
Partitioning a graph into complementary subgraphs2020-07-22Paper
Precedence thinness in graphs2020-06-30Paper
Thinness of product graphs2020-06-30Paper
Constant threshold intersection graphs of orthodox paths in trees2020-05-29Paper
Modelling and solving the perfect edge domination problem2020-04-27Paper
Bipartizing with a matching2019-10-11Paper
On the \(P_3\)-hull number of some products of graphs2018-12-18Paper
And/or-convexity: a graph convexity based on processes and deadlock models2018-06-12Paper
Perfect edge domination: hard and solvable cases2018-06-12Paper
A computational study of \(f\)-reversible processes on graphs2018-05-24Paper
Recognition and characterization of unit interval graphs with integer endpoints2018-05-24Paper
The convexity of induced paths of order three and applications: complexity aspects2018-02-22Paper
Generalized threshold processes on graphs2017-09-07Paper
On the geodetic rank of a graph2017-07-25Paper
Decycling with a matching2017-06-13Paper
Exact algorithms for minimum weighted dominating induced matching2017-04-12Paper
On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs2017-02-14Paper
On recognition of threshold tolerance graphs and their complements2016-11-24Paper
On neighborhood-Helly graphs2016-11-24Paper
On \(f\)-reversible processes on graphs2016-10-17Paper
Efficient and perfect domination on circular-arc graphs2016-10-17Paper
On unit interval graphs with integer endpoints2016-10-17Paper
https://portal.mardi4nfdi.de/entity/Q28160712016-07-01Paper
Near-linear-time algorithm for the geodetic Radon number of grids2016-06-22Paper
Generating all the acyclic orientations of an undirected graph2016-06-16Paper
Forbidden induced subgraphs for bounded \(p\)-intersection number2015-12-08Paper
Scheduling problem with multi-purpose parallel machines2015-09-22Paper
A faster algorithm for the cluster editing problem on proper interval graphs2015-09-15Paper
https://portal.mardi4nfdi.de/entity/Q52492362015-04-30Paper
https://portal.mardi4nfdi.de/entity/Q49829222015-04-13Paper
https://portal.mardi4nfdi.de/entity/Q49823602015-04-09Paper
The Maximum Number of Dominating Induced Matchings2015-03-24Paper
https://portal.mardi4nfdi.de/entity/Q29285822014-11-10Paper
Fast algorithms for some dominating induced matching problems2014-06-23Paper
Graphs of interval count two with a given partition2014-06-23Paper
https://portal.mardi4nfdi.de/entity/Q54199672014-06-11Paper
The Carathéodory number of the \(P_3\) convexity of chordal graphs2014-05-06Paper
Characterization of classical graph classes by weighted clique graphs2014-05-05Paper
O(n) Time Algorithms for Dominating Induced Matching Problems2014-03-31Paper
https://portal.mardi4nfdi.de/entity/Q57473802014-02-14Paper
On defensive alliances and strong global offensive alliances2014-02-07Paper
https://portal.mardi4nfdi.de/entity/Q53967512014-02-03Paper
An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching2014-01-14Paper
On the Carathéodory number of interval and graph convexities2014-01-13Paper
Towards a Provably Resilient Scheme for Graph-Based Watermarking2013-12-06Paper
https://portal.mardi4nfdi.de/entity/Q28573272013-11-01Paper
https://portal.mardi4nfdi.de/entity/Q28574362013-11-01Paper
The Colorful Helly Property for Hypergraphs2013-10-10Paper
Algorithmic and structural aspects of the \(P_3\)-Radon number2013-09-03Paper
Short Models for Unit Interval Graphs2013-07-19Paper
On the Convexity of Paths of Length Two in Undirected Graphs2013-07-04Paper
Normal Helly circular-arc graphs and its subclasses2013-04-25Paper
Unit Interval Graphs of Open and Closed Intervals2013-04-19Paper
Induced Decompositions of Graphs2013-04-19Paper
Characterization and recognition of Radon-independent sets in split graphs2013-03-21Paper
The arboreal jump number of an order2013-03-20Paper
Exact algorithms for dominating induced matchings2013-01-31Paper
On the Carathéodory Number for the Convexity of Paths of Order Three2013-01-04Paper
On the convexity number of graphs2012-12-27Paper
Reversible iterative graph processes2012-11-27Paper
On the geodetic Radon number of grids2012-11-22Paper
Mixed unit interval graphs2012-10-26Paper
https://portal.mardi4nfdi.de/entity/Q29184692012-10-06Paper
https://portal.mardi4nfdi.de/entity/Q29184712012-10-06Paper
https://portal.mardi4nfdi.de/entity/Q29184742012-10-06Paper
Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs,2012-09-04Paper
An upper bound on the \(P_3\)-Radon number2012-08-10Paper
Exact and approximation algorithms for error-detecting even codes2012-08-08Paper
On the Radon Number for P 3-Convexity2012-06-29Paper
Unit and single point interval graphs2012-06-18Paper
Arboricity, \(h\)-index, and dynamic algorithms2012-05-30Paper
Scheduling on parallel machines considering job-machine dependency constraints2012-05-13Paper
The colorful Helly theorem and general hypergraphs2012-05-04Paper
On subbetweennesses of trees: hardness, algorithms, and characterizations2012-04-22Paper
https://portal.mardi4nfdi.de/entity/Q30945292011-10-25Paper
Connectivity and diameter in distance graphs2011-08-16Paper
Partitioning a graph into convex sets2011-08-09Paper
Irreversible conversion of graphs2011-07-14Paper
On counting interval lengths of interval graphs2011-04-19Paper
Powers of cycles, powers of paths, and distance graphs2011-04-19Paper
Uma Caracterização de Grafos Estrelados2011-04-04Paper
Casamentos Estáveis com Casais Forçados e Casais Proibidos2011-04-04Paper
Characterization and representation problems for intersection betweennesses2011-03-10Paper
Linear-time recognition of Helly circular-arc models and graphs2011-03-02Paper
On the Hull Number of Triangle-Free Graphs2010-12-03Paper
Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search2010-12-01Paper
Long cycles and paths in distance graphs2010-10-28Paper
Complexity aspects of the Helly property: graphs and hypergraphs2010-10-13Paper
Efficient construction of unit circular-arc models2010-08-16Paper
The clique operator on circular-arc graphs2010-08-13Paper
Complexity results related to monophonic convexity2010-08-13Paper
Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs2010-06-09Paper
Some remarks on the geodetic number of a graph2010-04-27Paper
Faster recognition of clique-Helly and hereditary clique-Helly graphs2010-03-24Paper
Biclique graphs and biclique matrices2010-03-15Paper
Complexity aspects of generalized Helly hypergraphs2010-01-29Paper
On transitive orientations with restricted covering graphs2010-01-29Paper
Cycles, Paths, Connectivity and Diameter in Distance Graphs2010-01-21Paper
Characterizations and recognition of circular-arc graphs and subclasses: a survey2009-12-15Paper
On the computation of the hull number of a graph2009-12-15Paper
Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs2009-09-03Paper
The Helly property on subfamilies of limited size2009-08-27Paper
Applying modular decomposition to parameterized cluster editing problems2009-08-06Paper
Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code2009-06-03Paper
https://portal.mardi4nfdi.de/entity/Q36158002009-03-24Paper
Unit Circular-Arc Graph Representations and Feasible Circulations2009-03-16Paper
Algorithms for finding clique-transversals of graphs2008-09-03Paper
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs2008-07-15Paper
Proper Helly Circular-Arc Graphs2008-07-01Paper
Convex Partitions of Graphs2008-06-05Paper
Linear-Interval Dimension and PI Orders2008-06-05Paper
On cliques of Helly Circular-arc Graphs2008-06-05Paper
Algorithmic Aspects of Monophonic Convexity2008-06-05Paper
Clique trees of chordal graphs: leafage and 3-asteroidals2008-06-05Paper
Applying Modular Decomposition to Parameterized Bicluster Editing2008-06-03Paper
https://portal.mardi4nfdi.de/entity/Q53877312008-05-27Paper
On the strong \(p\)-Helly property2008-04-16Paper
Biclique-Helly graphs2008-03-14Paper
Characterization and recognition of generalized clique-Helly graphs2007-11-30Paper
On the generation of bicliques of a graph2007-09-19Paper
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs2007-09-10Paper
A representation for the modular-pairs of a P4-reducible graph by modular decomposition2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34396642007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34396942007-05-29Paper
On the generation of bicliques of a graph2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34294902007-04-02Paper
https://portal.mardi4nfdi.de/entity/Q34286312007-03-29Paper
https://portal.mardi4nfdi.de/entity/Q34286692007-03-29Paper
Algorithms for clique-independent sets on subclasses of circular-arc graphs2006-08-17Paper
On balanced graphs2006-01-13Paper
Graph-Theoretic Concepts in Computer Science2005-12-08Paper
https://portal.mardi4nfdi.de/entity/Q57084952005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q57084962005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q57085072005-11-18Paper
Euro-Par 2004 Parallel Processing2005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q54614462005-07-26Paper
Generating bicliques of a graph in lexicographic order2005-06-30Paper
On extensions, linear extensions, upsets and downsets of ordered sets2005-06-23Paper
Parity codes2005-06-07Paper
https://portal.mardi4nfdi.de/entity/Q48103692004-09-06Paper
The stable marriage problem with restricted pairs.2004-03-14Paper
Self‐clique graphs and matrix permutations2004-02-03Paper
https://portal.mardi4nfdi.de/entity/Q44074482004-01-07Paper
https://portal.mardi4nfdi.de/entity/Q44374862003-12-02Paper
https://portal.mardi4nfdi.de/entity/Q44374872003-12-02Paper
https://portal.mardi4nfdi.de/entity/Q44375032003-12-02Paper
Optimal binary search trees with costs depending on the access paths.2003-08-17Paper
On clique-transversals and clique-independent sets2003-01-27Paper
Edge clique graphs and some classes of chordal graphs2002-11-17Paper
A note on transitive orientations with maximum sets of sources and sinks2002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q45327522002-06-05Paper
https://portal.mardi4nfdi.de/entity/Q27796052002-04-15Paper
https://portal.mardi4nfdi.de/entity/Q27179192001-10-30Paper
https://portal.mardi4nfdi.de/entity/Q27414552001-10-24Paper
https://portal.mardi4nfdi.de/entity/Q27415012001-10-24Paper
https://portal.mardi4nfdi.de/entity/Q27413772001-09-23Paper
Clique-inverse graphs ofK3-free andK4-free graphs2001-08-16Paper
https://portal.mardi4nfdi.de/entity/Q44892442000-12-13Paper
https://portal.mardi4nfdi.de/entity/Q49400142000-03-01Paper
Recognizing clique graphs of directed and rooted path graphs1999-12-05Paper
https://portal.mardi4nfdi.de/entity/Q42429661999-09-10Paper
Even and odd pairs in comparability and in \(P_4\)-comparability graphs1999-05-31Paper
On clique-complete graphs1998-09-07Paper
Characterizing and edge-colouring split-indifference graphs1998-06-02Paper
Sources and sinks in comparability graphs1997-09-29Paper
On clique convergent graphs1996-07-14Paper
On edge transitivity of directed graphs1995-11-09Paper
Enumerating the kernels of a directed graph with no odd circuits1995-09-19Paper
https://portal.mardi4nfdi.de/entity/Q43043811994-10-10Paper
Clique Graphs of Chordal and Path Graphs1994-06-19Paper
https://portal.mardi4nfdi.de/entity/Q39766451992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q34702461988-01-01Paper
Minimizing mean flow time with parallel processors and resource constraints1987-01-01Paper
Job shop scheduling with unit time operations under resource constraints and release dates1987-01-01Paper
A note on the computation on the k-closure of a graph1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37893671987-01-01Paper
Orientations with single source and sink1985-01-01Paper
On digraphs with a rooted tree structure1985-01-01Paper
Optimal multiway search trees for variable size keys1984-01-01Paper
Hamilton Paths in Grid Graphs1982-01-01Paper
Systems of distinct representatives for k families of sets1979-01-01Paper
Some properties of ternary trees1978-01-01Paper
A search strategy for the elementary cycles of a directed graph1976-01-01Paper
A structured program to generate all topological sorting arrangements1974-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jayme Luiz Szwarcfiter