The following pages link to Jayme Luiz Szwarcfiter (Q712274):
Displaying 50 items.
- (Q234384) (redirect page) (← links)
- Generating all the acyclic orientations of an undirected graph (Q294704) (← links)
- Near-linear-time algorithm for the geodetic Radon number of grids (Q299103) (← links)
- On \(f\)-reversible processes on graphs (Q324792) (← links)
- Efficient and perfect domination on circular-arc graphs (Q324824) (← links)
- On unit interval graphs with integer endpoints (Q324887) (← links)
- On recognition of threshold tolerance graphs and their complements (Q344853) (← links)
- On neighborhood-Helly graphs (Q344856) (← links)
- Algorithmic and structural aspects of the \(P_3\)-Radon number (Q363552) (← links)
- On the Carathéodory number of interval and graph convexities (Q392186) (← links)
- The colorful Helly theorem and general hypergraphs (Q412268) (← links)
- Arboricity, \(h\)-index, and dynamic algorithms (Q418737) (← links)
- Unit and single point interval graphs (Q427904) (← links)
- Exact and approximation algorithms for error-detecting even codes (Q441883) (← links)
- An upper bound on the \(P_3\)-Radon number (Q442343) (← links)
- A faster algorithm for the cluster editing problem on proper interval graphs (Q495665) (← links)
- Scheduling problem with multi-purpose parallel machines (Q496686) (← links)
- On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs (Q510982) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
- On counting interval lengths of interval graphs (Q531590) (← links)
- Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
- Irreversible conversion of graphs (Q551200) (← links)
- On extensions, linear extensions, upsets and downsets of ordered sets (Q556831) (← links)
- Generating bicliques of a graph in lexicographic order (Q557825) (← links)
- Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
- Characterization and representation problems for intersection betweennesses (Q628325) (← links)
- Reversible iterative graph processes (Q690472) (← links)
- Long cycles and paths in distance graphs (Q712275) (← links)
- Mixed unit interval graphs (Q713160) (← links)
- Thinness of product graphs (Q831864) (← links)
- The Helly property on subfamilies of limited size (Q834991) (← links)
- Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs (Q839781) (← links)
- Complexity aspects of generalized Helly hypergraphs (Q845662) (← links)
- On transitive orientations with restricted covering graphs (Q845912) (← links)
- Forbidden induced subgraphs for bounded \(p\)-intersection number (Q898105) (← links)
- Algorithms for finding clique-transversals of graphs (Q940841) (← links)
- Some remarks on the geodetic number of a graph (Q965962) (← links)
- Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs (Q975464) (← links)
- The clique operator on circular-arc graphs (Q987670) (← links)
- Complexity results related to monophonic convexity (Q987671) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- On the computation of the hull number of a graph (Q1045055) (← links)
- Optimal multiway search trees for variable size keys (Q1053461) (← links)
- Orientations with single source and sink (Q1057281) (← links)
- (Q1084858) (redirect page) (← links)
- Minimizing mean flow time with parallel processors and resource constraints (Q1084859) (← links)
- Job shop scheduling with unit time operations under resource constraints and release dates (Q1098767) (← links)
- A note on the computation on the k-closure of a graph (Q1108040) (← links)
- Systems of distinct representatives for k families of sets (Q1135111) (← links)
- Even and odd pairs in comparability and in \(P_4\)-comparability graphs (Q1283809) (← links)
