IPC: A Benchmark Data Set for Learning with Graph-Structured Data

Complexity results for SAS +

Bäckström, C. and Nebel, B · 1995

Earlier work this paper cites.

The 1998 AI Planning Systems competition

McDermott, D · 2000

Earlier work this paper cites.

Concise finite-domain representations for PDDL planning tasks

Helmert, M · 2009

Earlier work this paper cites.

Exploiting problem symmetries in state-based planners

Pochter, N., Zohar, A., and Rosenschein, J. S · 2011

Earlier work this paper cites.

Heuristics and symmetries in classical planning

Shleyfman, A., Katz, M., Helmert, M., Sievers, S., and Wehrle, M · 2015

Earlier work this paper cites.

Benchmark data sets for graph kernels, 2016

Kersting, K., Kriege, N. M., Morris, C., Mutzel, P., and Neumann, M · 2016

Cited alongside, same era.

Gated graph sequence neural networks

Li, Y., Tarlow, D., Brockschmidt, M., and Zemel, R · 2016

Cited alongside, same era.

Semi-supervised classification with graph convolutional networks

Kipf, T. N. and Welling, M · 2017

Cited alongside, same era.

Delfi: Online planner selection for cost-optimal planning

Katz, M., Sohrabi, S., Samulowitz, H., and Sievers, S · 2018

Cited alongside, same era.

Deeper insights into graph convolutional networks for semi-supervised learning

Li, Q., Han, Z., and Wu, X.-M · 2018

Cited alongside, same era.

Representation learning on graphs with jumping knowledge networks

Original

Xu, K., Li, C., Tian, Y., Sonobe, T., ichi Kawarabayashi, K., and Jegelka, S · 2018

Later among the works it cites.

Predict then propagate: Graph neural networks meet personalized pagerank

Klicpera, J., Bojchevski, A., and Günnemann, S · 2019

Closest in time.

Deep learning for cost-optimal planning: Task-dependent planner selection

Sievers, S., Katz, M., Sohrabi, S., Samulowitz, H., and Ferber, P · 2019

Closest in time.

Theoretical foundations for structural symmetries of lifted pddl tasks

Sievers, S., Röger, G., Wehrle, M., and Katz, M · 2019

Closest in time.