| Publication | Date of Publication | Type |
|---|
| An efficient orthogonal grid drawing algorithm for cubic graphs | 2023-12-12 | Paper |
| On the domination number of $t$-constrained de Bruijn graphs | 2023-05-31 | Paper |
| Some problems related to the space of optimal tree reconciliations (invited talk) | 2022-07-13 | Paper |
| All Graphs with at most 8 nodes are 2-interval-PCGs | 2022-02-28 | Paper |
| Visualizing co-phylogenetic reconciliations | 2020-04-06 | Paper |
| Some classes of graphs that are not PCGs | 2019-09-10 | Paper |
| Co-divergence and tree topology | 2019-08-01 | Paper |
| A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs | 2019-03-13 | Paper |
| Visualizing co-phylogenetic reconciliations | 2019-02-20 | 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 |
| On Maximal Chain Subgraphs and Covers of Bipartite Graphs | 2016-09-29 | Paper |
| Pairwise Compatibility Graphs: A Survey | 2016-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816017 | 2016-07-01 | Paper |
| A new 3D representation of trivalent Cayley networks | 2016-05-26 | Paper |
| 3D straight-line grid drawing of 4-colorable graphs | 2016-05-26 | Paper |
| Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs | 2016-05-03 | Paper |
| Optimal L(j,k)-Edge-Labeling of Regular Grids | 2015-09-29 | 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 |
| Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids | 2014-08-13 | Paper |
| On pairwise compatibility graphs having Dilworth number \(k\) | 2014-07-25 | Paper |
| \(L(2,1)\)-labeling of oriented planar graphs | 2014-04-16 | 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 |
| Exploring pairwise compatibility graphs | 2013-02-19 | Paper |
| On Relaxing the Constraints in Pairwise Compatibility Graphs | 2012-06-08 | Paper |
| The \(L(2,1)\)-labeling of unigraphs | 2011-08-10 | Paper |
| L(2,1)-Labeling of Unigraphs | 2011-05-12 | Paper |
| Theoretical Computer Science | 2010-02-23 | Paper |
| Antibandwidth of complete \(k\)-ary trees | 2009-12-15 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs | 2009-07-28 | Paper |
| \(L(h,1,1)\)-labeling of outerplanar graphs | 2009-04-27 | Paper |
| Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks | 2009-03-12 | Paper |
| L(h,1,1)-Labeling of Outerplanar Graphs | 2009-03-12 | Paper |
| On the L(h,k)-Labeling of Co-comparability Graphs | 2009-03-03 | Paper |
| Recognition of Unigraphs through Superposition of Graphs (Extended Abstract) | 2009-02-24 | Paper |
| Minimum-energy broadcast and disk cover in grid wireless networks | 2008-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387672 | 2008-05-27 | Paper |
| Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers | 2007-11-15 | Paper |
| Antibandwidth of Complete k-Ary Trees | 2007-05-29 | 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 |
| Labeling trees with a condition at distance two | 2006-08-04 | Paper |
| Nearly optimal three dimensional layout of hypercube networks | 2006-03-24 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| New results on edge-bandwidth | 2004-10-27 | Paper |
| \(L(h,1)\)-labeling subclasses of planar graphs | 2004-10-04 | Paper |
| Efficient algorithms for checking the equivalence of multistage interconnection networks | 2004-09-08 | Paper |
| Interval routing \(\and\) layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Beneš networks | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044330 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414573 | 2003-07-25 | Paper |
| On max cut in cubic graphs | 2003-06-29 | Paper |
| An optimal layout of multigrid networks | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2725986 | 2001-10-30 | Paper |
| Optimal three-dimensional layout of interconnection networks | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501571 | 2001-03-07 | 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 |
| A tight layout of the butterfly network | 1998-09-27 | Paper |
