Rossella Petreschi

Mohammad Kaykobad

Theor. Comput. Sci., 2018

On dynamic threshold graphs and related classes.

[BibT_eX]

[DOI]

Angelo Monti

Theor. Comput. Sci., 2018

Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2017

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Mohammad Kaykobad

J. Graph Algorithms Appl., 2017

2016

Topology recognition with advice.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life.

[BibT_eX]

[DOI]

Giorgio Ausiello

Bull. EATCS, 2016

Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs.

[BibT_eX]

[DOI]

Angelo Monti

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

2015

Corrigendum to "On pairwise compatibility graphs having Dilworth number two" [Theoret. Comput. Science (2014) 34-40].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract).

[BibT_eX]

Angelo Monti

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

On pairwise compatibility graphs having Dilworth number k.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

On pairwise compatibility graphs having Dilworth number two.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

On Dilworth k Graphs and Their Pairwise Compatibility.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

2013

Exploring pairwise compatibility graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Graphs with Dilworth Number Two are Pairwise Compatibility Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

On the Pairwise Compatibility Property of some Superclasses of Threshold Graphs.

[BibT_eX]

[DOI]

Blerina Sinaimeri

Discret. Math. Algorithms Appl., 2013

Use Knowledge to Learn Faster: Topology Recognition with Advice.

[BibT_eX]

[DOI]

Emanuele Guido Fusco

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Learning a Ring Cheaply and Fast.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

How to Design an Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013

2012

On Relaxing the Constraints in Pairwise Compatibility Graphs.

[BibT_eX]

[DOI]

Blerina Sinaimeri

Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

2011

Recognition of Unigraphs through Superposition of Graphs.

[BibT_eX]

[DOI]

Alessandro Borri

J. Graph Algorithms Appl., 2011

The L(2, 1)-labeling of unigraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

L(2, 1)-Labeling of Unigraphs - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

2010

Bijective Linear Time Coding and Decoding for k-Trees.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Unified parallel encoding and decoding algorithms for Dandelion-like codes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2010

Parallel Algorithms for Encoding and Decoding Blob Code.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

2009

On the L(h, k)-labeling of co-comparability graphs and circular-arc graphs.

[BibT_eX]

[DOI]

Networks, 2009

Preface.

[BibT_eX]

[DOI]

Giuseppe F. Italiano

J. Discrete Algorithms, 2009

Recognition of Unigraphs through Superposition of Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Alessandro Borri

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Informative Labeling Schemes for the Least Common Ancestor Problem.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

Parallel Algorithms for Dandelion-Like Codes.

[BibT_eX]

[DOI]

Proceedings of the Computational Science, 2009

2008

A General Approach to L ( h, k )-Label Interconnection Networks.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2008

A Note on Algebraic Hypercube Colorings.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Information Technology: New Generations (ITNG 2008), 2008

Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

2007

On coding labeled trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

A Bijective Code for k -Trees with Linear Time Encoding and Decoding.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics, 2007

On the L(h, k)-Labeling of Co-comparability Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics, 2007

2006

Conflict-free star-access in parallel memory systems.

[BibT_eX]

[DOI]

Sajal K. Das

J. Parallel Distributed Comput., 2006

lambda-Coloring matrogenic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

Structure-Preserving Hierarchical Decompositions.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2005

A general approach to L(h, k)-label interconnection networks.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Graph Coloring with Distance Constraints.

[BibT_eX]

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005

String Coding of Trees with Locality and Heritability.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

L(h, 1)-labeling subclasses of planar graphs.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2004

Divider-based algorithms for hierarchical tree partitioning.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

A Unified Approach to Coding Labeled Trees.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Star-Coloring of Graphs for Conflict-Free Access to Parallel Memory Systems.

[BibT_eX]

[DOI]

Sajal K. Das

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003

Labeling trees with a condition at distance two.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

2002

Foreword.

[BibT_eX]

[DOI]

Gian Carlo Bongiovanni

Giorgio Gambosi

Theor. Comput. Sci., 2002

On max cut in cubic graphs.

[BibT_eX]

[DOI]

Parallel Algorithms Appl., 2002

L(2, 1)-Coloring Matrogenic Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

On the Radiocoloring Problem.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 2002

2001

Edge-clique graphs and the l-coloring problem.

[BibT_eX]

J. Braz. Comput. Soc., 2001

Tree partitioning via vertex deletion.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

LD-Coloring of Regular Tiling (Extended Abstract).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

L(2, 1)-labeling of planar graphs.

[BibT_eX]

[DOI]

Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

On the Validity of Hierarchical Decompositions.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

Hierarchical Clustering of Trees: Algorithms and Experiments.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000

Reversible Execution and Visualization of Programs with LEONARDO.

[BibT_eX]

[DOI]

J. Vis. Lang. Comput., 2000

A Simple Parallel Algorithm to Draw Cubic Graphs.

[BibT_eX]

[DOI]

Stephan Olariu

IEEE Trans. Parallel Distributed Syst., 2000

Computing Prüfer codes efficiently in parallel.

[BibT_eX]

[DOI]

Raymond Greenlaw

Discret. Appl. Math., 2000

1999

(n, e)-Graphs with maximum sum of squares of degrees.

[BibT_eX]

[DOI]

Uri N. Peled

J. Graph Theory, 1999

Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs.

[BibT_eX]

[DOI]

Simone Jannelli

J. Graph Algorithms Appl., 1999

Optimal Layout of Trivalent Cayley Interconnection Networks.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1999

A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing Science, 1999

1998

Orthogonally Drawing Cubic Graphs in Parallel.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1998

1997

A New 3D Representation of Trivalent Cayley Networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

An O(n³) Recognition Algorithm for Bithreshold Graphs.

[BibT_eX]

[DOI]

Algorithmica, 1997

LEONARDO: a software visualization system.

[BibT_eX]

Proceedings of the Workshop on Algorithm Engineering, 1997

1995

Recognizing Strict 2-Threshold Graphs in O(m) Time.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Erratum: Recognizing Strict 2-Threshold Graphs in O(m) Time.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Cubic Graphs.

[BibT_eX]

[DOI]

Raymond Greenlaw

ACM Comput. Surv., 1995

An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

Threshold Graphs and Synchronization Protocols.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics and Computer Science, 1995

Parallel Maximal Matching on Minimal Vertex Series Parallel Digraphs.

[BibT_eX]

[DOI]

Luca Baffi

Proceedings of the Algorithms, 1995

1992

On PVchunk Operations and Matrogenic Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1992

1990

Parallel Recognition Algorithms for Graphs with Restricted Neighbourhoods.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1990

On Line 2-Satisfiability.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1990

1989

Parallel-Depth Search for Acyclic Digraphs.

[BibT_eX]

[DOI]

Gian Carlo Bongiovanni

J. Parallel Distributed Comput., 1989

1988

Parallelism and the Feedback Vertex Set Problem.

[BibT_eX]

[DOI]

Daniel P. Bovet

Inf. Process. Lett., 1988

Adamant digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1988

1984

Degree sequences of matrogenic graphs.

[BibT_eX]

[DOI]

Discret. Math., 1984

1980

A Switching Algorithm for the Solution of Quadratic Boolean Equations.

[BibT_eX]

[DOI]