Cornelis Hoede

Affiliations:
  • University of Twente, Enschede, Netherlands


According to our database1, Cornelis Hoede authored at least 23 papers between 1978 and 2008.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2008
Some families of integral graphs.
Discret. Math., 2008

Constructing Fifteen Infinite Classes of Nonregular Bipartite Integral Graphs.
Electron. J. Comb., 2008

2007
Integral trees of diameter 6.
Discret. Appl. Math., 2007

2006
A pattern selection algorithm for multi-pattern scheduling.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

A Column Arrangement Algorithm for a Coarse-grained Reconfigurable Architecture.
Proceedings of the 2006 International Conference on Engineering of Reconfigurable Systems & Algorithms, 2006

2005
Two Classes of Integral Regular Graphs.
Ars Comb., 2005

A Multi-Pattern Scheduling Algorithm.
Proceedings of The 2005 International Conference on Engineering of Reconfigurable Systems and Algorithms, 2005

2004
Integral complete r-partite graphs.
Discret. Math., 2004

2002
Degree sums and subpancyclicity in line graphs.
Discret. Math., 2002

2001
A Co-Marginalistic Contribution Value for Set Games.
IGTR, 2001

Word Graphs: The Third Set.
Proceedings of the Conceptual Structures: Broadening the Base, 2001

1999
A Comparison of Some Conditions for Non-Hamiltonicity of Graphs.
Ars Comb., 1999

Magic Labelings of Graphs.
Ars Comb., 1999

Another equivalent of the graceful tree conjecture.
Ars Comb., 1999

1998
Word Graphs: The Second Set.
Proceedings of the Conceptual Structures: Theory, 1998

1995
On the Ontology of Knowledge Graphs.
Proceedings of the Conceptual Structures: Applications, 1995

1994
Clique polynomials and independent set polynomials of graphs.
Discret. Math., 1994

1992
A characterization of consistent marked graphs.
J. Graph Theory, 1992

1989
Path graphs.
J. Graph Theory, 1989

1988
Hard graphs for the maximum clique problem.
Discret. Math., 1988

1981
Contraction theorems in Hamiltonian graph theory.
Discret. Math., 1981

1979
On an Optimality Property of Ternary Trees
Inf. Control., July, 1979

1978
On characterization of Hamiltonian graphs.
J. Comb. Theory, Ser. B, 1978


  Loading...