The following pages link to Jayme Luiz Szwarcfiter (Q712274):
Displayed 50 items.
- Recognizing clique graphs of directed and rooted path graphs (Q1293208) (← links)
- Enumerating the kernels of a directed graph with no odd circuits (Q1332748) (← links)
- Sources and sinks in comparability graphs (Q1368667) (← links)
- On clique-complete graphs (Q1382831) (← links)
- Characterizing and edge-colouring split-indifference graphs (Q1383379) (← links)
- A structured program to generate all topological sorting arrangements (Q1393277) (← links)
- Optimal binary search trees with costs depending on the access paths. (Q1401195) (← links)
- The stable marriage problem with restricted pairs. (Q1426462) (← links)
- A note on transitive orientations with maximum sets of sources and sinks (Q1613367) (← links)
- On the \(P_3\)-hull number of some products of graphs (Q1634756) (← links)
- And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288) (← links)
- Perfect edge domination: hard and solvable cases (Q1639290) (← links)
- The convexity of induced paths of order three and applications: complexity aspects (Q1701089) (← links)
- A computational study of \(f\)-reversible processes on graphs (Q1752484) (← links)
- Recognition and characterization of unit interval graphs with integer endpoints (Q1752493) (← links)
- On the geodetic Radon number of grids (Q1759818) (← links)
- On clique-transversals and clique-independent sets (Q1854773) (← links)
- On edge transitivity of directed graphs (Q1894773) (← links)
- On clique convergent graphs (Q1900516) (← links)
- On the convexity number of graphs (Q1926045) (← links)
- Characterization and recognition of Radon-independent sets in split graphs (Q1941699) (← links)
- The arboreal jump number of an order (Q1943701) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- Complexity aspects of the Helly property: graphs and hypergraphs (Q1960293) (← links)
- Fast algorithms for some dominating induced matching problems (Q2015144) (← links)
- Graphs of interval count two with a given partition (Q2015148) (← links)
- Linear-time algorithms for eliminating claws in graphs (Q2019430) (← links)
- Precedence thinness in graphs (Q2091785) (← links)
- On subclasses of interval count two and on Fishburn's conjecture (Q2091806) (← links)
- On the computational complexity of the Helly number in the \(P_3\) and related convexities (Q2132356) (← links)
- Two problems on interval counting (Q2132398) (← links)
- Modelling and solving the perfect edge domination problem (Q2174880) (← links)
- Constant threshold intersection graphs of orthodox paths in trees (Q2184664) (← links)
- Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
- Partitioning a graph into convex sets (Q2275456) (← links)
- Bipartizing with a matching (Q2327112) (← links)
- On the geodetic rank of a graph (Q2364865) (← links)
- Faster recognition of clique-Helly and hereditary clique-Helly graphs (Q2379939) (← links)
- Generalized threshold processes on graphs (Q2402258) (← links)
- On subbetweennesses of trees: hardness, algorithms, and characterizations (Q2429121) (← links)
- On defensive alliances and strong global offensive alliances (Q2434727) (← links)
- Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
- The Carathéodory number of the \(P_3\) convexity of chordal graphs (Q2449132) (← links)
- Characterization and recognition of generalized clique-Helly graphs (Q2462382) (← links)
- Biclique-Helly graphs (Q2478166) (← links)
- On the strong \(p\)-Helly property (Q2482102) (← links)
- Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526) (← links)
- On balanced graphs (Q2583124) (← links)
- Decycling with a matching (Q2628271) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)