| Publication | Date of Publication | Type |
|---|
| An efficient orthogonal grid drawing algorithm for cubic graphs | 2023-12-12 | Paper |
| Some classes of graphs that are not PCGs | 2019-09-10 | Paper |
| Graphs that are not pairwise compatible: a new proof technique (extended abstract) | 2018-09-06 | Paper |
| On dynamic threshold graphs and related classes | 2018-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816017 | 2016-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816023 | 2016-07-01 | Paper |
| A new 3D representation of trivalent Cayley networks | 2016-05-26 | Paper |
| Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs | 2016-05-03 | Paper |
| Topology recognition with advice | 2016-03-10 | Paper |
| Corrigendum to: ``On pairwise compatibility graphs having Dilworth number two | 2015-09-25 | Paper |
| OPTIMAL LAYOUT OF TRIVALENT CAYLEY INTERCONNECTION NETWORKS | 2015-04-29 | Paper |
| On pairwise compatibility graphs having Dilworth number \(k\) | 2014-07-25 | Paper |
| On Dilworth k Graphs and Their Pairwise Compatibility | 2014-02-18 | Paper |
| On pairwise compatibility graphs having Dilworth number two | 2014-02-11 | Paper |
| Recognition of Unigraphs through Superposition of Graphs | 2013-11-28 | Paper |
| ON THE PAIRWISE COMPATIBILITY PROPERTY OF SOME SUPERCLASSES OF THRESHOLD GRAPHS | 2013-09-05 | Paper |
| Learning a Ring Cheaply and Fast | 2013-08-07 | Paper |
| Exploring pairwise compatibility graphs | 2013-02-19 | Paper |
| On Relaxing the Constraints in Pairwise Compatibility Graphs | 2012-06-08 | Paper |
| Unified parallel encoding and decoding algorithms for Dandelion-like codes | 2012-03-07 | Paper |
| The \(L(2,1)\)-labeling of unigraphs | 2011-08-10 | Paper |
| L(2,1)-Labeling of Unigraphs | 2011-05-12 | Paper |
| Bijective linear time coding and decoding for \(k\)-trees | 2010-05-10 | Paper |
| Parallel Algorithms for Encoding and Decoding Blob Code | 2010-02-09 | Paper |
| On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs | 2009-07-28 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| On the L(h,k)-Labeling of Co-comparability Graphs | 2009-03-03 | Paper |
| A Bijective Code for k-Trees with Linear Time Encoding and Decoding | 2009-03-03 | Paper |
| Recognition of Unigraphs through Superposition of Graphs (Extended Abstract) | 2009-02-24 | Paper |
| On coding labeled trees | 2007-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439685 | 2007-05-29 | Paper |
| Labeling trees with a condition at distance two | 2007-05-29 | Paper |
| \(\lambda\)-coloring matrogenic graphs | 2007-01-09 | Paper |
| Conflict-free star-access in parallel memory systems | 2007-01-09 | Paper |
| Labeling trees with a condition at distance two | 2006-08-04 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Structure-preserving hierarchical decompositions | 2006-01-10 | Paper |
| \(L(h,1)\)-labeling subclasses of planar graphs | 2004-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044330 | 2004-08-11 | Paper |
| Divider-based algorithms for hierarchical tree partitioning. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414573 | 2003-07-25 | Paper |
| On max cut in cubic graphs | 2003-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801185 | 2003-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551376 | 2002-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2725986 | 2001-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501571 | 2001-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489244 | 2000-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503958 | 2000-09-14 | Paper |
| Computing Prüfer codes efficiently in parallel | 2000-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4261184 | 2000-05-10 | Paper |
| Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs | 1999-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4233833 | 1999-07-05 | Paper |
| Orthogonally drawing cubic graphs in parallel | 1999-05-31 | Paper |
| On-line 2-satisfiability | 1997-11-09 | Paper |
| An \(O(n^ 3)\) recognition algorithm for bithreshold graphs | 1997-08-20 | Paper |
| Recognizing strict 2-threshold graphs in O(m) time | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4894957 | 1996-11-25 | Paper |
| At most single-bend embeddings of cubic graphs | 1995-03-07 | Paper |
| Theoretical results on at most 1-bend embeddability of graphs | 1993-05-25 | Paper |
| ON PVchunk OPERATIONS AND MATROGENIC GRAPHS | 1993-01-16 | Paper |
| Experimental comparison of 2-satisfiability algorithms | 1992-06-26 | Paper |
| PARALLEL RECOGNITION ALGORITHMS FOR GRAPHS WITH RESTRICTED NEIGHBOURHOODS | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197328 | 1989-01-01 | Paper |
| Adamant digraphs | 1988-01-01 | Paper |
| Parallelism and the feedback vertex set problem | 1988-01-01 | Paper |
| Degree sequences of matrogenic graphs | 1984-01-01 | Paper |
| A switching algorithm for the solution of quadratic Boolean equations | 1980-01-01 | Paper |
