| Publication | Date of Publication | Type |
|---|
| m-eternal domination and variants on some classes of finite and infinite graphs | 2026-02-26 | Paper |
L(3, 2, 1)-labeling of the square of cycles
Theoretical Computer Science | 2025-12-15 | Paper |
All graphs with at most 8 nodes are 2-interval-PCGs
Fundamenta Informaticae | 2025-10-01 | Paper |
Autonomous data detection and inspection with a fleet of UAVs
Computers & Operations Research | 2025-05-26 | Paper |
(Eternal) vertex cover numbers of infinite and finite grid graphs
Theoretical Computer Science | 2025-05-13 | Paper |
On generalizations of pairwise compatibility graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2025-05-07 | Paper |
L(3, 2, 1)-labeling of certain planar graphs
Theoretical Computer Science | 2024-12-02 | Paper |
| Improved approximations of independent dominating set in bounded degree graphs | 2024-06-05 | Paper |
An efficient orthogonal grid drawing algorithm for cubic graphs
Lecture Notes in Computer Science | 2023-12-12 | Paper |
On the domination number of $t$-constrained de Bruijn graphs
Discrete Mathematics & Theoretical Computer Science | 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
Theoretical Computer Science | 2020-04-06 | Paper |
Some classes of graphs that are not PCGs
Theoretical Computer Science | 2019-09-10 | Paper |
Co-divergence and tree topology
Journal of Mathematical Biology | 2019-08-01 | Paper |
A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs
Theoretical Computer Science | 2019-03-13 | Paper |
Visualizing co-phylogenetic reconciliations
Lecture Notes in Computer Science | 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
Theoretical Computer Science | 2018-03-16 | Paper |
On maximal chain subgraphs and covers of bipartite graphs
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Pairwise compatibility graphs: a survey
SIAM Review | 2016-08-08 | Paper |
| -coloring of regular tiling (extended abstract) | 2016-07-01 | Paper |
A new 3D representation of trivalent Cayley networks
Information Processing Letters | 2016-05-26 | Paper |
3D straight-line grid drawing of 4-colorable graphs
Information Processing Letters | 2016-05-26 | Paper |
Fully dynamically maintaining minimal integral separator for threshold and difference graphs
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
Optimal L(j,k)-edge-labeling of regular grids
International Journal of Foundations of Computer Science | 2015-09-29 | Paper |
Corrigendum to: ``On pairwise compatibility graphs having Dilworth number two''
Theoretical Computer Science | 2015-09-25 | Paper |
Optimal layout of trivalent Cayley interconnection networks
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids
Information Processing Letters | 2014-08-13 | Paper |
On pairwise compatibility graphs having Dilworth number k
Theoretical Computer Science | 2014-07-25 | Paper |
\(L(2,1)\)-labeling of oriented planar graphs
Discrete Applied Mathematics | 2014-04-16 | Paper |
On Dilworth k graphs and their pairwise compatibility
Algorithms and Computation | 2014-02-18 | Paper |
On pairwise compatibility graphs having Dilworth number two
Theoretical Computer Science | 2014-02-11 | Paper |
Recognition of unigraphs through superposition of graphs
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
On the pairwise compatibility property of some superclasses of threshold graphs
Discrete Mathematics, Algorithms and Applications | 2013-09-05 | Paper |
Exploring pairwise compatibility graphs
Theoretical Computer Science | 2013-02-19 | Paper |
On relaxing the constraints in pairwise compatibility graphs
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
The \(L(2,1)\)-labeling of unigraphs
Discrete Applied Mathematics | 2011-08-10 | Paper |
L(2,1)-Labeling of Unigraphs
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
Exact solution of a class of frequency assignment problems in cellular networks (extended abstract)
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Antibandwidth of complete \(k\)-ary trees
Discrete Mathematics | 2009-12-15 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
On the <i>L</i>(<i>h</i>, <i>k</i>)‐labeling of co‐comparability graphs and circular‐arc graphs
Networks | 2009-07-28 | Paper |
L(h,1,1)-labeling of outerplanar graphs
Mathematical Methods of Operations Research | 2009-04-27 | Paper |
L(h,1,1)-Labeling of Outerplanar Graphs
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks
Structural Information and Communication Complexity | 2009-03-12 | Paper |
On the L(h,k)-Labeling of Co-comparability Graphs
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
Minimum-energy broadcast and disk cover in grid wireless networks
Theoretical Computer Science | 2008-06-24 | Paper |
| Optimal \(L(h,k)\)-labeling of regular grids | 2008-05-27 | Paper |
Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers
Structural Information and Communication Complexity | 2007-11-15 | Paper |
| scientific article; zbMATH DE number 5158505 (Why is no real title available?) | 2007-05-29 | Paper |
Antibandwidth of Complete k-Ary Trees
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Labeling trees with a condition at distance two
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
\(\lambda\)-coloring matrogenic graphs
Discrete Applied Mathematics | 2007-01-09 | Paper |
Labeling trees with a condition at distance two
Discrete Mathematics | 2006-08-04 | Paper |
Nearly optimal three dimensional layout of hypercube networks
Networks | 2006-03-24 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
New results on edge-bandwidth
Theoretical Computer Science | 2004-10-27 | Paper |
\(L(h,1)\)-labeling subclasses of planar graphs
Journal of Parallel and Distributed Computing | 2004-10-04 | Paper |
Efficient algorithms for checking the equivalence of multistage interconnection networks
Journal of Parallel and Distributed Computing | 2004-09-08 | Paper |
Interval routing \(\and\) layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Beneš networks
Journal of Parallel and Distributed Computing | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 2086232 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1953160 (Why is no real title available?) | 2003-07-25 | Paper |
| On max cut in cubic graphs | 2003-06-29 | Paper |
An optimal layout of multigrid networks
Information Processing Letters | 2002-07-25 | Paper |
| Optimally extending bistandard graphs on the orthogonal grid (extended abstract) | 2001-10-30 | Paper |
Optimal three-dimensional layout of interconnection networks
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1500552 (Why is no real title available?) | 2001-03-07 | Paper |
Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs
Journal of Graph Algorithms and Applications | 1999-10-20 | Paper |
| scientific article; zbMATH DE number 1264876 (Why is no real title available?) | 1999-07-05 | Paper |
Orthogonally drawing cubic graphs in parallel
Journal of Parallel and Distributed Computing | 1999-05-31 | Paper |
A tight layout of the butterfly network
Theory of Computing Systems | 1998-09-27 | Paper |
On Generalizations of Pairwise Compatibility Graphs
(available as arXiv preprint) | N/A | Paper |
