| Publication | Date of Publication | Type |
|---|
Asteroidal triple-free graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Computing a dominating pair in an asteroidal triple-free graph in linear time
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Linear time algorithms for dominating pairs in asteroidal triple-free graphs
Automata, Languages and Programming | 2019-01-10 | Paper |
Equivalence of the filament and overlap graphs of subtrees of limited trees
(available as arXiv preprint) | 2018-11-30 | Paper |
| Equivalence of the filament and overlap graphs of subtrees of limited trees | 2018-11-30 | Paper |
On polygon numbers of circle graphs and distance hereditary graphs
Discrete Applied Mathematics | 2018-09-17 | Paper |
Total domination and transformation
Information Processing Letters | 2016-05-26 | Paper |
Games on interval and permutation graph representations
Theoretical Computer Science | 2015-12-08 | Paper |
On list coloring and list homomorphism of permutation and interval graphs
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
The Mycielskian of a graph
Formalized Mathematics | 2013-12-03 | Paper |
Simple graphs as simplicial complexes: the Mycielskian of a graph
Formalized Mathematics | 2013-10-08 | Paper |
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
Discrete Mathematics | 2011-02-18 | Paper |
The LBFS structure and recognition of interval graphs
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Subtree filament graphs are subtree overlap graphs
Information Processing Letters | 2010-03-24 | Paper |
DP-Complete Problems Derived from Extremal NP-Complete Properties
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
| Complexity results on graphs with few cliques | 2008-05-27 | Paper |
| Recognizing maximal unfrozen graphs with respect to independent sets is CO-NP-complete | 2008-05-27 | Paper |
| Recognizing maximal unfrozen graphs with respect to independent sets is CO-NP-complete | 2008-05-27 | Paper |
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Discrete Applied Mathematics | 2006-09-28 | Paper |
Linear Orderings of Subfamilies of AT‐Free Graphs
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Finite element modelling of fibre reinforced polymer sandwich panels exposed to heat
International Journal for Numerical Methods in Engineering | 2005-08-29 | Paper |
| scientific article; zbMATH DE number 2044941 (Why is no real title available?) | 2004-02-18 | Paper |
Maximum independent set and maximum clique algorithms for overlap graphs
Discrete Applied Mathematics | 2003-09-25 | Paper |
Approximating Bandwidth by Mixing Layouts of Interval Graphs
SIAM Journal on Discrete Mathematics | 2003-01-05 | Paper |
| Approximating bandwidth by mixing layouts of interval graphs | 2001-09-23 | Paper |
Biconvex graphs: Ordering and algorithms
Discrete Applied Mathematics | 2000-07-11 | Paper |
| scientific article; zbMATH DE number 1304325 (Why is no real title available?) | 2000-04-10 | Paper |
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1303554 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1305500 (Why is no real title available?) | 1999-06-17 | Paper |
Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms
Discrete Applied Mathematics | 1999-05-31 | Paper |
Asteroidal Triple-Free Graphs
SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
Polygon Graph Recognition
Journal of Algorithms | 1998-02-09 | Paper |
Recursively decomposable well-covered graphs
Discrete Mathematics | 1997-09-17 | Paper |
| scientific article; zbMATH DE number 975351 (Why is no real title available?) | 1997-03-09 | Paper |
A linear time algorithm to compute a dominating path in an AT-free graph
Information Processing Letters | 1997-02-28 | Paper |
| scientific article; zbMATH DE number 617574 (Why is no real title available?) | 1994-11-27 | Paper |
On cocolourings and cochromatic numbers of graphs
Discrete Applied Mathematics | 1994-08-29 | Paper |
Independence and domination in polygon graphs
Discrete Applied Mathematics | 1993-11-28 | Paper |
Domination on Cocomparability Graphs
SIAM Journal on Discrete Mathematics | 1993-10-14 | Paper |
Complexity results for well‐covered graphs
Networks | 1992-07-23 | Paper |
Dominating sets in perfect graphs
Discrete Mathematics | 1992-06-25 | Paper |
Permutation graphs: Connected domination and Steiner trees
Discrete Mathematics | 1992-06-25 | Paper |
Bipartite permutation graphs
Discrete Applied Mathematics | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4053685 (Why is no real title available?) | 1987-01-01 | Paper |
A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
Order | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4063153 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4066932 (Why is no real title available?) | 1986-01-01 | Paper |
Finding minimum dominating cycles in permutation graphs
Operations Research Letters | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3906530 (Why is no real title available?) | 1985-01-01 | Paper |
