| Publication | Date of Publication | Type |
|---|
| Learning of restricted RNLC graph languages | 2023-03-21 | Paper |
| Tangle and ultrafilter: game theoretical interpretation | 2020-04-03 | Paper |
| How to solve the torus puzzle | 2019-03-26 | Paper |
| Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis | 2019-01-21 | Paper |
| Tangle and Maximal Ideal | 2017-05-05 | Paper |
| Thin strip graphs | 2016-11-24 | Paper |
| It is hard to know when greedy is good for finding independent sets | 2016-05-26 | Paper |
| Lower bounds for treewidth of product graphs | 2014-09-12 | Paper |
| Approximating the path-distance-width for AT-free graphs and graphs in related classes | 2014-04-02 | Paper |
| A revisit of the scheme for computing treewidth and minimum fill-in | 2014-03-28 | Paper |
| Outerplanar obstructions for matroid pathwidth | 2014-01-16 | Paper |
| Outerplanar obstructions for matroid pathwidth | 2013-11-01 | Paper |
| Approximability of the Path-Distance-Width for AT-free Graphs | 2011-12-16 | Paper |
| The carving-width of generalized hypercubes | 2010-10-19 | Paper |
| Security number of grid-like graphs | 2010-04-28 | Paper |
| On spanning tree congestion of graphs | 2009-12-10 | Paper |
| Tree-length equals branch-length | 2009-12-10 | Paper |
| Worst case analysis of a greedy algorithm for graph thickness | 2009-03-23 | Paper |
| An improved algorithm for the longest induced path problem on \(k\)-chordal graphs | 2009-03-09 | Paper |
| A lower bound for the vertex boundary-width of complete \(k\)-ary trees | 2008-05-13 | Paper |
| Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs | 2007-10-29 | Paper |
| Hardness of approximation for non-overlapping local alignments. | 2004-03-14 | Paper |
| Pagenumber of pathwidth-\(k\) graphs and strong pathwidth-\(k\) graphs | 2003-03-16 | Paper |
| A note on greedy algorithms for the maximum weighted independent set problem | 2003-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331284 | 2002-05-15 | Paper |
| The hardness of approximations for the problem of independent point sets in intersection graphs of 3-dimensional boxes | 2001-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761857 | 2001-02-21 | Paper |
| On approximation intractability of the path-distance-width problem | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505397 | 2000-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937851 | 2000-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705515 | 1999-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705516 | 1999-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703656 | 1999-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253326 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253363 | 1999-11-08 | Paper |
| Isomorphism for graphs of bounded distance width | 1999-06-29 | Paper |
| A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions | 1997-06-19 | Paper |
| A normal form problem for unlabeled boundary NLC graph languages | 1996-09-15 | Paper |
| The generating power of boundary NLC graph grammars and cycle graphs | 1995-08-27 | Paper |
| A pumping lemma and the structure of derivations in the boundary NLC graph languages | 1994-07-26 | Paper |
