Kyle Burns

According to our database, Kyle Burns authored at least 2 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Introducing The Maximum Common Bigraph Problem.

Kyle Burns, Michele Sevegnani, Ciaran McCreesh, James Trimble

Proceedings of the Proceedings 16th International Workshop on Graph Computation Models, January, 2025

2021

Practical Bigraphs via Subgraph Isomorphism.

Blair Archibald, Kyle Burns, Ciaran McCreesh, Michele Sevegnani

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021