The following pages link to N. V. R. Mahadev (Q686489):
Displaying 31 items.
- The cyclic compact open-shop scheduling problem (Q686491) (← links)
- Bipartite bithreshold graphs (Q688258) (← links)
- Stability in CAN-free graphs (Q762505) (← links)
- The struction of a graph: Application to CN-free graphs (Q1068855) (← links)
- A note on superbrittle graphs (Q1081614) (← links)
- Strict 2-threshold graphs (Q1111574) (← links)
- A note on perfect orders (Q1124614) (← links)
- Longest cycles in threshold graphs (Q1343260) (← links)
- Preassignment requirements in chromatic scheduling (Q1363744) (← links)
- Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties (Q1368414) (← links)
- On simplicial and co-simplicial vertices in graphs. (Q1428559) (← links)
- Feasible edge colorings of trees with cardinality constraints (Q1579549) (← links)
- On uniquely intersectable graphs (Q1817570) (← links)
- Threshold graphs and related topics (Q1899209) (← links)
- Restrictions and preassignments in preemptive open shop scheduling (Q1917354) (← links)
- Corrigendum to ``Polar cographs'' (Q2449119) (← links)
- On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal? (Q2770140) (← links)
- (Q3318808) (← links)
- On a conjecture of wang and williams (Q3358771) (← links)
- Bithreshold Graphs (Q3701461) (← links)
- Some properties of 2-threshold graphs (Q3824454) (← links)
- (Q3972037) (← links)
- (Q4229265) (← links)
- Equistable graphs (Q4290580) (← links)
- Edge-Chromatic Scheduling with Simultaneity Constraints (Q4302272) (← links)
- Scheduling Periodic Jobs Compactly Within A Fixed Time Period In Open Shops (Q4304829) (← links)
- (Q4393326) (← links)
- (Q4422493) (← links)
- Polar cographs (Q5899394) (← links)
- Polar cographs (Q5900347) (← links)
- Amenable colorings (Q5906786) (← links)
