| Publication | Date of Publication | Type |
|---|
| Learning of restricted RNLC graph languages | 2023-03-21 | Paper |
Tangle and ultrafilter: game theoretical interpretation
Graphs and Combinatorics | 2020-04-03 | Paper |
How to solve the torus puzzle
Algorithms | 2019-03-26 | Paper |
Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis
Algorithms | 2019-01-21 | Paper |
Tangle and Maximal Ideal
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Thin strip graphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
It is hard to know when greedy is good for finding independent sets
Information Processing Letters | 2016-05-26 | Paper |
Lower bounds for treewidth of product graphs
Discrete Applied Mathematics | 2014-09-12 | Paper |
Approximating the path-distance-width for AT-free graphs and graphs in related classes
Discrete Applied Mathematics | 2014-04-02 | Paper |
A revisit of the scheme for computing treewidth and minimum fill-in
Theoretical Computer Science | 2014-03-28 | Paper |
Outerplanar obstructions for matroid pathwidth
Discrete Mathematics | 2014-01-16 | Paper |
| Outerplanar obstructions for matroid pathwidth | 2013-11-01 | Paper |
Approximability of the path-distance-width for AT-free graphs
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
The carving-width of generalized hypercubes
Discrete Mathematics | 2010-10-19 | Paper |
Security number of grid-like graphs
Discrete Applied Mathematics | 2010-04-28 | Paper |
On spanning tree congestion of graphs
Discrete Mathematics | 2009-12-10 | Paper |
Tree-length equals branch-length
Discrete Mathematics | 2009-12-10 | Paper |
Worst case analysis of a greedy algorithm for graph thickness
Information Processing Letters | 2009-03-23 | Paper |
An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
Discrete Applied Mathematics | 2009-03-09 | Paper |
A lower bound for the vertex boundary-width of complete \(k\)-ary trees
Discrete Mathematics | 2008-05-13 | Paper |
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
Discrete Applied Mathematics | 2007-10-29 | Paper |
Hardness of approximation for non-overlapping local alignments.
Discrete Applied Mathematics | 2004-03-14 | Paper |
Pagenumber of pathwidth-\(k\) graphs and strong pathwidth-\(k\) graphs
Discrete Mathematics | 2003-03-16 | Paper |
A note on greedy algorithms for the maximum weighted independent set problem
Discrete Applied Mathematics | 2003-03-09 | Paper |
| scientific article; zbMATH DE number 1741092 (Why is no real title available?) | 2002-05-15 | Paper |
The hardness of approximations for the problem of independent point sets in intersection graphs of 3-dimensional boxes
RIMS Kokyuroku | 2001-09-17 | Paper |
| scientific article; zbMATH DE number 1568053 (Why is no real title available?) | 2001-02-21 | Paper |
On approximation intractability of the path-distance-width problem
Discrete Applied Mathematics | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1511709 (Why is no real title available?) | 2000-09-27 | Paper |
| scientific article; zbMATH DE number 1404234 (Why is no real title available?) | 2000-02-20 | Paper |
| scientific article; zbMATH DE number 1380814 (Why is no real title available?) | 1999-12-20 | Paper |
| scientific article; zbMATH DE number 1380815 (Why is no real title available?) | 1999-12-20 | Paper |
| scientific article; zbMATH DE number 1379308 (Why is no real title available?) | 1999-12-15 | Paper |
| scientific article; zbMATH DE number 1322314 (Why is no real title available?) | 1999-11-08 | Paper |
| scientific article; zbMATH DE number 1322341 (Why is no real title available?) | 1999-11-08 | Paper |
Isomorphism for graphs of bounded distance width
Algorithmica | 1999-06-29 | Paper |
A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions
Acta Informatica | 1997-06-19 | Paper |
A normal form problem for unlabeled boundary NLC graph languages
Information and Computation | 1996-09-15 | Paper |
The generating power of boundary NLC graph grammars and cycle graphs
Information Sciences | 1995-08-27 | Paper |
A pumping lemma and the structure of derivations in the boundary NLC graph languages
Information Sciences | 1994-07-26 | Paper |
