| Publication | Date of Publication | Type |
|---|
Threshold graphs and synchronization protocols
| 2024-07-05 | Paper |
An efficient orthogonal grid drawing algorithm for cubic graphs
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Some classes of graphs that are not PCGs
Theoretical Computer Science | 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
Theoretical Computer Science | 2018-03-16 | Paper |
Tree partitioning via vertex deletion
| 2016-07-01 | Paper |
\(\lambda\)-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 |
Fully dynamically maintaining minimal integral separator for threshold and difference graphs
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
Topology recognition with advice
Information and Computation | 2016-03-10 | 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 |
On pairwise compatibility graphs having Dilworth number \(k\)
Theoretical Computer Science | 2014-07-25 | 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 |
Learning a ring cheaply and fast
Automata, Languages, and Programming | 2013-08-07 | 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 |
Unified parallel encoding and decoding algorithms for Dandelion-like codes
Journal of Parallel and Distributed Computing | 2012-03-07 | 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 |
Bijective linear time coding and decoding for \(k\)-trees
Theory of Computing Systems | 2010-05-10 | Paper |
Parallel algorithms for encoding and decoding Blob code
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
Networks | 2009-07-28 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
On the L(h,k)-Labeling of Co-comparability Graphs
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
A Bijective Code for k-Trees with Linear Time Encoding and Decoding
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 |
On coding labeled trees
Theoretical Computer Science | 2007-09-18 | Paper |
Labeling trees with a condition at distance two
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
scientific article; zbMATH DE number 5158505 (Why is no real title available?)
| 2007-05-29 | Paper |
Conflict-free star-access in parallel memory systems
Journal of Parallel and Distributed Computing | 2007-01-09 | 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 |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Structure-preserving hierarchical decompositions
Theory of Computing Systems | 2006-01-10 | Paper |
\(L(h,1)\)-labeling subclasses of planar graphs
Journal of Parallel and Distributed Computing | 2004-10-04 | Paper |
scientific article; zbMATH DE number 2086232 (Why is no real title available?)
| 2004-08-11 | Paper |
Divider-based algorithms for hierarchical tree partitioning.
Discrete Applied Mathematics | 2004-03-14 | 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 |
scientific article; zbMATH DE number 1893564 (Why is no real title available?)
| 2003-04-07 | Paper |
scientific article; zbMATH DE number 1796981 (Why is no real title available?)
| 2002-09-05 | Paper |
Optimally extending bistandard graphs on the orthogonal grid (extended abstract)
| 2001-10-30 | Paper |
scientific article; zbMATH DE number 1500552 (Why is no real title available?)
| 2001-03-07 | Paper |
scientific article; zbMATH DE number 1472189 (Why is no real title available?)
| 2000-12-13 | Paper |
scientific article; zbMATH DE number 1507236 (Why is no real title available?)
| 2000-09-14 | Paper |
Computing Prüfer codes efficiently in parallel
Discrete Applied Mathematics | 2000-05-25 | Paper |
scientific article; zbMATH DE number 1330692 (Why is no real title available?)
| 2000-05-10 | 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 |
On-line 2-satisfiability
Annals of Mathematics and Artificial Intelligence | 1997-11-09 | Paper |
An \(O(n^ 3)\) recognition algorithm for bithreshold graphs
Algorithmica | 1997-08-20 | Paper |
Recognizing strict 2-threshold graphs in O(m) time
Information Processing Letters | 1997-02-28 | Paper |
scientific article; zbMATH DE number 933173 (Why is no real title available?)
| 1996-11-25 | Paper |
At most single-bend embeddings of cubic graphs
Applied Mathematics. Series B (English Edition) | 1995-03-07 | Paper |
Theoretical results on at most 1-bend embeddability of graphs
Acta Mathematicae Applicatae Sinica. English Series | 1993-05-25 | Paper |
ON PVchunk OPERATIONS AND MATROGENIC GRAPHS
International Journal of Foundations of Computer Science | 1993-01-16 | Paper |
Experimental comparison of 2-satisfiability algorithms
RAIRO - Operations Research | 1992-06-26 | Paper |
PARALLEL RECOGNITION ALGORITHMS FOR GRAPHS WITH RESTRICTED NEIGHBOURHOODS
International Journal of Foundations of Computer Science | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4172390 (Why is no real title available?)
| 1989-01-01 | Paper |
Parallelism and the feedback vertex set problem
Information Processing Letters | 1988-01-01 | Paper |
Adamant digraphs
Discrete Mathematics | 1988-01-01 | Paper |
Degree sequences of matrogenic graphs
Discrete Mathematics | 1984-01-01 | Paper |
A switching algorithm for the solution of quadratic Boolean equations
Information Processing Letters | 1980-01-01 | Paper |
