On the NP-hardness of GRacSim drawing and k-SEFE Problems - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Luca Grilli. On the NP-hardness of GRacSim drawing and k-SEFE Problems. J. Graph Algorithms Appl., 22(1):101-116, 2018. [doi]

@article{Grilli18,
  title = {On the NP-hardness of GRacSim drawing and k-SEFE Problems},
  author = {Luca Grilli},
  year = {2018},
  doi = {10.7155/jgaa.00456},
  url = {https://doi.org/10.7155/jgaa.00456},
  researchr = {https://researchr.org/publication/Grilli18},
  cites = {0},
  citedby = {0},
  journal = {J. Graph Algorithms Appl.},
  volume = {22},
  number = {1},
  pages = {101-116},
}

runs on WebDSL