Jesper Makholm Byskov

According to our database1, Jesper Makholm Byskov authored at least 4 papers between 2003 and 2005.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2005
New algorithms for Exact Satisfiability.
Theor. Comput. Sci., 2005

On the number of maximal bipartite subgraphs of a graph.
J. Graph Theory, 2005

2004
Enumerating maximal independent sets with applications to graph colouring.
Oper. Res. Lett., 2004

2003
Algorithms for k-colouring and finding maximal independent sets.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003


  Loading...