Lorna Stewart

38 papers A* 3A 1B 4Journal 29
YearRankTypeTitle / Venue / Authors
2018 J jnl
On polygon numbers of circle graphs and distance hereditary graphs.
Discret. Appl. Math.
Lorna Stewart, Richard Anthony Valenzano
2017 J jnl
Equivalence of the filament and overlap graphs of subtrees of limited trees.
Discret. Math. Theor. Comput. Sci.
Jessica A. Enright, Lorna Stewart
2016 J jnl
Games on interval and permutation graph representations.
Theor. Comput. Sci.
Jessica A. Enright, Lorna Stewart
2015 J jnl
Equivalence of the filament and overlap graphs of subtrees of limited trees.
CoRR
Jessica A. Enright, Lorna Stewart
2014 J jnl
On List Coloring and List Homomorphism of Permutation and Interval Graphs.
SIAM J. Discret. Math.
Jessica A. Enright, Lorna Stewart, Gábor Tardos
2014 J jnl
On polygon numbers of circle graphs and distance hereditary graphs.
CoRR
Lorna Stewart, Richard Anthony Valenzano
2012 J jnl
On List Colouring and List Homomorphism of Permutation and Interval Graphs
CoRR
Jessica A. Enright, Lorna Stewart, Gábor Tardos
2012 J jnl
Simple Graphs as Simplicial Complexes: the Mycielskian of a Graph.
Formaliz. Math.
Piotr Rudnicki, Lorna Stewart
2011 J jnl
3-List Colouring Permutation Graphs
CoRR
Jessica A. Enright, Lorna Stewart
2011 J jnl
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two.
Discret. Math.
Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart
2011 J jnl
The Mycielskian of a Graph.
Formaliz. Math.
Piotr Rudnicki, Lorna Stewart
2010 J jnl
The overlap number of a graph
CoRR
Bill Rosgen, Lorna Stewart
2009 B conf
DP-Complete Problems Derived from Extremal NP-Complete Properties.
MFCS
Yi Cao, Joseph C. Culberson, Lorna Stewart
2009 J jnl
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
CoRR
Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart
2009 J jnl
The LBFS Structure and Recognition of Interval Graphs.
SIAM J. Discret. Math.
Derek G. Corneil, Stephan Olariu, Lorna Stewart
2007 J jnl
Complexity Results on Graphs with Few Cliques.
Discret. Math. Theor. Comput. Sci.
Bill Rosgen, Lorna Stewart
2007 J jnl
Subtree filament graphs are subtree overlap graphs.
Inf. Process. Lett.
Jessica A. Enright, Lorna Stewart
2006 J jnl
Approximating the minimum clique cover and other hard problems in subtree filament graphs.
Discret. Appl. Math.
J. Mark Keil, Lorna Stewart
2006 J jnl
Linear Orderings of Subfamilies of AT-Free Graphs.
SIAM J. Discret. Math.
Derek G. Corneil, Ekkehard Köhler, Stephan Olariu, Lorna Stewart
2005 J jnl
Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete.
Discret. Math. Theor. Comput. Sci.
Nesrine Abbas, Joseph C. Culberson, Lorna Stewart
2003 J jnl
Maximum independent set and maximum clique algorithms for overlap graphs.
Discret. Appl. Math.
Eowyn Cenek, Lorna Stewart
2002 J jnl
Approximating Bandwidth by Mixing Layouts of Interval Graphs.
SIAM J. Discret. Math.
Dieter Kratsch, Lorna Stewart
2001 B conf
On Subfamilies of AT-Free Graphs.
WG
Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart
1999 A conf
Approximating Bandwidth by Mixing Layouts of Interval Graphs.
STACS
Dieter Kratsch, Lorna Stewart
1999 J jnl
Approximating Bandwidth by Mixing Layouts of Interval Graphs.
Electron. Notes Discret. Math.
Dieter Kratsch, Lorna Stewart
1999 A* conf
LBFS Orderings and Cocomparability Graphs.
SODA
Derek G. Corneil, Stephan Olariu, Lorna Stewart
1999 J jnl
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs.
SIAM J. Comput.
Derek G. Corneil, Stephan Olariu, Lorna Stewart
1998 A* conf
The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract).
SODA
Derek G. Corneil, Stephan Olariu, Lorna Stewart
1997 J jnl
Asteroidal Triple-Free Graphs.
SIAM J. Discret. Math.
Derek G. Corneil, Stephan Olariu, Lorna Stewart
1997 J jnl
Total Domination and Transformation.
Inf. Process. Lett.
Dieter Kratsch, Lorna Stewart
1995 J jnl
A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph.
Inf. Process. Lett.
Derek G. Corneil, Stephan Olariu, Lorna Stewart
1995 B conf
Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time.
WADS
Derek G. Corneil, Stephan Olariu, Lorna Stewart
1995 A* conf
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs.
ICALP
Derek G. Corneil, Stephan Olariu, Lorna Stewart
1994 J jnl
On Cocolourings and Cochromatic Numbers of Graphs.
Discret. Appl. Math.
John G. Gimbel, Dieter Kratsch, Lorna Stewart
1993 B conf
Asteroidal Triple-Free Graphs.
WG
Derek G. Corneil, Stephan Olariu, Lorna Stewart
1993 J jnl
Domination on Cocomparability Graphs.
SIAM J. Discret. Math.
Dieter Kratsch, Lorna Stewart
1987 J jnl
Bipartite permutation graphs.
Discret. Appl. Math.
Jeremy P. Spinrad, Andreas Brandstädt, Lorna Stewart
1985 — —
Permutation graph structure and algorithms.
Lorna Stewart