David Pokrass Jacobs

Elismar R. Oliveira

J. Comb. Theory B, 2021

2018

Eigenvalue location in cographs.

[BibT_eX]

[DOI]

Fernando Tura

Discret. Appl. Math., 2018

Locating the Eigenvalues for Graphs of Small Clique-Width.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Laplacian Distribution and Domination.

[BibT_eX]

[DOI]

Domingos M. Cardoso

Graphs Comb., 2017

2016

Domination number and Laplacian eigenvalue distribution.

[BibT_eX]

[DOI]

Eur. J. Comb., 2016

2015

A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets.

[BibT_eX]

[DOI]

K. E. Kennedy

Theor. Comput. Sci., 2015

Diagonalization of generalized lollipop graphs.

[BibT_eX]

[DOI]

Renata R. Del-Vecchio

Cybele T. M. Vinagre

Electron. Notes Discret. Math., 2015

2014

Computing the Characteristic Polynomial of Threshold Graphs.

[BibT_eX]

[DOI]

Fernando Tura

J. Graph Algorithms Appl., 2014

2013

Linear-Time Self-Stabilizing Algorithms for Disjoint Independent Sets.

[BibT_eX]

[DOI]

K. E. Kennedy

Comput. J., 2013

2012

A systematic approach to teaching abstraction and mathematical modeling.

[BibT_eX]

[DOI]

Charles T. Cook

Svetlana Drachova-Strang

Jason O. Hallstrom

Joseph E. Hollingsworth

Joan Krone

Murali Sitaraman

Proceedings of the Annual Conference on Innovation and Technology in Computer Science Education, 2012

2008

Distance- k knowledge in self-stabilizing algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Self-Stabilizing Graph Protocols.

[BibT_eX]

[DOI]

Zhenyu Xu

Parallel Process. Lett., 2008

Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

2006

Polynomial recognition of equal unions in hypergraphs with few vertices of large degree.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

Distance-k Information in Self-stabilizing Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2006

2005

Self-Stabilizing Algorithms For Orderings And Colorings.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Self-Stabilizing Global Optimization Algorithms for Large Network Graphs.

[BibT_eX]

[DOI]

Int. J. Distributed Sens. Networks, 2005

2004

Self-Stabilizing Maximal K-Dependent Sets In Linear Time.

[BibT_eX]

[DOI]

Martin Gairing

Parallel Process. Lett., 2004

Fault Tolerant Algorithms for Orderings and Colorings.

[BibT_eX]

[DOI]

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

2003

A search engine for 3D models.

[BibT_eX]

[DOI]

ACM Trans. Graph., 2003

Linear time self-stabilizing colorings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap.

[BibT_eX]

[DOI]

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Distributed Computing Systems Workshops (ICDCS 2003 Workshops), 2003

Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing - HiPC 2003, 10th International Conference, 2003

2002

Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

2001

Maximal matching stabilizes in time O(m).

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

An O(n2) Algorithm for the Characteristic Polynomial of a Tree.

[BibT_eX]

[DOI]

Catia Maria dos Santos Machado

Sandra Mitchell Hedetniemi

Electron. Notes Discret. Math., 2001

Domination Subdivision Numbers.

[BibT_eX]

[DOI]

Teresa W. Haynes

James A. Knisely

Lucas C. van der Merwe

Discuss. Math. Graph Theory, 2001

A note on equal unions in families of sets.

[BibT_eX]

[DOI]

Discret. Math., 2001

2000

Complexity of Recognizing Equal Unions in Families of Sets.

[BibT_eX]

[DOI]

J. Algorithms, 2000

A simple heuristic for maximizing service of carousel storage.

[BibT_eX]

[DOI]

John C. Peck

J. Steve Davis

Comput. Oper. Res., 2000

On the complexity of sign-nonsingularity and equal unions of sets.

[BibT_eX]

[DOI]

Alice A. McRae

Proceedings of the 38th Annual Southeast Regional Conference, 2000

1998

Independence and Irredundance in k-Regular Graphs.

[BibT_eX]

Ars Comb., 1998

1997

A Course in Computational Nonassociative Algebra.

[BibT_eX]

[DOI]

J. Symb. Comput., 1997

1996

Maximal Irredundant Functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

1994

The Private Neighbor Cube.

[BibT_eX]

[DOI]

Michael R. Fellows

SIAM J. Discret. Math., 1994

Undecidability of Winkler's r-Neighborhood Problem for Covering Digraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

The Albert Nonassociative Algebra System: A Progress Report.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

1993

The Word Problem for Free Partially Commutative, Partially Associative Groupoids.

[BibT_eX]

[DOI]

Sekhar V. Muddana

J. Symb. Comput., 1993

Experimenting with the Identity (xy)z = y(zx).

[BibT_eX]

[DOI]

Sekhar V. Muddana

J. Symb. Comput., 1993

Efficient Sets in Graphs.

[BibT_eX]

[DOI]

Philip J. Bernhard

Discret. Appl. Math., 1993

1992

A condition Guaranteeing Commutativity.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1992

Fast Change of Basis in Algebras.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1992

1991

Probabilistic Checking of Associativity in Algebras.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

1990

Complexity and Unsolvability Properties of Nilpotency.

[BibT_eX]

[DOI]

SIAM J. Comput., 1990

On the computational complexity of upper fractional domination.

[BibT_eX]

[DOI]

Grant A. Cheston

Discret. Appl. Math., 1990

1988

A Practical Solution for a Large Sparse Matrix.

[BibT_eX]

[DOI]

David J. Pokrass

Softw. Pract. Exp., 1988

Verification of Non-Identities in Algebras.

[BibT_eX]

[DOI]