Lorna K. Stewart

Available identifiers

zbMath Open stewart.lorna-kWikidataQ102251774 ScholiaQ102251774MaRDI QIDQ1060965

List of research outcomes

Publication	Date of Publication	Type
Asteroidal triple-free graphs	2024-01-05	Paper
Computing a dominating pair in an asteroidal triple-free graph in linear time	2022-12-16	Paper
Linear time algorithms for dominating pairs in asteroidal triple-free graphs	2019-01-10	Paper
https://portal.mardi4nfdi.de/entity/Q4558964	2018-11-30	Paper
On polygon numbers of circle graphs and distance hereditary graphs	2018-09-17	Paper
Total domination and transformation	2016-05-26	Paper
Games on interval and permutation graph representations	2015-12-08	Paper
On List Coloring and List Homomorphism of Permutation and Interval Graphs	2015-04-17	Paper
The Mycielskian of a Graph	2013-12-03	Paper
Simple Graphs as Simplicial Complexes: the Mycielskian of a Graph	2013-10-08	Paper
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two	2011-02-18	Paper
The LBFS Structure and Recognition of Interval Graphs	2010-12-03	Paper
Subtree filament graphs are subtree overlap graphs	2010-03-24	Paper
DP-Complete Problems Derived from Extremal NP-Complete Properties	2009-10-16	Paper
https://portal.mardi4nfdi.de/entity/Q5387655	2008-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q5387691	2008-05-27	Paper
Approximating the minimum clique cover and other hard problems in subtree filament graphs	2006-09-28	Paper
Linear Orderings of Subfamilies of AT‐Free Graphs	2006-06-01	Paper
Finite element modelling of fibre reinforced polymer sandwich panels exposed to heat	2005-08-29	Paper
https://portal.mardi4nfdi.de/entity/Q4448763	2004-02-18	Paper
Maximum independent set and maximum clique algorithms for overlap graphs	2003-09-25	Paper
Approximating Bandwidth by Mixing Layouts of Interval Graphs	2003-01-05	Paper
https://portal.mardi4nfdi.de/entity/Q2741348	2001-09-23	Paper
Biconvex graphs: Ordering and algorithms	2000-07-11	Paper
https://portal.mardi4nfdi.de/entity/Q4251056	2000-04-10	Paper
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs	1999-10-28	Paper
https://portal.mardi4nfdi.de/entity/Q4250178	1999-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q4252390	1999-06-17	Paper
Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms	1999-05-31	Paper
Polygon Graph Recognition	1998-02-09	Paper
Asteroidal Triple-Free Graphs	1998-02-09	Paper
Recursively decomposable well-covered graphs	1997-09-17	Paper
https://portal.mardi4nfdi.de/entity/Q5284020	1997-03-09	Paper
A linear time algorithm to compute a dominating path in an AT-free graph	1997-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q4301896	1994-11-27	Paper
On cocolourings and cochromatic numbers of graphs	1994-08-29	Paper
Independence and domination in polygon graphs	1993-11-28	Paper
Domination on Cocomparability Graphs	1993-10-14	Paper
Complexity results for well‐covered graphs	1992-07-23	Paper
Dominating sets in perfect graphs	1992-06-25	Paper
Permutation graphs: Connected domination and Steiner trees	1992-06-25	Paper
A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders	1987-01-01	Paper
Bipartite permutation graphs	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3789614	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3797239	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3800068	1986-01-01	Paper
Finding minimum dominating cycles in permutation graphs	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3684150	1985-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Lorna K. Stewart