| Publication | Date of Publication | Type |
|---|
| Encoding watermark numbers as reducible permutation graphs using self-inverting permutations | 2018-10-26 | Paper |
| Strong triadic closure in cographs and graphs of low maximum degree | 2018-06-08 | Paper |
| Strong triadic closure in cographs and graphs of low maximum degree | 2017-10-23 | Paper |
| Recognizing cographs and threshold graphs through a classification of their edges | 2016-06-16 | Paper |
| On the performance of the first-fit coloring algorithm on permutation graphs | 2016-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501347 | 2015-08-03 | Paper |
| Join-reachability problems in directed graphs | 2015-02-05 | Paper |
| Counting spanning trees using modular decomposition | 2014-03-13 | Paper |
| The longest path problem is polynomial on cocomparability graphs | 2013-03-05 | Paper |
| An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs | 2013-01-24 | Paper |
| An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs | 2012-10-11 | Paper |
| A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs | 2012-08-08 | Paper |
| A simple linear-time recognition algorithm for weakly quasi-threshold graphs | 2012-01-24 | Paper |
| The longest path problem has a polynomial solution on interval graphs | 2011-09-20 | Paper |
| Join-reachability problems in directed graphs | 2011-06-17 | Paper |
| Counting Spanning Trees in Graphs Using Modular Decomposition | 2011-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3073568 | 2011-02-11 | Paper |
| The Longest Path Problem is Polynomial on Cocomparability Graphs | 2010-11-16 | Paper |
| The 1-fixed-endpoint path cover problem is Polynomial on interval graphs | 2010-09-27 | Paper |
| A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs | 2010-03-09 | Paper |
| Harmonious Coloring on Subclasses of Colinear Graphs | 2010-02-09 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs | 2009-12-11 | Paper |
| The Longest Path Problem Is Polynomial on Interval Graphs | 2009-10-16 | Paper |
| A limit characterization for the number of spanning trees of graphs | 2009-07-21 | Paper |
| Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs | 2009-06-23 | Paper |
| An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs | 2009-03-10 | Paper |
| Colinear Coloring on Graphs | 2009-02-24 | Paper |
| A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs | 2008-09-04 | Paper |
| The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs | 2008-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387659 | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387667 | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387677 | 2008-05-27 | Paper |
| Optimal Algorithms for Detecting Network Stability | 2008-03-25 | Paper |
| A linear‐time algorithm for the k‐fixed‐endpoint path cover problem on cographs | 2008-01-07 | Paper |
| The harmonious coloring problem is NP-complete for interval and permutation graphs | 2007-10-29 | Paper |
| On the parallel computation of the biconnected and strongly connected co-components of graphs | 2007-09-19 | Paper |
| NP-completeness results for some problems on subclasses of bipartite and chordal graphs | 2007-09-03 | Paper |
| On the Strongly Connected and Biconnected Components of the Complement of Graphs | 2007-05-29 | Paper |
| Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates | 2007-05-02 | Paper |
| Detecting holes and antiholes in graphs | 2007-03-12 | Paper |
| An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs | 2007-02-19 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| P-tree structures and event horizon: efficient event-set implementations | 2006-10-12 | Paper |
| Minimal separators in \(P_4\)-sparse graphs | 2006-03-29 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708545 | 2005-11-18 | Paper |
| Efficient parallel recognition of cographs | 2005-09-28 | Paper |
| The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs | 2005-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3154670 | 2005-01-14 | Paper |
| FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS | 2004-10-06 | Paper |
| PARALLEL BLOCK-FINDING USING DISTANCE MATRICES | 2004-10-06 | Paper |
| An optimal parallel co-connectivity algorithm | 2004-10-01 | Paper |
| Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation | 2004-10-01 | Paper |
| Parallel algorithms for P4-comparability graphs | 2004-10-01 | Paper |
| Parallel algorithms for Hamiltonian problems on quasi-threshold graphs | 2004-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474099 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414511 | 2003-07-25 | Paper |
| Coloring permutation graphs in parallel | 2002-08-29 | Paper |
| Optimal gray-code labeling and recognition algorithms for hypercubes | 2002-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741358 | 2001-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4948732 | 2000-04-26 | Paper |
| On complete systems of invariants for small graphs | 1997-08-07 | Paper |
| Constant-time parallel recognition of split graphs | 1997-02-27 | Paper |
| On the Parallel Evaluation of Dwba Integrals | 1996-01-15 | Paper |
| Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs | 1995-04-20 | Paper |
